Abstract
A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the difference between pairs of formulae. We define substitution and unification for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this with two selected examples using our implementation of these ideas in λProlog.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Aubin. Some generalization heuristics in proofs by induction. In G. Huet and G. Kahn, editors, Actes du Colloque Construction: Amélioration et vérification de Programmes. Institut de recherche d'informatique et d'automatique, 1975.
H. P. Barendregt. The Lambda Calculus. Elsevier, 1985.
David Basin and Toby Walsh. A calculus for and termination of rippling. Technical report, MPI, 1994. To appear in special issue of the Journal of Automated Reasoning.
David Basin and Toby Walsh. A calculus for rippling. In Proceedings of CTRS-94, 1994.
David Basin and Toby Walsh. Termination orders for rippling. In Alan Bundy, editor, 12th Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 814, pages 466–83, Nancy, France, 1994. Springer-Verlag.
W.W. Bledsoe. Challenge problems in elementary calculus. Journal of Automated Reasoning, 6(3):341–359, 1990.
A. Boudet and H. Comon. About the theory of tree embedding. In M.-C. Gaudek and J.-P. Jouannaud, editors, TAPSOFT’ 93: Theory and Practice of Software Development, number 668 in LNCS, pages 376–90. Springer-Verlag, 1993.
A. Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, 9th Conference on Automated Deduction, pages 111–120. Springer-Verlag, 1988. Longer version available from Edinburgh as DAI Research Paper No. 349.
A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185–253, 1993. Also available from Edinburgh as DAI Research Paper No. 567.
A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647–648. Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence No. 449. Also available from Edinburgh as DAI Research Paper 507.
R.L. Constable, S.F. Allen, H.M. Bromley, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.
A. Felty. A logic programming approach to implementing higher-order term rewriting. In L-H Eriksson et al., editors, Second International Workshop on Extensions to Logic Programming, volume 596 of Lecture Notes in Artificial Intelligence, pages 135–61. Springer-Verlag, 1992.
A. Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43–81, 1993.
J. K. Gallagher. The Use of Proof Plans in Tactic Synthesis. PhD thesis, University of Edinburgh, 1993.
R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143–84, 1992. Preliminary version in LICS’ 87.
D. Hutter. Pattern-Direct Guidance of Equational Proofs. PhD thesis, University of Karlsruhe, 1991.
D. Hutter and M. Kohlhase. A colored version of the λ-calculus. SEKI-report sr-95-05, University of Saarland, 1995.
J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, vol 2, volume 2, pages 1–116. Clarendon Press, Oxford, 1992.
Chuck Liang. λProlog implementation of ripple-rewriting. In Proceedings of the 1992 Workshop on the λProlog Programming Language, University of Pennsylvania, Philadelphia, PA, USA, July–August 1992.
Z. Luo and R. Pollack. Lego proof development system: User's manual. Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh, May 1992.
D. Miller. A logic programming language with lambda abstraction, function variables and simple unification. In Extensions of Logic Programming, volume 475 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1991.
T. Nipkow. Higher-order critical pairs. In Proc. 6th IEEE Symp. Logic in Computer Science, pages 342–349, 1991.
L. Paulson. Natural deduction as higher order resolution. Journal of Logic Programming, 3:237–258, 1986.
Alan Smaill and Ian Green. Automating the synthesis of functional programs. Research paper 777, Dept. of Artificial Intelligence, University of Edinburgh, 1995.
Tetsuya Yoshida, Alan Bundy, Ian Green, Toby Walsh, and David Basin. Coloured rippling: An extension of a theorem proving heuristic. In A.G. Cohn, editor, In proceedings of ECAI-94, pages 85–89. John Wiley, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smaill, A., Green, I. (1996). Higher-order annotated terms for proof search. In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1996. Lecture Notes in Computer Science, vol 1125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105418
Download citation
DOI: https://doi.org/10.1007/BFb0105418
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61587-3
Online ISBN: 978-3-540-70641-0
eBook Packages: Springer Book Archive