J. Abrial, The B-book -assigning programs to meanings, pp.1-779, 2005.

K. Aehlig, F. Haftmann, and T. Nipkow, A Compiled Implementation of Normalization by Evaluation, Theorem Proving in Higher Order Logics, 21st International Conference, pp.5170-5209, 2008.
DOI : 10.1007/11532231_4

B. Ahrens and C. Kapulkin, Shulman 2013 « Univalent categories and the Rezk completion », ArXiv e-prints

T. Altenkirch, C. Mcbride, and P. Morris, Generic Programming with Dependent Types », in Datatype- Generic Programming -International Spring School, Lecture Notes in Computer Science, pp.4719-209, 2006.

J. Aransay, C. Ballarin, and J. Rubio, A Mechanized Proof of the Basic Perturbation Lemma, Journal of Automated Reasoning, vol.126, issue.5, pp.271-292, 2008.
DOI : 10.1007/s10817-007-9094-x

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, Certified Programs and Proofs -First International Conference, pp.7086-135, 2011.
DOI : 10.1145/1217856.1217859

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

M. Armand and B. Grégoire, Arnaud Spiwack et Laurent Théry 2010 « Extending Coq with Imperative Features and Its Application to SAT Verification, Interactive Theorem Proving, First International Conference, pp.6172-83, 2010.

J. Armstrong and . Erlang, Erlang, Communications of the ACM, vol.53, issue.9, pp.68-75
DOI : 10.1145/1810891.1810910

P. Audebaud and C. Paulin-mohring, Proofs of randomized algorithms in Coq, Science of Computer Programming, vol.74, issue.8, pp.568-589, 2009.
DOI : 10.1016/j.scico.2007.09.002

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

R. Ayala, E. Domínguez, A. R. Francés, and A. Quintero, Homotopy in digital spaces, Homotopy in digital spaces, pp.3-24, 2003.
DOI : 10.1016/S0166-218X(02)00221-4

R. Back and . Wright, Refinement calculus -a systematic introduction, Undergraduate texts in computer science, pp.1-519, 1999.

H. G. Baker, Shallow binding in Lisp 1.5, Shallow binding makes functional arrays fast », SIGPLAN Notices, pp.565-569, 1991.
DOI : 10.1145/359545.359566

B. Barras, L. D. , C. González-huesca, H. Herbelin, Y. Régis-gianas et al., Makarius Wenzel et Burkhart Wolff 2013 « Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems, Intelligent Computer Mathematics -MKM, Calculemus , DML, and Systems and Projects 2013, Held as Part of CICM 2013, pp.7961-359

B. Barras and B. Grégoire, On the Role of Type Decorations in the Calculus of Inductive Constructions, Computer Science Logic, 19th International Workshop , CSL 2005, 14th Annual Conference of the EACSL, pp.3634-151, 2005.
DOI : 10.1007/11538363_12

B. Barras, J. Jouannaud, P. Strub, and Q. Wang, CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.143-151, 2011.
DOI : 10.1109/LICS.2011.37

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

G. Barthe, V. Capretta, and O. Pons, Setoids in type theory, Journal of Functional Programming, vol.13, issue.02, pp.261-293, 2003.
DOI : 10.1017/S0956796802004501

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

G. Barthe, M. Ruys, and H. Barendregt, A two-level approach towards lean proof-checking, Types for Proofs and Programs, International Workshop TYPES'95, pp.1158-1174, 1995.
DOI : 10.1007/3-540-61780-9_59

J. Bernardy, P. Jansson, and R. Paterson, Proofs for free, Journal of Functional Programming, vol.83, issue.02, pp.107-152, 2012.
DOI : 10.1007/BFb0037116

N. Bilton, IPhone Alarm Glitch Greets New Year -NYTimes.com, 2011.

. Boespflug, M. Mathieu, B. Dénès, and . Grégoire, Full Reduction at Full Throttle, Certified Programs and Proofs -First International Conference, pp.7086-362, 2011.
DOI : 10.1007/3-540-44464-5_13

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

