Abstract
We propose a simple notion of model for Logic Programs based on indexed monoidal categories. On the one hand our proposal is consistent with well-known techniques for providing a categorical semantics for logical systems. On the other hand, it allows us to keep the effectiveness of the Horn Clause Logic fragment of first order logic. This is shown by providing an effective construction of the initial model of a program, obtained through the application of a general methodology aimed at defining a categorical semantics for structured transition systems. Thus the declarative view (as logical theory) and the operational view (as structured transition system) of a logic program are reconciled in a highly formal framework, which provides interesting hints to possible generalizations of the logic programming paradigm.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Asperti, G. Longo, Categories, Types and Structures, an Introduction to Category Theory for the Working Computer Scientist, Foundations of Computing Series (MIT Press, Cambridge, MA, 1991).
A. Asperti, S. Martini, Projections instead of variables, A category theoretic interpretation of logic programs, Proc. 6th Int. Conf. on Logic Programming, MIT Press, 1989, pp. 337–352.
A. Asperti, S. Martini, Categorical Models of Polymorphism, Information and Computation, 99 (1), 1992, pp. 1–79.
A. Bastiani, C. Ehresmann, Categories of sketched structures, Cahiers de Topologie et Géometrie Différentielle, 13, 1973, pp. 1–105.
D.B. Benson, The Basic Algebraic Structures in Categories of Derivations, Information and Control, 28 (1), 1975, pp. 1–29.
A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo, Contributions to the Semantics of Open Logic Programs, in Proceedings of the International Conference on Fifth Generation Computer Systems 1992, pp. 570–580.
M. Barr, C. Wells, Toposes, Triples and Theories, Grundlehren der mathematischen Wissenschaften 278, Springer Verlag, 1985.
M. Barr, C. Wells, Category Theory for Computing Science, Prentice Hall, 1990.
A. Corradini, U. Montanari, Towards a Process Semantics in the Logic Programming Style, in Proc. 7th Symposium on Theoretical Aspects of Computer Science (STACS '90), LNCS 415, 1990, pp. 95–108.
A. Corradini, U. Montanari, An Algebraic Semantics of Logic Programs as Structured Transition Systems, in Proc. of the North American Conference on Logic Programming (NACLP '90), MIT Press, 1990.
A. Corradini, U. Montanari, An Algebraic Semantics for Structured Transition Systems and its Application to Logic Programs, Theoretical Computer Science, 103, 1992, pp. 51–106.
A. Colmerauer, PROLOG II —Reference Manual and Theoretical Model, Internal Report, Groupe Intelligence Artificielle, Université Aix-Marseille II, October 1982.
A. Corradini, An Algebraic Semantics for Transition Systems and Logic Programming, Ph.D. Thesis TD-8/90, Dipartimento di Informatica, Università di Pisa, March '90.
R. Goldblatt, Topoi. The Categorical Analysis of Logic, Studies in Logic and the Foundations of Mathematics, 98, North-Holland, Amsterdam. 1979.
J. W. Gray, The Category of Sketches as a Model for Algebraic Semantics, Contemporary Mathematics, 92, 1989, pp. 109–135.
Jaffar, J., Lassez, J.-L., Constraint Logic Programming, Proc. 12th ACM Symp. on Principles of Programming Languages, pp. 111–119, 1987.
R. Keller, Formal Verification of Parallel Programs, Com. ACM, 7, 1976, pp. 371–384.
A. Kock, G.C. Wraith, Elementary Toposes, Aarhus Universitet, Matematisk Institut, Lecture Notes 30, September 1971.
F. W. Lawvere, Functorial semantics of algebraic theories, Proc. National Academy of Sciences, U.S.A., 50, 1963, pp. 869–872. Summary of Ph.D. Thesis, Columbia University.
J.W. Lloyd, Foundations of Logic Programming, Springer Verlag, 1984, (2nd Edition 1987).
J. Lambek, P.J. Scott, Introduction to Higher-Order Categorical Logic, Cambridge University Press. 1986.
S. Mac Lane, Categories for the Working Mathematician, Springer Verlag, New York, 1971.
J. Meseguer, U. Montanari, Petri Nets are Monoids, Information and Computation, 88 (2), 1990, 105–155.
M. Makkai, G.E. Reyes, First Order Categorical Logic, Lecture Notes in Mathematics 611, 1977.
G. Nadathur, D. Miller, An overview of λProlog, Proc. of the Fifth Int. Conf. on Logic Programming, MIT Press, 1988, pp. 810–827.
G. Nadathur, D. Miller, Higher-Order Horn Clauses, Journal of the ACM, 37 (4), 1990, pp. 777–814.
G. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Aarhus University, Department of Computer Science, Aarhus, 1981.
J. Reynolds, Polymorphism is not set-theoretic, Symposium on Semantics of Data Types; Khan, MacQueen, Plotkin eds., LNCS 173, Springer-Verlag, 1984.
Shoenfield, J.R., Mathematical logic. Addison-Wesley Publishing Company, Reading, Massachusetts, 1967.
R.A.G. Seely, Hyperdoctrines and Natural Deduction, Ph.D. Thesis, University of Cambridge, 1977.
R.A.G. Seely, Hyperdoctrines, Natural Deduction and the Beck Condition, Zeitschrift für Math. Logik Grundlagen der Math., 29, 1983, pp. 505–542.
R.A.G. Seely, Locally cartesian closed categories and type theories, Math. Proc. Camb. Phil. Soc. 95, 1984, pp. 33–48.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, A., Asperti, A. (1993). A categorical model for logic programs: Indexed monoidal categories. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Semantics: Foundations and Applications. REX 1992. Lecture Notes in Computer Science, vol 666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56596-5_31
Download citation
DOI: https://doi.org/10.1007/3-540-56596-5_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56596-3
Online ISBN: 978-3-540-47595-8
eBook Packages: Springer Book Archive