A hybrid intermediate language between SSA and CPS

Paulo Torrens; Cristiano Vasconcellos; Ju Gonçalves

doi:10.1145/3125374.3125377

A hybrid intermediate language between SSA and CPS

Paulo Torrens, Cristiano Vasconcellos, Ju Gonçalves

Department of People and Technology

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

Compiler theory is usually studied individually according to the paradigms of the programming language being compiled. As noted by Kelsey, though the static single assignment (SSA) form has been used as intermediate language for imperative language compilers, and some variant of a continuation passing style (CPS) lambda calculus has been used as intermediate language for functional language compilers, they are (almost) equivalent and it is possible to draw syntactic translations between them.

This short paper aims to present an untyped intermediate language which may be interpreted as both SSA and CPS, in order to provide a common language for both imperative and functional compilers, as well to take advantage of optimizations designed for either one of the approaches. Finally, potential variants and research opportunities are discussed.

Original language	English
Title of host publication	SBLP 2017 Proceedings of the 21st Brazilian Symposium on Programming Languages
Place of Publication	New York
Publisher	Association for Computing Machinery
Publication date	2017
Article number	1
ISBN (Print)	978-1-4503-5389-2
DOIs	https://doi.org/10.1145/3125374.3125377
Publication status	Published - 2017
Event	21st Brazilian Symposium on Programming Languages: Part of the 8th Brazilian Conference on Software (CBSoft) - University of Fortaleza, Fortaleza, Brazil Duration: 21 Sept 2017 → 22 Sept 2018 Conference number: 21

Symposium

Symposium	21st Brazilian Symposium on Programming Languages
Number	21
Location	University of Fortaleza
Country/Territory	Brazil
City	Fortaleza
Period	21/09/2017 → 22/09/2018

Link to document

10.1145/3125374.3125377

Cite this

@inproceedings{8bf9a09957564329af4cecc0f7b49d4b,

title = "A hybrid intermediate language between SSA and CPS",

abstract = "Compiler theory is usually studied individually according to the paradigms of the programming language being compiled. As noted by Kelsey, though the static single assignment (SSA) form has been used as intermediate language for imperative language compilers, and some variant of a continuation passing style (CPS) lambda calculus has been used as intermediate language for functional language compilers, they are (almost) equivalent and it is possible to draw syntactic translations between them.This short paper aims to present an untyped intermediate language which may be interpreted as both SSA and CPS, in order to provide a common language for both imperative and functional compilers, as well to take advantage of optimizations designed for either one of the approaches. Finally, potential variants and research opportunities are discussed.",

author = "Paulo Torrens and Cristiano Vasconcellos and Ju Gon{\c c}alves",

year = "2017",

doi = "10.1145/3125374.3125377",

language = "English",

isbn = "978-1-4503-5389-2",

booktitle = "SBLP 2017 Proceedings of the 21st Brazilian Symposium on Programming Languages",

publisher = "Association for Computing Machinery",

note = "21st Brazilian Symposium on Programming Languages : Part of the 8th Brazilian Conference on Software (CBSoft), SBLP 2017 ; Conference date: 21-09-2017 Through 22-09-2018",

}

TY - GEN

T1 - A hybrid intermediate language between SSA and CPS

AU - Torrens, Paulo

AU - Vasconcellos, Cristiano

AU - Gonçalves, Ju

N1 - Conference code: 21

PY - 2017

Y1 - 2017

N2 - Compiler theory is usually studied individually according to the paradigms of the programming language being compiled. As noted by Kelsey, though the static single assignment (SSA) form has been used as intermediate language for imperative language compilers, and some variant of a continuation passing style (CPS) lambda calculus has been used as intermediate language for functional language compilers, they are (almost) equivalent and it is possible to draw syntactic translations between them.This short paper aims to present an untyped intermediate language which may be interpreted as both SSA and CPS, in order to provide a common language for both imperative and functional compilers, as well to take advantage of optimizations designed for either one of the approaches. Finally, potential variants and research opportunities are discussed.

AB - Compiler theory is usually studied individually according to the paradigms of the programming language being compiled. As noted by Kelsey, though the static single assignment (SSA) form has been used as intermediate language for imperative language compilers, and some variant of a continuation passing style (CPS) lambda calculus has been used as intermediate language for functional language compilers, they are (almost) equivalent and it is possible to draw syntactic translations between them.This short paper aims to present an untyped intermediate language which may be interpreted as both SSA and CPS, in order to provide a common language for both imperative and functional compilers, as well to take advantage of optimizations designed for either one of the approaches. Finally, potential variants and research opportunities are discussed.

U2 - 10.1145/3125374.3125377

DO - 10.1145/3125374.3125377

M3 - Article in proceedings

SN - 978-1-4503-5389-2

BT - SBLP 2017 Proceedings of the 21st Brazilian Symposium on Programming Languages

PB - Association for Computing Machinery

CY - New York

T2 - 21st Brazilian Symposium on Programming Languages

Y2 - 21 September 2017 through 22 September 2018

ER -