E. Balland, P. Brauner, R. Kopetz, P. Moreau, and A. Reilles, Tom: Piggybacking Rewriting on Java, Proceedings of the 18th Conference on Rewriting Techniques and Applications, pp.36-47, 2007.
DOI : 10.1007/978-3-540-73449-9_5

URL : https://hal.archives-ouvertes.fr/inria-00142045

M. Brand, A. Deursen, J. Heering, H. Jong, M. Jonge et al., The ASF+SDF Meta-Environment: a Component-Based Language Development Environment, Compiler Construction, pp.365-370, 2001.

L. Cardelli and G. Ghelli, TQL: a query language for semistructured data based on the ambient logic, Mathematical Structures in Computer Science, vol.14, issue.3, pp.285-327, 2004.
DOI : 10.1017/S0960129504004141

H. Comon and C. Kirchner, Constraint Solving on Terms, LNCS, pp.47-103, 2001.
DOI : 10.1007/3-540-45406-3_2

S. Eker, Associative matching for linear terms, 1992.

S. Eker, Associative-Commutative Rewriting on Large Terms, Proceedings of the 14th International Conference on Rewriting Techniques and Applications, pp.14-29, 2003.
DOI : 10.1007/3-540-44881-0_3

C. Kirchner, Computing unification algorithms, Proceedings 1st IEEE Symposium on Logic in Computer Science, pp.206-216, 1986.

C. Kirchner and F. Klay, Syntactic theories and unification, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.270-277, 1990.
DOI : 10.1109/LICS.1990.113753

C. Kirchner, R. Kopetz, and P. Moreau, Anti-pattern Matching, Proceedings of the 16th European Symposium on Programming, pp.110-124, 2007.
DOI : 10.1007/978-3-540-71316-6_9

URL : https://hal.archives-ouvertes.fr/inria-00337722

C. Kirchner, R. Kopetz, P. Moreau, and I. Nancy, Anti-pattern Matching Modulo, 2007.
DOI : 10.1007/978-3-540-88282-4_26

URL : https://hal.archives-ouvertes.fr/inria-00337722

G. S. Makanin, THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP, Mathematics of the USSR-Sbornik, vol.32, issue.2, pp.129-198, 1977.
DOI : 10.1070/SM1977v032n02ABEH002376

C. Marché, Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations, Journal of Symbolic Computation, vol.21, issue.3, pp.253-288, 1996.
DOI : 10.1006/jsco.1996.0011

T. Nipkow, Proof transformations for equational theories, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.278-288, 1990.
DOI : 10.1109/LICS.1990.113754

T. Nipkow, Combining matching algorithms: The regular case, Journal of Symbolic Computation, vol.12, issue.6, pp.633-653, 1991.
DOI : 10.1016/S0747-7171(08)80145-9

G. Plotkin, Building-in equational theories, Machine Intelligence, vol.7, pp.73-90, 1972.

C. Ringeissen, Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories, Information and Computation, vol.126, issue.2, pp.144-160, 1996.
DOI : 10.1006/inco.1996.0042

R. Treinen, A new method for undecidability proofs of first order theories, Journal of Symbolic Computation, vol.14, issue.5, pp.437-457, 1992.
DOI : 10.1016/0747-7171(92)90016-W

W. Zhang, T. W. Ling, Z. Chen, and G. Dobbie, XDO2: A Deductive Object-Oriented Query Language for XML, DASFAA, pp.311-322, 2005.
DOI : 10.1007/11408079_29