Abstract
In this paper we show the relevance of the notion of procedure to logic programming. We explain how this feature can be obtained by extending first-order logic programs to programs written in a fragment of second-order logic, and outline a combinatory theory of such logic programs. We show how various algebraic structures and abstract data types can be expressed in this framework. We explain how to construct derivations in this setting.
Cite
CITATION STYLE
Abdallah, M. A. N. (1986). Procedures in Horn-clause programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 225 LNCS, pp. 433–447). Springer Verlag. https://doi.org/10.1007/3-540-16492-8_93
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
