TcBinds.hs 70.3 KB
Newer Older
Austin Seipp's avatar
Austin Seipp committed
1 2 3 4
{-
(c) The University of Glasgow 2006
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998

5
\section[TcBinds]{TcBinds}
Austin Seipp's avatar
Austin Seipp committed
6
-}
7

8
{-# LANGUAGE CPP, RankNTypes, ScopedTypeVariables #-}
9
{-# LANGUAGE FlexibleContexts #-}
10

11
module TcBinds ( tcLocalBinds, tcTopBinds, tcRecSelBinds,
12
                 tcHsBootSigs, tcPolyCheck,
13
                 tcVectDecls, addTypecheckedBinds,
14 15
                 chooseInferredQuantifiers,
                 badBootDeclErr ) where
16

17
import {-# SOURCE #-} TcMatches ( tcGRHSsPat, tcMatchesFun )
18
import {-# SOURCE #-} TcExpr  ( tcMonoExpr )
19
import {-# SOURCE #-} TcPatSyn ( tcInferPatSynDecl, tcCheckPatSynDecl
20
                               , tcPatSynBuilderBind )
21 22
import CoreSyn (Tickish (..))
import CostCentre (mkUserCC)
Simon Marlow's avatar
Simon Marlow committed
23
import DynFlags
24
import FastString
Simon Marlow's avatar
Simon Marlow committed
25
import HsSyn
26
import HscTypes( isHsBootOrSig )
27
import TcSigs
28
import TcRnMonad
Simon Marlow's avatar
Simon Marlow committed
29 30 31
import TcEnv
import TcUnify
import TcSimplify
32
import TcEvidence
Simon Marlow's avatar
Simon Marlow committed
33 34 35
import TcHsType
import TcPat
import TcMType
36 37
import FamInstEnv( normaliseType )
import FamInst( tcGetFamInstEnvs )
38
import TyCon
Simon Marlow's avatar
Simon Marlow committed
39
import TcType
40
import Type( mkStrLitTy, tidyOpenType, mkTyVarBinder, splitTyConApp_maybe)
Simon Marlow's avatar
Simon Marlow committed
41
import TysPrim
42
import TysWiredIn( cTupleTyConName )
Simon Marlow's avatar
Simon Marlow committed
43
import Id
44
import Var
45
import VarSet
46
import VarEnv( TidyEnv )
47
import Module
Simon Marlow's avatar
Simon Marlow committed
48
import Name
49
import NameSet
50
import NameEnv
Simon Marlow's avatar
Simon Marlow committed
51
import SrcLoc
52
import Bag
53
import ListSetOps
Simon Marlow's avatar
Simon Marlow committed
54 55 56 57 58
import ErrUtils
import Digraph
import Maybes
import Util
import BasicTypes
59
import Outputable
60
import PrelNames( ipClassName )
61
import TcValidity (checkValidType)
62
import Unique (getUnique)
niteria's avatar
niteria committed
63
import UniqFM
David Feuer's avatar
David Feuer committed
64
import UniqSet
65
import qualified GHC.LanguageExtensions as LangExt
66
import ConLike
67 68

import Control.Monad
69 70

#include "HsVersions.h"
71

72 73 74 75 76 77 78 79
{- *********************************************************************
*                                                                      *
               A useful helper function
*                                                                      *
********************************************************************* -}

addTypecheckedBinds :: TcGblEnv -> [LHsBinds Id] -> TcGblEnv
addTypecheckedBinds tcg_env binds
80
  | isHsBootOrSig (tcg_src tcg_env) = tcg_env
81 82 83 84 85 86
    -- Do not add the code for record-selector bindings
    -- when compiling hs-boot files
  | otherwise = tcg_env { tcg_binds = foldr unionBags
                                            (tcg_binds tcg_env)
                                            binds }

Austin Seipp's avatar
Austin Seipp committed
87 88 89
{-
************************************************************************
*                                                                      *
90
\subsection{Type-checking bindings}
Austin Seipp's avatar
Austin Seipp committed
91 92
*                                                                      *
************************************************************************
93

94
@tcBindsAndThen@ typechecks a @HsBinds@.  The "and then" part is because
95 96 97 98 99 100 101 102 103 104
it needs to know something about the {\em usage} of the things bound,
so that it can create specialisations of them.  So @tcBindsAndThen@
takes a function which, given an extended environment, E, typechecks
the scope of the bindings returning a typechecked thing and (most
important) an LIE.  It is this LIE which is then used as the basis for
specialising the things bound.

@tcBindsAndThen@ also takes a "combiner" which glues together the
bindings and the "thing" to make a new "thing".

105
The real work is done by @tcBindWithSigsAndThen@.
106 107 108 109 110 111 112 113 114 115

Recursive and non-recursive binds are handled in essentially the same
way: because of uniques there are no scoping issues left.  The only
difference is that non-recursive bindings can bind primitive values.

Even for non-recursive binding groups we add typings for each binder
to the LVE for the following reason.  When each individual binding is
checked the type of its LHS is unified with that of its RHS; and
type-checking the LHS of course requires that the binder is in scope.

116 117 118
At the top-level the LIE is sure to contain nothing but constant
dictionaries, which we resolve at the module level.

119 120
Note [Polymorphic recursion]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121
The game plan for polymorphic recursion in the code above is
122 123

        * Bind any variable for which we have a type signature
124
          to an Id with a polymorphic type.  Then when type-checking
125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176
          the RHSs we'll make a full polymorphic call.

This fine, but if you aren't a bit careful you end up with a horrendous
amount of partial application and (worse) a huge space leak. For example:

        f :: Eq a => [a] -> [a]
        f xs = ...f...

If we don't take care, after typechecking we get

        f = /\a -> \d::Eq a -> let f' = f a d
                               in
                               \ys:[a] -> ...f'...

Notice the the stupid construction of (f a d), which is of course
identical to the function we're executing.  In this case, the
polymorphic recursion isn't being used (but that's a very common case).
This can lead to a massive space leak, from the following top-level defn
(post-typechecking)

        ff :: [Int] -> [Int]
        ff = f Int dEqInt

Now (f dEqInt) evaluates to a lambda that has f' as a free variable; but
f' is another thunk which evaluates to the same thing... and you end
up with a chain of identical values all hung onto by the CAF ff.

        ff = f Int dEqInt

           = let f' = f Int dEqInt in \ys. ...f'...

           = let f' = let f' = f Int dEqInt in \ys. ...f'...
                      in \ys. ...f'...

Etc.

NOTE: a bit of arity anaysis would push the (f a d) inside the (\ys...),
which would make the space leak go away in this case

Solution: when typechecking the RHSs we always have in hand the
*monomorphic* Ids for each binding.  So we just need to make sure that
if (Method f a d) shows up in the constraints emerging from (...f...)
we just use the monomorphic Id.  We achieve this by adding monomorphic Ids
to the "givens" when simplifying constraints.  That's what the "lies_avail"
is doing.

Then we get

        f = /\a -> \d::Eq a -> letrec
                                 fm = \ys:[a] -> ...fm...
                               in
                               fm
Austin Seipp's avatar
Austin Seipp committed
177
-}
178

179
tcTopBinds :: [(RecFlag, LHsBinds Name)] -> [LSig Name] -> TcM (TcGblEnv, TcLclEnv)
180 181
-- The TcGblEnv contains the new tcg_binds and tcg_spects
-- The TcLclEnv has an extended type envt for the new bindings
182
tcTopBinds binds sigs
cactus's avatar
cactus committed
183 184 185 186 187
  = do  { -- Pattern synonym bindings populate the global environment
          (binds', (tcg_env, tcl_env)) <- tcValBinds TopLevel binds sigs $
            do { gbl <- getGblEnv
               ; lcl <- getLclEnv
               ; return (gbl, lcl) }
188 189
        ; specs <- tcImpPrags sigs   -- SPECIALISE prags for imported Ids

190 191 192 193 194 195 196 197 198
        ; complete_matches <- setEnvs (tcg_env, tcl_env) $ tcCompleteSigs sigs
        ; traceTc "complete_matches" (ppr binds $$ ppr sigs)
        ; traceTc "complete_matches" (ppr complete_matches)

        ; let { tcg_env' = tcg_env { tcg_imp_specs
                                      = specs ++ tcg_imp_specs tcg_env
                                   , tcg_complete_matches
                                      = complete_matches
                                          ++ tcg_complete_matches tcg_env }
199
                           `addTypecheckedBinds` map snd binds' }
200 201

        ; return (tcg_env', tcl_env) }
202
        -- The top level bindings are flattened into a giant
Ian Lynagh's avatar
Ian Lynagh committed
203
        -- implicitly-mutually-recursive LHsBinds
cactus's avatar
cactus committed
204

205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247

-- Note [Typechecking Complete Matches]
-- Much like when a user bundled a pattern synonym, the result types of
-- all the constructors in the match pragma must be consistent.
--
-- If we allowed pragmas with inconsistent types then it would be
-- impossible to ever match every constructor in the list and so
-- the pragma would be useless.





-- This is only used in `tcCompleteSig`. We fold over all the conlikes,
-- this accumulator keeps track of the first `ConLike` with a concrete
-- return type. After fixing the return type, all other constructors with
-- a fixed return type must agree with this.
--
-- The fields of `Fixed` cache the first conlike and its return type so
-- that that we can compare all the other conlikes to it. The conlike is
-- stored for error messages.
--
-- `Nothing` in the case that the type is fixed by a type signature
data CompleteSigType = AcceptAny | Fixed (Maybe ConLike) TyCon

tcCompleteSigs  :: [LSig Name] -> TcM [CompleteMatch]
tcCompleteSigs sigs =
  let
      doOne :: Sig Name -> TcM (Maybe CompleteMatch)
      doOne c@(CompleteMatchSig _ lns mtc)
        = fmap Just $ do
           addErrCtxt (text "In" <+> ppr c) $
            case mtc of
              Nothing -> infer_complete_match
              Just tc -> check_complete_match tc
        where

          checkCLTypes acc = foldM checkCLType (acc, []) (unLoc lns)

          infer_complete_match = do
            (res, cls) <- checkCLTypes AcceptAny
            case res of
              AcceptAny -> failWithTc ambiguousError
248
              Fixed _ tc  -> return $ mkMatch cls tc
249 250 251 252

          check_complete_match tc_name = do
            ty_con <- tcLookupLocatedTyCon tc_name
            (_, cls) <- checkCLTypes (Fixed Nothing ty_con)
253 254 255 256 257 258 259
            return $ mkMatch cls ty_con

          mkMatch :: [ConLike] -> TyCon -> CompleteMatch
          mkMatch cls ty_con = CompleteMatch {
            completeMatchConLikes = map conLikeName cls,
            completeMatchTyCon = tyConName ty_con
            }
260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304
      doOne _ = return Nothing

      ambiguousError :: SDoc
      ambiguousError =
        text "A type signature must be provided for a set of polymorphic"
          <+> text "pattern synonyms."


      -- See note [Typechecking Complete Matches]
      checkCLType :: (CompleteSigType, [ConLike]) -> Located Name
                  -> TcM (CompleteSigType, [ConLike])
      checkCLType (cst, cs) n = do
        cl <- addLocM tcLookupConLike n
        let   (_,_,_,_,_,_, res_ty) = conLikeFullSig cl
              res_ty_con = fst <$> splitTyConApp_maybe res_ty
        case (cst, res_ty_con) of
          (AcceptAny, Nothing) -> return (AcceptAny, cl:cs)
          (AcceptAny, Just tc) -> return (Fixed (Just cl) tc, cl:cs)
          (Fixed mfcl tc, Nothing)  -> return (Fixed mfcl tc, cl:cs)
          (Fixed mfcl tc, Just tc') ->
            if tc == tc'
              then return (Fixed mfcl tc, cl:cs)
              else case mfcl of
                     Nothing ->
                      addErrCtxt (text "In" <+> ppr cl) $
                        failWithTc typeSigErrMsg
                     Just cl -> failWithTc (errMsg cl)
             where
              typeSigErrMsg :: SDoc
              typeSigErrMsg =
                text "Couldn't match expected type"
                      <+> quotes (ppr tc)
                      <+> text "with"
                      <+> quotes (ppr tc')

              errMsg :: ConLike -> SDoc
              errMsg fcl =
                text "Cannot form a group of complete patterns from patterns"
                  <+> quotes (ppr fcl) <+> text "and" <+> quotes (ppr cl)
                  <+> text "as they match different type constructors"
                  <+> parens (quotes (ppr tc)
                               <+> text "resp."
                               <+> quotes (ppr tc'))
  in  mapMaybeM (addLocM doOne) sigs

305 306
tcRecSelBinds :: HsValBinds Name -> TcM TcGblEnv
tcRecSelBinds (ValBindsOut binds sigs)
307
  = tcExtendGlobalValEnv [sel_id | L _ (IdSig sel_id) <- sigs] $
308 309 310
    do { (rec_sel_binds, tcg_env) <- discardWarnings $
                                     tcValBinds TopLevel binds sigs getGblEnv
       ; let tcg_env' = tcg_env `addTypecheckedBinds` map snd rec_sel_binds
311 312
       ; return tcg_env' }
tcRecSelBinds (ValBindsIn {}) = panic "tcRecSelBinds"
313

314
tcHsBootSigs :: [(RecFlag, LHsBinds Name)] -> [LSig Name] -> TcM [Id]
315 316
-- A hs-boot file has only one BindGroup, and it only has type
-- signatures in it.  The renamer checked all this
317
tcHsBootSigs binds sigs
Ian Lynagh's avatar
Ian Lynagh committed
318
  = do  { checkTc (null binds) badBootDeclErr
319
        ; concat <$> mapM (addLocM tc_boot_sig) (filter isTypeLSig sigs) }
320
  where
321
    tc_boot_sig (TypeSig lnames hs_ty) = mapM f lnames
322
      where
323
        f (L _ name)
Richard Eisenberg's avatar
Richard Eisenberg committed
324
          = do { sigma_ty <- tcHsSigWcType (FunSigCtxt name False) hs_ty
325
               ; return (mkVanillaGlobal name sigma_ty) }
Ian Lynagh's avatar
Ian Lynagh committed
326
        -- Notice that we make GlobalIds, not LocalIds
Ian Lynagh's avatar
Ian Lynagh committed
327
    tc_boot_sig s = pprPanic "tcHsBootSigs/tc_boot_sig" (ppr s)
328

329
badBootDeclErr :: MsgDoc
330
badBootDeclErr = text "Illegal declarations in an hs-boot file"
331

332 333
------------------------
tcLocalBinds :: HsLocalBinds Name -> TcM thing
Ian Lynagh's avatar
Ian Lynagh committed
334
             -> TcM (HsLocalBinds TcId, thing)
sof's avatar
sof committed
335

336
tcLocalBinds EmptyLocalBinds thing_inside
Ian Lynagh's avatar
Ian Lynagh committed
337 338
  = do  { thing <- thing_inside
        ; return (EmptyLocalBinds, thing) }
sof's avatar
sof committed
339

340 341 342 343
tcLocalBinds (HsValBinds (ValBindsOut binds sigs)) thing_inside
  = do  { (binds', thing) <- tcValBinds NotTopLevel binds sigs thing_inside
        ; return (HsValBinds (ValBindsOut binds' sigs), thing) }
tcLocalBinds (HsValBinds (ValBindsIn {})) _ = panic "tcLocalBinds"
344

345
tcLocalBinds (HsIPBinds (IPBinds ip_binds _)) thing_inside
346 347
  = do  { ipClass <- tcLookupClass ipClassName
        ; (given_ips, ip_binds') <-
348
            mapAndUnzipM (wrapLocSndM (tc_ip_bind ipClass)) ip_binds
349

350
        -- If the binding binds ?x = E, we  must now
Ian Lynagh's avatar
Ian Lynagh committed
351
        -- discharge any ?x constraints in expr_lie
352
        -- See Note [Implicit parameter untouchables]
353
        ; (ev_binds, result) <- checkConstraints (IPSkol ips)
354
                                  [] given_ips thing_inside
355 356

        ; return (HsIPBinds (IPBinds ip_binds' ev_binds), result) }
357
  where
Alan Zimmerman's avatar
Alan Zimmerman committed
358
    ips = [ip | L _ (IPBind (Left (L _ ip)) _) <- ip_binds]
359

Ian Lynagh's avatar
Ian Lynagh committed
360 361 362
        -- I wonder if we should do these one at at time
        -- Consider     ?x = 4
        --              ?y = ?x + 1
Alan Zimmerman's avatar
Alan Zimmerman committed
363
    tc_ip_bind ipClass (IPBind (Left (L _ ip)) expr)
364
       = do { ty <- newOpenFlexiTyVarTy
365 366
            ; let p = mkStrLitTy $ hsIPNameFS ip
            ; ip_id <- newDict ipClass [ p, ty ]
367
            ; expr' <- tcMonoExpr expr (mkCheckExpType ty)
368 369 370 371 372 373
            ; let d = toDict ipClass p ty `fmap` expr'
            ; return (ip_id, (IPBind (Right ip_id) d)) }
    tc_ip_bind _ (IPBind (Right {}) _) = panic "tc_ip_bind"

    -- Coerces a `t` into a dictionry for `IP "x" t`.
    -- co : t -> IP "x" t
374
    toDict ipClass x ty = HsWrap $ mkWpCastR $
375
                          wrapIP $ mkClassPred ipClass [x,ty]
376

377 378
{- Note [Implicit parameter untouchables]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
379 380 381 382 383
We add the type variables in the types of the implicit parameters
as untouchables, not so much because we really must not unify them,
but rather because we otherwise end up with constraints like this
    Num alpha, Implic { wanted = alpha ~ Int }
The constraint solver solves alpha~Int by unification, but then
384
doesn't float that solved constraint out (it's not an unsolved
385
wanted).  Result disaster: the (Num alpha) is again solved, this
386 387
time by defaulting.  No no no.

388
However [Oct 10] this is all handled automatically by the
389
untouchable-range idea.
Austin Seipp's avatar
Austin Seipp committed
390
-}
391

392
tcValBinds :: TopLevelFlag
393 394
           -> [(RecFlag, LHsBinds Name)] -> [LSig Name]
           -> TcM thing
395
           -> TcM ([(RecFlag, LHsBinds TcId)], thing)
396

397
tcValBinds top_lvl binds sigs thing_inside
398 399 400 401
  = do  { let patsyns = getPatSynBinds binds

            -- Typecheck the signature
        ; (poly_ids, sig_fn) <- tcAddPatSynPlaceholders patsyns $
402
                                tcTySigs sigs
Ian Lynagh's avatar
Ian Lynagh committed
403

404 405
        ; let prag_fn = mkPragEnv sigs (foldr (unionBags . snd) emptyBag binds)

406 407 408 409 410
                -- Extend the envt right away with all the Ids
                -- declared with complete type signatures
                -- Do not extend the TcIdBinderStack; instead
                -- we extend it on a per-rhs basis in tcExtendForRhs
        ; tcExtendLetEnvIds top_lvl [(idName id, id) | id <- poly_ids] $ do
411 412
            { (binds', (extra_binds', thing)) <- tcBindGroups top_lvl sig_fn prag_fn binds $ do
                   { thing <- thing_inside
413
                     -- See Note [Pattern synonym builders don't yield dependencies]
414
                     --     in RnBinds
415
                   ; patsyn_builders <- mapM tcPatSynBuilderBind patsyns
416
                   ; let extra_binds = [ (NonRecursive, builder) | builder <- patsyn_builders ]
417
                   ; return (extra_binds, thing) }
418
            ; return (binds' ++ extra_binds', thing) }}
419

420
------------------------
421
tcBindGroups :: TopLevelFlag -> TcSigFun -> TcPragEnv
Ian Lynagh's avatar
Ian Lynagh committed
422 423
             -> [(RecFlag, LHsBinds Name)] -> TcM thing
             -> TcM ([(RecFlag, LHsBinds TcId)], thing)
424 425
-- Typecheck a whole lot of value bindings,
-- one strongly-connected component at a time
426
-- Here a "strongly connected component" has the strightforward
427
-- meaning of a group of bindings that mention each other,
428
-- ignoring type signatures (that part comes later)
429

430
tcBindGroups _ _ _ [] thing_inside
Ian Lynagh's avatar
Ian Lynagh committed
431 432
  = do  { thing <- thing_inside
        ; return ([], thing) }
433

434
tcBindGroups top_lvl sig_fn prag_fn (group : groups) thing_inside
435 436 437 438
  = do  { -- See Note [Closed binder groups]
          closed <- isClosedBndrGroup $ snd group
        ; (group', (groups', thing))
                <- tc_group top_lvl sig_fn prag_fn group closed $
439
                   tcBindGroups top_lvl sig_fn prag_fn groups thing_inside
Ian Lynagh's avatar
Ian Lynagh committed
440
        ; return (group' ++ groups', thing) }
sof's avatar
sof committed
441

442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458
-- Note [Closed binder groups]
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~
--
--  A mutually recursive group is "closed" if all of the free variables of
--  the bindings are closed. For example
--
-- >  h = \x -> let f = ...g...
-- >                g = ....f...x...
-- >             in ...
--
-- Here @g@ is not closed because it mentions @x@; and hence neither is @f@
-- closed.
--
-- So we need to compute closed-ness on each strongly connected components,
-- before we sub-divide it based on what type signatures it has.
--

459
------------------------
460
tc_group :: forall thing.
461
            TopLevelFlag -> TcSigFun -> TcPragEnv
462
         -> (RecFlag, LHsBinds Name) -> IsGroupClosed -> TcM thing
Ian Lynagh's avatar
Ian Lynagh committed
463
         -> TcM ([(RecFlag, LHsBinds TcId)], thing)
464 465

-- Typecheck one strongly-connected component of the original program.
466
-- We get a list of groups back, because there may
467 468
-- be specialisations etc as well

469
tc_group top_lvl sig_fn prag_fn (NonRecursive, binds) closed thing_inside
Ian Lynagh's avatar
Ian Lynagh committed
470 471
        -- A single non-recursive binding
        -- We want to keep non-recursive things non-recursive
472
        -- so that we desugar unlifted bindings correctly
cactus's avatar
cactus committed
473 474
  = do { let bind = case bagToList binds of
                 [bind] -> bind
475 476
                 []     -> panic "tc_group: empty list of binds"
                 _      -> panic "tc_group: NonRecursive binds is not a singleton bag"
477 478
       ; (bind', thing) <- tc_single top_lvl sig_fn prag_fn bind closed
                                     thing_inside
cactus's avatar
cactus committed
479
       ; return ( [(NonRecursive, bind')], thing) }
480

481
tc_group top_lvl sig_fn prag_fn (Recursive, binds) closed thing_inside
482 483
  =     -- To maximise polymorphism, we do a new
        -- strongly-connected-component analysis, this time omitting
Ian Lynagh's avatar
Ian Lynagh committed
484
        -- any references to variables with type signatures.
485
        -- (This used to be optional, but isn't now.)
486
        -- See Note [Polymorphic recursion] in HsBinds.
487
    do  { traceTc "tc_group rec" (pprLHsBinds binds)
cactus's avatar
cactus committed
488
        ; when hasPatSyn $ recursivePatSynErr binds
489
        ; (binds1, thing) <- go sccs
490
        ; return ([(Recursive, binds1)], thing) }
Ian Lynagh's avatar
Ian Lynagh committed
491
                -- Rec them all together
492
  where
493
    hasPatSyn = anyBag (isPatSyn . unLoc) binds
cactus's avatar
cactus committed
494 495 496
    isPatSyn PatSynBind{} = True
    isPatSyn _ = False

497
    sccs :: [SCC (LHsBind Name)]
niteria's avatar
niteria committed
498
    sccs = stronglyConnCompFromEdgedVerticesUniq (mkEdges sig_fn binds)
499

500
    go :: [SCC (LHsBind Name)] -> TcM (LHsBinds TcId, thing)
501
    go (scc:sccs) = do  { (binds1, ids1) <- tc_scc scc
502 503
                        ; (binds2, thing) <- tcExtendLetEnv top_lvl closed ids1
                                                            (go sccs)
504 505
                        ; return (binds1 `unionBags` binds2, thing) }
    go []         = do  { thing <- thing_inside; return (emptyBag, thing) }
506

507 508
    tc_scc (AcyclicSCC bind) = tc_sub_group NonRecursive [bind]
    tc_scc (CyclicSCC binds) = tc_sub_group Recursive    binds
sof's avatar
sof committed
509

510
    tc_sub_group rec_tc binds =
511
      tcPolyBinds sig_fn prag_fn Recursive rec_tc closed binds
sof's avatar
sof committed
512

cactus's avatar
cactus committed
513 514 515
recursivePatSynErr :: OutputableBndr name => LHsBinds name -> TcM a
recursivePatSynErr binds
  = failWithTc $
516
    hang (text "Recursive pattern synonym definition with following bindings:")
517
       2 (vcat $ map pprLBind . bagToList $ binds)
cactus's avatar
cactus committed
518
  where
519
    pprLoc loc  = parens (text "defined at" <+> ppr loc)
cactus's avatar
cactus committed
520 521 522 523
    pprLBind (L loc bind) = pprWithCommas ppr (collectHsBindBinders bind) <+>
                            pprLoc loc

tc_single :: forall thing.
524
            TopLevelFlag -> TcSigFun -> TcPragEnv
525
          -> LHsBind Name -> IsGroupClosed -> TcM thing
cactus's avatar
cactus committed
526
          -> TcM (LHsBinds TcId, thing)
527 528 529
tc_single _top_lvl sig_fn _prag_fn
          (L _ (PatSynBind psb@PSB{ psb_id = L _ name }))
          _ thing_inside
530 531
  = do { (aux_binds, tcg_env) <- tc_pat_syn_decl
       ; thing <- setGblEnv tcg_env thing_inside
cactus's avatar
cactus committed
532 533
       ; return (aux_binds, thing)
       }
534
  where
535
    tc_pat_syn_decl :: TcM (LHsBinds TcId, TcGblEnv)
536
    tc_pat_syn_decl = case sig_fn name of
537 538 539
        Nothing                 -> tcInferPatSynDecl psb
        Just (TcPatSynSig tpsi) -> tcCheckPatSynDecl psb tpsi
        Just                 _  -> panic "tc_single"
540

541
tc_single top_lvl sig_fn prag_fn lbind closed thing_inside
542
  = do { (binds1, ids) <- tcPolyBinds sig_fn prag_fn
543
                                      NonRecursive NonRecursive
544
                                      closed
545
                                      [lbind]
546
       ; thing <- tcExtendLetEnv top_lvl closed ids thing_inside
cactus's avatar
cactus committed
547
       ; return (binds1, thing) }
548

549
------------------------
550
type BKey = Int -- Just number off the bindings
551

552 553
mkEdges :: TcSigFun -> LHsBinds Name -> [Node BKey (LHsBind Name)]
-- See Note [Polymorphic recursion] in HsBinds.
554
mkEdges sig_fn binds
David Feuer's avatar
David Feuer committed
555
  = [ (bind, key, [key | n <- nonDetEltsUniqSet (bind_fvs (unLoc bind)),
Ian Lynagh's avatar
Ian Lynagh committed
556
                         Just key <- [lookupNameEnv key_map n], no_sig n ])
557 558
    | (bind, key) <- keyd_binds
    ]
niteria's avatar
niteria committed
559 560 561
    -- It's OK to use nonDetEltsUFM here as stronglyConnCompFromEdgedVertices
    -- is still deterministic even if the edges are in nondeterministic order
    -- as explained in Note [Deterministic SCC] in Digraph.
562 563
  where
    no_sig :: Name -> Bool
thomasw's avatar
thomasw committed
564
    no_sig n = noCompleteSig (sig_fn n)
565 566 567

    keyd_binds = bagToList binds `zip` [0::BKey ..]

Ian Lynagh's avatar
Ian Lynagh committed
568
    key_map :: NameEnv BKey     -- Which binding it comes from
569
    key_map = mkNameEnv [(bndr, key) | (L _ bind, key) <- keyd_binds
570
                                     , bndr <- collectHsBindBinders bind ]
571

572
------------------------
573
tcPolyBinds :: TcSigFun -> TcPragEnv
574 575 576
            -> RecFlag         -- Whether the group is really recursive
            -> RecFlag         -- Whether it's recursive after breaking
                               -- dependencies based on type signatures
577
            -> IsGroupClosed   -- Whether the group is closed
578
            -> [LHsBind Name]  -- None are PatSynBind
579
            -> TcM (LHsBinds TcId, [TcId])
580

581
-- Typechecks a single bunch of values bindings all together,
582 583 584
-- and generalises them.  The bunch may be only part of a recursive
-- group, because we use type signatures to maximise polymorphism
--
585 586
-- Returns a list because the input may be a single non-recursive binding,
-- in which case the dependency order of the resulting bindings is
587 588
-- important.
--
589
-- Knows nothing about the scope of the bindings
590
-- None of the bindings are pattern synonyms
591

592
tcPolyBinds sig_fn prag_fn rec_group rec_tc closed bind_list
593
  = setSrcSpan loc                              $
594
    recoverM (recoveryCode binder_names sig_fn) $ do
595
        -- Set up main recover; take advantage of any type sigs
596

597
    { traceTc "------------------------------------------------" Outputable.empty
598
    ; traceTc "Bindings for {" (ppr binder_names)
599
    ; dflags   <- getDynFlags
600
    ; let plan = decideGeneralisationPlan dflags bind_list closed sig_fn
601
    ; traceTc "Generalisation plan" (ppr plan)
602
    ; result@(_, poly_ids) <- case plan of
603 604
         NoGen              -> tcPolyNoGen rec_tc prag_fn sig_fn bind_list
         InferGen mn        -> tcPolyInfer rec_tc prag_fn sig_fn mn bind_list
605
         CheckGen lbind sig -> tcPolyCheck prag_fn sig lbind
606

607 608 609
    ; traceTc "} End of bindings for" (vcat [ ppr binder_names, ppr rec_group
                                            , vcat [ppr id <+> ppr (idType id) | id <- poly_ids]
                                          ])
610

611
    ; return result }
612
  where
613 614
    binder_names = collectHsBindListBinders bind_list
    loc = foldr1 combineSrcSpans (map getLoc bind_list)
615
         -- The mbinds have been dependency analysed and
616
         -- may no longer be adjacent; so find the narrowest
chak@cse.unsw.edu.au.'s avatar
chak@cse.unsw.edu.au. committed
617
         -- span that includes them all
618

619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
--------------
-- If typechecking the binds fails, then return with each
-- signature-less binder given type (forall a.a), to minimise
-- subsequent error messages
recoveryCode :: [Name] -> TcSigFun -> TcM (LHsBinds TcId, [Id])
recoveryCode binder_names sig_fn
  = do  { traceTc "tcBindsWithSigs: error recovery" (ppr binder_names)
        ; let poly_ids = map mk_dummy binder_names
        ; return (emptyBag, poly_ids) }
  where
    mk_dummy name
      | Just sig <- sig_fn name
      , Just poly_id <- completeSigPolyId_maybe sig
      = poly_id
      | otherwise
      = mkLocalId name forall_a_a

forall_a_a :: TcType
forall_a_a = mkSpecForAllTys [runtimeRep1TyVar, openAlphaTyVar] openAlphaTy

{- *********************************************************************
*                                                                      *
                         tcPolyNoGen
*                                                                      *
********************************************************************* -}

645
tcPolyNoGen     -- No generalisation whatsoever
646
  :: RecFlag       -- Whether it's recursive after breaking
647
                   -- dependencies based on type signatures
648
  -> TcPragEnv -> TcSigFun
649
  -> [LHsBind Name]
650
  -> TcM (LHsBinds TcId, [TcId])
651

652 653
tcPolyNoGen rec_tc prag_fn tc_sig_fn bind_list
  = do { (binds', mono_infos) <- tcMonoBinds rec_tc tc_sig_fn
654
                                             (LetGblBndr prag_fn)
655
                                             bind_list
656
       ; mono_ids' <- mapM tc_mono_info mono_infos
657
       ; return (binds', mono_ids') }
658
  where
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
659
    tc_mono_info (MBI { mbi_poly_name = name, mbi_mono_id = mono_id })
660 661
      = do { _specs <- tcSpecPrags mono_id (lookupPragEnv prag_fn name)
           ; return mono_id }
chak@cse.unsw.edu.au.'s avatar
chak@cse.unsw.edu.au. committed
662 663 664 665
           -- NB: tcPrags generates error messages for
           --     specialisation pragmas for non-overloaded sigs
           -- Indeed that is why we call it here!
           -- So we can safely ignore _specs
666

667 668 669 670 671 672 673 674 675 676

{- *********************************************************************
*                                                                      *
                         tcPolyCheck
*                                                                      *
********************************************************************* -}

tcPolyCheck :: TcPragEnv
            -> TcIdSigInfo     -- Must be a complete signature
            -> LHsBind Name    -- Must be a FunBind
677
            -> TcM (LHsBinds TcId, [TcId])
678
-- There is just one binding,
679
--   it is a Funbind
Simon Peyton Jones's avatar
Simon Peyton Jones committed
680
--   it has a complete type signature,
681 682 683 684 685 686 687 688
tcPolyCheck prag_fn
            (CompleteSig { sig_bndr  = poly_id
                         , sig_ctxt  = ctxt
                         , sig_loc   = sig_loc })
            (L loc (FunBind { fun_id = L nm_loc name
                            , fun_matches = matches }))
  = setSrcSpan sig_loc $
    do { traceTc "tcPolyCheck" (ppr poly_id $$ ppr sig_loc)
689
       ; (tv_prs, theta, tau) <- tcInstType tcInstSkolTyVars poly_id
690 691 692 693 694
                -- See Note [Instantiate sig with fresh variables]

       ; mono_name <- newNameAt (nameOccName name) nm_loc
       ; ev_vars   <- newEvVars theta
       ; let mono_id   = mkLocalId mono_name tau
695
             skol_info = SigSkol ctxt (idType poly_id) tv_prs
696 697 698 699 700 701 702 703 704 705
             skol_tvs  = map snd tv_prs

       ; (ev_binds, (co_fn, matches'))
            <- checkConstraints skol_info skol_tvs ev_vars $
               tcExtendIdBndrs [TcIdBndr mono_id NotTopLevel]  $
               tcExtendTyVarEnv2 tv_prs $
               setSrcSpan loc           $
               tcMatchesFun (L nm_loc mono_name) matches (mkCheckExpType tau)

       ; let prag_sigs = lookupPragEnv prag_fn name
706 707
       ; spec_prags <- tcSpecPrags poly_id prag_sigs
       ; poly_id    <- addInlinePrags poly_id prag_sigs
708

709
       ; mod <- getModule
710 711 712 713
       ; let bind' = FunBind { fun_id      = L nm_loc mono_id
                             , fun_matches = matches'
                             , fun_co_fn   = co_fn
                             , bind_fvs    = placeHolderNamesTc
714
                             , fun_tick    = funBindTicks nm_loc mono_id mod prag_sigs }
715

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
716
             abs_bind = L loc $ AbsBindsSig
717 718 719 720
                        { abs_sig_export  = poly_id
                        , abs_tvs         = skol_tvs
                        , abs_ev_vars     = ev_vars
                        , abs_sig_prags   = SpecPrags spec_prags
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
721
                        , abs_sig_ev_bind = ev_binds
722
                        , abs_sig_bind    = L loc bind' }
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
723

724
       ; return (unitBag abs_bind, [poly_id]) }
725

726 727 728
tcPolyCheck _prag_fn sig bind
  = pprPanic "tcPolyCheck" (ppr sig $$ ppr bind)

729 730 731 732 733 734 735
funBindTicks :: SrcSpan -> TcId -> Module -> [LSig Name] -> [Tickish TcId]
funBindTicks loc fun_id mod sigs
  | (mb_cc_str : _) <- [ cc_name | L _ (SCCFunSig _ _ cc_name) <- sigs ]
      -- this can only be a singleton list, as duplicate pragmas are rejected
      -- by the renamer
  , let cc_str
          | Just cc_str <- mb_cc_str
736
          = sl_fs $ unLoc cc_str
737 738 739 740 741 742 743 744
          | otherwise
          = getOccFS (Var.varName fun_id)
        cc_name = moduleNameFS (moduleName mod) `appendFS` consFS '.' cc_str
        cc = mkUserCC cc_name mod loc (getUnique fun_id)
  = [ProfNote cc True True]
  | otherwise
  = []

745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763
{- Note [Instantiate sig with fresh variables]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
It's vital to instantiate a type signature with fresh variables.
For example:
      type T = forall a. [a] -> [a]
      f :: T;
      f = g where { g :: T; g = <rhs> }

 We must not use the same 'a' from the defn of T at both places!!
(Instantiation is only necessary because of type synonyms.  Otherwise,
it's all cool; each signature has distinct type variables from the renamer.)
-}


{- *********************************************************************
*                                                                      *
                         tcPolyInfer
*                                                                      *
********************************************************************* -}
764 765

tcPolyInfer
766
  :: RecFlag       -- Whether it's recursive after breaking
767
                   -- dependencies based on type signatures
768
  -> TcPragEnv -> TcSigFun
769
  -> Bool         -- True <=> apply the monomorphism restriction
770
  -> [LHsBind Name]
771 772
  -> TcM (LHsBinds TcId, [TcId])
tcPolyInfer rec_tc prag_fn tc_sig_fn mono bind_list
773
  = do { (tclvl, wanted, (binds', mono_infos))
774
             <- pushLevelAndCaptureConstraints  $
775 776
                tcMonoBinds rec_tc tc_sig_fn LetLclBndr bind_list

777 778 779 780
       ; let name_taus  = [ (mbi_poly_name info, idType (mbi_mono_id info))
                          | info <- mono_infos ]
             sigs       = [ sig | MBI { mbi_sig = Just sig } <- mono_infos ]
             infer_mode = if mono then ApplyMR else NoRestrictions
781

782 783
       ; mapM_ (checkOverloadedSig mono) sigs

784
       ; traceTc "simplifyInfer call" (ppr tclvl $$ ppr name_taus $$ ppr wanted)
785
       ; (qtvs, givens, ev_binds)
786
                 <- simplifyInfer tclvl infer_mode sigs name_taus wanted
787

788
       ; let inferred_theta = map evVarPred givens
789
       ; exports <- checkNoErrs $
790
                    mapM (mkExport prag_fn qtvs inferred_theta) mono_infos
thomasw's avatar
thomasw committed
791

792
       ; loc <- getSrcSpanM
793
       ; let poly_ids = map abe_poly exports
794
             abs_bind = L loc $
795
                        AbsBinds { abs_tvs = qtvs
796
                                 , abs_ev_vars = givens, abs_ev_binds = [ev_binds]
797
                                 , abs_exports = exports, abs_binds = binds' }
798

799 800
       ; traceTc "Binding:" (ppr (poly_ids `zip` map idType poly_ids))
       ; return (unitBag abs_bind, poly_ids) }
801
         -- poly_ids are guaranteed zonked by mkExport
802 803

--------------
804
mkExport :: TcPragEnv
chak@cse.unsw.edu.au.'s avatar
chak@cse.unsw.edu.au. committed
805
         -> [TyVar] -> TcThetaType      -- Both already zonked
Ian Lynagh's avatar
Ian Lynagh committed
806
         -> MonoBindInfo
807
         -> TcM (ABExport Id)
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
808
-- Only called for generalisation plan InferGen, not by CheckGen or NoGen
809 810 811
--
-- mkExport generates exports with
--      zonked type variables,
Ian Lynagh's avatar
Ian Lynagh committed
812
--      zonked poly_ids
813 814 815 816
-- The former is just because no further unifications will change
-- the quantified type variables, so we can fix their final form
-- right now.
-- The latter is needed because the poly_ids are used to extend the
817
-- type environment; see the invariant on TcEnv.tcExtendIdEnv
818

819
-- Pre-condition: the qtvs and theta are already zonked
820

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
821 822 823 824
mkExport prag_fn qtvs theta
         mono_info@(MBI { mbi_poly_name = poly_name
                        , mbi_sig       = mb_sig
                        , mbi_mono_id   = mono_id })
825
  = do  { mono_ty <- zonkTcType (idType mono_id)
826
        ; poly_id <- mkInferredPolyId qtvs theta poly_name mb_sig mono_ty
827 828

        -- NB: poly_id has a zonked type
829
        ; poly_id <- addInlinePrags poly_id prag_sigs
830
        ; spec_prags <- tcSpecPrags poly_id prag_sigs
Ian Lynagh's avatar
Ian Lynagh committed
831
                -- tcPrags requires a zonked poly_id
832

Gabor Greif's avatar
Gabor Greif committed
833
        -- See Note [Impedance matching]
834 835
        -- NB: we have already done checkValidType, including an ambiguity check,
        --     on the type; either when we checked the sig or in mkInferredPolyId
836
        ; let poly_ty     = idType poly_id
837
              sel_poly_ty = mkInfSigmaTy qtvs theta mono_ty
838
                -- This type is just going into tcSubType,
839
                -- so Inferred vs. Specified doesn't matter
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
840 841

        ; wrap <- if sel_poly_ty `eqType` poly_ty  -- NB: eqType ignores visibility
842 843 844
                  then return idHsWrapper  -- Fast path; also avoids complaint when we infer
                                           -- an ambiguouse type and have AllowAmbiguousType
                                           -- e..g infer  x :: forall a. F a -> Int
Gabor Greif's avatar
Gabor Greif committed
845
                  else addErrCtxtM (mk_impedance_match_msg mono_info sel_poly_ty poly_ty) $
846
                       tcSubType_NC sig_ctxt sel_poly_ty poly_ty
847

manav's avatar
manav committed
848
        ; warn_missing_sigs <- woptM Opt_WarnMissingLocalSignatures
849 850
        ; when warn_missing_sigs $
              localSigWarn Opt_WarnMissingLocalSignatures poly_id mb_sig
851

852
        ; return (ABE { abe_wrap = wrap
853
                        -- abe_wrap :: idType poly_id ~ (forall qtvs. theta => mono_ty)
854 855
                      , abe_poly = poly_id
                      , abe_mono = mono_id
856
                      , abe_prags = SpecPrags spec_prags}) }
857
  where
858
    prag_sigs = lookupPragEnv prag_fn poly_name
859
    sig_ctxt  = InfSigCtxt poly_name
860

861
mkInferredPolyId :: [TyVar] -> TcThetaType
862
                 -> Name -> Maybe TcIdSigInst -> TcType
863
                 -> TcM TcId
864 865 866
mkInferredPolyId qtvs inferred_theta poly_name mb_sig_inst mono_ty
  | Just (TISI { sig_inst_sig = sig })  <- mb_sig_inst
  , CompleteSig { sig_bndr = poly_id } <- sig
867 868 869 870
  = return poly_id

  | otherwise  -- Either no type sig or partial type sig
  = checkNoErrs $  -- The checkNoErrs ensures that if the type is ambiguous
Gabor Greif's avatar
Gabor Greif committed
871
                   -- we don't carry on to the impedance matching, and generate
872 873 874
                   -- a duplicate ambiguity error.  There is a similar
                   -- checkNoErrs for complete type signatures too.
    do { fam_envs <- tcGetFamInstEnvs
875
       ; let (_co, mono_ty') = normaliseType fam_envs Nominal mono_ty
876 877
               -- Unification may not have normalised the type,
               -- (see Note [Lazy flattening] in TcFlatten) so do it
878 879 880
               -- here to make it as uncomplicated as possible.
               -- Example: f :: [F Int] -> Bool
               -- should be rewritten to f :: [Char] -> Bool, if possible
881
               --
Gabor Greif's avatar
Gabor Greif committed
882
               -- We can discard the coercion _co, because we'll reconstruct
883
               -- it in the call to tcSubType below
884

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
885
       ; (binders, theta') <- chooseInferredQuantifiers inferred_theta
886
                                (tyCoVarsOfType mono_ty') qtvs mb_sig_inst
887

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
888
       ; let inferred_poly_ty = mkForAllTys binders (mkPhiTy theta' mono_ty')
889

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
890
       ; traceTc "mkInferredPolyId" (vcat [ppr poly_name, ppr qtvs, ppr theta'
Simon Peyton Jones's avatar
Simon Peyton Jones committed
891 892
                                          , ppr inferred_poly_ty])
       ; addErrCtxtM (mk_inf_msg poly_name inferred_poly_ty) $
893
         checkValidType (InfSigCtxt poly_name) inferred_poly_ty
894
         -- See Note [Validity of inferred types]
895

896
       ; return (mkLocalIdOrCoVar poly_name inferred_poly_ty) }
897

898

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
899 900 901
chooseInferredQuantifiers :: TcThetaType   -- inferred
                          -> TcTyVarSet    -- tvs free in tau type
                          -> [TcTyVar]     -- inferred quantified tvs
902
                          -> Maybe TcIdSigInst
903
                          -> TcM ([TyVarBinder], TcThetaType)
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
904
chooseInferredQuantifiers inferred_theta tau_tvs qtvs Nothing
905
  = -- No type signature (partial or complete) for this binder,
906
    do { let free_tvs = closeOverKinds (growThetaTyVars inferred_theta tau_tvs)
907
                        -- Include kind variables!  Trac #7916
908
             my_theta = pickCapturedPreds free_tvs inferred_theta
909
             binders  = [ mkTyVarBinder Inferred tv
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
910 911 912
                        | tv <- qtvs
                        , tv `elemVarSet` free_tvs ]
       ; return (binders, my_theta) }
913

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
914
chooseInferredQuantifiers inferred_theta tau_tvs qtvs
915 916 917 918 919
                          (Just (TISI { sig_inst_sig   = sig  -- Always PartialSig
                                      , sig_inst_wcx   = wcx
                                      , sig_inst_theta = annotated_theta
                                      , sig_inst_skols = annotated_tvs }))
  | Nothing <- wcx
920 921
  = do { annotated_theta <- zonkTcTypes annotated_theta
       ; let free_tvs = closeOverKinds (tyCoVarsOfTypes annotated_theta
922
                                        `unionVarSet` tau_tvs)
923
       ; traceTc "ciq" (vcat [ ppr sig, ppr annotated_theta, ppr free_tvs])
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
924
       ; return (mk_binders free_tvs, annotated_theta) }
925

926
  | Just wc_var <- wcx
927
  = do { annotated_theta <- zonkTcTypes annotated_theta
928 929 930 931 932
       ; let free_tvs = closeOverKinds (growThetaTyVars inferred_theta seed_tvs)
                          -- growThetaVars just like the no-type-sig case
                          -- Omitting this caused #12844
             seed_tvs = tyCoVarsOfTypes annotated_theta  -- These are put there
                        `unionVarSet` tau_tvs            --       by the user
933
             my_theta = pickCapturedPreds free_tvs inferred_theta
934 935 936 937

       -- Report the inferred constraints for an extra-constraints wildcard/hole as
       -- an error message, unless the PartialTypeSignatures flag is enabled. In this
       -- case, the extra inferred constraints are accepted without complaining.
938
       -- NB: inferred_theta already includes all the annotated constraints
939 940 941
             inferred_diff = [ pred
                             | pred <- my_theta
                             , all (not . (`eqType` pred)) annotated_theta ]
942 943
       ; ctuple <- mk_ctuple inferred_diff
       ; writeMetaTyVar wc_var ctuple
944
       ; traceTc "completeTheta" $
945
            vcat [ ppr sig
946 947
                 , ppr annotated_theta, ppr inferred_theta
                 , ppr inferred_diff ]
thomasw's avatar
thomasw committed
948

949
       ; return (mk_binders free_tvs, my_theta) }
950