C. Barrett, A. Stump, and C. Tinelli, The SMT-LIB Standard: Version 2.0. Tech. rep, 2010.

F. Bobot, S. Conchon, E. Contejean, and S. Lescuyer, Implementing polymorphism in SMT solvers, Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning, SMT '08/BPR '08, pp.1-5, 2008.
DOI : 10.1145/1512464.1512466

F. Bobot, J. C. Filliâtre, C. Marché, and A. Paskevich, Why3: Shepherd your herd of provers, pp.2011-2034, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00790310

J. F. Couchot and S. Lescuyer, Handling Polymorphism in Automated Deduction, CADE-21. LNAI, pp.263-278, 2007.
DOI : 10.1007/978-3-540-73595-3_18

B. Dutertre and L. De-moura, The YICES SMT solver, Tech. rep., SRI International, 2006.

J. C. Filliâtre and C. Marché, Multi-prover Verification of C Programs, ICFEM'04, pp.15-29, 2004.
DOI : 10.1007/978-3-540-30482-1_10

J. Hurd, An LCF-Style Interface between HOL and First-Order Logic, CADE-18. LNAI, pp.134-138, 2002.
DOI : 10.1007/3-540-45620-1_10

J. Hurd, First-order proof tactics in higher-order logic theorem provers. In: Design and Application of Strategies/Tactics in Higher Order Logics, NASA Technical Report, pp.56-68212448, 2003.

K. R. Leino and P. Rümmer, A Polymorphic Intermediate Verification Language: Design and Logical Encoding, TACAS'10, pp.312-327, 2010.
DOI : 10.1007/978-3-642-12002-2_26

M. Manzano, Extensions of First-Order Logic, Cambridge Tracts in Theoretical Computer Science, vol.19, 1996.

J. Meng and L. C. Paulson, Translating Higher-Order Clauses to First-Order Clauses, Journal of Automated Reasoning, vol.9, issue.2, pp.35-60, 2008.
DOI : 10.1007/s10817-007-9085-y

L. De-moura and N. Bjørner, Z3: An Efficient SMT Solver, TACAS'08, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

A. Riazanov and A. Voronkov, Vampire 1.1, IJCAR'01, pp.376-380, 2001.
DOI : 10.1007/3-540-45744-5_29