atennapel / practical-type-inference
Implementation of "practical type inference for arbitrary-rank types" in Javascript
☆10Updated 5 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
- Kempe is a compiled stack-based language☆58Updated 5 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Example row-polymorphism implementations☆61Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆62Updated last year
- Macro Lambda Calculus☆46Updated 5 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
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 10 months ago
- A bidirectional type checker☆60Updated 7 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆37Updated 2 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- ☆35Updated 6 years ago
- A WIP little dependently-typed systems language☆41Updated 7 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- a functional programming language with algebraic effects and handlers☆81Updated 3 weeks ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Build system☆123Updated last year
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆60Updated 3 years ago
- Dependent type checker using normalisation by evaluation☆257Updated 6 months ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Javascript implementation of "Complete and Easy Bidirectional Type Checking for Higher-Rank Polymorphism"☆75Updated 7 months ago
- ☆39Updated 7 months ago