How to facilitate the proof of theories by using the induction matching, and by generalization

Authors:
Jacqueline Castaing
Affiliations:
LIPN, Univ. de Paris nord, Villetaneuse and IRI, Univ. de Pans sud, Orsay Cedex
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 4
Cited 0

Inductive methods for proving properties of programs

Communications of the ACM
Mechanizing structural induction (formal system)

Mechanizing structural induction (formal system)
Goal-Directed Program Transformation

IEEE Transactions on Software Engineering
Proofs by induction in equational theories with constructors

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show how we conceive the proof of theorems by sructural induction. Our aim is to facilitate the proof of the theorems which can lead, in a context of automatic theorem proving, to very lengthy (or even impossible) proofs. We use a very simple tool, the i-matching or induction-matching, which allows us, on the one hand to define an original procedure of generalization, and on the other hand to define an original way of generating lemmas.