1. Ait-Kaci, H. “An algorithm for finding a minimal recursive path ordering”, Report MS-CIS-83-7, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 1983.
2. Bachmair, L., and Dershowitz, N. “Commutation, transformation, and termination”. (1985) (submitted).
3. Bachmair, L., and Plaisted, D. A. “Associative path ordering”. Proceedings of the First International Conference on Rewriting Techniques and Applications, Dijon, France (May 1985).
4. Ben Cherifa, A. “Preuve de la terminaison finie d'un système de reécriture par l'ordre polynômial”, Unpublished manuscript, Centre de Recherche en Informatique de Nancy, Nancy, France, 1984.
5. Bergstra, J. A., and Tucker, J. V. “Equational specifications for computable data types: Six hidden functions suffice and other sufficiency bounds”, Preprint IW 128/80, Mathematisch Centrum, Amsterdam, The Netherlands, January 1980.