K. Appel and W. Haken, Every planar map is four colorable, Bulletin of the American Mathematical Society, vol.82, issue.5, pp.711-712, 1976.
DOI : 10.1090/S0002-9904-1976-14122-5

M. Armand, A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses, CPP, pp.135-150, 2011.
DOI : 10.1145/1217856.1217859

URL : https://hal.archives-ouvertes.fr/hal-00639130

M. Aschbacher, Finite Group Theory. Cambridge Studies in Advanced Mathematics, 2000.

J. Avigad, Type inference in mathematics Bulletin of the European Association for Theoretical Computer Science, EATCS, issue.106, pp.78-98, 2012.

J. Avigad and J. Harrison, Formally verified mathematics, Communications of the ACM, vol.57, issue.4
DOI : 10.1145/2591012

H. Bender and G. Glauberman, Local analysis for the Odd Order Theorem, Number LNS, vol.188, 1994.
DOI : 10.1017/CBO9780511665592

Y. Bertot and P. Castéran, Interactive theorem proving and program development: Coq'Art: The calculus of inductive constructions, 2004.
DOI : 10.1007/978-3-662-07964-5

URL : https://hal.archives-ouvertes.fr/hal-00344237

Y. Bertot, G. Gonthier, S. O. Biha, and I. Pasca, Canonical Big Operators, TPHOLs, pp.86-101, 2008.
DOI : 10.1007/3-540-44659-1_29

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

C. Cohen, Construction of Real Algebraic Numbers in Coq, ITP, pp.67-82, 2012.
DOI : 10.1007/978-3-642-32347-8_6

URL : https://hal.archives-ouvertes.fr/hal-00671809

C. Cohen and A. Mahboubi, A Formal Quantifier Elimination for Algebraically Closed Fields, CICM, pp.189-203, 2010.
DOI : 10.1007/978-3-642-14128-7_17

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

T. Coquand and G. Huet, The calculus of constructions. Information and Computation, pp.95-120, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00076024

T. Coquand and C. Paulin-mohring, Inductively defined types, Colog'88, 1990.
DOI : 10.1007/3-540-52335-9_47

H. Derksen, The Fundamental Theorem of Algebra and Linear Algebra, The American Mathematical Monthly, vol.110, issue.7, pp.620-623, 2003.
DOI : 10.2307/3647746

W. Feit and J. G. Thompson, Chapter I, from Solvability of groups of odd order, Pacific J. Math, vol. 13, no. 3 (1963, Pacific Journal of Mathematics, vol.13, issue.3, pp.775-1029, 1963.
DOI : 10.2140/pjm.1963.13.775

F. Garillot, G. Gonthier, A. Mahboubi, and L. Rideau, Packaging Mathematical Structures, TPHOLs, pp.327-342, 2009.
DOI : 10.1007/978-3-540-68103-8_11

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

G. Gonthier, Formal proof?the Four Color Theorem, Notices of the AMS, vol.55, issue.11, pp.1382-1393, 2008.

G. Gonthier, Point-Free, Set-Free Concrete Linear Algebra, ITP, pp.103-118, 2011.
DOI : 10.1017/S0956796802004501

URL : https://hal.archives-ouvertes.fr/hal-00805966

G. Gonthier and A. Mahboubi, An introduction to small scale reflection in Coq, Journal of Formalized Reasoning, vol.3, issue.2, pp.95-152, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00515548

G. Gonthier, A. Mahboubi, L. Rideau, E. Tassi, and L. Théry, A Modular Formalisation of Finite Group Theory, TPHOLs, pp.86-101, 2007.
DOI : 10.1007/978-3-540-74591-4_8

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

G. Gonthier, A. Mahboubi, and E. Tassi, A Small Scale Reflection Extension for the Coq system
URL : https://hal.archives-ouvertes.fr/inria-00258384

G. Gonthier, B. Ziliani, A. Nanevski, and D. Dreyer, How to make ad hoc proof automation less ad hoc, ICFP, pp.163-175, 2011.

D. Gorenstein, Finite Groups, 2007.

T. Hales, Formal proof, Notices of the AMS, vol.55, issue.11, pp.1370-1380, 2008.

J. Harrison, Without Loss of Generality, TPHOLs, pp.43-59, 2009.
DOI : 10.1007/11541868_8

M. Hedberg, A coherence theorem for Martin-L??f's type theory, Journal of Functional Programming, vol.8, issue.4, pp.413-436, 1998.
DOI : 10.1017/S0956796898003153

R. Hinze, Fun with phantom types, The Fun of Programming, Cornerstones of Computing, pp.245-262, 2003.
DOI : 10.1007/978-1-349-91518-7_12

B. Huppert and N. Blackburn, Finite Groups II. Grundlehren Der Mathematischen Wissenschaften, 1982.

I. Isaacs, Character Theory of Finite Groups, AMS Chelsea Pub. Series, 1976.
DOI : 10.1090/chel/359

G. Klein, seL4, Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, SOSP '09, pp.207-220, 2009.
DOI : 10.1145/1629575.1629596

H. Kurzweil and B. Stellmacher, The Theory of Finite Groups: An Introduction, 2010.
DOI : 10.1007/b97433

X. Leroy, Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, POPL, pp.42-54, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000963

R. Mines, F. Richman, and W. Ruitenburg, A course in constructive algebra, Universitext, 1979.
DOI : 10.1007/978-1-4419-8640-5

P. M. Neumann, A. J. Mann, and J. C. Tompson, The collected papers of William Burnside, volume I, 2004.

R. O. Connor, Classical mathematics for a constructive world, Mathematical Structures in Computer Science, vol.4, issue.04, pp.861-882, 2011.
DOI : 10.1017/S0960129509007695

T. Peterfalvi, Character Theory for the Odd Order Theorem, Number LNS, vol.272, 2000.
DOI : 10.1017/CBO9780511565861

A. Tarski, A Decision Method for Elementary Algebra and Geometry, 1948.
DOI : 10.1007/978-3-7091-9459-1_3