19 Sep
2006
19 Sep
'06
9:48 a.m.
Robert Dockins wrote:
On Sep 19, 2006, at 8:52 AM, Conor McBride wrote:
Hi folks
apfelmus@quantentunnel.de wrote:
Btw, why are there no irrefutable patterns for GADTs? I mean, such a sin should be shame for a non-strict language...
Just imagine
data Eq a b where Refl :: Eq a a
coerce :: Eq a b -> a -> b coerce ~Refl a = b
I think you mean:
coerce ~Refl x = x
Indeed I do. My original program was much safer! Thanks Conor This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.