A polymorphic record calculus and its compilation

Abstract

The motivation of this work is to provide a type-theoretical basis for developing a practical polymorphic programming language with labeled records and labeled variants. Our goal is to establish both a polymorphic type discipline and an efficient compilation method for a calculus with those labeled data structures. We define a second-order, polymorphic record calculus as an extension of Girard-Reynolds polymorphic lambda calculus. We then develop an ML-style type inference algorithm for a predicative subset of the second-order record calculus. The soundness of the type system and the completeness of the type inference algorithm are shown. These results extend Milner's type inference algorithm, Damas and Milner's account of ML's let polymorphism, and Harper and Mitchell's analysis on XMLTo establish an efficient compilation method for the polymorphic record calculus, we first define an implementation calculus, where records are represented as vectors whose elements are accessed by direct indexing, and variants are represented as values tagged with a natural number indicating the position in the vector of functions m a switch statement.We then develop an algorithm to translate the polymorphic record calculus into the implementation calculus using type reformation obtained by the type inference algorithm. The correctness of the compilation algorithm is proved, that is, the compdation algorithm is shown to preserve both typing and the operational behavior of a program. Based on these results, Standard ML has been extended with labeled records, and its compiler has been implemented.

Strongly typed heterogeneous collections

“…Several Haskell language extensions have been proposed [10,31,29], alike for other languages, e.g., (S)ML [6,30]. There are also record calculi by Bracha, Ohori and others [5,24]. There are related type systems, e.g., for relational algebra [14].…”

Private Row Types: Abstracting the Unnamed

“…More precisely, we could use one for object types, as one can only refine them by adding new methods, but this is impossible for variant types, as existing constructors may also disappear. For this reason, the formalism we use here is based on kinds [12] rather than row variables, but we will still use an abstract type representing a "virtual" row variable.…”

Register Allocation by Proof Transformation

“…We note that although context terms are similar to record types, any extra machinery for record unification such as [12,8] is not required. We can show the following.…”