A hybrid intermediate language between SSA and CPS

Paulo Torrens, Cristiano Vasconcellos, Ju Gonçalves

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer 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.
OriginalsprogEngelsk
TitelSBLP 2017 Proceedings of the 21st Brazilian Symposium on Programming Languages
UdgivelsesstedNew York
ForlagAssociation for Computing Machinery
Publikationsdato2017
Artikelnummer1
ISBN (Trykt)978-1-4503-5389-2
DOI
StatusUdgivet - 2017
Begivenhed21st Brazilian Symposium on Programming Languages: Part of the 8th Brazilian Conference on Software (CBSoft) - University of Fortaleza, Fortaleza, Brasilien
Varighed: 21 sep. 201722 sep. 2018
Konferencens nummer: 21

Symposium

Symposium21st Brazilian Symposium on Programming Languages
Nummer21
LokationUniversity of Fortaleza
LandBrasilien
ByFortaleza
Periode21/09/201722/09/2018

Citer dette