A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations (1996)
Cached
Download Links
- [www.cs.uchicago.edu]
- [ftp.cs.uchicago.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Functional and Logic Programming |
| Citations: | 22 - 8 self |
BibTeX
@ARTICLE{Nadathur96afine-grained,
author = {Gopalan Nadathur},
title = {A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations},
journal = {Journal of Functional and Logic Programming},
year = {1996},
volume = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We discuss issues relevant to the practical use of a previously proposed notation for lambda terms in contexts where the intensions of such terms have to be manipulated. This notation uses the `nameless' scheme of de Bruijn, includes expressions for encoding terms together with substitutions to be performed on them and contains a mechanism for combining such substitutions so that they can be effected in a common structure traversal. The combination mechanism is a general one and consequently difficult to implement. We propose a simplification to it that retains its functionality in situations that occur commonly in fi-reduction. We then describe a system for annotating terms to determine if they can be affected by substitutions generated by external fi-contractions. These annotations can lead to a conservation of space and time in implementations of reduction by permitting substitutions to be performed trivially in certain situations. The use of the resulting notation in the reduction...
