J. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992.
DOI : 10.1093/logcom/2.3.297

P. B. Andrews, Theorem Proving via General Mappings, Journal of the ACM, vol.28, issue.2, pp.193-214, 1981.
DOI : 10.1145/322248.322249

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, pp.135-150, 2011.
DOI : 10.1145/1217856.1217859
URL : https://hal.archives-ouvertes.fr/hal-00639130

D. Baelde, Least and greatest fixed points in linear logic, ACM Trans. on Computational Logic, vol.13, issue.1, 2012.

M. Boespflug, Q. Carbonneaux, and O. Hermant, The ??-calculus modulo as a universal proof language. Proof Exchange for Theorem Proving, pp.28-43, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00917845

S. Böhme and T. Weber, Designing proof formats: A user's perspective. Proof eXchange for Theorem Proving, pp.27-32, 2011.

D. Cousineau and G. Dowek, Embedding pure type systems in the lambda-picalculus modulo, TLCA 2007, pp.102-117, 2007.

N. G. De-bruijn, Reflections on Automath, Selected Papers on Automath of Studies in Logic and the Foundations of Mathematics, pp.201-228, 1994.
DOI : 10.1016/S0049-237X(08)70205-2

P. Fontaine, J. Marion, S. Merz, L. P. Nieto, and A. Tiu, Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants, TACAS 2006, pp.167-181, 2006.
DOI : 10.1007/3-540-45620-1_26
URL : https://hal.archives-ouvertes.fr/inria-00001088

G. Gentzen, Investigations into logical deduction The Collected Papers of Gerhard Gentzen, pp.68-131, 1969.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Hurd, The OpenTheory Standard Theory Library, Third International Symposium on NASA Formal Methods, pp.177-191, 2011.
DOI : 10.1007/3-540-60275-5_76

C. Liang and D. Miller, Focusing and polarization in linear, intuitionistic, and classical logics, Theoretical Computer Science, vol.410, issue.46, pp.4747-4768, 2009.
DOI : 10.1016/j.tcs.2009.07.041

C. Liang and D. Miller, A focused approach to combining logics, Annals of Pure and Applied Logic, vol.162, issue.9, pp.679-697, 2011.
DOI : 10.1016/j.apal.2011.01.012
URL : https://hal.archives-ouvertes.fr/hal-00772736

D. Miller, A Proposal for Broad Spectrum Proof Certificates, CPP: First International Conference on Certified Programs and Proofs, pp.54-69, 2011.
DOI : 10.1007/978-3-540-88387-6_3
URL : https://hal.archives-ouvertes.fr/hal-00772722

D. Miller and G. Nadathur, Programming with Higher-Order Logic, 2012.
DOI : 10.1017/cbo9781139021326
URL : https://hal.archives-ouvertes.fr/hal-00776197

D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.125-157, 1991.
DOI : 10.1016/0168-0072(91)90068-W

A. Stump, Proof checking technology for satisfiability modulo theories. Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP), 2008.