Skip to main content
SpringerLink
Log in

λProlog: An extended logic programming language

  • Conference paper
  • First Online:
Book cover 9th International Conference on Automated Deduction (CADE 1988)

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

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

References

  1. A. Felty and D. Miller, Specifying Theorem Provers in a Higher-Order Logic Programming Language. Ninth International Conference on Automated Deduction, 23–26 May 1988, Argonne Ill.

    Google Scholar 

  2. G. P. Huet, A Unification Algorithm for Typed λ-Calculus. Theoretical Computer Science 1, 1975, 27–57.

    Article  Google Scholar 

  3. G. P. Huet and B. Lang, Proving and Applying Program Transformations Expressed with Second-Order Patterns. Acta Informatica 11, (1978), 31–55.

    Article  Google Scholar 

  4. D. Miller, A Logical Analysis of Modules for Logic Programming. To appear in the Journal of Logic Programming.

    Google Scholar 

  5. D. Miller and G. Nadathur, Some Uses of Higher-Order Logic in Computational Linguistics. Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics, 1986, 247–255.

    Google Scholar 

  6. D. Miller and G. Nadathur, Higher-Order Logic Programming. Proceedings of the Third International Logic Programming Conference, London, June 1986, 448–462.

    Google Scholar 

  7. D. Miller and G. Nadathur, A Logic Programming Approach to Manipulating Formulas and Programs. IEEE Symposium on Logic Programming, San Francisco, September 1987.

    Google Scholar 

  8. D. Miller, G. Nadathur, and A. Scedrov, Hereditary Harrop Formulas and Uniform Proofs Systems. Second Annual Symposium on Logic in Computer Science, Cornell University, June 1987, 98–105.

    Google Scholar 

  9. G. Nadathur, A Higher-Order Logic as the Basis for Logic Programming. Ph.D. Dissertation, University of Pennsylvania, May 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Information Science, University of Pennsylvania, USA

    Amy Felty, Elsa Gunter, John Hannan & Dale Miller

  2. Computer Science, Duke University, USA

    Gopalan Nadathur

  3. Mathematics, University of Pennsylvania, USA

    Andre Scedrov

Authors
  1. Amy Felty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elsa Gunter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Hannan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dale Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gopalan Nadathur
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Andre Scedrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Felty, A., Gunter, E., Hannan, J., Miller, D., Nadathur, G., Scedrov, A. (1988). λProlog: An extended logic programming language. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012882

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19343-2

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation