Abstract
We define and implement a combinator language for intermediate lemma discovery. We start by generalising an algebraic data-structure for unbounded search and then extend it to support case-analysis. With our language defined, we expect users to be able to write discoverers which collaborate intelligently in specific problem domains. For now, the language integrates rewriting, forward-deduction, and case-analysis and discovers lemmas concurrently based on an interactive proof context. We argue that the language is most suitable for adding domain-specific automation to mechanically formalised proofs written in a forward-style, and we show how the language is used via a case-study in geometry.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Colton, S., Bundy, A., Walsh, T.: On the notion of interestingness in automated mathematical discovery. Int. J. Hum.-Comput. Stud. 53(3), 351–375 (2000)
Gordon, M.: From LCF to HOL: a short history. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 169–185. MIT Press, Cambridge (2000)
Hales, T.: Introduction to the Flyspeck Project, http://drops.dagstuhl.de/opus/volltexte/2006/432/pdf/05021.HalesThomas.Paper.432.pdf
Hales, T.: Formal proof. Notices of the American Mathematical Society 55, 1370–1381 (2008)
Harrison, J.: HOL Light: a Tutorial Introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265–269. Springer, Heidelberg (1996)
McCasland, R.L., Bundy, A.: MATHsAiD: A Mathematical Theorem Discovery Tool. In: SYNASC, pp. 17–22 (2006)
Meikle, L.I., Fleuriot, J.D.: Formalizing Hilbert’s Grundlagen in Isabelle/Isar. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 319–334. Springer, Heidelberg (2003)
Milner, R., Bird, R.S.: The Use of Machines to Assist in Rigorous Proof [and Discussion]. Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences 312(1522), 411–422 (1984)
Milner, R., Tofte, M., Harper, R., Macqueen, D.: The Definition of Standard ML - Revised. The MIT Press, rev. sub. edn. (May 1997)
Moore, E.H.: On the Projective Axioms of Geometry. Transactions of the American Mathematical Society 3, 142–158 (1902)
Scott, P.: Mechanising Hilbert’s Foundations of Geometry in Isabelle. Master’s thesis, University of Edinburgh (2008)
Scott, P., Fleuriot, J.: Composable Discovery Engines for Interactive Theorem Proving. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol. 6898, pp. 370–375. Springer, Heidelberg (2011)
Spivey, J.M.: Algebras for combinatorial search. Journal of Functional Programming 19(3-4), 469–487 (2009)
Swierstra, S.D., Alcocer, P.R.A., Saraiva, J.: Designing and Implementing Combinator Languages. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol. 1608, pp. 150–206. Springer, Heidelberg (1999)
Wadler, P.: Monads for Functional Programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 24–52. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scott, P., Fleuriot, J. (2012). A Combinator Language for Theorem Discovery. In: Jeuring, J., et al. Intelligent Computer Mathematics. CICM 2012. Lecture Notes in Computer Science(), vol 7362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31374-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-31374-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31373-8
Online ISBN: 978-3-642-31374-5
eBook Packages: Computer ScienceComputer Science (R0)