
Ferreira, M.C.F. (1997). Recursively defined (quasi) orders on terms. UU-CS 1997-13. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Ferreira, M.C.F. & Zantema, H. (1996). Total termination of term rewriting. Applicable algebra in engineering, communication and computing, 7(2), 133-162. Ferreira, M.C.F. & Zantema, H. (1994). Dummy elimination: making termination easier. UU-CS 1994-47. Utrecht. Ferreira, M.C.F. & Zantema, H. (1994). Syntactical analysis of total termination. UU-CS 1994-28. Utrecht. Ferreira, M.C.F. & Zantema, H. (1994). Well-foundedness of term orderings. UU-CS 1994-46. Utrecht. Ferreira, M.C.F. & Zantema, H. (1992). Total termination of term rewriting. RUU-CS 92-42. Utrecht.