atennapel / practical-type-inferenceLinks
Implementation of "practical type inference for arbitrary-rank types" in Javascript
☆12Updated 6 years ago
Alternatives and similar repositories for practical-type-inference
Users that are interested in practical-type-inference are comparing it to the libraries listed below
Sorting:
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆70Updated last year
- A minimal pure functional language based on self dependent types.☆73Updated 3 years ago
- Javascript implementation of "Complete and Easy Bidirectional Type Checking for Higher-Rank Polymorphism"☆79Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆66Updated last month
- a functional programming language with algebraic effects and handlers☆82Updated 10 months ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆48Updated last year
- A pure type system implemented in OCaml☆78Updated 5 years ago
- A bidirectional type checker☆66Updated 8 years ago
- Dependent type checker using normalisation by evaluation☆270Updated last year
- Full Source Code for Making a Language series☆62Updated 2 weeks ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- Example row-polymorphism implementations☆61Updated 2 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Alternative algorithm for algebraic subtyping.☆171Updated last month
- Ordo: A minimalist language with row polymorphism☆85Updated 9 months ago
- Build system☆132Updated 2 months ago
- A WIP little dependently-typed systems language☆41Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆62Updated last year
- ☆90Updated 4 years ago
- A simple ML-like programming language with subtyping and full type inference.☆187Updated last year
- Match compilation algorithm in OCaml☆34Updated 10 months ago
- PROTOTYPE: A minimal scripting language - OOP via lambda functions and pattern matching☆54Updated 8 years ago
- Frank compiler☆303Updated last year
- Pure functional programming with whole-program mutability inference☆79Updated 3 weeks ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Macro Lambda Calculus☆50Updated 6 years ago