From: Brad Phelan <phelan@...>
Date: 2007-06-07T02:25:23+09:00
Subject: Re: [SOLUTION][QUIZ] FizzBuzz (#126) [solution #2]

MenTaLguY wrote:
> And, here's my second one, written in a subset of Ruby which corresponds
> to a pure (though strict) lambda calculus, building up numbers, strings,
> and everything else entirely from scratch.  (Okay, I cheated a little
> bit for actual IO)
> 
> Sadly Church numerals are very slow for non-tiny numbers, and Ruby
> doesn't do tail recursion optimization which just makes matters worse.
> But it does work, given enough time and stack space.  Try running it and
> see how high you can get!

I thought it was randomly generated joke code jibberish till I copied
and ran it and it worked .. slowly. So I started revising my lambda
calculus till my brain hurt... So I ask a question...

Using your Ruby Church numerals  is it possible to test for equality? 
Perhapps you are doing it but I was unable to parse the
whole algorithm out and figure out exactly what all the lambdas
you use do.

Cheers

Brad