Christoph Luth and Neil Ghani. Monads and modular term rewriting. In Category theory and computer science (Santa Margherita Ligure, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Path Rewriting and Combined Word Problems - Fiorentini, Ghilardi (2000) (1 citation) (Correct)
....not projections) The complete table of rules of R is given at the end of Section 5. 2 We recall that there is another quite interesting category theoretic approach to universal algebra, namely the monads approach (which has also been signi cantly used in questions related to rewriting, see e.g. [10]) 3 Although R is a quite simply described system, the con uence proof requires long work, because all critical pairs must be examined. This leads to a large amount of details, all consisting of elementary computations (in fact, once the technical tools are appropriately settled, single cases ....
Christoph Luth and Neil Ghani. Monads and modular term rewriting. In Category theory and computer science (Santa Margherita Ligure, 1997), pages 69-86. Springer, Berlin, 1997. 83
Path Rewriting and Combined Word Problems - Fiorentini, Ghilardi (2000) (1 citation) (Correct)
No context found.
Christoph Luth and Neil Ghani. Monads and modular term rewriting. In Category theory and computer science (Santa Margherita Ligure, 1997.
Scritical Pairs and Sunification - Goguen, Marcus (Correct)
No context found.
Christoph Luth and Neil Ghani. Monads and modular term rewriting. In Category Theory in Computer Science '97, pages 69-86. Springer, Lecture Notes in Computer Science, volume 1290, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC