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
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ICFP tutorial☆39Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- ☆39Updated 11 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago