Optimizing Generic Functions

Abstract. Generic functions are defined by induction on the structural representation of types. As a consequence, by defining just a single generic operation, one acquires this operation over any particular type. An instance on a specific type is generated by interpretation of the type’s structure. A direct translation leads to extremely inefficient code that involves many conversions between types and their structural representations. In this paper we present an optimization technique based on compile-time symbolic evaluation. We prove that the optimization removes the overhead of the generated code for a considerable class of generic functions. The proof uses typing to identify intermediate data structures that should be eliminated. In essence, the output after optimization is similar to hand-written code.

• Type: Conference
• Year: 2004
• Where: MPC
• Authors: Artem Alimarine, Sjaak Smetsers
• Keywords: Generic Functions, Mathematics, MPC 2004, Single Generic Operation, Structural Representations