Transformation of Left Terminating Programs: The Reordering Problem (1995)
| Venue: | PROCEEDINGS LOPSTR'95, VOLUME 1048 OF LECTURE NOTES IN COMPUTER SCIENCE |
| Citations: | 14 - 3 self |
BibTeX
@INPROCEEDINGS{Bossi95transformationof,
author = {Annalisa Bossi and Nicoletta Cocco and Sandro Etalle},
title = {Transformation of Left Terminating Programs: The Reordering Problem},
booktitle = {PROCEEDINGS LOPSTR'95, VOLUME 1048 OF LECTURE NOTES IN COMPUTER SCIENCE},
year = {1995},
pages = {33--45},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An Unfold/Fold transformation system is a source-to-source rewrit-ing methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. When dealing with logic programs such as PRO-LOG programs, one is particularly interested in preserving left termination i.e. termination wrt the leftmost selection rule, which is by far the most widely employed of the search rules. Unfortunately, the most popular Unfold/Fold transformation systems ([TS84, Sek91]) do not preserve the above termina-tion property. In this paper we study the reasons why left termination may be spoiled by the application of a transformation operation and we present a transformation system based on the operations of Unfold, Fold and Switch which- if applied to a left terminating programs- yields a program which is left terminating as well.
