jfecher / algorithm-j
A minimal implementation of Hindley-Milner's Algorithm J in OCaml
☆56Updated 2 years ago
Alternatives and similar repositories for algorithm-j:
Users that are interested in algorithm-j are comparing it to the libraries listed below
- Playing with type systems☆48Updated 2 weeks ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Fωμ type checker and compiler☆52Updated last year
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆36Updated last month
- A dependently typed programming language with direct style effects and linearity☆19Updated 5 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A pure type system implemented in OCaml☆77Updated 4 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated this week
- A WIP little dependently-typed systems language☆40Updated 5 months ago
- 🩺 A library for compiler diagnostics☆37Updated 3 weeks ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- A deterministic parser with fused lexing☆72Updated last year
- A fancy diagnostics library that allows your compilers to exit with grace☆70Updated 7 months ago
- A toy dependent typed language.☆24Updated this week
- Demo for dependent types + runtime code generation☆64Updated last month
- high-performance cubical evaluation☆69Updated last month
- ♾️ A library for universe levels and universe polymorphism☆34Updated last month
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- A pretty-printing combinator library for OCaml☆49Updated 5 months ago
- A Language with Dependent Data and Codata Types☆76Updated this week
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆25Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- Dromedary is an experimental subset of OCaml, using constraint-based type inference!☆48Updated 2 months ago
- ☆29Updated 3 months ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- A toy language based on LLVM that implements the System Fω type-system☆103Updated last year
- 🦠 Reusable components based on algebraic effects☆48Updated 3 months ago