Functional Representations of SSA

• Published in: SSA-based Compiler Design pp. 63 - 88
• Main Author: Beringer, Lennart
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2022
• Subjects: Alpha-renaming; Basic-block sinking; Compiler design; Continuation-based form (CPS form); Direct style; Formal parameters; Free variable; Functional loop nesting; Functional program representation; Irreducible graph; Lambda-dropping; Lambda-lifting; Let-binding; Loop nesting forest; Loop-closed; Lost-copy problem; Parameter dropping; Reducible graph; Referential transparency; SSA destruction; Static scope; Static single assignment form (SSA form); Swap problem; Syntactic scope; Tail-recursive; Vanilla SSA
• ISBN: 303080514X; 9783030805142
• DOI: 10.1007/978-3-030-80515-9_6

Functional programming languages provide a perspective on SSA that complements presentations based on phi-functions using notions such as nested scope, parameter passing, and mutually recursive function definitions. The correspondence extends from syntactic aspects to tasks such as SSA construction, data-flow analysis, and program transformations, and can be expressed in terms of multiple intermediate representation forms, all commonly found in compilers for functional programming languages. The chapter concludes with a discussion of loop nesting forests and their relationship to the relative placement of mutually recursive functions during block sinking and lambda dropping.