. Boulmé, Sylvain 2000 Spécification d'un environnement dédié à la programmation certifiée de bibliothèques de Calcul Formel

S. Boutin, Using reflection to build efficient and certified decision procedures, Theoretical Aspects of Computer Software, Third International Symposium, TACS '97, pp.1281-515, 1997.
DOI : 10.1007/BFb0014565

B. Boyer, J. Dumas, C. Pernet, and W. Zhou, Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.55-62, 2009.
DOI : 10.1145/1576702.1576713

N. Brisebarre, M. Joldes, É. Martin-dorel, M. Mayero, J. Muller et al., Laurence Rideau et Laurent Théry 2012 « Rigorous Polynomial Approximation Using Taylor Models in Coq, NASA Formal Methods -4th International Symposium, NFM 2012, pp.7226-85

J. R. Bunch, E. John, and . Hopcroft, Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, vol.28, issue.125, pp.125-231, 1974.
DOI : 10.1090/S0025-5718-1974-0331751-8

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

J. Chrzaszcz, Implementing Modules in the Coq System, Theorem Proving in Higher Order Logics, 16th International Conference, pp.2758-270, 2003.
DOI : 10.1007/10930755_18

. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, pp.56-68
DOI : 10.2307/2371199

. Cohen, Cyril 2012 Formalized algebraic numbers : construction and first order theory

C. Cohen, Maxime Dénès et Anders Mörtberg 2013 « Refinements for free !, Certified Programs and Proofs -Third International Conference, CPP 2013

S. Conchon and J. Filliâtre, A persistent union-find data structure, Proceedings of the 2007 workshop on Workshop on ML , ML '07, pp.37-46, 2007.
DOI : 10.1145/1292535.1292541

D. Coppersmith and . Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396

URL : http://doi.org/10.1016/s0747-7171(08)80013-2

T. Coquand and P. Gérard, The calculus of constructions, Information and Computation, vol.76, issue.2-3, pp.95-120
DOI : 10.1016/0890-5401(88)90005-3

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

T. Coquand and H. Persson, Gröbner Bases in Type Theory », in Types for Proofs and Programs, International Workshop TYPES '98, Lecture Notes in Computer Science, pp.1657-1690, 1998.

P. -. Cornilleau, Emmanuel 2013 Certification of static analysis in many-sorted first-order logic, thèse de doct, École normale supérieure de

D. , P. , and A. Nicolau, Adaptive Winograd's matrix multiplications, ACM Trans. Math. Softw, vol.36, issue.1, 2009.

O. Danvy, Type-Directed Partial Evaluation, Conference Record of PO- PL'96 : The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.242-257, 1996.

. Dargaye, Zaynah 2009 Vérification formelle d'un compilateur optimisant pour langages fonctionnels

D. Bruijn and N. Govert, The mathematical language AUTOMATH, its usage, and some of its extensions, Symposium on Automatic Demonstration, pp.125-154, 1970.

M. Dénès, Anders Mörtberg et Vincent Siles 2012 « A Refinement-Based Approach to Computational Algebra in Coq, Interactive Theorem Proving -Third International Conference, ITP 2012, pp.7406-83

C. Domínguez and J. Rubio, Effective homology of bicomplexes, formalized in Coq, Theoretical Computer Science, vol.412, issue.11, pp.962-970, 2011.
DOI : 10.1016/j.tcs.2010.11.016

G. Dowek, T. Hardin, and C. Kirchner, Theorem Proving Modulo, Journal of Automated Reasoning, vol.31, issue.1, pp.33-72, 2003.
DOI : 10.1023/A:1027357912519

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

A. Filinski and . Et-henning-korsholm-rohde, A Denotational Account of Untyped Normalization by Evaluation, Foundations of Software Science and Computation Structures, 7th International Conference, pp.2987-167, 2004.

