G. Bernot, M. Bidoit, and C. Choppy, Abstract data types with exception handling: an initial approach based on a distinction between exceptions and errors, Theoretical Computer Science, vol.46, pp.13-45, 1986.

N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, pp.279-301, 1982.

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1 & 2, pp.69-116, 1987.

I. Gnaedig, Termination of rewriting in order-sorted algebras, 1991.

I. Gnaedig, ELIOS-OBJ: Theorem proving in a specification language, Proceedings of the 4th European Symposium on Programming, vol.582, pp.182-199, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00074889

I. Gnaedig, C. Kirchner, and . Kirchner, Equational completion in order-sorted algebras, Theoretical Computer Science, vol.72, pp.169-202, 1990.

J. A. Goguen and J. Meseguer, Order-sorted algebra I: Partial and overloaded operations, errors and inheritance, 1983.

J. A. Goguen, J. Meseguer, and D. Plaisted, Programming with parameterized abstract objects in OBJ, Theory And Practice of Software Technology, pp.163-193, 1982.

J. V. Guttag, J. J. Horning, and J. M. Wing, Larch in five easy pieces, 1985.

J. , R. Hindley, and J. P. Seldin, Introduction to Combinators and Lambda-calculus, 1986.

G. Huet and D. Oppen, Equations and rewrite rules: A survey, Formal Language Theory: Perspectives and Open Problems, pp.349-405, 1980.

S. Kamin and J. Lévy, Attempts for generalizing the recursive path ordering, 1982.

C. Kirchner, J. Héì-ene-kirchner, and . Meseguer, Operational semantics of OBJ-3, Proceedings of 15th International Colloquium on Automata, Languages and Programming, vol.317, pp.287-301, 1988.

G. Smolka, Tel (version 0.9), report and user manual, 1988.

Y. Toyama, On the Church-Rosser property for the direct sum of term rewriting systems, Journal of the ACM, vol.34, issue.1, pp.128-143, 1986.