Transformation Systems and Nondeclarative Properties


Bossi, Annalisa and Cocco, Nicoletta and Etalle, Sandro (2002) Transformation Systems and Nondeclarative Properties. In: Antonis C. Kakas & Fariba Sadri & Robert A. Kowalski (Eds.), Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski Part 1. Lecture Notes in Computer Science, 2407 . Springer-Verlag, Berlin, Germany, pp. 162-186. ISBN 9783540439592

open access
Abstract:Program transformation systems are applied both in program synthesis and in program optimization. For logic programs the ``logic'' component makes transformations very natural and easy to be studied formally. But, when we move to Prolog programs, the ``control'' component cannot be ignored. In particular we need to cope with termination properties which are essential for ensuring the reachability of solutions for a given query. We give an overview of the main proposals in the field of transformation systems for logic programs and we emphasize how they cope with those properties of logic programs which are not strictly declarative. We focus in particular on how the transformation can affect the termination of a program.
Item Type:Book Section
Copyright:© 2002 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 209855