A. Asperti, W. Ricciotti, C. Sacerdoti-coen, and E. Tassi, A compact kernel for the calculus of inductive constructions, Sadhana, vol.174, issue.4, pp.71-144, 2009.
DOI : 10.1007/s12046-009-0003-3

D. Aspinall, Proof General: A Generic Tool for Proof Development, Proceedings of TACAS'2000, 2000.
DOI : 10.1007/3-540-46419-0_3
URL : http://homepages.inf.ed.ac.uk/da/papers/pgoutline/pgoutline.pdf

H. Barendregt, Introduction to generalized type systems, J. Funct. Program, vol.1, issue.2, pp.125-154, 1991.

H. Barendregt, Lambda Calculi with Types, Handbook of Logic in Computer Science, 1991.
DOI : 10.1017/cbo9781139032636

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

B. Barras, Sets in Coq, Coq in Sets, Journal of Formalized Reasoning, vol.3, issue.1, pp.29-48, 2010.

G. Barthe, J. Forest, D. Pichardie, and V. Rusu, Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant, Lecture Notes in Computer Science, vol.15, issue.1, pp.114-129, 2006.
DOI : 10.1023/A:1019916231463
URL : https://hal.archives-ouvertes.fr/inria-00564237

H. Benl, Proof theory at work : Program development in the Minlog system Automated Deduction : A Basis for Applications. Volume II, Systems and Implementation Techniques, 1998.
DOI : 10.1007/978-94-017-0435-9_2
URL : http://www.mathematik.uni-muenchen.de/~schwicht/papers//deduktion98/Minlog7.ps.Z

S. Berghofer, A Constructive Proof of Higman???s Lemma in Isabelle, Types for Proofs and Programs, 2003.
DOI : 10.1007/978-3-540-24849-1_5

S. Berghofer and . Proofs, Programs and Executable Specifications in Higher Order Logic, 2003.

J. Chrz?szcz, Implementing Modules in the Coq System, 16th International Conference on Theorem Proving in Higher Order Logics, 2003.
DOI : 10.1007/10930755_18

A. Church, A Set of Postulates for the Foundation of Logic, The Annals of Mathematics, vol.33, issue.2, pp.346-366, 1932.
DOI : 10.2307/1968337

T. Coquand and G. P. Huet, The calculus of constructions, Information and Computation, vol.76, issue.2-3, pp.95-120, 1988.
DOI : 10.1016/0890-5401(88)90005-3
URL : https://hal.archives-ouvertes.fr/inria-00076024

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Varieties of static analyzers : A comparison with Astrée, invited paper, Proc. First IEEE & IFIP International Symposium on Theoretical Aspects of Software Engineering, TASE '07, pp.3-17, 2007.

Z. Dargaye, Décurryfication certifiée, Journées Françaises sur les Langages Applicatifs JFLA'07, 2007.

Z. Dargaye, Vérification formelle d'un compilateur pour langages fonctionnels, Thèse de doctorat, 2009.

N. G. De-bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, INDAG. MATH, vol.34, pp.381-392, 1972.

J. Filliâtre, Why : a multi-language multi-prover verification tool, Research Report, vol.1366, 2003.

H. Geuvers, Inconsistency of classical logic in type theory, 2001.

E. Giménez, An application of co-inductive types in Coq: Verification of the alternating bit protocol, Workshop on Types for Proofs and Programs, number 1158 in LNCS, pp.135-152, 1995.
DOI : 10.1007/3-540-61780-9_67

S. Glondu, Garantie formelle de correction pour l'extraction Coq, 2007.

S. Glondu, Extraction certifiée dans Coq-en-Coq, Journées Francophones des Langages Applicatifs (JFLA'09). INRIA, 2009.

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

B. Grégoire and J. Sacchini, On Strong Normalization of the Calculus of Constructions with Type-Based Termination, Logic for Programming, Artificial Intelligence, and Reasoning : 17th International Conference Proceedings 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp.333-347, 2010.
DOI : 10.1007/BFb0097796

C. A. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12583, issue.10, pp.576-580, 1969.
DOI : 10.1007/978-3-642-48354-7_17
URL : http://www.utdallas.edu/~kxh060100/cs6371fa07/hoare.pdf

A. William and . Howard, The formulae-as-types notion of constructions, to H.B. Curry : Essays on Combinatory Logic, Lambda Calculus and Formalism, 1980.

R. Kelsey, W. Clinger, and J. Rees, Available at http://schemers, 1998.

C. Stephen and . Kleene, Introduction to Metamathematics. North-Holland, 1952.

C. Kreitz, The Nuprl Proof Development System, Version 5, 2002.

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

X. Leroy, J. Vouillon, D. Doliguez, J. Garrigue, and D. Rémy, The OCaml system ? release 3, 2011.

P. Letouzey, Programmation fonctionnelle certifiée ? L'extraction de programmes dans l'assistant Coq, Thèse de doctorat, 2004.

Z. Luo, ECC, an extended calculus of constructions, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.386-395, 1989.
DOI : 10.1109/LICS.1989.39193

C. George and . Necula, Proof-carrying code, POPL, pp.106-119, 1997.

C. Paulin-mohring, Extracting ??'s programs from proofs in the calculus of constructions, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, 1989.
DOI : 10.1145/75277.75285

C. Paulin-mohring, Extraction de programmes dans le Calcul des Constructions, Thèse d'université, 1989.
URL : https://hal.archives-ouvertes.fr/tel-00431825

C. Paulin-mohring, Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation à diriger les recherches, 1996.

C. Paulin-mohring and B. Werner, Synthesis of ML programs in the system Coq, Journal of Symbolic Computation, vol.15, issue.5-6, pp.607-640, 1993.
DOI : 10.1016/S0747-7171(06)80007-6
URL : https://doi.org/10.1016/s0747-7171(06)80007-6

C. Lawrence and . Paulson, Logic and Computation : Interactive Proof with Cambridge LCF. Cambridge Tracts in Theoretical Computer Science, 1990.

J. Simon-peyton, Haskell 98, A Non-strict, Purely Functional Language, 1999.

F. Pfenning and C. Elliot, Higher-order abstract syntax, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, PLDI '88, pp.199-208, 1988.

É. Soubiran, Modular development of theories and name-space management for the Coq proof assistant, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00679201

M. Sozeau, Subset Coercions in Coq, Lecture Notes in Computer Science, vol.4502, pp.237-252, 2006.
DOI : 10.1007/978-3-540-74464-1_16
URL : https://hal.archives-ouvertes.fr/inria-00628869

M. Sozeau and N. Oury, First-Class Type Classes, Lecture Notes in Computer Science, vol.5170, pp.278-293, 2008.
DOI : 10.1007/11542384_8
URL : https://hal.archives-ouvertes.fr/inria-00628864

B. Werner, Méta-théorie du Calcul des Constructions Inductives, Thèse de doctorat, 1994.

F. Wiedijk, Comparing Mathematical Provers, MKM, pp.188-202, 2003.
DOI : 10.1007/3-540-36469-2_15
URL : http://www.cs.kun.nl/~freek/comparison/diffs.pdf