X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2FhsSyn%2FHsTypes.lhs;h=354180d23a9f3cdae313a99cba3f8e93f7290e39;hb=5e6242927839c8ddc73a55eb7828c0b7e4cc3ab2;hp=471c620cf856a6888ca8c0746804b1d24574f3fd;hpb=6c381e873e222417d9a67aeec77b9555eca7b7a8;p=ghc-hetmet.git diff --git a/ghc/compiler/hsSyn/HsTypes.lhs b/ghc/compiler/hsSyn/HsTypes.lhs index 471c620..354180d 100644 --- a/ghc/compiler/hsSyn/HsTypes.lhs +++ b/ghc/compiler/hsSyn/HsTypes.lhs @@ -1,265 +1,452 @@ % -% (c) The GRASP/AQUA Project, Glasgow University, 1992-1996 +% (c) The GRASP/AQUA Project, Glasgow University, 1992-1998 % \section[HsTypes]{Abstract syntax: user-defined types} -If compiled without \tr{#define COMPILING_GHC}, you get -(part of) a Haskell-abstract-syntax library. With it, -you get part of GHC. - \begin{code} -#include "HsVersions.h" - module HsTypes ( - PolyType(..), MonoType(..), - Context(..), ClassAssertion(..) + HsType(..), HsTyVarBndr(..), + , HsContext, HsPred(..) + , HsTupCon(..), hsTupParens, mkHsTupCon, + , hsUsOnce, hsUsMany -#ifdef COMPILING_GHC - , cmpPolyType, cmpMonoType - , pprParendMonoType, pprContext - , extractMonoTyNames, extractCtxtTyNames -#endif + , mkHsForAllTy, mkHsDictTy, mkHsIParamTy + , hsTyVarName, hsTyVarNames, replaceTyVarName + + -- Printing + , pprParendHsType, pprHsForAll, pprHsContext, pprHsTyVarBndr + + -- Equality over Hs things + , EqHsEnv, emptyEqHsEnv, extendEqHsEnv, + , eqWithHsTyVars, eq_hsVar, eq_hsVars, eq_hsTyVars, eq_hsType, eq_hsContext, eqListBy + + -- Converting from Type to HsType + , toHsType, toHsTyVar, toHsTyVars, toHsContext, toHsFDs ) where -#ifdef COMPILING_GHC -import Ubiq{-uitous-} +#include "HsVersions.h" -import Outputable ( interppSP, ifnotPprForUser ) -import Pretty -import ProtoName ( cmpProtoName, ProtoName ) -import Type ( Kind ) -import Util ( cmpList, panic# ) +import Class ( FunDep ) +import Type ( Type, Kind, PredType(..), ClassContext, + splitSigmaTy, liftedTypeKind + ) +import TypeRep ( Type(..), TyNote(..) ) -- toHsType sees the representation +import TyCon ( isTupleTyCon, tupleTyConBoxity, tyConArity, getSynTyConDefn ) +import RdrName ( RdrName, mkUnqual ) +import Name ( Name, getName ) +import OccName ( NameSpace, tvName ) +import Var ( TyVar, tyVarKind ) +import Subst ( mkTyVarSubst, substTy ) +import PprType ( {- instance Outputable Kind -}, pprParendKind ) +import BasicTypes ( Boxity(..), Arity, tupleParens ) +import PrelNames ( mkTupConRdrName, listTyConKey, usOnceTyConKey, usManyTyConKey, hasKey, + usOnceTyConName, usManyTyConName + ) +import FiniteMap +import Outputable -#endif {- COMPILING_GHC -} \end{code} This is the syntax for types as seen in type signatures. \begin{code} -data PolyType name - = HsPreForAllTy (Context name) - (MonoType name) +type HsContext name = [HsPred name] + +data HsPred name = HsPClass name [HsType name] + | HsPIParam name (HsType name) + +data HsType name + = HsForAllTy (Maybe [HsTyVarBndr name]) -- Nothing for implicitly quantified signatures + (HsContext name) + (HsType name) + + | HsTyVar name -- Type variable or type constructor + + | HsAppTy (HsType name) + (HsType name) + + | HsFunTy (HsType name) -- function type + (HsType name) + + | HsListTy (HsType name) -- Element type + + | HsTupleTy (HsTupCon name) + [HsType name] -- Element types (length gives arity) + -- Generics + | HsOpTy (HsType name) name (HsType name) + | HsNumTy Integer + -- these next two are only used in interfaces + | HsPredTy (HsPred name) + + | HsUsageTy (HsType name) -- Usage annotation + (HsType name) -- Annotated type + + +----------------------- +hsUsOnce, hsUsMany :: HsType RdrName +hsUsOnce = HsTyVar (mkUnqual tvName SLIT(".")) -- deep magic +hsUsMany = HsTyVar (mkUnqual tvName SLIT("!")) -- deep magic + +hsUsOnce_Name, hsUsMany_Name :: HsType Name +hsUsOnce_Name = HsTyVar usOnceTyConName +hsUsMany_Name = HsTyVar usManyTyConName + +----------------------- +data HsTupCon name = HsTupCon name Boxity Arity + +instance Eq name => Eq (HsTupCon name) where + (HsTupCon _ b1 a1) == (HsTupCon _ b2 a2) = b1==b2 && a1==a2 + +mkHsTupCon :: NameSpace -> Boxity -> [a] -> HsTupCon RdrName +mkHsTupCon space boxity args = HsTupCon (mkTupConRdrName space boxity arity) boxity arity + where + arity = length args + +hsTupParens :: HsTupCon name -> SDoc -> SDoc +hsTupParens (HsTupCon _ b _) p = tupleParens b p + +----------------------- +-- Combine adjacent for-alls. +-- The following awkward situation can happen otherwise: +-- f :: forall a. ((Num a) => Int) +-- might generate HsForAll (Just [a]) [] (HsForAll Nothing [Num a] t) +-- Then a isn't discovered as ambiguous, and we abstract the AbsBinds wrt [] +-- but the export list abstracts f wrt [a]. Disaster. +-- +-- A valid type must have one for-all at the top of the type, or of the fn arg types + +mkHsForAllTy (Just []) [] ty = ty -- Explicit for-all with no tyvars +mkHsForAllTy mtvs1 [] (HsForAllTy mtvs2 ctxt ty) = mkHsForAllTy (mtvs1 `plus` mtvs2) ctxt ty + where + mtvs1 `plus` Nothing = mtvs1 + Nothing `plus` mtvs2 = mtvs2 + (Just tvs1) `plus` (Just tvs2) = Just (tvs1 ++ tvs2) +mkHsForAllTy tvs ctxt ty = HsForAllTy tvs ctxt ty + +mkHsDictTy cls tys = HsPredTy (HsPClass cls tys) +mkHsIParamTy v ty = HsPredTy (HsPIParam v ty) + +data HsTyVarBndr name + = UserTyVar name + | IfaceTyVar name Kind + -- *** NOTA BENE *** A "monotype" in a pragma can have + -- for-alls in it, (mostly to do with dictionaries). These + -- must be explicitly Kinded. - -- The renamer turns HsPreForAllTys into HsForAllTys when they - -- occur in signatures, to make the binding of variables - -- explicit. This distinction is made visible for - -- non-COMPILING_GHC code, because you probably want to do the - -- same thing. +hsTyVarName (UserTyVar n) = n +hsTyVarName (IfaceTyVar n _) = n - | HsForAllTy [name] - (Context name) - (MonoType name) +hsTyVarNames tvs = map hsTyVarName tvs -type Context name = [ClassAssertion name] +replaceTyVarName :: HsTyVarBndr name1 -> name2 -> HsTyVarBndr name2 +replaceTyVarName (UserTyVar n) n' = UserTyVar n' +replaceTyVarName (IfaceTyVar n k) n' = IfaceTyVar n' k +\end{code} -type ClassAssertion name = (name, name) -data MonoType name - = MonoTyVar name -- Type variable +%************************************************************************ +%* * +\subsection{Pretty printing} +%* * +%************************************************************************ - | MonoTyApp name -- Type constructor or variable - [MonoType name] +NB: these types get printed into interface files, so + don't change the printing format lightly - -- We *could* have a "MonoTyCon name" equiv to "MonoTyApp name []" - -- (for efficiency, what?) WDP 96/02/18 +\begin{code} +instance (Outputable name) => Outputable (HsType name) where + ppr ty = pprHsType ty + +instance (Outputable name) => Outputable (HsTyVarBndr name) where + ppr (UserTyVar name) = ppr name + ppr (IfaceTyVar name kind) = pprHsTyVarBndr name kind + +instance Outputable name => Outputable (HsPred name) where + ppr (HsPClass clas tys) = ppr clas <+> hsep (map pprParendHsType tys) + ppr (HsPIParam n ty) = hsep [char '?' <> ppr n, text "::", ppr ty] + +pprHsTyVarBndr :: Outputable name => name -> Kind -> SDoc +pprHsTyVarBndr name kind | kind == liftedTypeKind = ppr name + | otherwise = hsep [ppr name, dcolon, pprParendKind kind] + +pprHsForAll [] [] = empty +pprHsForAll tvs cxt + -- This printer is used for both interface files and + -- printing user types in error messages; and alas the + -- two use slightly different syntax. Ah well. + = getPprStyle $ \ sty -> + if userStyle sty then + ptext SLIT("forall") <+> interppSP tvs <> dot <+> + -- **! ToDo: want to hide uvars from user, but not enough info + -- in a HsTyVarBndr name (see PprType). KSW 2000-10. + (if null cxt then + empty + else + ppr_context cxt <+> ptext SLIT("=>") + ) + else -- Used in interfaces + ptext SLIT("__forall") <+> interppSP tvs <+> + ppr_context cxt <+> ptext SLIT("=>") + +pprHsContext :: (Outputable name) => HsContext name -> SDoc +pprHsContext [] = empty +pprHsContext cxt = ppr_context cxt <+> ptext SLIT("=>") + +ppr_context [] = empty +ppr_context cxt = parens (interpp'SP cxt) +\end{code} - | MonoFunTy (MonoType name) -- function type - (MonoType name) +\begin{code} +pREC_TOP = (0 :: Int) -- type in ParseIface.y +pREC_FUN = (1 :: Int) -- btype in ParseIface.y +pREC_CON = (2 :: Int) -- atype in ParseIface.y + +maybeParen :: Bool -> SDoc -> SDoc +maybeParen True p = parens p +maybeParen False p = p + +-- printing works more-or-less as for Types - | MonoListTy (MonoType name) -- list type - | MonoTupleTy [MonoType name] -- tuple type (length gives arity) +pprHsType, pprParendHsType :: (Outputable name) => HsType name -> SDoc -#ifdef COMPILING_GHC - -- these next two are only used in unfoldings in interfaces - | MonoDictTy name -- Class - (MonoType name) +pprHsType ty = ppr_mono_ty pREC_TOP ty +pprParendHsType ty = ppr_mono_ty pREC_CON ty - | MonoForAllTy [(name, Kind)] - (MonoType name) - -- *** NOTA BENE *** A "monotype" in a pragma can have - -- for-alls in it, (mostly to do with dictionaries). These - -- must be explicitly Kinded. +ppr_mono_ty ctxt_prec (HsForAllTy maybe_tvs ctxt ty) + = maybeParen (ctxt_prec >= pREC_FUN) $ + sep [pp_header, pprHsType ty] + where + pp_header = case maybe_tvs of + Just tvs -> pprHsForAll tvs ctxt + Nothing -> pprHsContext ctxt + +ppr_mono_ty ctxt_prec (HsTyVar name) + = ppr name + +ppr_mono_ty ctxt_prec (HsFunTy ty1 ty2) + = let p1 = ppr_mono_ty pREC_FUN ty1 + p2 = ppr_mono_ty pREC_TOP ty2 + in + maybeParen (ctxt_prec >= pREC_FUN) + (sep [p1, (<>) (ptext SLIT("-> ")) p2]) + +ppr_mono_ty ctxt_prec (HsTupleTy con tys) = hsTupParens con (interpp'SP tys) +ppr_mono_ty ctxt_prec (HsListTy ty) = brackets (ppr_mono_ty pREC_TOP ty) + +ppr_mono_ty ctxt_prec (HsAppTy fun_ty arg_ty) + = maybeParen (ctxt_prec >= pREC_CON) + (hsep [ppr_mono_ty pREC_FUN fun_ty, ppr_mono_ty pREC_CON arg_ty]) + +ppr_mono_ty ctxt_prec (HsPredTy pred) + = braces (ppr pred) -#endif {- COMPILING_GHC -} +ppr_mono_ty ctxt_prec (HsUsageTy u ty) + = maybeParen (ctxt_prec >= pREC_CON) + (sep [ptext SLIT("__u") <+> ppr_mono_ty pREC_CON u, + ppr_mono_ty pREC_CON ty]) + -- pREC_FUN would be logical for u, but it yields a reduce/reduce conflict with AppTy + +-- Generics +ppr_mono_ty ctxt_prec (HsNumTy n) = integer n +ppr_mono_ty ctxt_prec (HsOpTy ty1 op ty2) = ppr ty1 <+> ppr op <+> ppr ty2 \end{code} -We do define a specialised equality for these \tr{*Type} types; used -in checking interfaces. Most any other use is likely to be {\em -wrong}, so be careful! + +%************************************************************************ +%* * +\subsection{Converting from Type to HsType} +%* * +%************************************************************************ + +@toHsType@ converts from a Type to a HsType, making the latter look as +user-friendly as possible. Notably, it uses synonyms where possible, and +expresses overloaded functions using the '=>' context part of a HsForAllTy. + \begin{code} -#ifdef COMPILING_GHC - -cmpPolyType :: (a -> a -> TAG_) -> PolyType a -> PolyType a -> TAG_ -cmpMonoType :: (a -> a -> TAG_) -> MonoType a -> MonoType a -> TAG_ -cmpContext :: (a -> a -> TAG_) -> Context a -> Context a -> TAG_ - --- We assume that HsPreForAllTys have been smashed by now. -# ifdef DEBUG -cmpPolyType _ (HsPreForAllTy _ _) _ = panic# "cmpPolyType:HsPreForAllTy:1st arg" -cmpPolyType _ _ (HsPreForAllTy _ _) = panic# "cmpPolyType:HsPreForAllTy:2nd arg" -# endif - -cmpPolyType cmp (HsForAllTy tvs1 c1 t1) (HsForAllTy tvs2 c2 t2) - = case (cmp_tvs tvs1 tvs2) of - EQ_ -> case (cmpContext cmp c1 c2) of - EQ_ -> cmpMonoType cmp t1 t2 - xxx -> xxx - xxx -> xxx +toHsTyVar :: TyVar -> HsTyVarBndr Name +toHsTyVar tv = IfaceTyVar (getName tv) (tyVarKind tv) + +toHsTyVars tvs = map toHsTyVar tvs + +toHsType :: Type -> HsType Name +-- This function knows the representation of types +toHsType (TyVarTy tv) = HsTyVar (getName tv) +toHsType (FunTy arg res) = HsFunTy (toHsType arg) (toHsType res) +toHsType (AppTy fun arg) = HsAppTy (toHsType fun) (toHsType arg) + +toHsType (NoteTy (SynNote syn_ty) real_ty) + | syn_matches = toHsType syn_ty -- Use synonyms if possible!! + | otherwise = +#ifdef DEBUG + pprTrace "WARNING: synonym info lost in .hi file for " (ppr syn_ty) $ +#endif + toHsType real_ty -- but drop it if not. where - cmp_tvs [] [] = EQ_ - cmp_tvs [] _ = LT_ - cmp_tvs _ [] = GT_ - cmp_tvs (a:as) (b:bs) - = case cmp a b of { EQ_ -> cmp_tvs as bs; xxx -> xxx } - cmp_tvs _ _ = panic# "cmp_tvs" - ------------ -cmpMonoType cmp (MonoTyVar n1) (MonoTyVar n2) - = cmp n1 n2 - -cmpMonoType cmp (MonoTupleTy tys1) (MonoTupleTy tys2) - = cmpList (cmpMonoType cmp) tys1 tys2 -cmpMonoType cmp (MonoListTy ty1) (MonoListTy ty2) - = cmpMonoType cmp ty1 ty2 - -cmpMonoType cmp (MonoTyApp tc1 tys1) (MonoTyApp tc2 tys2) - = case cmp tc1 tc2 of { EQ_ -> cmpList (cmpMonoType cmp) tys1 tys2; xxx -> xxx } - -cmpMonoType cmp (MonoFunTy a1 b1) (MonoFunTy a2 b2) - = case cmpMonoType cmp a1 a2 of { EQ_ -> cmpMonoType cmp b1 b2; xxx -> xxx } - -cmpMonoType cmp (MonoDictTy c1 ty1) (MonoDictTy c2 ty2) - = case cmp c1 c2 of { EQ_ -> cmpMonoType cmp ty1 ty2; xxx -> xxx } - -cmpMonoType cmp ty1 ty2 -- tags must be different - = let tag1 = tag ty1 - tag2 = tag ty2 - in - if tag1 _LT_ tag2 then LT_ else GT_ + syn_matches = ty_from_syn == real_ty + + TyConApp syn_tycon tyargs = syn_ty + (tyvars,ty) = getSynTyConDefn syn_tycon + ty_from_syn = substTy (mkTyVarSubst tyvars tyargs) ty + + -- We only use the type synonym in the file if this doesn't cause + -- us to lose important information. This matters for usage + -- annotations. It's an issue if some of the args to the synonym + -- have arrows in them, or if the synonym's RHS has an arrow; for + -- example, with nofib/real/ebnf2ps/ in Parsers.using. + + -- **! It would be nice if when this test fails we could still + -- write the synonym in as a Note, so we don't lose the info for + -- error messages, but it's too much work for right now. + -- KSW 2000-07. + +toHsType (NoteTy _ ty) = toHsType ty + +toHsType (PredTy p) = HsPredTy (toHsPred p) + +toHsType ty@(TyConApp tc tys) -- Must be saturated because toHsType's arg is of kind * + | not saturated = generic_case + | isTupleTyCon tc = HsTupleTy (HsTupCon (getName tc) (tupleTyConBoxity tc) (tyConArity tc)) tys' + | tc `hasKey` listTyConKey = HsListTy (head tys') + | tc `hasKey` usOnceTyConKey = hsUsOnce_Name -- must print !, . unqualified + | tc `hasKey` usManyTyConKey = hsUsMany_Name -- must print !, . unqualified + | otherwise = generic_case where - tag (MonoTyVar n1) = (ILIT(1) :: FAST_INT) - tag (MonoTupleTy tys1) = ILIT(2) - tag (MonoListTy ty1) = ILIT(3) - tag (MonoTyApp tc1 tys1) = ILIT(4) - tag (MonoFunTy a1 b1) = ILIT(5) - tag (MonoDictTy c1 ty1) = ILIT(7) + generic_case = foldl HsAppTy (HsTyVar (getName tc)) tys' + tys' = map toHsType tys + saturated = length tys == tyConArity tc -------------------- -cmpContext cmp a b - = cmpList cmp_ctxt a b - where - cmp_ctxt (c1, tv1) (c2, tv2) - = case cmp c1 c2 of { EQ_ -> cmp tv1 tv2; xxx -> xxx } +toHsType ty@(ForAllTy _ _) = case splitSigmaTy ty of + (tvs, preds, tau) -> HsForAllTy (Just (map toHsTyVar tvs)) + (map toHsPred preds) + (toHsType tau) -------------------- +toHsType (UsageTy u ty) = HsUsageTy (toHsType u) (toHsType ty) + -- **! consider dropping usMany annotations ToDo KSW 2000-10 + + +toHsPred (Class cls tys) = HsPClass (getName cls) (map toHsType tys) +toHsPred (IParam n ty) = HsPIParam (getName n) (toHsType ty) + +toHsContext :: ClassContext -> HsContext Name +toHsContext cxt = [HsPClass (getName cls) (map toHsType tys) | (cls,tys) <- cxt] + +toHsFDs :: [FunDep TyVar] -> [FunDep Name] +toHsFDs fds = [(map getName ns, map getName ms) | (ns,ms) <- fds] \end{code} -This is used in various places: + +%************************************************************************ +%* * +\subsection{Comparison} +%* * +%************************************************************************ + \begin{code} -pprContext :: (Outputable name) => PprStyle -> (Context name) -> Pretty - -pprContext sty [] = ppNil -pprContext sty [(clas, ty)] = ppCat [ppr sty clas, ppr sty ty, ppStr "=>"] -pprContext sty context - = ppBesides [ppLparen, - ppInterleave ppComma (map pp_assert context), - ppRparen, ppStr " =>"] - where - pp_assert (clas, ty) - = ppCat [ppr sty clas, ppr sty ty] +instance Ord a => Eq (HsType a) where + -- The Ord is needed because we keep a + -- finite map of variables to variables + (==) a b = eq_hsType emptyEqHsEnv a b + +instance Ord a => Eq (HsPred a) where + (==) a b = eq_hsPred emptyEqHsEnv a b + +eqWithHsTyVars :: Ord name => + [HsTyVarBndr name] -> [HsTyVarBndr name] + -> (EqHsEnv name -> Bool) -> Bool +eqWithHsTyVars = eq_hsTyVars emptyEqHsEnv \end{code} \begin{code} -instance (Outputable name) => Outputable (PolyType name) where - ppr sty (HsPreForAllTy ctxt ty) - = print_it sty ppNil ctxt ty - ppr sty (HsForAllTy tvs ctxt ty) - = print_it sty - (ppBesides [ppStr "_forall_ ", interppSP sty tvs, ppStr " => "]) - ctxt ty +type EqHsEnv n = FiniteMap n n +-- Tracks the mapping from L-variables to R-variables -print_it sty pp_forall ctxt ty - = ppCat [ifnotPprForUser sty pp_forall, -- print foralls unless PprForUser - pprContext sty ctxt, ppr sty ty] +eq_hsVar :: Ord n => EqHsEnv n -> n -> n -> Bool +eq_hsVar env n1 n2 = case lookupFM env n1 of + Just n1 -> n1 == n2 + Nothing -> n1 == n2 -instance (Outputable name) => Outputable (MonoType name) where - ppr = pprMonoType +extendEqHsEnv env n1 n2 + | n1 == n2 = env + | otherwise = addToFM env n1 n2 -pREC_TOP = (0 :: Int) -pREC_FUN = (1 :: Int) -pREC_CON = (2 :: Int) +emptyEqHsEnv :: EqHsEnv n +emptyEqHsEnv = emptyFM +\end{code} --- printing works more-or-less as for Types +We do define a specialised equality for these \tr{*Type} types; used +in checking interfaces. + +\begin{code} +------------------- +eq_hsTyVars env [] [] k = k env +eq_hsTyVars env (tv1:tvs1) (tv2:tvs2) k = eq_hsTyVar env tv1 tv2 $ \ env -> + eq_hsTyVars env tvs1 tvs2 k +eq_hsTyVars env _ _ _ = False + +eq_hsTyVar env (UserTyVar v1) (UserTyVar v2) k = k (extendEqHsEnv env v1 v2) +eq_hsTyVar env (IfaceTyVar v1 k1) (IfaceTyVar v2 k2) k = k1 == k2 && k (extendEqHsEnv env v1 v2) +eq_hsTyVar env _ _ _ = False + +eq_hsVars env [] [] k = k env +eq_hsVars env (v1:bs1) (v2:bs2) k = eq_hsVars (extendEqHsEnv env v1 v2) bs1 bs2 k +eq_hsVars env _ _ _ = False +\end{code} + +\begin{code} +------------------- +eq_hsTypes env = eqListBy (eq_hsType env) -pprMonoType, pprParendMonoType :: (Outputable name) => PprStyle -> MonoType name -> Pretty +------------------- +eq_hsType env (HsForAllTy tvs1 c1 t1) (HsForAllTy tvs2 c2 t2) + = eq_tvs tvs1 tvs2 $ \env -> + eq_hsContext env c1 c2 && + eq_hsType env t1 t2 + where + eq_tvs Nothing (Just _) k = False + eq_tvs Nothing Nothing k = k env + eq_tvs (Just _) Nothing k = False + eq_tvs (Just tvs1) (Just tvs2) k = eq_hsTyVars env tvs1 tvs2 k -pprMonoType sty ty = ppr_mono_ty sty pREC_TOP ty -pprParendMonoType sty ty = ppr_mono_ty sty pREC_CON ty +eq_hsType env (HsTyVar n1) (HsTyVar n2) + = eq_hsVar env n1 n2 -ppr_mono_ty sty ctxt_prec (MonoTyVar name) = ppr sty name +eq_hsType env (HsTupleTy c1 tys1) (HsTupleTy c2 tys2) + = (c1 == c2) && eq_hsTypes env tys1 tys2 -ppr_mono_ty sty ctxt_prec (MonoFunTy ty1 ty2) - = let p1 = ppr_mono_ty sty pREC_FUN ty1 - p2 = ppr_mono_ty sty pREC_TOP ty2 - in - if ctxt_prec < pREC_FUN then -- no parens needed - ppSep [p1, ppBeside (ppStr "-> ") p2] - else - ppSep [ppBeside ppLparen p1, ppBesides [ppStr "-> ", p2, ppRparen]] - -ppr_mono_ty sty ctxt_prec (MonoTupleTy tys) - = ppBesides [ppLparen, ppInterleave ppComma (map (ppr sty) tys), ppRparen] - -ppr_mono_ty sty ctxt_prec (MonoListTy ty) - = ppBesides [ppLbrack, ppr_mono_ty sty pREC_TOP ty, ppRbrack] - -ppr_mono_ty sty ctxt_prec (MonoTyApp tycon tys) - = let pp_tycon = ppr sty tycon in - if null tys then - pp_tycon - else if ctxt_prec < pREC_CON then -- no parens needed - ppCat [pp_tycon, ppInterleave ppNil (map (ppr_mono_ty sty pREC_CON) tys)] - else - ppBesides [ ppLparen, pp_tycon, ppSP, - ppInterleave ppNil (map (ppr_mono_ty sty pREC_CON) tys), ppRparen ] - --- unfoldings only -ppr_mono_ty sty ctxt_prec (MonoDictTy clas ty) - = ppBesides [ppStr "{{", ppr sty clas, ppSP, ppr_mono_ty sty ctxt_prec ty, ppStr "}}"] - -#endif {- COMPILING_GHC -} -\end{code} +eq_hsType env (HsListTy ty1) (HsListTy ty2) + = eq_hsType env ty1 ty2 -Get the type variable names from a @MonoType@. Don't use class @Eq@ -because @ProtoNames@ aren't in it. +eq_hsType env (HsAppTy fun_ty1 arg_ty1) (HsAppTy fun_ty2 arg_ty2) + = eq_hsType env fun_ty1 fun_ty2 && eq_hsType env arg_ty1 arg_ty2 -\begin{code} -#ifdef COMPILING_GHC +eq_hsType env (HsFunTy a1 b1) (HsFunTy a2 b2) + = eq_hsType env a1 a2 && eq_hsType env b1 b2 -extractCtxtTyNames :: (name -> name -> Bool) -> Context name -> [name] -extractMonoTyNames :: (name -> name -> Bool) -> MonoType name -> [name] +eq_hsType env (HsPredTy p1) (HsPredTy p2) + = eq_hsPred env p1 p2 -extractCtxtTyNames eq ctxt - = foldr get [] ctxt - where - get (clas, tv) acc - | is_elem eq tv acc = acc - | otherwise = tv : acc +eq_hsType env (HsUsageTy u1 ty1) (HsUsageTy u2 ty2) + = eq_hsType env u1 u2 && eq_hsType env ty1 ty2 -extractMonoTyNames eq ty - = get ty [] - where - get (MonoTyApp con tys) acc = foldr get acc tys - get (MonoListTy ty) acc = get ty acc - get (MonoFunTy ty1 ty2) acc = get ty1 (get ty2 acc) - get (MonoDictTy _ ty) acc = get ty acc - get (MonoTupleTy tys) acc = foldr get acc tys - get (MonoTyVar name) acc - | is_elem eq name acc = acc - | otherwise = name : acc - -is_elem eq n [] = False -is_elem eq n (x:xs) = n `eq` x || is_elem eq n xs - -#endif {- COMPILING_GHC -} +eq_hsType env (HsOpTy lty1 op1 rty1) (HsOpTy lty2 op2 rty2) + = eq_hsVar env op1 op2 && eq_hsType env lty1 lty2 && eq_hsType env rty1 rty2 + +eq_hsType env ty1 ty2 = False + + +------------------- +eq_hsContext env a b = eqListBy (eq_hsPred env) a b + +------------------- +eq_hsPred env (HsPClass c1 tys1) (HsPClass c2 tys2) + = c1 == c2 && eq_hsTypes env tys1 tys2 +eq_hsPred env (HsPIParam n1 ty1) (HsPIParam n2 ty2) + = n1 == n2 && eq_hsType env ty1 ty2 +eq_hsPred env _ _ = False + +------------------- +eqListBy :: (a->a->Bool) -> [a] -> [a] -> Bool +eqListBy eq [] [] = True +eqListBy eq (x:xs) (y:ys) = eq x y && eqListBy eq xs ys +eqListBy eq xs ys = False \end{code}