[plt-scheme] Y Combinator Exercise

On Nov 16, 2005, at 2:02 AM, Paulo Jorge Matos wrote:

> Hi all,
>
> Although some nice things about Scheme are not taught in our
> Programming Fundamentals Course I've written some 'harder/research'
> exercises to introduce them to some nice concepts which I make
> available online during the semester. I've already sone some for
> call/cc, the use of very basic operations to define some scheme
> implementation code, webpages and I'd like to write something about
> the Y Combinator but I'm missing ideas for an exercise where they
> could apply the concept of Y Combinator. It should not be too easy but
> also not too hard since this should be for them to grasp by themselves
> this concept. First I though about giving them an introduction to the
> Y combinator and then to ask them to solve the problem of the Towers
> of Hanoi for 8 discs for example by writing recursive definitions
> using the Y combinator.
>
> But I would like to know if someone has any other suggestion.

If it's useful:  The Y combinator can be written in both the  
intermediate and intermediate-with-lambda languages, and hence works  
fine in the stepper.  Pointers to both can be found (for the moment)  
in my course announcements page:

http://jbclements.dyndns.org/csc530-fa2005-blog.html#2

  
-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 2430 bytes
Desc: not available
URL: <http://lists.racket-lang.org/users/archive/attachments/20051116/627dc0a9/attachment.p7s>