gergoerdi / hm-compo
Compositional type checking for a Hindley-Milner type system
☆11Updated 7 years ago
Alternatives and similar repositories for hm-compo:
Users that are interested in hm-compo are comparing it to the libraries listed below
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 4 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆23Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Modern compiler implementation in ML, in Haskell☆16Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆20Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ☆29Updated 9 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Haskell library of algebraic topology☆23Updated 13 years ago
- ☆26Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Updated 6 years ago