A Transformation System Combining Partial Evaluation with Term Rewriting (1993)
Cached
Download Links
- [www-sop.inria.fr]
- [ftp.cse.ogi.edu]
- [cse.ogi.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Higher Order Algebra, Logic and Term Rewriting (HOA '93), volume 816 of LNCS |
| Citations: | 6 - 5 self |
BibTeX
@INPROCEEDINGS{Bellegarde93atransformation,
author = {Françoise Bellegarde},
title = {A Transformation System Combining Partial Evaluation with Term Rewriting},
booktitle = {In Higher Order Algebra, Logic and Term Rewriting (HOA '93), volume 816 of LNCS},
year = {1993},
pages = {40--58},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper presents a new approach to optimizing functional programs based on combining partial evaluation and rewriting. Programs are composed of higher-order primitives. Partial evaluation is used to eliminate higher-order functions. First-order rewriting is used to process the transformation. Laws about the higher-order primitives that are relevant for the optimizations are automatically extracted from a library and transformed into first-order terms using partial evaluation. Such a combination of a partial evaluation system and an intrinsically first-order rewriting tool allows a form of higher-order rewriting at a first-order level. This way, it is possible to automate deforestation of higher-order programs. Introduction The so-called Squiggol [10] style for program construction is a high-level programming technique that consists of building a program by composing primitives or other functions while taking into account well-known laws on the primitives. Functions are usually de...
