Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Gauert, J.R. Kennaway, M.J. Plasmeijer and M.R. Sleep (1987), Term graph rewriting, Proc. PARLE'87, Lecture Notes in Computer Science 259, pp. 141–158, Springer-Verlag.
2. B. Courcelle (1990), Graph rewriting: an algebraic and logic approach, In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 193–242, North-Holland.
3. N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 243–320, North-Holland.
4. J.W. Klop (1992), Term Rewriting Systems, tech rep. CS-R9073, CWI, Amsterdam. Also appears as a chapter in S. Abramsky, D. Gabbay and T. Maibaum (ed.), Handbook of Logic in Computer Science, Vol. 2, Oxford Press, 1992.
5. M. Kurihara and A. Ohuchi (1995), Modularity in noncopying term rewriting, to appear in Theoretical Computer Science.