Alpha-structural recursion and induction (Extended Abstract) (2005)
| Venue: | THEOREM PROVING IN HIGHER ORDER LOGICS, 18TH INTERNATIONAL CONFERENCE, TPHOLS 2005, OXFORD UK, AUGUST 2005, PROCEEDINGS, VOLUME 3603 OF LECTURE NOTES IN COMPUTER SCIENCE |
| Citations: | 6 - 2 self |
BibTeX
@INPROCEEDINGS{Pitts05alpha-structuralrecursion,
author = {Andrew M. Pitts},
title = {Alpha-structural recursion and induction (Extended Abstract)},
booktitle = {THEOREM PROVING IN HIGHER ORDER LOGICS, 18TH INTERNATIONAL CONFERENCE, TPHOLS 2005, OXFORD UK, AUGUST 2005, PROCEEDINGS, VOLUME 3603 OF LECTURE NOTES IN COMPUTER SCIENCE},
year = {2005},
pages = {17--34},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
There is growing evidence for the usefulness of name permutations when dealing with syntax involving names and name-binding. In particular they facilitate an attractively simple formalisation of common, but often technically incorrect uses of structural recursion and induction for abstract syntax trees modulo α-equivalence. At the heart of this formalisation is the notion of finitely supported mathematical objects. This paper explains the idea in as concrete a way as possible and gives a new derivation within higher-order logic of principles of α-structural recursion and induction for α-equivalence classes from the ordinary versions of these principles for abstract syntax trees.
