An inductive theorem prover based on narrowing
This work presents a theorem prover for inductive proofs within an equational theory which supports the verification of universally quantified equations. This system, called TIP, is based on a modification of the well-known narrowing algorithm. Particulars of the implementation are stated and practical experiences are summarized. Finally some remarks on further extensions of the system are given.
Unable to display preview. Download preview PDF.
- 1.D. Duffy: Principles of Automated Theorem Proving. Wiley, 1991.Google Scholar
- 2.U. Fraus, H. Hußmann: A Narrowing-Based Theorem Prover, in: Proceedings of the IMA/UCL Conference, C. Rattray & R. Clark (eds.), Oxford University Press, 1992.Google Scholar
- 3.J. V. Guttag: The specification and application to programming of abstract data types. Ph. D. thesis, University of Toronto, Toronto, 1975.Google Scholar
- 4.U. S. Reddy: Term Rewriting Induction. CADE 10, Lecture Notes in Computer Science 249, Springer, 1990, pp. 162–177.Google Scholar