Derivation of logic programs by functional methods (Q1183419): Difference between revisions

We present a method for the calculational derivation of logic programs, employing techniques recently developed for the derivation of functional programs [\textit{R. M. Burstall} and \textit{J. Darlington}, J. Assoc. Comput. Mach. 24, 44-67 (1977; Zbl 0343.68014), \textit{R. S. Bird}, Lectures on constructive functional programming, Constructive methods in computing science, NATO Adv. Sci. Inst. Ser. F: Comput. Systems, Sci. 55 (Springer, Berlin, 1989), 151-216 (1989), \textit{R. S. Bird} and \textit{P. Wadler}, Introduction to functional programming, London: Prentice-Hall (1988) and \textit{R. R. Hoogerwoord}, The design of functional programs: a calculational approach, Ph. D. thesis, Eindhoven University of Technology (1989)]. The predicates occurring in logic programs may be interpreted as boolean functions. Starting with a specification of arbitrary form, we may derive, for these boolean functions, functional programs. We shall prove a theorem that states precisely when and how these functional programs may be transformed into logic programs.