X-Git-Url: http://git.megacz.com/?p=ghc-hetmet.git;a=blobdiff_plain;f=compiler%2Ftypes%2FCoercion.lhs;h=55a282db5424cbc84399f7cb993c9323c2debe5f;hp=c9de505c2a631647e4e4a6b69796ddfc205fc209;hb=5e0ea427646a5474dd7c659b0713c6a62d8c99c7;hpb=67ee8a93fc96a38c3f73468cb86d8421a11d2911 diff --git a/compiler/types/Coercion.lhs b/compiler/types/Coercion.lhs index c9de505..55a282d 100644 --- a/compiler/types/Coercion.lhs +++ b/compiler/types/Coercion.lhs @@ -37,7 +37,7 @@ import TypeRep import Type ( Type, Kind, PredType, substTyWith, mkAppTy, mkForAllTy, mkFunTy, splitAppTy_maybe, splitForAllTy_maybe, coreView, kindView, mkTyConApp, isCoercionKind, isEqPred, mkAppTys, - coreEqType + coreEqType, splitAppTys, isTyVarTy, splitTyConApp_maybe ) import TyCon ( TyCon, tyConArity, mkCoercionTyCon, isNewTyCon, newTyConRhs, newTyConCo, @@ -165,19 +165,42 @@ mkAppsCoercion co1 tys = foldl mkAppTy co1 tys mkForAllCoercion tv co = ASSERT ( isTyVar tv ) mkForAllTy tv co mkFunCoercion co1 co2 = mkFunTy co1 co2 + +-- This smart constructor creates a sym'ed version its argument, +-- but tries to push the sym's down to the leaves. If we come to +-- sym tv or sym tycon then we can drop the sym because tv and tycon +-- are reflexive coercions mkSymCoercion co | Just co2 <- splitSymCoercion_maybe co = co2 - | Just (co1, co2) <- splitAppCoercion_maybe co - -- should make this case better - = mkAppCoercion (mkSymCoercion co1) (mkSymCoercion co2) + -- sym (sym co) --> co + | Just (co1, arg_tys) <- splitTyConApp_maybe co + , not (isCoercionTyCon co1) = mkTyConApp co1 (map mkSymCoercion arg_tys) + -- we can drop the sym for a TyCon + -- sym (ty [t1, ..., tn]) --> ty [sym t1, ..., sym tn] + | (co1, arg_tys) <- splitAppTys co + , isTyVarTy co1 = mkAppTys (maybe_drop co1) (map mkSymCoercion arg_tys) + -- sym (tv [t1, ..., tn]) --> tv [sym t1, ..., sym tn] + -- if tv type variable + -- sym (cv [t1, ..., tn]) --> (sym cv) [sym t1, ..., sym tn] + -- if cv is a coercion variable + -- fall through if head is a CoercionTyCon | Just (co1, co2) <- splitTransCoercion_maybe co + -- sym (co1 `trans` co2) --> (sym co2) `trans (sym co2) = mkTransCoercion (mkSymCoercion co2) (mkSymCoercion co1) | Just (co, ty) <- splitInstCoercion_maybe co + -- sym (co @ ty) --> (sym co) @ ty = mkInstCoercion (mkSymCoercion co) ty | Just co <- splitLeftCoercion_maybe co + -- sym (left co) --> left (sym co) = mkLeftCoercion (mkSymCoercion co) | Just co <- splitRightCoercion_maybe co + -- sym (right co) --> right (sym co) = mkRightCoercion (mkSymCoercion co) + where + maybe_drop (TyVarTy tv) + | isCoVar tv = mkCoercion symCoercionTyCon [TyVarTy tv] + | otherwise = TyVarTy tv + maybe_drop other = other mkSymCoercion (ForAllTy tv ty) = ForAllTy tv (mkSymCoercion ty) -- for atomic types and constructors, we can just ignore sym since these -- are reflexive coercions @@ -185,7 +208,6 @@ mkSymCoercion (TyVarTy tv) | isCoVar tv = mkCoercion symCoercionTyCon [TyVarTy tv] | otherwise = TyVarTy tv mkSymCoercion co = mkCoercion symCoercionTyCon [co] - -- this should not happen but does -- Smart constructors for left and right mkLeftCoercion co @@ -262,20 +284,13 @@ mkUnsafeCoercion ty1 ty2 = mkCoercion unsafeCoercionTyCon [ty1, ty2] --- Make the coercion associated with a newtype. If we have --- --- newtype T a b = MkT (Int, a, b) --- --- Then (mkNewTypeCoercion CoT T [a,b] (Int, a, b)) creates the coercion --- CoT, such kinding rule such that --- --- CoT S U :: (Int, S, U) :=: T S U +-- See note [Newtype coercions] in TyCon mkNewTypeCoercion :: Name -> TyCon -> [TyVar] -> Type -> TyCon mkNewTypeCoercion name tycon tvs rhs_ty = ASSERT (length tvs == tyConArity tycon) mkCoercionTyCon name (tyConArity tycon) rule where - rule args = mkCoKind (substTyWith tvs args rhs_ty) (TyConApp tycon args) + rule args = mkCoKind (TyConApp tycon args) (substTyWith tvs args rhs_ty) -------------------------------------- -- Coercion Type Constructors...