Generating Transformers for Deforestation and Supercompilation (1994)
Cached
Download Links
- [www-sop.inria.fr]
- [repository.readscheme.org]
- DBLP
Other Repositories/Bibliography
| Venue: | Static Analysis, volume 864 of Lecture Notes in Computer Science |
| Citations: | 25 - 7 self |
BibTeX
@INPROCEEDINGS{Glück94generatingtransformers,
author = {Robert Glück and Jesper Jørgensen},
title = {Generating Transformers for Deforestation and Supercompilation},
booktitle = {Static Analysis, volume 864 of Lecture Notes in Computer Science},
year = {1994},
pages = {432--448},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Our aim is to study how the interpretive approach --- inserting an interpreter between a source program and a program specializer --- can be used to improve the transformation of programs and to automatically generate program transformers by self-application of a program specializer. We show that a few semantics-preserving transformations applied to a straightforward interpretive definition of a first-order, call-by-name language are sufficient to generate Wadler's deforestation algorithm and a version of Turchin's supercompiler using a partial evaluator. The transformation is guided by the need to binding-time improve the interpreters. 1 Introduction Our aim is to study the interpretive approach to improve the transformation of source programs and to automatically generate stand-alone transformers [Tur93, GJ94]. The essence of the interpretive approach is to insert an interpreter between a source program and a generic program specializer. As defined by the specializer pro...
