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, Q. Carbonneaux, and O. Hermant, The ??-Calculus Modulo as a Universal Proof Language, Proof Exchange for Theorem Proving (PxTP), pp.28-43, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00917845

R. Bonichon, D. Delahaye, and D. Doligez, Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs, In Logic for Programming Artificial Intelligence and Reasoning LNCS/LNAI, vol.4790, pp.151-165, 2007.
DOI : 10.1007/978-3-540-75560-9_13
URL : https://hal.archives-ouvertes.fr/inria-00315920

G. Burel, Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo, Logical Methods in Computer Science, vol.7, issue.1, pp.1-31, 2011.
DOI : 10.2168/LMCS-7(1:3)2011
URL : https://hal.archives-ouvertes.fr/inria-00278186

D. Delahaye, D. Doligez, F. Gilbert, P. Halmagrand, and O. Hermant, Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo, Logic for Programming Artificial Intelligence and Reasoning (LPAR), pp.274-290, 2013.
DOI : 10.1007/978-3-642-45221-5_20
URL : https://hal.archives-ouvertes.fr/hal-00909784

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

A. S. Troelstra and D. Van-dalen, Constructivism in Mathematics: An Introduction, 1988.