Alternatives and similar repositories for sound-and-complete

Users that are interested in sound-and-complete are comparing it to the libraries listed below

• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago
• jfaure / lfvm-stg
  Map lazy functional language constructs to LLVM IR
  ☆51Updated 6 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated last month
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆46Updated 3 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 4 years ago
• mbg / hindley-milner
  Template for Hindley-Milner based languages
  ☆39Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆61Updated 6 years ago
• aherrmann / simply_llvm
  ☆41Updated 8 years ago
• robrix / path
  A lambda calculus to explore type-directed program synthesis.
  ☆85Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 3 months ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆86Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆126Updated last year
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• evincarofautumn / Toody
  A two-dimensional parser combinator library.
  ☆41Updated 8 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆113Updated 2 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆69Updated 2 months ago
• andgate / type-theory-compiler
  Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…
  ☆44Updated 6 years ago
• gergoerdi / universe-of-syntax
  A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…
  ☆16Updated 7 years ago