SimonJF / mbcheckLinks
Implementation of typechecker from paper "Special Delivery: Programming with Mailbox Types"
☆18Updated last month
Alternatives and similar repositories for mbcheck
Users that are interested in mbcheck are comparing it to the libraries listed below
Sorting:
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- 🩺 A library for compiler diagnostics☆47Updated 2 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 4 months ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 5 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A formalization of System Fω in Agda☆19Updated 7 months ago
- A Deductive Verification Tool for OCaml Programs☆75Updated this week
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Language mixing functional programming and Ambient Calculus☆10Updated 10 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
- A pretty-printing combinator library for OCaml☆51Updated last year
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A toy dependent typed language.☆32Updated this week
- ☆12Updated 5 months ago
- A TOML parser for Idris 2☆17Updated last year
- Efficient binder representation in OCaml☆43Updated last year
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 2 months 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
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- Anders: Cubical Type Checker☆23Updated last year
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago