Mar
11th
Tue
11th
HMF: simple type inference for first-class polymorphism (PDF)
Daan Leijen. In this article we introduce HMF, a conservative extension of Hindley-Milner type inference with first-class polymorphism and regular System F types. The system has a simple and effective type inference algorithm that infers principal types. Given the relative simplicity and expressive power, we feel that HMF can be a very attractive type system in practice. There’s a prototype implementation available.