VictorTaelin / Elementary-Affine-Core-legacy
A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
☆17Updated 5 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
- Minimal, efficient proof language☆14Updated 5 years ago
- Base Formality libraries☆9Updated 6 years ago
- ☆36Updated 3 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 6 years ago
- Agda libraries relevant to Moonad☆14Updated 6 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Absal ex☆57Updated last year
- Category theory and algebra☆28Updated 8 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- ☆35Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- ☆16Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Distributed Protocol Combinators☆13Updated 3 years ago
- Thoughts and stuff☆68Updated 4 years ago