evertedsphere / how-to-implement-dependent-type-theory
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:
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Modern compiler implementation in ML, in Haskell☆16Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- Unpinned byte arrays in GHC haskell☆22Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- ☆23Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- KU Leuven Haskell Compiler☆15Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- Deep embedding of imperative programs with code generation☆23Updated 2 years ago