1. N. Dershowitz, "Orderings for Term-Rewriting Systems," in Theoretical Computer Science, Vol. 17, North-Holland, 1982, pp. 279–301. Preliminary version in Proc. 20th IEEE Symp. on Foundations of Computer Science, San Juan, Puerto Rico, October 1979, pp. 123–131.
2. R. Forgaard, "A Program for Generating and Analyzing Term Rewriting Systems," Master's Thesis, MIT Lab. for Computer Science, September 1984.
3. J.-P. Jouannaud, P. Lescanne, and F. Reinig, "Recursive Decomposition Ordering," Proc. 2nd IFIP Workshop on Formal Description of Programming Concepts, Garmisch-Partenkirchen, W. Germany, June 1982. Also in "Recursive Decomposition Ordering and Multiset Orderings," Technical Memo TM-219, MIT Lab. for Computer Science, June 1982.
4. S. Kamin and J.-J. Lévy, "Attempts for Generalising the Recursive Path Orderings," Dept. of Computer Science, Univ. of Illinois, Urbana-Champaign, February 1980. Unpublished manuscript.
5. D. S. Lankford, "Canonical Algebraic Simplification in Computational Logic," Technical Report ATP-25, Automatic Theorem Proving Project, Univ. of Texas, Austin, May 1975.