Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 1986: Third International Conference on Logic Programming pp 433–447Cite as

Procedures in Horn-clause programming

  • Session 4b: Theory And Higher-Order Functions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 225))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Bowen K.A. and Kowalski R.A.: Amalgamating language and metalanguage, in Logic Programming, K.L. Clark and T.-S. Taernlund ed, Academic Press (1982), pp 153–172

    Google Scholar 

  2. de Bruijn N.G.: A survey of the project Automath, in To H.B. Curry Essays on Combinatory Logic, Lambda-Calculus and Formalism, J.R. Hindley and J.P. Seldin eds, Academic Press (1980), pp.597–607

    Google Scholar 

  3. Church A.: A formulation of the simple theory of types, JSL Vol 5 (1940), pp 56–68

    Google Scholar 

  4. Colmerauer A.: Prolog and infinite trees, in Logic Programming, K.L. Clark and S.-A. Taernlund ed, Academic Press (1982),pp. 153–172

    Google Scholar 

  5. Goldfarb W.G.: The undecidability of the second-order unification problem, TCS 13 (1981), pp. 225–230

    Google Scholar 

  6. Huet G.: The undecidability of unification in third order logic, Information and Control 22, 3 (1973) pp. 257–267

    Google Scholar 

  7. Jensen D.C. and Pietrzykowski T.: Mechanizing ω-order type theory through unification, TCS 3, (1976), pp. 123–171

    Google Scholar 

  8. Kowalski R.A.: Predicate logic as programming language, IFIP 1974, North Holland (1974), pp. 569–574

    Google Scholar 

  9. Lucchesi C.L.: The undecidability of the unification problem for third order languages, report CSRR-2059, Dep. of Appl. Anal. and CS, University of Waterloo (1972)

    Google Scholar 

  10. Nait Abdallah M.-A.: Ions and local definitions in logic programming, in Theoretical Aspects of Computer Science, B. Monien and G. Vidal-Naquet eds, Springer LNCS 210, (1986), pp. 60–72

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, London, Ontario, Canada

    M. A. Nait Abdallah

Authors
  1. M. A. Nait Abdallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdallah, M.A.N. (1986). Procedures in Horn-clause programming. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation