contificate / match
Match compilation algorithm in OCaml
☆24Updated last month
Alternatives and similar repositories for match:
Users that are interested in match are comparing it to the libraries listed below
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆43Updated 2 months ago
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- A simple functional programming language.☆21Updated 3 years ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 2 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A toy dependent typed language.☆28Updated 2 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- source code for the bondi programming language☆40Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆28Updated 2 weeks ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Example row-polymorphism implementations☆61Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆10Updated 11 months ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Experimental functional language☆17Updated 2 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- SPJ's tutorial on implementing functional languages☆29Updated 5 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- A deterministic parser with fused lexing☆72Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- ☆34Updated last year