B. Peter and . Andrews, An introduction to mathematical logic and type theory: to truth through proof, 1986.

A. W. Appel, Foundational Proof-Carrying Code, LICS, IEEE Computer Society, pp.247-256, 2001.

A. Assaf, Conservativity of embeddings in the lambda-Pi calculus modulo rewriting Available at https://hal.archives-ouvertes.fr/hal-01084165, 2015.

A. Assaf and &. Cauderlier, Mixing HOL and Coq in Dedukti (Rough Diamond) Available at https, 2015.

H. P. Barendregt, Lambda Calculi with Types, Handbook of Logic in Computer Science, vol.II, 1992.

M. Beeson, Foundations of Constructive Mathematics, 1985.
DOI : 10.1007/978-3-642-68952-9

M. Boespflug and &. G. Burel, CoqInE: Translating the calculus of inductive constructions into the lambda-Pi-calculus modulo, pp.44-50, 2012.

M. Boespflug, Q. Carbonneaux, and &. O. Hermant, The lambda-Pi-calculus modulo as a universal proof language, pp.28-43, 2012.

Z. Chihani, D. Miller, and &. Renaud, Foundational Proof Certificates in First-Order Logic, Lecture Notes in Computer Science, vol.7898, pp.24-162, 2013.
DOI : 10.1007/978-3-642-38574-2_11
URL : https://hal.archives-ouvertes.fr/hal-00906485

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

D. Cousineau and &. Dowek, Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo, LNCS, vol.4583, pp.102-117, 2007.
DOI : 10.1007/978-3-540-73228-0_9

G. Dowek, Models and termination of proof-reduction in the ? ?-calculus modulo theory Available at https://who.rocq.inria.fr/Gilles, 2014.

H. Geuvers, Logics and type systems, 1993.

H. Geuvers and &. Barendsen, Some logical and syntactical observations concerning the first-order dependent type system ??P, Mathematical Structures in Computer Science, vol.9, issue.4, pp.335-35910, 1999.
DOI : 10.1017/S0960129599002856

C. Thomas and . Hales, The Jordan Curve Theorem, Formally and Informally, American Mathematical Monthly, vol.114, issue.10, pp.882-894, 2007.

C. Thomas, J. Hales, S. Harrison, T. Mclaughlin, S. Nipkow et al., A Revision of the Proof of the Kepler Conjecture, The Kepler Conjecture, pp.341-37610, 2011.

R. Harper, F. Honsell, and &. Gordon-plotkin, A framework for defining logics, Journal of the ACM, vol.40, issue.1, pp.143-184, 1993.
DOI : 10.1145/138027.138060

J. Hurd, The OpenTheory Standard Theory Library, LNCS, vol.41, issue.1, pp.177-191, 2011.
DOI : 10.1007/3-540-60275-5_76

C. Kaliszyk and &. Krauss, Scalable LCF-Style Proof Translation, LNCS, vol.7998, pp.51-66978, 2013.
DOI : 10.1007/978-3-642-39634-2_7

C. Keller and &. Werner, Importing HOL Light into Coq, LNCS, vol.6172, pp.307-322978, 2010.
DOI : 10.1007/978-3-642-14052-5_22
URL : https://hal.archives-ouvertes.fr/inria-00520604

D. Miller, Unification of simply typed lambda-terms as logic programming, 1991.

A. Dale and . Miller, Proofs in higher-order logic, 2004.

P. Naumov, M. Stehr, and &. Meseguer, The HOL/NuPRL Proof Translator, TPHOLs, pp.329-34510, 2001.
DOI : 10.1007/3-540-44755-5_23

S. Obua and &. Sebastian-skalberg, Importing HOL into Isabelle/HOL, Automated Reasoning, pp.298-30210, 2006.
DOI : 10.1007/11814771_27

F. Pfenning and &. Carsten-schürmann, System Description: Twelf ??? A Meta-Logical Framework for Deductive Systems, LNCS, vol.1632, pp.16-202, 1999.
DOI : 10.1007/3-540-48660-7_14

F. Rabe, Representing Isabelle in LF, Electronic Proceedings in Theoretical Computer Science, vol.34, pp.85-99, 2010.
DOI : 10.4204/EPTCS.34.8

F. Rabe and &. Michael-kohlhase, A scalable module system, Information and Computation, vol.230, pp.1-54, 2013.
DOI : 10.1016/j.ic.2013.06.001

C. Schürmann, &. Mark-oliver, and . Stehr, An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf, LNCS, vol.4246, pp.150-16610, 2006.
DOI : 10.1007/11916277_11

F. Wiedijk, The QED manifesto revisited, Studies in Logic, Grammar and Rhetoric, vol.10, issue.23, pp.121-133, 2007.