w...@ccs.neu.edu wrote: > You are speaking as though whether a procedure needs a closure > to run correctly is a simple binary choice. It is not.
[...] > With the R5RS semantics, closures (or unique tags, which are > almost as expensive as closures) will probably have to be > allocated for every call to f and for every internal call to g. > Since most calls to g occur within a tight loop, creating and > garbage-collecting those closures or unique tags is likely to > dominate the running time. That's a high price to pay for a > theoretically inelegant misfeature that's seldom used correctly > in portable code. Thank you for the clarification. -- Aaron W. Hsu | arcf...@sacrideo.us | http://www.sacrideo.us Programming is just another word for the lost art of thinking. _______________________________________________ r6rs-discuss mailing list r6rs-discuss@lists.r6rs.org http://lists.r6rs.org/cgi-bin/mailman/listinfo/r6rs-discuss
