VictorTaelin / Elementary-Affine-Core-legacyLinks
A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
☆17Updated 6 years ago
Alternatives and similar repositories for Elementary-Affine-Core-legacy
Users that are interested in Elementary-Affine-Core-legacy are comparing it to the libraries listed below
Sorting:
- ☆36Updated 3 years ago
- Minimal, efficient proof language☆14Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- An upcoming operating system built on Type-Theory☆43Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Thoughts and stuff☆70Updated 5 years ago
- Haskell implementation of interaction net-based lambda evaluation☆21Updated 9 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- ☆35Updated 7 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Calculus of Constructions☆17Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago