Abstract

We define syntactic transformations that convert continuation passing style (CPS) programs into static single assignment form (SSA) and vice versa. Some CPS programs cannot be converted to SSA, but these are not produced by the usual CPS transformation. The CPS!SSA transformation is especially helpful for compiling functional programs. Many optimizations that normally require flow analysis can be performed directly on functional CPS programs by viewing them as SSA programs. We also present a simple program transformation that merges CPS procedures together and by doing so greatly increases the scope of the SSA flow information. This transformation is useful for analyzing loops expressed as recursive procedures. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by per...

Citations

749	Efficiently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
595	Compiling with Continuations - Appel - 1992
267	Control-flow Analysis of Higher-Order Languages - Shivers - 1991
190	ORBIT: An optimizing compiler for Scheme - KRANZ, KELSEY, et al. - 1986
153	Revised report on the algorithmic language Scheme - Clinger, Rees - 1991
137	Essentials of programming languages - Friedman, Wand, et al. - 1992
119	Rabbit: A compiler for Scheme - Steele - 1978
85	Beyond induction variables - Wolfe - 1992
84	Effective partial redundancy elimination - Briggs, Cooper - 1994
70	Realistic compilation by program transformation - Kelsey - 1989
21	Is continuation-passing useful for data flow analysis - Sabry, Felleisen - 1994
2	High level compiling for low level machines - O'Donnell - 1994