VictorTaelin / formality-agda-lib-legacyLinks
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
Sorting:
- Minimal, efficient proof language☆14Updated 6 years ago
- Base Formality libraries☆9Updated 6 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Absal ex☆57Updated last year
- A nano "theorem prover".☆62Updated 6 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- ☆36Updated 3 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Calculus of Constructions☆17Updated 5 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Lecture notes for teaching Haskell to those who want to read it☆55Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 6 years ago
- For parts of https://www.ats-lang.org☆27Updated 3 weeks ago
- Deep evaluation of data structures☆41Updated 8 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Simplified Observational Type Theory☆82Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆23Updated 7 years ago
- Lens combinators for fused-effects.☆17Updated 4 years ago