atennapel / practical-type-inferenceLinks
Implementation of "practical type inference for arbitrary-rank types" in Javascript
☆10Updated 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:
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆51Updated 3 months ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 8 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- a functional programming language with algebraic effects and handlers☆82Updated 3 months ago
- A bidirectional type checker☆63Updated 7 years ago
- Example row-polymorphism implementations☆61Updated last year
- A simple implementation of linear type theory☆38Updated 8 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
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆62Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- A toy dependent typed language.☆29Updated 2 weeks ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆39Updated 5 months ago
- A simple functional programming language.☆21Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- ☆33Updated 7 months ago
- Macro Lambda Calculus☆49Updated 6 years ago
- Build system☆123Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆63Updated 3 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago