Skip to main content
SpringerLink
Log in

Functorial Semantics of Rewrite Theories

  • Chapter
Formal Methods in Software and Systems Modeling

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3393))

Abstract

This paper develops a close analogy between Lawvere’s functorial semantics of equational theories [21], and a similar 2-functorial semantics for rewrite theories, which specify concurrent systems and whose models are “true concurrency” models of such systems. This has the advantage of unifying within a single 2-functorial framework both models and rewrite theory morphisms. Such morphisms are used in Maude to “put rewrite theories together” in different constructions, including parameterized rewrite theory specifications.

Research supported by ONR Grant N00014-02-1-0715 and NSF Grant CCR-0234524.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  2. Bénabou, J.: Structures algébriques dans les catégories. Cahiers de Topologie et Géometrie Différentielle 10, 1–126 (1968)

    Google Scholar 

  3. Bruni, R.: Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Dipartimento di Informatica, Universit‘a di Pisa (1999), Technical Report TD-1/99, http://www.di.unipi.it/phd/tesi/tesi_1999/TD-1-99.ps.gz

  4. Bruni, R., Meseguer, J.: Generalized rewrite theories. In: Baeten, J., Lenstra, J., Parrow, J., Woeginger, G. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 252–266. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Bruni, R., Meseguer, J., Montanari, U.: Symmetric monoidal and cartesian double categories as a semantic framework for tile logic. Mathematical Structures in Computer Science, vol. 12, pp. 53–90 (2002)

    Google Scholar 

  6. Burstall, R., Goguen, J.: Putting theories together to make specifications. In: Reddy, R. (ed.) Proceedings, Fifth International Joint Conference on Artificial Intelligence. Department of Computer Science, pp. 1045–1058. Carnegie-Mellon University (1977)

    Google Scholar 

  7. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.: Maude: specification and programming in rewriting logic. Theoretical Computer Science 285, 187–243 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude 2.0 Manual (June 2003), http://maude.cs.uiuc.edu

  9. Corradini, A., Gadducci, F., Montanari, U.: Relating two categorical models of term rewriting. In: Hsiang, J. (ed.), Proc. Rewriting Techniques and Applications, Kaiserslautern, vol. 240, pp. 225–240 (1995)

    Google Scholar 

  10. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. Handbook of Theoretical Computer Science, vol. B, pp. 243–320. North-Holland, Amsterdam (1990)

    Google Scholar 

  11. Durán, F., Meseguer, J.: On parameterized theories and views in Full Maude 2.0. In: Futatsugi, K. (ed.) Proc. 3rd. Intl. Workshop on Rewriting Logic and its Applications. ENTCS. Elsevier, Amsterdam (2000)

    Google Scholar 

  12. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specifications 1, Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer, Heidelberg (1985)

    Google Scholar 

  13. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specifications 2, Module Specifications and Constraints. EATCS Monographs on Theoretical Computer Science, vol. 21. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  14. Eilenberg, S., Moore, J.C.: Adjoint functors and triples. Illinois J. Math. 9, 381–398 (1965)

    MATH  MathSciNet  Google Scholar 

  15. Gabriel, P., Ulmer, F.: Lokal präsentierbare Kategorien. Springer Lecture Notes in Mathematics, vol. 221 (1971)

    Google Scholar 

  16. Gadducci, F.: On the Algebraic Approach to Concurrent Term Rewriting. PhDthesis, Dipartimento di Informatica, Universit‘a di Pisa, Technical Report TD-2/96 (March 1996)

    Google Scholar 

  17. Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner. The MIT Press, Cambridge (2000), http://www.di.unipi.it/~ugo/festschrift.ps

    Google Scholar 

  18. Kelly, G.: Basic Concepts of Enriched Category Theory. Cambridge Univ. Press, Cambridge (1982)

    MATH  Google Scholar 

  19. Kelly, G.: Structures defined by finite limits in the enriched context. I. Cahiers de Topologie et Géometrie Différentielle 23, 3–42 (1982)

    MATH  Google Scholar 

  20. Kelly, G., Street, R.: Review of the elements of 2-categories. In: Kelly, G. (ed.) Category Seminar, Sydney 1972/73. Springer Lecture Notes in Mathematics, vol. 420, pp. 75–103 (1974)

    Google Scholar 

  21. Lawvere, F.W.: Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences 50, 869–873 (1963); Summary of Ph.D. Thesis, Columbia University

    Google Scholar 

  22. MacLane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)

    Google Scholar 

  23. Martí-Oliet, N., Meseguer, J., Palomino, M.: Theoroidal maps as algebraic simulations. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 126–143. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Meseguer, J.: Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory (February 1990) (Revised, June 1990)

    Google Scholar 

  25. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  26. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18–61. Springer, Heidelberg (1998)

    Google Scholar 

  27. Meseguer, J., Montanari, U.: Petri nets are monoids. Information and Computation 88, 105–155 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  28. Meseguer, J., Montanari, U.: Mapping tile logic into rewriting logic. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 62–91. Springer, Heidelberg (1998)

    Google Scholar 

  29. Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational abstractions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 2–16. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  30. Miyoshi, H.: Modelling conditional rewriting logic in structured categories. In: Meseguer, J. (ed.) Proc. First Intl. Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 4. Elsevier, Amsterdam (1996)

    Google Scholar 

  31. Pitts, A.: An elementary calculus of approximations. University of Sussex (December 1987) (unpublished manuscript)

    Google Scholar 

  32. Rydeheard, D., Stell, J.: Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms. In: Pitt, D.H., Rydeheard, D.E., Poigné, A. (eds.) Category Theory and Computer Science. LNCS, vol. 283, pp. 114–139. Springer, Heidelberg (1987)

    Google Scholar 

  33. Stell, J.: Modelling term rewriting systems by sesqui-categories. Technical Report TR94-02, Keele University, Also in shorter form in Proc. CAEN, pp. 121–127 (1994)

    Google Scholar 

  34. Street, R.: Limits indexed by category-valued 2-functors. J. Pure Appl. Algebra 8, 149–181 (1976)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois at Urbana-Champaign, USA

    José Meseguer

Authors
  1. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  2. Dipartimento di Informatica, Università di Pisa,  

    Ugo Montanari

  3. Dpto de L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Philipps-Universität Marburg, Germany

    Gabriele Taentzer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Meseguer, J. (2005). Functorial Semantics of Rewrite Theories. In: Kreowski, HJ., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds) Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, vol 3393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31847-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24936-8

  • Online ISBN: 978-3-540-31847-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation