X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=compiler%2Ftypes%2FCoercion.lhs;h=3bc5d84541e201edeecfa5338efdde1bb318cb76;hb=911e7de13ab1c0e5426c7f234e0c8dd29185a2ba;hp=98b5a0721b59ae03c0c8af44ad4a228fd9a2de17;hpb=701797c3f724090508e06ded276723edfa431ab4;p=ghc-hetmet.git diff --git a/compiler/types/Coercion.lhs b/compiler/types/Coercion.lhs index 98b5a07..3bc5d84 100644 --- a/compiler/types/Coercion.lhs +++ b/compiler/types/Coercion.lhs @@ -12,6 +12,13 @@ The coercion kind constructor is a special TyCon that must always be saturated typeKind (symCoercion type) :: TyConApp CoercionTyCon{...} [type, type] \begin{code} +{-# OPTIONS -fno-warn-incomplete-patterns #-} +-- The above warning supression flag is a temporary kludge. +-- While working on this module you are encouraged to remove it and fix +-- any warnings in the module. See +-- http://hackage.haskell.org/trac/ghc/wiki/Commentary/CodingStyle#Warnings +-- for details + module Coercion ( Coercion, @@ -22,25 +29,30 @@ module Coercion ( isEqPred, mkEqPred, getEqPredTys, isEqPredTy, -- Coercion transformations + mkCoercion, mkSymCoercion, mkTransCoercion, - mkLeftCoercion, mkRightCoercion, mkInstCoercion, mkAppCoercion, + mkLeftCoercion, mkRightCoercion, mkRightCoercions, + mkInstCoercion, mkAppCoercion, mkForAllCoercion, mkFunCoercion, mkInstsCoercion, mkUnsafeCoercion, mkNewTypeCoercion, mkFamInstCoercion, mkAppsCoercion, - splitNewTypeRepCo_maybe, decomposeCo, + splitNewTypeRepCo_maybe, instNewTyCon_maybe, decomposeCo, unsafeCoercionTyCon, symCoercionTyCon, transCoercionTyCon, leftCoercionTyCon, rightCoercionTyCon, instCoercionTyCon, -- needed by TysWiredIn + -- Comparison + coreEqCoercion, + -- CoercionI CoercionI(..), isIdentityCoercion, mkSymCoI, mkTransCoI, mkTyConAppCoI, mkAppTyCoI, mkFunTyCoI, - mkNoteTyCoI, mkForAllTyCoI, - fromCoI, - mkClassPPredCoI, mkIParamPredCoI, mkEqPredCoI, + mkForAllTyCoI, + fromCoI, fromACo, + mkClassPPredCoI, mkIParamPredCoI, mkEqPredCoI ) where @@ -58,7 +70,10 @@ import Util import Unique import BasicTypes import Outputable +import FastString +type Coercion = Type +type CoercionKind = Kind -- A CoercionKind is always of form (ty1 :=: ty2) ------------------------------ decomposeCo :: Arity -> Coercion -> [Coercion] @@ -68,7 +83,7 @@ decomposeCo :: Arity -> Coercion -> [Coercion] decomposeCo n co = go n co [] where - go 0 co cos = cos + go 0 _ cos = cos go n co cos = go (n-1) (mkLeftCoercion co) (mkRightCoercion co : cos) @@ -77,8 +92,9 @@ decomposeCo n co ------------------------------------------------------- -- and some coercion kind stuff +isEqPredTy :: Type -> Bool isEqPredTy (PredTy pred) = isEqPred pred -isEqPredTy other = False +isEqPredTy _ = False mkEqPred :: (Type, Type) -> PredType mkEqPred (ty1, ty2) = EqPred ty1 ty2 @@ -100,10 +116,7 @@ splitCoercionKind (PredTy (EqPred ty1 ty2)) = (ty1, ty2) splitCoercionKind_maybe :: Kind -> Maybe (Type, Type) splitCoercionKind_maybe co | Just co' <- kindView co = splitCoercionKind_maybe co' splitCoercionKind_maybe (PredTy (EqPred ty1 ty2)) = Just (ty1, ty2) -splitCoercionKind_maybe other = Nothing - -type Coercion = Type -type CoercionKind = Kind -- A CoercionKind is always of form (ty1 :=: ty2) +splitCoercionKind_maybe _ = Nothing coercionKind :: Coercion -> (Type, Type) -- c :: (t1 :=: t2) @@ -132,7 +145,6 @@ coercionKind (FunTy ty1 ty2) coercionKind (ForAllTy tv ty) = let (ty1, ty2) = coercionKind ty in (ForAllTy tv ty1, ForAllTy tv ty2) -coercionKind (NoteTy _ ty) = coercionKind ty coercionKind (PredTy (EqPred c1 c2)) = let k1 = coercionKindPredTy c1 k2 = coercionKindPredTy c2 in @@ -154,11 +166,14 @@ coercionKinds tys = unzip $ map coercionKind tys -- Coercion kind and type mk's -- (make saturated TyConApp CoercionTyCon{...} args) +mkCoercion :: TyCon -> [Type] -> Coercion mkCoercion coCon args = ASSERT( tyConArity coCon == length args ) TyConApp coCon args mkAppCoercion, mkFunCoercion, mkTransCoercion, mkInstCoercion :: Coercion -> Coercion -> Coercion mkSymCoercion, mkLeftCoercion, mkRightCoercion :: Coercion -> Coercion +mkAppsCoercion, mkInstsCoercion :: Coercion -> [Coercion] -> Coercion +mkForAllCoercion :: Var -> Coercion -> Coercion mkAppCoercion co1 co2 = mkAppTy co1 co2 mkAppsCoercion co1 tys = foldl mkAppTy co1 tys @@ -224,9 +239,21 @@ mkLeftCoercion co | otherwise = mkCoercion leftCoercionTyCon [co] mkRightCoercion co - | Just (co1, co2) <- splitAppCoercion_maybe co = co2 + | Just (_, co2) <- splitAppCoercion_maybe co = co2 | otherwise = mkCoercion rightCoercionTyCon [co] +mkRightCoercions :: Int -> Coercion -> [Coercion] +mkRightCoercions n co + = go n co [] + where + go n co acc + | n > 0 + = case splitAppCoercion_maybe co of + Just (co1,co2) -> go (n-1) co1 (co2:acc) + Nothing -> go (n-1) (mkCoercion leftCoercionTyCon [co]) (mkCoercion rightCoercionTyCon [co]:acc) + | otherwise + = acc + mkInstCoercion co ty | Just (tv,co') <- splitForAllTy_maybe co = substTyWith [tv] [ty] co' -- (forall a.co) @ ty --> co[ty/a] @@ -235,12 +262,14 @@ mkInstCoercion co ty mkInstsCoercion co tys = foldl mkInstCoercion co tys +{- splitSymCoercion_maybe :: Coercion -> Maybe Coercion splitSymCoercion_maybe (TyConApp tc [co]) = if tc `hasKey` symCoercionTyConKey then Just co else Nothing splitSymCoercion_maybe co = Nothing +-} splitAppCoercion_maybe :: Coercion -> Maybe (Coercion, Coercion) -- Splits a coercion application, being careful *not* to split (left c), etc @@ -253,8 +282,9 @@ splitAppCoercion_maybe (TyConApp tc tys) = case snocView tys of Just (tys', ty') -> Just (TyConApp tc tys', ty') Nothing -> Nothing -splitAppCoercion_maybe co = Nothing +splitAppCoercion_maybe _ = Nothing +{- splitTransCoercion_maybe :: Coercion -> Maybe (Coercion, Coercion) splitTransCoercion_maybe (TyConApp tc [ty1, ty2]) = if tc `hasKey` transCoercionTyConKey then @@ -286,6 +316,7 @@ splitRightCoercion_maybe (TyConApp tc [co]) else Nothing splitRightCoercion_maybe other = Nothing +-} -- Unsafe coercion is not safe, it is used when we know we are dealing with -- bottom, which is one case in which it is safe. It is also used to @@ -334,7 +365,7 @@ mkFamInstCoercion name tvs family instTys rep_tycon -- sym e :: p3=q3 -- then ((sym c) (sym d) (sym e)) :: (p1 p2 p3)=(q1 q2 q3) -symCoercionTyCon, transCoercionTyCon, leftCoercionTyCon, rightCoercionTyCon, instCoercionTyCon :: TyCon +symCoercionTyCon, transCoercionTyCon, leftCoercionTyCon, rightCoercionTyCon, instCoercionTyCon, unsafeCoercionTyCon :: TyCon -- Each coercion TyCon is built with the special CoercionTyCon record and -- carries its own kinding rule. Such CoercionTyCons must be fully applied -- by any TyConApp in which they are applied, however they may also be over @@ -351,7 +382,10 @@ transCoercionTyCon = where composeCoercionKindsOf (co1:co2:rest) = ASSERT( null rest ) - WARN( not (r1 `coreEqType` a2), text "Strange! Type mismatch in trans coercion, probably a bug") + WARN( not (r1 `coreEqType` a2), + text "Strange! Type mismatch in trans coercion, probably a bug" + $$ + ppr r1 <+> text "=/=" <+> ppr a2) (a1, r2) where (a1, r1) = coercionKind co1 @@ -381,6 +415,9 @@ splitCoercionKindOf co , Just (ty_fun1, ty_arg1) <- splitAppTy_maybe ty1 , Just (ty_fun2, ty_arg2) <- splitAppTy_maybe ty2 = ((ty_fun1, ty_fun2),(ty_arg1, ty_arg2)) +splitCoercionKindOf co + = pprPanic "Coercion.splitCoercionKindOf" + (ppr co $$ ppr (coercionKindPredTy co)) instCoercionTyCon = mkCoercionTyCon instCoercionTyConName 2 instCoercionKind @@ -401,36 +438,58 @@ unsafeCoercionTyCon -------------------------------------- -- ...and their names +mkCoConName :: FastString -> Unique -> TyCon -> Name mkCoConName occ key coCon = mkWiredInName gHC_PRIM (mkOccNameFS tcName occ) key (ATyCon coCon) BuiltInSyntax -transCoercionTyConName = mkCoConName FSLIT("trans") transCoercionTyConKey transCoercionTyCon -symCoercionTyConName = mkCoConName FSLIT("sym") symCoercionTyConKey symCoercionTyCon -leftCoercionTyConName = mkCoConName FSLIT("left") leftCoercionTyConKey leftCoercionTyCon -rightCoercionTyConName = mkCoConName FSLIT("right") rightCoercionTyConKey rightCoercionTyCon -instCoercionTyConName = mkCoConName FSLIT("inst") instCoercionTyConKey instCoercionTyCon -unsafeCoercionTyConName = mkCoConName FSLIT("CoUnsafe") unsafeCoercionTyConKey unsafeCoercionTyCon +transCoercionTyConName, symCoercionTyConName, leftCoercionTyConName, rightCoercionTyConName, instCoercionTyConName, unsafeCoercionTyConName :: Name +transCoercionTyConName = mkCoConName (fsLit "trans") transCoercionTyConKey transCoercionTyCon +symCoercionTyConName = mkCoConName (fsLit "sym") symCoercionTyConKey symCoercionTyCon +leftCoercionTyConName = mkCoConName (fsLit "left") leftCoercionTyConKey leftCoercionTyCon +rightCoercionTyConName = mkCoConName (fsLit "right") rightCoercionTyConKey rightCoercionTyCon +instCoercionTyConName = mkCoConName (fsLit "inst") instCoercionTyConKey instCoercionTyCon +unsafeCoercionTyConName = mkCoConName (fsLit "CoUnsafe") unsafeCoercionTyConKey unsafeCoercionTyCon + +instNewTyCon_maybe :: TyCon -> [Type] -> Maybe (Type, CoercionI) +-- instNewTyCon_maybe T ts +-- = Just (rep_ty, co) if co : T ts ~ rep_ty +instNewTyCon_maybe tc tys + | Just (tvs, ty, mb_co_tc) <- unwrapNewTyCon_maybe tc + = ASSERT( tys `lengthIs` tyConArity tc ) + Just (substTyWith tvs tys ty, + case mb_co_tc of + Nothing -> IdCo + Just co_tc -> ACo (mkTyConApp co_tc tys)) + | otherwise + = Nothing + -- this is here to avoid module loops splitNewTypeRepCo_maybe :: Type -> Maybe (Type, Coercion) -- Sometimes we want to look through a newtype and get its associated coercion -- It only strips *one layer* off, so the caller will usually call itself recursively -- Only applied to types of kind *, hence the newtype is always saturated +-- splitNewTypeRepCo_maybe ty +-- = Just (ty', co) if co : ty ~ ty' +-- Returns Nothing for non-newtypes or fully-transparent newtypes splitNewTypeRepCo_maybe ty | Just ty' <- coreView ty = splitNewTypeRepCo_maybe ty' splitNewTypeRepCo_maybe (TyConApp tc tys) - | isClosedNewTyCon tc - = ASSERT( tys `lengthIs` tyConArity tc ) -- splitNewTypeRepCo_maybe only be applied - -- to *types* (of kind *) - case newTyConRhs tc of - (tvs, rep_ty) -> - ASSERT( length tvs == length tys ) - Just (substTyWith tvs tys rep_ty, mkTyConApp co_con tys) - where - co_con = maybe (pprPanic "splitNewTypeRepCo_maybe" (ppr tc)) id (newTyConCo_maybe tc) -splitNewTypeRepCo_maybe other = Nothing + | Just (ty', coi) <- instNewTyCon_maybe tc tys + = case coi of + ACo co -> Just (ty', co) + IdCo -> panic "splitNewTypeRepCo_maybe" + -- This case handled by coreView +splitNewTypeRepCo_maybe _ + = Nothing + +------------------------------------- +-- Syntactic equality of coercions + +coreEqCoercion :: Coercion -> Coercion -> Bool +coreEqCoercion = coreEqType \end{code} @@ -438,18 +497,26 @@ splitNewTypeRepCo_maybe other = Nothing -- CoercionI smart constructors -- lifted smart constructors of ordinary coercions - \begin{code} - -- CoercionI is either -- (a) proper coercion -- (b) the identity coercion -data CoercionI = IdCo | ACo Coercion +data CoercionI = IdCo | ACo Coercion isIdentityCoercion :: CoercionI -> Bool isIdentityCoercion IdCo = True isIdentityCoercion _ = False +allIdCos :: [CoercionI] -> Bool +allIdCos = all isIdentityCoercion + +zipCoArgs :: [CoercionI] -> [Type] -> [Coercion] +zipCoArgs cois tys = zipWith fromCoI cois tys + +fromCoI :: CoercionI -> Type -> Type +fromCoI IdCo ty = ty -- Identity coercion represented +fromCoI (ACo co) _ = co -- by the type itself + mkSymCoI :: CoercionI -> CoercionI mkSymCoI IdCo = IdCo mkSymCoI (ACo co) = ACo $ mkCoercion symCoercionTyCon [co] @@ -462,62 +529,43 @@ mkTransCoI aco IdCo = aco mkTransCoI (ACo co1) (ACo co2) = ACo $ mkTransCoercion co1 co2 mkTyConAppCoI :: TyCon -> [Type] -> [CoercionI] -> CoercionI -mkTyConAppCoI tyCon tys cois = - let (anyAcon,co_args) = f tys cois - in if anyAcon - then ACo (TyConApp tyCon co_args) - else IdCo - where - f [] [] = (False,[]) - f (x:xs) (y:ys) = - let (b,cos) = f xs ys - in case y of - IdCo -> (b,x:cos) - ACo co -> (True,co:cos) +mkTyConAppCoI tyCon tys cois + | allIdCos cois = IdCo + | otherwise = ACo (TyConApp tyCon (zipCoArgs cois tys)) mkAppTyCoI :: Type -> CoercionI -> Type -> CoercionI -> CoercionI -mkAppTyCoI ty1 IdCo ty2 IdCo = IdCo +mkAppTyCoI _ IdCo _ IdCo = IdCo mkAppTyCoI ty1 coi1 ty2 coi2 = ACo $ AppTy (fromCoI coi1 ty1) (fromCoI coi2 ty2) mkFunTyCoI :: Type -> CoercionI -> Type -> CoercionI -> CoercionI -mkFunTyCoI ty1 IdCo ty2 IdCo = IdCo +mkFunTyCoI _ IdCo _ IdCo = IdCo mkFunTyCoI ty1 coi1 ty2 coi2 = ACo $ FunTy (fromCoI coi1 ty1) (fromCoI coi2 ty2) -mkNoteTyCoI :: TyNote -> CoercionI -> CoercionI -mkNoteTyCoI _ IdCo = IdCo -mkNoteTyCoI note (ACo co) = ACo $ NoteTy note co - mkForAllTyCoI :: TyVar -> CoercionI -> CoercionI mkForAllTyCoI _ IdCo = IdCo mkForAllTyCoI tv (ACo co) = ACo $ ForAllTy tv co -fromCoI IdCo ty = ty -fromCoI (ACo co) ty = co +fromACo :: CoercionI -> Coercion +fromACo (ACo co) = co mkClassPPredCoI :: Class -> [Type] -> [CoercionI] -> CoercionI -mkClassPPredCoI cls tys cois = - let (anyAcon,co_args) = f tys cois - in if anyAcon - then ACo $ PredTy $ ClassP cls co_args - else IdCo - where - f [] [] = (False,[]) - f (x:xs) (y:ys) = - let (b,cos) = f xs ys - in case y of - IdCo -> (b,x:cos) - ACo co -> (True,co:cos) +-- mkClassPPredCoI cls tys cois = coi +-- coi : PredTy (cls tys) ~ predTy (cls (tys `cast` cois)) +mkClassPPredCoI cls tys cois + | allIdCos cois = IdCo + | otherwise = ACo $ PredTy $ ClassP cls (zipCoArgs cois tys) mkIParamPredCoI :: (IPName Name) -> CoercionI -> CoercionI -mkIParamPredCoI ipn IdCo = IdCo +-- Similar invariant to mkclassPPredCoI +mkIParamPredCoI _ IdCo = IdCo mkIParamPredCoI ipn (ACo co) = ACo $ PredTy $ IParam ipn co mkEqPredCoI :: Type -> CoercionI -> Type -> CoercionI -> CoercionI +-- Similar invariant to mkclassPPredCoI mkEqPredCoI _ IdCo _ IdCo = IdCo mkEqPredCoI ty1 IdCo _ (ACo co2) = ACo $ PredTy $ EqPred ty1 co2 -mkEqPredCoI ty1 (ACo co1) ty2 coi2 = ACo $ PredTy $ EqPred co1 (fromCoI coi2 ty2) - +mkEqPredCoI _ (ACo co1) ty2 coi2 = ACo $ PredTy $ EqPred co1 (fromCoI coi2 ty2) \end{code}