soren-n / bidi-higher-rank-polyLinks
Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" written in OCaml
☆22Updated 4 years ago
Alternatives and similar repositories for bidi-higher-rank-poly
Users that are interested in bidi-higher-rank-poly are comparing it to the libraries listed below
Sorting:
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Algebraic structures in OCaml.☆25Updated this week
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- A type-safe, stack-based functional programming language☆16Updated 7 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 5 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated last month
- 🩺 A library for compiler diagnostics☆47Updated last month
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- algebraic typechecking and elaboration of type systems☆13Updated 8 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- ☆11Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Delimited continuations in byte-code and native OCaml☆27Updated 4 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last month
- A pretty-printing combinator library for OCaml☆51Updated last year
- My Attempt at System Fω with Row-Polymorphism☆30Updated 4 years ago
- A stack-driven generator of arbitrary WebAssembly programs☆19Updated 4 years ago
- Efficient binder representation in OCaml☆43Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago