jfecher / algorithm-jLinks
A minimal implementation of Hindley-Milner's Algorithm J in OCaml
☆63Updated 3 years ago
Alternatives and similar repositories for algorithm-j
Users that are interested in algorithm-j are comparing it to the libraries listed below
Sorting:
- Playing with type systems☆51Updated 5 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A toy dependent typed language.☆29Updated last week
- 🩺 A library for compiler diagnostics☆46Updated 3 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆51Updated 3 months ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- A deterministic parser with fused lexing☆73Updated last year
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆39Updated 5 months ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Demo for dependent types + runtime code generation☆69Updated 3 months ago
- high-performance cubical evaluation☆72Updated last month
- ☆33Updated 7 months ago
- a proof-of-concept programming language based on call-by-push-value☆53Updated this week
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 4 months ago
- A pretty-printing combinator library for OCaml☆51Updated 9 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 5 months ago
- Staged compilation with dependent types☆173Updated 3 weeks ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- A fancy diagnostics library that allows your compilers to exit with grace☆74Updated last month
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago