RE: [Haskell-cafe] When are undecidables ok?

2009-12-07 Thread Simon Peyton-Jones
I don’t think it’s all that complicated or fragile. To resolve the constraint (C T1 T2), use the appropriate instance declaration to express it in terms of (hopefully simpler) constraints. Keep doing that. If you terminate, GHC should. Example: to resolve Eq [Int], use the instance declaratio

Re: [Haskell-cafe] When are undecidables ok?

2009-12-05 Thread Michael Snoyman
On Sun, Dec 6, 2009 at 7:36 AM, Luke Palmer wrote: > On Sat, Dec 5, 2009 at 10:04 PM, Michael Snoyman > wrote: > > I know this is basically a rewording of a previous e-mail, but I realized > > this is the question I *really* wanted to ask. > > > > We have this language extension UndecidableInsta

Re: [Haskell-cafe] When are undecidables ok?

2009-12-05 Thread Luke Palmer
On Sat, Dec 5, 2009 at 10:04 PM, Michael Snoyman wrote: > I know this is basically a rewording of a previous e-mail, but I realized > this is the question I *really* wanted to ask. > > We have this language extension UndecidableInstances (not to mention > OverlappingInstances), which seem to divid