VictorTaelin / formality-agda-lib-legacy
Agda libraries relevant to Moonad
☆14Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for formality-agda-lib-legacy
- Minimal, efficient proof language☆14Updated 5 years ago
- Base Formality libraries☆9Updated 5 years ago
- Specification of the Formality proof and programming language☆40Updated last year
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- Absal ex☆55Updated last year
- Calculus of Constructions☆17Updated 5 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- ☆36Updated 6 years ago
- Package manager for Idris☆35Updated 2 years ago
- ☆36Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Automatic piecewise-mutable references for your types☆43Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Haskell implementation of interaction net-based lambda evaluation☆16Updated 8 years ago