Language and Proofs for Higher-Order SMT (Work in Progress)

Haniel Barbosa
(University of Lorraine, CNRS, Inria, and LORIA)
Jasmin Christian Blanchette
(University of Lorraine, CNRS, Inria, and LORIA, Vrije Universiteit Amsterdam, Max-Planck-Institut für Informatik)
Simon Cruanes
(University of Lorraine, CNRS, Inria, and LORIA)
Daniel El Ouraoui
(University of Lorraine, CNRS, Inria, and LORIA)
Pascal Fontaine
(University of Lorraine, CNRS, Inria, and LORIA)

Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories. Nevertheless, higher-order logic within SMT is still little explored. One main goal of the Matryoshka project, which started in March 2017, is to extend the reasoning capabilities of SMT solvers and other automatic provers beyond first-order logic. In this preliminary report, we report on an extension of the SMT-LIB language, the standard input format of SMT solvers, to handle higher-order constructs. We also discuss how to augment the proof format of the SMT solver veriT to accommodate these new constructs and the solving techniques they require.

In Catherine Dubois and Bruno Woltzenlogel Paleo: Proceedings of the Fifth Workshop on Proof eXchange for Theorem Proving (PxTP 2017), Brasília, Brazil, 23-24 September 2017, Electronic Proceedings in Theoretical Computer Science 262, pp. 15–22.
Published: 4th December 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.262.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org