Skip to main content

Logic programming in Tau Categories

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1994)

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

Included in the following conference series:

  • 156 Accesses

Abstract

Many features of current logic programming languages are not captured by conventional semantics. Their fundamentally non-ground character, and the uniform way in which such languages have been extended to typed domains subject to constraints, suggest that a categorical treatment of constraint domains, of programming syntax and of semantics may be closer in spirit to declarative programming than conventional set theoretic semantics.

We generalize the notion of a (many-sorted) logic program and of a resolution proof by defining them both over a (not necessarily free) τ-category, a category with products enriched with a mechanism for canonically manipulating n-ary relations. Computing over this domain includes computing over the Herbrand Universe, and over equationally presented constraint domains as special cases. We give a categorical treatment of the fix-point semantics of Kowalski and van Emden, which establishes completeness in a very general setting.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Levi A. Bossi, M. Gabbrielli and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19–20, 1994.

    Google Scholar 

  2. A. Asperti and S. Martini. Projections instead of variables, a category theoretic interpretation of logic programs. In Proc. 6 th 1CLP, pages 337–352. MIT Press, 1989.

    Google Scholar 

  3. Michael Barr and Charles Wells. Toposes, Triples, and Theories. Springer-Verlag, 1985.

    Google Scholar 

  4. A. Corradini and A. Asperti. A categorical model for logic programs: Indexed monoidal categories. In Proceedings REX Workshop '92. Springer Lecture Notes in Computer Science, 1992.

    Google Scholar 

  5. A. Corradini and U. Montanari. An algebraic semantics of logic programs as structured transition systems. In Proceedings of the North American Conference on Logic Programming (NACLP '90). MIT Press, 1990.

    Google Scholar 

  6. Stacy E. Finkelstein. Tau Categories and Logic Programming. PhD thesis, University of Pennsylvania, 1994.

    Google Scholar 

  7. Peter Freyd and Andre Scedrov. Categories, Allegories. North-Holland, 1990.

    Google Scholar 

  8. Joxan Jaffar and Michael Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19/20, 1994.

    Google Scholar 

  9. J. Lambek and P.J. Scott. Introduction to Higher Order Categorical Logic. Cambridge, 1986.

    Google Scholar 

  10. Saunders Mac Lane and Ieke Moerdijk. Sheaves in Geometry and Logic. Springer-Verlag, 1992.

    Google Scholar 

  11. James Lipton and Paul Broome. Combinatory logic programming. In Proc. ILPS'94. MIT, 1994.

    Google Scholar 

  12. J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, New York, 1987.

    Google Scholar 

  13. M. Gabbrielli M. Alpuente, M. Falaschi and G. Levi. The semantics of equational logic programming as an instance of clp. In Logic Programming Languages. MIT, 1993.

    Google Scholar 

  14. Michael Makkai and Gonzalo Reyes. First Order Categorical Logic, volume 611 of Lecture Notes in Mathematics. Springer-Verlag, 1977.

    Google Scholar 

  15. Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 1990.

    Google Scholar 

  16. P. Panangaden, V. Saraswat, P.J. Scott, and R.A.G. Seely. A hyperdoctrinal view of constraint systems. In Lecture Notes in Computer Science 666. Springer-Verlag, 1993.

    Google Scholar 

  17. A. Poigne. Algebra categorically. In Category Theory and Computer Programming. Springer, 1986.

    Google Scholar 

  18. D.E. Rydeheard and R.M. Burstall. A categorical unification algorithm. In Category Theory and Computer Programming, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Finkelstein, S.E., Freyd, P., Lipton, J. (1995). Logic programming in Tau Categories. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022261

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics