Logic programming semantics: techniques and applications
Logic programming semantics: techniques and applications
Reasoning about termination of pure Prolog programs
Information and Computation
Partial deduction of logic programs wrt well-founded semantics
New Generation Computing
From logic programming to Prolog
From logic programming to Prolog
Unfold/fold Transformations Preserving Termination Properties
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Replacement Can Preserve Termination
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Preserving Universal Termination through Unfold/Fold
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
| Hi-index | 0.01 |
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.