J. R. Abrial, The B-Book, Assigning Programs to Meanings, p.521496195, 1996.

J. M. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation (JLC), vol.2, issue.3, pp.297-347, 1992.

A. Assaf, A Framework for Defining Computational Higher-Order Logics, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01235303

A. Assaf, Conservativity of Embeddings in the ?? Calculus Modulo Rewriting, Typed Lambda Calculi and Applications (TLCA), LIPIcs, vol.38, pp.31-44, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01084165

A. Assaf and G. Burel, Translating HOL to Dedukti, Proof eXchange for Theorem Proving (PxTP), EPTCS, vol.186, pp.74-88, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01097412

A. Assaf, G. Burel, R. Cauderlier, D. Delahaye, G. Dowek et al., Dedukti: a Logical Framework based on the ??-Calculus Modulo Theory, 2016.

L. Bachmair and H. Ganzinger, Resolution Theorem Proving, Handbook of Automated Reasoning, vol.1, pp.19-99, 2001.

L. Bachmair, H. Ganzinger, and U. Waldmann, Refutational Theorem Proving for Hierarchic First-Order Theories, Applicable Algebra in Engineering, Communication and Computing, vol.5, pp.193-212, 1994.

H. Barendregt and E. Barendsen, Autarkic Computations in Formal Proofs, Journal of Automated Reasoning (JAR), vol.28, issue.3, pp.321-336, 2002.

H. Barendregt, W. Dekkers, and R. Statman, Lambda Calculus with Types, p.9780521766142, 2013.

M. Barnett, B. Y. Chang, R. Deline, B. Jacobs, and K. R. Leino, Boogie: A Modular Reusable Verifier for Object-Oriented Programs, Formal Methods for Components and Objects (FMCO), vol.4111, pp.364-387, 2005.

C. W. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli, Satisfiability Modulo Theories, Handbook of Satisfiability, vol.185, pp.825-885, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01095009

C. W. Barrett and C. Tinelli, Satisfiability Modulo Theories, Handbook of Model Checking, pp.305-343, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01095009

P. Baumgartner, A Model Elimination Calculus with Built-in Theories, German Conference on Artificial Intelligence (GWAI), vol.671, pp.30-42, 1992.

P. Baumgartner, An Order Theory Resolution Calculus, Logic Programming and Automated Reasoning (LPAR), vol.624, pp.119-130, 1992.

P. Baumgartner, J. Bax, and U. Waldmann, Beagle -A Hierarchic Superposition Theorem Prover, Conference on Automated Deduction (CADE), vol.9195, pp.367-377, 2015.

P. Baumgartner and U. Waldmann, Hierarchic Superposition with Weak Abstraction, Conference on Automated Deduction (CADE), vol.7898, pp.39-57, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00931919

B. Beckert, Semantic Tableaux with Equality, Journal of Logic and Computation (JLC), vol.7, issue.1, pp.39-58, 1997.

B. Beckert and C. Pape, Incremental Theory Reasoning Methods for Semantic Tableaux, Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX), vol.1071, pp.93-109, 1996.

E. W. Beth, The Foundations of Mathematics: A Study in the Philosophy of Science. Studies in Logic and the Foundations of Mathematics, 1959.

E. W. Beth, Formal Methods: An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic, Synthese Library, vol.4, 1962.

J. C. Blanchette, S. Böhme, A. Popescu, and N. Smallbone, Encoding Monomorphic and Polymorphic Types, Logical Methods in Computer Science (LMCS), vol.12, issue.4, 2016.

J. C. Blanchette and A. Paskevich, TFF1: The TPTP Typed First-Order Form with Rank-1
URL : https://hal.archives-ouvertes.fr/hal-00825086

. Polymorphism, Conference on Automated Deduction (CADE), vol.7898, 2013.

F. Blanqui, J. P. Jouannaud, and M. Okada, The Calculus of Algebraic Constructions, Rewriting Techniques and Applications (RTA), vol.1631, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00105545

K. H. Bläsius, U. Hedtstück, and . Rollinger, Sorts and Types in Artificial Intelligence, Workshop, Eringerfeld, FRG, vol.418, 1989.

F. Bobot, J. C. Filliâtre, C. Marché, and A. Paskevich, Why3: Shepherd Your Herd of Provers, International Workshop on Intermediate Verification Languages (Boogie), pp.53-64, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00790310

