Abstract
The paper addresses theoretical and practical aspects of implementing multi-stage languages using abstract syntax trees (ASTs), gensym, and reflection. We present an operational account of the correctness of this approach, and report on our experience with a bytecode compiler called MetaOCaml that is based on this strategy. Current performance measurements reveal interesting characteristics of the underlying OCaml compiler, and illustrate why this strategy can be particularly useful for implementing domain-specific languages in a typed, functional setting. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Calcagno, C., Taha, W., Huang, L., & Leroy, X. (2003). Implementing multi-stage languages using ASTs, gensym, and reflection. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2830, 57–76. https://doi.org/10.1007/978-3-540-39815-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
