Selected papers that cite this one
- Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic confluence. Information and Computation, 114(1):1-29, October 1994.
- Daniel J. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101(2):251-267, December 1992.
- Bernhard Gramlich. On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoretical Computer Science, 165(1):97-131, 30 September 1996.
- Jean-Pierre Jouannaud and Mitsuhiro Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349-391, 28 February 1997.
- Masahito Kurihara and Azuma Ohuchi. Modularity in noncopying term rewriting. Theoretical Computer Science, 152(1):139-169, 11 December 1995.
- Massimo Marchiori. Bubbles in modularity. Theoretical Computer Science, 192(1):31-54, 10 February 1998.
- Aart Middeldorp. Modular properties of conditional term rewriting systems. Information and Computation, 104(1):110-158, May 1993.
- Enno Ohlebusch. Termination is not modular for confluent variable-preserving term rewriting systems. Information Processing Letters, 53(4):223-228, 24 February 1995.
- M. R. K. Krishna Rao. Modular aspects of term graph rewriting. Theoretical Computer Science, 208(1-2):59-86, 28 November 1998.
- Y. Toyama, Jan Willem Klop, and H. P. Barendregt. Termination for direct sums of left-linear complete term rewriting systems. Journal of the ACM, 42(6):1275-1304, November 1995.