Abstract
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [Lü96], this semantics was used to give a purely categorical proof of the modularity of confluence for the disjoint union of term rewriting systems. This paper provides further support for monadic semantics of rewriting by giving a categorical proof of the most general theorem concerning the modularity of strong normalisation. In the process, we improve upon the technical aspects of earlier work.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Barr and C. Wells. Toposes, Triples and Theories. Springer 1985.
N. Ghani. Adjoint Rewriting. PhD thesis, University of Edinburgh, 1995.
B. Gramlich. Generalized sufficient conditions for modular termination of rewriting. In Proc. 3rd ICALP, LNCS 632, pages 53–68. Springer, 1992.
C. B. Jay. Modelling reductions in confluent categories. In Proc. Durham Symposium on Applications of Categories in Computer Science, 1990.
G. M. Kelly. Basic Concepts of Enriched Category Theory, LMS Lecture Notes 64. Cambridge University Press, 1982.
J. W. Klop. Term rewriting systems. In S. Abramsky et.al., eds., Handbook of Logic in Computer Science Vol. 2, pages 1–116. OUP, 1992.
M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. TCS 103:273–282, 1992.
G. M. Kelly and A. J. Power. Adjunctions whose counits are coequalizers, and presentations of finitary monads. JPAA 89:163–179, 1993.
C. Lüth. Compositional term rewriting: An algebraic proof of Toyama's theorem. In RTA'96, LNCS 1103, pages 261–275, Springer Verlag, 1996.
C. Lüth. Categorical Term Rewriting: Monads and Modularity. PhD thesis, University of Edinburgh, 1997. Forthcoming.
S. Mac Lane. Categories for the Working Mathematician. Springer 1971.
E. G. Manes. Algebraic Theories, Springer Verlag, 1976.
A. Middeldorp. A sufficient condition for the termination of the direct sum of term rewriting systems. In Proc. 4th LICS, p. 396-401. June 1989.
E. Ohlebusch. On the modularity of termination of term rewriting systems. TCS 136:333–360, 1994.
E. Robinson. Variations on algebra: monadicity and generalisations of equational theories. Tech. Rep. 6/94, Sussex Univ. Comp. Sci., 1994.
D. E. Rydeheard and J. G. Stell. Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms. In CTCS '87, LNCS 283, pages 114–139. Springer Verlag, 1987.
M. Rusinowitch. On the termination of the direct sum of term-rewriting systems. Information Processing Letters, 26(2):65–70, 1987.
R. A. G. Seely. Modelling computations: A 2-categorical framework. In Proc. 2nd LICS, pages 65–71, 1987.
J. G. Stell. Modelling term rewriting systems by Sesqui-categories. Technical Report TR94-02, Keele Unversity, January 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lüth, C., Ghani, N. (1997). Monads and modular term rewriting. In: Moggi, E., Rosolini, G. (eds) Category Theory and Computer Science. CTCS 1997. Lecture Notes in Computer Science, vol 1290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026982
Download citation
DOI: https://doi.org/10.1007/BFb0026982
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63455-3
Online ISBN: 978-3-540-69552-3
eBook Packages: Springer Book Archive