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:
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- Idris, but it's C☆24Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- ICFP tutorial☆39Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago