VictorTaelin / Elementary-Affine-Type-Theory-legacy
Minimal, efficient proof language
☆14Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for Elementary-Affine-Type-Theory-legacy
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago
- Base Formality libraries☆9Updated 5 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Specification of the Formality proof and programming language☆40Updated last year
- A nano "theorem prover".☆61Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- ☆28Updated 6 years ago
- Session types in Idris2!☆27Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆23Updated 6 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago