Skip to main content
SpringerLink
Log in

Compilation of predicate abstractions in higher-order logic programming

  • Session: Extension Of Logic Programming
  • Conference paper
  • First Online:
Book cover Programming Language Implementation and Logic Programming (PLILP 1991)

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

Abstract

We explore higher-order logic programming and its relationship to computation in predicate calculus. The framework is based upon a logic of untyped λ-calculus which has a general model-theoretic semantics and whose equality theory corresponds to α-equivalence. The focus of the paper is on computing with predicate abstractions that are formalized by equivalence axioms with respect to a notion called top reduction. It is shown that, under certain conditions, computation with predicate abstractions can be compiled into predicate calculus and all most general answers are still preserved.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt and M.H. van Emden. Contributions to the theory of logic programming. JACM, 29(3):841–862, July 1982.

    Google Scholar 

  2. H.P. Barendregt. The Lambda Calculus: Its Syntax and Semantics (Revised Edition). North-Holland Publishing Co., 1984.

    Google Scholar 

  3. W. Chen, M. Kifer, and D.S. Warren. HiLog: A first order semantics for higher-order logic programming constructs. In Proc. North American Conference on Logic Programming, October 1989.

    Google Scholar 

  4. W. Chen and D.S. Warren. Predicate abstractions in higher-order logic programming. Manuscript, March 1991.

    Google Scholar 

  5. M.H.M. Cheng, M.H. van Emden, and B.E. Richards. On Warren's method for functional programming in logic. In Proc. ICLP, pages 546–560, 1990.

    Google Scholar 

  6. W.D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225–230, 1981.

    Google Scholar 

  7. G.P. Huet. A unification algorithm for typed λ-calculus. TCS, 1:27–57, 1975.

    Google Scholar 

  8. G. Nadathur and N. Miller. Higher-order horn clauses. JACM, 37(4), 1990.

    Google Scholar 

  9. J. Staples and P.J. Robinson. Efficient unification of quantified terms. Journal of Logic Programming, 5:133–149, 1988.

    Google Scholar 

  10. A. van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proc. 7th ACM Symp. on PODS, 1988.

    Google Scholar 

  11. D.H.D. Warren. Higher-order extensions to Prolog: are they needed? Machine Intelligence, 10:441–454, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science & Engineering, Southern Methodist University, 75275-0122, Dallas, TX

    Weidong Chen

  2. Computer Science Department, SUNY at Stony Brook, 11794-4400, Stony Brook, NY

    David Scott Warren

Authors
  1. Weidong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Scott Warren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Maluszyński Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, W., Warren, D.S. (1991). Compilation of predicate abstractions in higher-order logic programming. In: Maluszyński, J., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1991. Lecture Notes in Computer Science, vol 528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54444-5_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-54444-5_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54444-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation