HMF: Simple type inference for first-class polymorphism
The 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008)
Victoria, British Columbia, Canada, September 22-24, 2008
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, where only polymorphic parameters and ambigious impredicative applications must be annotated. Given the relative simplicity and expressive power, we feel that HMF can be a very attractive type system in practice.
Conference Manager (V2.54.6)