On Wed, Jun 23, 2010 at 03:41:29PM +0100, John Lato wrote:
How would you implement bfnum? (If you've already read the paper,
what was your first answer?)
This was my first answer, and it is wrong, but I thought it was
slightly clever, so here it is:
bfnum :: Tree a - Tree Int
bfnum tree =
On Wed, Jun 23, 2010 at 05:41:17PM +0100, John Lato wrote:
If this answer did work, I don't think the question would be
interesting.
We don't have to be mean. - Buckaroo Banzai.
--
Daniel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
hiding in here that doesn't depend on any fancy stuff, but I'm blinded to it by
having read and understood the Python version of the code.
Anybody have any suggestions? I'd greatly appreciate any help.
Thanks,
—
Daniel Lyons
___
Haskell-Cafe mailing
