Published in

Springer, Journal of Automated Reasoning, 4(55), p. 389-404, 2015

DOI: 10.1007/s10817-015-9348-y

Links

Tools

Export citation

Search in Google Scholar

The Higher-Order Prover Leo-II

Journal article published in 2015 by Christoph Benzmüller, Nik Sultana, Lawrence C. Paulson, Frank Theiß
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered cooperative higher-order–first-order proof automation, it has influenced the development of the TPTP THF infrastructure for higher-order logic, and it has been applied in a wide array of problems. Leo-II may also be called in proof assistants as an external aid tool to save user effort. For this it is crucial that Leo-II returns proof information in a standardised syntax, so that these proofs can eventually be transformed and verified within proof assistants. Recent progress in this direction is reported for the Isabelle/HOL system.