jfecher / algorithm-j
A minimal implementation of Hindley-Milner's Algorithm J in OCaml
☆60Updated 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
- Playing with type systems☆49Updated 2 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 2 months ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- A toy dependent typed language.☆28Updated this week
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆38Updated 3 months ago
- A WIP little dependently-typed systems language☆41Updated 7 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆42Updated last month
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- A toy language based on LLVM that implements the System Fω type-system☆107Updated last year
- A deterministic parser with fused lexing☆72Updated last year
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Fωμ type checker and compiler☆52Updated 2 years ago
- A pretty-printing combinator library for OCaml☆49Updated 7 months ago
- high-performance cubical evaluation☆70Updated 4 months ago
- 🩺 A library for compiler diagnostics☆39Updated last month
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- The LLVM tutorial using OCaml☆61Updated 4 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A minimal compiler written in OCaml that compiles Tiger to LLVM IR then to assembly code☆27Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Pure functional programming with whole-program mutability inference☆65Updated last week