bynect / algorithm-wLinks
Type inference implementation in OCaml using Algorithm W
☆10Updated 4 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:
- Fωμ type checker and compiler☆56Updated 2 years ago
- Playing with type systems☆51Updated 11 months ago
- Prototype for https://github.com/Innf107/vega☆19Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆65Updated 3 weeks ago
- Accompanying materials for "A Core Calculus for Documents"☆35Updated 2 years 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 library for compiler diagnostics☆47Updated 2 weeks ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- OCaml plus Jane Street extensions☆73Updated last year
- 🦠 Reusable components based on algebraic effects☆51Updated 2 weeks ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A toy language based on LLVM that implements the System Fω type-system☆113Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Purely functional GUI algebra☆80Updated 8 months ago
- A verified compiler for a lazy functional language☆36Updated 2 weeks ago
- A fancy diagnostics library that allows your compilers to exit with grace☆87Updated last week
- ☆44Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- A template for you to implement Hazelnut yourself☆22Updated 4 months ago
- dependent type theory experiment☆26Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Tina, a programming language with typed algebraic effects and handlers.☆13Updated 4 years ago
- A formalization of System Fω in Agda☆20Updated 9 months ago
- Match compilation algorithm in OCaml☆31Updated 9 months ago
- A simple λProlog interpreter☆20Updated 4 years ago
- How do you do that recursive GADT thing again?☆29Updated last year
- ☆37Updated last year
- ☆16Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago