Flattening tuples in an SSA intermediate representation

For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequences of such optimizations in a whole-program compiler, this paper presents a tuple flattening transformation and a framework that allows the formal study and comparison of different flattening schemes. We present our transformation over functional SSA, a simply-typed, monomorphic language and show that the transformation is type-safe. The flattening algorithm defined by our transformation has been incorporated into MLton, a wholeprogram, optimizing compiler for SML. Experimental results indicate that aggressive tuple flattening can lead to substantial improvements in runtime performance, a reduction in code size, and a decrease in total allocation without a significant increase in compilation time.

• Type: Journal
• Year: 2008
• Where: LISP
• Authors: Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
• Keywords: Flattening, LISP 2008, Tuple, Tuple Flattening Transformation