On Jun 30, 2015, at 5:34 PM, 'John Clements' via Racket Users <racket-users@googlegroups.com> wrote:
> Specifically, one of the basic ideas of algebraic languages is that programs > are compositional. Specifically, if I write (a (b x) c), then the meaning of > this term depends on the meanings of a, (b x), and c. That is, I can combine > these three values to get the result. Generalized set! breaks this intuition. > Specifically, (set! (aref x 0 1) 13) does not depend on the value of (aref x > 0 1). Rather, it pulls apart this term and uses its subterm’s meanings. Actually, this makes a lot of sense to me and is probably the best argument I’ve heard for why lvalues can be a bad idea. (and some time ago I read the discussion on SRFI 17, just for fun looking at the reasoning on both sides) Thanks! -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
