Abstract

This paper discusses correctness of a simple transformation system for logic programs. The transformation system is based on Unfold/Fold transformations, but differs in the form of folding from Tamaki and Sato’s system. We present three progressively stronger forms of this system and prove progressively weaker forms of correctness. We give attention to the effects of transformation on finite failure as well as on successful computations. 1

Citations

1739	Foundations of Logic Programming - Lloyd - 1984
641	Predicate logic as a programming language - Kowalski - 1974
533	A transformation system for developing recursive programs - Burstall, Darlington - 1977
116	Introduction to Logic Programming - Hogger - 1984
40	Negation as Failure. Logic and Databases - Clark - 1978
22	Predicate Logic: a calculus for deriving programs - Clark, Sickel - 1977
14	Unfold/fold transformation of logic programs with counters - Kanamori, Fujita - 1986
12	A theory of modules based on second-order logic - Chen - 1987
8	Source-to-Source Transformations of Logic Programs - Bloch - 1984
8	Predicate logic as a computational formalism. Research Report DOC 79/59 - Clark - 1979
6	Some Issues and Trends - Jaffar, Lassez, et al. - 1987
6	Closures and fairness in the semantics of programming logic. Theoretical computer science - Lassez, Maher - 1984
5	Derivation of Logic Programs from Implicit Definition, ICOT - Kanamori, Maeji - 1986