home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.scheme
- Path: sparky!uunet!cs.utexas.edu!torn!newshub.ccs.yorku.ca!newshub.ccs.yorku.ca!oz
- From: oz@ursa.sis.yorku.ca (Ozan Yigit)
- Subject: Re: Are interpreters now as fast as compiled code used to be?
- In-Reply-To: bh@anarres.CS.Berkeley.EDU's message of 16 Dec 92 23: 06:39 GMT
- Message-ID: <OZ.92Dec17004120@ursa.sis.yorku.ca>
- Sender: news@newshub.ccs.yorku.ca (USENET News System)
- Organization: York U. Student Information Systems Project
- References: <1992Dec15.201735.21731@netcom.com> <GJR.92Dec15214517@klosters.ai.mit.edu>
- <1992Dec16.190713.20460@netcom.com> <1gocpvINN3i8@agate.berkeley.edu>
- Date: Thu, 17 Dec 1992 05:41:20 GMT
- Lines: 26
-
- Brian Harvey writes:
-
- Implementation inefficiency isn't the only problem with continuations.
- [etc etc...]
-
- Is "Implementation inefficiency" still a problem? Some interesting
- methods to deal with them have been cataloged by Clinger et al.[1]
- as well, there is a very fast method by Hieb et al.[2] [I used the
- heap method [1] in PSI with great results]. Are there any specific
- reasons why you would think there still is a problem?
-
- ... oz
- ---
- With diligence, it is possible to make | electric: oz@sis.yorku.ca
- anything run slowly. -Tom Duff | ph:[416] 736 2100 x 33976
- ---
- [1] William D. Clinger, Anne H. Hartheimer, Eric M. Ost
- Implementation Strategies for Continuations
- Conference Record of the 1988 ACM Conference on Lisp
- and Functional Programming, August 1988
-
- [2] Robert Hieb, R. Kent Dybvig, Carl Bruggeman
- Representing Control in the Presence of First-Class Continuations
- Proceedings of the SIGPLAN '90 Conference on Programming Language
- Design and Implementation, White Plains, New York, June 1990
-
-