[racket] One define to rule them all

Three hours ago, Matthias Felleisen wrote:
> 
> On Nov 12, 2010, at 9:21 PM, Eli Barzilay wrote:
> 
> > In swindle, all of these do the "obvious" things:
> > 
> >  (define (values a b) (values 1 2))
> 
> I am sure glad Swindle can define binary tightly recursive
> functions.  Does it implement TR properly so that this really runs
> as an infinite loop?

I can't parse that.

-- 
          ((lambda (x) (x x)) (lambda (x) (x x)))          Eli Barzilay:
                    http://barzilay.org/                   Maze is Life!