Flexible Continuations in Logic Programs via Unfold/Fold Transformations and Goal Generalization (1997)
| Venue: | In Proceedings of the 2nd ACM SIGPLAN Workshop on Continuations |
| Citations: | 3 - 2 self |
BibTeX
@INPROCEEDINGS{Pettorossi97flexiblecontinuations,
author = {Alberto Pettorossi and Maurizio Proietti},
title = {Flexible Continuations in Logic Programs via Unfold/Fold Transformations and Goal Generalization},
booktitle = {In Proceedings of the 2nd ACM SIGPLAN Workshop on Continuations},
year = {1997},
pages = {6--93}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider the use of continuations for deriving efficient logic programs. It is known that both in the case of functional and logic programming, the introduction of continuations is a valuable technique for transforming old programs into new, more efficient ones. However, in general, in order to derive programs with high levels of efficiency, one should introduce continuations according to suitable strategies. In particular, we show that it is preferable to introduce continuations in a flexible way, that is, during the process of program transformation itself, rather than at its beginning or at its end. We extend logic programs by allowing variables to range over goals, and we propose a set of transformation rules for this extended language. We propose a generalization strategy for the introduction of goal variables which may be viewed as continuations and they allow for the derivation of very efficient programs. 1 Introduction Continuation-based program transformations [22] have be...
