2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section{Monadic type operations}
6 This module contains monadic operations over types that contain mutable type variables
10 TcTyVar, TcKind, TcType, TcTauType, TcThetaType, TcTyVarSet,
12 --------------------------------
13 -- Creating new mutable type variables
14 newTyVar, newSigTyVar,
15 newTyVarTy, -- Kind -> TcM TcType
16 newTyVarTys, -- Int -> Kind -> TcM [TcType]
17 newKindVar, newKindVars, newOpenTypeKind,
18 putTcTyVar, getTcTyVar,
19 newMutTyVar, readMutTyVar, writeMutTyVar,
21 --------------------------------
23 tcInstTyVar, tcInstTyVars, tcInstType,
25 --------------------------------
26 -- Checking type validity
27 Rank, UserTypeCtxt(..), checkValidType, pprHsSigCtxt,
28 SourceTyCtxt(..), checkValidTheta, checkFreeness,
29 checkValidInstHead, instTypeErr, checkAmbiguity,
32 --------------------------------
35 zonkTcTyVar, zonkTcTyVars, zonkTcTyVarsAndFV,
36 zonkTcType, zonkTcTypes, zonkTcClassConstraints, zonkTcThetaType,
37 zonkTcPredType, zonkTcTyVarToTyVar,
42 #include "HsVersions.h"
46 import HsSyn ( LHsType )
47 import TypeRep ( Type(..), PredType(..), TyNote(..), -- Friend; can see representation
50 import TcType ( TcType, TcThetaType, TcTauType, TcPredType,
51 TcTyVarSet, TcKind, TcTyVar, TyVarDetails(..),
52 tcEqType, tcCmpPred, isClassPred, mkTyConApp, typeCon,
53 tcSplitPhiTy, tcSplitPredTy_maybe, tcSplitAppTy_maybe,
54 tcSplitTyConApp_maybe, tcSplitForAllTys,
55 tcIsTyVarTy, tcSplitSigmaTy, tcIsTyVarTy,
56 isUnLiftedType, isIPPred,
58 mkAppTy, mkTyVarTy, mkTyVarTys,
59 tyVarsOfPred, getClassPredTys_maybe,
61 liftedTypeKind, defaultKind, superKind,
62 superBoxity, liftedBoxity, typeKind,
63 tyVarsOfType, tyVarsOfTypes,
65 pprPred, pprTheta, pprClassPred )
66 import Subst ( Subst, mkTopTyVarSubst, substTy )
67 import Class ( Class, classArity, className )
68 import TyCon ( TyCon, isSynTyCon, isUnboxedTupleTyCon,
69 tyConArity, tyConName )
70 import Var ( TyVar, tyVarKind, tyVarName, isTyVar,
71 mkTyVar, mkMutTyVar, isMutTyVar, mutTyVarRef )
74 import TcRnMonad -- TcType, amongst others
75 import FunDeps ( grow )
76 import Name ( Name, setNameUnique, mkSystemTvNameEncoded )
78 import CmdLineOpts ( dopt, DynFlag(..) )
79 import Util ( nOfThem, isSingleton, equalLength, notNull )
80 import ListSetOps ( removeDups )
81 import SrcLoc ( unLoc )
86 %************************************************************************
88 \subsection{New type variables}
90 %************************************************************************
93 newMutTyVar :: Name -> Kind -> TyVarDetails -> TcM TyVar
94 newMutTyVar name kind details
95 = do { ref <- newMutVar Nothing ;
96 return (mkMutTyVar name kind details ref) }
98 readMutTyVar :: TyVar -> TcM (Maybe Type)
99 readMutTyVar tyvar = readMutVar (mutTyVarRef tyvar)
101 writeMutTyVar :: TyVar -> Maybe Type -> TcM ()
102 writeMutTyVar tyvar val = writeMutVar (mutTyVarRef tyvar) val
104 newTyVar :: Kind -> TcM TcTyVar
106 = newUnique `thenM` \ uniq ->
107 newMutTyVar (mkSystemTvNameEncoded uniq FSLIT("t")) kind VanillaTv
109 newSigTyVar :: Kind -> TcM TcTyVar
111 = newUnique `thenM` \ uniq ->
112 newMutTyVar (mkSystemTvNameEncoded uniq FSLIT("s")) kind SigTv
114 newTyVarTy :: Kind -> TcM TcType
116 = newTyVar kind `thenM` \ tc_tyvar ->
117 returnM (TyVarTy tc_tyvar)
119 newTyVarTys :: Int -> Kind -> TcM [TcType]
120 newTyVarTys n kind = mappM newTyVarTy (nOfThem n kind)
122 newKindVar :: TcM TcKind
124 = newUnique `thenM` \ uniq ->
125 newMutTyVar (mkSystemTvNameEncoded uniq FSLIT("k")) superKind VanillaTv `thenM` \ kv ->
128 newKindVars :: Int -> TcM [TcKind]
129 newKindVars n = mappM (\ _ -> newKindVar) (nOfThem n ())
131 newBoxityVar :: TcM TcKind -- Really TcBoxity
132 = newUnique `thenM` \ uniq ->
133 newMutTyVar (mkSystemTvNameEncoded uniq FSLIT("bx"))
134 superBoxity VanillaTv `thenM` \ kv ->
137 newOpenTypeKind :: TcM TcKind
138 newOpenTypeKind = newBoxityVar `thenM` \ bx_var ->
139 returnM (mkTyConApp typeCon [bx_var])
143 %************************************************************************
145 \subsection{Type instantiation}
147 %************************************************************************
149 Instantiating a bunch of type variables
152 tcInstTyVars :: TyVarDetails -> [TyVar]
153 -> TcM ([TcTyVar], [TcType], Subst)
155 tcInstTyVars tv_details tyvars
156 = mappM (tcInstTyVar tv_details) tyvars `thenM` \ tc_tyvars ->
158 tys = mkTyVarTys tc_tyvars
160 returnM (tc_tyvars, tys, mkTopTyVarSubst tyvars tys)
161 -- Since the tyvars are freshly made,
162 -- they cannot possibly be captured by
163 -- any existing for-alls. Hence mkTopTyVarSubst
165 tcInstTyVar tv_details tyvar
166 = newUnique `thenM` \ uniq ->
168 name = setNameUnique (tyVarName tyvar) uniq
169 -- Note that we don't change the print-name
170 -- This won't confuse the type checker but there's a chance
171 -- that two different tyvars will print the same way
172 -- in an error message. -dppr-debug will show up the difference
173 -- Better watch out for this. If worst comes to worst, just
176 newMutTyVar name (tyVarKind tyvar) tv_details
178 tcInstType :: TyVarDetails -> TcType -> TcM ([TcTyVar], TcThetaType, TcType)
179 -- tcInstType instantiates the outer-level for-alls of a TcType with
180 -- fresh (mutable) type variables, splits off the dictionary part,
181 -- and returns the pieces.
182 tcInstType tv_details ty
183 = case tcSplitForAllTys ty of
184 ([], rho) -> -- There may be overloading despite no type variables;
185 -- (?x :: Int) => Int -> Int
187 (theta, tau) = tcSplitPhiTy rho
189 returnM ([], theta, tau)
191 (tyvars, rho) -> tcInstTyVars tv_details tyvars `thenM` \ (tyvars', _, tenv) ->
193 (theta, tau) = tcSplitPhiTy (substTy tenv rho)
195 returnM (tyvars', theta, tau)
199 %************************************************************************
201 \subsection{Putting and getting mutable type variables}
203 %************************************************************************
206 putTcTyVar :: TcTyVar -> TcType -> TcM TcType
207 getTcTyVar :: TcTyVar -> TcM (Maybe TcType)
214 | not (isMutTyVar tyvar)
215 = pprTrace "putTcTyVar" (ppr tyvar) $
219 = ASSERT( isMutTyVar tyvar )
220 writeMutTyVar tyvar (Just ty) `thenM_`
224 Getting is more interesting. The easy thing to do is just to read, thus:
227 getTcTyVar tyvar = readMutTyVar tyvar
230 But it's more fun to short out indirections on the way: If this
231 version returns a TyVar, then that TyVar is unbound. If it returns
232 any other type, then there might be bound TyVars embedded inside it.
234 We return Nothing iff the original box was unbound.
238 | not (isMutTyVar tyvar)
239 = pprTrace "getTcTyVar" (ppr tyvar) $
240 returnM (Just (mkTyVarTy tyvar))
243 = ASSERT2( isMutTyVar tyvar, ppr tyvar )
244 readMutTyVar tyvar `thenM` \ maybe_ty ->
246 Just ty -> short_out ty `thenM` \ ty' ->
247 writeMutTyVar tyvar (Just ty') `thenM_`
250 Nothing -> returnM Nothing
252 short_out :: TcType -> TcM TcType
253 short_out ty@(TyVarTy tyvar)
254 | not (isMutTyVar tyvar)
258 = readMutTyVar tyvar `thenM` \ maybe_ty ->
260 Just ty' -> short_out ty' `thenM` \ ty' ->
261 writeMutTyVar tyvar (Just ty') `thenM_`
266 short_out other_ty = returnM other_ty
270 %************************************************************************
272 \subsection{Zonking -- the exernal interfaces}
274 %************************************************************************
276 ----------------- Type variables
279 zonkTcTyVars :: [TcTyVar] -> TcM [TcType]
280 zonkTcTyVars tyvars = mappM zonkTcTyVar tyvars
282 zonkTcTyVarsAndFV :: [TcTyVar] -> TcM TcTyVarSet
283 zonkTcTyVarsAndFV tyvars = mappM zonkTcTyVar tyvars `thenM` \ tys ->
284 returnM (tyVarsOfTypes tys)
286 zonkTcTyVar :: TcTyVar -> TcM TcType
287 zonkTcTyVar tyvar = zonkTyVar (\ tv -> returnM (TyVarTy tv)) tyvar
290 ----------------- Types
293 zonkTcType :: TcType -> TcM TcType
294 zonkTcType ty = zonkType (\ tv -> returnM (TyVarTy tv)) ty
296 zonkTcTypes :: [TcType] -> TcM [TcType]
297 zonkTcTypes tys = mappM zonkTcType tys
299 zonkTcClassConstraints cts = mappM zonk cts
300 where zonk (clas, tys)
301 = zonkTcTypes tys `thenM` \ new_tys ->
302 returnM (clas, new_tys)
304 zonkTcThetaType :: TcThetaType -> TcM TcThetaType
305 zonkTcThetaType theta = mappM zonkTcPredType theta
307 zonkTcPredType :: TcPredType -> TcM TcPredType
308 zonkTcPredType (ClassP c ts)
309 = zonkTcTypes ts `thenM` \ new_ts ->
310 returnM (ClassP c new_ts)
311 zonkTcPredType (IParam n t)
312 = zonkTcType t `thenM` \ new_t ->
313 returnM (IParam n new_t)
316 ------------------- These ...ToType, ...ToKind versions
317 are used at the end of type checking
320 zonkTcKindToKind :: TcKind -> TcM Kind
321 zonkTcKindToKind tc_kind
322 = zonkType zonk_unbound_kind_var tc_kind
324 -- When zonking a kind, we want to
325 -- zonk a *kind* variable to (Type *)
326 -- zonk a *boxity* variable to *
327 zonk_unbound_kind_var kv
328 | tyVarKind kv `eqKind` superKind = putTcTyVar kv liftedTypeKind
329 | tyVarKind kv `eqKind` superBoxity = putTcTyVar kv liftedBoxity
330 | otherwise = pprPanic "zonkKindEnv" (ppr kv)
332 -- zonkTcTyVarToTyVar is applied to the *binding* occurrence
333 -- of a type variable, at the *end* of type checking. It changes
334 -- the *mutable* type variable into an *immutable* one.
336 -- It does this by making an immutable version of tv and binds tv to it.
337 -- Now any bound occurences of the original type variable will get
338 -- zonked to the immutable version.
340 zonkTcTyVarToTyVar :: TcTyVar -> TcM TyVar
341 zonkTcTyVarToTyVar tv
343 -- Make an immutable version, defaulting
344 -- the kind to lifted if necessary
345 immut_tv = mkTyVar (tyVarName tv) (defaultKind (tyVarKind tv))
346 immut_tv_ty = mkTyVarTy immut_tv
348 zap tv = putTcTyVar tv immut_tv_ty
349 -- Bind the mutable version to the immutable one
351 -- If the type variable is mutable, then bind it to immut_tv_ty
352 -- so that all other occurrences of the tyvar will get zapped too
353 zonkTyVar zap tv `thenM` \ ty2 ->
355 -- This warning shows up if the allegedly-unbound tyvar is
356 -- already bound to something. It can actually happen, and
357 -- in a harmless way (see [Silly Type Synonyms] below) so
358 -- it's only a warning
359 WARN( not (immut_tv_ty `tcEqType` ty2), ppr tv $$ ppr immut_tv $$ ppr ty2 )
364 [Silly Type Synonyms]
367 type C u a = u -- Note 'a' unused
369 foo :: (forall a. C u a -> C u a) -> u
373 bar = foo (\t -> t + t)
375 * From the (\t -> t+t) we get type {Num d} => d -> d
378 * Now unify with type of foo's arg, and we get:
379 {Num (C d a)} => C d a -> C d a
382 * Now abstract over the 'a', but float out the Num (C d a) constraint
383 because it does not 'really' mention a. (see Type.tyVarsOfType)
384 The arg to foo becomes
387 * So we get a dict binding for Num (C d a), which is zonked to give
390 * Then the /\a abstraction has a zonked 'a' in it.
392 All very silly. I think its harmless to ignore the problem.
395 %************************************************************************
397 \subsection{Zonking -- the main work-horses: zonkType, zonkTyVar}
399 %* For internal use only! *
401 %************************************************************************
404 -- zonkType is used for Kinds as well
406 -- For unbound, mutable tyvars, zonkType uses the function given to it
407 -- For tyvars bound at a for-all, zonkType zonks them to an immutable
408 -- type variable and zonks the kind too
410 zonkType :: (TcTyVar -> TcM Type) -- What to do with unbound mutable type variables
411 -- see zonkTcType, and zonkTcTypeToType
414 zonkType unbound_var_fn ty
417 go (TyConApp tycon tys) = mappM go tys `thenM` \ tys' ->
418 returnM (TyConApp tycon tys')
420 go (NewTcApp tycon tys) = mappM go tys `thenM` \ tys' ->
421 returnM (NewTcApp tycon tys')
423 go (NoteTy (SynNote ty1) ty2) = go ty1 `thenM` \ ty1' ->
424 go ty2 `thenM` \ ty2' ->
425 returnM (NoteTy (SynNote ty1') ty2')
427 go (NoteTy (FTVNote _) ty2) = go ty2 -- Discard free-tyvar annotations
429 go (PredTy p) = go_pred p `thenM` \ p' ->
432 go (FunTy arg res) = go arg `thenM` \ arg' ->
433 go res `thenM` \ res' ->
434 returnM (FunTy arg' res')
436 go (AppTy fun arg) = go fun `thenM` \ fun' ->
437 go arg `thenM` \ arg' ->
438 returnM (mkAppTy fun' arg')
439 -- NB the mkAppTy; we might have instantiated a
440 -- type variable to a type constructor, so we need
441 -- to pull the TyConApp to the top.
443 -- The two interesting cases!
444 go (TyVarTy tyvar) = zonkTyVar unbound_var_fn tyvar
446 go (ForAllTy tyvar ty) = zonkTcTyVarToTyVar tyvar `thenM` \ tyvar' ->
447 go ty `thenM` \ ty' ->
448 returnM (ForAllTy tyvar' ty')
450 go_pred (ClassP c tys) = mappM go tys `thenM` \ tys' ->
451 returnM (ClassP c tys')
452 go_pred (IParam n ty) = go ty `thenM` \ ty' ->
453 returnM (IParam n ty')
455 zonkTyVar :: (TcTyVar -> TcM Type) -- What to do for an unbound mutable variable
456 -> TcTyVar -> TcM TcType
457 zonkTyVar unbound_var_fn tyvar
458 | not (isMutTyVar tyvar) -- Not a mutable tyvar. This can happen when
459 -- zonking a forall type, when the bound type variable
460 -- needn't be mutable
461 = ASSERT( isTyVar tyvar ) -- Should not be any immutable kind vars
462 returnM (TyVarTy tyvar)
465 = getTcTyVar tyvar `thenM` \ maybe_ty ->
467 Nothing -> unbound_var_fn tyvar -- Mutable and unbound
468 Just other_ty -> zonkType unbound_var_fn other_ty -- Bound
473 %************************************************************************
475 \subsection{Checking a user type}
477 %************************************************************************
479 When dealing with a user-written type, we first translate it from an HsType
480 to a Type, performing kind checking, and then check various things that should
481 be true about it. We don't want to perform these checks at the same time
482 as the initial translation because (a) they are unnecessary for interface-file
483 types and (b) when checking a mutually recursive group of type and class decls,
484 we can't "look" at the tycons/classes yet. Also, the checks are are rather
485 diverse, and used to really mess up the other code.
487 One thing we check for is 'rank'.
489 Rank 0: monotypes (no foralls)
490 Rank 1: foralls at the front only, Rank 0 inside
491 Rank 2: foralls at the front, Rank 1 on left of fn arrow,
493 basic ::= tyvar | T basic ... basic
495 r2 ::= forall tvs. cxt => r2a
496 r2a ::= r1 -> r2a | basic
497 r1 ::= forall tvs. cxt => r0
498 r0 ::= r0 -> r0 | basic
500 Another thing is to check that type synonyms are saturated.
501 This might not necessarily show up in kind checking.
503 data T k = MkT (k Int)
509 = FunSigCtxt Name -- Function type signature
510 | ExprSigCtxt -- Expression type signature
511 | ConArgCtxt Name -- Data constructor argument
512 | TySynCtxt Name -- RHS of a type synonym decl
513 | GenPatCtxt -- Pattern in generic decl
514 -- f{| a+b |} (Inl x) = ...
515 | PatSigCtxt -- Type sig in pattern
517 | ResSigCtxt -- Result type sig
519 | ForSigCtxt Name -- Foreign inport or export signature
520 | RuleSigCtxt Name -- Signature on a forall'd variable in a RULE
521 | DefaultDeclCtxt -- Types in a default declaration
523 -- Notes re TySynCtxt
524 -- We allow type synonyms that aren't types; e.g. type List = []
526 -- If the RHS mentions tyvars that aren't in scope, we'll
527 -- quantify over them:
528 -- e.g. type T = a->a
529 -- will become type T = forall a. a->a
531 -- With gla-exts that's right, but for H98 we should complain.
534 pprHsSigCtxt :: UserTypeCtxt -> LHsType Name -> SDoc
535 pprHsSigCtxt ctxt hs_ty = pprUserTypeCtxt (unLoc hs_ty) ctxt
537 pprUserTypeCtxt ty (FunSigCtxt n) = sep [ptext SLIT("In the type signature:"), pp_sig n ty]
538 pprUserTypeCtxt ty ExprSigCtxt = sep [ptext SLIT("In an expression type signature:"), nest 2 (ppr ty)]
539 pprUserTypeCtxt ty (ConArgCtxt c) = sep [ptext SLIT("In the type of the constructor"), pp_sig c ty]
540 pprUserTypeCtxt ty (TySynCtxt c) = sep [ptext SLIT("In the RHS of the type synonym") <+> quotes (ppr c) <> comma,
541 nest 2 (ptext SLIT(", namely") <+> ppr ty)]
542 pprUserTypeCtxt ty GenPatCtxt = sep [ptext SLIT("In the type pattern of a generic definition:"), nest 2 (ppr ty)]
543 pprUserTypeCtxt ty PatSigCtxt = sep [ptext SLIT("In a pattern type signature:"), nest 2 (ppr ty)]
544 pprUserTypeCtxt ty ResSigCtxt = sep [ptext SLIT("In a result type signature:"), nest 2 (ppr ty)]
545 pprUserTypeCtxt ty (ForSigCtxt n) = sep [ptext SLIT("In the foreign declaration:"), pp_sig n ty]
546 pprUserTypeCtxt ty (RuleSigCtxt n) = sep [ptext SLIT("In the type signature:"), pp_sig n ty]
547 pprUserTypeCtxt ty DefaultDeclCtxt = sep [ptext SLIT("In a type in a `default' declaration:"), nest 2 (ppr ty)]
549 pp_sig n ty = nest 2 (ppr n <+> dcolon <+> ppr ty)
553 checkValidType :: UserTypeCtxt -> Type -> TcM ()
554 -- Checks that the type is valid for the given context
555 checkValidType ctxt ty
556 = traceTc (text "checkValidType" <+> ppr ty) `thenM_`
557 doptM Opt_GlasgowExts `thenM` \ gla_exts ->
559 rank | gla_exts = Arbitrary
561 = case ctxt of -- Haskell 98
564 DefaultDeclCtxt-> Rank 0
566 TySynCtxt _ -> Rank 0
567 ExprSigCtxt -> Rank 1
568 FunSigCtxt _ -> Rank 1
569 ConArgCtxt _ -> Rank 1 -- We are given the type of the entire
570 -- constructor, hence rank 1
571 ForSigCtxt _ -> Rank 1
572 RuleSigCtxt _ -> Rank 1
574 actual_kind = typeKind ty
576 actual_kind_is_lifted = actual_kind `eqKind` liftedTypeKind
578 kind_ok = case ctxt of
579 TySynCtxt _ -> True -- Any kind will do
580 GenPatCtxt -> actual_kind_is_lifted
581 ForSigCtxt _ -> actual_kind_is_lifted
582 other -> isTypeKind actual_kind
584 ubx_tup | not gla_exts = UT_NotOk
585 | otherwise = case ctxt of
588 -- Unboxed tuples ok in function results,
589 -- but for type synonyms we allow them even at
592 -- Check that the thing has kind Type, and is lifted if necessary
593 checkTc kind_ok (kindErr actual_kind) `thenM_`
595 -- Check the internal validity of the type itself
596 check_poly_type rank ubx_tup ty `thenM_`
598 traceTc (text "checkValidType done" <+> ppr ty)
603 data Rank = Rank Int | Arbitrary
605 decRank :: Rank -> Rank
606 decRank Arbitrary = Arbitrary
607 decRank (Rank n) = Rank (n-1)
609 ----------------------------------------
610 data UbxTupFlag = UT_Ok | UT_NotOk
611 -- The "Ok" version means "ok if -fglasgow-exts is on"
613 ----------------------------------------
614 check_poly_type :: Rank -> UbxTupFlag -> Type -> TcM ()
615 check_poly_type (Rank 0) ubx_tup ty
616 = check_tau_type (Rank 0) ubx_tup ty
618 check_poly_type rank ubx_tup ty
620 (tvs, theta, tau) = tcSplitSigmaTy ty
622 check_valid_theta SigmaCtxt theta `thenM_`
623 check_tau_type (decRank rank) ubx_tup tau `thenM_`
624 checkFreeness tvs theta `thenM_`
625 checkAmbiguity tvs theta (tyVarsOfType tau)
627 ----------------------------------------
628 check_arg_type :: Type -> TcM ()
629 -- The sort of type that can instantiate a type variable,
630 -- or be the argument of a type constructor.
631 -- Not an unboxed tuple, not a forall.
632 -- Other unboxed types are very occasionally allowed as type
633 -- arguments depending on the kind of the type constructor
635 -- For example, we want to reject things like:
637 -- instance Ord a => Ord (forall s. T s a)
639 -- g :: T s (forall b.b)
641 -- NB: unboxed tuples can have polymorphic or unboxed args.
642 -- This happens in the workers for functions returning
643 -- product types with polymorphic components.
644 -- But not in user code.
645 -- Anyway, they are dealt with by a special case in check_tau_type
648 = check_tau_type (Rank 0) UT_NotOk ty `thenM_`
649 checkTc (not (isUnLiftedType ty)) (unliftedArgErr ty)
651 ----------------------------------------
652 check_tau_type :: Rank -> UbxTupFlag -> Type -> TcM ()
653 -- Rank is allowed rank for function args
654 -- No foralls otherwise
656 check_tau_type rank ubx_tup ty@(ForAllTy _ _) = failWithTc (forAllTyErr ty)
657 check_tau_type rank ubx_tup (PredTy sty) = getDOpts `thenM` \ dflags ->
658 check_source_ty dflags TypeCtxt sty
659 check_tau_type rank ubx_tup (TyVarTy _) = returnM ()
660 check_tau_type rank ubx_tup ty@(FunTy arg_ty res_ty)
661 = check_poly_type rank UT_NotOk arg_ty `thenM_`
662 check_tau_type rank UT_Ok res_ty
664 check_tau_type rank ubx_tup (AppTy ty1 ty2)
665 = check_arg_type ty1 `thenM_` check_arg_type ty2
667 check_tau_type rank ubx_tup (NoteTy (SynNote syn) ty)
668 -- Synonym notes are built only when the synonym is
669 -- saturated (see Type.mkSynTy)
670 = doptM Opt_GlasgowExts `thenM` \ gla_exts ->
672 -- If -fglasgow-exts then don't check the 'note' part.
673 -- This allows us to instantiate a synonym defn with a
674 -- for-all type, or with a partially-applied type synonym.
675 -- e.g. type T a b = a
678 -- Here, T is partially applied, so it's illegal in H98.
679 -- But if you expand S first, then T we get just
684 -- For H98, do check the un-expanded part
685 check_tau_type rank ubx_tup syn
688 check_tau_type rank ubx_tup ty
690 check_tau_type rank ubx_tup (NoteTy other_note ty)
691 = check_tau_type rank ubx_tup ty
693 check_tau_type rank ubx_tup (NewTcApp tc tys)
694 = mappM_ check_arg_type tys
696 check_tau_type rank ubx_tup ty@(TyConApp tc tys)
698 = -- NB: Type.mkSynTy builds a TyConApp (not a NoteTy) for an unsaturated
699 -- synonym application, leaving it to checkValidType (i.e. right here)
701 checkTc syn_arity_ok arity_msg `thenM_`
702 mappM_ check_arg_type tys
704 | isUnboxedTupleTyCon tc
705 = doptM Opt_GlasgowExts `thenM` \ gla_exts ->
706 checkTc (ubx_tup_ok gla_exts) ubx_tup_msg `thenM_`
707 mappM_ (check_tau_type (Rank 0) UT_Ok) tys
708 -- Args are allowed to be unlifted, or
709 -- more unboxed tuples, so can't use check_arg_ty
712 = mappM_ check_arg_type tys
715 ubx_tup_ok gla_exts = case ubx_tup of { UT_Ok -> gla_exts; other -> False }
717 syn_arity_ok = tc_arity <= n_args
718 -- It's OK to have an *over-applied* type synonym
719 -- data Tree a b = ...
720 -- type Foo a = Tree [a]
721 -- f :: Foo a b -> ...
723 tc_arity = tyConArity tc
725 arity_msg = arityErr "Type synonym" (tyConName tc) tc_arity n_args
726 ubx_tup_msg = ubxArgTyErr ty
728 ----------------------------------------
729 forAllTyErr ty = ptext SLIT("Illegal polymorphic type:") <+> ppr ty
730 unliftedArgErr ty = ptext SLIT("Illegal unlifted type argument:") <+> ppr ty
731 ubxArgTyErr ty = ptext SLIT("Illegal unboxed tuple type as function argument:") <+> ppr ty
732 kindErr kind = ptext SLIT("Expecting an ordinary type, but found a type of kind") <+> ppr kind
737 %************************************************************************
739 \subsection{Checking a theta or source type}
741 %************************************************************************
744 -- Enumerate the contexts in which a "source type", <S>, can occur
748 -- or (N a) where N is a newtype
751 = ClassSCCtxt Name -- Superclasses of clas
752 -- class <S> => C a where ...
753 | SigmaCtxt -- Theta part of a normal for-all type
754 -- f :: <S> => a -> a
755 | DataTyCtxt Name -- Theta part of a data decl
756 -- data <S> => T a = MkT a
757 | TypeCtxt -- Source type in an ordinary type
759 | InstThetaCtxt -- Context of an instance decl
760 -- instance <S> => C [a] where ...
761 | InstHeadCtxt -- Head of an instance decl
762 -- instance ... => Eq a where ...
764 pprSourceTyCtxt (ClassSCCtxt c) = ptext SLIT("the super-classes of class") <+> quotes (ppr c)
765 pprSourceTyCtxt SigmaCtxt = ptext SLIT("the context of a polymorphic type")
766 pprSourceTyCtxt (DataTyCtxt tc) = ptext SLIT("the context of the data type declaration for") <+> quotes (ppr tc)
767 pprSourceTyCtxt InstThetaCtxt = ptext SLIT("the context of an instance declaration")
768 pprSourceTyCtxt InstHeadCtxt = ptext SLIT("the head of an instance declaration")
769 pprSourceTyCtxt TypeCtxt = ptext SLIT("the context of a type")
773 checkValidTheta :: SourceTyCtxt -> ThetaType -> TcM ()
774 checkValidTheta ctxt theta
775 = addErrCtxt (checkThetaCtxt ctxt theta) (check_valid_theta ctxt theta)
777 -------------------------
778 check_valid_theta ctxt []
780 check_valid_theta ctxt theta
781 = getDOpts `thenM` \ dflags ->
782 warnTc (notNull dups) (dupPredWarn dups) `thenM_`
783 -- Actually, in instance decls and type signatures,
784 -- duplicate constraints are eliminated by TcHsType.hoistForAllTys,
785 -- so this error can only fire for the context of a class or
787 mappM_ (check_source_ty dflags ctxt) theta
789 (_,dups) = removeDups tcCmpPred theta
791 -------------------------
792 check_source_ty dflags ctxt pred@(ClassP cls tys)
793 = -- Class predicates are valid in all contexts
794 checkTc (arity == n_tys) arity_err `thenM_`
796 -- Check the form of the argument types
797 mappM_ check_arg_type tys `thenM_`
798 checkTc (check_class_pred_tys dflags ctxt tys)
799 (predTyVarErr pred $$ how_to_allow)
802 class_name = className cls
803 arity = classArity cls
805 arity_err = arityErr "Class" class_name arity n_tys
807 how_to_allow = case ctxt of
808 InstHeadCtxt -> empty -- Should not happen
809 InstThetaCtxt -> parens undecidableMsg
810 other -> parens (ptext SLIT("Use -fglasgow-exts to permit this"))
812 check_source_ty dflags SigmaCtxt (IParam _ ty) = check_arg_type ty
813 -- Implicit parameters only allows in type
814 -- signatures; not in instance decls, superclasses etc
815 -- The reason for not allowing implicit params in instances is a bit subtle
816 -- If we allowed instance (?x::Int, Eq a) => Foo [a] where ...
817 -- then when we saw (e :: (?x::Int) => t) it would be unclear how to
818 -- discharge all the potential usas of the ?x in e. For example, a
819 -- constraint Foo [Int] might come out of e,and applying the
820 -- instance decl would show up two uses of ?x.
823 check_source_ty dflags ctxt sty = failWithTc (badSourceTyErr sty)
825 -------------------------
826 check_class_pred_tys dflags ctxt tys
828 InstHeadCtxt -> True -- We check for instance-head
829 -- formation in checkValidInstHead
830 InstThetaCtxt -> undecidable_ok || all tcIsTyVarTy tys
831 other -> gla_exts || all tyvar_head tys
833 undecidable_ok = dopt Opt_AllowUndecidableInstances dflags
834 gla_exts = dopt Opt_GlasgowExts dflags
836 -------------------------
837 tyvar_head ty -- Haskell 98 allows predicates of form
838 | tcIsTyVarTy ty = True -- C (a ty1 .. tyn)
839 | otherwise -- where a is a type variable
840 = case tcSplitAppTy_maybe ty of
841 Just (ty, _) -> tyvar_head ty
848 is ambiguous if P contains generic variables
849 (i.e. one of the Vs) that are not mentioned in tau
851 However, we need to take account of functional dependencies
852 when we speak of 'mentioned in tau'. Example:
853 class C a b | a -> b where ...
855 forall x y. (C x y) => x
856 is not ambiguous because x is mentioned and x determines y
858 NB; the ambiguity check is only used for *user* types, not for types
859 coming from inteface files. The latter can legitimately have
860 ambiguous types. Example
862 class S a where s :: a -> (Int,Int)
863 instance S Char where s _ = (1,1)
864 f:: S a => [a] -> Int -> (Int,Int)
865 f (_::[a]) x = (a*x,b)
866 where (a,b) = s (undefined::a)
868 Here the worker for f gets the type
869 fw :: forall a. S a => Int -> (# Int, Int #)
871 If the list of tv_names is empty, we have a monotype, and then we
872 don't need to check for ambiguity either, because the test can't fail
876 checkAmbiguity :: [TyVar] -> ThetaType -> TyVarSet -> TcM ()
877 checkAmbiguity forall_tyvars theta tau_tyvars
878 = mappM_ complain (filter is_ambig theta)
880 complain pred = addErrTc (ambigErr pred)
881 extended_tau_vars = grow theta tau_tyvars
883 -- Only a *class* predicate can give rise to ambiguity
884 -- An *implicit parameter* cannot. For example:
885 -- foo :: (?x :: [a]) => Int
887 -- is fine. The call site will suppply a particular 'x'
888 is_ambig pred = isClassPred pred &&
889 any ambig_var (varSetElems (tyVarsOfPred pred))
891 ambig_var ct_var = (ct_var `elem` forall_tyvars) &&
892 not (ct_var `elemVarSet` extended_tau_vars)
895 = sep [ptext SLIT("Ambiguous constraint") <+> quotes (pprPred pred),
896 nest 4 (ptext SLIT("At least one of the forall'd type variables mentioned by the constraint") $$
897 ptext SLIT("must be reachable from the type after the '=>'"))]
900 In addition, GHC insists that at least one type variable
901 in each constraint is in V. So we disallow a type like
902 forall a. Eq b => b -> b
903 even in a scope where b is in scope.
906 checkFreeness forall_tyvars theta
907 = mappM_ complain (filter is_free theta)
909 is_free pred = not (isIPPred pred)
910 && not (any bound_var (varSetElems (tyVarsOfPred pred)))
911 bound_var ct_var = ct_var `elem` forall_tyvars
912 complain pred = addErrTc (freeErr pred)
915 = sep [ptext SLIT("All of the type variables in the constraint") <+> quotes (pprPred pred) <+>
916 ptext SLIT("are already in scope"),
917 nest 4 (ptext SLIT("(at least one must be universally quantified here)"))
922 checkThetaCtxt ctxt theta
923 = vcat [ptext SLIT("In the context:") <+> pprTheta theta,
924 ptext SLIT("While checking") <+> pprSourceTyCtxt ctxt ]
926 badSourceTyErr sty = ptext SLIT("Illegal constraint") <+> pprPred sty
927 predTyVarErr pred = ptext SLIT("Non-type variables in constraint:") <+> pprPred pred
928 dupPredWarn dups = ptext SLIT("Duplicate constraint(s):") <+> pprWithCommas pprPred (map head dups)
930 arityErr kind name n m
931 = hsep [ text kind, quotes (ppr name), ptext SLIT("should have"),
932 n_arguments <> comma, text "but has been given", int m]
934 n_arguments | n == 0 = ptext SLIT("no arguments")
935 | n == 1 = ptext SLIT("1 argument")
936 | True = hsep [int n, ptext SLIT("arguments")]
940 %************************************************************************
942 \subsection{Checking for a decent instance head type}
944 %************************************************************************
946 @checkValidInstHead@ checks the type {\em and} its syntactic constraints:
947 it must normally look like: @instance Foo (Tycon a b c ...) ...@
949 The exceptions to this syntactic checking: (1)~if the @GlasgowExts@
950 flag is on, or (2)~the instance is imported (they must have been
951 compiled elsewhere). In these cases, we let them go through anyway.
953 We can also have instances for functions: @instance Foo (a -> b) ...@.
956 checkValidInstHead :: Type -> TcM (Class, [TcType])
958 checkValidInstHead ty -- Should be a source type
959 = case tcSplitPredTy_maybe ty of {
960 Nothing -> failWithTc (instTypeErr (ppr ty) empty) ;
963 case getClassPredTys_maybe pred of {
964 Nothing -> failWithTc (instTypeErr (pprPred pred) empty) ;
967 getDOpts `thenM` \ dflags ->
968 mappM_ check_arg_type tys `thenM_`
969 check_inst_head dflags clas tys `thenM_`
973 check_inst_head dflags clas tys
974 -- If GlasgowExts then check at least one isn't a type variable
975 | dopt Opt_GlasgowExts dflags
976 = check_tyvars dflags clas tys
978 -- WITH HASKELL 1.4, MUST HAVE C (T a b c)
980 Just (tycon, arg_tys) <- tcSplitTyConApp_maybe first_ty,
981 not (isSynTyCon tycon), -- ...but not a synonym
982 all tcIsTyVarTy arg_tys, -- Applied to type variables
983 equalLength (varSetElems (tyVarsOfTypes arg_tys)) arg_tys
984 -- This last condition checks that all the type variables are distinct
988 = failWithTc (instTypeErr (pprClassPred clas tys) head_shape_msg)
993 head_shape_msg = parens (text "The instance type must be of form (T a b c)" $$
994 text "where T is not a synonym, and a,b,c are distinct type variables")
996 check_tyvars dflags clas tys
997 -- Check that at least one isn't a type variable
998 -- unless -fallow-undecideable-instances
999 | dopt Opt_AllowUndecidableInstances dflags = returnM ()
1000 | not (all tcIsTyVarTy tys) = returnM ()
1001 | otherwise = failWithTc (instTypeErr (pprClassPred clas tys) msg)
1003 msg = parens (ptext SLIT("There must be at least one non-type-variable in the instance head")
1006 undecidableMsg = ptext SLIT("Use -fallow-undecidable-instances to permit this")
1010 instTypeErr pp_ty msg
1011 = sep [ptext SLIT("Illegal instance declaration for") <+> quotes pp_ty,