evertedsphere / how-to-implement-dependent-type-theory
A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
☆38Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for how-to-implement-dependent-type-theory
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Austin's supercompiler work☆21Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- KU Leuven Haskell Compiler☆16Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 6 months ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- An experimental intermediate language for GHC☆37Updated 7 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Physical dimensions and operations☆9Updated 6 years ago
- Folds for recursive types with GHC Generics☆26Updated 4 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 8 years ago
- being an experiment with potato power☆23Updated 4 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year