evertedsphere / how-to-implement-dependent-type-theoryLinks
A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
☆38Updated 5 years ago
Alternatives and similar repositories for how-to-implement-dependent-type-theory
Users that are interested in how-to-implement-dependent-type-theory are comparing it to the libraries listed below
Sorting:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 6 months ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 weeks ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Agda-style equational reasoning in Haskell☆53Updated 2 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago