Type Directed Specialization of Polymorphism

Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, these two features conflict each other in design and implementation of a modern statically typed programming language. Flexibility is achieved by high-degree of polymorphism, which is based on generic primitives in an abstract model of computation, while efficiency requires optimal use of low-level primitives specialized to individual data structures. The motivation of this work is to reconcile these two features by developing a mechanism for specializing polymorphic primitives directed by static type information. We first present a coherent type reconstruction method for transforming an ML style polymorphic language into an explicitly typed intermediate language. We then analyze the existing methods for compiling a record calculus and an unboxed calculus, extract their common structure, and develop a framework for type directed specialization of ..