A Focused Sequent Calculus for Higher-Order Logic
We present a focused intuitionistic sequent calculus for higher-order logic. It has primitive support for equality and mixes λ-term conversion with equality reasoning. Classical reasoning is enabled by extending the system with rules for reductio ad absurdum and the axiom of choice. The resulting system is proved sound with respect to Church’s simple type theory. The soundness proof has been formalized in Agda. A theorem prover based on bottom-up search in the calculus has been implemented. It has been tested on the TPTP higher-order problem set with good results. The problems for which the theorem prover performs best require higher-order unification more frequently than the average higher-order TPTP problem. Being strong at higher-order unification, the system may serve as a complement to other theorem provers in the field.
KeywordsInference Rule Theorem Prover Natural Deduction Sequent Calculus Derivation Tree
Unable to display preview. Download preview PDF.
- 7.Lengrand, S., Dyckhoff, R., McKinna, J.: A focused sequent calculus framework for proof search in pure type systems. Logical Methods in Computer Science 7(1) (2011)Google Scholar
- 12.Lindblad, F.: AgsyHOL source code and Agda formalization (2012), https://github.com/frelindb/agsyHOL
- 13.Lengrand, S.: Normalisation & Equivalence in Proof Theory & Type Theory. PhD thesis, Université Paris 7 & University of St Andrews (2006)Google Scholar
- 14.Lindblad, F.: Property directed generation of first-order test data. In: Trends in Functional Programming. Intellect, vol. 8, pp. 105–123 (2008)Google Scholar
- 15.Hanus, M.: Curry: An integrated functional logic language. Language report (March 2006), http://www.informatik.uni-kiel.de/~curry/report.html