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:
- System F implemented in Haskell☆24Updated 13 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 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
- ICFP tutorial☆39Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- KU Leuven Haskell Compiler☆15Updated 3 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- A library for doing generic programming in Agda☆32Updated 4 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
- Mtac in Agda☆28Updated 4 years ago
- ☆23Updated last year
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Dependently typed elimination functions using singletons☆28Updated 6 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago