Alternatives and similar repositories for linear-algebra

Users that are interested in linear-algebra are comparing it to the libraries listed below

• Mesabloo / jellyvm
  A VM written following the Linear Abstract Machine architecture
  ☆22Updated 6 years ago
• zilch-lang / nstar
  The compiler for N⋆, a statically typed assembly language used as a compiler backend for Zilch
  ☆30Updated 2 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆58Updated 2 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆61Updated 6 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• SimonHauguel / Paso
  Paso is a meta and functional programming language with a strong static inferred and iso-polymorphic type system
  ☆29Updated 3 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• Mesabloo / nihil
  Nihil, a statically typed interpreted functional programming language
  ☆69Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆34Updated 8 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• frex-project / idris-frex
  ☆51Updated 3 months ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 2 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• habit-lang / alb
  ☆39Updated last year
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 3 years ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆41Updated 8 years ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆46Updated 4 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 3 months ago
• meta-logic / sequoia-v0
  Design, play with, and analyze sequent calculus proof systems.
  ☆14Updated last year
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 11 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated this week
• jmlowenthal / agda-c
  Verified C programming in Agda
  ☆16Updated 4 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago