[plt-scheme] V4 request for thoughts on various question

[Grant Rettke]

<robby at cs.uchicago.edu> wrote:
> The constraint is on the values produced, not on the evaluation order per se. Specifically, this:
>
> (define q 0)
> (let ([x (begin (set! q (+ q 1)) 1)]
>      [y (begin (set! q (- q 1)) 1)])
>  q)
>
> must evaluate to 0, not -1 or +1.

When you say "values produced", do you mean values that are bound to
the names in the name value pairs, or ordering in which the value
expressions themselves are evaluated (x then y versus y then x)?