Abstract
We propose a new framework for the syntax and semantics of logic programming, based on programming over finite product categories which incorporate constraint information directly into the notion of signature.
In this framework, we generalize the Kowalski-van Emden fixed point interpretation, a cornerstone of the declarative paradigm, to an operational, non-ground, categorical semantics for generalized languages based on uniform proof systems.
Our treatment forms the basis of a semantics-based definition of declarative programming.
This is a preview of subscription content, log in via an institution to check access.
References
A. Asperti and S. Martini. Projections instead of variables, a category theoretic interpretation of logic programs. In Proc. 6th ICLP, pages 337–352. MIT Press, 1989.
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.
Andrea Corradini and Ugo Montanari. An algebraic semantics for structured transition systems and its application to logic programs. Theoretical Computer Science, 103:51–106, 1992.
Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2–3):103–179, July 1992.
Razvan Diaconescu. Category-based semantics for equational and constraint logic programming. PhD thesis, Oxford University, 1994.
Stacy E. Finkelstein, Peter Freyd, and James Lipton. A new framework for declarative programming. To appear, 1996.
Stacy E. Finkelstein, Peter Freyd, and James Lipton. Logic programming in tau categories. In Computer Science Logic '94, LNCS 933. Springer, 1995.
Neil D. Jones. Abstract interpretation and partial evaluation in functional and logic programming. In Maurice Bruynooghe, editor, Logic Programming. Proceedings of the 1994 International Symposium, pages 17–22. The MIT Press, 1994.
J. W. Lloyd. Foundations of Logic Programming. Springer Verlag, New York, 1987.
M. Martelli M. Falaschi, G. Levi and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. TCS, 69(3), 1989.
M. Martelli M. Falaschi, G. Levi and C. Palamidessi. A model-theoretic reconstruction of the operational semantics of logic programs. Information and Computation, 102(1), 1993.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag
About this paper
Cite this paper
Lipton, J., Finkelstein, S.E., Freyd, P. (1996). A new framework for declarative programming: Categorical perspectives. In: Dyckhoff, R., Herre, H., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1996. Lecture Notes in Computer Science, vol 1050. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60983-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-60983-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60983-4
Online ISBN: 978-3-540-49751-6
eBook Packages: Springer Book Archive