Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem (1972)
| Venue: | INDAG. MATH |
| Citations: | 278 - 1 self |
BibTeX
@ARTICLE{Bruijn72lambdacalculus,
author = {N. G. De Bruijn},
title = {Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem},
journal = {INDAG. MATH},
year = {1972},
volume = {34},
pages = {381--392}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system is developed, where occurrences of variables are indicated by integers giving the "distance" to the binding lambda instead of a name attached to that lambda. The system is claimed to be efficient for automatic formula manipulation as well as for metalingual discussion. As an example the most essential part of a proof of the Church-Rosser theorem is presented in this name free calculus.
Citations
| 290 | The calculi of lambda-conversion - Church - 1941 |
| 5 | On Urquhart’s C logic - Ciabattoni - 2000 |
| 1 | Some extensional models for cornbinatory logics and Acalculi. Doctorrtl Thesis - BARENDREUT - 1971 |
| 1 | The mathematical language AUTOMATIP, its usage, and some of its extensions - BRUIJN - 1970 |
