VictorTaelin / Elementary-Affine-Core-legacy
A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
☆17Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for Elementary-Affine-Core-legacy
- Minimal, efficient proof language☆14Updated 5 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago
- ☆36Updated 3 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Base Formality libraries☆9Updated 5 years ago
- Specification of the Formality proof and programming language☆40Updated last year
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 5 years ago
- Thoughts and stuff☆67Updated 4 years ago
- ☆36Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Haskell implementation of interaction net-based lambda evaluation☆16Updated 8 years ago
- Absal ex☆55Updated last year
- Standard library for the Formality language☆18Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- An extended typed Lambda Calculus☆20Updated 3 months ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago