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,
23 #include "HsVersions.h"
25 import {-# SOURCE #-} TcUnify( unifyType )
29 import TcHsSyn ( hsLPatType )
37 import DsUtils -- Big-tuple functions
66 %************************************************************************
70 %************************************************************************
72 --------------------------------------
73 Notes on functional dependencies (a bug)
74 --------------------------------------
81 instance D a b => C a b -- Undecidable
82 -- (Not sure if it's crucial to this eg)
83 f :: C a b => a -> Bool
86 g :: C a b => a -> Bool
89 Here f typechecks, but g does not!! Reason: before doing improvement,
90 we reduce the (C a b1) constraint from the call of f to (D a b1).
92 Here is a more complicated example:
95 > class Foo a b | a->b
97 > class Bar a b | a->b
101 > instance Bar Obj Obj
103 > instance (Bar a b) => Foo a b
105 > foo:: (Foo a b) => a -> String
108 > runFoo:: (forall a b. (Foo a b) => a -> w) -> w
114 Could not deduce (Bar a b) from the context (Foo a b)
115 arising from use of `foo' at <interactive>:1
117 Add (Bar a b) to the expected type of an expression
118 In the first argument of `runFoo', namely `foo'
119 In the definition of `it': it = runFoo foo
121 Why all of the sudden does GHC need the constraint Bar a b? The
122 function foo didn't ask for that...
125 The trouble is that to type (runFoo foo), GHC has to solve the problem:
127 Given constraint Foo a b
128 Solve constraint Foo a b'
130 Notice that b and b' aren't the same. To solve this, just do
131 improvement and then they are the same. But GHC currently does
136 That is usually fine, but it isn't here, because it sees that Foo a b is
137 not the same as Foo a b', and so instead applies the instance decl for
138 instance Bar a b => Foo a b. And that's where the Bar constraint comes
141 The Right Thing is to improve whenever the constraint set changes at
142 all. Not hard in principle, but it'll take a bit of fiddling to do.
144 Note [Choosing which variables to quantify]
145 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
146 Suppose we are about to do a generalisation step. We have in our hand
149 T the type of the RHS
150 C the constraints from that RHS
152 The game is to figure out
154 Q the set of type variables over which to quantify
155 Ct the constraints we will *not* quantify over
156 Cq the constraints we will quantify over
158 So we're going to infer the type
162 and float the constraints Ct further outwards.
164 Here are the things that *must* be true:
166 (A) Q intersect fv(G) = EMPTY limits how big Q can be
167 (B) Q superset fv(Cq union T) \ oclose(fv(G),C) limits how small Q can be
169 (A) says we can't quantify over a variable that's free in the environment.
170 (B) says we must quantify over all the truly free variables in T, else
171 we won't get a sufficiently general type.
173 We do not *need* to quantify over any variable that is fixed by the
174 free vars of the environment G.
176 BETWEEN THESE TWO BOUNDS, ANY Q WILL DO!
178 Example: class H x y | x->y where ...
180 fv(G) = {a} C = {H a b, H c d}
183 (A) Q intersect {a} is empty
184 (B) Q superset {a,b,c,d} \ oclose({a}, C) = {a,b,c,d} \ {a,b} = {c,d}
186 So Q can be {c,d}, {b,c,d}
188 In particular, it's perfectly OK to quantify over more type variables
189 than strictly necessary; there is no need to quantify over 'b', since
190 it is determined by 'a' which is free in the envt, but it's perfectly
191 OK to do so. However we must not quantify over 'a' itself.
193 Other things being equal, however, we'd like to quantify over as few
194 variables as possible: smaller types, fewer type applications, more
195 constraints can get into Ct instead of Cq. Here's a good way to
198 Q = grow( fv(T), C ) \ oclose( fv(G), C )
200 That is, quantify over all variable that that MIGHT be fixed by the
201 call site (which influences T), but which aren't DEFINITELY fixed by
202 G. This choice definitely quantifies over enough type variables,
203 albeit perhaps too many.
205 Why grow( fv(T), C ) rather than fv(T)? Consider
207 class H x y | x->y where ...
212 If we used fv(T) = {c} we'd get the type
214 forall c. H c d => c -> b
216 And then if the fn was called at several different c's, each of
217 which fixed d differently, we'd get a unification error, because
218 d isn't quantified. Solution: quantify d. So we must quantify
219 everything that might be influenced by c.
221 Why not oclose( fv(T), C )? Because we might not be able to see
222 all the functional dependencies yet:
224 class H x y | x->y where ...
225 instance H x y => Eq (T x y) where ...
230 Now oclose(fv(T),C) = {c}, because the functional dependency isn't
231 apparent yet, and that's wrong. We must really quantify over d too.
233 There really isn't any point in quantifying over any more than
234 grow( fv(T), C ), because the call sites can't possibly influence
235 any other type variables.
239 -------------------------------------
241 -------------------------------------
243 It's very hard to be certain when a type is ambiguous. Consider
247 instance H x y => K (x,y)
249 Is this type ambiguous?
250 forall a b. (K (a,b), Eq b) => a -> a
252 Looks like it! But if we simplify (K (a,b)) we get (H a b) and
253 now we see that a fixes b. So we can't tell about ambiguity for sure
254 without doing a full simplification. And even that isn't possible if
255 the context has some free vars that may get unified. Urgle!
257 Here's another example: is this ambiguous?
258 forall a b. Eq (T b) => a -> a
259 Not if there's an insance decl (with no context)
260 instance Eq (T b) where ...
262 You may say of this example that we should use the instance decl right
263 away, but you can't always do that:
265 class J a b where ...
266 instance J Int b where ...
268 f :: forall a b. J a b => a -> a
270 (Notice: no functional dependency in J's class decl.)
271 Here f's type is perfectly fine, provided f is only called at Int.
272 It's premature to complain when meeting f's signature, or even
273 when inferring a type for f.
277 However, we don't *need* to report ambiguity right away. It'll always
278 show up at the call site.... and eventually at main, which needs special
279 treatment. Nevertheless, reporting ambiguity promptly is an excellent thing.
281 So here's the plan. We WARN about probable ambiguity if
283 fv(Cq) is not a subset of oclose(fv(T) union fv(G), C)
285 (all tested before quantification).
286 That is, all the type variables in Cq must be fixed by the the variables
287 in the environment, or by the variables in the type.
289 Notice that we union before calling oclose. Here's an example:
291 class J a b c | a b -> c
295 forall b c. (J a b c) => b -> b
297 Only if we union {a} from G with {b} from T before using oclose,
298 do we see that c is fixed.
300 It's a bit vague exactly which C we should use for this oclose call. If we
301 don't fix enough variables we might complain when we shouldn't (see
302 the above nasty example). Nothing will be perfect. That's why we can
303 only issue a warning.
306 Can we ever be *certain* about ambiguity? Yes: if there's a constraint
308 c in C such that fv(c) intersect (fv(G) union fv(T)) = EMPTY
310 then c is a "bubble"; there's no way it can ever improve, and it's
311 certainly ambiguous. UNLESS it is a constant (sigh). And what about
316 instance H x y => K (x,y)
318 Is this type ambiguous?
319 forall a b. (K (a,b), Eq b) => a -> a
321 Urk. The (Eq b) looks "definitely ambiguous" but it isn't. What we are after
322 is a "bubble" that's a set of constraints
324 Cq = Ca union Cq' st fv(Ca) intersect (fv(Cq') union fv(T) union fv(G)) = EMPTY
326 Hence another idea. To decide Q start with fv(T) and grow it
327 by transitive closure in Cq (no functional dependencies involved).
328 Now partition Cq using Q, leaving the definitely-ambiguous and probably-ok.
329 The definitely-ambiguous can then float out, and get smashed at top level
330 (which squashes out the constants, like Eq (T a) above)
333 --------------------------------------
334 Notes on principal types
335 --------------------------------------
340 f x = let g y = op (y::Int) in True
342 Here the principal type of f is (forall a. a->a)
343 but we'll produce the non-principal type
344 f :: forall a. C Int => a -> a
347 --------------------------------------
348 The need for forall's in constraints
349 --------------------------------------
351 [Exchange on Haskell Cafe 5/6 Dec 2000]
353 class C t where op :: t -> Bool
354 instance C [t] where op x = True
356 p y = (let f :: c -> Bool; f x = op (y >> return x) in f, y ++ [])
357 q y = (y ++ [], let f :: c -> Bool; f x = op (y >> return x) in f)
359 The definitions of p and q differ only in the order of the components in
360 the pair on their right-hand sides. And yet:
362 ghc and "Typing Haskell in Haskell" reject p, but accept q;
363 Hugs rejects q, but accepts p;
364 hbc rejects both p and q;
365 nhc98 ... (Malcolm, can you fill in the blank for us!).
367 The type signature for f forces context reduction to take place, and
368 the results of this depend on whether or not the type of y is known,
369 which in turn depends on which component of the pair the type checker
372 Solution: if y::m a, float out the constraints
373 Monad m, forall c. C (m c)
374 When m is later unified with [], we can solve both constraints.
377 --------------------------------------
378 Notes on implicit parameters
379 --------------------------------------
381 Note [Inheriting implicit parameters]
382 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 where f is *not* a top-level binding.
388 From the RHS of f we'll get the constraint (?y::Int).
389 There are two types we might infer for f:
393 (so we get ?y from the context of f's definition), or
395 f :: (?y::Int) => Int -> Int
397 At first you might think the first was better, becuase then
398 ?y behaves like a free variable of the definition, rather than
399 having to be passed at each call site. But of course, the WHOLE
400 IDEA is that ?y should be passed at each call site (that's what
401 dynamic binding means) so we'd better infer the second.
403 BOTTOM LINE: when *inferring types* you *must* quantify
404 over implicit parameters. See the predicate isFreeWhenInferring.
407 Note [Implicit parameters and ambiguity]
408 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
409 Only a *class* predicate can give rise to ambiguity
410 An *implicit parameter* cannot. For example:
411 foo :: (?x :: [a]) => Int
413 is fine. The call site will suppply a particular 'x'
415 Furthermore, the type variables fixed by an implicit parameter
416 propagate to the others. E.g.
417 foo :: (Show a, ?x::[a]) => Int
419 The type of foo looks ambiguous. But it isn't, because at a call site
421 let ?x = 5::Int in foo
422 and all is well. In effect, implicit parameters are, well, parameters,
423 so we can take their type variables into account as part of the
424 "tau-tvs" stuff. This is done in the function 'FunDeps.grow'.
427 Question 2: type signatures
428 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
429 BUT WATCH OUT: When you supply a type signature, we can't force you
430 to quantify over implicit parameters. For example:
434 This is perfectly reasonable. We do not want to insist on
436 (?x + 1) :: (?x::Int => Int)
438 That would be silly. Here, the definition site *is* the occurrence site,
439 so the above strictures don't apply. Hence the difference between
440 tcSimplifyCheck (which *does* allow implicit paramters to be inherited)
441 and tcSimplifyCheckBind (which does not).
443 What about when you supply a type signature for a binding?
444 Is it legal to give the following explicit, user type
445 signature to f, thus:
450 At first sight this seems reasonable, but it has the nasty property
451 that adding a type signature changes the dynamic semantics.
454 (let f x = (x::Int) + ?y
455 in (f 3, f 3 with ?y=5)) with ?y = 6
461 in (f 3, f 3 with ?y=5)) with ?y = 6
465 Indeed, simply inlining f (at the Haskell source level) would change the
468 Nevertheless, as Launchbury says (email Oct 01) we can't really give the
469 semantics for a Haskell program without knowing its typing, so if you
470 change the typing you may change the semantics.
472 To make things consistent in all cases where we are *checking* against
473 a supplied signature (as opposed to inferring a type), we adopt the
476 a signature does not need to quantify over implicit params.
478 [This represents a (rather marginal) change of policy since GHC 5.02,
479 which *required* an explicit signature to quantify over all implicit
480 params for the reasons mentioned above.]
482 But that raises a new question. Consider
484 Given (signature) ?x::Int
485 Wanted (inferred) ?x::Int, ?y::Bool
487 Clearly we want to discharge the ?x and float the ?y out. But
488 what is the criterion that distinguishes them? Clearly it isn't
489 what free type variables they have. The Right Thing seems to be
490 to float a constraint that
491 neither mentions any of the quantified type variables
492 nor any of the quantified implicit parameters
494 See the predicate isFreeWhenChecking.
497 Question 3: monomorphism
498 ~~~~~~~~~~~~~~~~~~~~~~~~
499 There's a nasty corner case when the monomorphism restriction bites:
503 The argument above suggests that we *must* generalise
504 over the ?y parameter, to get
505 z :: (?y::Int) => Int,
506 but the monomorphism restriction says that we *must not*, giving
508 Why does the momomorphism restriction say this? Because if you have
510 let z = x + ?y in z+z
512 you might not expect the addition to be done twice --- but it will if
513 we follow the argument of Question 2 and generalise over ?y.
516 Question 4: top level
517 ~~~~~~~~~~~~~~~~~~~~~
518 At the top level, monomorhism makes no sense at all.
521 main = let ?x = 5 in print foo
525 woggle :: (?x :: Int) => Int -> Int
528 We definitely don't want (foo :: Int) with a top-level implicit parameter
529 (?x::Int) becuase there is no way to bind it.
534 (A) Always generalise over implicit parameters
535 Bindings that fall under the monomorphism restriction can't
539 * Inlining remains valid
540 * No unexpected loss of sharing
541 * But simple bindings like
543 will be rejected, unless you add an explicit type signature
544 (to avoid the monomorphism restriction)
545 z :: (?y::Int) => Int
547 This seems unacceptable
549 (B) Monomorphism restriction "wins"
550 Bindings that fall under the monomorphism restriction can't
552 Always generalise over implicit parameters *except* for bindings
553 that fall under the monomorphism restriction
556 * Inlining isn't valid in general
557 * No unexpected loss of sharing
558 * Simple bindings like
560 accepted (get value of ?y from binding site)
562 (C) Always generalise over implicit parameters
563 Bindings that fall under the monomorphism restriction can't
564 be generalised, EXCEPT for implicit parameters
566 * Inlining remains valid
567 * Unexpected loss of sharing (from the extra generalisation)
568 * Simple bindings like
570 accepted (get value of ?y from occurrence sites)
575 None of these choices seems very satisfactory. But at least we should
576 decide which we want to do.
578 It's really not clear what is the Right Thing To Do. If you see
582 would you expect the value of ?y to be got from the *occurrence sites*
583 of 'z', or from the valuue of ?y at the *definition* of 'z'? In the
584 case of function definitions, the answer is clearly the former, but
585 less so in the case of non-fucntion definitions. On the other hand,
586 if we say that we get the value of ?y from the definition site of 'z',
587 then inlining 'z' might change the semantics of the program.
589 Choice (C) really says "the monomorphism restriction doesn't apply
590 to implicit parameters". Which is fine, but remember that every
591 innocent binding 'x = ...' that mentions an implicit parameter in
592 the RHS becomes a *function* of that parameter, called at each
593 use of 'x'. Now, the chances are that there are no intervening 'with'
594 clauses that bind ?y, so a decent compiler should common up all
595 those function calls. So I think I strongly favour (C). Indeed,
596 one could make a similar argument for abolishing the monomorphism
597 restriction altogether.
599 BOTTOM LINE: we choose (B) at present. See tcSimplifyRestricted
603 %************************************************************************
605 \subsection{tcSimplifyInfer}
607 %************************************************************************
609 tcSimplify is called when we *inferring* a type. Here's the overall game plan:
611 1. Compute Q = grow( fvs(T), C )
613 2. Partition C based on Q into Ct and Cq. Notice that ambiguous
614 predicates will end up in Ct; we deal with them at the top level
616 3. Try improvement, using functional dependencies
618 4. If Step 3 did any unification, repeat from step 1
619 (Unification can change the result of 'grow'.)
621 Note: we don't reduce dictionaries in step 2. For example, if we have
622 Eq (a,b), we don't simplify to (Eq a, Eq b). So Q won't be different
623 after step 2. However note that we may therefore quantify over more
624 type variables than we absolutely have to.
626 For the guts, we need a loop, that alternates context reduction and
627 improvement with unification. E.g. Suppose we have
629 class C x y | x->y where ...
631 and tcSimplify is called with:
633 Then improvement unifies a with b, giving
636 If we need to unify anything, we rattle round the whole thing all over
643 -> TcTyVarSet -- fv(T); type vars
645 -> TcM ([TcTyVar], -- Tyvars to quantify (zonked and quantified)
646 [Inst], -- Dict Ids that must be bound here (zonked)
647 TcDictBinds) -- Bindings
648 -- Any free (escaping) Insts are tossed into the environment
653 tcSimplifyInfer doc tau_tvs wanted
654 = do { tau_tvs1 <- zonkTcTyVarsAndFV (varSetElems tau_tvs)
655 ; wanted' <- mapM zonkInst wanted -- Zonk before deciding quantified tyvars
656 ; gbl_tvs <- tcGetGlobalTyVars
657 ; let preds1 = fdPredsOfInsts wanted'
658 gbl_tvs1 = oclose preds1 gbl_tvs
659 qtvs = grow preds1 tau_tvs1 `minusVarSet` gbl_tvs1
660 -- See Note [Choosing which variables to quantify]
662 -- To maximise sharing, remove from consideration any
663 -- constraints that don't mention qtvs at all
664 ; let (free, bound) = partition (isFreeWhenInferring qtvs) wanted'
667 -- To make types simple, reduce as much as possible
668 ; traceTc (text "infer" <+> (ppr preds1 $$ ppr (grow preds1 tau_tvs1) $$ ppr gbl_tvs $$
669 ppr gbl_tvs1 $$ ppr free $$ ppr bound))
670 ; (irreds1, binds1) <- tryHardCheckLoop doc bound
672 -- Note [Inference and implication constraints]
673 ; let want_dict d = tyVarsOfInst d `intersectsVarSet` qtvs
674 ; (irreds2, binds2) <- approximateImplications doc want_dict irreds1
676 -- Now work out all over again which type variables to quantify,
677 -- exactly in the same way as before, but starting from irreds2. Why?
678 -- a) By now improvment may have taken place, and we must *not*
679 -- quantify over any variable free in the environment
680 -- tc137 (function h inside g) is an example
682 -- b) Do not quantify over constraints that *now* do not
683 -- mention quantified type variables, because they are
684 -- simply ambiguous (or might be bound further out). Example:
685 -- f :: Eq b => a -> (a, b)
687 -- From the RHS of g we get the MethodInst f77 :: alpha -> (alpha, beta)
688 -- We decide to quantify over 'alpha' alone, but free1 does not include f77
689 -- because f77 mentions 'alpha'. Then reducing leaves only the (ambiguous)
690 -- constraint (Eq beta), which we dump back into the free set
691 -- See test tcfail181
693 -- c) irreds may contain type variables not previously mentioned,
694 -- e.g. instance D a x => Foo [a]
696 -- Then after simplifying we'll get (D a x), and x is fresh
697 -- We must quantify over x else it'll be totally unbound
698 ; tau_tvs2 <- zonkTcTyVarsAndFV (varSetElems tau_tvs1)
699 ; gbl_tvs2 <- zonkTcTyVarsAndFV (varSetElems gbl_tvs1)
700 -- Note that we start from gbl_tvs1
701 -- We use tcGetGlobalTyVars, then oclose wrt preds2, because
702 -- we've already put some of the original preds1 into frees
703 -- E.g. wanteds = C a b (where a->b)
706 -- Then b is fixed by gbl_tvs, so (C a b) will be in free, and
707 -- irreds2 will be empty. But we don't want to generalise over b!
708 ; let preds2 = fdPredsOfInsts irreds2 -- irreds2 is zonked
709 qtvs = grow preds2 tau_tvs2 `minusVarSet` oclose preds2 gbl_tvs2
710 ; let (free, irreds3) = partition (isFreeWhenInferring qtvs) irreds2
713 -- Turn the quantified meta-type variables into real type variables
714 ; qtvs2 <- zonkQuantifiedTyVars (varSetElems qtvs)
716 -- We can't abstract over any remaining unsolved
717 -- implications so instead just float them outwards. Ugh.
718 ; let (q_dicts0, implics) = partition isAbstractableInst irreds3
719 ; loc <- getInstLoc (ImplicOrigin doc)
720 ; implic_bind <- bindIrreds loc qtvs2 q_dicts0 implics
722 -- Prepare equality instances for quantification
723 ; let (q_eqs0,q_dicts) = partition isEqInst q_dicts0
724 ; q_eqs <- mapM finalizeEqInst q_eqs0
726 ; return (qtvs2, q_eqs ++ q_dicts, binds1 `unionBags` binds2 `unionBags` implic_bind) }
727 -- NB: when we are done, we might have some bindings, but
728 -- the final qtvs might be empty. See Note [NO TYVARS] below.
730 approximateImplications :: SDoc -> (Inst -> Bool) -> [Inst] -> TcM ([Inst], TcDictBinds)
731 -- Note [Inference and implication constraints]
732 -- Given a bunch of Dict and ImplicInsts, try to approximate the implications by
733 -- - fetching any dicts inside them that are free
734 -- - using those dicts as cruder constraints, to solve the implications
735 -- - returning the extra ones too
737 approximateImplications doc want_dict irreds
739 = return (irreds, emptyBag)
741 = do { extra_dicts' <- mapM cloneDict extra_dicts
742 ; tryHardCheckLoop doc (extra_dicts' ++ irreds) }
743 -- By adding extra_dicts', we make them
744 -- available to solve the implication constraints
746 extra_dicts = get_dicts (filter isImplicInst irreds)
748 get_dicts :: [Inst] -> [Inst] -- Returns only Dicts
749 -- Find the wanted constraints in implication constraints that satisfy
750 -- want_dict, and are not bound by forall's in the constraint itself
751 get_dicts ds = concatMap get_dict ds
753 get_dict d@(Dict {}) | want_dict d = [d]
755 get_dict (ImplicInst {tci_tyvars = tvs, tci_wanted = wanteds})
756 = [ d | let tv_set = mkVarSet tvs
757 , d <- get_dicts wanteds
758 , not (tyVarsOfInst d `intersectsVarSet` tv_set)]
759 get_dict i@(EqInst {}) | want_dict i = [i]
761 get_dict other = pprPanic "approximateImplications" (ppr other)
764 Note [Inference and implication constraints]
765 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
766 Suppose we have a wanted implication constraint (perhaps arising from
767 a nested pattern match) like
769 and we are now trying to quantify over 'a' when inferring the type for
770 a function. In principle it's possible that there might be an instance
771 instance (C a, E a) => D [a]
772 so the context (E a) would suffice. The Right Thing is to abstract over
773 the implication constraint, but we don't do that (a) because it'll be
774 surprising to programmers and (b) because we don't have the machinery to deal
775 with 'given' implications.
777 So our best approximation is to make (D [a]) part of the inferred
778 context, so we can use that to discharge the implication. Hence
779 the strange function get_dicts in approximateImplications.
781 The common cases are more clear-cut, when we have things like
783 Here, abstracting over (C b) is not an approximation at all -- but see
784 Note [Freeness and implications].
786 See Trac #1430 and test tc228.
790 -----------------------------------------------------------
791 -- tcSimplifyInferCheck is used when we know the constraints we are to simplify
792 -- against, but we don't know the type variables over which we are going to quantify.
793 -- This happens when we have a type signature for a mutually recursive group
796 -> TcTyVarSet -- fv(T)
799 -> TcM ([TyVar], -- Fully zonked, and quantified
800 TcDictBinds) -- Bindings
802 tcSimplifyInferCheck loc tau_tvs givens wanteds
803 = do { traceTc (text "tcSimplifyInferCheck <-" <+> ppr wanteds)
804 ; (irreds, binds) <- gentleCheckLoop loc givens wanteds
806 -- Figure out which type variables to quantify over
807 -- You might think it should just be the signature tyvars,
808 -- but in bizarre cases you can get extra ones
809 -- f :: forall a. Num a => a -> a
810 -- f x = fst (g (x, head [])) + 1
812 -- Here we infer g :: forall a b. a -> b -> (b,a)
813 -- We don't want g to be monomorphic in b just because
814 -- f isn't quantified over b.
815 ; let all_tvs = varSetElems (tau_tvs `unionVarSet` tyVarsOfInsts givens)
816 ; all_tvs <- zonkTcTyVarsAndFV all_tvs
817 ; gbl_tvs <- tcGetGlobalTyVars
818 ; let qtvs = varSetElems (all_tvs `minusVarSet` gbl_tvs)
819 -- We could close gbl_tvs, but its not necessary for
820 -- soundness, and it'll only affect which tyvars, not which
821 -- dictionaries, we quantify over
823 ; qtvs' <- zonkQuantifiedTyVars qtvs
825 -- Now we are back to normal (c.f. tcSimplCheck)
826 ; implic_bind <- bindIrreds loc qtvs' givens irreds
828 ; traceTc (text "tcSimplifyInferCheck ->" <+> ppr (implic_bind))
829 ; return (qtvs', binds `unionBags` implic_bind) }
832 Note [Squashing methods]
833 ~~~~~~~~~~~~~~~~~~~~~~~~~
834 Be careful if you want to float methods more:
835 truncate :: forall a. RealFrac a => forall b. Integral b => a -> b
836 From an application (truncate f i) we get
839 If we have also have a second occurrence of truncate, we get
842 When simplifying with i,f free, we might still notice that
843 t1=t3; but alas, the binding for t2 (which mentions t1)
844 may continue to float out!
849 class Y a b | a -> b where
852 instance Y [[a]] a where
855 k :: X a -> X a -> X a
857 g :: Num a => [X a] -> [X a]
860 h ys = ys ++ map (k (y [[0]])) xs
862 The excitement comes when simplifying the bindings for h. Initially
863 try to simplify {y @ [[t1]] t2, 0 @ t1}, with initial qtvs = {t2}.
864 From this we get t1:=:t2, but also various bindings. We can't forget
865 the bindings (because of [LOOP]), but in fact t1 is what g is
868 The net effect of [NO TYVARS]
871 isFreeWhenInferring :: TyVarSet -> Inst -> Bool
872 isFreeWhenInferring qtvs inst
873 = isFreeWrtTyVars qtvs inst -- Constrains no quantified vars
874 && isInheritableInst inst -- and no implicit parameter involved
875 -- see Note [Inheriting implicit parameters]
877 {- No longer used (with implication constraints)
878 isFreeWhenChecking :: TyVarSet -- Quantified tyvars
879 -> NameSet -- Quantified implicit parameters
881 isFreeWhenChecking qtvs ips inst
882 = isFreeWrtTyVars qtvs inst
883 && isFreeWrtIPs ips inst
886 isFreeWrtTyVars :: VarSet -> Inst -> Bool
887 isFreeWrtTyVars qtvs inst = tyVarsOfInst inst `disjointVarSet` qtvs
888 isFreeWrtIPs :: NameSet -> Inst -> Bool
889 isFreeWrtIPs ips inst = not (any (`elemNameSet` ips) (ipNamesOfInst inst))
893 %************************************************************************
895 \subsection{tcSimplifyCheck}
897 %************************************************************************
899 @tcSimplifyCheck@ is used when we know exactly the set of variables
900 we are going to quantify over. For example, a class or instance declaration.
903 -----------------------------------------------------------
904 -- tcSimplifyCheck is used when checking expression type signatures,
905 -- class decls, instance decls etc.
906 tcSimplifyCheck :: InstLoc
907 -> [TcTyVar] -- Quantify over these
910 -> TcM TcDictBinds -- Bindings
911 tcSimplifyCheck loc qtvs givens wanteds
912 = ASSERT( all isTcTyVar qtvs && all isSkolemTyVar qtvs )
913 do { traceTc (text "tcSimplifyCheck")
914 ; (irreds, binds) <- gentleCheckLoop loc givens wanteds
915 ; implic_bind <- bindIrreds loc qtvs givens irreds
916 ; return (binds `unionBags` implic_bind) }
918 -----------------------------------------------------------
919 -- tcSimplifyCheckPat is used for existential pattern match
920 tcSimplifyCheckPat :: InstLoc
921 -> [TcTyVar] -- Quantify over these
924 -> TcM TcDictBinds -- Bindings
925 tcSimplifyCheckPat loc qtvs givens wanteds
926 = ASSERT( all isTcTyVar qtvs && all isSkolemTyVar qtvs )
927 do { traceTc (text "tcSimplifyCheckPat")
928 ; (irreds, binds) <- gentleCheckLoop loc givens wanteds
929 ; implic_bind <- bindIrredsR loc qtvs givens irreds
930 ; return (binds `unionBags` implic_bind) }
932 -----------------------------------------------------------
933 bindIrreds :: InstLoc -> [TcTyVar]
936 bindIrreds loc qtvs givens irreds
937 = bindIrredsR loc qtvs givens irreds
939 bindIrredsR :: InstLoc -> [TcTyVar] -> [Inst] -> [Inst] -> TcM TcDictBinds
940 -- Make a binding that binds 'irreds', by generating an implication
941 -- constraint for them, *and* throwing the constraint into the LIE
942 bindIrredsR loc qtvs givens irreds
946 = do { let givens' = filter isAbstractableInst givens
947 -- The givens can (redundantly) include methods
948 -- We want to retain both EqInsts and Dicts
949 -- There should be no implicadtion constraints
950 -- See Note [Pruning the givens in an implication constraint]
952 -- If there are no 'givens', then it's safe to
953 -- partition the 'wanteds' by their qtvs, thereby trimming irreds
954 -- See Note [Freeness and implications]
955 ; irreds' <- if null givens'
957 { let qtv_set = mkVarSet qtvs
958 (frees, real_irreds) = partition (isFreeWrtTyVars qtv_set) irreds
960 ; return real_irreds }
963 ; (implics, bind) <- makeImplicationBind loc qtvs givens' irreds'
964 -- This call does the real work
965 -- If irreds' is empty, it does something sensible
970 makeImplicationBind :: InstLoc -> [TcTyVar]
972 -> TcM ([Inst], TcDictBinds)
973 -- Make a binding that binds 'irreds', by generating an implication
974 -- constraint for them.
976 -- The binding looks like
977 -- (ir1, .., irn) = f qtvs givens
978 -- where f is (evidence for) the new implication constraint
979 -- f :: forall qtvs. givens => (ir1, .., irn)
980 -- qtvs includes coercion variables.
982 -- This binding must line up the 'rhs' in reduceImplication
983 makeImplicationBind loc all_tvs
984 givens -- Guaranteed all Dicts or EqInsts
986 | null irreds -- If there are no irreds, we are done
987 = return ([], emptyBag)
988 | otherwise -- Otherwise we must generate a binding
989 = do { uniq <- newUnique
990 ; span <- getSrcSpanM
991 ; let (eq_givens, dict_givens) = partition isEqInst givens
993 -- extract equality binders
994 eq_cotvs = map eqInstType eq_givens
996 -- make the implication constraint instance
997 name = mkInternalName uniq (mkVarOcc "ic") span
998 implic_inst = ImplicInst { tci_name = name,
999 tci_tyvars = all_tvs,
1000 tci_given = (eq_givens ++ dict_givens),
1001 -- same order as binders
1002 tci_wanted = irreds,
1005 -- create binders for the irreducible dictionaries
1006 dict_irreds = filter (not . isEqInst) irreds
1007 dict_irred_ids = map instToId dict_irreds
1008 lpat = mkBigLHsPatTup (map (L span . VarPat) dict_irred_ids)
1010 -- create the binding
1011 rhs = L span (mkHsWrap co (HsVar (instToId implic_inst)))
1012 co = mkWpApps (map instToId dict_givens)
1013 <.> mkWpTyApps eq_cotvs
1014 <.> mkWpTyApps (mkTyVarTys all_tvs)
1015 bind | [dict_irred_id] <- dict_irred_ids
1016 = VarBind dict_irred_id rhs
1018 = PatBind { pat_lhs = lpat
1019 , pat_rhs = unguardedGRHSs rhs
1020 , pat_rhs_ty = hsLPatType lpat
1021 , bind_fvs = placeHolderNames
1024 ; traceTc $ text "makeImplicationBind" <+> ppr implic_inst
1025 ; return ([implic_inst], unitBag (L span bind))
1028 -----------------------------------------------------------
1029 tryHardCheckLoop :: SDoc
1031 -> TcM ([Inst], TcDictBinds)
1033 tryHardCheckLoop doc wanteds
1034 = do { (irreds,binds) <- checkLoop (mkInferRedEnv doc try_me) wanteds
1035 ; return (irreds,binds)
1039 -- Here's the try-hard bit
1041 -----------------------------------------------------------
1042 gentleCheckLoop :: InstLoc
1045 -> TcM ([Inst], TcDictBinds)
1047 gentleCheckLoop inst_loc givens wanteds
1048 = do { (irreds,binds) <- checkLoop env wanteds
1049 ; return (irreds,binds)
1052 env = mkRedEnv (pprInstLoc inst_loc) try_me givens
1054 try_me inst | isMethodOrLit inst = ReduceMe
1056 -- When checking against a given signature
1057 -- we MUST be very gentle: Note [Check gently]
1059 gentleInferLoop :: SDoc -> [Inst]
1060 -> TcM ([Inst], TcDictBinds)
1061 gentleInferLoop doc wanteds
1062 = do { (irreds, binds) <- checkLoop env wanteds
1063 ; return (irreds, binds) }
1065 env = mkInferRedEnv doc try_me
1066 try_me inst | isMethodOrLit inst = ReduceMe
1071 ~~~~~~~~~~~~~~~~~~~~
1072 We have to very careful about not simplifying too vigorously
1077 f :: Show b => T b -> b
1078 f (MkT x) = show [x]
1080 Inside the pattern match, which binds (a:*, x:a), we know that
1082 Hence we have a dictionary for Show [a] available; and indeed we
1083 need it. We are going to build an implication contraint
1084 forall a. (b~[a]) => Show [a]
1085 Later, we will solve this constraint using the knowledge (Show b)
1087 But we MUST NOT reduce (Show [a]) to (Show a), else the whole
1088 thing becomes insoluble. So we simplify gently (get rid of literals
1089 and methods only, plus common up equal things), deferring the real
1090 work until top level, when we solve the implication constraint
1091 with tryHardCheckLooop.
1095 -----------------------------------------------------------
1098 -> TcM ([Inst], TcDictBinds)
1099 -- Precondition: givens are completely rigid
1100 -- Postcondition: returned Insts are zonked
1102 checkLoop env wanteds
1104 where go env wanteds
1105 = do { -- We do need to zonk the givens; cf Note [Zonking RedEnv]
1106 ; env' <- zonkRedEnv env
1107 ; wanteds' <- zonkInsts wanteds
1109 ; (improved, binds, irreds) <- reduceContext env' wanteds'
1111 ; if null irreds || not improved then
1112 return (irreds, binds)
1115 -- If improvement did some unification, we go round again.
1116 -- We start again with irreds, not wanteds
1117 -- Using an instance decl might have introduced a fresh type
1118 -- variable which might have been unified, so we'd get an
1119 -- infinite loop if we started again with wanteds!
1121 { (irreds1, binds1) <- go env' irreds
1122 ; return (irreds1, binds `unionBags` binds1) } }
1125 Note [Zonking RedEnv]
1126 ~~~~~~~~~~~~~~~~~~~~~
1127 It might appear as if the givens in RedEnv are always rigid, but that is not
1128 necessarily the case for programs involving higher-rank types that have class
1129 contexts constraining the higher-rank variables. An example from tc237 in the
1132 class Modular s a | s -> a
1134 wim :: forall a w. Integral a
1135 => a -> (forall s. Modular s a => M s w) -> w
1136 wim i k = error "urk"
1138 test5 :: (Modular s a, Integral a) => M s a
1141 test4 = wim 4 test4'
1143 Notice how the variable 'a' of (Modular s a) in the rank-2 type of wim is
1144 quantified further outside. When type checking test4, we have to check
1145 whether the signature of test5 is an instance of
1147 (forall s. Modular s a => M s w)
1149 Consequently, we will get (Modular s t_a), where t_a is a TauTv into the
1152 Given the FD of Modular in this example, class improvement will instantiate
1153 t_a to 'a', where 'a' is the skolem from test5's signatures (due to the
1154 Modular s a predicate in that signature). If we don't zonk (Modular s t_a) in
1155 the givens, we will get into a loop as improveOne uses the unification engine
1156 Unify.tcUnifyTys, which doesn't know about mutable type variables.
1161 class If b t e r | b t e -> r
1164 class Lte a b c | a b -> c where lte :: a -> b -> c
1166 instance (Lte a b l,If l b a c) => Max a b c
1168 Wanted: Max Z (S x) y
1170 Then we'll reduce using the Max instance to:
1171 (Lte Z (S x) l, If l (S x) Z y)
1172 and improve by binding l->T, after which we can do some reduction
1173 on both the Lte and If constraints. What we *can't* do is start again
1174 with (Max Z (S x) y)!
1178 %************************************************************************
1180 tcSimplifySuperClasses
1182 %************************************************************************
1184 Note [SUPERCLASS-LOOP 1]
1185 ~~~~~~~~~~~~~~~~~~~~~~~~
1186 We have to be very, very careful when generating superclasses, lest we
1187 accidentally build a loop. Here's an example:
1191 class S a => C a where { opc :: a -> a }
1192 class S b => D b where { opd :: b -> b }
1194 instance C Int where
1197 instance D Int where
1200 From (instance C Int) we get the constraint set {ds1:S Int, dd:D Int}
1201 Simplifying, we may well get:
1202 $dfCInt = :C ds1 (opd dd)
1205 Notice that we spot that we can extract ds1 from dd.
1207 Alas! Alack! We can do the same for (instance D Int):
1209 $dfDInt = :D ds2 (opc dc)
1213 And now we've defined the superclass in terms of itself.
1214 Two more nasty cases are in
1219 - Satisfy the superclass context *all by itself*
1220 (tcSimplifySuperClasses)
1221 - And do so completely; i.e. no left-over constraints
1222 to mix with the constraints arising from method declarations
1225 Note [Recursive instances and superclases]
1226 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1227 Consider this code, which arises in the context of "Scrap Your
1228 Boilerplate with Class".
1232 instance Sat (ctx Char) => Data ctx Char
1233 instance (Sat (ctx [a]), Data ctx a) => Data ctx [a]
1235 class Data Maybe a => Foo a
1237 instance Foo t => Sat (Maybe t)
1239 instance Data Maybe a => Foo a
1240 instance Foo a => Foo [a]
1243 In the instance for Foo [a], when generating evidence for the superclasses
1244 (ie in tcSimplifySuperClasses) we need a superclass (Data Maybe [a]).
1245 Using the instance for Data, we therefore need
1246 (Sat (Maybe [a], Data Maybe a)
1247 But we are given (Foo a), and hence its superclass (Data Maybe a).
1248 So that leaves (Sat (Maybe [a])). Using the instance for Sat means
1249 we need (Foo [a]). And that is the very dictionary we are bulding
1250 an instance for! So we must put that in the "givens". So in this
1252 Given: Foo a, Foo [a]
1253 Watend: Data Maybe [a]
1255 BUT we must *not not not* put the *superclasses* of (Foo [a]) in
1256 the givens, which is what 'addGiven' would normally do. Why? Because
1257 (Data Maybe [a]) is the superclass, so we'd "satisfy" the wanted
1258 by selecting a superclass from Foo [a], which simply makes a loop.
1260 On the other hand we *must* put the superclasses of (Foo a) in
1261 the givens, as you can see from the derivation described above.
1263 Conclusion: in the very special case of tcSimplifySuperClasses
1264 we have one 'given' (namely the "this" dictionary) whose superclasses
1265 must not be added to 'givens' by addGiven. That is the *whole* reason
1266 for the red_given_scs field in RedEnv, and the function argument to
1270 tcSimplifySuperClasses
1272 -> Inst -- The dict whose superclasses
1273 -- are being figured out
1277 tcSimplifySuperClasses loc this givens sc_wanteds
1278 = do { traceTc (text "tcSimplifySuperClasses")
1279 ; (irreds,binds1) <- checkLoop env sc_wanteds
1280 ; let (tidy_env, tidy_irreds) = tidyInsts irreds
1281 ; reportNoInstances tidy_env (Just (loc, givens)) tidy_irreds
1284 env = RedEnv { red_doc = pprInstLoc loc,
1285 red_try_me = try_me,
1286 red_givens = this:givens,
1287 red_given_scs = add_scs,
1289 red_improve = False } -- No unification vars
1290 add_scs g | g==this = NoSCs
1291 | otherwise = AddSCs
1293 try_me _ = ReduceMe -- Try hard, so we completely solve the superclass
1294 -- constraints right here. See Note [SUPERCLASS-LOOP 1]
1298 %************************************************************************
1300 \subsection{tcSimplifyRestricted}
1302 %************************************************************************
1304 tcSimplifyRestricted infers which type variables to quantify for a
1305 group of restricted bindings. This isn't trivial.
1308 We want to quantify over a to get id :: forall a. a->a
1311 We do not want to quantify over a, because there's an Eq a
1312 constraint, so we get eq :: a->a->Bool (notice no forall)
1315 RHS has type 'tau', whose free tyvars are tau_tvs
1316 RHS has constraints 'wanteds'
1319 Quantify over (tau_tvs \ ftvs(wanteds))
1320 This is bad. The constraints may contain (Monad (ST s))
1321 where we have instance Monad (ST s) where...
1322 so there's no need to be monomorphic in s!
1324 Also the constraint might be a method constraint,
1325 whose type mentions a perfectly innocent tyvar:
1326 op :: Num a => a -> b -> a
1327 Here, b is unconstrained. A good example would be
1329 We want to infer the polymorphic type
1330 foo :: forall b. b -> b
1333 Plan B (cunning, used for a long time up to and including GHC 6.2)
1334 Step 1: Simplify the constraints as much as possible (to deal
1335 with Plan A's problem). Then set
1336 qtvs = tau_tvs \ ftvs( simplify( wanteds ) )
1338 Step 2: Now simplify again, treating the constraint as 'free' if
1339 it does not mention qtvs, and trying to reduce it otherwise.
1340 The reasons for this is to maximise sharing.
1342 This fails for a very subtle reason. Suppose that in the Step 2
1343 a constraint (Foo (Succ Zero) (Succ Zero) b) gets thrown upstairs as 'free'.
1344 In the Step 1 this constraint might have been simplified, perhaps to
1345 (Foo Zero Zero b), AND THEN THAT MIGHT BE IMPROVED, to bind 'b' to 'T'.
1346 This won't happen in Step 2... but that in turn might prevent some other
1347 constraint (Baz [a] b) being simplified (e.g. via instance Baz [a] T where {..})
1348 and that in turn breaks the invariant that no constraints are quantified over.
1350 Test typecheck/should_compile/tc177 (which failed in GHC 6.2) demonstrates
1355 Step 1: Simplify the constraints as much as possible (to deal
1356 with Plan A's problem). Then set
1357 qtvs = tau_tvs \ ftvs( simplify( wanteds ) )
1358 Return the bindings from Step 1.
1361 A note about Plan C (arising from "bug" reported by George Russel March 2004)
1364 instance (HasBinary ty IO) => HasCodedValue ty
1366 foo :: HasCodedValue a => String -> IO a
1368 doDecodeIO :: HasCodedValue a => () -> () -> IO a
1369 doDecodeIO codedValue view
1370 = let { act = foo "foo" } in act
1372 You might think this should work becuase the call to foo gives rise to a constraint
1373 (HasCodedValue t), which can be satisfied by the type sig for doDecodeIO. But the
1374 restricted binding act = ... calls tcSimplifyRestricted, and PlanC simplifies the
1375 constraint using the (rather bogus) instance declaration, and now we are stuffed.
1377 I claim this is not really a bug -- but it bit Sergey as well as George. So here's
1381 Plan D (a variant of plan B)
1382 Step 1: Simplify the constraints as much as possible (to deal
1383 with Plan A's problem), BUT DO NO IMPROVEMENT. Then set
1384 qtvs = tau_tvs \ ftvs( simplify( wanteds ) )
1386 Step 2: Now simplify again, treating the constraint as 'free' if
1387 it does not mention qtvs, and trying to reduce it otherwise.
1389 The point here is that it's generally OK to have too few qtvs; that is,
1390 to make the thing more monomorphic than it could be. We don't want to
1391 do that in the common cases, but in wierd cases it's ok: the programmer
1392 can always add a signature.
1394 Too few qtvs => too many wanteds, which is what happens if you do less
1399 tcSimplifyRestricted -- Used for restricted binding groups
1400 -- i.e. ones subject to the monomorphism restriction
1403 -> [Name] -- Things bound in this group
1404 -> TcTyVarSet -- Free in the type of the RHSs
1405 -> [Inst] -- Free in the RHSs
1406 -> TcM ([TyVar], -- Tyvars to quantify (zonked and quantified)
1407 TcDictBinds) -- Bindings
1408 -- tcSimpifyRestricted returns no constraints to
1409 -- quantify over; by definition there are none.
1410 -- They are all thrown back in the LIE
1412 tcSimplifyRestricted doc top_lvl bndrs tau_tvs wanteds
1413 -- Zonk everything in sight
1414 = do { traceTc (text "tcSimplifyRestricted")
1415 ; wanteds' <- zonkInsts wanteds
1417 -- 'ReduceMe': Reduce as far as we can. Don't stop at
1418 -- dicts; the idea is to get rid of as many type
1419 -- variables as possible, and we don't want to stop
1420 -- at (say) Monad (ST s), because that reduces
1421 -- immediately, with no constraint on s.
1423 -- BUT do no improvement! See Plan D above
1424 -- HOWEVER, some unification may take place, if we instantiate
1425 -- a method Inst with an equality constraint
1426 ; let env = mkNoImproveRedEnv doc (\_ -> ReduceMe)
1427 ; (_imp, _binds, constrained_dicts) <- reduceContext env wanteds'
1429 -- Next, figure out the tyvars we will quantify over
1430 ; tau_tvs' <- zonkTcTyVarsAndFV (varSetElems tau_tvs)
1431 ; gbl_tvs' <- tcGetGlobalTyVars
1432 ; constrained_dicts' <- zonkInsts constrained_dicts
1434 ; let qtvs1 = tau_tvs' `minusVarSet` oclose (fdPredsOfInsts constrained_dicts) gbl_tvs'
1435 -- As in tcSimplifyInfer
1437 -- Do not quantify over constrained type variables:
1438 -- this is the monomorphism restriction
1439 constrained_tvs' = tyVarsOfInsts constrained_dicts'
1440 qtvs = qtvs1 `minusVarSet` constrained_tvs'
1441 pp_bndrs = pprWithCommas (quotes . ppr) bndrs
1444 ; warn_mono <- doptM Opt_WarnMonomorphism
1445 ; warnTc (warn_mono && (constrained_tvs' `intersectsVarSet` qtvs1))
1446 (vcat[ ptext (sLit "the Monomorphism Restriction applies to the binding")
1447 <> plural bndrs <+> ptext (sLit "for") <+> pp_bndrs,
1448 ptext (sLit "Consider giving a type signature for") <+> pp_bndrs])
1450 ; traceTc (text "tcSimplifyRestricted" <+> vcat [
1451 pprInsts wanteds, pprInsts constrained_dicts',
1453 ppr constrained_tvs', ppr tau_tvs', ppr qtvs ])
1455 -- The first step may have squashed more methods than
1456 -- necessary, so try again, this time more gently, knowing the exact
1457 -- set of type variables to quantify over.
1459 -- We quantify only over constraints that are captured by qtvs;
1460 -- these will just be a subset of non-dicts. This in contrast
1461 -- to normal inference (using isFreeWhenInferring) in which we quantify over
1462 -- all *non-inheritable* constraints too. This implements choice
1463 -- (B) under "implicit parameter and monomorphism" above.
1465 -- Remember that we may need to do *some* simplification, to
1466 -- (for example) squash {Monad (ST s)} into {}. It's not enough
1467 -- just to float all constraints
1469 -- At top level, we *do* squash methods becuase we want to
1470 -- expose implicit parameters to the test that follows
1471 ; let is_nested_group = isNotTopLevel top_lvl
1472 try_me inst | isFreeWrtTyVars qtvs inst,
1473 (is_nested_group || isDict inst) = Stop
1474 | otherwise = ReduceMe
1475 env = mkNoImproveRedEnv doc try_me
1476 ; (_imp, binds, irreds) <- reduceContext env wanteds'
1478 -- See "Notes on implicit parameters, Question 4: top level"
1479 ; ASSERT( all (isFreeWrtTyVars qtvs) irreds ) -- None should be captured
1480 if is_nested_group then
1482 else do { let (bad_ips, non_ips) = partition isIPDict irreds
1483 ; addTopIPErrs bndrs bad_ips
1484 ; extendLIEs non_ips }
1486 ; qtvs' <- zonkQuantifiedTyVars (varSetElems qtvs)
1487 ; return (qtvs', binds) }
1491 %************************************************************************
1495 %************************************************************************
1497 On the LHS of transformation rules we only simplify methods and constants,
1498 getting dictionaries. We want to keep all of them unsimplified, to serve
1499 as the available stuff for the RHS of the rule.
1501 Example. Consider the following left-hand side of a rule
1503 f (x == y) (y > z) = ...
1505 If we typecheck this expression we get constraints
1507 d1 :: Ord a, d2 :: Eq a
1509 We do NOT want to "simplify" to the LHS
1511 forall x::a, y::a, z::a, d1::Ord a.
1512 f ((==) (eqFromOrd d1) x y) ((>) d1 y z) = ...
1516 forall x::a, y::a, z::a, d1::Ord a, d2::Eq a.
1517 f ((==) d2 x y) ((>) d1 y z) = ...
1519 Here is another example:
1521 fromIntegral :: (Integral a, Num b) => a -> b
1522 {-# RULES "foo" fromIntegral = id :: Int -> Int #-}
1524 In the rule, a=b=Int, and Num Int is a superclass of Integral Int. But
1525 we *dont* want to get
1527 forall dIntegralInt.
1528 fromIntegral Int Int dIntegralInt (scsel dIntegralInt) = id Int
1530 because the scsel will mess up RULE matching. Instead we want
1532 forall dIntegralInt, dNumInt.
1533 fromIntegral Int Int dIntegralInt dNumInt = id Int
1537 g (x == y) (y == z) = ..
1539 where the two dictionaries are *identical*, we do NOT WANT
1541 forall x::a, y::a, z::a, d1::Eq a
1542 f ((==) d1 x y) ((>) d1 y z) = ...
1544 because that will only match if the dict args are (visibly) equal.
1545 Instead we want to quantify over the dictionaries separately.
1547 In short, tcSimplifyRuleLhs must *only* squash LitInst and MethInts, leaving
1548 all dicts unchanged, with absolutely no sharing. It's simpler to do this
1549 from scratch, rather than further parameterise simpleReduceLoop etc.
1550 Simpler, maybe, but alas not simple (see Trac #2494)
1552 * Type errors may give rise to an (unsatisfiable) equality constraint
1554 * Applications of a higher-rank function on the LHS may give
1555 rise to an implication constraint, esp if there are unsatisfiable
1556 equality constraints inside.
1559 tcSimplifyRuleLhs :: [Inst] -> TcM ([Inst], TcDictBinds)
1560 tcSimplifyRuleLhs wanteds
1561 = do { wanteds' <- zonkInsts wanteds
1562 ; (irreds, binds) <- go [] emptyBag wanteds'
1563 ; let (dicts, bad_irreds) = partition isDict irreds
1564 ; traceTc (text "tcSimplifyrulelhs" <+> pprInsts bad_irreds)
1565 ; addNoInstanceErrs (nub bad_irreds)
1566 -- The nub removes duplicates, which has
1567 -- not happened otherwise (see notes above)
1568 ; return (dicts, binds) }
1570 go :: [Inst] -> TcDictBinds -> [Inst] -> TcM ([Inst], TcDictBinds)
1572 = return (irreds, binds)
1573 go irreds binds (w:ws)
1575 = go (w:irreds) binds ws
1576 | isImplicInst w -- Have a go at reducing the implication
1577 = do { (binds1, irreds1) <- reduceImplication red_env w
1578 ; let (bad_irreds, ok_irreds) = partition isImplicInst irreds1
1579 ; go (bad_irreds ++ irreds)
1580 (binds `unionBags` binds1)
1583 = do { w' <- zonkInst w -- So that (3::Int) does not generate a call
1584 -- to fromInteger; this looks fragile to me
1585 ; lookup_result <- lookupSimpleInst w'
1586 ; case lookup_result of
1587 NoInstance -> go (w:irreds) binds ws
1588 GenInst ws' rhs -> go irreds binds' (ws' ++ ws)
1590 binds' = addInstToDictBind binds w rhs
1593 -- Sigh: we need to reduce inside implications
1594 red_env = mkInferRedEnv doc try_me
1595 doc = ptext (sLit "Implication constraint in RULE lhs")
1596 try_me inst | isMethodOrLit inst = ReduceMe
1597 | otherwise = Stop -- Be gentle
1600 tcSimplifyBracket is used when simplifying the constraints arising from
1601 a Template Haskell bracket [| ... |]. We want to check that there aren't
1602 any constraints that can't be satisfied (e.g. Show Foo, where Foo has no
1603 Show instance), but we aren't otherwise interested in the results.
1604 Nor do we care about ambiguous dictionaries etc. We will type check
1605 this bracket again at its usage site.
1608 tcSimplifyBracket :: [Inst] -> TcM ()
1609 tcSimplifyBracket wanteds
1610 = do { tryHardCheckLoop doc wanteds
1613 doc = text "tcSimplifyBracket"
1617 %************************************************************************
1619 \subsection{Filtering at a dynamic binding}
1621 %************************************************************************
1626 we must discharge all the ?x constraints from B. We also do an improvement
1627 step; if we have ?x::t1 and ?x::t2 we must unify t1, t2.
1629 Actually, the constraints from B might improve the types in ?x. For example
1631 f :: (?x::Int) => Char -> Char
1634 then the constraint (?x::Int) arising from the call to f will
1635 force the binding for ?x to be of type Int.
1638 tcSimplifyIPs :: [Inst] -- The implicit parameters bound here
1641 -- We need a loop so that we do improvement, and then
1642 -- (next time round) generate a binding to connect the two
1644 -- Here the two ?x's have different types, and improvement
1645 -- makes them the same.
1647 tcSimplifyIPs given_ips wanteds
1648 = do { wanteds' <- zonkInsts wanteds
1649 ; given_ips' <- zonkInsts given_ips
1650 -- Unusually for checking, we *must* zonk the given_ips
1652 ; let env = mkRedEnv doc try_me given_ips'
1653 ; (improved, binds, irreds) <- reduceContext env wanteds'
1655 ; if null irreds || not improved then
1656 ASSERT( all is_free irreds )
1657 do { extendLIEs irreds
1660 -- If improvement did some unification, we go round again.
1661 -- We start again with irreds, not wanteds
1662 -- Using an instance decl might have introduced a fresh type
1663 -- variable which might have been unified, so we'd get an
1664 -- infinite loop if we started again with wanteds!
1666 { binds1 <- tcSimplifyIPs given_ips' irreds
1667 ; return $ binds `unionBags` binds1
1670 doc = text "tcSimplifyIPs" <+> ppr given_ips
1671 ip_set = mkNameSet (ipNamesOfInsts given_ips)
1672 is_free inst = isFreeWrtIPs ip_set inst
1674 -- Simplify any methods that mention the implicit parameter
1675 try_me inst | is_free inst = Stop
1676 | otherwise = ReduceMe
1680 %************************************************************************
1682 \subsection[binds-for-local-funs]{@bindInstsOfLocalFuns@}
1684 %************************************************************************
1686 When doing a binding group, we may have @Insts@ of local functions.
1687 For example, we might have...
1689 let f x = x + 1 -- orig local function (overloaded)
1690 f.1 = f Int -- two instances of f
1695 The point is: we must drop the bindings for @f.1@ and @f.2@ here,
1696 where @f@ is in scope; those @Insts@ must certainly not be passed
1697 upwards towards the top-level. If the @Insts@ were binding-ified up
1698 there, they would have unresolvable references to @f@.
1700 We pass in an @init_lie@ of @Insts@ and a list of locally-bound @Ids@.
1701 For each method @Inst@ in the @init_lie@ that mentions one of the
1702 @Ids@, we create a binding. We return the remaining @Insts@ (in an
1703 @LIE@), as well as the @HsBinds@ generated.
1706 bindInstsOfLocalFuns :: [Inst] -> [TcId] -> TcM TcDictBinds
1707 -- Simlifies only MethodInsts, and generate only bindings of form
1709 -- We're careful not to even generate bindings of the form
1711 -- You'd think that'd be fine, but it interacts with what is
1712 -- arguably a bug in Match.tidyEqnInfo (see notes there)
1714 bindInstsOfLocalFuns wanteds local_ids
1715 | null overloaded_ids = do
1718 return emptyLHsBinds
1721 = do { (irreds, binds) <- gentleInferLoop doc for_me
1722 ; extendLIEs not_for_me
1726 doc = text "bindInsts" <+> ppr local_ids
1727 overloaded_ids = filter is_overloaded local_ids
1728 is_overloaded id = isOverloadedTy (idType id)
1729 (for_me, not_for_me) = partition (isMethodFor overloaded_set) wanteds
1731 overloaded_set = mkVarSet overloaded_ids -- There can occasionally be a lot of them
1732 -- so it's worth building a set, so that
1733 -- lookup (in isMethodFor) is faster
1737 %************************************************************************
1739 \subsection{Data types for the reduction mechanism}
1741 %************************************************************************
1743 The main control over context reduction is here
1747 = RedEnv { red_doc :: SDoc -- The context
1748 , red_try_me :: Inst -> WhatToDo
1749 , red_improve :: Bool -- True <=> do improvement
1750 , red_givens :: [Inst] -- All guaranteed rigid
1751 -- Always dicts & equalities
1752 -- but see Note [Rigidity]
1754 , red_given_scs :: Inst -> WantSCs -- See Note [Recursive instances and superclases]
1756 , red_stack :: (Int, [Inst]) -- Recursion stack (for err msg)
1757 -- See Note [RedStack]
1761 -- The red_givens are rigid so far as cmpInst is concerned.
1762 -- There is one case where they are not totally rigid, namely in tcSimplifyIPs
1763 -- let ?x = e in ...
1764 -- Here, the given is (?x::a), where 'a' is not necy a rigid type
1765 -- But that doesn't affect the comparison, which is based only on mame.
1768 -- The red_stack pair (n,insts) pair is just used for error reporting.
1769 -- 'n' is always the depth of the stack.
1770 -- The 'insts' is the stack of Insts being reduced: to produce X
1771 -- I had to produce Y, to produce Y I had to produce Z, and so on.
1774 mkRedEnv :: SDoc -> (Inst -> WhatToDo) -> [Inst] -> RedEnv
1775 mkRedEnv doc try_me givens
1776 = RedEnv { red_doc = doc, red_try_me = try_me,
1777 red_givens = givens,
1778 red_given_scs = const AddSCs,
1780 red_improve = True }
1782 mkInferRedEnv :: SDoc -> (Inst -> WhatToDo) -> RedEnv
1784 mkInferRedEnv doc try_me
1785 = RedEnv { red_doc = doc, red_try_me = try_me,
1787 red_given_scs = const AddSCs,
1789 red_improve = True }
1791 mkNoImproveRedEnv :: SDoc -> (Inst -> WhatToDo) -> RedEnv
1792 -- Do not do improvement; no givens
1793 mkNoImproveRedEnv doc try_me
1794 = RedEnv { red_doc = doc, red_try_me = try_me,
1796 red_given_scs = const AddSCs,
1798 red_improve = True }
1801 = ReduceMe -- Try to reduce this
1802 -- If there's no instance, add the inst to the
1803 -- irreductible ones, but don't produce an error
1804 -- message of any kind.
1805 -- It might be quite legitimate such as (Eq a)!
1807 | Stop -- Return as irreducible unless it can
1808 -- be reduced to a constant in one step
1809 -- Do not add superclasses; see
1811 data WantSCs = NoSCs | AddSCs -- Tells whether we should add the superclasses
1812 -- of a predicate when adding it to the avails
1813 -- The reason for this flag is entirely the super-class loop problem
1814 -- Note [SUPER-CLASS LOOP 1]
1816 zonkRedEnv :: RedEnv -> TcM RedEnv
1818 = do { givens' <- mapM zonkInst (red_givens env)
1819 ; return $ env {red_givens = givens'}
1824 %************************************************************************
1826 \subsection[reduce]{@reduce@}
1828 %************************************************************************
1830 Note [Ancestor Equalities]
1831 ~~~~~~~~~~~~~~~~~~~~~~~~~~
1832 During context reduction, we add to the wanted equalities also those
1833 equalities that (transitively) occur in superclass contexts of wanted
1834 class constraints. Consider the following code
1836 class a ~ Int => C a
1839 If (C a) is wanted, we want to add (a ~ Int), which will be discharged by
1840 substituting Int for a. Hence, we ultimately want (C Int), which we
1841 discharge with the explicit instance.
1844 reduceContext :: RedEnv
1846 -> TcM (ImprovementDone,
1847 TcDictBinds, -- Dictionary bindings
1848 [Inst]) -- Irreducible
1850 reduceContext env wanteds0
1851 = do { traceTc (text "reduceContext" <+> (vcat [
1852 text "----------------------",
1854 text "given" <+> ppr (red_givens env),
1855 text "wanted" <+> ppr wanteds0,
1856 text "----------------------"
1859 -- We want to add as wanted equalities those that (transitively)
1860 -- occur in superclass contexts of wanted class constraints.
1861 -- See Note [Ancestor Equalities]
1862 ; ancestor_eqs <- ancestorEqualities wanteds0
1863 ; traceTc $ text "reduceContext: ancestor eqs" <+> ppr ancestor_eqs
1865 -- Normalise and solve all equality constraints as far as possible
1866 -- and normalise all dictionary constraints wrt to the reduced
1867 -- equalities. The returned wanted constraints include the
1868 -- irreducible wanted equalities.
1869 ; let wanteds = wanteds0 ++ ancestor_eqs
1870 givens = red_givens env
1874 eq_improved) <- tcReduceEqs givens wanteds
1875 ; traceTc $ text "reduceContext: tcReduceEqs result" <+> vcat
1876 [ppr givens', ppr wanteds', ppr normalise_binds]
1878 -- Build the Avail mapping from "given_dicts"
1879 ; (init_state, _) <- getLIE $ do
1880 { init_state <- foldlM (addGiven (red_given_scs env))
1885 -- Solve the *wanted* *dictionary* constraints (not implications)
1886 -- This may expose some further equational constraints...
1887 ; let (wanted_implics, wanted_dicts) = partition isImplicInst wanteds'
1888 ; (avails, extra_eqs) <- getLIE (reduceList env wanted_dicts init_state)
1891 dict_irreds) <- extractResults avails wanted_dicts
1892 ; traceTc $ text "reduceContext: extractResults" <+> vcat
1893 [ppr avails, ppr wanted_dicts, ppr dict_binds]
1895 -- Solve the wanted *implications*. In doing so, we can provide
1896 -- as "given" all the dicts that were originally given,
1897 -- *or* for which we now have bindings,
1898 -- *or* which are now irreds
1899 -- NB: Equality irreds need to be converted, as the recursive
1900 -- invocation of the solver will still treat them as wanteds
1902 ; let implic_env = env { red_givens
1903 = givens ++ bound_dicts ++
1904 map wantedToLocalEqInst dict_irreds }
1905 ; (implic_binds_s, implic_irreds_s)
1906 <- mapAndUnzipM (reduceImplication implic_env) wanted_implics
1907 ; let implic_binds = unionManyBags implic_binds_s
1908 implic_irreds = concat implic_irreds_s
1910 -- Collect all irreducible instances, and determine whether we should
1911 -- go round again. We do so in either of two cases:
1912 -- (1) If dictionary reduction or equality solving led to
1913 -- improvement (i.e., instantiated type variables).
1914 -- (2) If we uncovered extra equalities. We will try to solve them
1915 -- in the next iteration.
1916 -- (3) If we reduced dictionaries (i.e., got dictionary bindings),
1917 -- they may have exposed further opportunities to normalise
1918 -- family applications. See Note [Dictionary Improvement]
1920 ; let all_irreds = dict_irreds ++ implic_irreds ++ extra_eqs
1921 avails_improved = availsImproved avails
1922 improvedFlexible = avails_improved || eq_improved
1923 extraEqs = (not . null) extra_eqs
1924 reduced_dicts = not (isEmptyBag dict_binds)
1925 improved = improvedFlexible || extraEqs || reduced_dicts
1927 improvedHint = (if avails_improved then " [AVAILS]" else "") ++
1928 (if eq_improved then " [EQ]" else "") ++
1929 (if extraEqs then " [EXTRA EQS]" else "")
1931 ; traceTc (text "reduceContext end" <+> (vcat [
1932 text "----------------------",
1934 text "given" <+> ppr givens,
1935 text "wanted" <+> ppr wanteds0,
1937 text "avails" <+> pprAvails avails,
1938 text "improved =" <+> ppr improved <+> text improvedHint,
1939 text "(all) irreds = " <+> ppr all_irreds,
1940 text "dict-binds = " <+> ppr dict_binds,
1941 text "implic-binds = " <+> ppr implic_binds,
1942 text "----------------------"
1946 normalise_binds `unionBags` dict_binds
1947 `unionBags` implic_binds,
1951 tcImproveOne :: Avails -> Inst -> TcM ImprovementDone
1952 tcImproveOne avails inst
1953 | not (isDict inst) = return False
1955 = do { inst_envs <- tcGetInstEnvs
1956 ; let eqns = improveOne (classInstances inst_envs)
1957 (dictPred inst, pprInstArising inst)
1958 [ (dictPred p, pprInstArising p)
1959 | p <- availsInsts avails, isDict p ]
1960 -- Avails has all the superclasses etc (good)
1961 -- It also has all the intermediates of the deduction (good)
1962 -- It does not have duplicates (good)
1963 -- NB that (?x::t1) and (?x::t2) will be held separately in
1964 -- avails so that improve will see them separate
1965 ; traceTc (text "improveOne" <+> ppr inst)
1968 unifyEqns :: [(Equation, (PredType, SDoc), (PredType, SDoc))]
1969 -> TcM ImprovementDone
1970 unifyEqns [] = return False
1972 = do { traceTc (ptext (sLit "Improve:") <+> vcat (map pprEquationDoc eqns))
1973 ; improved <- mapM unify eqns
1974 ; return $ or improved
1977 unify ((qtvs, pairs), what1, what2)
1978 = addErrCtxtM (mkEqnMsg what1 what2) $
1979 do { let freeTyVars = unionVarSets (map tvs_pr pairs)
1981 ; (_, _, tenv) <- tcInstTyVars (varSetElems qtvs)
1982 ; mapM_ (unif_pr tenv) pairs
1983 ; anyM isFilledMetaTyVar $ varSetElems freeTyVars
1986 unif_pr tenv (ty1, ty2) = unifyType (substTy tenv ty1) (substTy tenv ty2)
1988 tvs_pr (ty1, ty2) = tyVarsOfType ty1 `unionVarSet` tyVarsOfType ty2
1990 pprEquationDoc :: (Equation, (PredType, SDoc), (PredType, SDoc)) -> SDoc
1991 pprEquationDoc (eqn, (p1, _), (p2, _))
1992 = vcat [pprEquation eqn, nest 2 (ppr p1), nest 2 (ppr p2)]
1994 mkEqnMsg :: (TcPredType, SDoc) -> (TcPredType, SDoc) -> TidyEnv
1995 -> TcM (TidyEnv, SDoc)
1996 mkEqnMsg (pred1,from1) (pred2,from2) tidy_env
1997 = do { pred1' <- zonkTcPredType pred1
1998 ; pred2' <- zonkTcPredType pred2
1999 ; let { pred1'' = tidyPred tidy_env pred1'
2000 ; pred2'' = tidyPred tidy_env pred2' }
2001 ; let msg = vcat [ptext (sLit "When using functional dependencies to combine"),
2002 nest 2 (sep [ppr pred1'' <> comma, nest 2 from1]),
2003 nest 2 (sep [ppr pred2'' <> comma, nest 2 from2])]
2004 ; return (tidy_env, msg) }
2007 Note [Dictionary Improvement]
2008 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2009 In reduceContext, we first reduce equalities and then class constraints.
2010 However, the letter may expose further opportunities for the former. Hence,
2011 we need to go around again if dictionary reduction produced any dictionary
2012 bindings. The following example demonstrated the point:
2014 data EX _x _y (p :: * -> *)
2019 class Base (Def p) => Prop p where
2023 instance Prop () where
2026 instance (Base (Def (p ANY))) => Base (EX _x _y p)
2027 instance (Prop (p ANY)) => Prop (EX _x _y p) where
2028 type Def (EX _x _y p) = EX _x _y p
2031 instance Prop (FOO x) where
2032 type Def (FOO x) = ()
2035 instance Prop BAR where
2036 type Def BAR = EX () () FOO
2038 During checking the last instance declaration, we need to check the superclass
2039 cosntraint Base (Def BAR), which family normalisation reduced to
2040 Base (EX () () FOO). Chasing the instance for Base (EX _x _y p), gives us
2041 Base (Def (FOO ANY)), which again requires family normalisation of Def to
2042 Base () before we can finish.
2045 The main context-reduction function is @reduce@. Here's its game plan.
2048 reduceList :: RedEnv -> [Inst] -> Avails -> TcM Avails
2049 reduceList env@(RedEnv {red_stack = (n,stk)}) wanteds state
2050 = do { traceTc (text "reduceList " <+> (ppr wanteds $$ ppr state))
2052 ; when (debugIsOn && (n > 8)) $ do
2053 debugDumpTcRn (hang (ptext (sLit "Interesting! Context reduction stack depth") <+> int n)
2054 2 (ifPprDebug (nest 2 (pprStack stk))))
2055 ; if n >= ctxtStkDepth dopts then
2056 failWithTc (reduceDepthErr n stk)
2060 go [] state = return state
2061 go (w:ws) state = do { state' <- reduce (env {red_stack = (n+1, w:stk)}) w state
2064 -- Base case: we're done!
2065 reduce :: RedEnv -> Inst -> Avails -> TcM Avails
2066 reduce env wanted avails
2068 -- We don't reduce equalities here (and they must not end up as irreds
2073 -- It's the same as an existing inst, or a superclass thereof
2074 | Just _ <- findAvail avails wanted
2075 = do { traceTc (text "reduce: found " <+> ppr wanted)
2080 = do { traceTc (text "reduce" <+> ppr wanted $$ ppr avails)
2081 ; case red_try_me env wanted of {
2082 Stop -> try_simple (addIrred NoSCs);
2083 -- See Note [No superclasses for Stop]
2085 ReduceMe -> do -- It should be reduced
2086 { (avails, lookup_result) <- reduceInst env avails wanted
2087 ; case lookup_result of
2088 NoInstance -> addIrred AddSCs avails wanted
2089 -- Add it and its superclasses
2091 GenInst [] rhs -> addWanted AddSCs avails wanted rhs []
2093 GenInst wanteds' rhs
2094 -> do { avails1 <- addIrred NoSCs avails wanted
2095 ; avails2 <- reduceList env wanteds' avails1
2096 ; addWanted AddSCs avails2 wanted rhs wanteds' } }
2097 -- Temporarily do addIrred *before* the reduceList,
2098 -- which has the effect of adding the thing we are trying
2099 -- to prove to the database before trying to prove the things it
2100 -- needs. See note [RECURSIVE DICTIONARIES]
2101 -- NB: we must not do an addWanted before, because that adds the
2102 -- superclasses too, and that can lead to a spurious loop; see
2103 -- the examples in [SUPERCLASS-LOOP]
2104 -- So we do an addIrred before, and then overwrite it afterwards with addWanted
2107 -- First, see if the inst can be reduced to a constant in one step
2108 -- Works well for literals (1::Int) and constant dictionaries (d::Num Int)
2109 -- Don't bother for implication constraints, which take real work
2110 try_simple do_this_otherwise
2111 = do { res <- lookupSimpleInst wanted
2113 GenInst [] rhs -> addWanted AddSCs avails wanted rhs []
2114 _ -> do_this_otherwise avails wanted }
2118 Note [RECURSIVE DICTIONARIES]
2119 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2121 data D r = ZeroD | SuccD (r (D r));
2123 instance (Eq (r (D r))) => Eq (D r) where
2124 ZeroD == ZeroD = True
2125 (SuccD a) == (SuccD b) = a == b
2128 equalDC :: D [] -> D [] -> Bool;
2131 We need to prove (Eq (D [])). Here's how we go:
2135 by instance decl, holds if
2139 by instance decl of Eq, holds if
2141 where d2 = dfEqList d3
2144 But now we can "tie the knot" to give
2150 and it'll even run! The trick is to put the thing we are trying to prove
2151 (in this case Eq (D []) into the database before trying to prove its
2152 contributing clauses.
2154 Note [SUPERCLASS-LOOP 2]
2155 ~~~~~~~~~~~~~~~~~~~~~~~~
2156 We need to be careful when adding "the constaint we are trying to prove".
2157 Suppose we are *given* d1:Ord a, and want to deduce (d2:C [a]) where
2159 class Ord a => C a where
2160 instance Ord [a] => C [a] where ...
2162 Then we'll use the instance decl to deduce C [a] from Ord [a], and then add the
2163 superclasses of C [a] to avails. But we must not overwrite the binding
2164 for Ord [a] (which is obtained from Ord a) with a superclass selection or we'll just
2167 Here's another variant, immortalised in tcrun020
2168 class Monad m => C1 m
2169 class C1 m => C2 m x
2170 instance C2 Maybe Bool
2171 For the instance decl we need to build (C1 Maybe), and it's no good if
2172 we run around and add (C2 Maybe Bool) and its superclasses to the avails
2173 before we search for C1 Maybe.
2175 Here's another example
2176 class Eq b => Foo a b
2177 instance Eq a => Foo [a] a
2181 we'll first deduce that it holds (via the instance decl). We must not
2182 then overwrite the Eq t constraint with a superclass selection!
2184 At first I had a gross hack, whereby I simply did not add superclass constraints
2185 in addWanted, though I did for addGiven and addIrred. This was sub-optimal,
2186 becuase it lost legitimate superclass sharing, and it still didn't do the job:
2187 I found a very obscure program (now tcrun021) in which improvement meant the
2188 simplifier got two bites a the cherry... so something seemed to be an Stop
2189 first time, but reducible next time.
2191 Now we implement the Right Solution, which is to check for loops directly
2192 when adding superclasses. It's a bit like the occurs check in unification.
2196 %************************************************************************
2198 Reducing a single constraint
2200 %************************************************************************
2203 ---------------------------------------------
2204 reduceInst :: RedEnv -> Avails -> Inst -> TcM (Avails, LookupInstResult)
2205 reduceInst _ avails other_inst
2206 = do { result <- lookupSimpleInst other_inst
2207 ; return (avails, result) }
2210 Note [Equational Constraints in Implication Constraints]
2211 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2213 An implication constraint is of the form
2215 where Given and Wanted may contain both equational and dictionary
2216 constraints. The delay and reduction of these two kinds of constraints
2219 -) In the generated code, wanted Dictionary constraints are wrapped up in an
2220 implication constraint that is created at the code site where the wanted
2221 dictionaries can be reduced via a let-binding. This let-bound implication
2222 constraint is deconstructed at the use-site of the wanted dictionaries.
2224 -) While the reduction of equational constraints is also delayed, the delay
2225 is not manifest in the generated code. The required evidence is generated
2226 in the code directly at the use-site. There is no let-binding and deconstruction
2227 necessary. The main disadvantage is that we cannot exploit sharing as the
2228 same evidence may be generated at multiple use-sites. However, this disadvantage
2229 is limited because it only concerns coercions which are erased.
2231 The different treatment is motivated by the different in representation. Dictionary
2232 constraints require manifest runtime dictionaries, while equations require coercions
2236 ---------------------------------------------
2237 reduceImplication :: RedEnv
2239 -> TcM (TcDictBinds, [Inst])
2242 Suppose we are simplifying the constraint
2243 forall bs. extras => wanted
2244 in the context of an overall simplification problem with givens 'givens'.
2247 * The 'givens' need not mention any of the quantified type variables
2248 e.g. forall {}. Eq a => Eq [a]
2249 forall {}. C Int => D (Tree Int)
2251 This happens when you have something like
2253 T1 :: Eq a => a -> T a
2256 f x = ...(case x of { T1 v -> v==v })...
2259 -- ToDo: should we instantiate tvs? I think it's not necessary
2261 -- Note on coercion variables:
2263 -- The extra given coercion variables are bound at two different
2266 -- -) in the creation context of the implication constraint
2267 -- the solved equational constraints use these binders
2269 -- -) at the solving site of the implication constraint
2270 -- the solved dictionaries use these binders;
2271 -- these binders are generated by reduceImplication
2273 -- Note [Binders for equalities]
2274 -- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2275 -- To reuse the binders of local/given equalities in the binders of
2276 -- implication constraints, it is crucial that these given equalities
2277 -- always have the form
2279 -- where cotv is a simple coercion type variable (and not a more
2280 -- complex coercion term). We require that the extra_givens always
2281 -- have this form and exploit the special form when generating binders.
2282 reduceImplication env
2283 orig_implic@(ImplicInst { tci_name = name, tci_loc = inst_loc,
2285 tci_given = extra_givens, tci_wanted = wanteds
2287 = do { -- Solve the sub-problem
2288 ; let try_me _ = ReduceMe -- Note [Freeness and implications]
2289 env' = env { red_givens = extra_givens ++ red_givens env
2290 , red_doc = sep [ptext (sLit "reduceImplication for")
2292 nest 2 (parens $ ptext (sLit "within")
2294 , red_try_me = try_me }
2296 ; traceTc (text "reduceImplication" <+> vcat
2297 [ ppr (red_givens env), ppr extra_givens,
2299 ; (irreds, binds) <- checkLoop env' wanteds
2301 ; traceTc (text "reduceImplication result" <+> vcat
2302 [ppr irreds, ppr binds])
2304 ; -- extract superclass binds
2305 -- (sc_binds,_) <- extractResults avails []
2306 -- ; traceTc (text "reduceImplication sc_binds" <+> vcat
2307 -- [ppr sc_binds, ppr avails])
2310 -- SLPJ Sept 07: what if improvement happened inside the checkLoop?
2311 -- Then we must iterate the outer loop too!
2313 ; didntSolveWantedEqs <- allM wantedEqInstIsUnsolved wanteds
2314 -- we solve wanted eqs by side effect!
2316 -- Progress is no longer measered by the number of bindings
2317 -- If there are any irreds, but no bindings and no solved
2318 -- equalities, we back off and do nothing
2319 ; let backOff = isEmptyLHsBinds binds && -- no new bindings
2320 (not $ null irreds) && -- but still some irreds
2321 didntSolveWantedEqs -- no instantiated cotv
2323 ; if backOff then -- No progress
2324 return (emptyBag, [orig_implic])
2326 { (simpler_implic_insts, bind)
2327 <- makeImplicationBind inst_loc tvs extra_givens irreds
2328 -- This binding is useless if the recursive simplification
2329 -- made no progress; but currently we don't try to optimise that
2330 -- case. After all, we only try hard to reduce at top level, or
2331 -- when inferring types.
2333 ; let -- extract Id binders for dicts and CoTyVar binders for eqs;
2334 -- see Note [Binders for equalities]
2335 (extra_eq_givens, extra_dict_givens) = partition isEqInst
2337 eq_cotvs = map instToVar extra_eq_givens
2338 dict_ids = map instToId extra_dict_givens
2340 -- Note [Always inline implication constraints]
2341 wrap_inline | null dict_ids = idHsWrapper
2342 | otherwise = WpInline
2345 <.> mkWpTyLams eq_cotvs
2346 <.> mkWpLams dict_ids
2347 <.> WpLet (binds `unionBags` bind)
2348 rhs = mkLHsWrap co payload
2349 loc = instLocSpan inst_loc
2350 -- wanted equalities are solved by updating their
2351 -- cotv; we don't generate bindings for them
2352 dict_bndrs = map (L loc . HsVar . instToId)
2353 . filter (not . isEqInst)
2355 payload = mkBigLHsTup dict_bndrs
2358 ; traceTc (vcat [text "reduceImplication" <+> ppr name,
2359 ppr simpler_implic_insts,
2360 text "->" <+> ppr rhs])
2361 ; return (unitBag (L loc (VarBind (instToId orig_implic) rhs)),
2362 simpler_implic_insts)
2365 reduceImplication _ i = pprPanic "reduceImplication" (ppr i)
2368 Note [Always inline implication constraints]
2369 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2370 Suppose an implication constraint floats out of an INLINE function.
2371 Then although the implication has a single call site, it won't be
2372 inlined. And that is bad because it means that even if there is really
2373 *no* overloading (type signatures specify the exact types) there will
2374 still be dictionary passing in the resulting code. To avert this,
2375 we mark the implication constraints themselves as INLINE, at least when
2376 there is no loss of sharing as a result.
2378 Note [Freeness and implications]
2379 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2380 It's hard to say when an implication constraint can be floated out. Consider
2381 forall {} Eq a => Foo [a]
2382 The (Foo [a]) doesn't mention any of the quantified variables, but it
2383 still might be partially satisfied by the (Eq a).
2385 There is a useful special case when it *is* easy to partition the
2386 constraints, namely when there are no 'givens'. Consider
2387 forall {a}. () => Bar b
2388 There are no 'givens', and so there is no reason to capture (Bar b).
2389 We can let it float out. But if there is even one constraint we
2390 must be much more careful:
2391 forall {a}. C a b => Bar (m b)
2392 because (C a b) might have a superclass (D b), from which we might
2393 deduce (Bar [b]) when m later gets instantiated to []. Ha!
2395 Here is an even more exotic example
2397 Now consider the constraint
2398 forall b. D Int b => C Int
2399 We can satisfy the (C Int) from the superclass of D, so we don't want
2400 to float the (C Int) out, even though it mentions no type variable in
2403 One more example: the constraint
2405 instance (C a, E c) => E (a,c)
2407 constraint: forall b. D Int b => E (Int,c)
2409 You might think that the (D Int b) can't possibly contribute
2410 to solving (E (Int,c)), since the latter mentions 'c'. But
2411 in fact it can, because solving the (E (Int,c)) constraint needs
2414 and the (C Int) can be satisfied from the superclass of (D Int b).
2415 So we must still not float (E (Int,c)) out.
2417 To think about: special cases for unary type classes?
2419 Note [Pruning the givens in an implication constraint]
2420 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2421 Suppose we are about to form the implication constraint
2422 forall tvs. Eq a => Ord b
2423 The (Eq a) cannot contribute to the (Ord b), because it has no access to
2424 the type variable 'b'. So we could filter out the (Eq a) from the givens.
2425 But BE CAREFUL of the examples above in [Freeness and implications].
2427 Doing so would be a bit tidier, but all the implication constraints get
2428 simplified away by the optimiser, so it's no great win. So I don't take
2429 advantage of that at the moment.
2431 If you do, BE CAREFUL of wobbly type variables.
2434 %************************************************************************
2436 Avails and AvailHow: the pool of evidence
2438 %************************************************************************
2442 data Avails = Avails !ImprovementDone !AvailEnv
2444 type ImprovementDone = Bool -- True <=> some unification has happened
2445 -- so some Irreds might now be reducible
2446 -- keys that are now
2448 type AvailEnv = FiniteMap Inst AvailHow
2450 = IsIrred -- Used for irreducible dictionaries,
2451 -- which are going to be lambda bound
2453 | Given Inst -- Used for dictionaries for which we have a binding
2454 -- e.g. those "given" in a signature
2456 | Rhs -- Used when there is a RHS
2457 (LHsExpr TcId) -- The RHS
2458 [Inst] -- Insts free in the RHS; we need these too
2460 instance Outputable Avails where
2463 pprAvails :: Avails -> SDoc
2464 pprAvails (Avails imp avails)
2465 = vcat [ ptext (sLit "Avails") <> (if imp then ptext (sLit "[improved]") else empty)
2467 vcat [ sep [ppr inst, nest 2 (equals <+> ppr avail)]
2468 | (inst,avail) <- fmToList avails ]]
2470 instance Outputable AvailHow where
2473 -------------------------
2474 pprAvail :: AvailHow -> SDoc
2475 pprAvail IsIrred = text "Irred"
2476 pprAvail (Given x) = text "Given" <+> ppr x
2477 pprAvail (Rhs rhs bs) = sep [text "Rhs" <+> ppr bs,
2480 -------------------------
2481 extendAvailEnv :: AvailEnv -> Inst -> AvailHow -> AvailEnv
2482 extendAvailEnv env inst avail = addToFM env inst avail
2484 findAvailEnv :: AvailEnv -> Inst -> Maybe AvailHow
2485 findAvailEnv env wanted = lookupFM env wanted
2486 -- NB 1: the Ord instance of Inst compares by the class/type info
2487 -- *not* by unique. So
2488 -- d1::C Int == d2::C Int
2490 emptyAvails :: Avails
2491 emptyAvails = Avails False emptyFM
2493 findAvail :: Avails -> Inst -> Maybe AvailHow
2494 findAvail (Avails _ avails) wanted = findAvailEnv avails wanted
2496 elemAvails :: Inst -> Avails -> Bool
2497 elemAvails wanted (Avails _ avails) = wanted `elemFM` avails
2499 extendAvails :: Avails -> Inst -> AvailHow -> TcM Avails
2501 extendAvails avails@(Avails imp env) inst avail
2502 = do { imp1 <- tcImproveOne avails inst -- Do any improvement
2503 ; return (Avails (imp || imp1) (extendAvailEnv env inst avail)) }
2505 availsInsts :: Avails -> [Inst]
2506 availsInsts (Avails _ avails) = keysFM avails
2508 availsImproved :: Avails -> ImprovementDone
2509 availsImproved (Avails imp _) = imp
2512 Extracting the bindings from a bunch of Avails.
2513 The bindings do *not* come back sorted in dependency order.
2514 We assume that they'll be wrapped in a big Rec, so that the
2515 dependency analyser can sort them out later
2518 type DoneEnv = FiniteMap Inst [Id]
2519 -- Tracks which things we have evidence for
2521 extractResults :: Avails
2523 -> TcM (TcDictBinds, -- Bindings
2524 [Inst], -- The insts bound by the bindings
2525 [Inst]) -- Irreducible ones
2526 -- Note [Reducing implication constraints]
2528 extractResults (Avails _ avails) wanteds
2529 = go emptyBag [] [] emptyFM wanteds
2531 go :: TcDictBinds -- Bindings for dicts
2532 -> [Inst] -- Bound by the bindings
2534 -> DoneEnv -- Has an entry for each inst in the above three sets
2536 -> TcM (TcDictBinds, [Inst], [Inst])
2537 go binds bound_dicts irreds _ []
2538 = return (binds, bound_dicts, irreds)
2540 go binds bound_dicts irreds done (w:ws)
2542 = go binds bound_dicts (w:irreds) done' ws
2544 | Just done_ids@(done_id : rest_done_ids) <- lookupFM done w
2545 = if w_id `elem` done_ids then
2546 go binds bound_dicts irreds done ws
2548 go (add_bind (nlHsVar done_id)) bound_dicts irreds
2549 (addToFM done w (done_id : w_id : rest_done_ids)) ws
2551 | otherwise -- Not yet done
2552 = case findAvailEnv avails w of
2553 Nothing -> pprTrace "Urk: extractResults" (ppr w) $
2554 go binds bound_dicts irreds done ws
2556 Just IsIrred -> go binds bound_dicts (w:irreds) done' ws
2558 Just (Rhs rhs ws') -> go (add_bind rhs) (w:bound_dicts) irreds done' (ws' ++ ws)
2560 Just (Given g) -> go binds' bound_dicts irreds (addToFM done w [g_id]) ws
2563 binds' | w_id == g_id = binds
2564 | otherwise = add_bind (nlHsVar g_id)
2567 done' = addToFM done w [w_id]
2568 add_bind rhs = addInstToDictBind binds w rhs
2572 Note [No superclasses for Stop]
2573 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2574 When we decide not to reduce an Inst -- the 'WhatToDo' --- we still
2575 add it to avails, so that any other equal Insts will be commoned up
2576 right here. However, we do *not* add superclasses. If we have
2579 but a is not bound here, then we *don't* want to derive dn from df
2580 here lest we lose sharing.
2583 addWanted :: WantSCs -> Avails -> Inst -> LHsExpr TcId -> [Inst] -> TcM Avails
2584 addWanted want_scs avails wanted rhs_expr wanteds
2585 = addAvailAndSCs want_scs avails wanted avail
2587 avail = Rhs rhs_expr wanteds
2589 addGiven :: (Inst -> WantSCs) -> Avails -> Inst -> TcM Avails
2590 addGiven want_scs avails given = addAvailAndSCs (want_scs given) avails given (Given given)
2591 -- Conditionally add superclasses for 'givens'
2592 -- See Note [Recursive instances and superclases]
2594 -- No ASSERT( not (given `elemAvails` avails) ) because in an instance
2595 -- decl for Ord t we can add both Ord t and Eq t as 'givens',
2596 -- so the assert isn't true
2600 addIrred :: WantSCs -> Avails -> Inst -> TcM Avails
2601 addIrred want_scs avails irred = ASSERT2( not (irred `elemAvails` avails), ppr irred $$ ppr avails )
2602 addAvailAndSCs want_scs avails irred IsIrred
2604 addAvailAndSCs :: WantSCs -> Avails -> Inst -> AvailHow -> TcM Avails
2605 addAvailAndSCs want_scs avails inst avail
2606 | not (isClassDict inst) = extendAvails avails inst avail
2607 | NoSCs <- want_scs = extendAvails avails inst avail
2608 | otherwise = do { traceTc (text "addAvailAndSCs" <+> vcat [ppr inst, ppr deps])
2609 ; avails' <- extendAvails avails inst avail
2610 ; addSCs is_loop avails' inst }
2612 is_loop pred = any (`tcEqType` mkPredTy pred) dep_tys
2613 -- Note: this compares by *type*, not by Unique
2614 deps = findAllDeps (unitVarSet (instToVar inst)) avail
2615 dep_tys = map idType (varSetElems deps)
2617 findAllDeps :: IdSet -> AvailHow -> IdSet
2618 -- Find all the Insts that this one depends on
2619 -- See Note [SUPERCLASS-LOOP 2]
2620 -- Watch out, though. Since the avails may contain loops
2621 -- (see Note [RECURSIVE DICTIONARIES]), so we need to track the ones we've seen so far
2622 findAllDeps so_far (Rhs _ kids) = foldl find_all so_far kids
2623 findAllDeps so_far _ = so_far
2625 find_all :: IdSet -> Inst -> IdSet
2627 | isEqInst kid = so_far
2628 | kid_id `elemVarSet` so_far = so_far
2629 | Just avail <- findAvail avails kid = findAllDeps so_far' avail
2630 | otherwise = so_far'
2632 so_far' = extendVarSet so_far kid_id -- Add the new kid to so_far
2633 kid_id = instToId kid
2635 addSCs :: (TcPredType -> Bool) -> Avails -> Inst -> TcM Avails
2636 -- Add all the superclasses of the Inst to Avails
2637 -- The first param says "don't do this because the original thing
2638 -- depends on this one, so you'd build a loop"
2639 -- Invariant: the Inst is already in Avails.
2641 addSCs is_loop avails dict
2642 = ASSERT( isDict dict )
2643 do { sc_dicts <- newDictBndrs (instLoc dict) sc_theta'
2644 ; foldlM add_sc avails (zipEqual "add_scs" sc_dicts sc_sels) }
2646 (clas, tys) = getDictClassTys dict
2647 (tyvars, sc_theta, sc_sels, _) = classBigSig clas
2648 sc_theta' = filter (not . isEqPred) $
2649 substTheta (zipTopTvSubst tyvars tys) sc_theta
2651 add_sc avails (sc_dict, sc_sel)
2652 | is_loop (dictPred sc_dict) = return avails -- See Note [SUPERCLASS-LOOP 2]
2653 | is_given sc_dict = return avails
2654 | otherwise = do { avails' <- extendAvails avails sc_dict (Rhs sc_sel_rhs [dict])
2655 ; addSCs is_loop avails' sc_dict }
2657 sc_sel_rhs = L (instSpan dict) (HsWrap co_fn (HsVar sc_sel))
2658 co_fn = WpApp (instToVar dict) <.> mkWpTyApps tys
2660 is_given :: Inst -> Bool
2661 is_given sc_dict = case findAvail avails sc_dict of
2662 Just (Given _) -> True -- Given is cheaper than superclass selection
2665 -- From the a set of insts obtain all equalities that (transitively) occur in
2666 -- superclass contexts of class constraints (aka the ancestor equalities).
2668 ancestorEqualities :: [Inst] -> TcM [Inst]
2670 = mapM mkWantedEqInst -- turn only equality predicates..
2671 . filter isEqPred -- ..into wanted equality insts
2673 . addAEsToBag emptyBag -- collect the superclass constraints..
2674 . map dictPred -- ..of all predicates in a bag
2675 . filter isClassDict
2677 addAEsToBag :: Bag PredType -> [PredType] -> Bag PredType
2678 addAEsToBag bag [] = bag
2679 addAEsToBag bag (pred:preds)
2680 | pred `elemBag` bag = addAEsToBag bag preds
2681 | isEqPred pred = addAEsToBag bagWithPred preds
2682 | isClassPred pred = addAEsToBag bagWithPred predsWithSCs
2683 | otherwise = addAEsToBag bag preds
2685 bagWithPred = bag `snocBag` pred
2686 predsWithSCs = preds ++ substTheta (zipTopTvSubst tyvars tys) sc_theta
2688 (tyvars, sc_theta, _, _) = classBigSig clas
2689 (clas, tys) = getClassPredTys pred
2693 %************************************************************************
2695 \section{tcSimplifyTop: defaulting}
2697 %************************************************************************
2700 @tcSimplifyTop@ is called once per module to simplify all the constant
2701 and ambiguous Insts.
2703 We need to be careful of one case. Suppose we have
2705 instance Num a => Num (Foo a b) where ...
2707 and @tcSimplifyTop@ is given a constraint (Num (Foo x y)). Then it'll simplify
2708 to (Num x), and default x to Int. But what about y??
2710 It's OK: the final zonking stage should zap y to (), which is fine.
2714 tcSimplifyTop, tcSimplifyInteractive :: [Inst] -> TcM TcDictBinds
2715 tcSimplifyTop wanteds
2716 = tc_simplify_top doc False wanteds
2718 doc = text "tcSimplifyTop"
2720 tcSimplifyInteractive wanteds
2721 = tc_simplify_top doc True wanteds
2723 doc = text "tcSimplifyInteractive"
2725 -- The TcLclEnv should be valid here, solely to improve
2726 -- error message generation for the monomorphism restriction
2727 tc_simplify_top :: SDoc -> Bool -> [Inst] -> TcM (Bag (LHsBind TcId))
2728 tc_simplify_top doc interactive wanteds
2729 = do { dflags <- getDOpts
2730 ; wanteds <- zonkInsts wanteds
2731 ; mapM_ zonkTopTyVar (varSetElems (tyVarsOfInsts wanteds))
2733 ; traceTc (text "tc_simplify_top 0: " <+> ppr wanteds)
2734 ; (irreds1, binds1) <- tryHardCheckLoop doc1 wanteds
2735 -- ; (irreds1, binds1) <- gentleInferLoop doc1 wanteds
2736 ; traceTc (text "tc_simplify_top 1: " <+> ppr irreds1)
2737 ; (irreds2, binds2) <- approximateImplications doc2 (\_ -> True) irreds1
2738 ; traceTc (text "tc_simplify_top 2: " <+> ppr irreds2)
2740 -- Use the defaulting rules to do extra unification
2741 -- NB: irreds2 are already zonked
2742 ; (irreds3, binds3) <- disambiguate doc3 interactive dflags irreds2
2744 -- Deal with implicit parameters
2745 ; let (bad_ips, non_ips) = partition isIPDict irreds3
2746 (ambigs, others) = partition isTyVarDict non_ips
2748 ; topIPErrs bad_ips -- Can arise from f :: Int -> Int
2750 ; addNoInstanceErrs others
2751 ; addTopAmbigErrs ambigs
2753 ; return (binds1 `unionBags` binds2 `unionBags` binds3) }
2755 doc1 = doc <+> ptext (sLit "(first round)")
2756 doc2 = doc <+> ptext (sLit "(approximate)")
2757 doc3 = doc <+> ptext (sLit "(disambiguate)")
2760 If a dictionary constrains a type variable which is
2761 * not mentioned in the environment
2762 * and not mentioned in the type of the expression
2763 then it is ambiguous. No further information will arise to instantiate
2764 the type variable; nor will it be generalised and turned into an extra
2765 parameter to a function.
2767 It is an error for this to occur, except that Haskell provided for
2768 certain rules to be applied in the special case of numeric types.
2770 * at least one of its classes is a numeric class, and
2771 * all of its classes are numeric or standard
2772 then the type variable can be defaulted to the first type in the
2773 default-type list which is an instance of all the offending classes.
2775 So here is the function which does the work. It takes the ambiguous
2776 dictionaries and either resolves them (producing bindings) or
2777 complains. It works by splitting the dictionary list by type
2778 variable, and using @disambigOne@ to do the real business.
2780 @disambigOne@ assumes that its arguments dictionaries constrain all
2781 the same type variable.
2783 ADR Comment 20/6/94: I've changed the @CReturnable@ case to default to
2784 @()@ instead of @Int@. I reckon this is the Right Thing to do since
2785 the most common use of defaulting is code like:
2787 _ccall_ foo `seqPrimIO` bar
2789 Since we're not using the result of @foo@, the result if (presumably)
2793 disambiguate :: SDoc -> Bool -> DynFlags -> [Inst] -> TcM ([Inst], TcDictBinds)
2794 -- Just does unification to fix the default types
2795 -- The Insts are assumed to be pre-zonked
2796 disambiguate doc interactive dflags insts
2798 = return (insts, emptyBag)
2800 | null defaultable_groups
2801 = do { traceTc (text "disambigutate, no defaultable groups" <+> vcat [ppr unaries, ppr insts, ppr bad_tvs, ppr defaultable_groups])
2802 ; return (insts, emptyBag) }
2805 = do { -- Figure out what default types to use
2806 default_tys <- getDefaultTys extended_defaulting ovl_strings
2808 ; traceTc (text "disambiguate1" <+> vcat [ppr insts, ppr unaries, ppr bad_tvs, ppr defaultable_groups])
2809 ; mapM_ (disambigGroup default_tys) defaultable_groups
2811 -- disambigGroup does unification, hence try again
2812 ; tryHardCheckLoop doc insts }
2815 extended_defaulting = interactive || dopt Opt_ExtendedDefaultRules dflags
2816 ovl_strings = dopt Opt_OverloadedStrings dflags
2818 unaries :: [(Inst, Class, TcTyVar)] -- (C tv) constraints
2819 bad_tvs :: TcTyVarSet -- Tyvars mentioned by *other* constraints
2820 (unaries, bad_tvs_s) = partitionWith find_unary insts
2821 bad_tvs = unionVarSets bad_tvs_s
2823 -- Finds unary type-class constraints
2824 find_unary d@(Dict {tci_pred = ClassP cls [ty]})
2825 | Just tv <- tcGetTyVar_maybe ty = Left (d,cls,tv)
2826 find_unary inst = Right (tyVarsOfInst inst)
2828 -- Group by type variable
2829 defaultable_groups :: [[(Inst,Class,TcTyVar)]]
2830 defaultable_groups = filter defaultable_group (equivClasses cmp_tv unaries)
2831 cmp_tv (_,_,tv1) (_,_,tv2) = tv1 `compare` tv2
2833 defaultable_group :: [(Inst,Class,TcTyVar)] -> Bool
2834 defaultable_group ds@((_,_,tv):_)
2835 = isTyConableTyVar tv -- Note [Avoiding spurious errors]
2836 && not (tv `elemVarSet` bad_tvs)
2837 && defaultable_classes [c | (_,c,_) <- ds]
2838 defaultable_group [] = panic "defaultable_group"
2840 defaultable_classes clss
2841 | extended_defaulting = any isInteractiveClass clss
2842 | otherwise = all is_std_class clss && (any is_num_class clss)
2844 -- In interactive mode, or with -XExtendedDefaultRules,
2845 -- we default Show a to Show () to avoid graututious errors on "show []"
2846 isInteractiveClass cls
2847 = is_num_class cls || (classKey cls `elem` [showClassKey, eqClassKey, ordClassKey])
2849 is_num_class cls = isNumericClass cls || (ovl_strings && (cls `hasKey` isStringClassKey))
2850 -- is_num_class adds IsString to the standard numeric classes,
2851 -- when -foverloaded-strings is enabled
2853 is_std_class cls = isStandardClass cls || (ovl_strings && (cls `hasKey` isStringClassKey))
2854 -- Similarly is_std_class
2856 -----------------------
2857 disambigGroup :: [Type] -- The default types
2858 -> [(Inst,Class,TcTyVar)] -- All standard classes of form (C a)
2859 -> TcM () -- Just does unification, to fix the default types
2861 disambigGroup default_tys dicts
2862 = try_default default_tys
2864 (_,_,tyvar) = ASSERT(not (null dicts)) head dicts -- Should be non-empty
2865 classes = [c | (_,c,_) <- dicts]
2867 try_default [] = return ()
2868 try_default (default_ty : default_tys)
2869 = tryTcLIE_ (try_default default_tys) $
2870 do { tcSimplifyDefault [mkClassPred clas [default_ty] | clas <- classes]
2871 -- This may fail; then the tryTcLIE_ kicks in
2872 -- Failure here is caused by there being no type in the
2873 -- default list which can satisfy all the ambiguous classes.
2874 -- For example, if Real a is reqd, but the only type in the
2875 -- default list is Int.
2877 -- After this we can't fail
2878 ; warnDefault dicts default_ty
2879 ; unifyType default_ty (mkTyVarTy tyvar)
2880 ; return () -- TOMDO: do something with the coercion
2884 -----------------------
2885 getDefaultTys :: Bool -> Bool -> TcM [Type]
2886 getDefaultTys extended_deflts ovl_strings
2887 = do { mb_defaults <- getDeclaredDefaultTys
2888 ; case mb_defaults of {
2889 Just tys -> return tys ; -- User-supplied defaults
2892 -- No use-supplied default
2893 -- Use [Integer, Double], plus modifications
2894 { integer_ty <- tcMetaTy integerTyConName
2895 ; checkWiredInTyCon doubleTyCon
2896 ; string_ty <- tcMetaTy stringTyConName
2897 ; return (opt_deflt extended_deflts unitTy
2898 -- Note [Default unitTy]
2900 [integer_ty,doubleTy]
2902 opt_deflt ovl_strings string_ty) } } }
2904 opt_deflt True ty = [ty]
2905 opt_deflt False _ = []
2908 Note [Default unitTy]
2909 ~~~~~~~~~~~~~~~~~~~~~
2910 In interative mode (or with -XExtendedDefaultRules) we add () as the first type we
2911 try when defaulting. This has very little real impact, except in the following case.
2913 Text.Printf.printf "hello"
2914 This has type (forall a. IO a); it prints "hello", and returns 'undefined'. We don't
2915 want the GHCi repl loop to try to print that 'undefined'. The neatest thing is to
2916 default the 'a' to (), rather than to Integer (which is what would otherwise happen;
2917 and then GHCi doesn't attempt to print the (). So in interactive mode, we add
2918 () to the list of defaulting types. See Trac #1200.
2920 Note [Avoiding spurious errors]
2921 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2922 When doing the unification for defaulting, we check for skolem
2923 type variables, and simply don't default them. For example:
2924 f = (*) -- Monomorphic
2925 g :: Num a => a -> a
2927 Here, we get a complaint when checking the type signature for g,
2928 that g isn't polymorphic enough; but then we get another one when
2929 dealing with the (Num a) context arising from f's definition;
2930 we try to unify a with Int (to default it), but find that it's
2931 already been unified with the rigid variable from g's type sig
2934 %************************************************************************
2936 \subsection[simple]{@Simple@ versions}
2938 %************************************************************************
2940 Much simpler versions when there are no bindings to make!
2942 @tcSimplifyThetas@ simplifies class-type constraints formed by
2943 @deriving@ declarations and when specialising instances. We are
2944 only interested in the simplified bunch of class/type constraints.
2946 It simplifies to constraints of the form (C a b c) where
2947 a,b,c are type variables. This is required for the context of
2948 instance declarations.
2951 tcSimplifyDeriv :: InstOrigin
2953 -> ThetaType -- Wanted
2954 -> TcM ThetaType -- Needed
2955 -- Given instance (wanted) => C inst_ty
2956 -- Simplify 'wanted' as much as possible
2958 tcSimplifyDeriv orig tyvars theta
2959 = do { (tvs, _, tenv) <- tcInstTyVars tyvars
2960 -- The main loop may do unification, and that may crash if
2961 -- it doesn't see a TcTyVar, so we have to instantiate. Sigh
2962 -- ToDo: what if two of them do get unified?
2963 ; wanteds <- newDictBndrsO orig (substTheta tenv theta)
2964 ; (irreds, _) <- tryHardCheckLoop doc wanteds
2966 ; let (tv_dicts, others) = partition ok irreds
2967 ; addNoInstanceErrs others
2968 -- See Note [Exotic derived instance contexts] in TcMType
2970 ; let rev_env = zipTopTvSubst tvs (mkTyVarTys tyvars)
2971 simpl_theta = substTheta rev_env (map dictPred tv_dicts)
2972 -- This reverse-mapping is a pain, but the result
2973 -- should mention the original TyVars not TcTyVars
2975 ; return simpl_theta }
2977 doc = ptext (sLit "deriving classes for a data type")
2979 ok dict | isDict dict = validDerivPred (dictPred dict)
2984 @tcSimplifyDefault@ just checks class-type constraints, essentially;
2985 used with \tr{default} declarations. We are only interested in
2986 whether it worked or not.
2989 tcSimplifyDefault :: ThetaType -- Wanted; has no type variables in it
2992 tcSimplifyDefault theta = do
2993 wanteds <- newDictBndrsO DefaultOrigin theta
2994 (irreds, _) <- tryHardCheckLoop doc wanteds
2995 addNoInstanceErrs irreds
2999 traceTc (ptext (sLit "tcSimplifyDefault failing")) >> failM
3001 doc = ptext (sLit "default declaration")
3005 %************************************************************************
3007 \section{Errors and contexts}
3009 %************************************************************************
3011 ToDo: for these error messages, should we note the location as coming
3012 from the insts, or just whatever seems to be around in the monad just
3016 groupErrs :: ([Inst] -> TcM ()) -- Deal with one group
3017 -> [Inst] -- The offending Insts
3019 -- Group together insts with the same origin
3020 -- We want to report them together in error messages
3024 groupErrs report_err (inst:insts)
3025 = do { do_one (inst:friends)
3026 ; groupErrs report_err others }
3028 -- (It may seem a bit crude to compare the error messages,
3029 -- but it makes sure that we combine just what the user sees,
3030 -- and it avoids need equality on InstLocs.)
3031 (friends, others) = partition is_friend insts
3032 loc_msg = showSDoc (pprInstLoc (instLoc inst))
3033 is_friend friend = showSDoc (pprInstLoc (instLoc friend)) == loc_msg
3034 do_one insts = addInstCtxt (instLoc (head insts)) (report_err insts)
3035 -- Add location and context information derived from the Insts
3037 -- Add the "arising from..." part to a message about bunch of dicts
3038 addInstLoc :: [Inst] -> Message -> Message
3039 addInstLoc insts msg = msg $$ nest 2 (pprInstArising (head insts))
3041 addTopIPErrs :: [Name] -> [Inst] -> TcM ()
3044 addTopIPErrs bndrs ips
3045 = do { dflags <- getDOpts
3046 ; addErrTcM (tidy_env, mk_msg dflags tidy_ips) }
3048 (tidy_env, tidy_ips) = tidyInsts ips
3050 = vcat [sep [ptext (sLit "Implicit parameters escape from"),
3051 nest 2 (ptext (sLit "the monomorphic top-level binding")
3052 <> plural bndrs <+> ptext (sLit "of")
3053 <+> pprBinders bndrs <> colon)],
3054 nest 2 (vcat (map ppr_ip ips)),
3055 monomorphism_fix dflags]
3056 ppr_ip ip = pprPred (dictPred ip) <+> pprInstArising ip
3058 topIPErrs :: [Inst] -> TcM ()
3060 = groupErrs report tidy_dicts
3062 (tidy_env, tidy_dicts) = tidyInsts dicts
3063 report dicts = addErrTcM (tidy_env, mk_msg dicts)
3064 mk_msg dicts = addInstLoc dicts (ptext (sLit "Unbound implicit parameter") <>
3065 plural tidy_dicts <+> pprDictsTheta tidy_dicts)
3067 addNoInstanceErrs :: [Inst] -- Wanted (can include implications)
3069 addNoInstanceErrs insts
3070 = do { let (tidy_env, tidy_insts) = tidyInsts insts
3071 ; reportNoInstances tidy_env Nothing tidy_insts }
3075 -> Maybe (InstLoc, [Inst]) -- Context
3076 -- Nothing => top level
3077 -- Just (d,g) => d describes the construct
3079 -> [Inst] -- What is wanted (can include implications)
3082 reportNoInstances tidy_env mb_what insts
3083 = groupErrs (report_no_instances tidy_env mb_what) insts
3085 report_no_instances :: TidyEnv -> Maybe (InstLoc, [Inst]) -> [Inst] -> TcM ()
3086 report_no_instances tidy_env mb_what insts
3087 = do { inst_envs <- tcGetInstEnvs
3088 ; let (implics, insts1) = partition isImplicInst insts
3089 (insts2, overlaps) = partitionWith (check_overlap inst_envs) insts1
3090 (eqInsts, insts3) = partition isEqInst insts2
3091 ; traceTc (text "reportNoInstances" <+> vcat
3092 [ppr insts, ppr implics, ppr insts1, ppr insts2])
3093 ; mapM_ complain_implic implics
3094 ; mapM_ (\doc -> addErrTcM (tidy_env, doc)) overlaps
3095 ; groupErrs complain_no_inst insts3
3096 ; mapM_ (addErrTcM . mk_eq_err) eqInsts
3099 complain_no_inst insts = addErrTcM (tidy_env, mk_no_inst_err insts)
3101 complain_implic inst -- Recurse!
3102 = reportNoInstances tidy_env
3103 (Just (tci_loc inst, tci_given inst))
3106 check_overlap :: (InstEnv,InstEnv) -> Inst -> Either Inst SDoc
3107 -- Right msg => overlap message
3108 -- Left inst => no instance
3109 check_overlap inst_envs wanted
3110 | not (isClassDict wanted) = Left wanted
3112 = case lookupInstEnv inst_envs clas tys of
3113 ([], _) -> Left wanted -- No match
3114 -- The case of exactly one match and no unifiers means a
3115 -- successful lookup. That can't happen here, because dicts
3116 -- only end up here if they didn't match in Inst.lookupInst
3118 | debugIsOn -> pprPanic "reportNoInstance" (ppr wanted)
3119 res -> Right (mk_overlap_msg wanted res)
3121 (clas,tys) = getDictClassTys wanted
3123 mk_overlap_msg dict (matches, unifiers)
3124 = ASSERT( not (null matches) )
3125 vcat [ addInstLoc [dict] ((ptext (sLit "Overlapping instances for")
3126 <+> pprPred (dictPred dict))),
3127 sep [ptext (sLit "Matching instances") <> colon,
3128 nest 2 (vcat [pprInstances ispecs, pprInstances unifiers])],
3129 if not (isSingleton matches)
3130 then -- Two or more matches
3132 else -- One match, plus some unifiers
3133 ASSERT( not (null unifiers) )
3134 parens (vcat [ptext (sLit "The choice depends on the instantiation of") <+>
3135 quotes (pprWithCommas ppr (varSetElems (tyVarsOfInst dict))),
3136 ptext (sLit "To pick the first instance above, use -XIncoherentInstances"),
3137 ptext (sLit "when compiling the other instance declarations")])]
3139 ispecs = [ispec | (ispec, _) <- matches]
3141 mk_eq_err :: Inst -> (TidyEnv, SDoc)
3142 mk_eq_err inst = misMatchMsg tidy_env (eqInstTys inst)
3144 mk_no_inst_err insts
3145 | null insts = empty
3147 | Just (loc, givens) <- mb_what, -- Nested (type signatures, instance decls)
3148 not (isEmptyVarSet (tyVarsOfInsts insts))
3149 = vcat [ addInstLoc insts $
3150 sep [ ptext (sLit "Could not deduce") <+> pprDictsTheta insts
3151 , nest 2 $ ptext (sLit "from the context") <+> pprDictsTheta givens]
3152 , show_fixes (fix1 loc : fixes2) ]
3154 | otherwise -- Top level
3155 = vcat [ addInstLoc insts $
3156 ptext (sLit "No instance") <> plural insts
3157 <+> ptext (sLit "for") <+> pprDictsTheta insts
3158 , show_fixes fixes2 ]
3161 fix1 loc = sep [ ptext (sLit "add") <+> pprDictsTheta insts
3162 <+> ptext (sLit "to the context of"),
3163 nest 2 (ppr (instLocOrigin loc)) ]
3164 -- I'm not sure it helps to add the location
3165 -- nest 2 (ptext (sLit "at") <+> ppr (instLocSpan loc)) ]
3167 fixes2 | null instance_dicts = []
3168 | otherwise = [sep [ptext (sLit "add an instance declaration for"),
3169 pprDictsTheta instance_dicts]]
3170 instance_dicts = [d | d <- insts, isClassDict d, not (isTyVarDict d)]
3171 -- Insts for which it is worth suggesting an adding an instance declaration
3172 -- Exclude implicit parameters, and tyvar dicts
3174 show_fixes :: [SDoc] -> SDoc
3175 show_fixes [] = empty
3176 show_fixes (f:fs) = sep [ptext (sLit "Possible fix:"),
3177 nest 2 (vcat (f : map (ptext (sLit "or") <+>) fs))]
3179 addTopAmbigErrs :: [Inst] -> TcRn ()
3180 addTopAmbigErrs dicts
3181 -- Divide into groups that share a common set of ambiguous tyvars
3182 = ifErrsM (return ()) $ -- Only report ambiguity if no other errors happened
3183 -- See Note [Avoiding spurious errors]
3184 mapM_ report (equivClasses cmp [(d, tvs_of d) | d <- tidy_dicts])
3186 (tidy_env, tidy_dicts) = tidyInsts dicts
3188 tvs_of :: Inst -> [TcTyVar]
3189 tvs_of d = varSetElems (tyVarsOfInst d)
3190 cmp (_,tvs1) (_,tvs2) = tvs1 `compare` tvs2
3192 report :: [(Inst,[TcTyVar])] -> TcM ()
3193 report pairs@((inst,tvs) : _) = do -- The pairs share a common set of ambiguous tyvars
3194 (tidy_env, mono_msg) <- mkMonomorphismMsg tidy_env tvs
3195 setSrcSpan (instSpan inst) $
3196 -- the location of the first one will do for the err message
3197 addErrTcM (tidy_env, msg $$ mono_msg)
3199 dicts = map fst pairs
3200 msg = sep [text "Ambiguous type variable" <> plural tvs <+>
3201 pprQuotedList tvs <+> in_msg,
3202 nest 2 (pprDictsInFull dicts)]
3203 in_msg = text "in the constraint" <> plural dicts <> colon
3204 report [] = panic "addTopAmbigErrs"
3207 mkMonomorphismMsg :: TidyEnv -> [TcTyVar] -> TcM (TidyEnv, Message)
3208 -- There's an error with these Insts; if they have free type variables
3209 -- it's probably caused by the monomorphism restriction.
3210 -- Try to identify the offending variable
3211 -- ASSUMPTION: the Insts are fully zonked
3212 mkMonomorphismMsg tidy_env inst_tvs
3213 = do { dflags <- getDOpts
3214 ; (tidy_env, docs) <- findGlobals (mkVarSet inst_tvs) tidy_env
3215 ; return (tidy_env, mk_msg dflags docs) }
3217 mk_msg _ _ | any isRuntimeUnk inst_tvs
3218 = vcat [ptext (sLit "Cannot resolve unknown runtime types:") <+>
3219 (pprWithCommas ppr inst_tvs),
3220 ptext (sLit "Use :print or :force to determine these types")]
3221 mk_msg _ [] = ptext (sLit "Probable fix: add a type signature that fixes these type variable(s)")
3222 -- This happens in things like
3223 -- f x = show (read "foo")
3224 -- where monomorphism doesn't play any role
3226 = vcat [ptext (sLit "Possible cause: the monomorphism restriction applied to the following:"),
3228 monomorphism_fix dflags]
3230 monomorphism_fix :: DynFlags -> SDoc
3231 monomorphism_fix dflags
3232 = ptext (sLit "Probable fix:") <+> vcat
3233 [ptext (sLit "give these definition(s) an explicit type signature"),
3234 if dopt Opt_MonomorphismRestriction dflags
3235 then ptext (sLit "or use -XNoMonomorphismRestriction")
3236 else empty] -- Only suggest adding "-XNoMonomorphismRestriction"
3237 -- if it is not already set!
3239 warnDefault :: [(Inst, Class, Var)] -> Type -> TcM ()
3240 warnDefault ups default_ty = do
3241 warn_flag <- doptM Opt_WarnTypeDefaults
3242 addInstCtxt (instLoc (head (dicts))) (warnTc warn_flag warn_msg)
3244 dicts = [d | (d,_,_) <- ups]
3247 (_, tidy_dicts) = tidyInsts dicts
3248 warn_msg = vcat [ptext (sLit "Defaulting the following constraint(s) to type") <+>
3249 quotes (ppr default_ty),
3250 pprDictsInFull tidy_dicts]
3252 reduceDepthErr :: Int -> [Inst] -> SDoc
3253 reduceDepthErr n stack
3254 = vcat [ptext (sLit "Context reduction stack overflow; size =") <+> int n,
3255 ptext (sLit "Use -fcontext-stack=N to increase stack size to N"),
3256 nest 4 (pprStack stack)]
3258 pprStack :: [Inst] -> SDoc
3259 pprStack stack = vcat (map pprInstInFull stack)