BookOwl / type-inferenceLinks
Hindley Milner Type Inference in Rust
☆12Updated 8 years ago
Alternatives and similar repositories for type-inference
Users that are interested in type-inference are comparing it to the libraries listed below
Sorting:
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 9 years ago
- A WIP little dependently-typed systems language☆41Updated last year
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆99Updated 3 years ago
- A Hindley-Milner polymorphic typing system☆59Updated last year
- A MinCaml compiler implemented in Rust☆44Updated 2 years ago
- A visual interpreter of the template instantiation machine to understand evaluation of lazy functional languages☆71Updated 8 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- A simple ML-like programming language with subtyping and full type inference.☆180Updated 10 months ago
- Dependently-typed lambda calculus, Mini-TT, extended and implemented in Rust☆120Updated 5 years ago
- implementation of Pure Type Systems (PTS) in Rust.☆51Updated 8 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- Ordo: A minimalist language with row polymorphism☆85Updated 6 months ago
- A programming language somewhat resembling cellular processes.☆34Updated 3 years ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆117Updated 6 years ago
- Macros have types!☆132Updated 2 years ago
- ☆35Updated 7 years ago
- ☆89Updated 4 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- Automagical variable binding library for Rust☆68Updated 6 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Sruth Lùbach: A toy optimization engine☆23Updated 4 years ago
- Alternative algorithm for algebraic subtyping.☆170Updated 3 weeks ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆74Updated 3 years ago
- The Next Generation of Compositional Programming☆54Updated last month
- Dependently-typed row-polymorphic programming language, evolved from minitt-rs☆99Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Fungi: Typed incremental computation with names☆70Updated 6 years ago
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 5 years ago