VictorTaelin / Elementary-Affine-Type-Theory-legacy
Minimal, efficient proof language
☆14Updated 5 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
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Base Formality libraries☆9Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Agda libraries relevant to Moonad☆14Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago