mishun / henk2000Links
Pure Type Systems for Functional Programming
☆11Updated 11 years ago
Alternatives and similar repositories for henk2000
Users that are interested in henk2000 are comparing it to the libraries listed below
Sorting:
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 weeks ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ICFP tutorial☆39Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- ☆21Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Austin's supercompiler work☆21Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago