Proposal discussion summary: Adding on

Taral taralx at
Thu Nov 9 13:20:10 EST 2006

On 11/9/06, Cale Gibbard <cgibbard at> 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>
"You can't prove anything."
    -- Gödel's Incompetence Theorem

More information about the Libraries mailing list