Re: Proposal discussion summary: Adding on

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