A formal treatment of the Barendregt Variable Convention in rule inductions (2005)
Cached
Download Links
- [homepages.inf.ed.ac.uk]
- [www4.in.tum.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In MERLIN ’05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized |
| Citations: | 11 - 4 self |
BibTeX
@INPROCEEDINGS{Urban05aformal,
author = {Christian Urban},
title = {A formal treatment of the Barendregt Variable Convention in rule inductions},
booktitle = {In MERLIN ’05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized},
year = {2005},
pages = {25--32},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Barendregt’s variable convention simplifies many informal proofs in the λ-calculus by allowing the consideration of only those bound variables that have been suitably chosen. Barendregt does not give a formal justification for the variable convention, which makes it hard to formalise such informal proofs. In this paper we show how a form of the variable convention can be built into the reasoning principles for rule inductions. We give two examples explaining our technique.
