Transformation of left terminating programs: The reordering problem


Share/Save/Bookmark

Bossi, Annalisa and Cocco, Nicoletta and Etalle, Sandro (2000) Transformation of left terminating programs: The reordering problem. In: 5th International Workshop on Logic Program Synthesis and Transformation, LOPSTR '95, September 20-22, 1995, Utrecht, The Netherlands (pp. pp. 33-45).

open access
[img]
Preview
PDF
697kB
Abstract:An Unfold/Fold transformation system is a source-to-source rewriting 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 PROLOG 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 termination 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.
Item Type:Conference or Workshop Item
Copyright:© 1996 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/56271
Official URL:http://dx.doi.org/10.1007/3-540-60939-3_3
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page