Abstract
Many reduction systems have been presented for implementing functional programming languages. We propose here an extension of a reduction architecture to realize a kind of logic programming — pure Horn clause logic programming. This is an attempt to approach amalgamation of the two important programming paradigms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Kluge, The Architecture of a Reduction Language Machine Model. GMD ISF-79-3, D-5205 Sankt Augustin 1, Gemany.
K. Berkling Epsilon-Reduction: Another View of Unification. InFifth Generation Computer Architecture, J.V. Woods (ed.), Elsevier Science Publisher B. V., North-Holland, IFIP, 1986.
J. Darlington, A. J. Field and H. Pull, Unification of functional and logic programming. In 1985 Symp on Logic Programming, Boston, pp. 54–66.
D. DeGroot and G. Lindstrom, (eds.), Logic Programming: Functions, Relations and Equations. Prentice Hall, 1986.
J. H. Siekmann Unification. Theory.Journal of Symbolic Computation, 1989, 7 (3–4) pp. 207–274.
Author information
Authors and Affiliations
Additional information
This work was done by the author when he was a visiting researcher in the research group of Prof. Dr. Werner Kluge at Kiel University, supported by the grant of Federal Mimster of Science and Technology of Germany.
Rights and permissions
About this article
Cite this article
Xu, M. An implementation of pure Horn clause logic programming in a reduction system. J. of Compt. Sci. & Technol. 8, 243–251 (1993). https://doi.org/10.1007/BF02939531
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02939531