Alternatives and similar repositories for path

Users that are interested in path are comparing it to the libraries listed below

• bobatkey / sott
  Simplified Observational Type Theory
  ☆83Updated 2 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆65Updated 6 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 6 years ago
• valis / hoq
  A language based on homotopy type theory with an interval
  ☆83Updated 10 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 8 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• agda-attic / agda-frp-js
  ECMAScript back end for Functional Reactive Programming in Agda
  ☆104Updated 7 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 3 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 8 months ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 5 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆90Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated last year
• llelf / icfp2019-papers
  ICFP 2019 preprints/papers
  ☆44Updated 5 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 7 years ago