34 stable releases (6 major)

7.0.1 Dec 15, 2023
6.2.1 Jan 4, 2022
6.2.0 Sep 28, 2021
6.1.1 Mar 2, 2019
1.2.6 Mar 2, 2018

#259 in Data structures


Used in programinduction

MIT license

63KB
702 lines

polytype

Build Status crates.io docs.rs

A Hindley-Milner polymorphic typing system. Implements type inference via unification.

Usage

[dependencies]
polytype = "7.0"

polytype provides the TypeScheme and Type enums, the Context struct, and the tp! and ptp! macros which help to concisely create types and type schemes.

Unification:

let mut ctx = Context::default();

// t1: list(int → α) ; t2: list(β → bool)
let t1 = tp!(list(tp!(@arrow[tp!(int), tp!(0)])));
let t2 = tp!(list(tp!(@arrow[tp!(1), tp!(bool)])));
ctx.unify(&t1, &t2).expect("unifies");

let t1 = t1.apply(&ctx);
let t2 = t2.apply(&ctx);
assert_eq!(t1, t2); // list(int → bool)

Apply a type context:

let mut ctx = Context::default();
// assign t0 to int
ctx.extend(0, tp!(int));

let t = tp!(list(tp!(0)));
assert_eq!(t.to_string(), "list(t0)");
let t = t.apply(&ctx);
assert_eq!(t.to_string(), "list(int)");

Instantiate a TypeScheme:

let mut ctx = Context::default();

// ∀α. list(α)
let scheme = ptp!(3; tp!(list(tp!(3))));

// They instantiate to new fresh type variables
let t1 = scheme.instantiate(&mut ctx);
let t2 = scheme.instantiate(&mut ctx);
assert_eq!(t1.to_string(), "list(t0)");
assert_eq!(t2.to_string(), "list(t1)");

See the documentation for more details.

Features

By default polytype includes a type parser that can be invoked with str::parse. This can be disabled with default-features = false.

Dependencies

~2.3–7MB
~50K SLoC