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, Refutations by Matings, IEEE Transactions on Computers, vol.25, issue.8, pp.801-807, 1976.
DOI : 10.1109/TC.1976.1674698

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

A. Assaf and G. Burel, Translating HOL to Dedukti, Proceedings Fourth Workshop on Proof eXchange for Theorem Proving, pp.74-88, 2015.
DOI : 10.1007/11916277_11

URL : https://hal.archives-ouvertes.fr/hal-01097412

D. Baelde, Least and greatest fixed points in linear logic, ACM Trans. on Computational Logic, vol.13, issue.1, 2012.
DOI : 10.1007/978-3-540-75560-9_9

URL : http://arxiv.org/pdf/0910.3383

D. Baelde and D. Miller, Least and greatest fixed points in linear logic, International Conference on Logic for Programming and Automated Reasoning (LPAR), pp.92-106, 2007.
DOI : 10.1007/978-3-540-75560-9_9

URL : http://arxiv.org/pdf/0910.3383

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

R. Blanco and D. Miller, Proof Outlines as Proof Certificates: A System Description, Proceedings First International Workshop on Focusing of Electronic Proceedings in Theoretical Computer Science, pp.7-14, 2015.
DOI : 10.1007/10930755_8

URL : https://hal.archives-ouvertes.fr/hal-01238436

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

P. Borras, D. Clément, T. Despeyroux, J. Incerpi, G. Kahn et al., Centaur: the system, Third Annual Symposium on Software Development Environments (SDE3), pp.14-24, 1988.
DOI : 10.1145/64135.65005

URL : https://hal.archives-ouvertes.fr/inria-00075774

S. Boutin, Using reflection to build efficient and certified decision procedures, International Symposium on Theoretical Aspects of Computer Software, pp.515-529, 1997.
DOI : 10.1007/BFb0014565

URL : http://pauillac.inria.fr/~boutin/publi_w/submitTACS97.ps.gz

K. Chaudhuri, S. Hetzl, and D. Miller, A multi-focused proof system isomorphic to expansion proofs, Journal of Logic and Computation, vol.26, issue.2, pp.577-603, 2016.
DOI : 10.1093/logcom/exu030

URL : https://hal.archives-ouvertes.fr/hal-00937056

Z. Chihani, Certification of First-order proofs in classical and intuitionistic logics, 2015.

Z. Chihani, T. Libal, and G. Reis, The Proof Certifier Checkers, Proceedings of the 24th Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), number 9323 in LNCS, pp.201-210, 2015.
DOI : 10.1007/978-3-642-45221-5_49

URL : https://hal.archives-ouvertes.fr/hal-01208333

Z. Chihani and D. Miller, Proof Certificates for Equality Reasoning, Post-proceedings of LSFA 2015: 10th Workshop on Logical and Semantic Frameworks, with Applications, 2016.
DOI : 10.1016/j.entcs.2016.06.007

URL : https://hal.archives-ouvertes.fr/hal-01390919

Z. Chihani, D. Miller, and F. Renaud, Foundational Proof Certificates in First-Order Logic, Conference on Automated Deduction 2013, number 7898 in LNAI, pp.162-177, 2013.
DOI : 10.1007/978-3-642-38574-2_11

URL : https://hal.archives-ouvertes.fr/hal-00906485

Z. Chihani, D. Miller, and F. Renaud, A Semantic Framework for Proof Evidence, Journal of Automated Reasoning, vol.42, issue.1, pp.10-1007, 2016.
DOI : 10.1017/CBO9781139168717

URL : https://hal.archives-ouvertes.fr/hal-01390912

D. Cousineau and G. Dowek, Embedding pure type systems in the lambda-Picalculus modulo, Typed Lambda Calculi and Applications , 8th International Conference Proceedings, pp.102-117, 2007.
DOI : 10.1007/978-3-540-73228-0_9

M. Davis, Obvious logical inferences, Proceedings of the 7th International Joint Conference on Artificial Intelligence (IJCAI '81), pp.530-531, 1991.

C. Dunchev, F. Guidi, C. S. Coen, and E. Tassi, ELPI: Fast, Embeddable, $$\lambda $$ Prolog Interpreter, Logic for Programming, Artificial Intelligence, and Reasoning -20th International Conference , LPAR-20 2015 Proceedings, pp.460-468, 2015.
DOI : 10.1007/978-3-662-48899-7_32

R. Dyckhoff, Contraction-free sequent calculi for intuitionistic logic, The Journal of Symbolic Logic, vol.475, issue.03, pp.795-807, 1992.
DOI : 10.1007/3-540-54487-9_58

G. Ebner, S. Hetzl, G. Reis, M. Riener, S. Wolfsteiner et al., System Description: GAPT 2.0, Proceedings of the 8th International Joint Conference on Automated Reasoning, IJCAR 2016, pp.293-301, 2016.
DOI : 10.1007/11814771_7

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

J. Hannan, Abstract, Journal of Functional Programming, vol.23, issue.02, pp.123-152, 1993.
DOI : 10.1093/logcom/1.4.497

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

J. Harrison, Metatheory and reflection in theorem proving: A survey and critique, 1995.

J. Harrison, J. Urban, and F. Wiedijk, History of Interactive Theorem Proving, Computational Logic of Handbook of the History of Logic, pp.135-214, 2014.
DOI : 10.1016/B978-0-444-51624-4.50004-6

Q. Heath and D. Miller, A framework for proof certificates in finite state exploration, Proceedings of the Fourth Workshop on Proof eXchange for Theorem Proving, number 186 in Electronic Proceedings in Theoretical Computer Science, pp.11-26, 2015.
DOI : 10.1109/LICS.1993.287585

URL : https://hal.archives-ouvertes.fr/hal-01240172

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

URL : https://doi.org/10.1016/j.tcs.2009.07.041

T. Libal and M. Volpe, Certification of Prefixed Tableau Proofs for Modal Logic, the Seventh International Symposium on Games, Automata, Logics and Formal Verification number 226 in EPTCS, pp.257-271, 2016.
DOI : 10.1145/321250.321253

URL : https://hal.archives-ouvertes.fr/hal-01379625

S. Marin, D. Miller, and M. Volpe, A focused framework for emulating modal proof systems, 11th Conference on Advances in Modal Logic, number 11 in Advances in Modal Logic, pp.469-488, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01379624

W. Mccune, Prover9 and mace4, 2010.

D. Miller, Unification under a mixed prefix, Journal of Symbolic Computation, vol.14, issue.4, pp.321-358, 1992.
DOI : 10.1016/0747-7171(92)90011-R

URL : https://doi.org/10.1016/0747-7171(92)90011-r

D. Miller, Formalizing Operational Semantic Specifications in Logic, Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming, pp.147-165, 2008.
DOI : 10.1016/j.entcs.2009.07.020

URL : https://doi.org/10.1016/j.entcs.2009.07.020

D. Miller, Proof checking and logic programming, Formal Aspects of Computing, vol.6, issue.4, pp.383-399, 2017.
DOI : 10.1007/3-540-48660-7_14

URL : https://hal.archives-ouvertes.fr/hal-01390901

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 and M. Volpe, Focused Labeled Proof Systems for Modal Logic, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), number 9450 in LNCS, pp.266-280, 2015.
DOI : 10.1007/978-3-662-48899-7_19

URL : https://hal.archives-ouvertes.fr/hal-01213858

D. A. Miller, Expansion tree proofs and their conversion to natural deduction proofs, Seventh Conference on Automated Deduction, pp.375-393, 1984.
DOI : 10.1007/bfb0047132

URL : http://www.lix.polytechnique.fr/%7Edale/papers/cade1984.pdf

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

G. C. Necula, Proof-carrying code, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.106-119, 1997.
DOI : 10.1145/263699.263712

F. Pfenning, Elf: a language for logic definition and verified metaprogramming, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.313-321, 1989.
DOI : 10.1109/LICS.1989.39186

URL : http://pecan.srv.cs.cmu.edu/afs/cs.cmu.edu/user/fp/www/papers/lics89.ps.gz

F. Pfenning, Logic programming in the LF logical framework, Logical Frameworks, pp.149-181, 1991.
DOI : 10.1017/CBO9780511569807.008

B. Pientka and J. Dunfield, Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description), Fifth International Joint Conference on Automated Reasoning, number 6173 in LNCS, pp.15-21, 2010.
DOI : 10.1007/978-3-642-14203-1_2

G. D. Plotkin, A structural approach to operational semantics, J. of Logic and Algebraic Programming, pp.60-6117, 2004.

R. Pollack, How to believe a machine-checked proof Twenty Five Years of Constructive Type Theory, 1998.

J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965.
DOI : 10.1145/321250.321253

S. M. Shieber, Y. Schabes, and F. C. Pereira, Principles and implementation of deductive parsing, The Journal of Logic Programming, vol.24, issue.1-2, pp.3-36, 1995.
DOI : 10.1016/0743-1066(95)00035-I

URL : https://doi.org/10.1016/0743-1066(95)00035-i

A. Stump, D. Oe, A. Reynolds, L. Hadarean, and C. Tinelli, SMT proof checking using a logical framework. Formal Methods in System Design, pp.91-118, 2013.
DOI : 10.1007/s10703-012-0163-3

G. Sutcliffe, The TPTP Problem Library and Associated Infrastructure, Journal of Automated Reasoning, vol.13, issue.2, pp.337-362, 2009.
DOI : 10.1007/BF00263451

A. S. Troelstra and H. Schwichtenberg, Basic Proof Theory, 2000.
DOI : 10.1017/CBO9781139168717