Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection (2003)
Cached
Download Links
- [www.cs.rice.edu]
- [www.doc.ic.ac.uk]
- [www.netobjectdays.org]
- [www.cs.rice.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Krzysztof Czarnecki, Frank Pfenning, and Yannis Smaragdakis, editors, Generative Programming and Component Engineering (GPCE), Lecture Notes in Computer Science |
| Citations: | 40 - 10 self |
BibTeX
@INPROCEEDINGS{Calcagno03implementingmulti-stage,
author = {Cristiano Calcagno and Walid Taha and Liwen Huang and Xavier Leroy},
title = {Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection},
booktitle = {In Krzysztof Czarnecki, Frank Pfenning, and Yannis Smaragdakis, editors, Generative Programming and Component Engineering (GPCE), Lecture Notes in Computer Science},
year = {2003},
pages = {57--76},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