. Forman, Robin 1998 « Morse theory for cell complexes », Advances in mathematics, pp.90-145

R. Gamboa, J. Cowles, and J. Van-baalen, Using ACL2 Arrays to Formalize Matrix Algebra, Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2 '03), 2003.

H. Geuvers and F. Wiedijk, A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals, Types for Proofs and Programs, International Workshop, pp.2277-96, 2000.
DOI : 10.1007/3-540-45842-5_7

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

. Point-free, Set-Free Concrete Linear Algebra The Netherlands, Interactive Theorem Proving -Second International Conference, pp.6898-103, 2011.

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

G. Gonthier and B. Ziliani, Aleksandar Nanevski et Derek Dreyer 2011 « How to make ad hoc proof automation less ad hoc, Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, pp.163-175, 2011.

. González-díaz, B. Rocío, P. Medrano, J. Real, and . Sánchez-peláez, Algebraic Topological Analysis of Time-Sequence of Digital Images, Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, pp.3718-208, 2005.
DOI : 10.1007/11555964_18

. González-díaz, Rocío et Pedro Real 2011 « On the Cohomology of 3D Digital Images

B. Grégoire and X. Leroy, A compiled implementation of strong reduction, Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), pp.235-246, 2002.

B. Grégoire and A. Mahboubi, Proving Equalities in a Commutative Ring Done Right in Coq, Theorem Proving in Higher Order Logics, 18th International Conference, pp.3603-98, 2005.
DOI : 10.1007/11541868_7

T. C. Hales, Introduction to the Flyspeck Project, Mathematics, Algorithms, Proofs, Dagstuhl Seminar Proceedings, Internationales Begegnungsund Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, p.5021, 2005.

J. Harrison, Metatheory and Reflection in Theorem Proving : A Survey and Critique, 1995.

J. Harrison and L. Théry, A Skeptic's Approach to Combining HOL and Maple, Journal of Automated Reasoning, vol.21, issue.3, pp.279-294, 1998.
DOI : 10.1023/A:1006023127567

J. Heras, M. Dénès, and G. Mata, Anders Mörtberg, María Poza et Vincent Siles 2012 « Towards a Certified Computation of Homology Groups for Digital Images, Computational Topology in Image Context -4th International Workshop, pp.7309-7358

H. Herbelin, 2013 « The Coq proof assistant reference manual

J. E. Hopcroft, R. Leslie, and . Kerr, On Minimizing the Number of Multiplications Necessary for Matrix Multiplication, SIAM Journal on Applied Mathematics, vol.20, issue.1, pp.30-36, 1971.
DOI : 10.1137/0120004

P. Hudak, J. Hughes, S. L. Jones, and P. Wadler, A history of Haskell, Proceedings of the third ACM SIGPLAN conference on History of programming languages , HOPL III, pp.1-55, 2007.
DOI : 10.1145/1238844.1238856

. Huss-lederman, E. M. Steven, J. R. Jacobson, and . Johnson, Anna Tsao et Thomas Turnbull 1996 « Implementation of Strassen's Algorithm for Matrix Multiplication, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing, p.32

C. Kaliszyk and F. Wiedijk, Certified Computer Algebra on Top of an Interactive Theorem Prover », in Towards Mechanized Mathematical Assistants, 14th Symposium , Calculemus, 6th International Conference, pp.4573-94, 2007.

C. Keller, 2013 A Matter of Trust : Skeptical Communication Between Coq and External Provers

