1. Dershowitz, N. [1979], A note on simplification orderings, Information Processing Letters, vol. 9, no. 5, pp. 212–215.
2. Dershowitz, N. and Manna, Z. [Aug. 1979], Proving termination with multiset orderings, CACM, vol. 22, no. 8, pp. 465–476.
3. Huet, G. [Oct. 1980], Confluent reductions: Abstract properties and applications to term rewriting systems, J. ACM, vol. 27, no. 4, pp. 797–821.
4. Huet, G. and Lankford, D.S. [Mar. 1978], On the uniform halting problem for term rewriting systems, Rapport laboria 283, INRIA, Le Chesnay, France.
5. Huet, G. and Levy, J.-J. [Aug. 1979], Call by need computations in non-ambiguous linear term rewriting systems, Rapport laboria 359, INRIA, Le Chesnay, France; to appear.