Higher-order Annotated Terms for Proof Search (1996)
| Venue: | THEOREM PROVING IN HIGHER ORDER LOGICS: 9TH INTERNATIONAL CONFERENCE, TPHOLS’96 |
| Citations: | 18 - 3 self |
BibTeX
@INPROCEEDINGS{Smaill96higher-orderannotated,
author = {Alan Smaill and Ian Green},
title = {Higher-order Annotated Terms for Proof Search},
booktitle = {THEOREM PROVING IN HIGHER ORDER LOGICS: 9TH INTERNATIONAL CONFERENCE, TPHOLS’96},
year = {1996},
pages = {399--414},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the difference between pairs of formulae. We define substitution and unification for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this by several examples based on an implementation of these ideas in Prolog.