C. Keller and M. Lasson, Parametricity in an Impredicative Sort, Computer Science Logic (CSL'12) -26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, pp.381-395, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00730913

. Keller-gehrig, Fast algorithms for the characteristics polynomial, Theoretical Computer Science, vol.36, pp.309-317
DOI : 10.1016/0304-3975(85)90049-0

G. Klein, K. Elphinstone, G. Heiser-andronick, D. Cock, P. Derrin et al., seL4, Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, SOSP '09, pp.207-220, 2009.
DOI : 10.1145/1629575.1629596

P. A. Knight, 1995 « Fast rectangular matrix multiplication and QR decomposition », Linear Algebra and its Applications, pp.69-81
DOI : 10.1016/0024-3795(93)00230-w

URL : http://doi.org/10.1016/0024-3795(93)00230-w

R. Krebbers and B. Spitters, Type classes for efficient exact real arithmetic in Coq, Logical Methods in Computer Science, vol.9, issue.1, 2011.
DOI : 10.2168/LMCS-9(1:1)2013

P. Lammich, Automatic Data Refinement, Interactive Theorem Proving -4th International Conference, pp.7998-84, 2013.
DOI : 10.1007/978-3-642-39634-2_9

J. Mccarthy, Recursive functions symbolic expressions and their computation by machine, Part I, Communications of the ACM, vol.3, issue.4, pp.184-195, 1960.
DOI : 10.1145/367177.367199

. Melquiond, Floating-point arithmetic in the Coq system, Information and Computation, vol.216, pp.14-23
DOI : 10.1016/j.ic.2011.09.005

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

S. Obua, Proving Bounds for Real Linear Programs in Isabelle/HOL, Theorem Proving in Higher Order Logics, 18th International Conference, pp.3603-227, 2005.
DOI : 10.1007/11541868_15

D. Orden and F. Santos, Asymptotically Efficient Triangulations of the d-Cube », Discrete & Computational Geometry, pp.509-528, 2003.

O. Biha and . Sidi, Formalisation des mathématiques : une preuve du théorème de Cayley, JFLA (Journées Francophones des Langages Applicatifs), pp.1-14, 2008.

. Palomo-lozano, I. Francisco, . Medina-bulo, A. José, and . Alonso-jiménez, Certification of Matrix Multiplication Algorithms. Strassen's Algorithm in ACL2, Supplemental Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics, 2001.

. Paulin-mohring, Christine 1989a « Extracting F(omega)'s Programs from Proofs in the Calculus of Constructions, POPL, pp.89-104

M. Potet and Y. Rouzaud, Composition and Refinement in the B-Method », in B'98 : Recent Advances in the Development and Use of the B Method, Second International B Conference, Lecture Notes in Computer Science, pp.1393-1439, 1998.

. Pottier, Loic 1999 User contributions in Coq : Algebra, http://coq.inria.fr/pylons

. Spitters, Type classes for mathematics in type theory, Mathematical Structures in Computer Science, vol.2, issue.04, pp.795-825
DOI : 10.1007/3-540-48256-3_10

A. Spiwack, Computing in Homological Algebra, A Journey Exploring the Power and Limits of Dependent Type Theory, thèse de doct, 2011.

J. Stein, Documentation of my formalization of Linear Algebra, rapp. tech, 2001.

A. Storjohann, Deterministic computation of the Frobenius form, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.368-377, 2001.
DOI : 10.1109/SFCS.2001.959911

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969.
DOI : 10.1007/BF02165411

URL : http://www.digizeitschriften.de/download/PPN362160546_0013/PPN362160546_0013___log38.pdf

L. Théry, A Machine-Checked Implementation of Buchberger's Algorithm, Journal of Automated Reasoning, vol.26, issue.2, pp.107-137, 2001.
DOI : 10.1023/A:1026518331905

K. Verma, J. Neeraj, S. Goubault-larrecq, S. Prasad, and . Arun-kumar, Reflecting BDDs in Coq, Advances in Computing Science - ASIAN 2000, 6th Asian Computing Science Conference, pp.162-181, 1961.
DOI : 10.1007/3-540-44464-5_13

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

P. Wadler, Views: a way for pattern matching to cohabit with data abstraction, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.307-313, 1987.
DOI : 10.1145/41625.41653

V. Williams and . Vassilevska, Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.887-898, 2012.
DOI : 10.1145/2213977.2214056