[Haskell-cafe] Type inference

Brian Hulley brianh at metamilk.com
Thu Feb 9 00:59:17 EST 2006

Brian Hulley wrote:
>          f :: (forall a m. a -> m a) -> c -> d -> (m c, m d)

The above is wrong - there is no way to quantify m properly. This must be 
why intersection types need to be written with "&" after all....

More information about the Haskell-Cafe mailing list