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.
-
Notifications
You must be signed in to change notification settings - Fork 5
Unification and type inference algorithms
License
adamgundry/type-inference
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Unification and type inference algorithms
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published