M. Boespflug and G. Burel, CoqinE: Translating the Calculus of Inductive Constructions into the ??-calculus Modulo, Proof eXchange for Theorem Proving (PxTP), CEUR Workshop Proceedings, vol.878, pp.44-50, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01126128

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, TaMeD: A Tableau Method for Deduction Modulo, International Joint Conference on Automated Reasoning (IJCAR), vol.3097, pp.445-459, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01520537

R. Bonichon, D. Delahaye, and D. Doligez, Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), vol.4790, pp.151-165, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00315920

R. Bonichon and O. Hermant, A Semantic Completeness Proof for TaMeD, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), vol.4246, pp.167-181, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01337086

R. Bonichon and O. Hermant, On Constructive Cut Admissibility in Deduction Modulo, Types for Proofs and Programs (TYPES), vol.4502, pp.33-47, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01337639

R. S. Boyer and J. S. Moore, A Theorem Prover for a Computational Logic, Conference on Automated Deduction (CADE), vol.449, pp.1-15, 1990.

P. Brauner, C. Houtmann, and C. Kirchner, Principles of Superdeduction, Logic in Computer Science (LICS), pp.41-50, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00133557

G. Burel, Embedding Deduction Modulo into a Prover, Computer Science Logic (CSL), vol.6247, pp.155-169, 2010.

G. Burel, Proof-Search in Axiomatic Theories and Type Theories (PSATTT), 2011.

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

G. Burel, A Shallow Embedding of Resolution and Superposition Proofs into the ??-Calculus Modulo, Proof eXchange for Theorem Proving (PxTP), vol.14, pp.43-57, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00921513

G. Burel, Cut Admissibility by Saturation, Rewriting Techniques and Applications (RTA) and Typed Lambda Calculi and Applications (TLCA), vol.8560, pp.124-138, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01097428

G. Burel and C. Kirchner, Regaining Cut Admissibility in Deduction Modulo using Abstract Completion, Information and Computation, vol.208, issue.2, pp.140-164, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00132964

G. Bury, R. Cauderlier, and P. Halmagrand, Implementing Polymorphism in Zenon, International Workshop on the Implementation of Logics (IWIL), vol.40, pp.15-20, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01243593

G. Bury, S. Cruanes, and D. Delahaye, SMT Solving Modulo Tableau and Rewriting Theories, Satisfiability Modulo Theories (SMT), 2018.
URL : https://hal.archives-ouvertes.fr/hal-02083232

G. Bury, S. Cruanes, D. Delahaye, and P. L. Euvrard, An Automation-Friendly Set Theory for the B Method, Abstract State Machines, Alloy, B, VDM, and Z (ABZ), vol.10817, pp.409-414, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02082755

G. Bury and D. Delahaye, Integrating Simplex with Tableaux, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), vol.9323, pp.86-101, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01215490

G. Bury, D. Delahaye, D. Doligez, P. Halmagrand, and O. Hermant, Automated Deduction in the B Set Theory Using Typed Proof Search and Deduction Modulo, Logic for Programming, Artificial Intelligence and Reasoning (LPAR), vol.35, pp.42-58, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01204701

R. Cauderlier, Object-Oriented Mechanisms for Interoperability between Proof Systems, Conservatoire National des Arts et Métiers (Cnam, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01415945

R. Cauderlier and C. Dubois, ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti, International Colloquium on Theoretical Aspects of Computing (ICTAC), vol.9965, pp.459-468, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01420638

R. Cauderlier and P. Halmagrand, Checking Zenon Modulo Proofs in Dedukti, Proof eXchange for Theorem Proving (PxTP), EPTCS, vol.186, pp.57-73, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01171360

V. Chvátal, Linear Programming. Series of Books in the Mathematical Sciences. W. H. Freeman and Company, vol.2, p.1, 1983.

D. Cousineau and G. Dowek, Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo, Typed Lambda Calculi and Applications (TLCA), vol.4583, pp.102-117, 2007.

M. Davis, G. Logemann, and D. W. Loveland, A Machine Program for Theorem-Proving, Communications of the ACM (CACM), vol.5, issue.7, pp.394-397, 1962.

M. Davis and H. Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.

L. M. De-moura and N. Bjørner, Efficient E-Matching for SMT Solvers, Conference on Automated Deduction (CADE), vol.4603, pp.183-198, 2007.

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), vol.8312, pp.274-290, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909784

D. Delahaye, C. Dubois, C. Marché, and D. Mentré, The BWare Project: Building a Proof Platform for the Automated Verification of B Proof Obligations, Abstract State Machines, Alloy, B, VDM, and Z (ABZ), vol.8477, pp.126-127, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00998092

D. Detlefs, G. Nelson, and J. B. Saxe, Simplify: A Theorem Prover for Program Checking, Journal of the ACM, vol.52, issue.3, pp.365-473, 2005.

G. Dowek, Confluence as a Cut Elimination Property, Rewriting Techniques and Applications (RTA), vol.2706, pp.2-13, 2003.

G. Dowek, Polarized Resolution Modulo, Theoretical Computer Science (TCS), IFIP Advances in Information and Communication Technology, vol.323, pp.182-196, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01054460

G. Dowek, T. Hardin, and C. Kirchner, Theorem Proving Modulo, Journal of Automated Reasoning (JAR), vol.31, issue.1, pp.33-72, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00077199

G. Dowek and B. Werner, Proof Normalization Modulo, Journal of Symbolic Logic (JSL), vol.68, issue.4, pp.1289-1316, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00073143

G. Dowek and B. Werner, Arithmetic as a Theory Modulo, Rewriting Techniques and Applications (RTA), vol.3467, pp.423-437, 2005.

M. Fitting, First-Order Logic and Automated Theorem Proving, p.9781461223603, 1996.

C. Flanagan, K. R. Leino, M. Lillibridge, G. Nelson, J. B. Saxe et al., Extended Static Checking for Java, Programming Language Design and Implementation (PLDI), pp.234-245, 2002.

H. Gaanzinger and K. Korovin, New Directions in Instantiation-Based Theorem Proving, Logic in Computer Science (LICS), pp.55-64, 2003.

H. Ganzinger and K. Korovin, Theory Instantiation. In: Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), vol.4246, pp.497-511, 2006.

Y. Ge, C. Barrett, and C. Tinelli, Solving Quantified Verification Conditions Using Satisfiability Modulo Theories, Conference on Automated Deduction (CADE), vol.4603, pp.167-182, 2007.

M. Giese, Incremental Closure of Free Variable Tableaux, International Joint Conference on Automated Reasoning (IJCAR), vol.2083, pp.545-560, 2001.

P. Halmagrand, Soundly Proving B Method Formulae Using Typed Sequent Calculus, International Colloquium on Theoretical Aspects of Computing (ICTAC), vol.9965, pp.196-213, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01342849

R. Harper, F. Honsell, and G. D. Plotkin, A Framework for Defining Logics, Journal of the ACM, vol.40, issue.1, pp.143-184, 1993.

O. Hermant, Semantic Cut Elimination in the Intuitionistic Sequent Calculus, Typed Lambda-Calculi and Applications (TLCA), vol.3461, pp.221-233, 2005.

O. Hermant, Resolution is Cut-Free, Journal of Automated Reasoning (JAR), vol.44, issue.3, pp.245-276, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00743218

J. Hintikka, Notes on the Quantification Theory. Societas Scientiarum Fennica, vol.17, pp.1-13, 1955.

J. Hintikka, Two Papers on Symbolic Logic: Form and Content in Quantification Theory and Reductions in the Theory of Types, Societas Philosophica, Acta philosophica Fennica, vol.8, pp.7-55, 1955.

M. Jacquel, K. Berkani, D. Delahaye, and C. Dubois, Tableaux Modulo Theories using Superdeduction: An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover, International Joint Conference on Automated Reasoning (IJCAR), vol.7364, pp.332-338, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01126134

M. Jacquel, K. Berkani, D. Delahaye, and C. Dubois, Tableaux Modulo Theories using Superdeduction, Global Journal of Advanced Software Engineering (GJASE), vol.1, pp.1-13, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01099338

M. Kifer and J. Wu, A First-Order Theory of Types and Polymorphism in Logic Programming, Logic in Computer Science (LICS), pp.310-321, 1991.

K. Korovin, iProver -An Instantiation-Based Theorem Prover for First-Order Logic (System Description), International Joint Conference on Automated Reasoning (IJCAR), vol.5195, pp.292-298, 2008.

J. Lipton and M. Demarco, Completeness and Cut-elimination in the Intuitionistic Theory of Types, Journal of Logic and Computation, vol.15, pp.821-854, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00917868

S. Maehara, Lattice-valued Representation of the Cut-elimination Theorem, Tsukuba Journal of Mathematics, vol.15, issue.2, pp.509-521, 1991.

M. Silva, J. P. Lynce, I. Malik, and S. , Conflict-Driven Clause Learning SAT Solvers, Handbook of Satisfiability, vol.185, p.9781586039295, 2009.

