1. Bergstra, J. A., and Klop, J. W., “Conditional rewrite rules: Confluence and termination”, Report IW 198/82 MEI, Mathematische Centrum, Amsterdam, 1982.
2. Bergstra, J. A., and Klop, J. W. “Conditional rewrite rules: confluency and termination”, JCSS 32 pp. 323–362, 1986.
3. Brand, D., Darringer, J. A., Joyner, W. J. “Completeness of conditional reductions”. Report RC 7404, IBM Thomas J. Watson Research Center, December 1978.
4. Dershowitz, N. “Orderings for term-rewriting systems”. Theoretical Computer Science 17(3), pp. 279–301 (March 1982).
5. Dershowitz, N., and Okada, M. “Proof-theoretic techniques for term rewriting theory”. Proceedings of the third annual Symposium on Logic in Computer Science, Edinburgh, July 1988 (to appear).