An Operational Algebraic Semantics of Prolog Programs

We shall show that the resolution strategy implemented in most of the PROLOG interpretors may be equivalently viewed as a particular equation solving in an associated algebraic specification. We suggest and illustrate possible applications of this approach to analysis of PROLOG programs.

[1]  Keith L. Clark,et al.  A First Order Theory of Data and Programs , 1977, IFIP Congress.

[2]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[3]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[4]  T. S. E. Maibaum,et al.  Equations Compared with Clauses for Specification of Abstract Data Types , 1979, Advances in Data Base Theory.

[5]  Gérard P. Huet,et al.  Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).