A. Abel, A Polymorphic Lambda-Calculus with Sized Higher-Order Types, 2006.

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

B. Barras, Auto-validation d'un système de preuves avec familles inductives, Thèse de doctorat, 1999.

G. Barthe, B. Grégoire, and S. Zanella-béguelin, Formal certification of code-based cryptographic proofs See also: CertiCrypt http, 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, pp.90-101, 2009.

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development, 2004.
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237

C. Böhm and A. Berarducci, Automatic synthesis of typed ??-programs on term algebras, Theoretical Computer Science, vol.39, 1985.
DOI : 10.1016/0304-3975(85)90135-5

S. Boldo, F. Clément, J. Filliâtre, M. Mayero, G. Melquiond et al., Formal Proof of a Wave Equation Resolution Scheme: The Method Error, Proceedings of the first Interactive Theorem Proving Conference, pp.147-162, 2010.
DOI : 10.1007/978-3-642-14052-5_12
URL : https://hal.archives-ouvertes.fr/inria-00450789

B. Chetali and Q. Nguyen, About the world-first smart card certificate with EAL7 formal assurances. Slides 9th ICCC, 2008.

E. Contejean, A. Paskevich, X. Urbain, P. Courtieu, O. Pons et al., A3PAT, an approach for certified automated termination proofs, Proceedings of the ACM SIGPLAN 2010 workshop on Partial evaluation and program manipulation, PEPM '10, pp.63-72, 2010.
DOI : 10.1145/1706356.1706370
URL : https://hal.archives-ouvertes.fr/inria-00535655

. Th and . Coquand, An analysis of girard's paradox, Symposium on Logic in Computer Science, 1986.

. Th, G. Coquand, and . Huet, Constructions: A higher order proof system for mechanizing mathematics, EUROCAL'85, 1985.

. Th, G. Coquand, and . Huet, The Calculus of Constructions, Information and Computation, vol.76, issue.23, 1988.

. Th, C. Coquand, and . Paulin-mohring, Inductively defined types, Proceedings of Colog'88, 1990.

P. Dybjer, Inductive families, Formal Aspects of Computing, vol.30, issue.3, pp.440-465, 1994.
DOI : 10.1007/BF01211308

G. Gonthier, Formal proof the four-color theorem. Notices of the AMS, pp.1382-1393, 2008.

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

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, pp.107-115, 2009.
DOI : 10.1145/1538788.1538814
URL : https://hal.archives-ouvertes.fr/inria-00415861

P. Martin-löf, Intuitionistic Type Theory, 1984.

G. Morrisett, The Ynot project

C. Paulin-mohring, Inductive definitions in the system Coq rules and properties, Proceedings of the conference Typed Lambda Calculi a nd Applications, pp.92-141, 1993.
DOI : 10.1007/BFb0037116

C. Paulin-mohring, Tools for Practical Software Verification, LASER 2011 summerschool, Revised Tutorial Lectures, chapter Introduction to the Coq proof-assistant for practical software verification, Number 7682 in Lecture Notes in Computer Science, pp.45-95, 2012.

L. C. Paulson, A fixedpoint approach to implementing (Co)inductive definitions, Proceedings of the 12th International Conference on Automated Deduction, pp.148-161, 1994.
DOI : 10.1007/3-540-58156-1_11

F. Pfenning and C. Paulin-mohring, Inductively defined types in the Calculus of Constructions, Proceedings of Mathematical Foundations of Programming Semantics, 1990.
DOI : 10.1007/BFb0040259

L. Théry and G. Hanrot, Primality Proving with Elliptic Curves, Lecture Notes in Computer Science, vol.4732, pp.319-333, 2007.
DOI : 10.1007/978-3-540-74591-4_24