Path: utzoo!censor!geac!yunexus!oz
From: oz@yunexus.yorku.ca (Ozan Yigit)
Newsgroups: comp.object
Subject: Re: code blocks (aka closures)
Message-ID: <12536@yunexus.YorkU.CA>
Date: 11 Jul 90 15:40:44 GMT
References: <5305@stpstn.UUCP> <11002@alice.UUCP> <DEUTSCH.90Jul2150016@atlantic.parcplace.com> <1990Jul3.143743.22901@cbnewsc.att.com> <55700@microsoft.UUCP>
Sender: news@yunexus.YorkU.CA
Organization: York U. Communications Research & Development
Lines: 22

In article <55700@microsoft.UUCP> bobatk@microsoft.UUCP (Bob ATKINSON) writes:

>One can imagine an implemenation of Lisp in which the actual allocation
>of a garbage collected closure object does not occur at the time the 
>closure is created, but rather when the activation record of its outer
>scope returns. ...

A good overview of just about every scheme (:-) involving continuations
and control is an article by Clinger at al:

	%A William D. Clinger
	%A Anne H. Hartheimer
	%A Eric M. Ost
	%T Implementation Strategies for Continuations
	%J Conference Record of the 1988 ACM Conference on Lisp
	and Functional Programming
	%P 124 131
	%D August 1988
	%K contimpl
	
There has been a lot of work in this topic in the last decade, and I can
post few more refs if needed.