Dec 5, 2017 · 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 ...
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 ...
Language and Proofs for Higher-Order SMT (Work in Progress)
www.semanticscholar.org › paper › Lang...
An extension of the SMT-LIB language, the standard input format of SMT solvers, to handle higher-order constructs and how to augment the proof format of ...
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 ...
Published in Electronic Proceedings in Theoretical Computer Science by Open Publishing Association. 2017 Volume 262, p15-22. Archived Files and Locations ...
Language and Proofs for Higher-Order SMT (Work in Progress) · List of references · Publications that cite this publication.
Language and proofs for higher-order SMT (work in progress). In Catherine ... How to prove higher order theorems in first order logic. In John ...
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 ...
Barbosa H. et al. Language and Proofs for Higher-Order SMT (Work in Progress) // Electronic Proceedings in Theoretical Computer Science, EPTCS. 2017. Vol. 262.
Language and Proofs for Higher-Order SMT (Work in Progress). Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes, Daniel El Ouraoui, Pascal Fontaine.