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:
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- A nano "theorem prover".☆62Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Where my everyday research happens☆54Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Template for Hindley-Milner based languages☆39Updated 3 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 3 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Build tool for ATS.☆42Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆113Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Example row-polymorphism implementations☆61Updated last year