## Type Inference with Polymorphic Recursion (1991)

Venue: | ACM Transactions on Programming Languages and Systems |

Citations: | 135 - 0 self |

### BibTeX

@ARTICLE{Henglein91typeinference,

author = {Fritz Henglein},

title = {Type Inference with Polymorphic Recursion},

journal = {ACM Transactions on Programming Languages and Systems},

year = {1991},

volume = {15},

pages = {253--289}

}

### Years of Citing Articles

### OpenURL

### Abstract

The Damas-Milner Calculus is the typed -calculus underlying the type system for ML and several other strongly typed polymorphic functional languages such as Miranda 1 and Haskell. Mycroft has extended its problematic monomorphic typing rule for recursive definitions with a polymorphic typing rule. He proved the resulting type system, which we call the Milner-Mycroft Calculus, sound with respect to Milner's semantics, and showed that it preserves the principal typing property of the Damas-Milner Calculus. The extension is of practical significance in typed logic programming languages and, more generally, in any language with (mutually) recursive definitions. In this paper we show that the type inference problem for the Milner-Mycroft Calculus is log-space equivalent to semi-unification, the problem of solving subsumption inequations between first-order terms. This result has been proved independently by Kfoury, Tiuryn, and Urzyczyn. In connection with the recently establish...