On 11/9/06, Cale Gibbard <cgibbard at gmail.com> wrote:
> We could have
> class Functor f where
> (.) :: (a -> b) -> (f a -> f b)
We could, but I'd be *very* worried about losing some important type
inference doing that.
--
Taral <taralx at gmail.com>
"You can't prove anything."
-- Gödel's Incompetence Theorem