TcBinds.hs 70.1 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
64
import qualified GHC.LanguageExtensions as LangExt
65
import ConLike
66 67

import Control.Monad
68 69

#include "HsVersions.h"
70

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

addTypecheckedBinds :: TcGblEnv -> [LHsBinds Id] -> TcGblEnv
addTypecheckedBinds tcg_env binds
79
  | isHsBootOrSig (tcg_src tcg_env) = tcg_env
80 81 82 83 84 85
    -- 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
86 87 88
{-
************************************************************************
*                                                                      *
89
\subsection{Type-checking bindings}
Austin Seipp's avatar
Austin Seipp committed
90 91
*                                                                      *
************************************************************************
92

93
@tcBindsAndThen@ typechecks a @HsBinds@.  The "and then" part is because
94 95 96 97 98 99 100 101 102 103
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".

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

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.

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

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

        * Bind any variable for which we have a type signature
123
          to an Id with a polymorphic type.  Then when type-checking
124 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
          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
176
-}
177

178
tcTopBinds :: [(RecFlag, LHsBinds Name)] -> [LSig Name] -> TcM (TcGblEnv, TcLclEnv)
179 180
-- The TcGblEnv contains the new tcg_binds and tcg_spects
-- The TcLclEnv has an extended type envt for the new bindings
181
tcTopBinds binds sigs
cactus's avatar
cactus committed
182 183 184 185 186
  = 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) }
187 188
        ; specs <- tcImpPrags sigs   -- SPECIALISE prags for imported Ids

189 190 191 192 193 194 195 196 197
        ; 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 }
198
                           `addTypecheckedBinds` map snd binds' }
199 200

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

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 248 249 250 251 252 253 254 255 256 257 258 259 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

-- 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
              Fixed _ tc  -> return $ CompleteMatch cls tc

          check_complete_match tc_name = do
            ty_con <- tcLookupLocatedTyCon tc_name
            (_, cls) <- checkCLTypes (Fixed Nothing ty_con)
            return $ CompleteMatch cls ty_con
      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

298 299
tcRecSelBinds :: HsValBinds Name -> TcM TcGblEnv
tcRecSelBinds (ValBindsOut binds sigs)
300
  = tcExtendGlobalValEnv [sel_id | L _ (IdSig sel_id) <- sigs] $
301 302 303
    do { (rec_sel_binds, tcg_env) <- discardWarnings $
                                     tcValBinds TopLevel binds sigs getGblEnv
       ; let tcg_env' = tcg_env `addTypecheckedBinds` map snd rec_sel_binds
304 305
       ; return tcg_env' }
tcRecSelBinds (ValBindsIn {}) = panic "tcRecSelBinds"
306

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

323
badBootDeclErr :: MsgDoc
324
badBootDeclErr = text "Illegal declarations in an hs-boot file"
325

326 327
------------------------
tcLocalBinds :: HsLocalBinds Name -> TcM thing
Ian Lynagh's avatar
Ian Lynagh committed
328
             -> TcM (HsLocalBinds TcId, thing)
sof's avatar
sof committed
329

330
tcLocalBinds EmptyLocalBinds thing_inside
Ian Lynagh's avatar
Ian Lynagh committed
331 332
  = do  { thing <- thing_inside
        ; return (EmptyLocalBinds, thing) }
sof's avatar
sof committed
333

334 335 336 337
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"
338

339
tcLocalBinds (HsIPBinds (IPBinds ip_binds _)) thing_inside
340 341
  = do  { ipClass <- tcLookupClass ipClassName
        ; (given_ips, ip_binds') <-
342
            mapAndUnzipM (wrapLocSndM (tc_ip_bind ipClass)) ip_binds
343

344
        -- If the binding binds ?x = E, we  must now
Ian Lynagh's avatar
Ian Lynagh committed
345
        -- discharge any ?x constraints in expr_lie
346
        -- See Note [Implicit parameter untouchables]
347
        ; (ev_binds, result) <- checkConstraints (IPSkol ips)
348
                                  [] given_ips thing_inside
349 350

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

Ian Lynagh's avatar
Ian Lynagh committed
354 355 356
        -- I wonder if we should do these one at at time
        -- Consider     ?x = 4
        --              ?y = ?x + 1
Alan Zimmerman's avatar
Alan Zimmerman committed
357
    tc_ip_bind ipClass (IPBind (Left (L _ ip)) expr)
358
       = do { ty <- newOpenFlexiTyVarTy
359 360
            ; let p = mkStrLitTy $ hsIPNameFS ip
            ; ip_id <- newDict ipClass [ p, ty ]
361
            ; expr' <- tcMonoExpr expr (mkCheckExpType ty)
362 363 364 365 366 367
            ; 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
368
    toDict ipClass x ty = HsWrap $ mkWpCastR $
369
                          wrapIP $ mkClassPred ipClass [x,ty]
370

371 372
{- Note [Implicit parameter untouchables]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
373 374 375 376 377
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
378
doesn't float that solved constraint out (it's not an unsolved
379
wanted).  Result disaster: the (Num alpha) is again solved, this
380 381
time by defaulting.  No no no.

382
However [Oct 10] this is all handled automatically by the
383
untouchable-range idea.
Austin Seipp's avatar
Austin Seipp committed
384
-}
385

386
tcValBinds :: TopLevelFlag
387 388
           -> [(RecFlag, LHsBinds Name)] -> [LSig Name]
           -> TcM thing
389
           -> TcM ([(RecFlag, LHsBinds TcId)], thing)
390

391
tcValBinds top_lvl binds sigs thing_inside
392 393 394 395
  = do  { let patsyns = getPatSynBinds binds

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

398 399
        ; let prag_fn = mkPragEnv sigs (foldr (unionBags . snd) emptyBag binds)

400 401 402 403 404
                -- 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
405 406
            { (binds', (extra_binds', thing)) <- tcBindGroups top_lvl sig_fn prag_fn binds $ do
                   { thing <- thing_inside
407
                     -- See Note [Pattern synonym builders don't yield dependencies]
408
                     --     in RnBinds
409
                   ; patsyn_builders <- mapM tcPatSynBuilderBind patsyns
410
                   ; let extra_binds = [ (NonRecursive, builder) | builder <- patsyn_builders ]
411
                   ; return (extra_binds, thing) }
412
            ; return (binds' ++ extra_binds', thing) }}
413

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

424
tcBindGroups _ _ _ [] thing_inside
Ian Lynagh's avatar
Ian Lynagh committed
425 426
  = do  { thing <- thing_inside
        ; return ([], thing) }
427

428
tcBindGroups top_lvl sig_fn prag_fn (group : groups) thing_inside
429 430 431 432
  = do  { -- See Note [Closed binder groups]
          closed <- isClosedBndrGroup $ snd group
        ; (group', (groups', thing))
                <- tc_group top_lvl sig_fn prag_fn group closed $
433
                   tcBindGroups top_lvl sig_fn prag_fn groups thing_inside
Ian Lynagh's avatar
Ian Lynagh committed
434
        ; return (group' ++ groups', thing) }
sof's avatar
sof committed
435

436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452
-- 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.
--

453
------------------------
454
tc_group :: forall thing.
455
            TopLevelFlag -> TcSigFun -> TcPragEnv
456
         -> (RecFlag, LHsBinds Name) -> IsGroupClosed -> TcM thing
Ian Lynagh's avatar
Ian Lynagh committed
457
         -> TcM ([(RecFlag, LHsBinds TcId)], thing)
458 459

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

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

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

491
    sccs :: [SCC (LHsBind Name)]
niteria's avatar
niteria committed
492
    sccs = stronglyConnCompFromEdgedVerticesUniq (mkEdges sig_fn binds)
493

494
    go :: [SCC (LHsBind Name)] -> TcM (LHsBinds TcId, thing)
495
    go (scc:sccs) = do  { (binds1, ids1) <- tc_scc scc
496 497
                        ; (binds2, thing) <- tcExtendLetEnv top_lvl closed ids1
                                                            (go sccs)
498 499
                        ; return (binds1 `unionBags` binds2, thing) }
    go []         = do  { thing <- thing_inside; return (emptyBag, thing) }
500

501 502
    tc_scc (AcyclicSCC bind) = tc_sub_group NonRecursive [bind]
    tc_scc (CyclicSCC binds) = tc_sub_group Recursive    binds
sof's avatar
sof committed
503

504
    tc_sub_group rec_tc binds =
505
      tcPolyBinds sig_fn prag_fn Recursive rec_tc closed binds
sof's avatar
sof committed
506

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

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

535
tc_single top_lvl sig_fn prag_fn lbind closed thing_inside
536
  = do { (binds1, ids) <- tcPolyBinds sig_fn prag_fn
537
                                      NonRecursive NonRecursive
538
                                      closed
539
                                      [lbind]
540
       ; thing <- tcExtendLetEnv top_lvl closed ids thing_inside
cactus's avatar
cactus committed
541
       ; return (binds1, thing) }
542

543
------------------------
544
type BKey = Int -- Just number off the bindings
545

546 547
mkEdges :: TcSigFun -> LHsBinds Name -> [Node BKey (LHsBind Name)]
-- See Note [Polymorphic recursion] in HsBinds.
548
mkEdges sig_fn binds
niteria's avatar
niteria committed
549
  = [ (bind, key, [key | n <- nonDetEltsUFM (bind_fvs (unLoc bind)),
Ian Lynagh's avatar
Ian Lynagh committed
550
                         Just key <- [lookupNameEnv key_map n], no_sig n ])
551 552
    | (bind, key) <- keyd_binds
    ]
niteria's avatar
niteria committed
553 554 555
    -- 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.
556 557
  where
    no_sig :: Name -> Bool
thomasw's avatar
thomasw committed
558
    no_sig n = noCompleteSig (sig_fn n)
559 560 561

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

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

566
------------------------
567
tcPolyBinds :: TcSigFun -> TcPragEnv
568 569 570
            -> RecFlag         -- Whether the group is really recursive
            -> RecFlag         -- Whether it's recursive after breaking
                               -- dependencies based on type signatures
571
            -> IsGroupClosed   -- Whether the group is closed
572
            -> [LHsBind Name]  -- None are PatSynBind
573
            -> TcM (LHsBinds TcId, [TcId])
574

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

586
tcPolyBinds sig_fn prag_fn rec_group rec_tc closed bind_list
587
  = setSrcSpan loc                              $
588
    recoverM (recoveryCode binder_names sig_fn) $ do
589
        -- Set up main recover; take advantage of any type sigs
590

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

601 602 603
    ; traceTc "} End of bindings for" (vcat [ ppr binder_names, ppr rec_group
                                            , vcat [ppr id <+> ppr (idType id) | id <- poly_ids]
                                          ])
604

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

613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638
--------------
-- 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
*                                                                      *
********************************************************************* -}

639
tcPolyNoGen     -- No generalisation whatsoever
640
  :: RecFlag       -- Whether it's recursive after breaking
641
                   -- dependencies based on type signatures
642
  -> TcPragEnv -> TcSigFun
643
  -> [LHsBind Name]
644
  -> TcM (LHsBinds TcId, [TcId])
645

646 647
tcPolyNoGen rec_tc prag_fn tc_sig_fn bind_list
  = do { (binds', mono_infos) <- tcMonoBinds rec_tc tc_sig_fn
648
                                             (LetGblBndr prag_fn)
649
                                             bind_list
650
       ; mono_ids' <- mapM tc_mono_info mono_infos
651
       ; return (binds', mono_ids') }
652
  where
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
653
    tc_mono_info (MBI { mbi_poly_name = name, mbi_mono_id = mono_id })
654 655
      = 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
656 657 658 659
           -- 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
660

661 662 663 664 665 666 667 668 669 670

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

tcPolyCheck :: TcPragEnv
            -> TcIdSigInfo     -- Must be a complete signature
            -> LHsBind Name    -- Must be a FunBind
671
            -> TcM (LHsBinds TcId, [TcId])
672
-- There is just one binding,
673
--   it is a Funbind
Simon Peyton Jones's avatar
Simon Peyton Jones committed
674
--   it has a complete type signature,
675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699
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)
       ; (tv_prs, theta, tau) <- tcInstType (tcInstSigTyVars sig_loc) poly_id
                -- 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
             skol_info = SigSkol ctxt (mkPhiTy theta tau)
             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
700 701
       ; spec_prags <- tcSpecPrags poly_id prag_sigs
       ; poly_id    <- addInlinePrags poly_id prag_sigs
702

703
       ; mod <- getModule
704 705 706 707
       ; let bind' = FunBind { fun_id      = L nm_loc mono_id
                             , fun_matches = matches'
                             , fun_co_fn   = co_fn
                             , bind_fvs    = placeHolderNamesTc
708
                             , fun_tick    = funBindTicks nm_loc mono_id mod prag_sigs }
709

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
710
             abs_bind = L loc $ AbsBindsSig
711 712 713 714
                        { 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
715
                        , abs_sig_ev_bind = ev_binds
716
                        , abs_sig_bind    = L loc bind' }
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
717

718
       ; return (unitBag abs_bind, [poly_id]) }
719

720 721 722
tcPolyCheck _prag_fn sig bind
  = pprPanic "tcPolyCheck" (ppr sig $$ ppr bind)

723 724 725 726 727 728 729
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
730
          = sl_fs $ unLoc cc_str
731 732 733 734 735 736 737 738
          | 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
  = []

739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757
{- 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
*                                                                      *
********************************************************************* -}
758 759

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

771 772 773 774
       ; 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
775

776 777
       ; mapM_ (checkOverloadedSig mono) sigs

778
       ; traceTc "simplifyInfer call" (ppr tclvl $$ ppr name_taus $$ ppr wanted)
779
       ; (qtvs, givens, ev_binds)
780
                 <- simplifyInfer tclvl infer_mode sigs name_taus wanted
781

782
       ; let inferred_theta = map evVarPred givens
783
       ; exports <- checkNoErrs $
784
                    mapM (mkExport prag_fn qtvs inferred_theta) mono_infos
thomasw's avatar
thomasw committed
785

