bynect / algorithm-wLinks
Type inference implementation in OCaml using Algorithm W
☆10Updated 3 years ago
Alternatives and similar repositories for algorithm-w
Users that are interested in algorithm-w are comparing it to the libraries listed below
Sorting:
- Playing with type systems☆51Updated 6 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆53Updated 5 months ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A fancy diagnostics library that allows your compilers to exit with grace☆76Updated 3 months ago
- How do you do that recursive GADT thing again?☆28Updated last year
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- OCaml plus Jane Street extensions☆74Updated last year
- Purely functional GUI algebra☆78Updated 3 months ago
- Prototype for https://github.com/Innf107/vega☆19Updated 11 months ago
- Match compilation algorithm in OCaml☆27Updated 4 months ago
- A template for you to implement Hazelnut yourself☆22Updated this week
- A pure type system implemented in OCaml☆78Updated 4 years ago
- 🩺 A library for compiler diagnostics☆46Updated 5 months ago
- 🦠 Reusable components based on algebraic effects☆51Updated 9 months ago
- The LLVM tutorial using OCaml☆61Updated 5 years ago
- Tools for record-and-replay debugging☆43Updated 2 years ago
- A Deductive Verification Tool for OCaml Programs☆73Updated last month
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- A toy language based on LLVM that implements the System Fω type-system☆110Updated last year
- A pretty-printing combinator library for OCaml☆51Updated 11 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- My Attempt at System Fω with Row-Polymorphism☆30Updated 4 years ago
- Reference compiler for c0☆36Updated last month
- ☆43Updated 3 years ago
- SKI combinators☆55Updated 8 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago