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

B. Peter and . Andrews, Theorem-proving via general matings, J. ACM, vol.28, pp.193-214, 1981.

W. Andrew, A. P. Appel, and . Felty, Polymorphic lemmas and definitions in ?Prolog and Twelf, Theory and Practice of Logic Programming, pp.1-39, 2004.

D. Baelde, A linear approach to the proof-theory of least and greatest fixed points, 2008.

D. Baelde, Least and greatest fixed points in linear logic, Accepted to the ACM Transactions on Computational Logic, 2010.

D. Baelde, D. Miller, and Z. Snow, Focused Inductive Theorem Proving, Fifth International Joint Conference on Automated Reasoning, number 6173 in LNCS, pp.278-292, 2010.
DOI : 10.1007/978-3-642-14203-1_24
URL : https://hal.archives-ouvertes.fr/hal-00772592

H. Barendregt, Lambda calculus with types, Handbook of Logic in Computer Science, pp.117-309, 1992.
DOI : 10.1017/CBO9781139032636

H. Barendregt and E. Barendsen, Autarkic computations in formal proofs, Journal of Automated Reasoning, vol.28, issue.3, pp.321-336, 2002.
DOI : 10.1023/A:1015761529444

M. Boespflug, Conception d'un noyau de vérification de preuves pour le ??calcul modulo, 2011.

G. Dowek, T. Hardin, and C. Kirchner, Theorem proving modulo, J. of Automated Reasoning, vol.31, issue.1, pp.31-72, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01199506

G. Gentzen, Investigations into logical deductions The Collected Papers of Gerhard Gentzen Translation of articles that, pp.68-131, 1969.

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, Kripke semantics and proof systems for combining intuitionistic logic and classical logic, Annals of Pure and Applied Logic, vol.164, issue.2, 2011.
DOI : 10.1016/j.apal.2012.09.005
URL : https://hal.archives-ouvertes.fr/hal-00787601

P. Martin-löf, Constructive Mathematics and Computer Programming, Sixth International Congress for Logic, Methodology, and Philosophy of Science, pp.153-175, 1982.
DOI : 10.1016/S0049-237X(09)70189-2

D. Miller, Communicating and trusting proofs: The case for broad spectrum proof certificates. Available from author's website, 2011.

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

D. Miller and V. Nigam, Incorporating Tables into Proofs, CSL 2007: Computer Science Logic, pp.466-480, 2007.
DOI : 10.1007/978-3-540-74915-8_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.3026

G. Nadathur and D. J. Mitchell, System Description: Teyjus???A Compiler and Abstract Machine Based Implementation of ??Prolog, 16th Conf. on Automated Deduction (CADE), number 1632 in LNAI, pp.287-291, 1999.
DOI : 10.1007/3-540-48660-7_25

C. George and . Necula, Proof-carrying code, Conference Record of the 24th Symposium on Principles of Programming Languages, pp.106-119, 1997.

R. Vaughan and . Pratt, Every prime has a succinct certificate, SIAM Journal on Computing, vol.4, issue.3, pp.214-220, 1975.

N. Shankar, Trust and Automation in Verification Tools
DOI : 10.1023/A:1021983302516

M. Choi, I. Kim, M. Lee, and . Viswanathan, ATVA: Automated Technology for Verification and Analysis, LNCS, vol.5311, pp.4-17, 2008.