Relating two categorical models of term rewriting

  • A. Corradini
  • F. Gadducci
  • U. Montanari
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 914)


In the last years there has been a growing interest towards categorical models for term rewriting systems (trs's). In our opinion, very interesting are those associating to each trs's a cat-enriched structure: a category whose hom-sets are categories. Interpreting rewriting steps as morphisms in hom-categories, these models provide rewriting systems with a concurrent semantics in a clean algebraic way. In this paper we provide a unified presentation of two models recently proposed in literature by José Meseguer [Mes90, Mes92, MOM93] and John Stell [Ste92, Ste94], respectively, pursuing a critical analysis of both of them. More precisely, we show why they are to a certain extent unsatisfactory in providing a concurrent semantics for rewriting systems. It turns out that the derivation space of Meseguer's Rewriting Logic associated with each term (i.e., the set of coinitial computations) fails in general to form a prime algebraic domain: a condition that is generally considered as expressing a directly implementable model of concurrency for distributed systems (see [Win89]). On the contrary, the resulting derivation space in Stell's model is actually a prime algebraic domain, but too few computations are identified: only disjoint concurrency can be expressed, limiting the degree of parallelism described by the model.


term rewriting categorical models concurrency rewriting logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ADJ77]
    J.A. Goguen, J.W. Tatcher, E.G. Wagner, J.R. Wright, Initial Algebra Semantics and Continuous Algebras, Journal of ACM 24 (1), 1977, pp. 68–95.CrossRefGoogle Scholar
  2. [Bou85]
    G. Boudol, Computational Semantics of Term Rewriting Systems, in Algebraic Methods in Semantics, eds. M. Nivat and J. Reynolds, Cambridge University Press, 1985.Google Scholar
  3. [CG94]
    A. Corradini, F. Gadducci, CPO Models for Infinite Term Rewriting, draft.Google Scholar
  4. [Cor94]
    A. Corradini, Term Rewriting, in Parallel, draft.Google Scholar
  5. [DJ90]
    N. Dershowitz, J.P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science B, ed. J. van Leeuwen, North Holland, 1990, pp. 243–320.Google Scholar
  6. [Jac93]
    B. Jacobs, Semantics of Weakening and Contraction, draft.Google Scholar
  7. [Kel82]
    G.M. Kelly, Basic Concepts of Enriched Category Theory, London Mathematical Society, LN Series 64, 1982.Google Scholar
  8. [KS74]
    G.M. Kelly, R.H. Street, Review of the Elements of 2-categories, Lecture Notes in Mathematics 420, 1974, pp. 75–103.Google Scholar
  9. [Lan94]
    C. Laneve, Distributive Evaluations of λ-calculus, Fundamenta Informaticae 20 (4), 1994, pp. 333–352.Google Scholar
  10. [Law63]
    F. W. Lawvere, Functorial Semantics of Algebraic Theories, Proc. National Academy of Science 50, 1963, pp. 869–872.Google Scholar
  11. [Lev80]
    J. J. Lévy, Optimal Reductions in the λ-calculus, in To H.B. Curry, Essays in Combinatory Logic, Lambda Calculus and Formalism, eds. J.P. Seldin and J.R. Hindley, Academic Press, 1980, pp. 159–191.Google Scholar
  12. [LM92]
    C. Laneve, U. Montanari, Axiomatizing Permutation Equivalence in the λ-calculus, in Proc. 3rd ALP, LNCS 632, 1992, pp. 350–363.Google Scholar
  13. [LMR94]
    P. Lincoln, J. Meseguer, L. Ricciulli, The Rewrite Rule Machine Node Architecture and its Performance, in Proc. CONPAR'94, LNCS 854, 1994, pp. 509–520.Google Scholar
  14. [Mes90]
    J. Meseguer, Functorial Semantics of Rewrite Systems, appendix of Rewriting as a Unified Model of Concurrency, SRI Technical Report, CSL-93-02R, 1990.Google Scholar
  15. [Mes92]
    J. Meseguer, Conditional Rewriting Logic as a Unified Model of Concurrency, in Selected Papers of 2th Workshop on Concurrency and Compositionality, Theoretical Computer Science 96, 1992, pp. 73–155.CrossRefGoogle Scholar
  16. [ML71]
    S. MacLane, Categories for the Working Mathematician, Springer, 1971.Google Scholar
  17. [MOM93]
    N. Martí-Oliet, J. Meseguer, Rewriting Logic as a Logical and Semantic Framework, SRI Technical Report, CSL-93-05, 1993.Google Scholar
  18. [Pow89]
    A. J. Power, An Abstract Formulation for Rewrite Systems, in Proc. CTCS'89, LNCS 389, 1989, pp. 300–312.Google Scholar
  19. [RS87]
    D.E. Rydeheard, J.G. Stell, Foundations of Equational Deduction, in Proc. CTCS'87, LNCS 283, 1987, pp. 114–339.Google Scholar
  20. [Ste92]
    J. G. Stell, Categorical Aspects of Unification and Rewriting, Ph.D. Thesis, Faculty of Science, University of Manchester, 1992.Google Scholar
  21. [Ste94]
    J. G. Stell, Modelling Term Rewriting System by Sesqui-categories, Technical Report TR94-02, Keele University, 1994.Google Scholar
  22. [Str92]
    R.H. Street, Categorical Structures, in Handbook of Algebra, eds. M. Hazewinkel et al., Elsevier, preprint 1992.Google Scholar
  23. [Win89]
    G. Winskel, An Introduction to Event Structures, Lecture Notes for the REX Summer School, LNCS 354, 1989, pp. 285–363.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • A. Corradini
    • 1
  • F. Gadducci
    • 1
  • U. Montanari
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations