((( [logo]Racket )))Need Help?
AboutDownloadDocumentationPLaneTCommunityLearning

[racket] One define to rule them all

From: Matthias Felleisen (matthias at ccs.neu.edu)
Date: Sat Nov 13 10:11:54 EST 2010		 
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?
Posted on the users mailing list.