⒯ TypeForge

Hindley-Milner type inference (Algorithm W) with a replayable derivation trail GitHub ↗

Tyl source

Derivation replay

ms/step

Examples

Let-polymorphism: each use of a let-bound name gets a fresh instantiation. The occurs check rejects infinite types. Builtins (head/tail) are generalized schemes.