Implementing Circularity Using Partial Evaluation (2001)
| Venue: | of Lecture Notes in Computer Science |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Lawall01implementingcircularity,
author = {Julia L. Lawall},
title = {Implementing Circularity Using Partial Evaluation},
booktitle = {of Lecture Notes in Computer Science},
year = {2001},
pages = {84--102},
publisher = {Springer}
}
OpenURL
Abstract
Abstract. Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy functional language or in an attribute grammar. In this paper, we consider circular references in the context of an imperative C-like language, by extending the language with a new construct, persistent variables. We show that an extension of partial evaluation can eliminate persistent variables, producing a staged C program. This approach has been implemented in the Tempo specializer for C programs, and has proven useful in the implementation of run-time specialization. 1







