Skip to main content
SpringerLink
Log in

Predicates as parameters in logic programming

A set-theoretic basis

  • Conference paper
  • First Online:
Extensions of Logic Programming (ELP 1989)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 475))

Included in the following conference series:

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. James H. Andrews. Proof-theoretic characterisations of logic programming. In Proceedings of the 14th International Symposium on the Mathematical Foundations of Computer Science, volume 379 of Lecture Notes in Computer Science, pages 145–154, Porabka-Kozubnik, Poland, August–September 1989. Springer.

    Google Scholar 

  2. James H. Andrews. The logical structure of sequential prolog. Technical Report LFCS-90-110, Laboratory for the Foundations of Computer Science, University of Edinburgh, Edinburgh, Scotland, April 1990.

    Google Scholar 

  3. Weidong Chen, Michael Kifer, and David S. Warren. HiLog: A first-order semantics of higher-order logic programming constructs. In Proceedings of the North American Conference on Logic Programming, Cleveland, Ohio, October 1989.

    Google Scholar 

  4. Saumya K. Debray and David S. Warren. Automatic mode inference for Prolog programs. In Proceedings of 1986 Symposium on Logic Programming, pages 78–88, Salt Lake City, Utah, September 1983.

    Google Scholar 

  5. Paul C. Gilmore. Natural deduction based set theories: A new resolution of the old paradoxes. Journal of Symbolic Logic, 51(2):393–411, June 1986.

    Google Scholar 

  6. Masami Hagiya and Takafumi Sakurai. Foundation of logic programming based on inductive definition. New Generation Computing, 2:59–77, 1984.

    Google Scholar 

  7. Lars Hallnäs and Peter Schroeder-Heister. A proof-theoretic approach to logic programming. Technical Report R88005, Swedish Institute of Computer Science, 1988.

    Google Scholar 

  8. Dale A Miller. Lexical scoping as universal quantification. In Proceedings of the Sixth International Logic Programming Conference, pages 268–283, Lisbon, Portugal, June 1989.

    Google Scholar 

  9. Dale A. Miller and Gopalan Nadathur. Higher-order logic programming. In Proceedings of the Third International Logic Programming Conference, Imperial College, London, July 1986.

    Google Scholar 

  10. Dale A. Miller and Gopalan Nadathur. Some uses of higher-order logic in computational linguistics. In Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics, pages 247–255, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Edinburgh University, UK

    James H. Andrews

Authors
  1. James H. Andrews
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Schroeder-Heister

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andrews, J.H. (1991). Predicates as parameters in logic programming. In: Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1989. Lecture Notes in Computer Science, vol 475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038691

Download citation

  • DOI: https://doi.org/10.1007/BFb0038691

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53590-4

  • Online ISBN: 978-3-540-46879-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation