A. Asperti, M. E. Maietti, C. Sacerdoti-coen, G. Sambin, and S. Valentini, Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita, Proceedings of the 18th Calculemus and 10th International Conference on Intelligent Computer Mathematics, pp.278-280, 2011.
DOI : 10.1016/j.apal.2009.01.006

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development ? Coq'Art : The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

Y. Bertot and G. Gonthier, Sidi Ould Biha et Ioana Pa?ca : Canonical big operators, Theorem Proving in Higher Order Logics, 21st International Conference, 2008.
DOI : 10.1007/978-3-540-71067-7_11

F. Bobot, S. Conchon, É. Contejean, and M. Iguernelala, Stéphane Lescuyer et Alain Mebsout : The Alt-Ergo automated theorem prover, 2008.

R. Stephen-boyer and . Strother-moore, A Computational Logic Handbook, 1988.

G. Cano and M. Dénès, Matrices à blocs et en forme canonique, JFLA -Journées francophones des langages applicatifs, p.25, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00779376

C. Cohen, Formalized algebraic numbers : construction and first-order theory, Thèse de doctorat, École Polytechnique, p.23, 2012.
URL : https://hal.archives-ouvertes.fr/pastel-00780446

C. Cohen and M. Dénès, Anders Mörtberg et Vincent Siles : Smith Normal form and executable rank for matrices, 2012.

L. De, M. , and N. Bjørner, Z3 : An efficient SMT solver, Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2008.

F. Garillot, Outils génériques de preuve et théorie des groupes finis. These, Ecole Polytechnique X, décembre 2011, p.80

F. Garillot, G. Gonthier, A. Mahboubi, and L. Rideau, Packaging Mathematical Structures, éditeurs : Theorem Proving in Higher Order Logics, p.80, 2009.
DOI : 10.1007/978-3-540-68103-8_11

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

I. Gil, Contribution à l'algèbre linéaire formelle, Thèse de doctorat, p.25, 1993.

R. Gomboa, J. Cowles, and J. Van-baalen, Using ACL2 arrays to formalize matrix algebra, p.50, 2003.

G. Gonthier, The Four Colour Theorem: Engineering of a Formal Proof, Computer Mathematics, 8th Asian Symposium, ASCM 2007, p.333, 2007.
DOI : 10.1007/978-3-540-87827-8_28

G. Gonthier, A. Asperti, J. Avigad, Y. Bertot, C. Cohen et al., A Machine-Checked Proof of the Odd Order Theorem, Interactive Theorem Proving -4th International Conference Proceedings, volume 7998 de Lecture Notes in Computer Science, pp.163-179, 2013.
DOI : 10.1007/978-3-642-39634-2_14

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

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

T. Callister and H. , Introduction to the flyspeck project, Mathematics , Algorithms, Proofs, volume 05021 de Dagstuhl Seminar Proceedings. Internationales Begegnungs-und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, 2005.

T. Callister-hales, J. Harrison, S. Mclaughlin, T. Nipkow, S. Obua et al., A Revision of the Proof of the Kepler Conjecture, Discrete & Computational Geometry, vol.70, issue.4, pp.1-34, 2010.
DOI : 10.1007/s00454-009-9148-4

J. Harrison, A HOL theory of Euclidean space éditeurs : Theorem Proving in Higher Order Logics, 18th International Conference, p.67, 2005.

J. Harrison, Handbook of Practical Logic and Automated Reasoning, 2009.
DOI : 10.1017/CBO9780511576430

J. Harrison, The HOL-Light system reference, 2013.

J. Hölzl, F. Immler, and B. Huffman, Type classes and filters for mathematical analysis in Isabelle/HOL, Proceedings of the 4th International Conference on Interactive Theorem Proving, ITP'13, pp.279-294, 2013.

M. Kaufmann, J. Strother-moore, and P. Manolios, Computer- Aided Reasoning : An Approach, 2000.

R. David and . Lester, Topology in PVS : Continuous mathematics with applications, Proceedings of the Second Workshop on Automated Formal Methods, AFM '07, pp.11-20, 2007.

G. Melquiond, User's guide for gappa, 2013.

J. Merlet, Interval Analysis and Reliability in Robotics, mars, p.69, 2006.

M. Muzalewski, An outline of PC Mizar Fondation Philippe le Hodey, 1993.

R. Naulin and C. Pabst, The roots of a polynomial depend continuously on its coefficients, Revista Colombiana de Matemáticas, vol.28, issue.1, pp.35-37, 1994.

M. Norrish and K. Slind, The HOL system reference Automated Reasoning Group, 2013.

S. Obua, Proving Bounds for Real Linear Programs in Isabelle/HOL, Lecture Notes in Computer Science, vol.3603, pp.227-244, 2005.
DOI : 10.1007/11541868_15

P. Ozello, Calcul exact des formes de Jordan et de Frobenius d'une matrice, Thèse de doctorat, p.25, 1987.
URL : https://hal.archives-ouvertes.fr/tel-00323705

B. Padlewska and A. Darmochwa?, Topological spaces and continuous functions, Formalized Mathematics, vol.1, issue.1, pp.223-230, 1990.

K. P?k, Block Diagonal Matrices, Formalized Mathematics, vol.16, issue.3, pp.259-267, 2008.
DOI : 10.2478/v10037-008-0031-1

K. P?k, Eigenvalues of a Linear Transformation, Formalized Mathematics, vol.16, issue.4, pp.289-295, 2008.
DOI : 10.2478/v10037-008-0035-x

K. P?k, Jordan Matrix Decomposition, Formalized Mathematics, vol.16, issue.4, pp.297-303, 2008.
DOI : 10.2478/v10037-008-0036-9

I. Pa?ca, Vérification formelle pour les méthodes numériques, Thèse de doctorat, p.77, 2010.

G. Sambin, The basic picture, a structure for topology (the basic picture, i) Rapport technique, 2001.

V. Siles, A formal proof of the Cauchy-Binet formula, 2012.

M. Sozeau and N. Oury, First-Class Type Classes, Otmame Aït-Mohamed, César Muñoz et Sofiène Tahar, éditeurs : 21th International Conference on Theorem Proving in Higher Order Logics, p.53, 2008.
DOI : 10.1007/11542384_8

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

S. Sternberg, Dynamical Systems, p.69, 2010.

M. Wenzel, The Isabelle/Isar reference manual, 2013.