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.
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.
| Originalsprog | Engelsk |
|---|---|
| Titel | SBLP 2017 Proceedings of the 21st Brazilian Symposium on Programming Languages |
| Udgivelsessted | New York |
| Forlag | Association for Computing Machinery |
| Publikationsdato | 2017 |
| Artikelnummer | 1 |
| ISBN (Trykt) | 978-1-4503-5389-2 |
| DOI | |
| Status | Udgivet - 2017 |
| Begivenhed | 21st Brazilian Symposium on Programming Languages: Part of the 8th Brazilian Conference on Software (CBSoft) - University of Fortaleza, Fortaleza, Brasilien Varighed: 21 sep. 2017 → 22 sep. 2018 Konferencens nummer: 21 |
Symposium
| Symposium | 21st Brazilian Symposium on Programming Languages |
|---|---|
| Nummer | 21 |
| Lokation | University of Fortaleza |
| Land | Brasilien |
| By | Fortaleza |
| Periode | 21/09/2017 → 22/09/2018 |