2 % (c) The University of Glasgow 2006
3 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
10 tcSimplifyInfer, tcSimplifyInferCheck,
11 tcSimplifyCheck, tcSimplifyRestricted,
12 tcSimplifyRuleLhs, tcSimplifyIPs,
13 tcSimplifySuperClasses,
14 tcSimplifyTop, tcSimplifyInteractive,
15 tcSimplifyBracket, tcSimplifyCheckPat,
17 tcSimplifyDeriv, tcSimplifyDefault,
18 bindInstsOfLocalFuns, bindIrreds,
21 #include "HsVersions.h"
23 import {-# SOURCE #-} TcUnify( unifyType )
59 %************************************************************************
63 %************************************************************************
65 --------------------------------------
66 Notes on functional dependencies (a bug)
67 --------------------------------------
74 instance D a b => C a b -- Undecidable
75 -- (Not sure if it's crucial to this eg)
76 f :: C a b => a -> Bool
79 g :: C a b => a -> Bool
82 Here f typechecks, but g does not!! Reason: before doing improvement,
83 we reduce the (C a b1) constraint from the call of f to (D a b1).
85 Here is a more complicated example:
87 | > class Foo a b | a->b
89 | > class Bar a b | a->b
93 | > instance Bar Obj Obj
95 | > instance (Bar a b) => Foo a b
97 | > foo:: (Foo a b) => a -> String
100 | > runFoo:: (forall a b. (Foo a b) => a -> w) -> w
106 | Could not deduce (Bar a b) from the context (Foo a b)
107 | arising from use of `foo' at <interactive>:1
109 | Add (Bar a b) to the expected type of an expression
110 | In the first argument of `runFoo', namely `foo'
111 | In the definition of `it': it = runFoo foo
113 | Why all of the sudden does GHC need the constraint Bar a b? The
114 | function foo didn't ask for that...
116 The trouble is that to type (runFoo foo), GHC has to solve the problem:
118 Given constraint Foo a b
119 Solve constraint Foo a b'
121 Notice that b and b' aren't the same. To solve this, just do
122 improvement and then they are the same. But GHC currently does
127 That is usually fine, but it isn't here, because it sees that Foo a b is
128 not the same as Foo a b', and so instead applies the instance decl for
129 instance Bar a b => Foo a b. And that's where the Bar constraint comes
132 The Right Thing is to improve whenever the constraint set changes at
133 all. Not hard in principle, but it'll take a bit of fiddling to do.
137 --------------------------------------
138 Notes on quantification
139 --------------------------------------
141 Suppose we are about to do a generalisation step.
145 T the type of the RHS
146 C the constraints from that RHS
148 The game is to figure out
150 Q the set of type variables over which to quantify
151 Ct the constraints we will *not* quantify over
152 Cq the constraints we will quantify over
154 So we're going to infer the type
158 and float the constraints Ct further outwards.
160 Here are the things that *must* be true:
162 (A) Q intersect fv(G) = EMPTY limits how big Q can be
163 (B) Q superset fv(Cq union T) \ oclose(fv(G),C) limits how small Q can be
165 (A) says we can't quantify over a variable that's free in the
166 environment. (B) says we must quantify over all the truly free
167 variables in T, else we won't get a sufficiently general type. We do
168 not *need* to quantify over any variable that is fixed by the free
169 vars of the environment G.
171 BETWEEN THESE TWO BOUNDS, ANY Q WILL DO!
173 Example: class H x y | x->y where ...
175 fv(G) = {a} C = {H a b, H c d}
178 (A) Q intersect {a} is empty
179 (B) Q superset {a,b,c,d} \ oclose({a}, C) = {a,b,c,d} \ {a,b} = {c,d}
181 So Q can be {c,d}, {b,c,d}
183 Other things being equal, however, we'd like to quantify over as few
184 variables as possible: smaller types, fewer type applications, more
185 constraints can get into Ct instead of Cq.
188 -----------------------------------------
191 fv(T) the free type vars of T
193 oclose(vs,C) The result of extending the set of tyvars vs
194 using the functional dependencies from C
196 grow(vs,C) The result of extend the set of tyvars vs
197 using all conceivable links from C.
199 E.g. vs = {a}, C = {H [a] b, K (b,Int) c, Eq e}
200 Then grow(vs,C) = {a,b,c}
202 Note that grow(vs,C) `superset` grow(vs,simplify(C))
203 That is, simplfication can only shrink the result of grow.
206 oclose is conservative one way: v `elem` oclose(vs,C) => v is definitely fixed by vs
207 grow is conservative the other way: if v might be fixed by vs => v `elem` grow(vs,C)
210 -----------------------------------------
214 Here's a good way to choose Q:
216 Q = grow( fv(T), C ) \ oclose( fv(G), C )
218 That is, quantify over all variable that that MIGHT be fixed by the
219 call site (which influences T), but which aren't DEFINITELY fixed by
220 G. This choice definitely quantifies over enough type variables,
221 albeit perhaps too many.
223 Why grow( fv(T), C ) rather than fv(T)? Consider
225 class H x y | x->y where ...
230 If we used fv(T) = {c} we'd get the type
232 forall c. H c d => c -> b
234 And then if the fn was called at several different c's, each of
235 which fixed d differently, we'd get a unification error, because
236 d isn't quantified. Solution: quantify d. So we must quantify
237 everything that might be influenced by c.
239 Why not oclose( fv(T), C )? Because we might not be able to see
240 all the functional dependencies yet:
242 class H x y | x->y where ...
243 instance H x y => Eq (T x y) where ...
248 Now oclose(fv(T),C) = {c}, because the functional dependency isn't
249 apparent yet, and that's wrong. We must really quantify over d too.
252 There really isn't any point in quantifying over any more than
253 grow( fv(T), C ), because the call sites can't possibly influence
254 any other type variables.
258 -------------------------------------
260 -------------------------------------
262 It's very hard to be certain when a type is ambiguous. Consider
266 instance H x y => K (x,y)
268 Is this type ambiguous?
269 forall a b. (K (a,b), Eq b) => a -> a
271 Looks like it! But if we simplify (K (a,b)) we get (H a b) and
272 now we see that a fixes b. So we can't tell about ambiguity for sure
273 without doing a full simplification. And even that isn't possible if
274 the context has some free vars that may get unified. Urgle!
276 Here's another example: is this ambiguous?
277 forall a b. Eq (T b) => a -> a
278 Not if there's an insance decl (with no context)
279 instance Eq (T b) where ...
281 You may say of this example that we should use the instance decl right
282 away, but you can't always do that:
284 class J a b where ...
285 instance J Int b where ...
287 f :: forall a b. J a b => a -> a
289 (Notice: no functional dependency in J's class decl.)
290 Here f's type is perfectly fine, provided f is only called at Int.
291 It's premature to complain when meeting f's signature, or even
292 when inferring a type for f.
296 However, we don't *need* to report ambiguity right away. It'll always
297 show up at the call site.... and eventually at main, which needs special
298 treatment. Nevertheless, reporting ambiguity promptly is an excellent thing.
300 So here's the plan. We WARN about probable ambiguity if
302 fv(Cq) is not a subset of oclose(fv(T) union fv(G), C)
304 (all tested before quantification).
305 That is, all the type variables in Cq must be fixed by the the variables
306 in the environment, or by the variables in the type.
308 Notice that we union before calling oclose. Here's an example:
310 class J a b c | a b -> c
314 forall b c. (J a b c) => b -> b
316 Only if we union {a} from G with {b} from T before using oclose,
317 do we see that c is fixed.
319 It's a bit vague exactly which C we should use for this oclose call. If we
320 don't fix enough variables we might complain when we shouldn't (see
321 the above nasty example). Nothing will be perfect. That's why we can
322 only issue a warning.
325 Can we ever be *certain* about ambiguity? Yes: if there's a constraint
327 c in C such that fv(c) intersect (fv(G) union fv(T)) = EMPTY
329 then c is a "bubble"; there's no way it can ever improve, and it's
330 certainly ambiguous. UNLESS it is a constant (sigh). And what about
335 instance H x y => K (x,y)
337 Is this type ambiguous?
338 forall a b. (K (a,b), Eq b) => a -> a
340 Urk. The (Eq b) looks "definitely ambiguous" but it isn't. What we are after
341 is a "bubble" that's a set of constraints
343 Cq = Ca union Cq' st fv(Ca) intersect (fv(Cq') union fv(T) union fv(G)) = EMPTY
345 Hence another idea. To decide Q start with fv(T) and grow it
346 by transitive closure in Cq (no functional dependencies involved).
347 Now partition Cq using Q, leaving the definitely-ambiguous and probably-ok.
348 The definitely-ambiguous can then float out, and get smashed at top level
349 (which squashes out the constants, like Eq (T a) above)
352 --------------------------------------
353 Notes on principal types
354 --------------------------------------
359 f x = let g y = op (y::Int) in True
361 Here the principal type of f is (forall a. a->a)
362 but we'll produce the non-principal type
363 f :: forall a. C Int => a -> a
366 --------------------------------------
367 The need for forall's in constraints
368 --------------------------------------
370 [Exchange on Haskell Cafe 5/6 Dec 2000]
372 class C t where op :: t -> Bool
373 instance C [t] where op x = True
375 p y = (let f :: c -> Bool; f x = op (y >> return x) in f, y ++ [])
376 q y = (y ++ [], let f :: c -> Bool; f x = op (y >> return x) in f)
378 The definitions of p and q differ only in the order of the components in
379 the pair on their right-hand sides. And yet:
381 ghc and "Typing Haskell in Haskell" reject p, but accept q;
382 Hugs rejects q, but accepts p;
383 hbc rejects both p and q;
384 nhc98 ... (Malcolm, can you fill in the blank for us!).
386 The type signature for f forces context reduction to take place, and
387 the results of this depend on whether or not the type of y is known,
388 which in turn depends on which component of the pair the type checker
391 Solution: if y::m a, float out the constraints
392 Monad m, forall c. C (m c)
393 When m is later unified with [], we can solve both constraints.
396 --------------------------------------
397 Notes on implicit parameters
398 --------------------------------------
400 Note [Inheriting implicit parameters]
401 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
406 where f is *not* a top-level binding.
407 From the RHS of f we'll get the constraint (?y::Int).
408 There are two types we might infer for f:
412 (so we get ?y from the context of f's definition), or
414 f :: (?y::Int) => Int -> Int
416 At first you might think the first was better, becuase then
417 ?y behaves like a free variable of the definition, rather than
418 having to be passed at each call site. But of course, the WHOLE
419 IDEA is that ?y should be passed at each call site (that's what
420 dynamic binding means) so we'd better infer the second.
422 BOTTOM LINE: when *inferring types* you *must* quantify
423 over implicit parameters. See the predicate isFreeWhenInferring.
426 Note [Implicit parameters and ambiguity]
427 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
428 What type should we infer for this?
429 f x = (show ?y, x::Int)
430 Since we must quantify over the ?y, the most plausible type is
431 f :: (Show a, ?y::a) => Int -> (String, Int)
432 But notice that the type of the RHS is (String,Int), with no type
433 varibables mentioned at all! The type of f looks ambiguous. But
434 it isn't, because at a call site we might have
435 let ?y = 5::Int in f 7
436 and all is well. In effect, implicit parameters are, well, parameters,
437 so we can take their type variables into account as part of the
438 "tau-tvs" stuff. This is done in the function 'FunDeps.grow'.
441 Question 2: type signatures
442 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
443 BUT WATCH OUT: When you supply a type signature, we can't force you
444 to quantify over implicit parameters. For example:
448 This is perfectly reasonable. We do not want to insist on
450 (?x + 1) :: (?x::Int => Int)
452 That would be silly. Here, the definition site *is* the occurrence site,
453 so the above strictures don't apply. Hence the difference between
454 tcSimplifyCheck (which *does* allow implicit paramters to be inherited)
455 and tcSimplifyCheckBind (which does not).
457 What about when you supply a type signature for a binding?
458 Is it legal to give the following explicit, user type
459 signature to f, thus:
464 At first sight this seems reasonable, but it has the nasty property
465 that adding a type signature changes the dynamic semantics.
468 (let f x = (x::Int) + ?y
469 in (f 3, f 3 with ?y=5)) with ?y = 6
475 in (f 3, f 3 with ?y=5)) with ?y = 6
479 Indeed, simply inlining f (at the Haskell source level) would change the
482 Nevertheless, as Launchbury says (email Oct 01) we can't really give the
483 semantics for a Haskell program without knowing its typing, so if you
484 change the typing you may change the semantics.
486 To make things consistent in all cases where we are *checking* against
487 a supplied signature (as opposed to inferring a type), we adopt the
490 a signature does not need to quantify over implicit params.
492 [This represents a (rather marginal) change of policy since GHC 5.02,
493 which *required* an explicit signature to quantify over all implicit
494 params for the reasons mentioned above.]
496 But that raises a new question. Consider
498 Given (signature) ?x::Int
499 Wanted (inferred) ?x::Int, ?y::Bool
501 Clearly we want to discharge the ?x and float the ?y out. But
502 what is the criterion that distinguishes them? Clearly it isn't
503 what free type variables they have. The Right Thing seems to be
504 to float a constraint that
505 neither mentions any of the quantified type variables
506 nor any of the quantified implicit parameters
508 See the predicate isFreeWhenChecking.
511 Question 3: monomorphism
512 ~~~~~~~~~~~~~~~~~~~~~~~~
513 There's a nasty corner case when the monomorphism restriction bites:
517 The argument above suggests that we *must* generalise
518 over the ?y parameter, to get
519 z :: (?y::Int) => Int,
520 but the monomorphism restriction says that we *must not*, giving
522 Why does the momomorphism restriction say this? Because if you have
524 let z = x + ?y in z+z
526 you might not expect the addition to be done twice --- but it will if
527 we follow the argument of Question 2 and generalise over ?y.
530 Question 4: top level
531 ~~~~~~~~~~~~~~~~~~~~~
532 At the top level, monomorhism makes no sense at all.
535 main = let ?x = 5 in print foo
539 woggle :: (?x :: Int) => Int -> Int
542 We definitely don't want (foo :: Int) with a top-level implicit parameter
543 (?x::Int) becuase there is no way to bind it.
548 (A) Always generalise over implicit parameters
549 Bindings that fall under the monomorphism restriction can't
553 * Inlining remains valid
554 * No unexpected loss of sharing
555 * But simple bindings like
557 will be rejected, unless you add an explicit type signature
558 (to avoid the monomorphism restriction)
559 z :: (?y::Int) => Int
561 This seems unacceptable
563 (B) Monomorphism restriction "wins"
564 Bindings that fall under the monomorphism restriction can't
566 Always generalise over implicit parameters *except* for bindings
567 that fall under the monomorphism restriction
570 * Inlining isn't valid in general
571 * No unexpected loss of sharing
572 * Simple bindings like
574 accepted (get value of ?y from binding site)
576 (C) Always generalise over implicit parameters
577 Bindings that fall under the monomorphism restriction can't
578 be generalised, EXCEPT for implicit parameters
580 * Inlining remains valid
581 * Unexpected loss of sharing (from the extra generalisation)
582 * Simple bindings like
584 accepted (get value of ?y from occurrence sites)
589 None of these choices seems very satisfactory. But at least we should
590 decide which we want to do.
592 It's really not clear what is the Right Thing To Do. If you see
596 would you expect the value of ?y to be got from the *occurrence sites*
597 of 'z', or from the valuue of ?y at the *definition* of 'z'? In the
598 case of function definitions, the answer is clearly the former, but
599 less so in the case of non-fucntion definitions. On the other hand,
600 if we say that we get the value of ?y from the definition site of 'z',
601 then inlining 'z' might change the semantics of the program.
603 Choice (C) really says "the monomorphism restriction doesn't apply
604 to implicit parameters". Which is fine, but remember that every
605 innocent binding 'x = ...' that mentions an implicit parameter in
606 the RHS becomes a *function* of that parameter, called at each
607 use of 'x'. Now, the chances are that there are no intervening 'with'
608 clauses that bind ?y, so a decent compiler should common up all
609 those function calls. So I think I strongly favour (C). Indeed,
610 one could make a similar argument for abolishing the monomorphism
611 restriction altogether.
613 BOTTOM LINE: we choose (B) at present. See tcSimplifyRestricted
617 %************************************************************************
619 \subsection{tcSimplifyInfer}
621 %************************************************************************
623 tcSimplify is called when we *inferring* a type. Here's the overall game plan:
625 1. Compute Q = grow( fvs(T), C )
627 2. Partition C based on Q into Ct and Cq. Notice that ambiguous
628 predicates will end up in Ct; we deal with them at the top level
630 3. Try improvement, using functional dependencies
632 4. If Step 3 did any unification, repeat from step 1
633 (Unification can change the result of 'grow'.)
635 Note: we don't reduce dictionaries in step 2. For example, if we have
636 Eq (a,b), we don't simplify to (Eq a, Eq b). So Q won't be different
637 after step 2. However note that we may therefore quantify over more
638 type variables than we absolutely have to.
640 For the guts, we need a loop, that alternates context reduction and
641 improvement with unification. E.g. Suppose we have
643 class C x y | x->y where ...
645 and tcSimplify is called with:
647 Then improvement unifies a with b, giving
650 If we need to unify anything, we rattle round the whole thing all over
657 -> TcTyVarSet -- fv(T); type vars
659 -> TcM ([TcTyVar], -- Tyvars to quantify (zonked and quantified)
660 [Inst], -- Dict Ids that must be bound here (zonked)
661 TcDictBinds) -- Bindings
662 -- Any free (escaping) Insts are tossed into the environment
667 tcSimplifyInfer doc tau_tvs wanted
668 = do { tau_tvs' <- zonkTcTyVarsAndFV (varSetElems tau_tvs)
669 ; wanted' <- mappM zonkInst wanted -- Zonk before deciding quantified tyvars
670 ; gbl_tvs <- tcGetGlobalTyVars
671 ; let preds = fdPredsOfInsts wanted'
672 qtvs = grow preds tau_tvs' `minusVarSet` oclose preds gbl_tvs
673 (free, bound) = partition (isFreeWhenInferring qtvs) wanted'
674 ; traceTc (text "infer" <+> (ppr preds $$ ppr (grow preds tau_tvs') $$ ppr gbl_tvs $$ ppr (oclose preds gbl_tvs) $$ ppr free $$ ppr bound))
677 -- To make types simple, reduce as much as possible
678 ; let try_me inst = ReduceMe AddSCs
679 ; (irreds, binds) <- checkLoop (mkRedEnv doc try_me []) bound
681 ; qtvs' <- zonkQuantifiedTyVars (varSetElems qtvs)
683 -- We can't abstract over implications
684 ; let (dicts, implics) = partition isDict irreds
685 ; loc <- getInstLoc (ImplicOrigin doc)
686 ; implic_bind <- bindIrreds loc qtvs' dicts implics
688 ; return (qtvs', dicts, binds `unionBags` implic_bind) }
689 -- NB: when we are done, we might have some bindings, but
690 -- the final qtvs might be empty. See Note [NO TYVARS] below.
694 -----------------------------------------------------------
695 -- tcSimplifyInferCheck is used when we know the constraints we are to simplify
696 -- against, but we don't know the type variables over which we are going to quantify.
697 -- This happens when we have a type signature for a mutually recursive group
700 -> TcTyVarSet -- fv(T)
703 -> TcM ([TyVar], -- Fully zonked, and quantified
704 TcDictBinds) -- Bindings
706 tcSimplifyInferCheck loc tau_tvs givens wanteds
707 = do { (irreds, binds) <- innerCheckLoop loc givens wanteds
709 -- Figure out which type variables to quantify over
710 -- You might think it should just be the signature tyvars,
711 -- but in bizarre cases you can get extra ones
712 -- f :: forall a. Num a => a -> a
713 -- f x = fst (g (x, head [])) + 1
715 -- Here we infer g :: forall a b. a -> b -> (b,a)
716 -- We don't want g to be monomorphic in b just because
717 -- f isn't quantified over b.
718 ; let all_tvs = varSetElems (tau_tvs `unionVarSet` tyVarsOfInsts givens)
719 ; all_tvs <- zonkTcTyVarsAndFV all_tvs
720 ; gbl_tvs <- tcGetGlobalTyVars
721 ; let qtvs = varSetElems (all_tvs `minusVarSet` gbl_tvs)
722 -- We could close gbl_tvs, but its not necessary for
723 -- soundness, and it'll only affect which tyvars, not which
724 -- dictionaries, we quantify over
726 ; qtvs' <- zonkQuantifiedTyVars qtvs
728 -- Now we are back to normal (c.f. tcSimplCheck)
729 ; implic_bind <- bindIrreds loc qtvs' givens irreds
731 ; return (qtvs', binds `unionBags` implic_bind) }
734 Note [Squashing methods]
735 ~~~~~~~~~~~~~~~~~~~~~~~~~
736 Be careful if you want to float methods more:
737 truncate :: forall a. RealFrac a => forall b. Integral b => a -> b
738 From an application (truncate f i) we get
741 If we have also have a second occurrence of truncate, we get
744 When simplifying with i,f free, we might still notice that
745 t1=t3; but alas, the binding for t2 (which mentions t1)
746 may continue to float out!
751 class Y a b | a -> b where
754 instance Y [[a]] a where
757 k :: X a -> X a -> X a
759 g :: Num a => [X a] -> [X a]
762 h ys = ys ++ map (k (y [[0]])) xs
764 The excitement comes when simplifying the bindings for h. Initially
765 try to simplify {y @ [[t1]] t2, 0 @ t1}, with initial qtvs = {t2}.
766 From this we get t1:=:t2, but also various bindings. We can't forget
767 the bindings (because of [LOOP]), but in fact t1 is what g is
770 The net effect of [NO TYVARS]
773 isFreeWhenInferring :: TyVarSet -> Inst -> Bool
774 isFreeWhenInferring qtvs inst
775 = isFreeWrtTyVars qtvs inst -- Constrains no quantified vars
776 && isInheritableInst inst -- and no implicit parameter involved
777 -- see Note [Inheriting implicit parameters]
779 {- No longer used (with implication constraints)
780 isFreeWhenChecking :: TyVarSet -- Quantified tyvars
781 -> NameSet -- Quantified implicit parameters
783 isFreeWhenChecking qtvs ips inst
784 = isFreeWrtTyVars qtvs inst
785 && isFreeWrtIPs ips inst
788 isFreeWrtTyVars qtvs inst = tyVarsOfInst inst `disjointVarSet` qtvs
789 isFreeWrtIPs ips inst = not (any (`elemNameSet` ips) (ipNamesOfInst inst))
793 %************************************************************************
795 \subsection{tcSimplifyCheck}
797 %************************************************************************
799 @tcSimplifyCheck@ is used when we know exactly the set of variables
800 we are going to quantify over. For example, a class or instance declaration.
803 -----------------------------------------------------------
804 -- tcSimplifyCheck is used when checking expression type signatures,
805 -- class decls, instance decls etc.
806 tcSimplifyCheck :: InstLoc
807 -> [TcTyVar] -- Quantify over these
810 -> TcM TcDictBinds -- Bindings
811 tcSimplifyCheck loc qtvs givens wanteds
812 = ASSERT( all isTcTyVar qtvs && all isSkolemTyVar qtvs )
813 do { (irreds, binds) <- innerCheckLoop loc givens wanteds
814 ; implic_bind <- bindIrreds loc qtvs givens irreds
815 ; return (binds `unionBags` implic_bind) }
817 -----------------------------------------------------------
818 -- tcSimplifyCheckPat is used for existential pattern match
819 tcSimplifyCheckPat :: InstLoc
820 -> [CoVar] -> Refinement
821 -> [TcTyVar] -- Quantify over these
824 -> TcM TcDictBinds -- Bindings
825 tcSimplifyCheckPat loc co_vars reft qtvs givens wanteds
826 = ASSERT( all isTcTyVar qtvs && all isSkolemTyVar qtvs )
827 do { (irreds, binds) <- innerCheckLoop loc givens wanteds
828 ; implic_bind <- bindIrredsR loc qtvs co_vars reft
830 ; return (binds `unionBags` implic_bind) }
832 -----------------------------------------------------------
833 bindIrreds :: InstLoc -> [TcTyVar]
836 bindIrreds loc qtvs givens irreds
837 = bindIrredsR loc qtvs [] emptyRefinement givens irreds
839 bindIrredsR :: InstLoc -> [TcTyVar] -> [CoVar]
840 -> Refinement -> [Inst] -> [Inst]
842 -- Make a binding that binds 'irreds', by generating an implication
843 -- constraint for them, *and* throwing the constraint into the LIE
844 bindIrredsR loc qtvs co_vars reft givens irreds
848 = do { let givens' = filter isDict givens
849 -- The givens can include methods
850 -- See Note [Pruning the givens in an implication constraint]
852 -- If there are no 'givens' *and* the refinement is empty
853 -- (the refinement is like more givens), then it's safe to
854 -- partition the 'wanteds' by their qtvs, thereby trimming irreds
855 -- See Note [Freeness and implications]
856 ; irreds' <- if null givens' && isEmptyRefinement reft
858 { let qtv_set = mkVarSet qtvs
859 (frees, real_irreds) = partition (isFreeWrtTyVars qtv_set) irreds
861 ; return real_irreds }
864 ; let all_tvs = qtvs ++ co_vars -- Abstract over all these
865 ; (implics, bind) <- makeImplicationBind loc all_tvs reft givens' irreds'
866 -- This call does the real work
867 -- If irreds' is empty, it does something sensible
872 makeImplicationBind :: InstLoc -> [TcTyVar] -> Refinement
874 -> TcM ([Inst], TcDictBinds)
875 -- Make a binding that binds 'irreds', by generating an implication
876 -- constraint for them, *and* throwing the constraint into the LIE
877 -- The binding looks like
878 -- (ir1, .., irn) = f qtvs givens
879 -- where f is (evidence for) the new implication constraint
880 -- f :: forall qtvs. {reft} givens => (ir1, .., irn)
881 -- qtvs includes coercion variables
883 -- This binding must line up the 'rhs' in reduceImplication
884 makeImplicationBind loc all_tvs reft
885 givens -- Guaranteed all Dicts
887 | null irreds -- If there are no irreds, we are done
888 = return ([], emptyBag)
889 | otherwise -- Otherwise we must generate a binding
890 = do { uniq <- newUnique
891 ; span <- getSrcSpanM
892 ; let name = mkInternalName uniq (mkVarOcc "ic") (srcSpanStart span)
893 implic_inst = ImplicInst { tci_name = name, tci_reft = reft,
894 tci_tyvars = all_tvs,
896 tci_wanted = irreds, tci_loc = loc }
898 ; let n_irreds = length irreds
899 irred_ids = map instToId irreds
900 tup_ty = mkTupleTy Boxed n_irreds (map idType irred_ids)
901 pat = TuplePat (map nlVarPat irred_ids) Boxed tup_ty
902 rhs = L span (mkHsWrap co (HsVar (instToId implic_inst)))
903 co = mkWpApps (map instToId givens) <.> mkWpTyApps (mkTyVarTys all_tvs)
904 bind | n_irreds==1 = VarBind (head irred_ids) rhs
905 | otherwise = PatBind { pat_lhs = L span pat,
906 pat_rhs = unguardedGRHSs rhs,
908 bind_fvs = placeHolderNames }
909 ; -- pprTrace "Make implic inst" (ppr implic_inst) $
910 return ([implic_inst], unitBag (L span bind)) }
912 -----------------------------------------------------------
915 -> TcM ([Inst], TcDictBinds)
917 topCheckLoop doc wanteds
918 = checkLoop (mkRedEnv doc try_me []) wanteds
920 try_me inst = ReduceMe AddSCs
922 -----------------------------------------------------------
923 innerCheckLoop :: InstLoc
926 -> TcM ([Inst], TcDictBinds)
928 innerCheckLoop inst_loc givens wanteds
929 = checkLoop env wanteds
931 env = mkRedEnv (pprInstLoc inst_loc) try_me givens
933 try_me inst | isMethodOrLit inst = ReduceMe AddSCs
935 -- When checking against a given signature
936 -- we MUST be very gentle: Note [Check gently]
941 We have to very careful about not simplifying too vigorously
946 f :: Show b => T b -> b
949 Inside the pattern match, which binds (a:*, x:a), we know that
951 Hence we have a dictionary for Show [a] available; and indeed we
952 need it. We are going to build an implication contraint
953 forall a. (b~[a]) => Show [a]
954 Later, we will solve this constraint using the knowledge (Show b)
956 But we MUST NOT reduce (Show [a]) to (Show a), else the whole
957 thing becomes insoluble. So we simplify gently (get rid of literals
958 and methods only, plus common up equal things), deferring the real
959 work until top level, when we solve the implication constraint
964 -----------------------------------------------------------
967 -> TcM ([Inst], TcDictBinds)
968 -- Precondition: givens are completely rigid
970 checkLoop env wanteds
971 = do { -- Givens are skolems, so no need to zonk them
972 wanteds' <- mappM zonkInst wanteds
974 ; (improved, binds, irreds) <- reduceContext env wanteds'
976 ; if not improved then
977 return (irreds, binds)
980 -- If improvement did some unification, we go round again.
981 -- We start again with irreds, not wanteds
982 -- Using an instance decl might have introduced a fresh type variable
983 -- which might have been unified, so we'd get an infinite loop
984 -- if we started again with wanteds! See Note [LOOP]
985 { (irreds1, binds1) <- checkLoop env irreds
986 ; return (irreds1, binds `unionBags` binds1) } }
991 class If b t e r | b t e -> r
994 class Lte a b c | a b -> c where lte :: a -> b -> c
996 instance (Lte a b l,If l b a c) => Max a b c
998 Wanted: Max Z (S x) y
1000 Then we'll reduce using the Max instance to:
1001 (Lte Z (S x) l, If l (S x) Z y)
1002 and improve by binding l->T, after which we can do some reduction
1003 on both the Lte and If constraints. What we *can't* do is start again
1004 with (Max Z (S x) y)!
1008 %************************************************************************
1010 tcSimplifySuperClasses
1012 %************************************************************************
1014 Note [SUPERCLASS-LOOP 1]
1015 ~~~~~~~~~~~~~~~~~~~~~~~~
1016 We have to be very, very careful when generating superclasses, lest we
1017 accidentally build a loop. Here's an example:
1021 class S a => C a where { opc :: a -> a }
1022 class S b => D b where { opd :: b -> b }
1024 instance C Int where
1027 instance D Int where
1030 From (instance C Int) we get the constraint set {ds1:S Int, dd:D Int}
1031 Simplifying, we may well get:
1032 $dfCInt = :C ds1 (opd dd)
1035 Notice that we spot that we can extract ds1 from dd.
1037 Alas! Alack! We can do the same for (instance D Int):
1039 $dfDInt = :D ds2 (opc dc)
1043 And now we've defined the superclass in terms of itself.
1045 Solution: never generate a superclass selectors at all when
1046 satisfying the superclass context of an instance declaration.
1048 Two more nasty cases are in
1053 tcSimplifySuperClasses
1058 tcSimplifySuperClasses loc givens sc_wanteds
1059 = do { (irreds, binds1) <- checkLoop env sc_wanteds
1060 ; let (tidy_env, tidy_irreds) = tidyInsts irreds
1061 ; reportNoInstances tidy_env (Just (loc, givens)) tidy_irreds
1064 env = mkRedEnv (pprInstLoc loc) try_me givens
1065 try_me inst = ReduceMe NoSCs
1066 -- Like topCheckLoop, but with NoSCs
1070 %************************************************************************
1072 \subsection{tcSimplifyRestricted}
1074 %************************************************************************
1076 tcSimplifyRestricted infers which type variables to quantify for a
1077 group of restricted bindings. This isn't trivial.
1080 We want to quantify over a to get id :: forall a. a->a
1083 We do not want to quantify over a, because there's an Eq a
1084 constraint, so we get eq :: a->a->Bool (notice no forall)
1087 RHS has type 'tau', whose free tyvars are tau_tvs
1088 RHS has constraints 'wanteds'
1091 Quantify over (tau_tvs \ ftvs(wanteds))
1092 This is bad. The constraints may contain (Monad (ST s))
1093 where we have instance Monad (ST s) where...
1094 so there's no need to be monomorphic in s!
1096 Also the constraint might be a method constraint,
1097 whose type mentions a perfectly innocent tyvar:
1098 op :: Num a => a -> b -> a
1099 Here, b is unconstrained. A good example would be
1101 We want to infer the polymorphic type
1102 foo :: forall b. b -> b
1105 Plan B (cunning, used for a long time up to and including GHC 6.2)
1106 Step 1: Simplify the constraints as much as possible (to deal
1107 with Plan A's problem). Then set
1108 qtvs = tau_tvs \ ftvs( simplify( wanteds ) )
1110 Step 2: Now simplify again, treating the constraint as 'free' if
1111 it does not mention qtvs, and trying to reduce it otherwise.
1112 The reasons for this is to maximise sharing.
1114 This fails for a very subtle reason. Suppose that in the Step 2
1115 a constraint (Foo (Succ Zero) (Succ Zero) b) gets thrown upstairs as 'free'.
1116 In the Step 1 this constraint might have been simplified, perhaps to
1117 (Foo Zero Zero b), AND THEN THAT MIGHT BE IMPROVED, to bind 'b' to 'T'.
1118 This won't happen in Step 2... but that in turn might prevent some other
1119 constraint (Baz [a] b) being simplified (e.g. via instance Baz [a] T where {..})
1120 and that in turn breaks the invariant that no constraints are quantified over.
1122 Test typecheck/should_compile/tc177 (which failed in GHC 6.2) demonstrates
1127 Step 1: Simplify the constraints as much as possible (to deal
1128 with Plan A's problem). Then set
1129 qtvs = tau_tvs \ ftvs( simplify( wanteds ) )
1130 Return the bindings from Step 1.
1133 A note about Plan C (arising from "bug" reported by George Russel March 2004)
1136 instance (HasBinary ty IO) => HasCodedValue ty
1138 foo :: HasCodedValue a => String -> IO a
1140 doDecodeIO :: HasCodedValue a => () -> () -> IO a
1141 doDecodeIO codedValue view
1142 = let { act = foo "foo" } in act
1144 You might think this should work becuase the call to foo gives rise to a constraint
1145 (HasCodedValue t), which can be satisfied by the type sig for doDecodeIO. But the
1146 restricted binding act = ... calls tcSimplifyRestricted, and PlanC simplifies the
1147 constraint using the (rather bogus) instance declaration, and now we are stuffed.
1149 I claim this is not really a bug -- but it bit Sergey as well as George. So here's
1153 Plan D (a variant of plan B)
1154 Step 1: Simplify the constraints as much as possible (to deal
1155 with Plan A's problem), BUT DO NO IMPROVEMENT. Then set
1156 qtvs = tau_tvs \ ftvs( simplify( wanteds ) )
1158 Step 2: Now simplify again, treating the constraint as 'free' if
1159 it does not mention qtvs, and trying to reduce it otherwise.
1161 The point here is that it's generally OK to have too few qtvs; that is,
1162 to make the thing more monomorphic than it could be. We don't want to
1163 do that in the common cases, but in wierd cases it's ok: the programmer
1164 can always add a signature.
1166 Too few qtvs => too many wanteds, which is what happens if you do less
1171 tcSimplifyRestricted -- Used for restricted binding groups
1172 -- i.e. ones subject to the monomorphism restriction
1175 -> [Name] -- Things bound in this group
1176 -> TcTyVarSet -- Free in the type of the RHSs
1177 -> [Inst] -- Free in the RHSs
1178 -> TcM ([TyVar], -- Tyvars to quantify (zonked and quantified)
1179 TcDictBinds) -- Bindings
1180 -- tcSimpifyRestricted returns no constraints to
1181 -- quantify over; by definition there are none.
1182 -- They are all thrown back in the LIE
1184 tcSimplifyRestricted doc top_lvl bndrs tau_tvs wanteds
1185 -- Zonk everything in sight
1186 = do { wanteds' <- mappM zonkInst wanteds
1188 -- 'ReduceMe': Reduce as far as we can. Don't stop at
1189 -- dicts; the idea is to get rid of as many type
1190 -- variables as possible, and we don't want to stop
1191 -- at (say) Monad (ST s), because that reduces
1192 -- immediately, with no constraint on s.
1194 -- BUT do no improvement! See Plan D above
1195 -- HOWEVER, some unification may take place, if we instantiate
1196 -- a method Inst with an equality constraint
1197 ; let env = mkNoImproveRedEnv doc (\i -> ReduceMe AddSCs)
1198 ; (_imp, _binds, constrained_dicts) <- reduceContext env wanteds'
1200 -- Next, figure out the tyvars we will quantify over
1201 ; tau_tvs' <- zonkTcTyVarsAndFV (varSetElems tau_tvs)
1202 ; gbl_tvs' <- tcGetGlobalTyVars
1203 ; constrained_dicts' <- mappM zonkInst constrained_dicts
1205 ; let constrained_tvs' = tyVarsOfInsts constrained_dicts'
1206 qtvs = (tau_tvs' `minusVarSet` oclose (fdPredsOfInsts constrained_dicts) gbl_tvs')
1207 `minusVarSet` constrained_tvs'
1208 ; traceTc (text "tcSimplifyRestricted" <+> vcat [
1209 pprInsts wanteds, pprInsts constrained_dicts',
1211 ppr constrained_tvs', ppr tau_tvs', ppr qtvs ])
1213 -- The first step may have squashed more methods than
1214 -- necessary, so try again, this time more gently, knowing the exact
1215 -- set of type variables to quantify over.
1217 -- We quantify only over constraints that are captured by qtvs;
1218 -- these will just be a subset of non-dicts. This in contrast
1219 -- to normal inference (using isFreeWhenInferring) in which we quantify over
1220 -- all *non-inheritable* constraints too. This implements choice
1221 -- (B) under "implicit parameter and monomorphism" above.
1223 -- Remember that we may need to do *some* simplification, to
1224 -- (for example) squash {Monad (ST s)} into {}. It's not enough
1225 -- just to float all constraints
1227 -- At top level, we *do* squash methods becuase we want to
1228 -- expose implicit parameters to the test that follows
1229 ; let is_nested_group = isNotTopLevel top_lvl
1230 try_me inst | isFreeWrtTyVars qtvs inst,
1231 (is_nested_group || isDict inst) = Stop
1232 | otherwise = ReduceMe AddSCs
1233 env = mkNoImproveRedEnv doc try_me
1234 ; (_imp, binds, irreds) <- reduceContext env wanteds'
1236 -- See "Notes on implicit parameters, Question 4: top level"
1237 ; ASSERT( all (isFreeWrtTyVars qtvs) irreds ) -- None should be captured
1238 if is_nested_group then
1240 else do { let (bad_ips, non_ips) = partition isIPDict irreds
1241 ; addTopIPErrs bndrs bad_ips
1242 ; extendLIEs non_ips }
1244 ; qtvs' <- zonkQuantifiedTyVars (varSetElems qtvs)
1245 ; return (qtvs', binds) }
1249 %************************************************************************
1253 %************************************************************************
1255 On the LHS of transformation rules we only simplify methods and constants,
1256 getting dictionaries. We want to keep all of them unsimplified, to serve
1257 as the available stuff for the RHS of the rule.
1259 Example. Consider the following left-hand side of a rule
1261 f (x == y) (y > z) = ...
1263 If we typecheck this expression we get constraints
1265 d1 :: Ord a, d2 :: Eq a
1267 We do NOT want to "simplify" to the LHS
1269 forall x::a, y::a, z::a, d1::Ord a.
1270 f ((==) (eqFromOrd d1) x y) ((>) d1 y z) = ...
1274 forall x::a, y::a, z::a, d1::Ord a, d2::Eq a.
1275 f ((==) d2 x y) ((>) d1 y z) = ...
1277 Here is another example:
1279 fromIntegral :: (Integral a, Num b) => a -> b
1280 {-# RULES "foo" fromIntegral = id :: Int -> Int #-}
1282 In the rule, a=b=Int, and Num Int is a superclass of Integral Int. But
1283 we *dont* want to get
1285 forall dIntegralInt.
1286 fromIntegral Int Int dIntegralInt (scsel dIntegralInt) = id Int
1288 because the scsel will mess up RULE matching. Instead we want
1290 forall dIntegralInt, dNumInt.
1291 fromIntegral Int Int dIntegralInt dNumInt = id Int
1295 g (x == y) (y == z) = ..
1297 where the two dictionaries are *identical*, we do NOT WANT
1299 forall x::a, y::a, z::a, d1::Eq a
1300 f ((==) d1 x y) ((>) d1 y z) = ...
1302 because that will only match if the dict args are (visibly) equal.
1303 Instead we want to quantify over the dictionaries separately.
1305 In short, tcSimplifyRuleLhs must *only* squash LitInst and MethInts, leaving
1306 all dicts unchanged, with absolutely no sharing. It's simpler to do this
1307 from scratch, rather than further parameterise simpleReduceLoop etc
1310 tcSimplifyRuleLhs :: [Inst] -> TcM ([Inst], TcDictBinds)
1311 tcSimplifyRuleLhs wanteds
1312 = go [] emptyBag wanteds
1315 = return (dicts, binds)
1316 go dicts binds (w:ws)
1318 = go (w:dicts) binds ws
1320 = do { w' <- zonkInst w -- So that (3::Int) does not generate a call
1321 -- to fromInteger; this looks fragile to me
1322 ; lookup_result <- lookupSimpleInst w'
1323 ; case lookup_result of
1324 GenInst ws' rhs -> go dicts (addBind binds w rhs) (ws' ++ ws)
1325 NoInstance -> pprPanic "tcSimplifyRuleLhs" (ppr w)
1329 tcSimplifyBracket is used when simplifying the constraints arising from
1330 a Template Haskell bracket [| ... |]. We want to check that there aren't
1331 any constraints that can't be satisfied (e.g. Show Foo, where Foo has no
1332 Show instance), but we aren't otherwise interested in the results.
1333 Nor do we care about ambiguous dictionaries etc. We will type check
1334 this bracket again at its usage site.
1337 tcSimplifyBracket :: [Inst] -> TcM ()
1338 tcSimplifyBracket wanteds
1339 = do { topCheckLoop doc wanteds
1342 doc = text "tcSimplifyBracket"
1346 %************************************************************************
1348 \subsection{Filtering at a dynamic binding}
1350 %************************************************************************
1355 we must discharge all the ?x constraints from B. We also do an improvement
1356 step; if we have ?x::t1 and ?x::t2 we must unify t1, t2.
1358 Actually, the constraints from B might improve the types in ?x. For example
1360 f :: (?x::Int) => Char -> Char
1363 then the constraint (?x::Int) arising from the call to f will
1364 force the binding for ?x to be of type Int.
1367 tcSimplifyIPs :: [Inst] -- The implicit parameters bound here
1370 -- We need a loop so that we do improvement, and then
1371 -- (next time round) generate a binding to connect the two
1373 -- Here the two ?x's have different types, and improvement
1374 -- makes them the same.
1376 tcSimplifyIPs given_ips wanteds
1377 = do { wanteds' <- mappM zonkInst wanteds
1378 ; given_ips' <- mappM zonkInst given_ips
1379 -- Unusually for checking, we *must* zonk the given_ips
1381 ; let env = mkRedEnv doc try_me given_ips'
1382 ; (improved, binds, irreds) <- reduceContext env wanteds'
1384 ; if not improved then
1385 ASSERT( all is_free irreds )
1386 do { extendLIEs irreds
1389 tcSimplifyIPs given_ips wanteds }
1391 doc = text "tcSimplifyIPs" <+> ppr given_ips
1392 ip_set = mkNameSet (ipNamesOfInsts given_ips)
1393 is_free inst = isFreeWrtIPs ip_set inst
1395 -- Simplify any methods that mention the implicit parameter
1396 try_me inst | is_free inst = Stop
1397 | otherwise = ReduceMe NoSCs
1401 %************************************************************************
1403 \subsection[binds-for-local-funs]{@bindInstsOfLocalFuns@}
1405 %************************************************************************
1407 When doing a binding group, we may have @Insts@ of local functions.
1408 For example, we might have...
1410 let f x = x + 1 -- orig local function (overloaded)
1411 f.1 = f Int -- two instances of f
1416 The point is: we must drop the bindings for @f.1@ and @f.2@ here,
1417 where @f@ is in scope; those @Insts@ must certainly not be passed
1418 upwards towards the top-level. If the @Insts@ were binding-ified up
1419 there, they would have unresolvable references to @f@.
1421 We pass in an @init_lie@ of @Insts@ and a list of locally-bound @Ids@.
1422 For each method @Inst@ in the @init_lie@ that mentions one of the
1423 @Ids@, we create a binding. We return the remaining @Insts@ (in an
1424 @LIE@), as well as the @HsBinds@ generated.
1427 bindInstsOfLocalFuns :: [Inst] -> [TcId] -> TcM TcDictBinds
1428 -- Simlifies only MethodInsts, and generate only bindings of form
1430 -- We're careful not to even generate bindings of the form
1432 -- You'd think that'd be fine, but it interacts with what is
1433 -- arguably a bug in Match.tidyEqnInfo (see notes there)
1435 bindInstsOfLocalFuns wanteds local_ids
1436 | null overloaded_ids
1438 = extendLIEs wanteds `thenM_`
1439 returnM emptyLHsBinds
1442 = do { (irreds, binds) <- checkLoop env for_me
1443 ; extendLIEs not_for_me
1447 env = mkRedEnv doc try_me []
1448 doc = text "bindInsts" <+> ppr local_ids
1449 overloaded_ids = filter is_overloaded local_ids
1450 is_overloaded id = isOverloadedTy (idType id)
1451 (for_me, not_for_me) = partition (isMethodFor overloaded_set) wanteds
1453 overloaded_set = mkVarSet overloaded_ids -- There can occasionally be a lot of them
1454 -- so it's worth building a set, so that
1455 -- lookup (in isMethodFor) is faster
1456 try_me inst | isMethod inst = ReduceMe NoSCs
1461 %************************************************************************
1463 \subsection{Data types for the reduction mechanism}
1465 %************************************************************************
1467 The main control over context reduction is here
1471 = RedEnv { red_doc :: SDoc -- The context
1472 , red_try_me :: Inst -> WhatToDo
1473 , red_improve :: Bool -- True <=> do improvement
1474 , red_givens :: [Inst] -- All guaranteed rigid
1476 -- but see Note [Rigidity]
1477 , red_stack :: (Int, [Inst]) -- Recursion stack (for err msg)
1478 -- See Note [RedStack]
1482 -- The red_givens are rigid so far as cmpInst is concerned.
1483 -- There is one case where they are not totally rigid, namely in tcSimplifyIPs
1484 -- let ?x = e in ...
1485 -- Here, the given is (?x::a), where 'a' is not necy a rigid type
1486 -- But that doesn't affect the comparison, which is based only on mame.
1489 -- The red_stack pair (n,insts) pair is just used for error reporting.
1490 -- 'n' is always the depth of the stack.
1491 -- The 'insts' is the stack of Insts being reduced: to produce X
1492 -- I had to produce Y, to produce Y I had to produce Z, and so on.
1495 mkRedEnv :: SDoc -> (Inst -> WhatToDo) -> [Inst] -> RedEnv
1496 mkRedEnv doc try_me givens
1497 = RedEnv { red_doc = doc, red_try_me = try_me,
1498 red_givens = givens, red_stack = (0,[]),
1499 red_improve = True }
1501 mkNoImproveRedEnv :: SDoc -> (Inst -> WhatToDo) -> RedEnv
1502 -- Do not do improvement; no givens
1503 mkNoImproveRedEnv doc try_me
1504 = RedEnv { red_doc = doc, red_try_me = try_me,
1505 red_givens = [], red_stack = (0,[]),
1506 red_improve = True }
1509 = ReduceMe WantSCs -- Try to reduce this
1510 -- If there's no instance, add the inst to the
1511 -- irreductible ones, but don't produce an error
1512 -- message of any kind.
1513 -- It might be quite legitimate such as (Eq a)!
1515 | Stop -- Return as irreducible unless it can
1516 -- be reduced to a constant in one step
1517 -- Do not add superclasses; see
1519 data WantSCs = NoSCs | AddSCs -- Tells whether we should add the superclasses
1520 -- of a predicate when adding it to the avails
1521 -- The reason for this flag is entirely the super-class loop problem
1522 -- Note [SUPER-CLASS LOOP 1]
1525 %************************************************************************
1527 \subsection[reduce]{@reduce@}
1529 %************************************************************************
1533 reduceContext :: RedEnv
1535 -> TcM (ImprovementDone,
1536 TcDictBinds, -- Dictionary bindings
1537 [Inst]) -- Irreducible
1539 reduceContext env wanteds
1540 = do { traceTc (text "reduceContext" <+> (vcat [
1541 text "----------------------",
1543 text "given" <+> ppr (red_givens env),
1544 text "wanted" <+> ppr wanteds,
1545 text "----------------------"
1548 -- Build the Avail mapping from "givens"
1549 ; init_state <- foldlM addGiven emptyAvails (red_givens env)
1552 ; avails <- reduceList env wanteds init_state
1554 ; let improved = availsImproved avails
1555 ; (binds, irreds) <- extractResults avails wanteds
1557 ; traceTc (text "reduceContext end" <+> (vcat [
1558 text "----------------------",
1560 text "given" <+> ppr (red_givens env),
1561 text "wanted" <+> ppr wanteds,
1563 text "avails" <+> pprAvails avails,
1564 text "improved =" <+> ppr improved,
1565 text "----------------------"
1568 ; return (improved, binds, irreds) }
1570 tcImproveOne :: Avails -> Inst -> TcM ImprovementDone
1571 tcImproveOne avails inst
1572 | not (isDict inst) = return False
1574 = do { inst_envs <- tcGetInstEnvs
1575 ; let eqns = improveOne (classInstances inst_envs)
1576 (dictPred inst, pprInstArising inst)
1577 [ (dictPred p, pprInstArising p)
1578 | p <- availsInsts avails, isDict p ]
1579 -- Avails has all the superclasses etc (good)
1580 -- It also has all the intermediates of the deduction (good)
1581 -- It does not have duplicates (good)
1582 -- NB that (?x::t1) and (?x::t2) will be held separately in avails
1583 -- so that improve will see them separate
1584 ; traceTc (text "improveOne" <+> ppr inst)
1587 unifyEqns :: [(Equation,(PredType,SDoc),(PredType,SDoc))]
1588 -> TcM ImprovementDone
1589 unifyEqns [] = return False
1591 = do { traceTc (ptext SLIT("Improve:") <+> vcat (map pprEquationDoc eqns))
1595 unify ((qtvs, pairs), what1, what2)
1596 = addErrCtxtM (mkEqnMsg what1 what2) $
1597 tcInstTyVars (varSetElems qtvs) `thenM` \ (_, _, tenv) ->
1598 mapM_ (unif_pr tenv) pairs
1599 unif_pr tenv (ty1,ty2) = unifyType (substTy tenv ty1) (substTy tenv ty2)
1601 pprEquationDoc (eqn, (p1,w1), (p2,w2)) = vcat [pprEquation eqn, nest 2 (ppr p1), nest 2 (ppr p2)]
1603 mkEqnMsg (pred1,from1) (pred2,from2) tidy_env
1604 = do { pred1' <- zonkTcPredType pred1; pred2' <- zonkTcPredType pred2
1605 ; let { pred1'' = tidyPred tidy_env pred1'; pred2'' = tidyPred tidy_env pred2' }
1606 ; let msg = vcat [ptext SLIT("When using functional dependencies to combine"),
1607 nest 2 (sep [ppr pred1'' <> comma, nest 2 from1]),
1608 nest 2 (sep [ppr pred2'' <> comma, nest 2 from2])]
1609 ; return (tidy_env, msg) }
1612 The main context-reduction function is @reduce@. Here's its game plan.
1615 reduceList :: RedEnv -> [Inst] -> Avails -> TcM Avails
1616 reduceList env@(RedEnv {red_stack = (n,stk)}) wanteds state
1617 = do { dopts <- getDOpts
1620 dumpTcRn (hang (ptext SLIT("Interesting! Context reduction stack depth") <+> int n)
1621 2 (ifPprDebug (nest 2 (pprStack stk))))
1624 ; if n >= ctxtStkDepth dopts then
1625 failWithTc (reduceDepthErr n stk)
1629 go [] state = return state
1630 go (w:ws) state = do { state' <- reduce (env {red_stack = (n+1, w:stk)}) w state
1633 -- Base case: we're done!
1634 reduce env wanted avails
1635 -- It's the same as an existing inst, or a superclass thereof
1636 | Just avail <- findAvail avails wanted
1640 = case red_try_me env wanted of {
1641 ; Stop -> try_simple (addIrred NoSCs) -- See Note [No superclasses for Stop]
1643 ; ReduceMe want_scs -> -- It should be reduced
1644 reduceInst env avails wanted `thenM` \ (avails, lookup_result) ->
1645 case lookup_result of
1646 NoInstance -> -- No such instance!
1647 -- Add it and its superclasses
1648 addIrred want_scs avails wanted
1650 GenInst [] rhs -> addWanted want_scs avails wanted rhs []
1652 GenInst wanteds' rhs -> do { avails1 <- addIrred NoSCs avails wanted
1653 ; avails2 <- reduceList env wanteds' avails1
1654 ; addWanted want_scs avails2 wanted rhs wanteds' }
1655 -- Temporarily do addIrred *before* the reduceList,
1656 -- which has the effect of adding the thing we are trying
1657 -- to prove to the database before trying to prove the things it
1658 -- needs. See note [RECURSIVE DICTIONARIES]
1659 -- NB: we must not do an addWanted before, because that adds the
1660 -- superclasses too, and thaat can lead to a spurious loop; see
1661 -- the examples in [SUPERCLASS-LOOP]
1662 -- So we do an addIrred before, and then overwrite it afterwards with addWanted
1666 -- First, see if the inst can be reduced to a constant in one step
1667 -- Works well for literals (1::Int) and constant dictionaries (d::Num Int)
1668 -- Don't bother for implication constraints, which take real work
1669 try_simple do_this_otherwise
1670 = do { res <- lookupSimpleInst wanted
1672 GenInst [] rhs -> addWanted AddSCs avails wanted rhs []
1673 other -> do_this_otherwise avails wanted }
1677 Note [SUPERCLASS-LOOP 2]
1678 ~~~~~~~~~~~~~~~~~~~~~~~~
1679 But the above isn't enough. Suppose we are *given* d1:Ord a,
1680 and want to deduce (d2:C [a]) where
1682 class Ord a => C a where
1683 instance Ord [a] => C [a] where ...
1685 Then we'll use the instance decl to deduce C [a] from Ord [a], and then add the
1686 superclasses of C [a] to avails. But we must not overwrite the binding
1687 for Ord [a] (which is obtained from Ord a) with a superclass selection or we'll just
1690 Here's another variant, immortalised in tcrun020
1691 class Monad m => C1 m
1692 class C1 m => C2 m x
1693 instance C2 Maybe Bool
1694 For the instance decl we need to build (C1 Maybe), and it's no good if
1695 we run around and add (C2 Maybe Bool) and its superclasses to the avails
1696 before we search for C1 Maybe.
1698 Here's another example
1699 class Eq b => Foo a b
1700 instance Eq a => Foo [a] a
1704 we'll first deduce that it holds (via the instance decl). We must not
1705 then overwrite the Eq t constraint with a superclass selection!
1707 At first I had a gross hack, whereby I simply did not add superclass constraints
1708 in addWanted, though I did for addGiven and addIrred. This was sub-optimal,
1709 becuase it lost legitimate superclass sharing, and it still didn't do the job:
1710 I found a very obscure program (now tcrun021) in which improvement meant the
1711 simplifier got two bites a the cherry... so something seemed to be an Stop
1712 first time, but reducible next time.
1714 Now we implement the Right Solution, which is to check for loops directly
1715 when adding superclasses. It's a bit like the occurs check in unification.
1718 Note [RECURSIVE DICTIONARIES]
1719 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1721 data D r = ZeroD | SuccD (r (D r));
1723 instance (Eq (r (D r))) => Eq (D r) where
1724 ZeroD == ZeroD = True
1725 (SuccD a) == (SuccD b) = a == b
1728 equalDC :: D [] -> D [] -> Bool;
1731 We need to prove (Eq (D [])). Here's how we go:
1735 by instance decl, holds if
1739 by instance decl of Eq, holds if
1741 where d2 = dfEqList d3
1744 But now we can "tie the knot" to give
1750 and it'll even run! The trick is to put the thing we are trying to prove
1751 (in this case Eq (D []) into the database before trying to prove its
1752 contributing clauses.
1755 %************************************************************************
1757 Reducing a single constraint
1759 %************************************************************************
1762 ---------------------------------------------
1763 reduceInst :: RedEnv -> Avails -> Inst -> TcM (Avails, LookupInstResult)
1764 reduceInst env avails (ImplicInst { tci_tyvars = tvs, tci_reft = reft, tci_loc = loc,
1765 tci_given = extra_givens, tci_wanted = wanteds })
1766 = reduceImplication env avails reft tvs extra_givens wanteds loc
1768 reduceInst env avails other_inst
1769 = do { result <- lookupSimpleInst other_inst
1770 ; return (avails, result) }
1774 ---------------------------------------------
1775 reduceImplication :: RedEnv
1777 -> Refinement -- May refine the givens; often empty
1778 -> [TcTyVar] -- Quantified type variables; all skolems
1779 -> [Inst] -- Extra givens; all rigid
1782 -> TcM (Avails, LookupInstResult)
1785 Suppose we are simplifying the constraint
1786 forall bs. extras => wanted
1787 in the context of an overall simplification problem with givens 'givens',
1788 and refinment 'reft'.
1791 * The refinement is often empty
1793 * The 'extra givens' need not mention any of the quantified type variables
1794 e.g. forall {}. Eq a => Eq [a]
1795 forall {}. C Int => D (Tree Int)
1797 This happens when you have something like
1799 T1 :: Eq a => a -> T a
1802 f x = ...(case x of { T1 v -> v==v })...
1805 -- ToDo: should we instantiate tvs? I think it's not necessary
1807 -- ToDo: what about improvement? There may be some improvement
1808 -- exposed as a result of the simplifications done by reduceList
1809 -- which are discarded if we back off.
1810 -- This is almost certainly Wrong, but we'll fix it when dealing
1811 -- better with equality constraints
1812 reduceImplication env orig_avails reft tvs extra_givens wanteds inst_loc
1813 = do { -- Add refined givens, and the extra givens
1814 (refined_red_givens, avails)
1815 <- if isEmptyRefinement reft then return (red_givens env, orig_avails)
1816 else foldlM (addRefinedGiven reft) ([], orig_avails) (red_givens env)
1817 ; avails <- foldlM addGiven avails extra_givens
1819 -- Solve the sub-problem
1820 ; let try_me inst = ReduceMe AddSCs -- Note [Freeness and implications]
1821 env' = env { red_givens = refined_red_givens ++ extra_givens
1822 , red_try_me = try_me }
1824 ; traceTc (text "reduceImplication" <+> vcat
1826 ppr (red_givens env), ppr extra_givens,
1827 ppr reft, ppr wanteds, ppr avails ])
1828 ; avails <- reduceList env' wanteds avails
1830 -- Extract the binding
1831 ; (binds, irreds) <- extractResults avails wanteds
1833 -- We always discard the extra avails we've generated;
1834 -- but we remember if we have done any (global) improvement
1835 ; let ret_avails = updateImprovement orig_avails avails
1837 ; if isEmptyLHsBinds binds then -- No progress
1838 return (ret_avails, NoInstance)
1840 { (implic_insts, bind) <- makeImplicationBind inst_loc tvs reft extra_givens irreds
1841 -- This binding is useless if the recursive simplification
1842 -- made no progress; but currently we don't try to optimise that
1843 -- case. After all, we only try hard to reduce at top level, or
1844 -- when inferring types.
1846 ; let dict_ids = map instToId extra_givens
1847 co = mkWpTyLams tvs <.> mkWpLams dict_ids <.> WpLet (binds `unionBags` bind)
1848 rhs = mkHsWrap co payload
1849 loc = instLocSpan inst_loc
1850 payload | isSingleton wanteds = HsVar (instToId (head wanteds))
1851 | otherwise = ExplicitTuple (map (L loc . HsVar . instToId) wanteds) Boxed
1853 -- If there are any irreds, we back off and return NoInstance
1854 ; return (ret_avails, GenInst implic_insts (L loc rhs))
1858 Note [Freeness and implications]
1859 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1860 It's hard to say when an implication constraint can be floated out. Consider
1861 forall {} Eq a => Foo [a]
1862 The (Foo [a]) doesn't mention any of the quantified variables, but it
1863 still might be partially satisfied by the (Eq a).
1865 There is a useful special case when it *is* easy to partition the
1866 constraints, namely when there are no 'givens'. Consider
1867 forall {a}. () => Bar b
1868 There are no 'givens', and so there is no reason to capture (Bar b).
1869 We can let it float out. But if there is even one constraint we
1870 must be much more careful:
1871 forall {a}. C a b => Bar (m b)
1872 because (C a b) might have a superclass (D b), from which we might
1873 deduce (Bar [b]) when m later gets instantiated to []. Ha!
1875 Here is an even more exotic example
1877 Now consider the constraint
1878 forall b. D Int b => C Int
1879 We can satisfy the (C Int) from the superclass of D, so we don't want
1880 to float the (C Int) out, even though it mentions no type variable in
1883 Note [Pruning the givens in an implication constraint]
1884 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1885 Suppose we are about to form the implication constraint
1886 forall tvs. Eq a => Ord b
1887 The (Eq a) cannot contribute to the (Ord b), because it has no access to
1888 the type variable 'b'. So we could filter out the (Eq a) from the givens.
1890 Doing so would be a bit tidier, but all the implication constraints get
1891 simplified away by the optimiser, so it's no great win. So I don't take
1892 advantage of that at the moment.
1894 If you do, BE CAREFUL of wobbly type variables.
1897 %************************************************************************
1899 Avails and AvailHow: the pool of evidence
1901 %************************************************************************
1905 data Avails = Avails !ImprovementDone !AvailEnv
1907 type ImprovementDone = Bool -- True <=> some unification has happened
1908 -- so some Irreds might now be reducible
1909 -- keys that are now
1911 type AvailEnv = FiniteMap Inst AvailHow
1913 = IsIrred -- Used for irreducible dictionaries,
1914 -- which are going to be lambda bound
1916 | Given TcId -- Used for dictionaries for which we have a binding
1917 -- e.g. those "given" in a signature
1919 | Rhs -- Used when there is a RHS
1920 (LHsExpr TcId) -- The RHS
1921 [Inst] -- Insts free in the RHS; we need these too
1923 instance Outputable Avails where
1926 pprAvails (Avails imp avails)
1927 = vcat [ ptext SLIT("Avails") <> (if imp then ptext SLIT("[improved]") else empty)
1928 , nest 2 (vcat [sep [ppr inst, nest 2 (equals <+> ppr avail)]
1929 | (inst,avail) <- fmToList avails ])]
1931 instance Outputable AvailHow where
1934 -------------------------
1935 pprAvail :: AvailHow -> SDoc
1936 pprAvail IsIrred = text "Irred"
1937 pprAvail (Given x) = text "Given" <+> ppr x
1938 pprAvail (Rhs rhs bs) = text "Rhs" <+> ppr rhs <+> braces (ppr bs)
1940 -------------------------
1941 extendAvailEnv :: AvailEnv -> Inst -> AvailHow -> AvailEnv
1942 extendAvailEnv env inst avail = addToFM env inst avail
1944 findAvailEnv :: AvailEnv -> Inst -> Maybe AvailHow
1945 findAvailEnv env wanted = lookupFM env wanted
1946 -- NB 1: the Ord instance of Inst compares by the class/type info
1947 -- *not* by unique. So
1948 -- d1::C Int == d2::C Int
1950 emptyAvails :: Avails
1951 emptyAvails = Avails False emptyFM
1953 findAvail :: Avails -> Inst -> Maybe AvailHow
1954 findAvail (Avails _ avails) wanted = findAvailEnv avails wanted
1956 elemAvails :: Inst -> Avails -> Bool
1957 elemAvails wanted (Avails _ avails) = wanted `elemFM` avails
1959 extendAvails :: Avails -> Inst -> AvailHow -> TcM Avails
1961 extendAvails avails@(Avails imp env) inst avail
1962 = do { imp1 <- tcImproveOne avails inst -- Do any improvement
1963 ; return (Avails (imp || imp1) (extendAvailEnv env inst avail)) }
1965 availsInsts :: Avails -> [Inst]
1966 availsInsts (Avails _ avails) = keysFM avails
1968 availsImproved (Avails imp _) = imp
1970 updateImprovement :: Avails -> Avails -> Avails
1971 -- (updateImprovement a1 a2) sets a1's improvement flag from a2
1972 updateImprovement (Avails _ avails1) (Avails imp2 _) = Avails imp2 avails1
1975 Extracting the bindings from a bunch of Avails.
1976 The bindings do *not* come back sorted in dependency order.
1977 We assume that they'll be wrapped in a big Rec, so that the
1978 dependency analyser can sort them out later
1981 extractResults :: Avails
1983 -> TcM ( TcDictBinds, -- Bindings
1984 [Inst]) -- Irreducible ones
1986 extractResults (Avails _ avails) wanteds
1987 = go avails emptyBag [] wanteds
1989 go :: AvailEnv -> TcDictBinds -> [Inst] -> [Inst]
1990 -> TcM (TcDictBinds, [Inst])
1991 go avails binds irreds []
1992 = returnM (binds, irreds)
1994 go avails binds irreds (w:ws)
1995 = case findAvailEnv avails w of
1996 Nothing -> pprTrace "Urk: extractResults" (ppr w) $
1997 go avails binds irreds ws
1999 Just IsIrred -> go (add_given avails w) binds (w:irreds) ws
2003 -> go avails binds irreds ws
2004 -- The sought Id can be one of the givens, via a superclass chain
2005 -- and then we definitely don't want to generate an x=x binding!
2008 -> go avails (addBind binds w (nlHsVar id)) irreds ws
2010 Just (Rhs rhs ws') -> go (add_given avails w) new_binds irreds (ws' ++ ws)
2012 new_binds = addBind binds w rhs
2014 add_given avails w = extendAvailEnv avails w (Given (instToId w))
2016 addBind binds inst rhs = binds `unionBags` unitBag (L (instSpan inst)
2017 (VarBind (instToId inst) rhs))
2021 Note [No superclasses for Stop]
2022 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2023 When we decide not to reduce an Inst -- the 'WhatToDo' --- we still
2024 add it to avails, so that any other equal Insts will be commoned up
2025 right here. However, we do *not* add superclasses. If we have
2028 but a is not bound here, then we *don't* want to derive dn from df
2029 here lest we lose sharing.
2032 addWanted :: WantSCs -> Avails -> Inst -> LHsExpr TcId -> [Inst] -> TcM Avails
2033 addWanted want_scs avails wanted rhs_expr wanteds
2034 = addAvailAndSCs want_scs avails wanted avail
2036 avail = Rhs rhs_expr wanteds
2038 addGiven :: Avails -> Inst -> TcM Avails
2039 addGiven avails given = addAvailAndSCs AddSCs avails given (Given (instToId given))
2040 -- Always add superclasses for 'givens'
2042 -- No ASSERT( not (given `elemAvails` avails) ) because in an instance
2043 -- decl for Ord t we can add both Ord t and Eq t as 'givens',
2044 -- so the assert isn't true
2046 addRefinedGiven :: Refinement -> ([Inst], Avails) -> Inst -> TcM ([Inst], Avails)
2047 addRefinedGiven reft (refined_givens, avails) given
2048 | isDict given -- We sometimes have 'given' methods, but they
2049 -- are always optional, so we can drop them
2050 , let pred = dictPred given
2051 , isRefineablePred pred -- See Note [ImplicInst rigidity]
2052 , Just (co, pred) <- refinePred reft pred
2053 = do { new_given <- newDictBndr (instLoc given) pred
2054 ; let rhs = L (instSpan given) $
2055 HsWrap (WpCo co) (HsVar (instToId given))
2056 ; avails <- addAvailAndSCs AddSCs avails new_given (Rhs rhs [given])
2057 ; return (new_given:refined_givens, avails) }
2058 -- ToDo: the superclasses of the original given all exist in Avails
2059 -- so we could really just cast them, but it's more awkward to do,
2060 -- and hopefully the optimiser will spot the duplicated work
2062 = return (refined_givens, avails)
2065 Note [ImplicInst rigidity]
2066 ~~~~~~~~~~~~~~~~~~~~~~~~~~
2068 C :: forall ab. (Eq a, Ord b) => b -> T a
2070 ...(case x of C v -> <body>)...
2072 From the case (where x::T ty) we'll get an implication constraint
2073 forall b. (Eq ty, Ord b) => <body-constraints>
2074 Now suppose <body-constraints> itself has an implication constraint
2076 forall c. <reft> => <payload>
2077 Then, we can certainly apply the refinement <reft> to the Ord b, becuase it is
2078 existential, but we probably should not apply it to the (Eq ty) because it may
2079 be wobbly. Hence the isRigidInst
2081 @Insts@ are ordered by their class/type info, rather than by their
2082 unique. This allows the context-reduction mechanism to use standard finite
2083 maps to do their stuff. It's horrible that this code is here, rather
2084 than with the Avails handling stuff in TcSimplify
2087 addIrred :: WantSCs -> Avails -> Inst -> TcM Avails
2088 addIrred want_scs avails irred = ASSERT2( not (irred `elemAvails` avails), ppr irred $$ ppr avails )
2089 addAvailAndSCs want_scs avails irred IsIrred
2091 addAvailAndSCs :: WantSCs -> Avails -> Inst -> AvailHow -> TcM Avails
2092 addAvailAndSCs want_scs avails inst avail
2093 | not (isClassDict inst) = extendAvails avails inst avail
2094 | NoSCs <- want_scs = extendAvails avails inst avail
2095 | otherwise = do { traceTc (text "addAvailAndSCs" <+> vcat [ppr inst, ppr deps])
2096 ; avails' <- extendAvails avails inst avail
2097 ; addSCs is_loop avails' inst }
2099 is_loop pred = any (`tcEqType` mkPredTy pred) dep_tys
2100 -- Note: this compares by *type*, not by Unique
2101 deps = findAllDeps (unitVarSet (instToId inst)) avail
2102 dep_tys = map idType (varSetElems deps)
2104 findAllDeps :: IdSet -> AvailHow -> IdSet
2105 -- Find all the Insts that this one depends on
2106 -- See Note [SUPERCLASS-LOOP 2]
2107 -- Watch out, though. Since the avails may contain loops
2108 -- (see Note [RECURSIVE DICTIONARIES]), so we need to track the ones we've seen so far
2109 findAllDeps so_far (Rhs _ kids) = foldl find_all so_far kids
2110 findAllDeps so_far other = so_far
2112 find_all :: IdSet -> Inst -> IdSet
2114 | kid_id `elemVarSet` so_far = so_far
2115 | Just avail <- findAvail avails kid = findAllDeps so_far' avail
2116 | otherwise = so_far'
2118 so_far' = extendVarSet so_far kid_id -- Add the new kid to so_far
2119 kid_id = instToId kid
2121 addSCs :: (TcPredType -> Bool) -> Avails -> Inst -> TcM Avails
2122 -- Add all the superclasses of the Inst to Avails
2123 -- The first param says "dont do this because the original thing
2124 -- depends on this one, so you'd build a loop"
2125 -- Invariant: the Inst is already in Avails.
2127 addSCs is_loop avails dict
2128 = ASSERT( isDict dict )
2129 do { sc_dicts <- newDictBndrs (instLoc dict) sc_theta'
2130 ; foldlM add_sc avails (zipEqual "add_scs" sc_dicts sc_sels) }
2132 (clas, tys) = getDictClassTys dict
2133 (tyvars, sc_theta, sc_sels, _) = classBigSig clas
2134 sc_theta' = substTheta (zipTopTvSubst tyvars tys) sc_theta
2136 add_sc avails (sc_dict, sc_sel)
2137 | is_loop (dictPred sc_dict) = return avails -- See Note [SUPERCLASS-LOOP 2]
2138 | is_given sc_dict = return avails
2139 | otherwise = do { avails' <- extendAvails avails sc_dict (Rhs sc_sel_rhs [dict])
2140 ; addSCs is_loop avails' sc_dict }
2142 sc_sel_rhs = L (instSpan dict) (HsWrap co_fn (HsVar sc_sel))
2143 co_fn = WpApp (instToId dict) <.> mkWpTyApps tys
2145 is_given :: Inst -> Bool
2146 is_given sc_dict = case findAvail avails sc_dict of
2147 Just (Given _) -> True -- Given is cheaper than superclass selection
2151 %************************************************************************
2153 \section{tcSimplifyTop: defaulting}
2155 %************************************************************************
2158 @tcSimplifyTop@ is called once per module to simplify all the constant
2159 and ambiguous Insts.
2161 We need to be careful of one case. Suppose we have
2163 instance Num a => Num (Foo a b) where ...
2165 and @tcSimplifyTop@ is given a constraint (Num (Foo x y)). Then it'll simplify
2166 to (Num x), and default x to Int. But what about y??
2168 It's OK: the final zonking stage should zap y to (), which is fine.
2172 tcSimplifyTop, tcSimplifyInteractive :: [Inst] -> TcM TcDictBinds
2173 tcSimplifyTop wanteds
2174 = tc_simplify_top doc False wanteds
2176 doc = text "tcSimplifyTop"
2178 tcSimplifyInteractive wanteds
2179 = tc_simplify_top doc True wanteds
2181 doc = text "tcSimplifyInteractive"
2183 -- The TcLclEnv should be valid here, solely to improve
2184 -- error message generation for the monomorphism restriction
2185 tc_simplify_top doc interactive wanteds
2186 = do { wanteds <- mapM zonkInst wanteds
2187 ; mapM_ zonkTopTyVar (varSetElems (tyVarsOfInsts wanteds))
2189 ; (irreds1, binds1) <- topCheckLoop doc wanteds
2191 ; if null irreds1 then
2194 -- OK, so there are some errors
2195 { -- Use the defaulting rules to do extra unification
2196 -- NB: irreds are already zonked
2197 ; extended_default <- if interactive then return True
2198 else doptM Opt_ExtendedDefaultRules
2199 ; disambiguate extended_default irreds1 -- Does unification
2200 ; (irreds2, binds2) <- topCheckLoop doc irreds1
2202 -- Deal with implicit parameter
2203 ; let (bad_ips, non_ips) = partition isIPDict irreds2
2204 (ambigs, others) = partition isTyVarDict non_ips
2206 ; topIPErrs bad_ips -- Can arise from f :: Int -> Int
2208 ; addNoInstanceErrs others
2209 ; addTopAmbigErrs ambigs
2211 ; return (binds1 `unionBags` binds2) }}
2214 If a dictionary constrains a type variable which is
2215 * not mentioned in the environment
2216 * and not mentioned in the type of the expression
2217 then it is ambiguous. No further information will arise to instantiate
2218 the type variable; nor will it be generalised and turned into an extra
2219 parameter to a function.
2221 It is an error for this to occur, except that Haskell provided for
2222 certain rules to be applied in the special case of numeric types.
2224 * at least one of its classes is a numeric class, and
2225 * all of its classes are numeric or standard
2226 then the type variable can be defaulted to the first type in the
2227 default-type list which is an instance of all the offending classes.
2229 So here is the function which does the work. It takes the ambiguous
2230 dictionaries and either resolves them (producing bindings) or
2231 complains. It works by splitting the dictionary list by type
2232 variable, and using @disambigOne@ to do the real business.
2234 @disambigOne@ assumes that its arguments dictionaries constrain all
2235 the same type variable.
2237 ADR Comment 20/6/94: I've changed the @CReturnable@ case to default to
2238 @()@ instead of @Int@. I reckon this is the Right Thing to do since
2239 the most common use of defaulting is code like:
2241 _ccall_ foo `seqPrimIO` bar
2243 Since we're not using the result of @foo@, the result if (presumably)
2247 disambiguate :: Bool -> [Inst] -> TcM ()
2248 -- Just does unification to fix the default types
2249 -- The Insts are assumed to be pre-zonked
2250 disambiguate extended_defaulting insts
2251 | null defaultable_groups
2252 = do { traceTc (text "disambigutate" <+> vcat [ppr unaries, ppr bad_tvs, ppr defaultable_groups])
2255 = do { -- Figure out what default types to use
2256 mb_defaults <- getDefaultTys
2257 ; default_tys <- case mb_defaults of
2258 Just tys -> return tys
2259 Nothing -> -- No use-supplied default;
2260 -- use [Integer, Double]
2261 do { integer_ty <- tcMetaTy integerTyConName
2262 ; checkWiredInTyCon doubleTyCon
2263 ; string_ty <- tcMetaTy stringTyConName
2264 ; ovl_str <- doptM Opt_OverloadedStrings
2265 ; if ovl_str -- Add String if -foverloaded-strings
2266 then return [integer_ty,doubleTy,string_ty]
2267 else return [integer_ty,doubleTy] }
2269 ; traceTc (text "disambigutate" <+> vcat [ppr unaries, ppr bad_tvs, ppr defaultable_groups])
2270 ; mapM_ (disambigGroup default_tys) defaultable_groups }
2272 unaries :: [(Inst,Class, TcTyVar)] -- (C tv) constraints
2273 bad_tvs :: TcTyVarSet -- Tyvars mentioned by *other* constraints
2274 (unaries, bad_tvs) = getDefaultableDicts insts
2276 -- Group by type variable
2277 defaultable_groups :: [[(Inst,Class,TcTyVar)]]
2278 defaultable_groups = filter defaultable_group (equivClasses cmp_tv unaries)
2279 cmp_tv (_,_,tv1) (_,_,tv2) = tv1 `compare` tv2
2281 defaultable_group :: [(Inst,Class,TcTyVar)] -> Bool
2282 defaultable_group ds@((_,_,tv):_)
2283 = not (isImmutableTyVar tv) -- Note [Avoiding spurious errors]
2284 && not (tv `elemVarSet` bad_tvs)
2285 && defaultable_classes [c | (_,c,_) <- ds]
2286 defaultable_group [] = panic "defaultable_group"
2288 defaultable_classes clss
2289 | extended_defaulting = any isInteractiveClass clss
2290 | otherwise = all isStandardClass clss && (any isNumericClass clss || any ((== isStringClassKey) . classKey) clss)
2292 -- In interactive mode, or with -fextended-default-rules,
2293 -- we default Show a to Show () to avoid graututious errors on "show []"
2294 isInteractiveClass cls
2295 = isNumericClass cls
2296 || (classKey cls `elem` [showClassKey, eqClassKey, ordClassKey, isStringClassKey])
2299 disambigGroup :: [Type] -- The default types
2300 -> [(Inst,Class,TcTyVar)] -- All standard classes of form (C a)
2301 -> TcM () -- Just does unification, to fix the default types
2303 disambigGroup default_tys dicts
2304 = try_default default_tys
2306 (_,_,tyvar) = head dicts -- Should be non-empty
2307 classes = [c | (_,c,_) <- dicts]
2309 try_default [] = return ()
2310 try_default (default_ty : default_tys)
2311 = tryTcLIE_ (try_default default_tys) $
2312 do { tcSimplifyDefault [mkClassPred clas [default_ty] | clas <- classes]
2313 -- This may fail; then the tryTcLIE_ kicks in
2314 -- Failure here is caused by there being no type in the
2315 -- default list which can satisfy all the ambiguous classes.
2316 -- For example, if Real a is reqd, but the only type in the
2317 -- default list is Int.
2319 -- After this we can't fail
2320 ; warnDefault dicts default_ty
2321 ; unifyType default_ty (mkTyVarTy tyvar) }
2324 Note [Avoiding spurious errors]
2325 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2326 When doing the unification for defaulting, we check for skolem
2327 type variables, and simply don't default them. For example:
2328 f = (*) -- Monomorphic
2329 g :: Num a => a -> a
2331 Here, we get a complaint when checking the type signature for g,
2332 that g isn't polymorphic enough; but then we get another one when
2333 dealing with the (Num a) context arising from f's definition;
2334 we try to unify a with Int (to default it), but find that it's
2335 already been unified with the rigid variable from g's type sig
2338 %************************************************************************
2340 \subsection[simple]{@Simple@ versions}
2342 %************************************************************************
2344 Much simpler versions when there are no bindings to make!
2346 @tcSimplifyThetas@ simplifies class-type constraints formed by
2347 @deriving@ declarations and when specialising instances. We are
2348 only interested in the simplified bunch of class/type constraints.
2350 It simplifies to constraints of the form (C a b c) where
2351 a,b,c are type variables. This is required for the context of
2352 instance declarations.
2355 tcSimplifyDeriv :: InstOrigin
2357 -> ThetaType -- Wanted
2358 -> TcM ThetaType -- Needed
2359 -- Given instance (wanted) => C inst_ty
2360 -- Simplify 'wanted' as much as possible
2361 -- The inst_ty is needed only for the termination check
2363 tcSimplifyDeriv orig tyvars theta
2364 = do { (tvs, _, tenv) <- tcInstTyVars tyvars
2365 -- The main loop may do unification, and that may crash if
2366 -- it doesn't see a TcTyVar, so we have to instantiate. Sigh
2367 -- ToDo: what if two of them do get unified?
2368 ; wanteds <- newDictBndrsO orig (substTheta tenv theta)
2369 ; (irreds, _) <- topCheckLoop doc wanteds
2371 -- Insist that the context of a derived instance declaration
2372 -- consists of constraints of form (C a b), where a,b are
2374 -- NB: the caller will further check the tv_dicts for
2375 -- legal instance-declaration form
2376 ; let (tv_dicts, non_tv_dicts) = partition isTyVarDict irreds
2377 ; addNoInstanceErrs non_tv_dicts
2379 ; let rev_env = zipTopTvSubst tvs (mkTyVarTys tyvars)
2380 simpl_theta = substTheta rev_env (map dictPred tv_dicts)
2381 -- This reverse-mapping is a pain, but the result
2382 -- should mention the original TyVars not TcTyVars
2384 ; return simpl_theta }
2386 doc = ptext SLIT("deriving classes for a data type")
2389 Note [Deriving context]
2390 ~~~~~~~~~~~~~~~~~~~~~~~
2391 With -fglasgow-exts, we allow things like (C Int a) in the simplified
2392 context for a derived instance declaration, because at a use of this
2393 instance, we might know that a=Bool, and have an instance for (C Int
2396 We nevertheless insist that each predicate meets the termination
2397 conditions. If not, the deriving mechanism generates larger and larger
2398 constraints. Example:
2400 data Seq a = Cons a (Seq (Succ a)) | Nil deriving Show
2402 Note the lack of a Show instance for Succ. First we'll generate
2403 instance (Show (Succ a), Show a) => Show (Seq a)
2405 instance (Show (Succ (Succ a)), Show (Succ a), Show a) => Show (Seq a)
2406 and so on. Instead we want to complain of no instance for (Show (Succ a)).
2410 @tcSimplifyDefault@ just checks class-type constraints, essentially;
2411 used with \tr{default} declarations. We are only interested in
2412 whether it worked or not.
2415 tcSimplifyDefault :: ThetaType -- Wanted; has no type variables in it
2418 tcSimplifyDefault theta
2419 = newDictBndrsO DefaultOrigin theta `thenM` \ wanteds ->
2420 topCheckLoop doc wanteds `thenM` \ (irreds, _) ->
2421 addNoInstanceErrs irreds `thenM_`
2427 doc = ptext SLIT("default declaration")
2431 %************************************************************************
2433 \section{Errors and contexts}
2435 %************************************************************************
2437 ToDo: for these error messages, should we note the location as coming
2438 from the insts, or just whatever seems to be around in the monad just
2442 groupErrs :: ([Inst] -> TcM ()) -- Deal with one group
2443 -> [Inst] -- The offending Insts
2445 -- Group together insts with the same origin
2446 -- We want to report them together in error messages
2448 groupErrs report_err []
2450 groupErrs report_err (inst:insts)
2451 = do_one (inst:friends) `thenM_`
2452 groupErrs report_err others
2455 -- (It may seem a bit crude to compare the error messages,
2456 -- but it makes sure that we combine just what the user sees,
2457 -- and it avoids need equality on InstLocs.)
2458 (friends, others) = partition is_friend insts
2459 loc_msg = showSDoc (pprInstLoc (instLoc inst))
2460 is_friend friend = showSDoc (pprInstLoc (instLoc friend)) == loc_msg
2461 do_one insts = addInstCtxt (instLoc (head insts)) (report_err insts)
2462 -- Add location and context information derived from the Insts
2464 -- Add the "arising from..." part to a message about bunch of dicts
2465 addInstLoc :: [Inst] -> Message -> Message
2466 addInstLoc insts msg = msg $$ nest 2 (pprInstArising (head insts))
2468 addTopIPErrs :: [Name] -> [Inst] -> TcM ()
2469 addTopIPErrs bndrs []
2471 addTopIPErrs bndrs ips
2472 = addErrTcM (tidy_env, mk_msg tidy_ips)
2474 (tidy_env, tidy_ips) = tidyInsts ips
2475 mk_msg ips = vcat [sep [ptext SLIT("Implicit parameters escape from"),
2476 nest 2 (ptext SLIT("the monomorphic top-level binding")
2477 <> plural bndrs <+> ptext SLIT("of")
2478 <+> pprBinders bndrs <> colon)],
2479 nest 2 (vcat (map ppr_ip ips)),
2481 ppr_ip ip = pprPred (dictPred ip) <+> pprInstArising ip
2483 topIPErrs :: [Inst] -> TcM ()
2485 = groupErrs report tidy_dicts
2487 (tidy_env, tidy_dicts) = tidyInsts dicts
2488 report dicts = addErrTcM (tidy_env, mk_msg dicts)
2489 mk_msg dicts = addInstLoc dicts (ptext SLIT("Unbound implicit parameter") <>
2490 plural tidy_dicts <+> pprDictsTheta tidy_dicts)
2492 addNoInstanceErrs :: [Inst] -- Wanted (can include implications)
2494 addNoInstanceErrs insts
2495 = do { let (tidy_env, tidy_insts) = tidyInsts insts
2496 ; reportNoInstances tidy_env Nothing tidy_insts }
2500 -> Maybe (InstLoc, [Inst]) -- Context
2501 -- Nothing => top level
2502 -- Just (d,g) => d describes the construct
2504 -> [Inst] -- What is wanted (can include implications)
2507 reportNoInstances tidy_env mb_what insts
2508 = groupErrs (report_no_instances tidy_env mb_what) insts
2510 report_no_instances tidy_env mb_what insts
2511 = do { inst_envs <- tcGetInstEnvs
2512 ; let (implics, insts1) = partition isImplicInst insts
2513 (insts2, overlaps) = partitionWith (check_overlap inst_envs) insts1
2514 ; traceTc (text "reportNoInstnces" <+> vcat
2515 [ppr implics, ppr insts1, ppr insts2])
2516 ; mapM_ complain_implic implics
2517 ; mapM_ (\doc -> addErrTcM (tidy_env, doc)) overlaps
2518 ; groupErrs complain_no_inst insts2 }
2520 complain_no_inst insts = addErrTcM (tidy_env, mk_no_inst_err insts)
2522 complain_implic inst -- Recurse!
2523 = reportNoInstances tidy_env
2524 (Just (tci_loc inst, tci_given inst))
2527 check_overlap :: (InstEnv,InstEnv) -> Inst -> Either Inst SDoc
2528 -- Right msg => overlap message
2529 -- Left inst => no instance
2530 check_overlap inst_envs wanted
2531 | not (isClassDict wanted) = Left wanted
2533 = case lookupInstEnv inst_envs clas tys of
2534 -- The case of exactly one match and no unifiers means
2535 -- a successful lookup. That can't happen here, becuase
2536 -- dicts only end up here if they didn't match in Inst.lookupInst
2538 ([m],[]) -> pprPanic "reportNoInstance" (ppr wanted)
2540 ([], _) -> Left wanted -- No match
2541 res -> Right (mk_overlap_msg wanted res)
2543 (clas,tys) = getDictClassTys wanted
2545 mk_overlap_msg dict (matches, unifiers)
2546 = vcat [ addInstLoc [dict] ((ptext SLIT("Overlapping instances for")
2547 <+> pprPred (dictPred dict))),
2548 sep [ptext SLIT("Matching instances") <> colon,
2549 nest 2 (vcat [pprInstances ispecs, pprInstances unifiers])],
2550 ASSERT( not (null matches) )
2551 if not (isSingleton matches)
2552 then -- Two or more matches
2554 else -- One match, plus some unifiers
2555 ASSERT( not (null unifiers) )
2556 parens (vcat [ptext SLIT("The choice depends on the instantiation of") <+>
2557 quotes (pprWithCommas ppr (varSetElems (tyVarsOfInst dict))),
2558 ptext SLIT("Use -fallow-incoherent-instances to use the first choice above")])]
2560 ispecs = [ispec | (_, ispec) <- matches]
2562 mk_no_inst_err insts
2563 | null insts = empty
2565 | Just (loc, givens) <- mb_what, -- Nested (type signatures, instance decls)
2566 not (isEmptyVarSet (tyVarsOfInsts insts))
2567 = vcat [ addInstLoc insts $
2568 sep [ ptext SLIT("Could not deduce") <+> pprDictsTheta insts
2569 , nest 2 $ ptext SLIT("from the context") <+> pprDictsTheta givens]
2570 , show_fixes (fix1 loc : fixes2) ]
2572 | otherwise -- Top level
2573 = vcat [ addInstLoc insts $
2574 ptext SLIT("No instance") <> plural insts
2575 <+> ptext SLIT("for") <+> pprDictsTheta insts
2576 , show_fixes fixes2 ]
2579 fix1 loc = sep [ ptext SLIT("add") <+> pprDictsTheta insts
2580 <+> ptext SLIT("to the context of"),
2581 nest 2 (ppr (instLocOrigin loc)) ]
2582 -- I'm not sure it helps to add the location
2583 -- nest 2 (ptext SLIT("at") <+> ppr (instLocSpan loc)) ]
2585 fixes2 | null instance_dicts = []
2586 | otherwise = [sep [ptext SLIT("add an instance declaration for"),
2587 pprDictsTheta instance_dicts]]
2588 instance_dicts = [d | d <- insts, isClassDict d, not (isTyVarDict d)]
2589 -- Insts for which it is worth suggesting an adding an instance declaration
2590 -- Exclude implicit parameters, and tyvar dicts
2592 show_fixes :: [SDoc] -> SDoc
2593 show_fixes [] = empty
2594 show_fixes (f:fs) = sep [ptext SLIT("Possible fix:"),
2595 nest 2 (vcat (f : map (ptext SLIT("or") <+>) fs))]
2597 addTopAmbigErrs dicts
2598 -- Divide into groups that share a common set of ambiguous tyvars
2599 = ifErrsM (return ()) $ -- Only report ambiguity if no other errors happened
2600 -- See Note [Avoiding spurious errors]
2601 mapM_ report (equivClasses cmp [(d, tvs_of d) | d <- tidy_dicts])
2603 (tidy_env, tidy_dicts) = tidyInsts dicts
2605 tvs_of :: Inst -> [TcTyVar]
2606 tvs_of d = varSetElems (tyVarsOfInst d)
2607 cmp (_,tvs1) (_,tvs2) = tvs1 `compare` tvs2
2609 report :: [(Inst,[TcTyVar])] -> TcM ()
2610 report pairs@((inst,tvs) : _) -- The pairs share a common set of ambiguous tyvars
2611 = mkMonomorphismMsg tidy_env tvs `thenM` \ (tidy_env, mono_msg) ->
2612 setSrcSpan (instSpan inst) $
2613 -- the location of the first one will do for the err message
2614 addErrTcM (tidy_env, msg $$ mono_msg)
2616 dicts = map fst pairs
2617 msg = sep [text "Ambiguous type variable" <> plural tvs <+>
2618 pprQuotedList tvs <+> in_msg,
2619 nest 2 (pprDictsInFull dicts)]
2620 in_msg = text "in the constraint" <> plural dicts <> colon
2621 report [] = panic "addTopAmbigErrs"
2624 mkMonomorphismMsg :: TidyEnv -> [TcTyVar] -> TcM (TidyEnv, Message)
2625 -- There's an error with these Insts; if they have free type variables
2626 -- it's probably caused by the monomorphism restriction.
2627 -- Try to identify the offending variable
2628 -- ASSUMPTION: the Insts are fully zonked
2629 mkMonomorphismMsg tidy_env inst_tvs
2630 = findGlobals (mkVarSet inst_tvs) tidy_env `thenM` \ (tidy_env, docs) ->
2631 returnM (tidy_env, mk_msg docs)
2633 mk_msg [] = ptext SLIT("Probable fix: add a type signature that fixes these type variable(s)")
2634 -- This happens in things like
2635 -- f x = show (read "foo")
2636 -- where monomorphism doesn't play any role
2637 mk_msg docs = vcat [ptext SLIT("Possible cause: the monomorphism restriction applied to the following:"),
2641 monomorphism_fix :: SDoc
2642 monomorphism_fix = ptext SLIT("Probable fix:") <+>
2643 (ptext SLIT("give these definition(s) an explicit type signature")
2644 $$ ptext SLIT("or use -fno-monomorphism-restriction"))
2646 warnDefault ups default_ty
2647 = doptM Opt_WarnTypeDefaults `thenM` \ warn_flag ->
2648 addInstCtxt (instLoc (head (dicts))) (warnTc warn_flag warn_msg)
2650 dicts = [d | (d,_,_) <- ups]
2653 (_, tidy_dicts) = tidyInsts dicts
2654 warn_msg = vcat [ptext SLIT("Defaulting the following constraint(s) to type") <+>
2655 quotes (ppr default_ty),
2656 pprDictsInFull tidy_dicts]
2658 reduceDepthErr n stack
2659 = vcat [ptext SLIT("Context reduction stack overflow; size =") <+> int n,
2660 ptext SLIT("Use -fcontext-stack=N to increase stack size to N"),
2661 nest 4 (pprStack stack)]
2663 pprStack stack = vcat (map pprInstInFull stack)