Transformation Rules for Logic Programs with Goals as Arguments

Transformations of logic programs with goals as arguments

“…We also thank the anonymous referees of the LoPSTr '99 Workshop, where a preliminary version of this paper was presented (Pettorossi and Proietti 2000), and the referees of the Theory and Practice of Logic Programming Journal for their suggestions. This work has been partially supported by MURST Progetto Cofinanziato 'Tecniche Formali per la Specifica, l'Analisi, la Verifica, la Sintesi e la Trasformazione di Sistemi Software' (Italy), and Progetto Coordinato CNR 'Verifica, Analisi e Trasformazione dei Programmi Logici' (Italy).…”

“…We would like to thank Michael Leuschel for pointing out an error in a preliminary version of this paper and for his helpful comments. We also thank the anonymous referees of the LoPSTr '99 Workshop, where a preliminary version of this paper was presented (Pettorossi and Proietti 2000), and the referees of the Theory and Practice of Logic Programming Journal for their suggestions.…”

A Historical Account of My Early Research Interests

“…As in functional programs where we have lambda expressions denoting functions, in logic programming we should have terms denoting goals, and thus goals should be allowed to occur as arguments of predicates. To allow goals as arguments, we have proposed a novel logic language, we have defined its semantics, and we have provided for it a set of unfold/fold transformations rules, together with some goal replacement rules, such as the one stating the equivalence of the goal g ∧ true with the goal g [56,63]. Those rules have been proved correct.…”

“…For Section 7 a possible project is to construct a transformation system of logic programs with goals as arguments in which: (i) one can run the programs according to the operational semantics we have defined in our paper [56], and (ii) one can apply the various transformation rules (definition introduction, unfolding, folding, goal replacement) we have listed in that paper.…”