adamgundry/type-inference
Unification and type inference algorithms
{ "createdAt": "2013-07-23T17:10:41Z", "defaultBranch": "master", "description": "Unification and type inference algorithms", "fullName": "adamgundry/type-inference", "homepage": "http://adam.gundry.co.uk/pub/thesis/", "language": "Haskell", "name": "type-inference", "pushedAt": "2015-02-21T11:25:36Z", "stargazersCount": 125, "topics": [], "updatedAt": "2025-03-11T04:15:15Z", "url": "https://github.com/adamgundry/type-inference"}type-inference
Section titled “type-inference”This package contains literate Haskell implementations of three unification algorithms (for the free theory, abelian groups and higher-order pattern unification) and two type inference algorithms (for the Hindley-Milner type system and Kennedy-style units of measure). It accompanies the Ph.D. thesis “Type Inference, Haskell and Dependent Types” by Adam Gundry.