jfecher / algorithm-j
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
- Playing with type systems☆50Updated 4 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆39Updated 4 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆45Updated 2 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A toy dependent typed language.☆28Updated last week
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- high-performance cubical evaluation☆72Updated last week
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 3 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆29Updated 4 years 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☆108Updated last year
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- a proof-of-concept programming language based on Call-by-push-value☆53Updated 3 weeks ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 4 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- A minimal compiler written in OCaml that compiles Tiger to LLVM IR then to assembly code☆27Updated 2 years ago
- A deterministic parser with fused lexing☆72Updated last year
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A collection of programming languages and type systems.☆33Updated 8 months ago
- Staged compilation with dependent types☆171Updated 2 weeks ago
- WIP stack language that uses regex for control flow☆42Updated last year
- A WIP little dependently-typed systems language☆41Updated 8 months ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆89Updated 6 years ago