On Saturday 19 November 2005 02:16, Greg Woodhouse wrote: > --- [EMAIL PROTECTED] wrote: > > fix f = f (fix f) -- Here you have your Y. No typeless lambda. > > > > g f n = n : f n -- This is a generic *non-recursive* `repeat` > > ones = fix g 1 -- Guess what. > > Very nice! I honestly would not have expected this to work. Simple > cases of lazy evaluation are one thing, but this is impressive.
[You should read some of his papers, for instance "the most unreliable techique in the world to compute pi". I was ROTFL when I saw the title and reading it was an eye-opener and fun too.] Ben _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
