Łukasz Czajka
ABSTRACT
Hammers are tools for employing external automated theorem provers (ATPs) to improve automation in formal proof assistants. Strong automation can greatly ease the task of developing formal proofs. An essential component of any hammer is the translation of the logic of a proof assistant to the format of an ATP. For- malisms of state-of-the-art ATPs are usually first-order, so some method for eliminating lambda-abstractions is needed. We present an experimental comparison of several combinatory abstraction al- gorithms for HOL(y)Hammer – a hammer for HOL Light. The al- gorithms are compared on problems involving non-trivial lambda- abstractions selected from the HOL Light core library and a library for multivariate analysis. We succeeded in developing algorithms which outperform both lambda-lifting and the simple Scho ̈nfinkel’s algorithm used in Sledgehammer for Isabelle/HOL. This increases the ATPs’ success rate on translated problems, thus enhancing au- tomation in proof assistants.
- M. Abadi, L. Cardelli, P. Curien, and J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991.Google Scholar
Cross Ref
- S. K. Abdali. An abstraction algorithm for combinatory logic. Journal of Symbolic Logic, 41(1):222–224, 1976.Google ScholarCross Ref
- H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, 2nd edition, 1984.Google Scholar
- J. C. Blanchette. Automatic Proofs and Refutations for Higher-Order Logic. PhD thesis, Technische Universität München, 2012.Google Scholar
- J. C. Blanchette, C. Kaliszyk, L. C. Paulson, and J. Urban. Hammering towards QED. Journal of Formalized Reasoning, 2015. (to appear).Google Scholar
- S. Broda and L. Damas. Compact bracket abstraction in combinatory logic. Journal of Symbolic Logic, 62(3):729–740, 1997.Google ScholarCross Ref
- M. W. Bunder. Some improvements to Turner’s algorithm for bracket abstraction. Journal of Symbolic Logic, 55(2):656–669, 1990.Google ScholarCross Ref
- M. W. Bunder. Expedited Broda-Damas bracket abstraction. Journal of Symbolic Logic, 65(4):1850–1857, 2000.Google ScholarCross Ref
- F. W. Burton. A linear space translation of functional programs to Turner combinators. Information Processing Letters, 14(5):201–204, 1982.Google ScholarCross Ref
- H. B. Curry, R. Feys, and W. Craig. Combinatory Logic, volume 1. North-Holland, 1958.Google Scholar
- Ł. Czajka. On the equivalence of different presentations of Turner’s bracket abstraction algorithm. CoRR, abs/1510.03794, 2015.Google Scholar
- T. Gauthier and C. Kaliszyk. Premise selection and external provers for HOL4. In X. Leroy and A. Tiu, editors, Proceedings of the 2015 Conference on Certified Programs and Proofs, CPP 2015, Mumbai, India, January 15-17, 2015, pages 49–57. ACM, 2015. Google ScholarDigital Library
- H. Goguen and J. Goubault-Larrecq. Sequent combinators: a Hilbert system for the lambda calculus. Mathematical Structures in Computer Science, 10(1):1–79, 2000. Google ScholarDigital Library
- J. Goubault-Larrecq. Conjunctive types and SKInT. In T. Altenkirch, W. Naraschewski, and B. Reus, editors, Types for Proofs and Programs, International Workshop TYPES ’98, Kloster Irsee, Germany, March 27-31, 1998, Selected Papers, volume 1657 of Lecture Notes in Computer Science, pages 106–120. Springer, 1998. Google ScholarDigital Library
- T. C. Hales. Developments in formal proofs. CoRR, abs/1408.6474, 2014.Google Scholar
- J. Harrison. The HOL Light theory of Euclidean space. Journal of Automated Reasoning, 50(2):173–190, 2013. Google ScholarDigital Library
- T. Hikita. On the average size of Turner’s translation to combinator programs. Journal of Information Processing, 7(3):164–169, 1984.Google Scholar
- J. R. Hindley. Basic Simple Type Theory, volume 42 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1997. Google ScholarDigital Library
- R. J. M. Hughes. Supercombinators: A new implementation method for applicative languages. In LISP and Functional Programming. ACM Press, 1982. Google ScholarDigital Library
- J. Hurd. An LCF-style interface between HOL and first-order logic. In Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings, pages 134–138, 2002. Google ScholarDigital Library
- S. L. P. Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.Google Scholar
- M. S. Joy. On the efficient implementation of combinators as an object code for functional programs. PhD thesis, University of East Anglia, 1984.Google Scholar
- M. S. Joy, V. J. Rayward-Smith, and F. W. Burton. Efficient combinator code. Computer Languages, 10(3/4):211–224, 1985. Google ScholarDigital Library
- C. Kaliszyk and J. Urban. Learning-assisted automated reasoning with Flyspeck. Journal of Automated Reasoning, 53(2):173–213, 2014. Google ScholarDigital Library
- C. Kaliszyk and J. Urban. HOL(y)Hammer: Online ATP service for HOL light. Mathematics in Computer Science, 9(1):5–22, 2015.Google ScholarCross Ref
- R. Kennaway and M. R. Sleep. Variable abstraction in O(n log n) space. Information Processing Letters, 24(5):343–349, 1987. Google ScholarDigital Library
- R. Kennaway and M. R. Sleep. Director strings as combinators. ACM Trans. Program. Lang. Syst., 10(4):602–626, 1988. Google ScholarDigital Library
- D. Kesner. The theory of calculi with explicit substitutions revisited. In J. Duparc and T. A. Henzinger, editors, Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, volume 4646 of Lecture Notes in Computer Science, pages 238–252. Springer, 2007. Google ScholarDigital Library
- D. Kühlwein, J. C. Blanchette, C. Kaliszyk, and J. Urban. Mash: Machine learning for Sledgehammer. In S. Blazy, C. Paulin-Mohring, and D. Pichardie, editors, Interactive Theorem Proving - 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings, volume 7998 of Lecture Notes in Computer Science, pages 35–50. Springer, 2013. Google ScholarDigital Library
- J. Meng and L. C. Paulson. Translating higher-order clauses to firstorder clauses. Journal of Automated Reasoning, 40(1):35–60, 2008. Google ScholarDigital Library
- J. Meng, C. Quigley, and L. C. Paulson. Automation for interactive proof: First prototype. Information and Computation, 204(10):1575– 1596, 2006. Google ScholarDigital Library
- K. H. Rose. Explicit substitution: tutorial & survey. Technical report, BRICS, Department of Computer Science, University of Aarhus, 1996.Google Scholar
- M. Schönfinkel. Über die Bausteine der mathematischen Logik. Mathematische Annalen, 92:305–316, 1924.Google ScholarCross Ref
- F. Sinot, M. Fernández, and I. Mackie. Efficient reductions with director strings. In R. Nieuwenhuis, editor, Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, volume 2706 of Lecture Notes in Computer Science, pages 46–60. Springer, 2003. Google ScholarDigital Library
- D. A. Turner. Another algorithm for bracket abstraction. Journal of Symbolic Logic, 44(2):267–270, 1979.Google ScholarCross Ref
Index Terms
- Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions
Recommendations
A modular Isabelle framework for verifying saturation provers
CPP 2021: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and ProofsWe present a formalization in Isabelle/HOL of a comprehensive framework for proving the completeness of automatic theorem provers based on resolution, superposition, or other saturation calculi. The framework helps calculus designers and prover ...
Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)
CPP 2019: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and ProofsIsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at developing formal theories about logics, proof systems, and automatic provers, using Isabelle/HOL. At the heart of the project is the conviction that proof assistants have become ...
Formal SOS-Proofs for the Lambda-Calculus
We describe in this paper formalisations for the properties of weakening, type-substitutivity, subject-reduction and termination of the usual big-step evaluation relation. Our language is the lambda-calculus whose simplicity allows us to show actual ...
Comments