D. Mentré, C. Marché, J. C. Filliâtre, and M. Asuka, Discharging Proof Obligations from Atelier B using Multiple Automated Provers, Abstract State Machines, Alloy, B, VDM, and Z (ABZ), vol.7316, pp.238-251, 2012.

N. V. Murray and E. Rosenthal, Theory Links: Applications to Automated Theorem Proving, Journal of Symbolic Computation, vol.4, issue.2, pp.173-190, 1987.

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.1, issue.2, pp.245-257, 1979.

G. Nelson and D. C. Oppen, Fast Decision Procedures Based on Congruence Closure, Journal of the ACM, vol.27, issue.2, pp.356-364, 1980.

A. Nerode and R. A. Shore, Logic for Applications. Texts and Monographs in Computer Science, p.9780387941295, 1993.

H. J. Ohlbach and J. H. Siekmann, The Markgraf Karl Refutation Procedure, Computational Logic, Essays in Honor of Alan Robinson, pp.41-112, 1991.

M. Okada, Phase Semantic Cut-Elimination and Normalization Proofs of First-and Higher-Order Linear Logic, Theoretical Computer Science (TCS), vol.227, pp.333-396, 1999.

F. Oppacher and E. Suen, HARP: A Tableau-Based Theorem Prover, Journal of Automated Reasoning (JAR), vol.4, issue.1, pp.69-100, 1988.

U. Petermann, Towards a Connection Procedure with Built in Theories, Logics in AI, European Workshop JELIA, vol.478, pp.444-543, 1990.

G. D. Plotkin, Building-in Equational Theories, Machine Intelligence, vol.7, pp.73-90, 1972.

D. Prawitz, Natural Deduction. A Proof-Theoretical Study, Stockholm Studies in Philosophy, vol.3, 1965.

F. Rabe, First-Order Logic with Dependent Types, International Joint Conference on Automated Reasoning (IJCAR), vol.4130, pp.377-391, 2006.

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

P. Rümmer, A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), vol.5330, pp.274-289, 2008.

R. Saillard, Typechecking in the ??-Calculus Modulo: Theory and Practice, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01299180

P. H. Schmitt and W. Wernecke, Tableau Calculus for Order Sorted Logic, Sorts and Types in Artificial Intelligence, pp.49-60, 1989.

S. Schultz, System Description: E 0.81. In: International Joint Conference on Automated Reasoning (IJCAR), vol.3097, pp.223-228, 2004.

H. Schwichtenberg and A. S. Troelstra, Basic Proof Theory, p.9780521779111, 2000.

N. Shankar, Little Engines of Proof, Formal Methods Europe (FME), vol.2391, pp.1-20, 2002.

R. E. Shostak, Deciding Combinations of Theories, Journal of the ACM, vol.31, issue.1, pp.1-12, 1984.

M. E. Stickel, Automated Deduction by Theory Resolution, Journal of Automated Reasoning (JAR), vol.1, issue.4, pp.333-355, 1985.

P. Strub, Computer Science Logic (CSL), vol.6247, pp.529-543, 2010.

G. Sutcliffe, The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, Journal of Automated Reasoning (JAR), vol.43, issue.4, pp.337-362, 2009.

G. Sutcliffe, S. Schulz, K. Claessen, and P. Baumgartner, The TPTP Typed First-Order Form with Arithmetic, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), vol.7180, pp.406-419, 2012.

M. E. Szabo, Collected Papers of Gerhard Gentzen, Studies in Logic and the Foundation of Mathematics, p.9780720422542, 1969.

, The BWare Project, 2012.

C. Tinelli, Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing, Journal of Automated Reasoning (JAR), vol.30, issue.1, pp.1-31, 2003.

C. Walther, Many-Sorted Inferences in Automated Theorem Proving, Sorts and Types in Artificial Intelligence, vol.418, pp.18-48, 1989.

C. Weidenbach, First-Order Tableaux with Sorts, Logic Journal of the IGPL, vol.3, issue.6, pp.887-906, 1995.

C. Weidenbach, Combining Superposition, Sorts and Splitting, Handbook of Automated Reasoning, vol.2, pp.1965-2013, 2001.

L. Wos, G. A. Robinson, and D. F. Carson, Efficiency and Completeness of the Set of Support Strategy in Theorem Proving, Journal of the ACM, vol.12, issue.4, pp.536-541, 1965.