The Compiler Forest

Mihai Budiu; Joel Galenson; Gordon D. Plotkin

doi:10.1007/978-3-642-37036-6_2

The Compiler Forest

Mihai Budiu, Joel Galenson, Gordon D. Plotkin

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

Abstract / Description of output

We address the problem of writing compilers targeting complex execution environments, such as computer clusters composed of machines with multi-core CPUs. To that end we introduce partial compilers. These compilers can pass sub-programs to several child (partial) compilers, combining the code generated by their children to generate the final target code. We define a set of high-level polymorphic operations manipulating both compilers and partial compilers as first-class values. These mechanisms provide a software architecture for modular compiler construction. This allows the building of a forest of compilers, providing a structured treatment of multistage compilers.

Original language	English
Title of host publication	Programming Languages and Systems
Subtitle of host publication	22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings
Publisher	Springer
Pages	21-40
Number of pages	20
Volume	7792
ISBN (Electronic)	978-3-642-37036-6
ISBN (Print)	978-3-642-37035-9
DOIs	https://doi.org/10.1007/978-3-642-37036-6_2
Publication status	Published - 2013

Access to Document

10.1007/978-3-642-37036-6_2

Budiu Galenson ET AL 2013 The Compiler ForestAccepted author manuscript, 727 KB

http://dx.doi.org/10.1007/978-3-642-37036-6_2

Cite this

Budiu, M., Galenson, J., & Plotkin, G. D. (2013). The Compiler Forest. In Programming Languages and Systems: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings (Vol. 7792, pp. 21-40). Springer. https://doi.org/10.1007/978-3-642-37036-6_2

@inproceedings{3dd87ad177ad479880043cbafdea5693,

title = "The Compiler Forest",

abstract = "We address the problem of writing compilers targeting complex execution environments, such as computer clusters composed of machines with multi-core CPUs. To that end we introduce partial compilers. These compilers can pass sub-programs to several child (partial) compilers, combining the code generated by their children to generate the final target code. We define a set of high-level polymorphic operations manipulating both compilers and partial compilers as first-class values. These mechanisms provide a software architecture for modular compiler construction. This allows the building of a forest of compilers, providing a structured treatment of multistage compilers.",

author = "Mihai Budiu and Joel Galenson and Plotkin, {Gordon D.}",

year = "2013",

doi = "10.1007/978-3-642-37036-6_2",

language = "English",

isbn = "978-3-642-37035-9",

volume = "7792",

pages = "21--40",

booktitle = "Programming Languages and Systems",

publisher = "Springer",

address = "United Kingdom",

}

The Compiler Forest. / Budiu, Mihai; Galenson, Joel; Plotkin, Gordon D.
Programming Languages and Systems: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Vol. 7792 Springer, 2013. p. 21-40.

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

TY - GEN

T1 - The Compiler Forest

AU - Budiu, Mihai

AU - Galenson, Joel

AU - Plotkin, Gordon D.

PY - 2013

Y1 - 2013

N2 - We address the problem of writing compilers targeting complex execution environments, such as computer clusters composed of machines with multi-core CPUs. To that end we introduce partial compilers. These compilers can pass sub-programs to several child (partial) compilers, combining the code generated by their children to generate the final target code. We define a set of high-level polymorphic operations manipulating both compilers and partial compilers as first-class values. These mechanisms provide a software architecture for modular compiler construction. This allows the building of a forest of compilers, providing a structured treatment of multistage compilers.

AB - We address the problem of writing compilers targeting complex execution environments, such as computer clusters composed of machines with multi-core CPUs. To that end we introduce partial compilers. These compilers can pass sub-programs to several child (partial) compilers, combining the code generated by their children to generate the final target code. We define a set of high-level polymorphic operations manipulating both compilers and partial compilers as first-class values. These mechanisms provide a software architecture for modular compiler construction. This allows the building of a forest of compilers, providing a structured treatment of multistage compilers.

U2 - 10.1007/978-3-642-37036-6_2

DO - 10.1007/978-3-642-37036-6_2

M3 - Conference contribution

SN - 978-3-642-37035-9

VL - 7792

SP - 21

EP - 40

BT - Programming Languages and Systems

PB - Springer

ER -

The Compiler Forest

Abstract / Description of output

Access to Document

Fingerprint

Cite this