Abstract for "Generalization and Reuse of Tactic Proofs"
Generalization and Reuse of Tactic Proofs
Amy Felty and Douglas Howe. In Fifth International Conference on Logic Programming and Automated Reasoning, Springer-Verlag LNCS 822, July 1994.

Abstract: A tactic proof is a tree-structured sequent proof where steps may be justified by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering from errors in definitions or in proof strategies. Our reuse operations involve solving higher-order unification problems, and their effectiveness relies on a proof-generalization step that is done after a tactic is applied. The prototype is implemented in lambda Prolog.