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
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- ICFP tutorial☆39Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 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)☆15Updated 7 years ago
- IO using sized types and copatterns☆35Updated 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
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Updated last year
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- KU Leuven Haskell Compiler☆15Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- being an experiment with potato power☆23Updated 5 years ago