A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The language ML F is a proposal for a new type system that supersedes both ML and System F, allows for efficient, predictable, and complete type inference for partially annotated terms. In this work, we revisit the definition of ML F , following a more progressive approach and focusing on the design-space and expressiveness. We introduce a Curry-style version iML F of ML F and provide an interpretation of iML F types as instantiation-closed sets of System-F types, from which we derive thedoi:10.1016/j.ic.2008.12.006 fatcat:ojbaprppgzarpbozexjauazbfm