[plt-scheme] to define, or to let

From: Matthew Flatt (mflatt at cs.utah.edu)
Date: Mon Mar 22 09:45:00 EST 2004

At Sun, 21 Mar 2004 14:18:43 -0800, "Bradd W. Szonye" wrote:
> Matthew Flatt wrote:
> > 1. Evaluation order is a different issue from allowing access to
> >    previously-bound variables in the right-hand side of a `letrec'
> >    binding.
> > 
> > The former is in the spirit of adding hash tables, etc. These are
> > extras that you can rely on in MzScheme, but not in plain R5RS.
> It's not quite the same as adding hash tables. Fixed evaluation order is
> a "quiet extension"; hash tables are not.

Ok, I see what you mean.

> Personally, I think it would be better to change R6RS to match MzScheme
> (and the many other Schemes that work like it).

Hm.... me, too. (Thanks to others who also suggested this.)


Posted on the users mailing list.