786
       ; loc <- getSrcSpanM
787
       ; let poly_ids = map abe_poly exports
788
             abs_bind = L loc $
789
                        AbsBinds { abs_tvs = qtvs
790
                                 , abs_ev_vars = givens, abs_ev_binds = [ev_binds]
791
                                 , abs_exports = exports, abs_binds = binds' }
792

793 794
       ; traceTc "Binding:" (ppr (poly_ids `zip` map idType poly_ids))
       ; return (unitBag abs_bind, poly_ids) }
795
         -- poly_ids are guaranteed zonked by mkExport
796 797

--------------
798
mkExport :: TcPragEnv
chak@cse.unsw.edu.au.'s avatar
chak@cse.unsw.edu.au. committed
799
         -> [TyVar] -> TcThetaType      -- Both already zonked
Ian Lynagh's avatar
Ian Lynagh committed
800
         -> MonoBindInfo
801
         -> TcM (ABExport Id)
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
802
-- Only called for generalisation plan InferGen, not by CheckGen or NoGen
803 804 805
--
-- mkExport generates exports with
--      zonked type variables,
Ian Lynagh's avatar
Ian Lynagh committed
806
--      zonked poly_ids
807 808 809 810
-- 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
811
-- type environment; see the invariant on TcEnv.tcExtendIdEnv
812

813
-- Pre-condition: the qtvs and theta are already zonked
814

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
815 816 817 818
mkExport prag_fn qtvs theta
         mono_info@(MBI { mbi_poly_name = poly_name
                        , mbi_sig       = mb_sig
                        , mbi_mono_id   = mono_id })
