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:
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- ICFP tutorial☆39Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Map lazy functional language constructs to LLVM IR☆52Updated 6 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Austin's supercompiler work☆21Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 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 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago