Abstract
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.
Research partially supported by ESPRIT BRA project 6564 CONFER.
Preview
Unable to display preview. Download preview PDF.
References
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.
G. Boudol, Computational Semantics of Term Rewriting Systems, in Algebraic Methods in Semantics, eds. M. Nivat and J. Reynolds, Cambridge University Press, 1985.
A. Corradini, F. Gadducci, CPO Models for Infinite Term Rewriting, draft.
A. Corradini, Term Rewriting, in Parallel, draft.
N. Dershowitz, J.P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science B, ed. J. van Leeuwen, North Holland, 1990, pp. 243–320.
B. Jacobs, Semantics of Weakening and Contraction, draft.
G.M. Kelly, Basic Concepts of Enriched Category Theory, London Mathematical Society, LN Series 64, 1982.
G.M. Kelly, R.H. Street, Review of the Elements of 2-categories, Lecture Notes in Mathematics 420, 1974, pp. 75–103.
C. Laneve, Distributive Evaluations of λ-calculus, Fundamenta Informaticae 20 (4), 1994, pp. 333–352.
F. W. Lawvere, Functorial Semantics of Algebraic Theories, Proc. National Academy of Science 50, 1963, pp. 869–872.
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.
C. Laneve, U. Montanari, Axiomatizing Permutation Equivalence in the λ-calculus, in Proc. 3rd ALP, LNCS 632, 1992, pp. 350–363.
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.
J. Meseguer, Functorial Semantics of Rewrite Systems, appendix of Rewriting as a Unified Model of Concurrency, SRI Technical Report, CSL-93-02R, 1990.
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.
S. MacLane, Categories for the Working Mathematician, Springer, 1971.
N. Martí-Oliet, J. Meseguer, Rewriting Logic as a Logical and Semantic Framework, SRI Technical Report, CSL-93-05, 1993.
A. J. Power, An Abstract Formulation for Rewrite Systems, in Proc. CTCS'89, LNCS 389, 1989, pp. 300–312.
D.E. Rydeheard, J.G. Stell, Foundations of Equational Deduction, in Proc. CTCS'87, LNCS 283, 1987, pp. 114–339.
J. G. Stell, Categorical Aspects of Unification and Rewriting, Ph.D. Thesis, Faculty of Science, University of Manchester, 1992.
J. G. Stell, Modelling Term Rewriting System by Sesqui-categories, Technical Report TR94-02, Keele University, 1994.
R.H. Street, Categorical Structures, in Handbook of Algebra, eds. M. Hazewinkel et al., Elsevier, preprint 1992.
G. Winskel, An Introduction to Event Structures, Lecture Notes for the REX Summer School, LNCS 354, 1989, pp. 285–363.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, A., Gadducci, F., Montanari, U. (1995). Relating two categorical models of term rewriting. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_59
Download citation
DOI: https://doi.org/10.1007/3-540-59200-8_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59200-6
Online ISBN: 978-3-540-49223-8
eBook Packages: Springer Book Archive