TcErrors.lhs 61.3 KB
Newer Older
1
\begin{code}
2 3
{-# LANGUAGE CPP, ScopedTypeVariables #-}
{-# OPTIONS_GHC -fno-warn-tabs #-}
Ian Lynagh's avatar
Ian Lynagh committed
4 5 6
-- The above warning supression flag is a temporary kludge.
-- While working on this module you are encouraged to remove it and
-- detab the module (please do the detabbing in a separate patch). See
7
--     http://ghc.haskell.org/trac/ghc/wiki/Commentary/CodingStyle#TabsvsSpaces
Ian Lynagh's avatar
Ian Lynagh committed
8 9
-- for details

10
module TcErrors( 
11
       reportUnsolved, reportAllUnsolved,
12
       warnDefaulting,
13 14

       solverDepthErrorTcS
15 16 17 18
  ) where

#include "HsVersions.h"

19
import TcRnTypes
20 21 22
import TcRnMonad
import TcMType
import TcType
23
import TypeRep
batterseapower's avatar
batterseapower committed
24
import Type
25
import Kind ( isKind )
26
import Unify            ( tcMatchTys )
27
import Module
28
import FamInst          ( FamInstEnvs, tcGetFamInstEnvs, tcLookupDataFamInst )
29 30 31
import Inst
import InstEnv
import TyCon
32
import DataCon
33
import TcEvidence
34
import TysWiredIn       ( coercibleClass )
35
import Name
36
import RdrName          ( lookupGRE_Name )
37
import Id 
38 39 40 41
import Var
import VarSet
import VarEnv
import Bag
42
import ErrUtils         ( ErrMsg, makeIntoWarning, pprLocErrMsg )
43
import BasicTypes 
44 45 46
import Util
import FastString
import Outputable
47
import SrcLoc
48
import DynFlags
49
import ListSetOps       ( equivClasses )
Icelandjack's avatar
Icelandjack committed
50 51

import Data.Maybe
52
import Data.List        ( partition, mapAccumL, zip4, nub )
53 54 55 56 57 58 59 60 61 62 63 64
\end{code}

%************************************************************************
%*									*
\section{Errors and contexts}
%*									*
%************************************************************************

ToDo: for these error messages, should we note the location as coming
from the insts, or just whatever seems to be around in the monad just
now?

65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
Note [Deferring coercion errors to runtime]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
While developing, sometimes it is desirable to allow compilation to succeed even
if there are type errors in the code. Consider the following case:

  module Main where

  a :: Int
  a = 'a'

  main = print "b"

Even though `a` is ill-typed, it is not used in the end, so if all that we're
interested in is `main` it is handy to be able to ignore the problems in `a`.

Since we treat type equalities as evidence, this is relatively simple. Whenever
we run into a type mismatch in TcUnify, we normally just emit an error. But it
is always safe to defer the mismatch to the main constraint solver. If we do
that, `a` will get transformed into
84

85 86 87 88 89 90 91 92 93 94 95 96 97 98
  co :: Int ~ Char
  co = ...

  a :: Int
  a = 'a' `cast` co

The constraint solver would realize that `co` is an insoluble constraint, and
emit an error with `reportUnsolved`. But we can also replace the right-hand side
of `co` with `error "Deferred type error: Int ~ Char"`. This allows the program
to compile, and it will run fine unless we evaluate `a`. This is what
`deferErrorsToRuntime` does.

It does this by keeping track of which errors correspond to which coercion
in TcErrors. TcErrors.reportTidyWanteds does not print the errors
99
and does not fail if -fdefer-type-errors is on, so that we can continue
100 101 102 103 104 105
compilation. The errors are turned into warnings in `reportUnsolved`.

\begin{code}
reportUnsolved :: WantedConstraints -> TcM (Bag EvBind)
reportUnsolved wanted
  = do { binds_var <- newTcEvBinds
ian@well-typed.com's avatar
ian@well-typed.com committed
106
       ; defer <- goptM Opt_DeferTypeErrors
107 108 109 110 111 112
       ; report_unsolved (Just binds_var) defer wanted
       ; getTcEvBinds binds_var }

reportAllUnsolved :: WantedConstraints -> TcM ()
-- Report all unsolved goals, even if -fdefer-type-errors is on
-- See Note [Deferring coercion errors to runtime]
Simon Peyton Jones's avatar
Simon Peyton Jones committed
113
reportAllUnsolved wanted = report_unsolved Nothing False wanted
114 115 116 117

report_unsolved :: Maybe EvBindsVar  -- cec_binds
                -> Bool              -- cec_defer
                -> WantedConstraints -> TcM ()
118 119 120
-- Important precondition:
-- WantedConstraints are fully zonked and unflattened, that is,
-- zonkWC has already been applied to these constraints.
121
report_unsolved mb_binds_var defer wanted
122
  | isEmptyWC wanted
123
  = return ()
124
  | otherwise
125
  = do { traceTc "reportUnsolved (before unflattening)" (ppr wanted)
126

127
       ; env0 <- tcInitTidyEnv
128 129 130
                 
            -- If we are deferring we are going to need /all/ evidence around,
            -- including the evidence produced by unflattening (zonkWC)
131
       ; let tidy_env = tidyFreeTyVars env0 free_tvs
132
             free_tvs = tyVarsOfWC wanted
133
             err_ctxt = CEC { cec_encl  = []
134
                            , cec_tidy  = tidy_env
135
                            , cec_defer    = defer
136
                            , cec_suppress = False -- See Note [Suppressing error messages]
137
                            , cec_binds    = mb_binds_var }
138

139 140 141
       ; traceTc "reportUnsolved (after unflattening):" $ 
         vcat [ pprTvBndrs (varSetElems free_tvs)
              , ppr wanted ]
142

143
       ; reportWanteds err_ctxt wanted }
144

145 146 147
--------------------------------------------
--      Internal functions
--------------------------------------------
148 149 150 151

data ReportErrCtxt 
    = CEC { cec_encl :: [Implication]  -- Enclosing implications
                	       	       --   (innermost first)
152
                                       -- ic_skols and givens are tidied, rest are not
153
          , cec_tidy  :: TidyEnv
154 155 156 157 158
          , cec_binds :: Maybe EvBindsVar 
                         -- Nothinng <=> Report all errors, including holes; no bindings
                         -- Just ev  <=> make some errors (depending on cec_defer)
                         --              into warnings, and emit evidence bindings
                         --              into 'ev' for unsolved constraints
159

160 161
          , cec_defer :: Bool       -- True <=> -fdefer-type-errors
                                    -- Irrelevant if cec_binds = Nothing
162 163 164
          , cec_suppress :: Bool    -- True <=> More important errors have occurred,
                                    --          so create bindings if need be, but
                                    --          don't issue any more errors/warnings
165
                                    -- See Note [Suppressing error messages]
166
      }
167
\end{code}
168

169 170 171 172 173 174 175 176 177 178 179 180 181
Note [Suppressing error messages]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The cec_suppress flag says "don't report any errors.  Instead, just create
evidence bindings (as usual).  It's used when more important errors have occurred.
Specifically (see reportWanteds)
  * If there are insoluble Givens, then we are in unreachable code and all bets
    are off.  So don't report any further errors.
  * If there are any insolubles (eg Int~Bool), here or in a nested implication, 
    then suppress errors from the flat constraints here.  Sometimes the
    flat-constraint errors are a knock-on effect of the insolubles.


\begin{code}
182 183 184
reportImplic :: ReportErrCtxt -> Implication -> TcM ()
reportImplic ctxt implic@(Implic { ic_skols = tvs, ic_given = given
                                 , ic_wanted = wanted, ic_binds = evb
Simon Peyton Jones's avatar
Simon Peyton Jones committed
185
                                 , ic_insol = ic_insoluble, ic_info = info })
186
  | BracketSkol <- info
Simon Peyton Jones's avatar
Simon Peyton Jones committed
187 188 189 190
  , not ic_insoluble -- For Template Haskell brackets report only
  = return ()        -- definite errors. The whole thing will be re-checked
                     -- later when we plug it in, and meanwhile there may
                     -- certainly be un-satisfied constraints
191 192

  | otherwise
193
  = reportWanteds ctxt' wanted
194
  where
195
    (env1, tvs') = mapAccumL tidyTyVarBndr (cec_tidy ctxt) tvs
196
    (env2, info') = tidySkolemInfo env1 info
197
    implic' = implic { ic_skols = tvs'
198 199 200
                     , ic_given = map (tidyEvVar env2) given
                     , ic_info  = info' }
    ctxt' = ctxt { cec_tidy  = env2
201
                 , cec_encl  = implic' : cec_encl ctxt
202
                 , cec_binds = case cec_binds ctxt of
203 204 205 206
                                 Nothing -> Nothing
                                 Just {} -> Just evb }

reportWanteds :: ReportErrCtxt -> WantedConstraints -> TcM ()
207 208 209 210
reportWanteds ctxt wanted@(WC { wc_flat = flats, wc_insol = insols, wc_impl = implics })
  = do { reportFlats ctxt  (mapBag (tidyCt env) insol_given)
       ; reportFlats ctxt1 (mapBag (tidyCt env) insol_wanted)
       ; reportFlats ctxt2 (mapBag (tidyCt env) flats)
211 212 213 214
            -- All the Derived ones have been filtered out of flats 
            -- by the constraint solver. This is ok; we don't want
            -- to report unsolved Derived goals as errors
            -- See Note [Do not report derived but soluble errors]
215 216 217 218 219 220
       ; mapBagM_ (reportImplic ctxt1) implics }
            -- NB ctxt1: don't suppress inner insolubles if there's only a
            -- wanted insoluble here; but do suppress inner insolubles
            -- if there's a given insoluble here (= inaccessible code)
 where
    (insol_given, insol_wanted) = partitionBag isGivenCt insols
221 222
    env = cec_tidy ctxt

223 224 225 226 227 228 229
      -- See Note [Suppressing error messages]
    suppress0 = cec_suppress ctxt
    suppress1 = suppress0 || not (isEmptyBag insol_given)
    suppress2 = suppress0 || insolubleWC wanted
    ctxt1     = ctxt { cec_suppress = suppress1 }
    ctxt2     = ctxt { cec_suppress = suppress2 }

230 231
reportFlats :: ReportErrCtxt -> Cts -> TcM ()
reportFlats ctxt flats    -- Here 'flats' includes insolble goals
232 233 234
  =  traceTc "reportFlats" (vcat [ ptext (sLit "Flats =") <+> ppr flats
                                 , ptext (sLit "Suppress =") <+> ppr (cec_suppress ctxt)])
  >> tryReporters
235 236 237
      [ -- First deal with things that are utterly wrong
        -- Like Int ~ Bool (incl nullary TyCons)
        -- or  Int ~ t a   (AppTy on one side)
238 239
        ("Utterly wrong",  utterly_wrong,   True, mkGroupReporter mkEqErr)
      , ("Holes",          is_hole,         True, mkUniReporter mkHoleError)
240 241

        -- Report equalities of form (a~ty).  They are usually
242
        -- skolem-equalities, and they cause confusing knock-on
243
        -- effects in other errors; see test T4093b.
244 245 246 247 248 249 250 251 252 253 254 255
      , ("Skolem equalities", skolem_eq,  True,  mkSkolReporter)

        -- Other equalities; also confusing knock on effects
      , ("Equalities",      is_equality, True,  mkGroupReporter mkEqErr)

      , ("Implicit params", is_ip,       False, mkGroupReporter mkIPErr)
      , ("Irreds",          is_irred,    False, mkGroupReporter mkIrredErr)
      , ("Dicts",           is_dict,     False, mkGroupReporter mkDictErr)
      ]
      panicReporter ctxt (bagToList flats)
          -- TuplePreds should have been expanded away by the constraint
          -- simplifier, so they shouldn't show up at this point
256
  where
257 258 259 260
    utterly_wrong, skolem_eq, is_hole, is_dict,
      is_equality, is_ip, is_irred :: Ct -> PredTree -> Bool

    utterly_wrong _ (EqPred ty1 ty2) = isRigid ty1 && isRigid ty2
261 262
    utterly_wrong _ _ = False

263 264
    is_hole ct _ = isHoleCt ct

265
    skolem_eq _ (EqPred ty1 ty2) = isRigidOrSkol ty1 && isRigidOrSkol ty2
266 267
    skolem_eq _ _ = False

268 269 270 271 272 273 274 275 276 277 278 279 280
    is_equality _ (EqPred {}) = True
    is_equality _ _           = False

    is_dict _ (ClassPred {}) = True
    is_dict _ _              = False

    is_ip _ (ClassPred cls _) = isIPClass cls
    is_ip _ _                 = False

    is_irred _ (IrredPred {}) = True
    is_irred _ _              = False


281 282
---------------
isRigid, isRigidOrSkol :: Type -> Bool
283
isRigid ty
284 285 286 287 288
  | Just (tc,_) <- tcSplitTyConApp_maybe ty = isDecomposableTyCon tc
  | Just {} <- tcSplitAppTy_maybe ty        = True
  | isForAllTy ty                           = True
  | otherwise                               = False

289
isRigidOrSkol ty
290 291 292 293 294 295 296 297
  | Just tv <- getTyVar_maybe ty = isSkolemTyVar tv
  | otherwise                    = isRigid ty

isTyFun_maybe :: Type -> Maybe TyCon
isTyFun_maybe ty = case tcSplitTyConApp_maybe ty of
                      Just (tc,_) | isSynFamilyTyCon tc -> Just tc
                      _ -> Nothing

298 299

--------------------------------------------
300
--      Reporters
301 302
--------------------------------------------

303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
type Reporter
  = ReportErrCtxt -> [Ct] -> TcM ()
type ReporterSpec
  = ( String                     -- Name
    , Ct -> PredTree -> Bool     -- Pick these ones
    , Bool                       -- True <=> suppress subsequent reporters
    , Reporter)                  -- The reporter itself

panicReporter :: Reporter
panicReporter _ cts
  | null cts  = return ()
  | otherwise =  pprPanic "reportFlats" (ppr cts)

mkSkolReporter :: Reporter
-- Suppress duplicates with the same LHS
mkSkolReporter ctxt cts
  = mapM_ (reportGroup mkEqErr ctxt) (equivClasses cmp_lhs_type cts)
  where
    cmp_lhs_type ct1 ct2
      = case (classifyPredType (ctPred ct1), classifyPredType (ctPred ct2)) of
           (EqPred ty1 _, EqPred ty2 _) -> ty1 `cmpType` ty2
           _ -> pprPanic "mkSkolReporter" (ppr ct1 $$ ppr ct2)
325 326 327

mkUniReporter :: (ReportErrCtxt -> Ct -> TcM ErrMsg) -> Reporter
-- Reports errors one at a time
328 329
mkUniReporter mk_err ctxt
  = mapM_ $ \ct ->
330
    do { err <- mk_err ctxt ct
331
       ; maybeReportError ctxt err
332
       ; maybeAddDeferredBinding ctxt err ct }
333 334 335 336

mkGroupReporter :: (ReportErrCtxt -> [Ct] -> TcM ErrMsg)
                             -- Make error message for a group
                -> Reporter  -- Deal with lots of constraints
337 338 339 340 341
-- Group together errors from same location,
-- and report only the first (to avoid a cascade)
mkGroupReporter mk_err ctxt cts
  = mapM_ (reportGroup mk_err ctxt) (equivClasses cmp_loc cts)
  where
342
    cmp_loc ct1 ct2 = ctLocSpan (ctLoc ct1) `compare` ctLocSpan (ctLoc ct2)
343

344 345 346 347
reportGroup :: (ReportErrCtxt -> [Ct] -> TcM ErrMsg) -> ReportErrCtxt
            -> [Ct] -> TcM ()
reportGroup mk_err ctxt cts
  = do { err <- mk_err ctxt cts
348
       ; maybeReportError ctxt err
349
       ; mapM_ (maybeAddDeferredBinding ctxt err) cts }
350
               -- Add deferred bindings for all
351
               -- But see Note [Always warn with -fdefer-type-errors]
352

353
maybeReportError :: ReportErrCtxt -> ErrMsg -> TcM ()
354
-- Report the error and/or make a deferred binding for it
355
maybeReportError ctxt err
356
  | cec_defer ctxt  -- See Note [Always warn with -fdefer-type-errors]
357
  = reportWarning (makeIntoWarning err)
358 359 360 361 362 363 364 365
  | cec_suppress ctxt
  = return ()
  | otherwise
  = reportError err

maybeAddDeferredBinding :: ReportErrCtxt -> ErrMsg -> Ct -> TcM ()
-- See Note [Deferring coercion errors to runtime]
maybeAddDeferredBinding ctxt err ct
366
  | CtWanted { ctev_pred = pred, ctev_evar = ev_id } <- ctEvidence ct
367 368
    -- Only add deferred bindings for Wanted constraints
  , isHoleCt ct || cec_defer ctxt  -- And it's a hole or we have -fdefer-type-errors
369
  , Just ev_binds_var <- cec_binds ctxt  -- We have somewhere to put the bindings
370 371 372 373 374 375 376 377 378
  = do { dflags <- getDynFlags
       ; let err_msg = pprLocErrMsg err
             err_fs  = mkFastString $ showSDoc dflags $
                       err_msg $$ text "(deferred type error)"

         -- Create the binding
       ; addTcEvBind ev_binds_var ev_id (EvDelayedError pred err_fs) }

  | otherwise   -- Do not set any evidence for Given/Derived
379
  = return ()
380

381
tryReporters :: [ReporterSpec] -> Reporter -> Reporter
382 383
-- Use the first reporter in the list whose predicate says True
tryReporters reporters deflt ctxt cts
384
  = do { traceTc "tryReporters {" (ppr cts)
385
       ; go ctxt reporters cts
386 387
       ; traceTc "tryReporters }" empty }
  where
388 389
    go ctxt [] cts = deflt ctxt cts
    go ctxt ((str, pred, suppress_after, reporter) : rs) cts
390 391 392 393
      | null yeses  = do { traceTc "tryReporters: no" (text str)
                         ; go ctxt rs cts }
      | otherwise   = do { traceTc "tryReporters: yes" (text str <+> ppr yeses)
                         ; reporter ctxt yeses :: TcM ()
394 395
                         ; let ctxt' = ctxt { cec_suppress = suppress_after || cec_suppress ctxt }
                         ; go ctxt' rs nos }
396
                         -- Carry on with the rest, because we must make
397
                         -- deferred bindings for them if we have
398
                         -- -fdefer-type-errors
Simon Peyton Jones's avatar
Simon Peyton Jones committed
399
                         -- But suppress their error messages
400
      where
401
       (yeses, nos) = partition keep_me cts
402
       keep_me ct = pred ct (classifyPredType (ctPred ct))
403 404

-- Add the "arising from..." part to a message about bunch of dicts
405
addArising :: CtOrigin -> SDoc -> SDoc
406
addArising orig msg = hang msg 2 (pprArising orig)
407

408
pprWithArising :: [Ct] -> (CtLoc, SDoc)
409 410
-- Print something like
--    (Eq a) arising from a use of x at y
411 412
--    (Show a) arising from a use of p at q
-- Also return a location for the error message
413
-- Works for Wanted/Derived only
414 415
pprWithArising [] 
  = panic "pprWithArising"
416 417
pprWithArising (ct:cts)
  | null cts
418
  = (loc, addArising (ctLocOrigin loc) 
dimitris's avatar
dimitris committed
419
                     (pprTheta [ctPred ct]))
420 421
  | otherwise
  = (loc, vcat (map ppr_one (ct:cts)))
422
  where
423 424 425
    loc = ctLoc ct
    ppr_one ct' = hang (parens (pprType (ctPred ct'))) 
                     2 (pprArisingAt (ctLoc ct'))
426

427 428
mkErrorMsg :: ReportErrCtxt -> Ct -> SDoc -> TcM ErrMsg
mkErrorMsg ctxt ct msg 
429
  = do { let tcl_env = ctLocEnv (ctLoc ct)
430 431
       ; err_info <- mkErrInfo (cec_tidy ctxt) (tcl_ctxt tcl_env)
       ; mkLongErrAt (tcl_loc tcl_env) msg err_info }
432

433
type UserGiven = ([EvVar], SkolemInfo, SrcSpan)
434 435

getUserGivens :: ReportErrCtxt -> [UserGiven]
436
-- One item for each enclosing implication
437
getUserGivens (CEC {cec_encl = ctxt})
438
  = reverse $
439 440 441
    [ (givens, info, tcl_loc env) 
    | Implic {ic_given = givens, ic_env = env, ic_info = info } <- ctxt
    , not (null givens) ]
442 443
\end{code}

444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
Note [Always warn with -fdefer-type-errors]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
When -fdefer-type-errors is on we warn about *all* type errors, even
if cec_suppress is on.  This can lead to a lot more warnings than you
would get errors without -fdefer-type-errors, but if we suppress any of
them you might get a runtime error that wasn't warned about at compile
time. 

This is an easy design choice to change; just flip the order of the
first two equations for maybeReportError

To be consistent, we should also report multiple warnings from a single
location in mkGroupReporter, when -fdefer-type-errors is on.  But that 
is perhaps a bit *over*-consistent! Again, an easy choice to change.


460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509
Note [Do not report derived but soluble errors]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The wc_flats include Derived constraints that have not been solved, but are
not insoluble (in that case they'd be in wc_insols).  We do not want to report
these as errors:

* Superclass constraints. If we have an unsolved [W] Ord a, we'll also have
  an unsolved [D] Eq a, and we do not want to report that; it's just noise.

* Functional dependencies.  For givens, consider
      class C a b | a -> b
      data T a where
         MkT :: C a d => [d] -> T a
      f :: C a b => T a -> F Int
      f (MkT xs) = length xs
  Then we get a [D] b~d.  But there *is* a legitimate call to
  f, namely   f (MkT [True]) :: T Bool, in which b=d.  So we should
  not reject the program.

  For wanteds, something similar
      data T a where
        MkT :: C Int b => a -> b -> T a 
      g :: C Int c => c -> ()
      f :: T a -> ()
      f (MkT x y) = g x
  Here we get [G] C Int b, [W] C Int a, hence [D] a~b.
  But again f (MkT True True) is a legitimate call.

(We leave the Deriveds in wc_flat until reportErrors, so that we don't lose
derived superclasses between iterations of the solver.)

For functional dependencies, here is a real example, 
stripped off from libraries/utf8-string/Codec/Binary/UTF8/Generic.hs

  class C a b | a -> b
  g :: C a b => a -> b -> () 
  f :: C a b => a -> b -> () 
  f xa xb = 
      let loop = g xa 
      in loop xb

We will first try to infer a type for loop, and we will succeed:
    C a b' => b' -> ()
Subsequently, we will type check (loop xb) and all is good. But, 
recall that we have to solve a final implication constraint: 
    C a b => (C a b' => .... cts from body of loop .... )) 
And now we have a problem as we will generate an equality b ~ b' and fail to 
solve it. 


batterseapower's avatar
batterseapower committed
510 511 512 513 514 515 516
%************************************************************************
%*                  *
                Irreducible predicate errors
%*                  *
%************************************************************************

\begin{code}
517 518
mkIrredErr :: ReportErrCtxt -> [Ct] -> TcM ErrMsg
mkIrredErr ctxt cts 
519
  = do { (ctxt, binds_msg) <- relevantBindings True ctxt ct1
520
       ; mkErrorMsg ctxt ct1 (msg $$ binds_msg) }
batterseapower's avatar
batterseapower committed
521
  where
522
    (ct1:_) = cts
523
    orig    = ctLocOrigin (ctLoc ct1)
524 525
    givens  = getUserGivens ctxt
    msg = couldNotDeduce givens (map ctPred cts, orig)
batterseapower's avatar
batterseapower committed
526

527
----------------
528
mkHoleError :: ReportErrCtxt -> Ct -> TcM ErrMsg
529
mkHoleError ctxt ct@(CHoleCan { cc_occ = occ })
530 531
  = do { let tyvars = varSetElems (tyVarsOfCt ct)
             tyvars_msg = map loc_msg tyvars
532
             msg = vcat [ hang (ptext (sLit "Found hole") <+> quotes (ppr occ))
533
                             2 (ptext (sLit "with type:") <+> pprType (ctEvPred (ctEvidence ct)))
534
                        , ppUnless (null tyvars_msg) (ptext (sLit "Where:") <+> vcat tyvars_msg) ]
535 536
       ; (ctxt, binds_doc) <- relevantBindings False ctxt ct
               -- The 'False' means "don't filter the bindings; see Trac #8191
537
       ; mkErrorMsg ctxt ct (msg $$ binds_doc) }
538
  where
539 540 541
    loc_msg tv 
       = case tcTyVarDetails tv of
          SkolemTv {} -> quotes (ppr tv) <+> skol_msg
542
          MetaTv {}   -> quotes (ppr tv) <+> ptext (sLit "is an ambiguous type variable")
543 544 545
          det -> pprTcTyVarDetails det
       where 
          skol_msg = pprSkol (getSkolemInfo (cec_encl ctxt) tv) (getSrcLoc tv)
546 547

mkHoleError _ ct = pprPanic "mkHoleError" (ppr ct)
548

549
----------------
550 551
mkIPErr :: ReportErrCtxt -> [Ct] -> TcM ErrMsg
mkIPErr ctxt cts
552
  = do { (ctxt, bind_msg) <- relevantBindings True ctxt ct1
553
       ; mkErrorMsg ctxt ct1 (msg $$ bind_msg) }
554
  where
555
    (ct1:_) = cts
556
    orig    = ctLocOrigin (ctLoc ct1)
557 558
    preds   = map ctPred cts
    givens  = getUserGivens ctxt
559 560
    msg | null givens
        = addArising orig $
561 562
          sep [ ptext (sLit "Unbound implicit parameter") <> plural cts
              , nest 2 (pprTheta preds) ] 
563
        | otherwise
564
        = couldNotDeduce givens (preds, orig)
565 566 567 568 569 570 571 572 573
\end{code}


%************************************************************************
%*									*
                Equality errors
%*									*
%************************************************************************

574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591
Note [Inaccessible code]
~~~~~~~~~~~~~~~~~~~~~~~~
Consider
   data T a where
     T1 :: T a
     T2 :: T Bool

   f :: (a ~ Int) => T a -> Int
   f T1 = 3
   f T2 = 4   -- Unreachable code

Here the second equation is unreachable. The original constraint
(a~Int) from the signature gets rewritten by the pattern-match to
(Bool~Int), so the danger is that we report the error as coming from
the *signature* (Trac #7293).  So, for Given errors we replace the
env (and hence src-loc) on its CtLoc with that from the immediately
enclosing implication.

592
\begin{code}
593 594 595 596 597 598 599 600 601
mkEqErr :: ReportErrCtxt -> [Ct] -> TcM ErrMsg
-- Don't have multiple equality errors from the same location
-- E.g.   (Int,Bool) ~ (Bool,Int)   one error will do!
mkEqErr ctxt (ct:_) = mkEqErr1 ctxt ct
mkEqErr _ [] = panic "mkEqErr"

mkEqErr1 :: ReportErrCtxt -> Ct -> TcM ErrMsg
-- Wanted constraints only!
mkEqErr1 ctxt ct
602
  | isGiven ev
603
  = do { (ctxt, binds_msg) <- relevantBindings True ctxt ct
604
       ; let (given_loc, given_msg) = mk_given (cec_encl ctxt)
605 606
       ; dflags <- getDynFlags
       ; mkEqErr_help dflags ctxt (given_msg $$ binds_msg) 
607
                      (ct { cc_ev = ev {ctev_loc = given_loc}}) -- Note [Inaccessible code]
608 609 610
                      Nothing ty1 ty2 }

  | otherwise   -- Wanted or derived
611
  = do { (ctxt, binds_msg) <- relevantBindings True ctxt ct
612
       ; (ctxt, tidy_orig) <- zonkTidyOrigin ctxt (ctLocOrigin loc)
613
       ; let (is_oriented, wanted_msg) = mk_wanted_extra tidy_orig
614 615
       ; dflags <- getDynFlags
       ; mkEqErr_help dflags ctxt (wanted_msg $$ binds_msg) 
616
                      ct is_oriented ty1 ty2 }
617
  where
618 619
    ev         = ctEvidence ct
    loc        = ctev_loc ev
620 621 622 623 624
    (ty1, ty2) = getEqPredTys (ctEvPred ev)

    mk_given :: [Implication] -> (CtLoc, SDoc)
    -- For given constraints we overwrite the env (and hence src-loc)
    -- with one from the implication.  See Note [Inaccessible code]
625 626
    mk_given []           = (loc, empty)
    mk_given (implic : _) = (setCtLocEnv loc (ic_env implic)
627 628
                            , hang (ptext (sLit "Inaccessible code in"))
                                 2 (ppr (ic_info implic)))
629

630 631
       -- If the types in the error message are the same as the types
       -- we are unifying, don't add the extra expected/actual message
632 633 634 635 636
    mk_wanted_extra orig@(TypeEqOrigin {})
      = mkExpectedActualMsg ty1 ty2 orig

    mk_wanted_extra (KindEqOrigin cty1 cty2 sub_o)
      = (Nothing, msg1 $$ msg2)
637
      where
638 639 640 641 642 643 644 645
        msg1 = hang (ptext (sLit "When matching types"))
                  2 (vcat [ ppr cty1 <+> dcolon <+> ppr (typeKind cty1)
                          , ppr cty2 <+> dcolon <+> ppr (typeKind cty2) ])
        msg2 = case sub_o of
                 TypeEqOrigin {} -> snd (mkExpectedActualMsg cty1 cty2 sub_o)
                 _ -> empty

    mk_wanted_extra _ = (Nothing, empty)
646

647 648 649 650 651 652 653
mkEqErr_help :: DynFlags -> ReportErrCtxt -> SDoc
             -> Ct          
             -> Maybe SwapFlag   -- Nothing <=> not sure
             -> TcType -> TcType -> TcM ErrMsg
mkEqErr_help dflags ctxt extra ct oriented ty1 ty2
  | Just tv1 <- tcGetTyVar_maybe ty1 = mkTyVarEqErr dflags ctxt extra ct oriented tv1 ty2
  | Just tv2 <- tcGetTyVar_maybe ty2 = mkTyVarEqErr dflags ctxt extra ct swapped  tv2 ty1
654
  | otherwise                        = reportEqErr  ctxt extra ct oriented ty1 ty2
655 656
  where
    swapped = fmap flipSwap oriented
657

658 659 660 661
reportEqErr :: ReportErrCtxt -> SDoc
            -> Ct    
            -> Maybe SwapFlag   -- Nothing <=> not sure
            -> TcType -> TcType -> TcM ErrMsg
662
reportEqErr ctxt extra1 ct oriented ty1 ty2
663 664
  = do { let extra2 = mkEqInfoMsg ct ty1 ty2
       ; mkErrorMsg ctxt ct (vcat [ misMatchOrCND ctxt ct oriented ty1 ty2
665
                                   , extra2, extra1]) }
666

667 668
mkTyVarEqErr :: DynFlags -> ReportErrCtxt -> SDoc -> Ct 
             -> Maybe SwapFlag -> TcTyVar -> TcType -> TcM ErrMsg
simonpj@microsoft.com's avatar
simonpj@microsoft.com committed
669
-- tv1 and ty2 are already tidied
670 671
mkTyVarEqErr dflags ctxt extra ct oriented tv1 ty2
  | isUserSkolem ctxt tv1   -- ty2 won't be a meta-tyvar, or else the thing would
672 673
                            -- be oriented the other way round;
                            -- see TcCanonical.canEqTyVarTyVar
674
  || isSigTyVar tv1 && not (isTyVarTy ty2)
675
  = mkErrorMsg ctxt ct (vcat [ misMatchOrCND ctxt ct oriented ty1 ty2
676
                             , extraTyVarInfo ctxt tv1 ty2
677
                             , extra ])
678

679 680 681
  -- So tv is a meta tyvar (or started that way before we 
  -- generalised it).  So presumably it is an *untouchable* 
  -- meta tyvar or a SigTv, else it'd have been unified
682
  | not (k2 `tcIsSubKind` k1)   	 -- Kind error
683
  = mkErrorMsg ctxt ct $ (kindErrorMsg (mkTyVarTy tv1) ty2 $$ extra)
684

685
  | OC_Occurs <- occ_check_expand
686 687
  = do { let occCheckMsg = hang (text "Occurs check: cannot construct the infinite type:")
                              2 (sep [ppr ty1, char '~', ppr ty2])
688 689
             extra2 = mkEqInfoMsg ct ty1 ty2
       ; mkErrorMsg ctxt ct (occCheckMsg $$ extra2 $$ extra) }
Simon Peyton Jones's avatar
Simon Peyton Jones committed
690

691 692 693 694
  | OC_Forall <- occ_check_expand
  = do { let msg = vcat [ ptext (sLit "Cannot instantiate unification variable")
                          <+> quotes (ppr tv1)
                        , hang (ptext (sLit "with a type involving foralls:")) 2 (ppr ty2)
695
                        , nest 2 (ptext (sLit "Perhaps you want ImpredicativeTypes")) ]
696 697 698 699
       ; mkErrorMsg ctxt ct msg }

  -- If the immediately-enclosing implication has 'tv' a skolem, and
  -- we know by now its an InferSkol kind of skolem, then presumably
700 701
  -- it started life as a SigTv, else it'd have been unified, given
  -- that there's no occurs-check or forall problem
702 703 704 705
  | (implic:_) <- cec_encl ctxt
  , Implic { ic_skols = skols } <- implic
  , tv1 `elem` skols
  = mkErrorMsg ctxt ct (vcat [ misMatchMsg oriented ty1 ty2
706
                             , extraTyVarInfo ctxt tv1 ty2
707 708
                             , extra ])

709 710
  -- Check for skolem escape
  | (implic:_) <- cec_encl ctxt   -- Get the innermost context
711 712
  , Implic { ic_env = env, ic_skols = skols, ic_info = skol_info } <- implic
  , let esc_skols = filter (`elemVarSet` (tyVarsOfType ty2)) skols
713
  , not (null esc_skols)
714
  = do { let msg = misMatchMsg oriented ty1 ty2
715 716 717 718 719
             esc_doc = sep [ ptext (sLit "because type variable") <> plural esc_skols
                             <+> pprQuotedList esc_skols
                           , ptext (sLit "would escape") <+>
                             if isSingleton esc_skols then ptext (sLit "its scope")
                                                      else ptext (sLit "their scope") ]
720 721 722 723 724 725 726 727
             tv_extra = vcat [ nest 2 $ esc_doc
                             , sep [ (if isSingleton esc_skols 
                                      then ptext (sLit "This (rigid, skolem) type variable is")
                                      else ptext (sLit "These (rigid, skolem) type variables are"))
                               <+> ptext (sLit "bound by")
                             , nest 2 $ ppr skol_info
                             , nest 2 $ ptext (sLit "at") <+> ppr (tcl_loc env) ] ]
       ; mkErrorMsg ctxt ct (msg $$ tv_extra $$ extra) }
728 729 730

  -- Nastiest case: attempt to unify an untouchable variable
  | (implic:_) <- cec_encl ctxt   -- Get the innermost context
731 732
  , Implic { ic_env = env, ic_given = given, ic_info = skol_info } <- implic
  = do { let msg = misMatchMsg oriented ty1 ty2
733
             untch_extra
734 735 736 737 738
                = nest 2 $
                  sep [ quotes (ppr tv1) <+> ptext (sLit "is untouchable")
                      , nest 2 $ ptext (sLit "inside the constraints") <+> pprEvVarTheta given
                      , nest 2 $ ptext (sLit "bound by") <+> ppr skol_info
                      , nest 2 $ ptext (sLit "at") <+> ppr (tcl_loc env) ]
739
             tv_extra = extraTyVarInfo ctxt tv1 ty2
740 741
             add_sig  = suggestAddSig ctxt ty1 ty2
       ; mkErrorMsg ctxt ct (vcat [msg, untch_extra, tv_extra, add_sig, extra]) }
742

743
  | otherwise
744
  = reportEqErr ctxt extra ct oriented (mkTyVarTy tv1) ty2
745 746
        -- This *can* happen (Trac #6123, and test T2627b)
        -- Consider an ambiguous top-level constraint (a ~ F a)
Gabor Greif's avatar
typos  
Gabor Greif committed
747
        -- Not an occurs check, because F is a type function.
748
  where         
749
    occ_check_expand = occurCheckExpand dflags tv1 ty2
750 751 752
    k1 	= tyVarKind tv1
    k2 	= typeKind ty2
    ty1 = mkTyVarTy tv1
753

754
mkEqInfoMsg :: Ct -> TcType -> TcType -> SDoc
755 756 757 758 759
-- Report (a) ambiguity if either side is a type function application
--            e.g. F a0 ~ Int    
--        (b) warning about injectivity if both sides are the same
--            type function application   F a ~ F b
--            See Note [Non-injective type functions]
760 761
mkEqInfoMsg ct ty1 ty2
  = tyfun_msg $$ ambig_msg
762 763 764
  where
    mb_fun1 = isTyFun_maybe ty1
    mb_fun2 = isTyFun_maybe ty2
765 766 767 768 769

    ambig_msg | isJust mb_fun1 || isJust mb_fun2 
              = snd (mkAmbigMsg ct)
              | otherwise = empty

770 771 772 773 774 775 776
    tyfun_msg | Just tc1 <- mb_fun1
              , Just tc2 <- mb_fun2
              , tc1 == tc2 
              = ptext (sLit "NB:") <+> quotes (ppr tc1) 
                <+> ptext (sLit "is a type function, and may not be injective")
              | otherwise = empty

Simon Peyton Jones's avatar
Simon Peyton Jones committed
777 778 779 780 781 782 783 784 785 786 787
isUserSkolem :: ReportErrCtxt -> TcTyVar -> Bool
-- See Note [Reporting occurs-check errors]
isUserSkolem ctxt tv
  = isSkolemTyVar tv && any is_user_skol_tv (cec_encl ctxt)
  where
    is_user_skol_tv (Implic { ic_skols = sks, ic_info = skol_info })
      = tv `elem` sks && is_user_skol_info skol_info

    is_user_skol_info (InferSkol {}) = False
    is_user_skol_info _ = True

788
misMatchOrCND :: ReportErrCtxt -> Ct -> Maybe SwapFlag -> TcType -> TcType -> SDoc
Simon Peyton Jones's avatar
Simon Peyton Jones committed
789
-- If oriented then ty1 is actual, ty2 is expected
790 791 792
misMatchOrCND ctxt ct oriented ty1 ty2
  | null givens || 
    (isRigid ty1 && isRigid ty2) || 
793
    isGivenCt ct
794 795 796 797
       -- If the equality is unconditionally insoluble
       -- or there is no context, don't report the context
  = misMatchMsg oriented ty1 ty2
  | otherwise      
798
  = couldNotDeduce givens ([mkTcEqPred ty1 ty2], orig)
799 800
  where
    givens = getUserGivens ctxt
Simon Peyton Jones's avatar
Simon Peyton Jones committed
801
    orig   = TypeEqOrigin { uo_actual = ty1, uo_expected = ty2 }
802

803
couldNotDeduce :: [UserGiven] -> (ThetaType, CtOrigin) -> SDoc
804
couldNotDeduce givens (wanteds, orig)
805
  = vcat [ addArising orig (ptext (sLit "Could not deduce") <+> pprTheta wanteds)
dimitris's avatar
dimitris committed
806 807
         , vcat (pp_givens givens)]

808
pp_givens :: [UserGiven] -> [SDoc]
dimitris's avatar
dimitris committed
809 810
pp_givens givens 
   = case givens of
811 812 813
         []     -> []
         (g:gs) ->      ppr_given (ptext (sLit "from the context")) g
                 : map (ppr_given (ptext (sLit "or from"))) gs
814 815
    where 
       ppr_given herald (gs, skol_info, loc)
dimitris's avatar
dimitris committed
816
           = hang (herald <+> pprEvVarTheta gs)
817 818
                2 (sep [ ptext (sLit "bound by") <+> ppr skol_info
                       , ptext (sLit "at") <+> ppr loc])
simonpj@microsoft.com's avatar
simonpj@microsoft.com committed
819

820
extraTyVarInfo :: ReportErrCtxt -> TcTyVar -> TcType -> SDoc
821
-- Add on extra info about skolem constants
822
-- NB: The types themselves are already tidied
823 824
extraTyVarInfo ctxt tv1 ty2
  = nest 2 (tv_extra tv1 $$ ty_extra ty2)
825
  where
826
    implics = cec_encl ctxt
827 828 829 830 831
    ty_extra ty = case tcGetTyVar_maybe ty of
                    Just tv -> tv_extra tv
                    Nothing -> empty

    tv_extra tv | isTcTyVar tv, isSkolemTyVar tv
832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859
                , let pp_tv = quotes (ppr tv)
                = case tcTyVarDetails tv of
                    SkolemTv {}   -> pp_tv <+> pprSkol (getSkolemInfo implics tv) (getSrcLoc tv)
                    FlatSkol {}   -> pp_tv <+> ptext (sLit "is a flattening type variable")
                    RuntimeUnk {} -> pp_tv <+> ptext (sLit "is an interactive-debugger skolem")
                    MetaTv {}     -> empty

                | otherwise             -- Normal case
                = empty

suggestAddSig :: ReportErrCtxt -> TcType -> TcType -> SDoc
-- See Note [Suggest adding a type signature]
suggestAddSig ctxt ty1 ty2
  | null inferred_bndrs
  = empty
  | [bndr] <- inferred_bndrs
  = ptext (sLit "Possible fix: add a type signature for") <+> quotes (ppr bndr)
  | otherwise
  = ptext (sLit "Possible fix: add type signatures for some or all of") <+> (ppr inferred_bndrs)
  where
    inferred_bndrs = nub (get_inf ty1 ++ get_inf ty2)
    get_inf ty | Just tv <- tcGetTyVar_maybe ty
               , isTcTyVar tv, isSkolemTyVar tv
               , InferSkol prs <- getSkolemInfo (cec_encl ctxt) tv
               = map fst prs
               | otherwise
               = []

860 861 862 863 864 865 866 867 868
kindErrorMsg :: TcType -> TcType -> SDoc   -- Types are already tidy
kindErrorMsg ty1 ty2
  = vcat [ ptext (sLit "Kind incompatibility when matching types:")
         , nest 2 (vcat [ ppr ty1 <+> dcolon <+> ppr k1
                        , ppr ty2 <+> dcolon <+> ppr k2 ]) ]
  where
    k1 = typeKind ty1
    k2 = typeKind ty2

869
--------------------
870
misMatchMsg :: Maybe SwapFlag -> TcType -> TcType -> SDoc	   -- Types are already tidy
871
-- If oriented then ty1 is actual, ty2 is expected
872
misMatchMsg oriented ty1 ty2
873 874 875
  | Just IsSwapped <- oriented
  = misMatchMsg (Just NotSwapped) ty2 ty1
  | Just NotSwapped <- oriented
876
  = sep [ ptext (sLit "Couldn't match expected") <+> what <+> quotes (ppr ty2)
877 878
        , nest 12 $   ptext (sLit "with actual") <+> what <+> quotes (ppr ty1)
        , sameOccExtra ty2 ty1 ]
879 880
  | otherwise
  = sep [ ptext (sLit "Couldn't match") <+> what <+> quotes (ppr ty1)
881 882 883
        , nest 14 $ ptext (sLit "with") <+> quotes (ppr ty2)
        , sameOccExtra ty1 ty2 ]
  where
884 885
    what | isKind ty1 = ptext (sLit "kind")
         | otherwise  = ptext (sLit "type")
886

887
mkExpectedActualMsg :: Type -> Type -> CtOrigin -> (Maybe SwapFlag, SDoc)
888
-- NotSwapped means (actual, expected), IsSwapped is the reverse
889
mkExpectedActualMsg ty1 ty2 (TypeEqOrigin { uo_actual = act, uo_expected = exp })
890 891
  | act `pickyEqType` ty1, exp `pickyEqType` ty2 = (Just NotSwapped,  empty)
  | exp `pickyEqType` ty1, act `pickyEqType` ty2 = (Just IsSwapped, empty)
892 893 894 895 896 897
  | otherwise                                    = (Nothing, msg)
  where
    msg = vcat [ text "Expected type:" <+> ppr exp
               , text "  Actual type:" <+> ppr act ]

mkExpectedActualMsg _ _ _ = panic "mkExprectedAcutalMsg"
898 899

sameOccExtra :: TcType -> TcType -> SDoc
900
-- See Note [Disambiguating (X ~ X) errors]
901 902 903 904 905 906
sameOccExtra ty1 ty2
  | Just (tc1, _) <- tcSplitTyConApp_maybe ty1
  , Just (tc2, _) <- tcSplitTyConApp_maybe ty2
  , let n1 = tyConName tc1
        n2 = tyConName tc2
        same_occ = nameOccName n1                  == nameOccName n2
907
        same_pkg = modulePackageKey (nameModule n1) == modulePackageKey (nameModule n2)
908 909 910 911 912 913 914
  , n1 /= n2   -- Different Names
  , same_occ   -- but same OccName
  = ptext (sLit "NB:") <+> (ppr_from same_pkg n1 $$ ppr_from same_pkg n2)
  | otherwise
  = empty
  where
    ppr_from same_pkg nm
915 916 917 918
      | isGoodSrcSpan loc
      = hang (quotes (ppr nm) <+> ptext (sLit "is defined at"))
           2 (ppr loc)
      | otherwise  -- Imported things have an UnhelpfulSrcSpan
919 920
      = hang (quotes (ppr nm))
           2 (sep [ ptext (sLit "is defined in") <+> quotes (ppr (moduleName mod))
921
                  , ppUnless (same_pkg || pkg == mainPackageKey) $
922 923
                    nest 4 $ ptext (sLit "in package") <+> quotes (ppr pkg) ])
       where
924
         pkg = modulePackageKey mod
925
         mod = nameModule nm
926
         loc = nameSrcSpan nm
927 928
\end{code}

929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945
Note [Suggest adding a type signature]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The OutsideIn algorithm rejects GADT programs that don't have a principal
type, and indeed some that do.  Example:
   data T a where
     MkT :: Int -> T Int

   f (MkT n) = n

Does this have type f :: T a -> a, or f :: T a -> Int?
The error that shows up tends to be an attempt to unify an
untouchable type variable.  So suggestAddSig sees if the offending
type variable is bound by an *inferred* signature, and suggests
adding a declared signature instead.

This initially came up in Trac #8968, concerning pattern synonyms.

946 947 948 949
Note [Disambiguating (X ~ X) errors]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
See Trac #8278

Simon Peyton Jones's avatar
Simon Peyton Jones committed
950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967
Note [Reporting occurs-check errors]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Given (a ~ [a]), if 'a' is a rigid type variable bound by a user-supplied
type signature, then the best thing is to report that we can't unify
a with [a], because a is a skolem variable.  That avoids the confusing
"occur-check" error message.

But nowadays when inferring the type of a function with no type signature,
even if there are errors inside, we still generalise its signature and
carry on. For example
   f x = x:x
Here we will infer somethiing like
   f :: forall a. a -> [a]
with a suspended error of (a ~ [a]).  So 'a' is now a skolem, but not
one bound by the programmer!  Here we really should report an occurs check.

So isUserSkolem distinguishes the two.

968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985
Note [Non-injective type functions]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
It's very confusing to get a message like
     Couldn't match expected type `Depend s'
            against inferred type `Depend s1'
so mkTyFunInfoMsg adds:
       NB: `Depend' is type function, and hence may not be injective

Warn of loopy local equalities that were dropped.


%************************************************************************
%*									*
                 Type-class errors
%*									*
%************************************************************************

\begin{code}
986
mkDictErr :: ReportErrCtxt -> [Ct] -> TcM ErrMsg
987
mkDictErr ctxt cts
988 989
  = ASSERT( not (null cts) )
    do { inst_envs <- tcGetInstEnvs
990
       ; fam_envs  <- tcGetFamInstEnvs
991 992 993
       ; lookups   <- mapM (lookup_cls_inst inst_envs) cts
       ; let (no_inst_cts, overlap_cts) = partition is_no_inst lookups

994
       -- Report definite no-instance errors,
995
       -- or (iff there are none) overlap errors
Gabor Greif's avatar
typos  
Gabor Greif committed
996
       -- But we report only one of them (hence 'head') because they all
997 998
       -- have the same source-location origin, to try avoid a cascade
       -- of error from one location
999
       ; (ctxt, err) <- mk_dict_err fam_envs ctxt (head (no_inst_cts ++ overlap_cts))
1000
       ; mkErrorMsg ctxt ct1 err }
1001
  where