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:
- ICFP tutorial☆39Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- IO using sized types and copatterns☆35Updated 4 years ago