Skip to main content
SpringerLink
Log in

An introduction to category-based equational logic

  • Invited Lectures
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1995)

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

Abstract

This paper surveys category-based equational logic, which generalises both the theoretical and computational aspects of equational logic and its model theory (general algebra) far beyond terms, so as to include: Horn clause logic, with and without equality; all variants of order and many sorted equational logic, including working modulo a set of axioms; constraint logic programming over arbitrary user-defined data types; and any combination of the above. This unifies several important computational paradigms, and opens the door to still further generalisations. Results include completeness of deduction, a Herbrand theorem, completeness of paramodulation, generic modularisation techniques, and a model theoretic semantics for extensible constraint logic programing.

The research in this paper was supported in part by the Science and Engineering Research Council, the CEC under ESPRIT-2 BRA Working Groups 6071, IS-CORE (Information Systems COrrectness and REusability) and 6112, COMPASS (COM-Prehensive Algebraic Approach to System Specification and development), Fujitsu Laboratories Limited, and a contract managed by the Information Technology Promotion Agency (IPA), Japan, as part of the Industrial Science and Technology Frontier Program “New Models for Software Architectures,” sponsored by NEDO (New Energy and Industrial Technology Development Organization).

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. Hajnal Andréka and István Németi. A general axiomatizability theorem formulated in terms of cone-injective subcategories. In B. Csakany, E. Fried, and E.T. Schmidt, editors, Universal Algebra, pages 13–35. North-Holland, 1981. Colloquia Mathematics Societas János Bolyai, 29.

    Google Scholar 

  2. Jon Barwise. Axioms for abstract model theory. Annals of Mathematical Logic, 7:221–265, 1974.

    Google Scholar 

  3. Jon Barwise and Solomon Feferman. Model-Theoretic Logics. Springer, 1985.

    Google Scholar 

  4. M. Bauderon and Bruno Courcelle. Graph expressions and graph rewritings. Math. Systems Theory, 20, 1987.

    Google Scholar 

  5. Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31:433–454, 1935.

    Google Scholar 

  6. Virgil Căzănescu. Local equational logic. In Zoltan Esik, editor, Proceedings, 9th International Conference on Fundamentals of Computation Theory FCT'93, pages 162–170. Springer-Verlag, 1993. Lecture Notes in Computer Science, Volume 710.

    Google Scholar 

  7. Nachum Dershowitz. Computing with rewrite rules. Technical Report ATR-83(8478)-1, The Aerospace Corp., 1983.

    Google Scholar 

  8. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewriting systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pages 243–320. North-Holland, 1990.

    Google Scholar 

  9. Răzvan Diaconescu, Joseph Goguen, and Petros Stefaneas. Logical support for modularisation. In Gerard Huet and Gordon Plotkin, editors, Logical Environments, pages 83–130. Cambridge, 1993. Proceedings of a Workshop held in Edinburgh, Scotland, May 1991.

    Google Scholar 

  10. Răzvan Diaconescu. The logic of Horn clauses is equational. Technical Report PRG-TR-3-93, Programming Research Group, University of Oxford, 1990.

    Google Scholar 

  11. Răzvan Diaconescu. Category-based Semantics for Equational and Constraint Logic Programming. PhD thesis, Oxford University, 1994.

    Google Scholar 

  12. Răzvan Diaconescu. Category-based modularisation for equational logic programming. submitted for publication.

    Google Scholar 

  13. Răzvan Diaconescu. Completeness of category-based equational deduction. Mathematical Structures in Computer Science, to appear 1994.

    Google Scholar 

  14. M. Fay. First-order unification in an equational theory. In Proceedings, 4th Workshop on Automated Deduction, Austin, Texas, pages 161–167, 1979.

    Google Scholar 

  15. Laurent Fribourg. SLOG: A logic programming language interpreter based on clausal superposition and rewriting. In Proceedings, SLP '85, pages 172–185. 1985.

    Google Scholar 

  16. Joseph Goguen. Reusing and interconnecting software components. Computer, 19(2):16–28, February 1986. Reprinted in Tutorial: Software Reusability, Peter Freeman, editor, IEEE Computer Society, 1987, pages 251–263, and in Domain Analysis and Software Systems Modelling, Rubén Prieto-Díaz and Guillermo Arango, editors, IEEE Computer Society, 1991, pages 125–137.

    Google Scholar 

  17. Joseph Goguen. Theorem Proving and Algebra. MIT, to appear 1995.

    Google Scholar 

  18. Joseph Goguen and Rod Burstall. Institutions: Abstract model theory for specification and programming. J. Assoc. Computing Machinery, 39(1):95–146, January 1992. Also Report ECS-LFCS-90-106, Computer Science Department, University of Edinburgh, January 1990.

    Google Scholar 

  19. Joseph Goguen and Răzvan Diaconescu. An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science, 4:363–392, 1994.

    Google Scholar 

  20. Joseph Goguen and José Meseguer. Completeness of many-sorted equational logic. Houston Journal of Mathematics, 11(3):307–334, 1985. Preliminary versions appeared in SIGPLAN Notices, July 1981, Volume 16, Number 7, pages 24–37, and SRI Computer Science Lab, Report CSL-135, May 1982.

    Google Scholar 

  21. Joseph Goguen and José Meseguer. Models and equality for logical programming. In Hartmut Ehrig, Giorgio Levi, Robert Kowalski, and Ugo Montanari, editors, Proceedings, 1987 TAPSOFT, pages 1–22. Springer, 1987. Lecture Notes in Computer Science, Volume 250.

    Google Scholar 

  22. Joseph Goguen and José Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105(2):217–273, 1992. Also Programming Research Group Technical Monograph PRG-80, Oxford University, December 1989.

    Google Scholar 

  23. Joseph Goguen, James Thatcher, and Eric Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. Technical Report RC 6487, IBM T.J. Watson Research Center, October 1976. In Current Trends in Programming Methodology, IV, Raymond Yeh, editor, Prentice-Hall, 1978, pages 80–149.

    Google Scholar 

  24. Joseph Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. In Joseph Goguen, editor, Algebraic Specification with OBJ: An Introduction with Case Studies. Cambridge, to appear 1995. Also Technical Report, SRI International.

    Google Scholar 

  25. George Gratzer. Universal Algebra. Springer, 1979.

    Google Scholar 

  26. William S. Hatcher. Quasiprimitive categories. Math. Ann., (190):93–96, 1970.

    Google Scholar 

  27. Horst Herrlich and C.M.Ringel. Identities in categories. Can. Math. Bull., (15):297–299, 1972.

    Google Scholar 

  28. Steffen Hölldobler. Foundations of equational logic programming. In Lecture Notes in Artificial Intelligence, number 353. Springer Verlag, 1988.

    Google Scholar 

  29. Gérard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. J. Assoc. Computing Machinery, 27(4):797–821, 1980. Preliminary version in Proceedings, 18th IEEE Symposium on Foundations of Computer Science, IEEE, 1977, pages 30–45.

    Google Scholar 

  30. Gérard Huet and Derek Oppen. Equations and rewrite rules: A survey. In Ron Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349–405. Academic, 1980.

    Google Scholar 

  31. Jean-Marie Hullot. Canonical forms and unification. In Wolfgang Bibel and Robert Kowalski, editors, Proceedings, 5th Conference on Automated Deduction, pages 318–334. Springer, 1980. Lecture Notes in Computer Science, Volume 87.

    Google Scholar 

  32. Horst Herrlich, Jiri Adamek and George Strecker. Abstract and Concrete Categories. John Wiley, 1990.

    Google Scholar 

  33. Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In 14th ACM Symposium on the Principles of Programming languages, pages 111–119. 1987.

    Google Scholar 

  34. Jean-Pierre Jouannaud and Hélène Kirchner. Completion of a set of rules modulo a set of equations. Proceedings, 11th Symposium on Principles of Programming Languages, 1984. In SIAM Journal of Computing.

    Google Scholar 

  35. Jan Willem Klop. Term rewriting systems: from Church-Rosser to Knuth-Bendix and beyond. In Samson Abramsky, Dov Gabbay, and Tom Maibaum, editors, Handbook of Logic in Computer Science. Oxford, 1992.

    Google Scholar 

  36. Saunders Mac Lane. Categories for the Working Mathematician. Springer, 1971.

    Google Scholar 

  37. Dallas Lankford and A.M. Ballantyne. Decision procedures for simple equational theories with permutative axioms: Complete sets of permutative reductions. Technical Report ATP-37, Dept. of Mathematics and Computer Science, Univ. of Texas, Austin, 1977.

    Google Scholar 

  38. Peter Mosses. Unified algebras and institutions. In Proceedings, Fourth Annual Conference on Logic in Computer Science, pages 304–312. IEEE, 1989.

    Google Scholar 

  39. Pieter-Hendrik Rodenburg. A simple algebraic proof of the equational interpolation theorem. Algebra Universalis, 28:48–51, 1991.

    Google Scholar 

  40. J.R. Slagle. Automatic theorem proving in theories with simplifiers, commutativity and associativity. Journal of ACM, 21:622–642, 1974.

    Google Scholar 

  41. Andrzej Tarlecki. Free constructions in algebraic institutions. In M.P. Chytil and V. Koubek, editors, Proceedings, International Symposium on Mathematical Foundations of Computer Science, pages 526–534. Springer, 1984. Lecture Notes in Computer Science, Volume 176; extended version, University of Edinburgh, Computer Science Department, CSR-149-83.

    Google Scholar 

  42. Alfred Tarski. The semantic conception of truth. Philos. Phenomenological Research, 4:13–47, 1944.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, Oxford University Computing Lab, OX1 3QD, Oxford, UK

    Joseph A. Goguen

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 70700, Bucharest, Romania

    Răzvan Diaconescu

Authors
  1. Joseph A. Goguen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Răzvan Diaconescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. S. Alagar Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goguen, J.A., Diaconescu, R. (1995). An introduction to category-based equational logic. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-60043-4_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60043-5

  • Online ISBN: 978-3-540-49410-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation