2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[HsTypes]{Abstract syntax: user-defined types}
8 HsType(..), HsTyVarBndr(..),
9 , HsContext, HsPred(..)
10 , HsTupCon(..), hsTupParens, mkHsTupCon,
13 , mkHsForAllTy, mkHsDictTy, mkHsIParamTy
14 , hsTyVarName, hsTyVarNames, replaceTyVarName
18 , PostTcType, placeHolderType,
21 , pprParendHsType, pprHsForAll, pprHsContext, ppr_hs_context, pprHsTyVarBndr
23 -- Equality over Hs things
24 , EqHsEnv, emptyEqHsEnv, extendEqHsEnv,
25 , eqWithHsTyVars, eq_hsVar, eq_hsVars, eq_hsTyVars, eq_hsType, eq_hsContext, eqListBy
27 -- Converting from Type to HsType
28 , toHsType, toHsTyVar, toHsTyVars, toHsContext, toHsFDs
31 #include "HsVersions.h"
33 import Class ( FunDep )
34 import TcType ( Type, Kind, ThetaType, SourceType(..),
35 tcSplitSigmaTy, liftedTypeKind, eqKind, tcEqType
37 import TypeRep ( Type(..), TyNote(..) ) -- toHsType sees the representation
38 import TyCon ( isTupleTyCon, tupleTyConBoxity, tyConArity, isNewTyCon, getSynTyConDefn )
39 import RdrName ( RdrName, mkUnqual )
40 import Name ( Name, getName )
41 import OccName ( NameSpace, tvName )
42 import Var ( TyVar, tyVarKind )
43 import Subst ( substTyWith )
44 import PprType ( {- instance Outputable Kind -}, pprParendKind, pprKind )
45 import BasicTypes ( Boxity(..), Arity, IPName, tupleParens )
46 import PrelNames ( mkTupConRdrName, listTyConKey, parrTyConKey,
47 usOnceTyConKey, usManyTyConKey, hasKey,
48 usOnceTyConName, usManyTyConName )
50 import Util ( eqListBy, lengthIs )
55 %************************************************************************
57 \subsection{Annotating the syntax}
59 %************************************************************************
62 type PostTcType = Type -- Used for slots in the abstract syntax
63 -- where we want to keep slot for a type
64 -- to be added by the type checker...but
65 -- before typechecking it's just bogus
67 placeHolderType :: PostTcType -- Used before typechecking
68 placeHolderType = panic "Evaluated the place holder for a PostTcType"
72 %************************************************************************
74 \subsection{Data types}
76 %************************************************************************
78 This is the syntax for types as seen in type signatures.
81 type HsContext name = [HsPred name]
83 data HsPred name = HsClassP name [HsType name]
84 | HsIParam (IPName name) (HsType name)
87 = HsForAllTy (Maybe [HsTyVarBndr name]) -- Nothing for implicitly quantified signatures
91 | HsTyVar name -- Type variable or type constructor
93 | HsAppTy (HsType name)
96 | HsFunTy (HsType name) -- function type
99 | HsListTy (HsType name) -- Element type
101 | HsPArrTy (HsType name) -- Elem. type of parallel array: [:t:]
103 | HsTupleTy (HsTupCon name)
104 [HsType name] -- Element types (length gives arity)
106 | HsOpTy (HsType name) name (HsType name)
109 -- these next two are only used in interfaces
110 | HsPredTy (HsPred name)
112 | HsKindSig (HsType name) -- (ty :: kind)
113 Kind -- A type with a kind signature
116 -----------------------
117 hsUsOnce, hsUsMany :: HsType RdrName
118 hsUsOnce = HsTyVar (mkUnqual tvName FSLIT(".")) -- deep magic
119 hsUsMany = HsTyVar (mkUnqual tvName FSLIT("!")) -- deep magic
121 hsUsOnce_Name, hsUsMany_Name :: HsType Name
122 hsUsOnce_Name = HsTyVar usOnceTyConName
123 hsUsMany_Name = HsTyVar usManyTyConName
125 -----------------------
126 data HsTupCon name = HsTupCon name Boxity Arity
128 instance Eq name => Eq (HsTupCon name) where
129 (HsTupCon _ b1 a1) == (HsTupCon _ b2 a2) = b1==b2 && a1==a2
131 mkHsTupCon :: NameSpace -> Boxity -> [a] -> HsTupCon RdrName
132 mkHsTupCon space boxity args = HsTupCon (mkTupConRdrName space boxity arity) boxity arity
136 hsTupParens :: HsTupCon name -> SDoc -> SDoc
137 hsTupParens (HsTupCon _ b _) p = tupleParens b p
139 -----------------------
140 -- Combine adjacent for-alls.
141 -- The following awkward situation can happen otherwise:
142 -- f :: forall a. ((Num a) => Int)
143 -- might generate HsForAll (Just [a]) [] (HsForAll Nothing [Num a] t)
144 -- Then a isn't discovered as ambiguous, and we abstract the AbsBinds wrt []
145 -- but the export list abstracts f wrt [a]. Disaster.
147 -- A valid type must have one for-all at the top of the type, or of the fn arg types
149 mkHsForAllTy (Just []) [] ty = ty -- Explicit for-all with no tyvars
150 mkHsForAllTy mtvs1 [] (HsForAllTy mtvs2 ctxt ty) = mkHsForAllTy (mtvs1 `plus` mtvs2) ctxt ty
152 mtvs1 `plus` Nothing = mtvs1
153 Nothing `plus` mtvs2 = mtvs2
154 (Just tvs1) `plus` (Just tvs2) = Just (tvs1 ++ tvs2)
155 mkHsForAllTy tvs ctxt ty = HsForAllTy tvs ctxt ty
157 mkHsDictTy cls tys = HsPredTy (HsClassP cls tys)
158 mkHsIParamTy v ty = HsPredTy (HsIParam v ty)
160 data HsTyVarBndr name
162 | IfaceTyVar name Kind
163 -- *** NOTA BENE *** A "monotype" in a pragma can have
164 -- for-alls in it, (mostly to do with dictionaries). These
165 -- must be explicitly Kinded.
167 hsTyVarName (UserTyVar n) = n
168 hsTyVarName (IfaceTyVar n _) = n
170 hsTyVarNames tvs = map hsTyVarName tvs
172 replaceTyVarName :: HsTyVarBndr name1 -> name2 -> HsTyVarBndr name2
173 replaceTyVarName (UserTyVar n) n' = UserTyVar n'
174 replaceTyVarName (IfaceTyVar n k) n' = IfaceTyVar n' k
179 getHsInstHead :: HsType name -> ([HsTyVarBndr name], (name, [HsType name]))
180 -- Split up an instance decl type, returning the 'head' part
182 -- In interface fiels, the type of the decl is held like this:
183 -- forall a. Foo a -> Baz (T a)
184 -- so we have to strip off function argument types,
185 -- as well as the bit before the '=>' (which is always
186 -- empty in interface files)
188 -- The parser ensures the type will have the right shape.
189 -- (e.g. see ParseUtil.checkInstType)
191 getHsInstHead (HsForAllTy (Just tvs) _ tau) = (tvs, get_head1 tau)
192 getHsInstHead tau = ([], get_head1 tau)
194 get_head1 (HsFunTy _ ty) = get_head1 ty
195 get_head1 (HsPredTy (HsClassP cls tys)) = (cls,tys)
199 %************************************************************************
201 \subsection{Pretty printing}
203 %************************************************************************
205 NB: these types get printed into interface files, so
206 don't change the printing format lightly
209 instance (Outputable name) => Outputable (HsType name) where
210 ppr ty = pprHsType ty
212 instance (Outputable name) => Outputable (HsTyVarBndr name) where
213 ppr (UserTyVar name) = ppr name
214 ppr (IfaceTyVar name kind) = pprHsTyVarBndr name kind
216 instance Outputable name => Outputable (HsPred name) where
217 ppr (HsClassP clas tys) = ppr clas <+> hsep (map pprParendHsType tys)
218 ppr (HsIParam n ty) = hsep [ppr n, dcolon, ppr ty]
220 pprHsTyVarBndr :: Outputable name => name -> Kind -> SDoc
221 pprHsTyVarBndr name kind | kind `eqKind` liftedTypeKind = ppr name
222 | otherwise = hsep [ppr name, dcolon, pprParendKind kind]
224 pprHsForAll [] [] = empty
226 -- This printer is used for both interface files and
227 -- printing user types in error messages; and alas the
228 -- two use slightly different syntax. Ah well.
229 = getPprStyle $ \ sty ->
230 if userStyle sty then
231 ptext SLIT("forall") <+> interppSP tvs <> dot <+>
232 -- **! ToDo: want to hide uvars from user, but not enough info
233 -- in a HsTyVarBndr name (see PprType). KSW 2000-10.
235 else -- Used in interfaces
236 ptext SLIT("__forall") <+> interppSP tvs <+>
237 ppr_hs_context cxt <+> ptext SLIT("=>")
239 pprHsContext :: (Outputable name) => HsContext name -> SDoc
240 pprHsContext [] = empty
241 pprHsContext cxt = ppr_hs_context cxt <+> ptext SLIT("=>")
243 ppr_hs_context [] = empty
244 ppr_hs_context cxt = parens (interpp'SP cxt)
248 pREC_TOP = (0 :: Int) -- type in ParseIface.y
249 pREC_FUN = (1 :: Int) -- btype in ParseIface.y
250 pREC_CON = (2 :: Int) -- atype in ParseIface.y
252 maybeParen :: Bool -> SDoc -> SDoc
253 maybeParen True p = parens p
254 maybeParen False p = p
256 -- printing works more-or-less as for Types
258 pprHsType, pprParendHsType :: (Outputable name) => HsType name -> SDoc
260 pprHsType ty = ppr_mono_ty pREC_TOP ty
261 pprParendHsType ty = ppr_mono_ty pREC_CON ty
263 ppr_mono_ty ctxt_prec (HsForAllTy maybe_tvs ctxt ty)
264 = maybeParen (ctxt_prec >= pREC_FUN) $
265 sep [pp_header, pprHsType ty]
267 pp_header = case maybe_tvs of
268 Just tvs -> pprHsForAll tvs ctxt
269 Nothing -> pprHsContext ctxt
271 ppr_mono_ty ctxt_prec (HsTyVar name)
274 ppr_mono_ty ctxt_prec (HsFunTy ty1 ty2)
275 = let p1 = ppr_mono_ty pREC_FUN ty1
276 p2 = ppr_mono_ty pREC_TOP ty2
278 maybeParen (ctxt_prec >= pREC_FUN)
279 (sep [p1, (<>) (ptext SLIT("-> ")) p2])
281 ppr_mono_ty ctxt_prec (HsTupleTy con tys) = hsTupParens con (interpp'SP tys)
282 ppr_mono_ty ctxt_prec (HsKindSig ty kind) = parens (ppr_mono_ty pREC_TOP ty <+> dcolon <+> pprKind kind)
283 ppr_mono_ty ctxt_prec (HsListTy ty) = brackets (ppr_mono_ty pREC_TOP ty)
284 ppr_mono_ty ctxt_prec (HsPArrTy ty) = pabrackets (ppr_mono_ty pREC_TOP ty)
286 pabrackets p = ptext SLIT("[:") <> p <> ptext SLIT(":]")
288 ppr_mono_ty ctxt_prec (HsAppTy fun_ty arg_ty)
289 = maybeParen (ctxt_prec >= pREC_CON)
290 (hsep [ppr_mono_ty pREC_FUN fun_ty, ppr_mono_ty pREC_CON arg_ty])
292 ppr_mono_ty ctxt_prec (HsPredTy pred)
296 ppr_mono_ty ctxt_prec (HsNumTy n) = integer n
297 ppr_mono_ty ctxt_prec (HsOpTy ty1 op ty2) = ppr ty1 <+> ppr op <+> ppr ty2
301 %************************************************************************
303 \subsection{Converting from Type to HsType}
305 %************************************************************************
307 @toHsType@ converts from a Type to a HsType, making the latter look as
308 user-friendly as possible. Notably, it uses synonyms where possible, and
309 expresses overloaded functions using the '=>' context part of a HsForAllTy.
312 toHsTyVar :: TyVar -> HsTyVarBndr Name
313 toHsTyVar tv = IfaceTyVar (getName tv) (tyVarKind tv)
315 toHsTyVars tvs = map toHsTyVar tvs
317 toHsType :: Type -> HsType Name
318 -- This function knows the representation of types
319 toHsType (TyVarTy tv) = HsTyVar (getName tv)
320 toHsType (FunTy arg res) = HsFunTy (toHsType arg) (toHsType res)
321 toHsType (AppTy fun arg) = HsAppTy (toHsType fun) (toHsType arg)
323 toHsType (NoteTy (SynNote ty@(TyConApp tycon tyargs)) real_ty)
324 | isNewTyCon tycon = toHsType ty
325 | syn_matches = toHsType ty -- Use synonyms if possible!!
328 pprTrace "WARNING: synonym info lost in .hi file for " (ppr syn_ty) $
330 toHsType real_ty -- but drop it if not.
332 syn_matches = ty_from_syn `tcEqType` real_ty
333 (tyvars,syn_ty) = getSynTyConDefn tycon
334 ty_from_syn = substTyWith tyvars tyargs syn_ty
336 -- We only use the type synonym in the file if this doesn't cause
337 -- us to lose important information. This matters for usage
338 -- annotations. It's an issue if some of the args to the synonym
339 -- have arrows in them, or if the synonym's RHS has an arrow; for
340 -- example, with nofib/real/ebnf2ps/ in Parsers.using.
342 -- **! It would be nice if when this test fails we could still
343 -- write the synonym in as a Note, so we don't lose the info for
344 -- error messages, but it's too much work for right now.
347 toHsType (NoteTy _ ty) = toHsType ty
349 toHsType (SourceTy (NType tc tys)) = foldl HsAppTy (HsTyVar (getName tc)) (map toHsType tys)
350 toHsType (SourceTy pred) = HsPredTy (toHsPred pred)
352 toHsType ty@(TyConApp tc tys) -- Must be saturated because toHsType's arg is of kind *
353 | not saturated = generic_case
354 | isTupleTyCon tc = HsTupleTy (HsTupCon (getName tc) (tupleTyConBoxity tc) (tyConArity tc)) tys'
355 | tc `hasKey` listTyConKey = HsListTy (head tys')
356 | tc `hasKey` parrTyConKey = HsPArrTy (head tys')
357 | tc `hasKey` usOnceTyConKey = hsUsOnce_Name -- must print !, . unqualified
358 | tc `hasKey` usManyTyConKey = hsUsMany_Name -- must print !, . unqualified
359 | otherwise = generic_case
361 generic_case = foldl HsAppTy (HsTyVar (getName tc)) tys'
362 tys' = map toHsType tys
363 saturated = tys `lengthIs` tyConArity tc
365 toHsType ty@(ForAllTy _ _) = case tcSplitSigmaTy ty of
366 (tvs, preds, tau) -> HsForAllTy (Just (map toHsTyVar tvs))
370 toHsPred (ClassP cls tys) = HsClassP (getName cls) (map toHsType tys)
371 toHsPred (IParam n ty) = HsIParam n (toHsType ty)
373 toHsContext :: ThetaType -> HsContext Name
374 toHsContext theta = map toHsPred theta
376 toHsFDs :: [FunDep TyVar] -> [FunDep Name]
377 toHsFDs fds = [(map getName ns, map getName ms) | (ns,ms) <- fds]
381 %************************************************************************
383 \subsection{Comparison}
385 %************************************************************************
388 instance Ord a => Eq (HsType a) where
389 -- The Ord is needed because we keep a
390 -- finite map of variables to variables
391 (==) a b = eq_hsType emptyEqHsEnv a b
393 instance Ord a => Eq (HsPred a) where
394 (==) a b = eq_hsPred emptyEqHsEnv a b
396 eqWithHsTyVars :: Ord name =>
397 [HsTyVarBndr name] -> [HsTyVarBndr name]
398 -> (EqHsEnv name -> Bool) -> Bool
399 eqWithHsTyVars = eq_hsTyVars emptyEqHsEnv
403 type EqHsEnv n = FiniteMap n n
404 -- Tracks the mapping from L-variables to R-variables
406 eq_hsVar :: Ord n => EqHsEnv n -> n -> n -> Bool
407 eq_hsVar env n1 n2 = case lookupFM env n1 of
411 extendEqHsEnv env n1 n2
413 | otherwise = addToFM env n1 n2
415 emptyEqHsEnv :: EqHsEnv n
416 emptyEqHsEnv = emptyFM
419 We do define a specialised equality for these \tr{*Type} types; used
420 in checking interfaces.
424 eq_hsTyVars env [] [] k = k env
425 eq_hsTyVars env (tv1:tvs1) (tv2:tvs2) k = eq_hsTyVar env tv1 tv2 $ \ env ->
426 eq_hsTyVars env tvs1 tvs2 k
427 eq_hsTyVars env _ _ _ = False
429 eq_hsTyVar env (UserTyVar v1) (UserTyVar v2) k = k (extendEqHsEnv env v1 v2)
430 eq_hsTyVar env (IfaceTyVar v1 k1) (IfaceTyVar v2 k2) k = k1 `eqKind` k2 && k (extendEqHsEnv env v1 v2)
431 eq_hsTyVar env _ _ _ = False
433 eq_hsVars env [] [] k = k env
434 eq_hsVars env (v1:bs1) (v2:bs2) k = eq_hsVars (extendEqHsEnv env v1 v2) bs1 bs2 k
435 eq_hsVars env _ _ _ = False
440 eq_hsTypes env = eqListBy (eq_hsType env)
443 eq_hsType env (HsForAllTy tvs1 c1 t1) (HsForAllTy tvs2 c2 t2)
444 = eq_tvs tvs1 tvs2 $ \env ->
445 eq_hsContext env c1 c2 &&
448 eq_tvs Nothing (Just _) k = False
449 eq_tvs Nothing Nothing k = k env
450 eq_tvs (Just _) Nothing k = False
451 eq_tvs (Just tvs1) (Just tvs2) k = eq_hsTyVars env tvs1 tvs2 k
453 eq_hsType env (HsTyVar n1) (HsTyVar n2)
456 eq_hsType env (HsTupleTy c1 tys1) (HsTupleTy c2 tys2)
457 = (c1 == c2) && eq_hsTypes env tys1 tys2
459 eq_hsType env (HsListTy ty1) (HsListTy ty2)
460 = eq_hsType env ty1 ty2
462 eq_hsType env (HsKindSig ty1 k1) (HsKindSig ty2 k2)
463 = eq_hsType env ty1 ty2 && k1 `eqKind` k2
465 eq_hsType env (HsPArrTy ty1) (HsPArrTy ty2)
466 = eq_hsType env ty1 ty2
468 eq_hsType env (HsAppTy fun_ty1 arg_ty1) (HsAppTy fun_ty2 arg_ty2)
469 = eq_hsType env fun_ty1 fun_ty2 && eq_hsType env arg_ty1 arg_ty2
471 eq_hsType env (HsFunTy a1 b1) (HsFunTy a2 b2)
472 = eq_hsType env a1 a2 && eq_hsType env b1 b2
474 eq_hsType env (HsPredTy p1) (HsPredTy p2)
475 = eq_hsPred env p1 p2
477 eq_hsType env (HsOpTy lty1 op1 rty1) (HsOpTy lty2 op2 rty2)
478 = eq_hsVar env op1 op2 && eq_hsType env lty1 lty2 && eq_hsType env rty1 rty2
480 eq_hsType env ty1 ty2 = False
484 eq_hsContext env a b = eqListBy (eq_hsPred env) a b
487 eq_hsPred env (HsClassP c1 tys1) (HsClassP c2 tys2)
488 = c1 == c2 && eq_hsTypes env tys1 tys2
489 eq_hsPred env (HsIParam n1 ty1) (HsIParam n2 ty2)
490 = n1 == n2 && eq_hsType env ty1 ty2
491 eq_hsPred env _ _ = False