Path: utzoo!attcan!uunet!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!usc!snorkelwacker!bu.edu!xylogics!transfer!crackers!m2c!umvlsi!dime!dime.cs.umass.edu!moss
From: moss@cs.umass.edu (Eliot Moss)
Newsgroups: comp.object
Subject: Closure stack frames (was code blocks (aka closures))
Message-ID: <MOSS.90Jul5092158@ibis.cs.umass.edu>
Date: 5 Jul 90 13:21:58 GMT
References: <12396@june.cs.washington.edu> <1112@carol.fwi.uva.nl>
	<5305@stpstn.UUCP> <11002@alice.UUCP>
Sender: news@dime.cs.umass.edu
Reply-To: moss@cs.umass.edu
Organization: Dept of Comp and Info Sci, Univ of Mass (Amherst)
Lines: 24
In-reply-to: ark@alice.UUCP's message of 1 Jul 90 17:31:19 GMT

In addition to the article on implementing closures in the latest SIGPLAN
Conference proceedings, I wrote a paper a couple of years ago on a technique
adequate for Smalltalk that appears competitive with traditional stack schemes
(in the absence of really fancy stack support in the CPU). Here is the .bib
citation for those that may be interested:

@INPROCEEDINGS{Moss87,
	AUTHOR = "J. Eliot B. Moss",
	TITLE = "Managing Stack Frames in {Smalltalk}",
	BOOKTITLE = "Proceedings of the {SIGPLAN} '87 Symposium on Interpreters and Interpretive Techniques",
	ORGANIZATION = acm,
	ADDRESS = "St. Paul, MN",
	MONTH = jun,
	YEAR = 1987,
	PAGES = "229--240"
}
--

		J. Eliot B. Moss, Assistant Professor
		Department of Computer and Information Science
		Lederle Graduate Research Center
		University of Massachusetts
		Amherst, MA  01003
		(413) 545-4206; Moss@cs.umass.edu