Abstract

A theorem proving system has been programmed for automating mildly complex proofs by structural induction. One purpose was to prove properties of simple functional programs without loops or assignments. One can see the formal system as a generalization of number theory: the formal language is typed and the induction rule is valid for all types. Proofs are generated by working backward from the goal. The induction strategy splits into two parts: (1) the selection of induction variables, which is claimed to be linked to the useful generalization of terms to variables, and (2) the generation of induction subgoals, in particular, the selection and specialization of hypotheses. Other strategies include a fast simplification algorithm. The prover can cope with situations as complex as the definition and correctness proof of a simple compiling algorithm for expressions. Descriptive Terms Program proving, theorem proving, data type, structural induction, generalization, simplification.

Citations

115	Ideas and results in proof theory - Prawitz - 1971
81	Proving properties of programs by structural induction - Burstall - 1969
65	Recursive data structures - Hoare - 1989
44	Proving theorems about Lisp functions - Boyer, Moore - 1975
18	Proving compiler correctness in a mechanized logic - Milner, Weyrauch - 1972
8	Computational Logic: Structure Sharing and Proof of Program Properties - Moore - 1973
7	A Lemma Driven Automatic Theorem Prover for Recursive Function Theory". IJCAI-77 - Boyer, Moore - 1977
1	Embedding heuristic problem solving methods in a mechanical theorem prover - Brotz - 1974
1	Recherche sur la deduction logique. Trad, et coram. R. Feys et - Gentzen - 1955