Skip to main content
Article thumbnail
Location of Repository

Abstract A Graphical Presentation of MLF Types with a Linear-Time Unification Algorithm.

By Didier Rémy, Boris Yakobowski and Inria Rocquencourt


MLF is a language that extends ML and System F and combines the benefits of both. We propose a dag representation of MLF types that superposes a term-dag, encoding the underlying termstructure with sharing, and a binding tree encoding the bindingstructure. Compared to the original definition, this representation is more canonical as it factors out most of the notational details; it is also closely related to first-order terms. Moreover, it permits a simpler and more direct definition of type instance that combines type instance on first-order term-dags, simple operations on dags, and a control that allows or rejects potential instances. Using this representation, we build a linear-time unification algorithm for MLF types, which we prove sound and complete with respect to the specification

Topics: Features—Polymorphism, E.1 [Data Structures, Graphs General Terms Algorithms, Design, Languages Keywords System F, MLF, Unification, Types, Graphs, Binders
Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.