sconybeare / mlttLinks
Implementation of Martin-Löf Type Theory in Haskell
☆16Updated 9 years ago
Alternatives and similar repositories for mltt
Users that are interested in mltt are comparing it to the libraries listed below
Sorting:
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- ICFP tutorial☆39Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆21Updated last month
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 weeks ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- ☆26Updated 8 years ago