[plt-scheme] swindle: (define (values a b) (values 1 2))

You are right from the point of view of swindle.
|Jos
((((lambda(x)((((((x x)x)x)x)x)x))
   (lambda(x)(lambda(y)(x(x y)))))
  (lambda(x)(write x)x))
 "greetings, Jos")
----- Original Message ----- 
From: "Eli Barzilay" <eli at barzilay.org>
To: "jos koot" <jos.koot at tiscali.nl>
Cc: "PLT-list" <plt-scheme at list.cs.brown.edu>
Sent: Saturday, September 17, 2005 8:04 PM
Subject: Re: [plt-scheme] swindle: (define (values a b) (values 1 2))


> On Sep 17, jos koot wrote:
>> Thanks for your reply. You wrote:
>> > (Judging by the `(define a (+ a 1000))', you seem to be attached to
>> > the top-level behavior...)
>> Not necessarily. My examples did not include `(define a (+ a
>> 1000))',
> 
> They had
> 
>  (define (values a b) (begin (void) (old-values (+ a 100) (+ b 100))))
> 
> which is the same.
> 
> 
>> but this is not relevant. Include my examples in (let () ...) and my
>> argument still holds, I think
> 
> In a (let () ...) context, things are even more organized.  A
> definition of `a' that uses the "old" value of `a' will not work at
> all.
> 
> -- 
>          ((lambda (x) (x x)) (lambda (x) (x x)))          Eli Barzilay:
>                  http://www.barzilay.org/                 Maze is Life!