The Compiler Forest

  • Mihai Budiu
  • Joel Galenson
  • Gordon D. Plotkin
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7792)
Cite this paper as:
Budiu M., Galenson J., Plotkin G.D. (2013) The Compiler Forest. In: Felleisen M., Gardner P. (eds) Programming Languages and Systems. ESOP 2013. Lecture Notes in Computer Science, vol 7792. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mihai Budiu
    • 1
  • Joel Galenson
    • 1
    • 2
  • Gordon D. Plotkin
    • 1
    • 3
  1. 1.Microsoft ResearchSilicon ValleyUSA
  2. 2.University of CaliforniaBerkeleyUSA
  3. 3.University of EdinburghUK

Personalised recommendations