Alternatives and similar repositories for path

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

• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆37Updated 4 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 8 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆82Updated last year
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• aherrmann / simply_llvm
  ☆41Updated 8 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆69Updated 2 months ago
• patrickt / fastsum
  A fast open-union type, suitable for 100+ contained alternatives.
  ☆99Updated last year
• tweag / linear-types
  Drafts, notes and resources for adding linear typing to GHC.
  ☆79Updated 5 years ago
• valis / hoq
  A language based on homotopy type theory with an interval
  ☆83Updated 10 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• evincarofautumn / Toody
  A two-dimensional parser combinator library.
  ☆41Updated 8 years ago
• oinoom / Core
  compile your own functional language
  ☆36Updated 6 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 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
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated last year
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 5 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 9 months ago
• sdiehl / dive-into-ghc
  Dive into GHC
  ☆82Updated 8 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆85Updated 2 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago