Alternatives and similar repositories for path

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

• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 8 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 8 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 months ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆36Updated last year
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 9 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 6 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆116Updated 4 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• valis / hoq
  A language based on homotopy type theory with an interval
  ☆84Updated 10 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 2 weeks ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆55Updated 8 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 4 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆69Updated 4 months ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆37Updated 5 years ago
• oinoom / Core
  compile your own functional language
  ☆36Updated 6 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆76Updated 7 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆87Updated 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