[EMAIL PROTECTED] wrote:
> The code below is more general that required. It also generic: it
> works for any Functor and any combination of Functors. It performs
> fmap over arbitrarily deep `collections': lists of maybes of maps of
> IOs, etc. -- arbitrarily nested fmappable things.
Excellent. I guess I'll be brushing up on my typeclass-fu in order
to figure out how all this works.
Thanks,
Greg Buchholz
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
