2 % (c) The AQUA Project, Glasgow University, 1996-1998
4 \section[TcTyClsDecls]{Typecheck type and class declarations}
8 tcTyAndClassDecls, tcIdxTyInstDecl
11 #include "HsVersions.h"
13 import HsSyn ( TyClDecl(..), HsConDetails(..), HsTyVarBndr(..),
14 ConDecl(..), Sig(..), NewOrData(..), ResType(..),
15 tyClDeclTyVars, isSynDecl, isClassDecl, isIdxTyDecl,
16 isKindSigDecl, hsConArgs, LTyClDecl, tcdName,
17 hsTyVarName, LHsTyVarBndr, LHsType, HsType(..),
20 import HsTypes ( HsBang(..), getBangStrictness )
21 import BasicTypes ( RecFlag(..), StrictnessMark(..) )
22 import HscTypes ( implicitTyThings, ModDetails )
23 import BuildTyCl ( buildClass, buildAlgTyCon, buildSynTyCon, buildDataCon,
24 mkDataTyConRhs, mkNewTyConRhs )
26 import TcEnv ( TyThing(..),
27 tcLookupLocated, tcLookupLocatedGlobal,
28 tcExtendGlobalEnv, tcExtendKindEnv, tcExtendKindEnvTvs,
29 tcExtendRecEnv, tcLookupTyVar, InstInfo )
30 import TcTyDecls ( calcRecFlags, calcClassCycles, calcSynCycles )
31 import TcClassDcl ( tcClassSigs, tcAddDeclCtxt )
32 import TcHsType ( kcHsTyVars, kcHsLiftedSigType, kcHsType,
33 kcHsContext, tcTyVarBndrs, tcHsKindedType, tcHsKindedContext,
34 kcHsSigType, tcHsBangType, tcLHsConResTy,
35 tcDataKindSig, kcCheckHsType )
36 import TcMType ( newKindVar, checkValidTheta, checkValidType,
38 UserTypeCtxt(..), SourceTyCtxt(..) )
39 import TcType ( TcKind, TcType, Type, tyVarsOfType, mkPhiTy,
40 mkArrowKind, liftedTypeKind, mkTyVarTys,
41 tcSplitSigmaTy, tcEqTypes, tcGetTyVar_maybe )
42 import Type ( PredType(..), splitTyConApp_maybe, mkTyVarTy,
43 newTyConInstRhs, isLiftedTypeKind, Kind
44 -- pprParendType, pprThetaArrow
46 import Generics ( validGenericMethodType, canDoGenerics )
47 import Class ( Class, className, classTyCon, DefMeth(..), classBigSig, classTyVars )
48 import TyCon ( TyCon, AlgTyConRhs( AbstractTyCon, OpenDataTyCon,
50 SynTyConRhs( OpenSynTyCon, SynonymTyCon ),
51 tyConDataCons, mkForeignTyCon, isProductTyCon,
52 isRecursiveTyCon, isOpenTyCon,
53 tyConStupidTheta, synTyConRhs, isSynTyCon, tyConName,
54 isNewTyCon, tyConKind )
55 import DataCon ( DataCon, dataConUserType, dataConName,
56 dataConFieldLabels, dataConTyCon, dataConAllTyVars,
57 dataConFieldType, dataConResTys )
58 import Var ( TyVar, idType, idName )
59 import VarSet ( elemVarSet, mkVarSet )
60 import Name ( Name, getSrcLoc )
62 import Maybe ( isJust, fromJust, isNothing )
63 import Maybes ( expectJust )
64 import Unify ( tcMatchTys, tcMatchTyX )
65 import Util ( zipLazy, isSingleton, notNull, sortLe )
66 import List ( partition )
67 import SrcLoc ( Located(..), unLoc, getLoc, srcLocSpan )
68 import ListSetOps ( equivClasses, minusList )
69 import List ( delete )
70 import Digraph ( SCC(..) )
71 import DynFlags ( DynFlag( Opt_GlasgowExts, Opt_Generics,
72 Opt_UnboxStrictFields ) )
76 %************************************************************************
78 \subsection{Type checking for type and class declarations}
80 %************************************************************************
84 Consider a mutually-recursive group, binding
85 a type constructor T and a class C.
87 Step 1: getInitialKind
88 Construct a KindEnv by binding T and C to a kind variable
91 In that environment, do a kind check
93 Step 3: Zonk the kinds
95 Step 4: buildTyConOrClass
96 Construct an environment binding T to a TyCon and C to a Class.
97 a) Their kinds comes from zonking the relevant kind variable
98 b) Their arity (for synonyms) comes direct from the decl
99 c) The funcional dependencies come from the decl
100 d) The rest comes a knot-tied binding of T and C, returned from Step 4
101 e) The variances of the tycons in the group is calculated from
105 In this environment, walk over the decls, constructing the TyCons and Classes.
106 This uses in a strict way items (a)-(c) above, which is why they must
107 be constructed in Step 4. Feed the results back to Step 4.
108 For this step, pass the is-recursive flag as the wimp-out flag
112 Step 6: Extend environment
113 We extend the type environment with bindings not only for the TyCons and Classes,
114 but also for their "implicit Ids" like data constructors and class selectors
116 Step 7: checkValidTyCl
117 For a recursive group only, check all the decls again, just
118 to check all the side conditions on validity. We could not
119 do this before because we were in a mutually recursive knot.
121 Identification of recursive TyCons
122 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
123 The knot-tying parameters: @rec_details_list@ is an alist mapping @Name@s to
126 Identifying a TyCon as recursive serves two purposes
128 1. Avoid infinite types. Non-recursive newtypes are treated as
129 "transparent", like type synonyms, after the type checker. If we did
130 this for all newtypes, we'd get infinite types. So we figure out for
131 each newtype whether it is "recursive", and add a coercion if so. In
132 effect, we are trying to "cut the loops" by identifying a loop-breaker.
134 2. Avoid infinite unboxing. This is nothing to do with newtypes.
138 Well, this function diverges, but we don't want the strictness analyser
139 to diverge. But the strictness analyser will diverge because it looks
140 deeper and deeper into the structure of T. (I believe there are
141 examples where the function does something sane, and the strictness
142 analyser still diverges, but I can't see one now.)
144 Now, concerning (1), the FC2 branch currently adds a coercion for ALL
145 newtypes. I did this as an experiment, to try to expose cases in which
146 the coercions got in the way of optimisations. If it turns out that we
147 can indeed always use a coercion, then we don't risk recursive types,
148 and don't need to figure out what the loop breakers are.
150 For newtype *families* though, we will always have a coercion, so they
151 are always loop breakers! So you can easily adjust the current
152 algorithm by simply treating all newtype families as loop breakers (and
153 indeed type families). I think.
156 tcTyAndClassDecls :: ModDetails -> [LTyClDecl Name]
157 -> TcM TcGblEnv -- Input env extended by types and classes
158 -- and their implicit Ids,DataCons
159 tcTyAndClassDecls boot_details allDecls
160 = do { -- Omit instances of indexed types; they are handled together
161 -- with the *heads* of class instances
162 ; let decls = filter (not . isIdxTyDecl . unLoc) allDecls
164 -- First check for cyclic type synonysm or classes
165 -- See notes with checkCycleErrs
166 ; checkCycleErrs decls
168 ; traceTc (text "tcTyAndCl" <+> ppr mod)
169 ; (syn_tycons, alg_tyclss) <- fixM (\ ~(rec_syn_tycons, rec_alg_tyclss) ->
170 do { let { -- Seperate ordinary synonyms from all other type and
171 -- class declarations and add all associated type
172 -- declarations from type classes. The latter is
173 -- required so that the temporary environment for the
174 -- knot includes all associated family declarations.
175 ; (syn_decls, alg_decls) = partition (isSynDecl . unLoc)
177 ; alg_at_decls = concatMap addATs alg_decls
179 -- Extend the global env with the knot-tied results
180 -- for data types and classes
182 -- We must populate the environment with the loop-tied
183 -- T's right away, because the kind checker may "fault
184 -- in" some type constructors that recursively
186 ; let gbl_things = mkGlobalThings alg_at_decls rec_alg_tyclss
187 ; tcExtendRecEnv gbl_things $ do
189 -- Kind-check the declarations
190 { (kc_syn_decls, kc_alg_decls) <- kcTyClDecls syn_decls alg_decls
192 ; let { -- Calculate rec-flag
193 ; calc_rec = calcRecFlags boot_details rec_alg_tyclss
194 ; tc_decl = addLocM (tcTyClDecl calc_rec) }
195 -- Type-check the type synonyms, and extend the envt
196 ; syn_tycons <- tcSynDecls kc_syn_decls
197 ; tcExtendGlobalEnv syn_tycons $ do
199 -- Type-check the data types and classes
200 { alg_tyclss <- mappM tc_decl kc_alg_decls
201 ; return (syn_tycons, concat alg_tyclss)
203 -- Finished with knot-tying now
204 -- Extend the environment with the finished things
205 ; tcExtendGlobalEnv (syn_tycons ++ alg_tyclss) $ do
207 -- Perform the validity check
208 { traceTc (text "ready for validity check")
209 ; mappM_ (addLocM checkValidTyCl) decls
210 ; traceTc (text "done")
212 -- Add the implicit things;
213 -- we want them in the environment because
214 -- they may be mentioned in interface files
215 ; let { implicit_things = concatMap implicitTyThings alg_tyclss }
216 ; traceTc ((text "Adding" <+> ppr alg_tyclss)
217 $$ (text "and" <+> ppr implicit_things))
218 ; tcExtendGlobalEnv implicit_things getGblEnv
221 addATs decl@(L _ (ClassDecl {tcdATs = ats})) = decl : ats
224 mkGlobalThings :: [LTyClDecl Name] -- The decls
225 -> [TyThing] -- Knot-tied, in 1-1 correspondence with the decls
227 -- Driven by the Decls, and treating the TyThings lazily
228 -- make a TypeEnv for the new things
229 mkGlobalThings decls things
230 = map mk_thing (decls `zipLazy` things)
232 mk_thing (L _ (ClassDecl {tcdLName = L _ name}), ~(AClass cl))
234 mk_thing (L _ decl, ~(ATyCon tc))
235 = (tcdName decl, ATyCon tc)
239 %************************************************************************
241 \subsection{Type checking instances of indexed types}
243 %************************************************************************
245 Instances of indexed types are somewhat of a hybrid. They are processed
246 together with class instance heads, but can contain data constructors and hence
247 they share a lot of kinding and type checking code with ordinary algebraic
248 data types (and GADTs).
251 tcIdxTyInstDecl :: LTyClDecl Name
252 -> TcM (Maybe InstInfo, Maybe TyThing) -- Nothing if error
253 tcIdxTyInstDecl (L loc decl)
254 = -- Prime error recovery, set source location
255 recoverM (returnM (Nothing, Nothing)) $
258 do { -- indexed data types require -fglasgow-exts and can't be in an
260 ; gla_exts <- doptM Opt_GlasgowExts
261 ; is_boot <- tcIsHsBoot -- Are we compiling an hs-boot file?
262 ; checkTc gla_exts $ badIdxTyDecl (tcdLName decl)
263 ; checkTc (not is_boot) $ badBootTyIdxDeclErr
265 -- perform kind and type checking
266 ; tcIdxTyInstDecl1 decl
269 tcIdxTyInstDecl1 :: TyClDecl Name
270 -> TcM (Maybe InstInfo, Maybe TyThing) -- Nothing if error
272 tcIdxTyInstDecl1 (decl@TySynonym {})
273 = kcIdxTyPats decl $ \k_tvs k_typats resKind _ ->
274 do { -- (1) kind check the right hand side of the type equation
275 ; k_rhs <- kcCheckHsType (tcdSynRhs decl) resKind
277 -- (2) type check type equation
278 ; tcTyVarBndrs k_tvs $ \t_tvs -> do { -- turn kinded into proper tyvars
279 ; t_typats <- mappM tcHsKindedType k_typats
280 ; t_rhs <- tcHsKindedType k_rhs
282 -- construct type rewrite rule
283 -- !!!of the form: forall t_tvs. (tcdLName decl) t_typats = t_rhs
284 ; return (Nothing, Nothing) -- !!!TODO: need InstInfo for eq axioms
287 tcIdxTyInstDecl1 (decl@TyData {tcdND = new_or_data, tcdLName = L loc tc_name,
289 = kcIdxTyPats decl $ \k_tvs k_typats resKind family ->
290 do { -- (1) kind check the data declaration as usual
291 ; k_decl <- kcDataDecl decl k_tvs
292 ; let k_ctxt = tcdCtxt k_decl
293 k_cons = tcdCons k_decl
295 -- result kind must be '*' (otherwise, we have too few patterns)
296 ; checkTc (isLiftedTypeKind resKind) $ tooFewParmsErr tc_name
298 -- (2) type check indexed data type declaration
299 ; tcTyVarBndrs k_tvs $ \t_tvs -> do { -- turn kinded into proper tyvars
300 ; unbox_strict <- doptM Opt_UnboxStrictFields
302 -- Check that we don't use GADT syntax for indexed types
303 ; checkTc h98_syntax (badGadtIdxTyDecl tc_name)
305 -- Check that a newtype has exactly one constructor
306 ; checkTc (new_or_data == DataType || isSingleton k_cons) $
307 newtypeConError tc_name (length k_cons)
309 ; t_typats <- mappM tcHsKindedType k_typats
310 ; stupid_theta <- tcHsKindedContext k_ctxt
312 ; tycon <- fixM (\ tycon -> do
313 { data_cons <- mappM (addLocM (tcConDecl unbox_strict new_or_data
318 DataType -> return (mkDataTyConRhs data_cons)
320 ASSERT( isSingleton data_cons )
321 mkNewTyConRhs tc_name tycon (head data_cons)
322 ; buildAlgTyCon tc_name t_tvs stupid_theta tc_rhs Recursive
323 False h98_syntax (Just (family, t_typats))
324 -- We always assume that indexed types are recursive. Why?
325 -- (1) Due to their open nature, we can never be sure that a
326 -- further instance might not introduce a new recursive
327 -- dependency. (2) They are always valid loop breakers as
328 -- they involve a coercion.
332 ; return (Nothing, Just (ATyCon tycon))
335 h98_syntax = case cons of -- All constructors have same shape
336 L _ (ConDecl { con_res = ResTyGADT _ }) : _ -> False
339 -- Kind checking of indexed types
342 -- Kind check type patterns and kind annotate the embedded type variables.
344 -- * Here we check that a type instance matches its kind signature, but we do
345 -- not check whether there is a pattern for each type index; the latter
346 -- check is only required for type functions.
348 kcIdxTyPats :: TyClDecl Name
349 -> ([LHsTyVarBndr Name] -> [LHsType Name] -> Kind -> TyCon -> TcM a)
350 -- ^^kinded tvs ^^kinded ty pats ^^res kind
352 kcIdxTyPats decl thing_inside
353 = kcHsTyVars (tcdTyVars decl) $ \tvs ->
354 do { tc_ty_thing <- tcLookupLocated (tcdLName decl)
355 ; let { family = case tc_ty_thing of
356 AGlobal (ATyCon family) -> family
357 ; (kinds, resKind) = splitKindFunTys (tyConKind family)
358 ; hs_typats = fromJust $ tcdTyPats decl }
360 -- we may not have more parameters than the kind indicates
361 ; checkTc (length kinds >= length hs_typats) $
362 tooManyParmsErr (tcdLName decl)
364 -- type functions can have a higher-kinded result
365 ; let resultKind = mkArrowKinds (drop (length hs_typats) kinds) resKind
366 ; typats <- zipWithM kcCheckHsType hs_typats kinds
367 ; thing_inside tvs typats resultKind family
373 %************************************************************************
377 %************************************************************************
379 We need to kind check all types in the mutually recursive group
380 before we know the kind of the type variables. For example:
383 op :: D b => a -> b -> b
386 bop :: (Monad c) => ...
388 Here, the kind of the locally-polymorphic type variable "b"
389 depends on *all the uses of class D*. For example, the use of
390 Monad c in bop's type signature means that D must have kind Type->Type.
392 However type synonyms work differently. They can have kinds which don't
393 just involve (->) and *:
394 type R = Int# -- Kind #
395 type S a = Array# a -- Kind * -> #
396 type T a b = (# a,b #) -- Kind * -> * -> (# a,b #)
397 So we must infer their kinds from their right-hand sides *first* and then
398 use them, whereas for the mutually recursive data types D we bring into
399 scope kind bindings D -> k, where k is a kind variable, and do inference.
403 This treatment of type synonyms only applies to Haskell 98-style synonyms.
404 General type functions can be recursive, and hence, appear in `alg_decls'.
406 The kind of an indexed type is solely determinded by its kind signature;
407 hence, only kind signatures participate in the construction of the initial
408 kind environment (as constructed by `getInitialKind'). In fact, we ignore
409 instances of indexed types altogether in the following. However, we need to
410 include the kind signatures of associated types into the construction of the
411 initial kind environment. (This is handled by `allDecls').
414 kcTyClDecls syn_decls alg_decls
415 = do { -- First extend the kind env with each data type, class, and
416 -- indexed type, mapping them to a type variable
417 let initialKindDecls = concat [allDecls decl | L _ decl <- alg_decls]
418 ; alg_kinds <- mappM getInitialKind initialKindDecls
419 ; tcExtendKindEnv alg_kinds $ do
421 -- Now kind-check the type synonyms, in dependency order
422 -- We do these differently to data type and classes,
423 -- because a type synonym can be an unboxed type
425 -- and a kind variable can't unify with UnboxedTypeKind
426 -- So we infer their kinds in dependency order
427 { (kc_syn_decls, syn_kinds) <- kcSynDecls (calcSynCycles syn_decls)
428 ; tcExtendKindEnv syn_kinds $ do
430 -- Now kind-check the data type, class, and kind signatures,
431 -- returning kind-annotated decls; we don't kind-check
432 -- instances of indexed types yet, but leave this to
434 { kc_alg_decls <- mappM (wrapLocM kcTyClDecl)
435 (filter (not . isIdxTyDecl . unLoc) alg_decls)
437 ; return (kc_syn_decls, kc_alg_decls) }}}
439 -- get all declarations relevant for determining the initial kind
441 allDecls (decl@ClassDecl {tcdATs = ats}) = decl : [ at
444 allDecls decl | isIdxTyDecl decl = []
447 ------------------------------------------------------------------------
448 getInitialKind :: TyClDecl Name -> TcM (Name, TcKind)
449 -- Only for data type, class, and indexed type declarations
450 -- Get as much info as possible from the data, class, or indexed type decl,
451 -- so as to maximise usefulness of error messages
453 = do { arg_kinds <- mapM (mk_arg_kind . unLoc) (tyClDeclTyVars decl)
454 ; res_kind <- mk_res_kind decl
455 ; return (tcdName decl, mkArrowKinds arg_kinds res_kind) }
457 mk_arg_kind (UserTyVar _) = newKindVar
458 mk_arg_kind (KindedTyVar _ kind) = return kind
460 mk_res_kind (TyFunction { tcdKind = kind }) = return kind
461 mk_res_kind (TyData { tcdKindSig = Just kind }) = return kind
462 -- On GADT-style and data signature declarations we allow a kind
464 -- data T :: *->* where { ... }
465 mk_res_kind other = return liftedTypeKind
469 kcSynDecls :: [SCC (LTyClDecl Name)]
470 -> TcM ([LTyClDecl Name], -- Kind-annotated decls
471 [(Name,TcKind)]) -- Kind bindings
474 kcSynDecls (group : groups)
475 = do { (decl, nk) <- kcSynDecl group
476 ; (decls, nks) <- tcExtendKindEnv [nk] (kcSynDecls groups)
477 ; return (decl:decls, nk:nks) }
480 kcSynDecl :: SCC (LTyClDecl Name)
481 -> TcM (LTyClDecl Name, -- Kind-annotated decls
482 (Name,TcKind)) -- Kind bindings
483 kcSynDecl (AcyclicSCC ldecl@(L loc decl))
484 = tcAddDeclCtxt decl $
485 kcHsTyVars (tcdTyVars decl) (\ k_tvs ->
486 do { traceTc (text "kcd1" <+> ppr (unLoc (tcdLName decl)) <+> brackets (ppr (tcdTyVars decl))
487 <+> brackets (ppr k_tvs))
488 ; (k_rhs, rhs_kind) <- kcHsType (tcdSynRhs decl)
489 ; traceTc (text "kcd2" <+> ppr (unLoc (tcdLName decl)))
490 ; let tc_kind = foldr (mkArrowKind . kindedTyVarKind) rhs_kind k_tvs
491 ; return (L loc (decl { tcdTyVars = k_tvs, tcdSynRhs = k_rhs }),
492 (unLoc (tcdLName decl), tc_kind)) })
494 kcSynDecl (CyclicSCC decls)
495 = do { recSynErr decls; failM } -- Fail here to avoid error cascade
496 -- of out-of-scope tycons
498 kindedTyVarKind (L _ (KindedTyVar _ k)) = k
500 ------------------------------------------------------------------------
501 kcTyClDecl :: TyClDecl Name -> TcM (TyClDecl Name)
502 -- Not used for type synonyms (see kcSynDecl)
504 kcTyClDecl decl@(TyData {})
505 = ASSERT( not . isJust $ tcdTyPats decl ) -- must not be instance of idx ty
506 kcTyClDeclBody decl $
509 kcTyClDecl decl@(TyFunction {})
510 = kcTyClDeclBody decl $ \ tvs' ->
511 return (decl {tcdTyVars = tvs'})
513 kcTyClDecl decl@(ClassDecl {tcdCtxt = ctxt, tcdSigs = sigs, tcdATs = ats})
514 = kcTyClDeclBody decl $ \ tvs' ->
515 do { is_boot <- tcIsHsBoot
516 ; ctxt' <- kcHsContext ctxt
517 ; ats' <- mappM (wrapLocM kcTyClDecl) ats
518 ; sigs' <- mappM (wrapLocM kc_sig ) sigs
519 ; return (decl {tcdTyVars = tvs', tcdCtxt = ctxt', tcdSigs = sigs',
522 kc_sig (TypeSig nm op_ty) = do { op_ty' <- kcHsLiftedSigType op_ty
523 ; return (TypeSig nm op_ty') }
524 kc_sig other_sig = return other_sig
526 kcTyClDecl decl@(ForeignType {})
529 kcTyClDeclBody :: TyClDecl Name
530 -> ([LHsTyVarBndr Name] -> TcM a)
532 -- getInitialKind has made a suitably-shaped kind for the type or class
533 -- Unpack it, and attribute those kinds to the type variables
534 -- Extend the env with bindings for the tyvars, taken from
535 -- the kind of the tycon/class. Give it to the thing inside, and
536 -- check the result kind matches
537 kcTyClDeclBody decl thing_inside
538 = tcAddDeclCtxt decl $
539 do { tc_ty_thing <- tcLookupLocated (tcdLName decl)
540 ; let tc_kind = case tc_ty_thing of { AThing k -> k }
541 (kinds, _) = splitKindFunTys tc_kind
542 hs_tvs = tcdTyVars decl
543 kinded_tvs = ASSERT( length kinds >= length hs_tvs )
544 [ L loc (KindedTyVar (hsTyVarName tv) k)
545 | (L loc tv, k) <- zip hs_tvs kinds]
546 ; tcExtendKindEnvTvs kinded_tvs (thing_inside kinded_tvs) }
548 -- Kind check a data declaration, assuming that we already extended the
549 -- kind environment with the type variables of the left-hand side (these
550 -- kinded type variables are also passed as the second parameter).
552 kcDataDecl :: TyClDecl Name -> [LHsTyVarBndr Name] -> TcM (TyClDecl Name)
553 kcDataDecl decl@(TyData {tcdND = new_or_data, tcdCtxt = ctxt, tcdCons = cons})
555 = do { ctxt' <- kcHsContext ctxt
556 ; cons' <- mappM (wrapLocM kc_con_decl) cons
557 ; return (decl {tcdTyVars = tvs, tcdCtxt = ctxt', tcdCons = cons'}) }
559 kc_con_decl (ConDecl name expl ex_tvs ex_ctxt details res) = do
560 kcHsTyVars ex_tvs $ \ex_tvs' -> do
561 ex_ctxt' <- kcHsContext ex_ctxt
562 details' <- kc_con_details details
564 ResTyH98 -> return ResTyH98
565 ResTyGADT ty -> do { ty' <- kcHsSigType ty; return (ResTyGADT ty') }
566 return (ConDecl name expl ex_tvs' ex_ctxt' details' res')
568 kc_con_details (PrefixCon btys)
569 = do { btys' <- mappM kc_larg_ty btys ; return (PrefixCon btys') }
570 kc_con_details (InfixCon bty1 bty2)
571 = do { bty1' <- kc_larg_ty bty1; bty2' <- kc_larg_ty bty2; return (InfixCon bty1' bty2') }
572 kc_con_details (RecCon fields)
573 = do { fields' <- mappM kc_field fields; return (RecCon fields') }
575 kc_field (fld, bty) = do { bty' <- kc_larg_ty bty ; return (fld, bty') }
577 kc_larg_ty bty = case new_or_data of
578 DataType -> kcHsSigType bty
579 NewType -> kcHsLiftedSigType bty
580 -- Can't allow an unlifted type for newtypes, because we're effectively
581 -- going to remove the constructor while coercing it to a lifted type.
582 -- And newtypes can't be bang'd
586 %************************************************************************
588 \subsection{Type checking}
590 %************************************************************************
593 tcSynDecls :: [LTyClDecl Name] -> TcM [TyThing]
594 tcSynDecls [] = return []
595 tcSynDecls (decl : decls)
596 = do { syn_tc <- addLocM tcSynDecl decl
597 ; syn_tcs <- tcExtendGlobalEnv [syn_tc] (tcSynDecls decls)
598 ; return (syn_tc : syn_tcs) }
601 (TySynonym {tcdLName = L _ tc_name, tcdTyVars = tvs, tcdSynRhs = rhs_ty})
602 = tcTyVarBndrs tvs $ \ tvs' -> do
603 { traceTc (text "tcd1" <+> ppr tc_name)
604 ; rhs_ty' <- tcHsKindedType rhs_ty
605 ; return (ATyCon (buildSynTyCon tc_name tvs' (SynonymTyCon rhs_ty'))) }
608 tcTyClDecl :: (Name -> RecFlag) -> TyClDecl Name -> TcM [TyThing]
610 tcTyClDecl calc_isrec decl
611 = tcAddDeclCtxt decl (tcTyClDecl1 calc_isrec decl)
613 -- kind signature for a type function
614 tcTyClDecl1 _calc_isrec
615 (TyFunction {tcdLName = L _ tc_name, tcdTyVars = tvs, tcdKind = kind})
616 = tcTyVarBndrs tvs $ \ tvs' -> do
617 { traceTc (text "type family: " <+> ppr tc_name)
618 ; gla_exts <- doptM Opt_GlasgowExts
620 -- Check that we don't use kind signatures without Glasgow extensions
621 ; checkTc gla_exts $ badSigTyDecl tc_name
623 ; return [ATyCon (buildSynTyCon tc_name tvs' (OpenSynTyCon kind))]
626 -- kind signature for an indexed data type
627 tcTyClDecl1 _calc_isrec
628 (TyData {tcdND = new_or_data, tcdCtxt = ctxt, tcdTyVars = tvs,
629 tcdLName = L _ tc_name, tcdKindSig = Just ksig, tcdCons = []})
630 = tcTyVarBndrs tvs $ \ tvs' -> do
631 { traceTc (text "data/newtype family: " <+> ppr tc_name)
632 ; extra_tvs <- tcDataKindSig (Just ksig)
633 ; let final_tvs = tvs' ++ extra_tvs -- we may not need these
635 ; checkTc (null . unLoc $ ctxt) $ badKindSigCtxt tc_name
636 ; gla_exts <- doptM Opt_GlasgowExts
638 -- Check that we don't use kind signatures without Glasgow extensions
639 ; checkTc gla_exts $ badSigTyDecl tc_name
641 ; tycon <- buildAlgTyCon tc_name final_tvs []
643 DataType -> OpenDataTyCon
644 NewType -> OpenNewTyCon)
645 Recursive False True Nothing
646 ; return [ATyCon tycon]
649 tcTyClDecl1 calc_isrec
650 (TyData {tcdND = new_or_data, tcdCtxt = ctxt, tcdTyVars = tvs,
651 tcdLName = L _ tc_name, tcdKindSig = mb_ksig, tcdCons = cons})
652 = tcTyVarBndrs tvs $ \ tvs' -> do
653 { extra_tvs <- tcDataKindSig mb_ksig
654 ; let final_tvs = tvs' ++ extra_tvs
655 ; stupid_theta <- tcHsKindedContext ctxt
656 ; want_generic <- doptM Opt_Generics
657 ; unbox_strict <- doptM Opt_UnboxStrictFields
658 ; gla_exts <- doptM Opt_GlasgowExts
659 ; is_boot <- tcIsHsBoot -- Are we compiling an hs-boot file?
661 -- Check that we don't use GADT syntax in H98 world
662 ; checkTc (gla_exts || h98_syntax) (badGadtDecl tc_name)
664 -- Check that we don't use kind signatures without Glasgow extensions
665 ; checkTc (gla_exts || isNothing mb_ksig) (badSigTyDecl tc_name)
667 -- Check that the stupid theta is empty for a GADT-style declaration
668 ; checkTc (null stupid_theta || h98_syntax) (badStupidTheta tc_name)
670 -- Check that there's at least one condecl,
671 -- or else we're reading an hs-boot file, or -fglasgow-exts
672 ; checkTc (not (null cons) || gla_exts || is_boot)
673 (emptyConDeclsErr tc_name)
675 -- Check that a newtype has exactly one constructor
676 ; checkTc (new_or_data == DataType || isSingleton cons)
677 (newtypeConError tc_name (length cons))
679 ; tycon <- fixM (\ tycon -> do
680 { data_cons <- mappM (addLocM (tcConDecl unbox_strict new_or_data
684 if null cons && is_boot -- In a hs-boot file, empty cons means
685 then return AbstractTyCon -- "don't know"; hence Abstract
686 else case new_or_data of
687 DataType -> return (mkDataTyConRhs data_cons)
689 ASSERT( isSingleton data_cons )
690 mkNewTyConRhs tc_name tycon (head data_cons)
691 ; buildAlgTyCon tc_name final_tvs stupid_theta tc_rhs is_rec
692 (want_generic && canDoGenerics data_cons) h98_syntax Nothing
694 ; return [ATyCon tycon]
697 is_rec = calc_isrec tc_name
698 h98_syntax = case cons of -- All constructors have same shape
699 L _ (ConDecl { con_res = ResTyGADT _ }) : _ -> False
702 tcTyClDecl1 calc_isrec
703 (ClassDecl {tcdLName = L _ class_name, tcdTyVars = tvs,
704 tcdCtxt = ctxt, tcdMeths = meths,
705 tcdFDs = fundeps, tcdSigs = sigs, tcdATs = ats} )
706 = tcTyVarBndrs tvs $ \ tvs' -> do
707 { ctxt' <- tcHsKindedContext ctxt
708 ; fds' <- mappM (addLocM tc_fundep) fundeps
709 ; atss <- mappM (addLocM (tcTyClDecl1 (const Recursive))) ats
710 ; let ats' = concat atss
711 ; sig_stuff <- tcClassSigs class_name sigs meths
712 ; clas <- fixM (\ clas ->
713 let -- This little knot is just so we can get
714 -- hold of the name of the class TyCon, which we
715 -- need to look up its recursiveness
716 tycon_name = tyConName (classTyCon clas)
717 tc_isrec = calc_isrec tycon_name
719 buildClass class_name tvs' ctxt' fds' ats'
721 ; return (AClass clas : ats')
722 -- NB: Order is important due to the call to `mkGlobalThings' when
723 -- tying the the type and class declaration type checking knot.
726 tc_fundep (tvs1, tvs2) = do { tvs1' <- mappM tcLookupTyVar tvs1 ;
727 ; tvs2' <- mappM tcLookupTyVar tvs2 ;
728 ; return (tvs1', tvs2') }
731 tcTyClDecl1 calc_isrec
732 (ForeignType {tcdLName = L _ tc_name, tcdExtName = tc_ext_name})
733 = returnM [ATyCon (mkForeignTyCon tc_name tc_ext_name liftedTypeKind 0)]
735 -----------------------------------
736 tcConDecl :: Bool -- True <=> -funbox-strict_fields
742 tcConDecl unbox_strict NewType tycon tc_tvs -- Newtypes
743 (ConDecl name _ ex_tvs ex_ctxt details ResTyH98)
744 = do { let tc_datacon field_lbls arg_ty
745 = do { arg_ty' <- tcHsKindedType arg_ty -- No bang on newtype
746 ; buildDataCon (unLoc name) False {- Prefix -}
748 (map unLoc field_lbls)
749 tc_tvs [] -- No existentials
750 [] [] -- No equalities, predicates
754 -- Check that a newtype has no existential stuff
755 ; checkTc (null ex_tvs && null (unLoc ex_ctxt)) (newtypeExError name)
758 PrefixCon [arg_ty] -> tc_datacon [] arg_ty
759 RecCon [(field_lbl, arg_ty)] -> tc_datacon [field_lbl] arg_ty
761 failWithTc (newtypeFieldErr name (length (hsConArgs details)))
762 -- Check that the constructor has exactly one field
765 tcConDecl unbox_strict DataType tycon tc_tvs -- Data types
766 (ConDecl name _ tvs ctxt details res_ty)
767 = tcTyVarBndrs tvs $ \ tvs' -> do
768 { ctxt' <- tcHsKindedContext ctxt
769 ; (univ_tvs, ex_tvs, eq_preds, data_tc) <- tcResultType tycon tc_tvs tvs' res_ty
771 tc_datacon is_infix field_lbls btys
772 = do { let bangs = map getBangStrictness btys
773 ; arg_tys <- mappM tcHsBangType btys
774 ; buildDataCon (unLoc name) is_infix
775 (argStrictness unbox_strict tycon bangs arg_tys)
776 (map unLoc field_lbls)
777 univ_tvs ex_tvs eq_preds ctxt' arg_tys
779 -- NB: we put data_tc, the type constructor gotten from the
780 -- constructor type signature into the data constructor;
781 -- that way checkValidDataCon can complain if it's wrong.
784 PrefixCon btys -> tc_datacon False [] btys
785 InfixCon bty1 bty2 -> tc_datacon True [] [bty1,bty2]
786 RecCon fields -> tc_datacon False field_names btys
788 (field_names, btys) = unzip fields
792 tcResultType :: TyCon
793 -> [TyVar] -- data T a b c = ...
794 -> [TyVar] -- where MkT :: forall a b c. ...
796 -> TcM ([TyVar], -- Universal
797 [TyVar], -- Existential
798 [(TyVar,Type)], -- Equality predicates
799 TyCon) -- TyCon given in the ResTy
800 -- We don't check that the TyCon given in the ResTy is
801 -- the same as the parent tycon, becuase we are in the middle
802 -- of a recursive knot; so it's postponed until checkValidDataCon
804 tcResultType decl_tycon tc_tvs dc_tvs ResTyH98
805 = return (tc_tvs, dc_tvs, [], decl_tycon)
806 -- In H98 syntax the dc_tvs are the existential ones
807 -- data T a b c = forall d e. MkT ...
808 -- The {a,b,c} are tc_tvs, and {d,e} are dc_tvs
810 tcResultType _ tc_tvs dc_tvs (ResTyGADT res_ty)
811 -- E.g. data T a b c where
812 -- MkT :: forall x y z. T (x,y) z z
814 -- ([a,z,c], [x,y], [a:=:(x,y), c:=:z], T)
816 = do { (dc_tycon, res_tys) <- tcLHsConResTy res_ty
817 -- NB: tc_tvs and dc_tvs are distinct
818 ; let univ_tvs = choose_univs [] tc_tvs res_tys
819 -- Each univ_tv is either a dc_tv or a tc_tv
820 ex_tvs = dc_tvs `minusList` univ_tvs
821 eq_spec = [ (tv, ty) | (tv,ty) <- univ_tvs `zip` res_tys,
823 ; return (univ_tvs, ex_tvs, eq_spec, dc_tycon) }
825 -- choose_univs uses the res_ty itself if it's a type variable
826 -- and hasn't already been used; otherwise it uses one of the tc_tvs
827 choose_univs used tc_tvs []
828 = ASSERT( null tc_tvs ) []
829 choose_univs used (tc_tv:tc_tvs) (res_ty:res_tys)
830 | Just tv <- tcGetTyVar_maybe res_ty, not (tv `elem` used)
831 = tv : choose_univs (tv:used) tc_tvs res_tys
833 = tc_tv : choose_univs used tc_tvs res_tys
836 argStrictness :: Bool -- True <=> -funbox-strict_fields
838 -> [TcType] -> [StrictnessMark]
839 argStrictness unbox_strict tycon bangs arg_tys
840 = ASSERT( length bangs == length arg_tys )
841 zipWith (chooseBoxingStrategy unbox_strict tycon) arg_tys bangs
843 -- We attempt to unbox/unpack a strict field when either:
844 -- (i) The field is marked '!!', or
845 -- (ii) The field is marked '!', and the -funbox-strict-fields flag is on.
847 -- We have turned off unboxing of newtypes because coercions make unboxing
848 -- and reboxing more complicated
849 chooseBoxingStrategy :: Bool -> TyCon -> TcType -> HsBang -> StrictnessMark
850 chooseBoxingStrategy unbox_strict_fields tycon arg_ty bang
852 HsNoBang -> NotMarkedStrict
853 HsStrict | unbox_strict_fields
854 && can_unbox arg_ty -> MarkedUnboxed
855 HsUnbox | can_unbox arg_ty -> MarkedUnboxed
856 other -> MarkedStrict
858 -- we can unbox if the type is a chain of newtypes with a product tycon
860 can_unbox arg_ty = case splitTyConApp_maybe arg_ty of
862 Just (arg_tycon, tycon_args) ->
863 not (isRecursiveTyCon tycon) &&
864 isProductTyCon arg_tycon &&
865 (if isNewTyCon arg_tycon then
866 can_unbox (newTyConInstRhs arg_tycon tycon_args)
870 %************************************************************************
872 \subsection{Dependency analysis}
874 %************************************************************************
876 Validity checking is done once the mutually-recursive knot has been
877 tied, so we can look at things freely.
880 checkCycleErrs :: [LTyClDecl Name] -> TcM ()
881 checkCycleErrs tyclss
885 = do { mappM_ recClsErr cls_cycles
886 ; failM } -- Give up now, because later checkValidTyCl
887 -- will loop if the synonym is recursive
889 cls_cycles = calcClassCycles tyclss
891 checkValidTyCl :: TyClDecl Name -> TcM ()
892 -- We do the validity check over declarations, rather than TyThings
893 -- only so that we can add a nice context with tcAddDeclCtxt
895 = tcAddDeclCtxt decl $
896 do { thing <- tcLookupLocatedGlobal (tcdLName decl)
897 ; traceTc (text "Validity of" <+> ppr thing)
899 ATyCon tc -> checkValidTyCon tc
900 AClass cl -> checkValidClass cl
901 ; traceTc (text "Done validity of" <+> ppr thing)
904 -------------------------
905 -- For data types declared with record syntax, we require
906 -- that each constructor that has a field 'f'
907 -- (a) has the same result type
908 -- (b) has the same type for 'f'
909 -- module alpha conversion of the quantified type variables
910 -- of the constructor.
912 checkValidTyCon :: TyCon -> TcM ()
915 = case synTyConRhs tc of
916 OpenSynTyCon _ -> return ()
917 SynonymTyCon ty -> checkValidType syn_ctxt ty
919 = -- Check the context on the data decl
920 checkValidTheta (DataTyCtxt name) (tyConStupidTheta tc) `thenM_`
922 -- Check arg types of data constructors
923 mappM_ (checkValidDataCon tc) data_cons `thenM_`
925 -- Check that fields with the same name share a type
926 mappM_ check_fields groups
929 syn_ctxt = TySynCtxt name
931 data_cons = tyConDataCons tc
933 groups = equivClasses cmp_fld (concatMap get_fields data_cons)
934 cmp_fld (f1,_) (f2,_) = f1 `compare` f2
935 get_fields con = dataConFieldLabels con `zip` repeat con
936 -- dataConFieldLabels may return the empty list, which is fine
938 -- See Note [GADT record selectors] in MkId.lhs
939 -- We must check (a) that the named field has the same
940 -- type in each constructor
941 -- (b) that those constructors have the same result type
943 -- However, the constructors may have differently named type variable
944 -- and (worse) we don't know how the correspond to each other. E.g.
945 -- C1 :: forall a b. { f :: a, g :: b } -> T a b
946 -- C2 :: forall d c. { f :: c, g :: c } -> T c d
948 -- So what we do is to ust Unify.tcMatchTys to compare the first candidate's
949 -- result type against other candidates' types BOTH WAYS ROUND.
950 -- If they magically agrees, take the substitution and
951 -- apply them to the latter ones, and see if they match perfectly.
952 check_fields fields@((label, con1) : other_fields)
953 -- These fields all have the same name, but are from
954 -- different constructors in the data type
955 = recoverM (return ()) $ mapM_ checkOne other_fields
956 -- Check that all the fields in the group have the same type
957 -- NB: this check assumes that all the constructors of a given
958 -- data type use the same type variables
960 tvs1 = mkVarSet (dataConAllTyVars con1)
961 res1 = dataConResTys con1
962 fty1 = dataConFieldType con1 label
964 checkOne (_, con2) -- Do it bothways to ensure they are structurally identical
965 = do { checkFieldCompat label con1 con2 tvs1 res1 res2 fty1 fty2
966 ; checkFieldCompat label con2 con1 tvs2 res2 res1 fty2 fty1 }
968 tvs2 = mkVarSet (dataConAllTyVars con2)
969 res2 = dataConResTys con2
970 fty2 = dataConFieldType con2 label
972 checkFieldCompat fld con1 con2 tvs1 res1 res2 fty1 fty2
973 = do { checkTc (isJust mb_subst1) (resultTypeMisMatch fld con1 con2)
974 ; checkTc (isJust mb_subst2) (fieldTypeMisMatch fld con1 con2) }
976 mb_subst1 = tcMatchTys tvs1 res1 res2
977 mb_subst2 = tcMatchTyX tvs1 (expectJust "checkFieldCompat" mb_subst1) fty1 fty2
979 -------------------------------
980 checkValidDataCon :: TyCon -> DataCon -> TcM ()
981 checkValidDataCon tc con
982 = setSrcSpan (srcLocSpan (getSrcLoc con)) $
983 addErrCtxt (dataConCtxt con) $
984 do { checkTc (dataConTyCon con == tc) (badDataConTyCon con)
985 ; checkValidType ctxt (dataConUserType con) }
987 ctxt = ConArgCtxt (dataConName con)
989 -------------------------------
990 checkValidClass :: Class -> TcM ()
992 = do { -- CHECK ARITY 1 FOR HASKELL 1.4
993 gla_exts <- doptM Opt_GlasgowExts
995 -- Check that the class is unary, unless GlaExs
996 ; checkTc (notNull tyvars) (nullaryClassErr cls)
997 ; checkTc (gla_exts || unary) (classArityErr cls)
999 -- Check the super-classes
1000 ; checkValidTheta (ClassSCCtxt (className cls)) theta
1002 -- Check the class operations
1003 ; mappM_ (check_op gla_exts) op_stuff
1005 -- Check that if the class has generic methods, then the
1006 -- class has only one parameter. We can't do generic
1007 -- multi-parameter type classes!
1008 ; checkTc (unary || no_generics) (genericMultiParamErr cls)
1011 (tyvars, theta, _, op_stuff) = classBigSig cls
1012 unary = isSingleton tyvars
1013 no_generics = null [() | (_, GenDefMeth) <- op_stuff]
1015 check_op gla_exts (sel_id, dm)
1016 = addErrCtxt (classOpCtxt sel_id tau) $ do
1017 { checkValidTheta SigmaCtxt (tail theta)
1018 -- The 'tail' removes the initial (C a) from the
1019 -- class itself, leaving just the method type
1021 ; checkValidType (FunSigCtxt op_name) tau
1023 -- Check that the type mentions at least one of
1024 -- the class type variables
1025 ; checkTc (any (`elemVarSet` tyVarsOfType tau) tyvars)
1026 (noClassTyVarErr cls sel_id)
1028 -- Check that for a generic method, the type of
1029 -- the method is sufficiently simple
1030 ; checkTc (dm /= GenDefMeth || validGenericMethodType tau)
1031 (badGenericMethodType op_name op_ty)
1034 op_name = idName sel_id
1035 op_ty = idType sel_id
1036 (_,theta1,tau1) = tcSplitSigmaTy op_ty
1037 (_,theta2,tau2) = tcSplitSigmaTy tau1
1038 (theta,tau) | gla_exts = (theta1 ++ theta2, tau2)
1039 | otherwise = (theta1, mkPhiTy (tail theta1) tau1)
1040 -- Ugh! The function might have a type like
1041 -- op :: forall a. C a => forall b. (Eq b, Eq a) => tau2
1042 -- With -fglasgow-exts, we want to allow this, even though the inner
1043 -- forall has an (Eq a) constraint. Whereas in general, each constraint
1044 -- in the context of a for-all must mention at least one quantified
1045 -- type variable. What a mess!
1048 ---------------------------------------------------------------------
1049 resultTypeMisMatch field_name con1 con2
1050 = vcat [sep [ptext SLIT("Constructors") <+> ppr con1 <+> ptext SLIT("and") <+> ppr con2,
1051 ptext SLIT("have a common field") <+> quotes (ppr field_name) <> comma],
1052 nest 2 $ ptext SLIT("but have different result types")]
1053 fieldTypeMisMatch field_name con1 con2
1054 = sep [ptext SLIT("Constructors") <+> ppr con1 <+> ptext SLIT("and") <+> ppr con2,
1055 ptext SLIT("give different types for field"), quotes (ppr field_name)]
1057 dataConCtxt con = ptext SLIT("In the definition of data constructor") <+> quotes (ppr con)
1059 classOpCtxt sel_id tau = sep [ptext SLIT("When checking the class method:"),
1060 nest 2 (ppr sel_id <+> dcolon <+> ppr tau)]
1063 = ptext SLIT("No parameters for class") <+> quotes (ppr cls)
1066 = vcat [ptext SLIT("Too many parameters for class") <+> quotes (ppr cls),
1067 parens (ptext SLIT("Use -fglasgow-exts to allow multi-parameter classes"))]
1069 noClassTyVarErr clas op
1070 = sep [ptext SLIT("The class method") <+> quotes (ppr op),
1071 ptext SLIT("mentions none of the type variables of the class") <+>
1072 ppr clas <+> hsep (map ppr (classTyVars clas))]
1074 genericMultiParamErr clas
1075 = ptext SLIT("The multi-parameter class") <+> quotes (ppr clas) <+>
1076 ptext SLIT("cannot have generic methods")
1078 badGenericMethodType op op_ty
1079 = hang (ptext SLIT("Generic method type is too complex"))
1080 4 (vcat [ppr op <+> dcolon <+> ppr op_ty,
1081 ptext SLIT("You can only use type variables, arrows, lists, and tuples")])
1084 = setSrcSpan (getLoc (head sorted_decls)) $
1085 addErr (sep [ptext SLIT("Cycle in type synonym declarations:"),
1086 nest 2 (vcat (map ppr_decl sorted_decls))])
1088 sorted_decls = sortLocated syn_decls
1089 ppr_decl (L loc decl) = ppr loc <> colon <+> ppr decl
1092 = setSrcSpan (getLoc (head sorted_decls)) $
1093 addErr (sep [ptext SLIT("Cycle in class declarations (via superclasses):"),
1094 nest 2 (vcat (map ppr_decl sorted_decls))])
1096 sorted_decls = sortLocated cls_decls
1097 ppr_decl (L loc decl) = ppr loc <> colon <+> ppr (decl { tcdSigs = [] })
1099 sortLocated :: [Located a] -> [Located a]
1100 sortLocated things = sortLe le things
1102 le (L l1 _) (L l2 _) = l1 <= l2
1104 badDataConTyCon data_con
1105 = hang (ptext SLIT("Data constructor") <+> quotes (ppr data_con) <+>
1106 ptext SLIT("returns type") <+> quotes (ppr (dataConTyCon data_con)))
1107 2 (ptext SLIT("instead of its parent type"))
1110 = vcat [ ptext SLIT("Illegal generalised algebraic data declaration for") <+> quotes (ppr tc_name)
1111 , nest 2 (parens $ ptext SLIT("Use -fglasgow-exts to allow GADTs")) ]
1113 badStupidTheta tc_name
1114 = ptext SLIT("A data type declared in GADT style cannot have a context:") <+> quotes (ppr tc_name)
1116 newtypeConError tycon n
1117 = sep [ptext SLIT("A newtype must have exactly one constructor,"),
1118 nest 2 $ ptext SLIT("but") <+> quotes (ppr tycon) <+> ptext SLIT("has") <+> speakN n ]
1121 = sep [ptext SLIT("A newtype constructor cannot have an existential context,"),
1122 nest 2 $ ptext SLIT("but") <+> quotes (ppr con) <+> ptext SLIT("does")]
1124 newtypeFieldErr con_name n_flds
1125 = sep [ptext SLIT("The constructor of a newtype must have exactly one field"),
1126 nest 2 $ ptext SLIT("but") <+> quotes (ppr con_name) <+> ptext SLIT("has") <+> speakN n_flds]
1128 badSigTyDecl tc_name
1129 = vcat [ ptext SLIT("Illegal kind signature") <+>
1130 quotes (ppr tc_name)
1131 , nest 2 (parens $ ptext SLIT("Use -fglasgow-exts to allow indexed types")) ]
1133 badKindSigCtxt tc_name
1134 = vcat [ ptext SLIT("Illegal context in kind signature") <+>
1135 quotes (ppr tc_name)
1136 , nest 2 (parens $ ptext SLIT("Currently, kind signatures cannot have a context")) ]
1138 badIdxTyDecl tc_name
1139 = vcat [ ptext SLIT("Illegal indexed type instance for") <+>
1140 quotes (ppr tc_name)
1141 , nest 2 (parens $ ptext SLIT("Use -fglasgow-exts to allow indexed types")) ]
1143 badGadtIdxTyDecl tc_name
1144 = vcat [ ptext SLIT("Illegal generalised algebraic data declaration for") <+>
1145 quotes (ppr tc_name)
1146 , nest 2 (parens $ ptext SLIT("Indexed types cannot use GADT declarations")) ]
1148 tooManyParmsErr tc_name
1149 = ptext SLIT("Indexed type instance has too many parameters:") <+>
1150 quotes (ppr tc_name)
1152 tooFewParmsErr tc_name
1153 = ptext SLIT("Indexed type instance has too few parameters:") <+>
1154 quotes (ppr tc_name)
1156 badBootTyIdxDeclErr = ptext SLIT("Illegal indexed type instance in hs-boot file")
1158 emptyConDeclsErr tycon
1159 = sep [quotes (ppr tycon) <+> ptext SLIT("has no constructors"),
1160 nest 2 $ ptext SLIT("(-fglasgow-exts permits this)")]