Closure generation based on viewing LAMBDA as EPSILON plus COMPILE (1992)
Cached
Download Links
- [www.iro.umontreal.ca]
- [rali.iro.umontreal.ca]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Computer Languages |
| Citations: | 8 - 2 self |
BibTeX
@ARTICLE{Feeley92closuregeneration,
author = {Marc Feeley and Guy Lapalme},
title = {Closure generation based on viewing LAMBDA as EPSILON plus COMPILE},
journal = {Journal of Computer Languages},
year = {1992},
volume = {17},
pages = {17--4}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes a way of expressing --expressions (which produce closures) in terms of ffl--expressions (--expressions containing only local and global variable references) and calls to an interactive compiler that compiles ffl--expressions. This point of view is an interesting way of describing the semantics of --expressions and closure generation. It also leads to an efficient closure implementation both in time and space. A closure is uniformly represented as a piece of code instead of a compound object containing a code and environment pointer. This method can also be used to simulate closures in conventional dialects of Lisp. KEY WORDS Closure implementation Compiling Lisp Scheme Published in: Journal of Computer Languages, Vol. 17, No. 4, pp. 251-267, Pergamon Press, 1992. 1 INTRODUCTION In many lexically scoped dialects of Lisp, e.g. Scheme[1-3], T[4,5] and Common Lisp[6], procedures are first class objects. They are defined by --expressions of the form (lambda formal-...
