[Haskell-cafe] Programming Chalenges: The 3n+1 problem

[David Virebayre]

2011/4/14 Sebastian Fischer <fischer at nii.ac.jp>

>
> The advantage of this complicated definition is that you get a
> memoized version of the `fibonacci` function simply by using `fixmemo`
> instead of `fix`:
>

Wow. I think something about 'fix' just made sense thanks to your post,
though I had read a few blog posts about it.

David.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20110415/ff7b7642/attachment-0001.htm>