HMF: Simple Type Inference for First-Class Polymorphism

HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism and regular System F types. The system distinguishes itself from other proposals with simple type rules and a very simple type inference algorithm that is just a small extension of the usual Damas-Milner algorithm. Given the relative simplicity and expressive power, we feel that HMF can be a very attractive type system in practice.

Extended version with proofs available as Microsoft Research technical report MSR-TR-2007-118, Sep 2007 (see link below)

PDF file
ZIP compressed file
ZIP compressed file

In  13th ACM symp. of the International Conference on Functional Programming (ICFP'08)

Publisher  Association for Computing Machinery, Inc.
Copyright © 2008 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or The definitive version of this paper can be found at ACM’s Digital Library --


AddressVictoria, BC, Canada

Previous Versions

Daan Leijen. HMF: Simple Type Inference for First-Class Polymorphism, 30 October 2007.

> Publications > HMF: Simple Type Inference for First-Class Polymorphism