Abstract
In this paper we explore the use of ellipsis in proofs about lists. We present a higher-order formulation of elliptic formulae, and describe its implementation in the λClam proof planner. We use an unambiguous higher-order formulation of lists which is amenable to formal proofs without using induction, and to display using the familiar ... notation.
The authors gratefully acknowledge the support of EPSRC grants GR/L/11724 and GR/M/45030, and the comments of their colleagues in the Mathematical Reasoning Group. We would also like to thank the referees for their insightful comments.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Baker. Aspects of the Constructive Omega Rule within Automated Deduction. PhD thesis, Edinburgh, 1993.
R. S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 5–42. Springer-Verlag, 1987. International Summer School. Proceedings of the NATO Advanced Study Institute, Marktoberdorf.
A. Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, 9th International Conference on Automated Deduction, pages 111–120. Springer-Verlag, 1988. Longer version available from Edinburgh as DAI Research Paper No. 349.
A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In M. E. Sticket, 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.
A. Ireland and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(1–2):79–111, 1996. Also available as DAI Research Paper No 716, Dept. of Artificial Intelligence, Edinburgh.
E. B. Kinber and A. N. Brazma. Models of inductive synthesis. Journal of Logic Programming, 9:221–233, 1990.
Leon Łukaszewicz. Triple dots in a formal language. Journal of Automated Reasoning, 22(3):223–239, March 1999.
J. D. C Richardson, A. Smaill, and I. M. Green. System description: proof planning in higher-order logic with λClam. In C. Kirchner and H. Kirchner, editors, Proceedings of CADE-15, volume 1421 of Lecture Notes in Computer Science. Springer Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bundy, A., Richardson, J. (1999). Proofs About Lists Using Ellipsis. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 1999. Lecture Notes in Computer Science(), vol 1705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48242-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-48242-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66492-5
Online ISBN: 978-3-540-48242-0
eBook Packages: Springer Book Archive