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☆54Updated 2 years ago
- Playing with type systems☆51Updated 8 months ago
- How do you do that recursive GADT thing again?☆28Updated last year
- Purely functional GUI algebra☆79Updated 5 months ago
- A template for you to implement Hazelnut yourself☆22Updated 2 months ago
- A fancy diagnostics library that allows your compilers to exit with grace☆80Updated 3 weeks ago
- 🩺 A library for compiler diagnostics☆47Updated last month
- A pretty-printing combinator library for OCaml☆51Updated last year
- A Deductive Verification Tool for OCaml Programs☆75Updated last month
- OCaml plus Jane Street extensions☆73Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 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 pure type system implemented in OCaml☆78Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated last month
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- My Attempt at System Fω with Row-Polymorphism☆30Updated 4 years ago
- algebraic typechecking and elaboration of type systems☆13Updated 7 months ago
- Prototype for https://github.com/Innf107/vega☆19Updated last year
- Match compilation algorithm in OCaml☆30Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated last week
- ☆44Updated 3 years ago
- ☆17Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A toy language based on LLVM that implements the System Fω type-system☆113Updated 2 years ago
- Purely Functional, Real-Time Deques with Catenation (Kaplan & Tarjan)☆121Updated last year
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- SKI combinators☆55Updated 8 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 4 months ago