VictorTaelin / formality-agda-lib-legacy
Agda libraries relevant to Moonad
☆14Updated 6 years ago
Alternatives and similar repositories for formality-agda-lib-legacy:
Users that are interested in formality-agda-lib-legacy are comparing it to the libraries listed below
- Minimal, efficient proof language☆14Updated 5 years ago
- Base Formality libraries☆9Updated 6 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Absal ex☆57Updated 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
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A simple, purely-functional programming language☆25Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Haskell implementation of interaction net-based lambda evaluation☆20Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- ☆35Updated 6 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- ☆36Updated 3 years ago
- ☆23Updated 7 years ago
- ☆30Updated 6 years ago