Multi-Stage Programming: Axiomatization and Type Safety (Extended Abstract) (1998)
| Venue: | In 25th International Colloquium on Automata, Languages, and Programming |
| Citations: | 33 - 15 self |
BibTeX
@INPROCEEDINGS{Taha98multi-stageprogramming:,
author = {Walid Taha and Zine-el-abidine Benaissa and Tim Sheard},
title = {Multi-Stage Programming: Axiomatization and Type Safety (Extended Abstract)},
booktitle = {In 25th International Colloquium on Automata, Languages, and Programming},
year = {1998},
pages = {918--929},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Multi-staged programming provides a new paradigm for constructing efficient solutions to complex problems. Techniques such as program generation, multi-level partial evaluation, and run-time code generation respond to the need for general purpose solutions which do not pay run-time interpretive overheads. This paper provides a foundation for the formal analysis of one such system. We introduce a multi-stage language and present its axiomatic, reduction, and natural semantics. Our axiomatic semantics is an extension of the call-by-value -calculus with staging constructs. We demonstrate the soundness of the axiomatic semantics with respect to the natural semantics. We show that staged-languages can "go Wrong" in new ways, and devise a type system that screens out such programs. Finally, we present a proof of the soundness of this type system with respect to the reduction semantics, and show how to extend this result to the natural semantics. 1 Introduction Recently, there has been signi...
