论文信息 - SSA is functional programming

SSA is functional programming

Static Single-Assignment (SSA) form is an intermediate language designed to make optimization clean and efficient for imperative-language (Fortran, C) compilers. Lambda-calculus is an intermediate language that makes optimization clean and efficient for functionallanguage (Scheme, ML, Haskell) compilers. The SSA community draws pictures of graphs with basic blocks and flow edges, and the functional-language community writes lexically nested functions, but (as Richard Kelsey recently pointed out [9]) they’re both doing exactly the same thing in different notation.

Andrew W. Appel | A. Appel

[1] Andrew W. Appel,et al. Modern Compiler Implementation in Java , 1997 .

[2] Andrew W. Appel,et al. Compiling with Continuations , 1991 .

[3] M. Wegman,et al. Global value numbers and redundant computations , 1988, POPL '88.

[4] Steven S. Muchnick,et al. Advanced Compiler Design and Implementation , 1997 .

[5] Mark N. Wegman,et al. Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.

[6] Andrew W. Appel,et al. Modern Compiler Implementation in ML , 1997 .

[7] Mark N. Wegman,et al. Constant propagation with conditional branches , 1985, POPL.

[8] Michael Wolfe,et al. High performance compilers for parallel computing , 1995 .

[9] Jr. Guy L. Steele,et al. Rabbit: A Compiler for Scheme , 1978 .

[10] Richard Kelsey,et al. A correspondence between continuation passing style and static single assignment form , 1995, IR '95.

[11] A. Church. The calculi of lambda-conversion , 1941 .

[12] Amr Sabry,et al. The essence of compiling with continuations , 1993, PLDI '93.

[13] Bowen Alpern,et al. Detecting equality of variables in programs , 1988, POPL '88.