DMCA
Tutorial Notes on Partial Evaluation (1993)
| Venue: | Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages |
| Citations: | 248 - 59 self |
BibTeX
@INPROCEEDINGS{Consel93tutorialnotes,
author = {Charles Consel and Olivier Danvy},
title = {Tutorial Notes on Partial Evaluation},
booktitle = {Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages},
year = {1993},
pages = {493--501},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The last years have witnessed a flurry of new results in the area of partial evaluation. These tutorial notes survey the field and present a critical assessment of the state of the art. 1 Introduction Partial evaluation is a source-to-source program transformation technique for specializing programs with respect to parts of their input. In essence, partial evaluation removes layers of interpretation. In the most general sense, an interpreter can be defined as a program whose control flow is determined by its input data. As Abelson points out, [43, Foreword], even programs that are not themselves interpreters have important interpreter-like pieces. These pieces contain both compile-time and run-time constructs. Partial evaluation identifies and eliminates the compile-time constructs. 1.1 A complete example We consider a function producing formatted text. Such functions exist in most programming languages (e.g., format in Lisp and printf in C). Figure 1 displays a formatting functio...
Keyphrases
partial evaluation tutorial note new result run-time construct input data general sense critical assessment complete example important interpreter-like piece introduction partial evaluation formatting functio compile-time construct partial evaluation identifies control flow source-to-source program transformation technique last year programming language tutorial note survey
