Closure Generation Based on Viewing Lambda as Epsilon Plus Compile

This paper describes a way of expressing @l-expressions (which produce closures) in terms of @e-expressions (@l-expressions containing only local and global variable references) and calls to an interactive compiler that compiles @e-expressions. This point of view is an interesting way of describing the semantics of @l-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