A correspondence between continuation passing style and static single assignment form
Author:
Open Access
- 1 March 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 30 (3) , 13-22
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.Keywords
This publication has 7 references indexed in Scilit:
- Is continuation-passing useful for data flow analysis?1994
- Effective partial redundancy elimination1994
- Beyond induction variables1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Revised 4 report on the algorithmic language schemeACM SIGPLAN Lisp Pointers, 1991
- Realistic compilation by program transformation (detailed summary)1989
- ORBIT: an optimizing compiler for scheme1986