VictorTaelin / Elementary-Affine-Type-Theory-legacyLinks
Minimal, efficient proof language
☆14Updated 6 years ago
Alternatives and similar repositories for Elementary-Affine-Type-Theory-legacy
Users that are interested in Elementary-Affine-Type-Theory-legacy are comparing it to the libraries listed below
Sorting:
- A nano "theorem prover".☆62Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 weeks ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Calculus of Constructions☆17Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆37Updated 12 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago