Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
HMF: Simple Type Inference for First-Class Polymorphism

Daan Leijen

Abstract

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)

Details

Publication typeInproceedings
Published in13th ACM symp. of the International Conference on Functional Programming (ICFP'08)
AddressVictoria, BC, Canada
PublisherAssociation for Computing Machinery, Inc.

Previous versions

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

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