S. F. Allen, R. L. Constable, D. J. Howe, and W. E. Aitken, The semantics of reflected proof, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.95-105, 1990.
DOI : 10.1109/LICS.1990.113737

C. Alvarado and Q. Nguyen, ELAN for Equational Reasoning in Coq, Proc. LFM'00. INRIA, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00107864

M. Armand, G. Faure, B. Grégoire, C. Keller, L. Théry et al., A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses, Proc. CPP, 2011.
DOI : 10.1145/1217856.1217859
URL : https://hal.archives-ouvertes.fr/hal-00639130

G. Barthe, M. Ruys, and H. Barendregt, A two-level approach towards lean proof-checking, Proc. TYPES, pp.16-35, 1995.
DOI : 10.1007/3-540-61780-9_59

F. Besson, Fast Reflexive Arithmetic Tactics the Linear Case and Beyond, Selected papers of TYPES'06, pp.48-62, 2007.
DOI : 10.1007/978-3-540-74464-1_4

A. Boudet, J. Jouannaud, and M. Schmidt-schauß, Unification in Boolean Rings and Abelian Groups, Journal of Symbolic Computation, vol.8, issue.5, pp.449-477, 1989.
DOI : 10.1016/S0747-7171(89)80054-9

S. Boutin, Using reflection to build efficient and certified decision procedures, Proc. TACS, pp.515-529, 1997.
DOI : 10.1007/BFb0014565

T. Braibant and D. Pous, Tactics for working modulo AC in Coq. Coq library available at http://sardes.inrialpes.fr, 2010.

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., The Maude 2.0 System, Proc RTA, 2003.
DOI : 10.1007/3-540-44881-0_7

E. Contejean, A Certified AC Matching Algorithm, Proc. RTA, pp.70-84, 2004.
DOI : 10.1007/978-3-540-25979-4_5

S. Eker, Single Elementary Associative-Commutative Matching, Journal of Automated Reasoning, vol.28, issue.1, pp.35-51, 2002.
DOI : 10.1023/A:1020122610698

G. Gonthier, B. Ziliani, A. Nanevski, and D. Dreyer, How to make ad hoc proof automation less ad hoc, Proc. ICFP. ACM, 2011.

B. Grégoire and A. Mahboubi, Proving Equalities in a Commutative Ring Done Right in Coq, Proc. TPHOLs, pp.98-113, 2005.
DOI : 10.1007/11541868_7

J. M. Hullot, Associative Commutative pattern matching, Proc. IJCAI, pp.406-412, 1979.

Q. H. Nguyen, C. Kirchner, and H. Kirchner, External Rewriting for Skeptical Proof Assistants, J. Autom. Reasoning, vol.29, pp.3-4309, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00101009

T. Nipkow, Equational reasoning in Isabelle, Science of Computer Programming, vol.12, issue.2, pp.123-149, 1989.
DOI : 10.1016/0167-6423(89)90038-5

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

G. Peterson and M. Stickel, Complete Sets of Reductions for Some Equational Theories, Journal of the ACM, vol.28, issue.2, pp.233-264, 1981.
DOI : 10.1145/322248.322251

G. Plotkin, Building in equational theories, Machine Intelligence, vol.7, 1972.

K. Slind, AC unification in HOL90, Proc. HUG, pp.436-449, 1993.
DOI : 10.1007/3-540-57826-9_154

M. Sozeau and N. Oury, First-Class Type Classes, Proc. TPHOL, pp.278-293, 2008.
DOI : 10.1007/11542384_8
URL : https://hal.archives-ouvertes.fr/inria-00628864