Functional Representations of SSA

Lennart Beringer

doi:10.1007/978-3-030-80515-9_6

Functional Representations of SSA

Lennart Beringer

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

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.

Original language	English (US)
Title of host publication	SSA-based Compiler Design
Publisher	Springer International Publishing
Pages	63-88
Number of pages	26
ISBN (Electronic)	9783030805159
ISBN (Print)	9783030805142
DOIs	https://doi.org/10.1007/978-3-030-80515-9_6
State	Published - Jan 1 2022

All Science Journal Classification (ASJC) codes

General Engineering
General Computer Science

Keywords

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

Access to Document

10.1007/978-3-030-80515-9_6

Cite this

@inbook{93eb40fafbfc4344abeb07d324bcca4e,

title = "Functional Representations of SSA",

abstract = "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.",

keywords = "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",

author = "Lennart Beringer",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2022.",

year = "2022",

month = jan,

day = "1",

doi = "10.1007/978-3-030-80515-9_6",

language = "English (US)",

isbn = "9783030805142",

pages = "63--88",

booktitle = "SSA-based Compiler Design",

publisher = "Springer International Publishing",

}

TY - CHAP

T1 - Functional Representations of SSA

AU - Beringer, Lennart

N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2022.

PY - 2022/1/1

Y1 - 2022/1/1

N2 - 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.

AB - 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.

KW - Alpha-renaming

KW - Basic-block sinking

KW - Compiler design

KW - Continuation-based form (CPS form)

KW - Direct style

KW - Formal parameters

KW - Free variable

KW - Functional loop nesting

KW - Functional program representation

KW - Irreducible graph

KW - Lambda-dropping

KW - Lambda-lifting

KW - Let-binding

KW - Loop nesting forest

KW - Loop-closed

KW - Lost-copy problem

KW - Parameter dropping

KW - Reducible graph

KW - Referential transparency

KW - SSA destruction

KW - Static scope

KW - Static single assignment form (SSA form)

KW - Swap problem

KW - Syntactic scope

KW - Tail-recursive

KW - Vanilla SSA

UR - http://www.scopus.com/inward/record.url?scp=85159016820&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85159016820&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-80515-9_6

DO - 10.1007/978-3-030-80515-9_6

M3 - Chapter

AN - SCOPUS:85159016820

SN - 9783030805142

SP - 63

EP - 88

BT - SSA-based Compiler Design

PB - Springer International Publishing

ER -

Functional Representations of SSA

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this