Transformation of Left Terminating Programs


Share/Save/Bookmark

Bossi, Annalisa and Cocco, Nicoletta and Etalle, Sandro (2000) Transformation of Left Terminating Programs. In: 9th International Workshop on Logic Program Synthesis and Transformation, LOPSTR '99, September 22-24, 1999, Venezia, Italy (pp. pp. 156-175).

open access
[img]
Preview
PDF
265kB
Abstract:We propose an unfold-fold transformation system which preserves left termination for definite programs besides its declarative semantics. The system extends our previous proposal in [BCE95] by allowing to switch the atoms in the clause bodies when a specific applicability condition is satisfied. The applicability condition is very simple to verify, yet very common in practice. We also discuss how to verify such condition by exploiting mode information
Item Type:Conference or Workshop Item
Copyright:© 2000 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/56161
Official URL:http://dx.doi.org/10.1007/10720327_10
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page