We develop virtual machines and compilers for a multi-level language, which supports multi-stage specialization by composing program fragments with quotation mechanisms. We consider two styles of virtual machines-ones equipped with special instructions for code generation and ones without-and show that the latter kind can deal with, more easily, low-level code generation, which avoids the overhead of (runtime) compilation by manipulating instruction sequences, rather than source-level terms, as data. The virtual machines and accompanying compilers are derived by program transformation, which extends Ager et al.'s derivation of virtual machines from evaluators. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Igarashi, A., & Iwaki, M. (2007). Deriving compilers and virtual machines for a multi-level language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4807 LNCS, pp. 206–221). Springer Verlag. https://doi.org/10.1007/978-3-540-76637-7_14
Mendeley helps you to discover research relevant for your work.