sconybeare / mltt
Implementation of Martin-Löf Type Theory in Haskell
☆16Updated 8 years ago
Related projects: ⓘ
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 9 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A library for doing generic programming in Agda☆28Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- A usable type system for call by push-value☆28Updated 4 years ago
- A small NuPRL style proof assistant☆32Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- being an experiment with potato power☆23Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- "operating system" based on the calculus of constructions☆17Updated 2 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Mtac in Agda☆28Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- The Prettiest Printer☆35Updated 7 months ago
- ☆25Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago