DMCA
Tactic theorem proving with renement-tree proofs and metavariables
| Venue: | In Automated Deduction(CADE-12), volume 814 of Lecture |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Felty_tactictheorem,
author = {Amy Felty and Douglas Howe},
title = {Tactic theorem proving with renement-tree proofs and metavariables},
booktitle = {In Automated Deduction(CADE-12), volume 814 of Lecture},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. This paper describes a prototype of a programmable interactive theorem-proving system. The main new feature of this system is that it supports the construction and manipulation of tree-structured proofs that can contain both metavariables and derived rules that are computed by tactic programs. The proof structure encapsulates the top-down renement process of proof construction typical of most interactive theorem provers. Our prototype has been implemented in the logic programming language Prolog, from which we inherit a general kind of higher-order metavariable. Backing up, or undoing, of proof construction steps is supported by solving uni cation and matching constraints. 1
Keyphrases
renement-tree proof tactic theorem general kind matching constraint interactive theorem provers tactic program programmable interactive theorem-proving system top-down renement process proof construction step main new feature proof structure logic programming language prolog tree-structured proof higher-order metavariable uni cation proof construction