819
  = do  { mono_ty <- zonkTcType (idType mono_id)
820
        ; poly_id <- mkInferredPolyId qtvs theta poly_name mb_sig mono_ty
821 822

        -- NB: poly_id has a zonked type
823
        ; poly_id <- addInlinePrags poly_id prag_sigs
824
        ; spec_prags <- tcSpecPrags poly_id prag_sigs
Ian Lynagh's avatar
Ian Lynagh committed
825
                -- tcPrags requires a zonked poly_id
826

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

        ; wrap <- if sel_poly_ty `eqType` poly_ty  -- NB: eqType ignores visibility
836 837 838 839
                  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
                  else addErrCtxtM (mk_impedence_match_msg mono_info sel_poly_ty poly_ty) $
840
                       tcSubType_NC sig_ctxt sel_poly_ty poly_ty
841

manav's avatar
manav committed
842
        ; warn_missing_sigs <- woptM Opt_WarnMissingLocalSignatures
843 844
        ; when warn_missing_sigs $
              localSigWarn Opt_WarnMissingLocalSignatures poly_id mb_sig
845

846
        ; return (ABE { abe_wrap = wrap
847
                        -- abe_wrap :: idType poly_id ~ (forall qtvs. theta => mono_ty)
848 849
                      , abe_poly = poly_id
                      , abe_mono = mono_id
850
                      , abe_prags = SpecPrags spec_prags}) }
851
  where
852
    prag_sigs = lookupPragEnv prag_fn poly_name
853
    sig_ctxt  = InfSigCtxt poly_name
854

855
mkInferredPolyId :: [TyVar] -> TcThetaType
856
                 -> Name -> Maybe TcIdSigInst -> TcType
857
                 -> TcM TcId
858 859 860
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
861 862 863 864 865 866 867 868
  = return poly_id

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

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

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

eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
884
       ; traceTc "mkInferredPolyId" (vcat [ppr poly_name, ppr qtvs, ppr theta'
Simon Peyton Jones's avatar
Simon Peyton Jones committed
885 886
                                          , ppr inferred_poly_ty])
       ; addErrCtxtM (mk_inf_msg poly_name inferred_poly_ty) $
887
         checkValidType (InfSigCtxt poly_name) inferred_poly_ty
888
         -- See Note [Validity of inferred types]
889

890
       ; return (mkLocalIdOrCoVar poly_name inferred_poly_ty) }
891

892

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

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

920
  | Just wc_var <- wcx
921
  = do { annotated_theta <- zonkTcTypes annotated_theta
922 923 924 925 926
       ; 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
927
             my_theta = pickCapturedPreds free_tvs inferred_theta
928 929 930 931

       -- 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.
932
       -- NB: inferred_theta already includes all the annotated constraints
933 934 935
             inferred_diff = [ pred
                             | pred <- my_theta
                             , all (not . (`eqType` pred)) annotated_theta ]
936 937
       ; ctuple <- mk_ctuple inferred_diff
       ; writeMetaTyVar wc_var ctuple
938
       ; traceTc "completeTheta" $
939
            vcat [ ppr sig
940 941
                 , ppr annotated_theta, ppr inferred_theta
                 , ppr inferred_diff ]
thomasw's avatar
thomasw committed
942

943
       ; return (mk_binders free_tvs, my_theta) }
944

945
  | otherwise  -- A complete type signature is dealt with in mkInferredPolyId
946
  = pprPanic "chooseInferredQuantifiers" (ppr sig)
947

thomasw's avatar
thomasw committed
948
  where
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
949 950
    spec_tv_set = mkVarSet $ map snd annotated_tvs
    mk_binders free_tvs
951
      = [ mkTyVarBinder vis tv
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
952 953 954
        | tv <- qtvs
        , tv `elemVarSet` free_tvs
        , let vis | tv `elemVarSet` spec_tv_set = Specified
955
                  | otherwise                   = Inferred ]
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
956
                          -- Pulling from qtvs maintains original order
957

958