contificate / match
Match compilation algorithm in OCaml
☆25Updated 2 months ago
Alternatives and similar repositories for match:
Users that are interested in match are comparing it to the libraries listed below
- Fωμ type checker and compiler☆54Updated 2 years ago
- A toy dependent typed language.☆28Updated 2 weeks ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆45Updated 2 months ago
- A simple functional programming language.☆21Updated 3 years ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- a self-hosting lambda calculus compiler☆35Updated last month
- 🩺 A library for compiler diagnostics☆44Updated 3 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- ☆16Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 3 months ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- ☆17Updated last year
- Kempe is a compiled stack-based language☆58Updated 7 months ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A Teeny Type Theory☆26Updated 2 years ago
- ☆35Updated last year
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- An experimental language server for SomewhatML☆24Updated 2 years ago