X-Git-Url: http://git.megacz.com/?p=ghc-hetmet.git;a=blobdiff_plain;f=compiler%2Ftypecheck%2FTcUnify.lhs;h=1295ab3dfe4c590a5d58012c31e5726df7ef6736;hp=f9936e7f8765f5f57b30597e0e554eeee5af824b;hb=3e83dfb21b2f2220dce97427fff5c19459ae68d1;hpb=d2b27dcd73c7d3aa21059e2a26ee7923fd7bca0a diff --git a/compiler/typecheck/TcUnify.lhs b/compiler/typecheck/TcUnify.lhs index f9936e7..1295ab3 100644 --- a/compiler/typecheck/TcUnify.lhs +++ b/compiler/typecheck/TcUnify.lhs @@ -48,25 +48,25 @@ import TcType ( TcKind, TcType, TcTyVar, BoxyTyVar, TcTauType, tcSplitForAllTys, tcSplitAppTy_maybe, tcSplitFunTys, mkTyVarTys, tcSplitSigmaTy, tyVarsOfType, mkPhiTy, mkTyVarTy, mkPredTy, typeKind, mkForAllTys, mkAppTy, isBoxyTyVar, - exactTyVarsOfType, + tcView, exactTyVarsOfType, tidyOpenType, tidyOpenTyVar, tidyOpenTyVars, - pprType, tidyKind, tidySkolemTyVar, isSkolemTyVar, tcView, + pprType, tidyKind, tidySkolemTyVar, isSkolemTyVar, isSigTyVar, TvSubst, mkTvSubst, zipTyEnv, zipOpenTvSubst, emptyTvSubst, substTy, substTheta, lookupTyVar, extendTvSubst ) -import Kind ( Kind(..), SimpleKind, KindVar, isArgTypeKind, +import Type ( Kind, SimpleKind, KindVar, openTypeKind, liftedTypeKind, unliftedTypeKind, mkArrowKind, defaultKind, - isOpenTypeKind, argTypeKind, isLiftedTypeKind, isUnliftedTypeKind, - isSubKind, pprKind, splitKindFunTys ) + argTypeKind, isLiftedTypeKind, isUnliftedTypeKind, + isSubKind, pprKind, splitKindFunTys, isSubKindCon, + isOpenTypeKind, isArgTypeKind ) import TysPrim ( alphaTy, betaTy ) -import Inst ( newDicts, instToId ) +import Inst ( newDicts, instToId, mkInstCoFn ) import TyCon ( TyCon, tyConArity, tyConTyVars, isSynTyCon ) import TysWiredIn ( listTyCon ) import Id ( Id, mkSysLocal ) import Var ( Var, varName, tyVarKind, isTcTyVar, tcTyVarDetails ) -import VarSet ( emptyVarSet, mkVarSet, unitVarSet, unionVarSet, elemVarSet, varSetElems, - extendVarSet, intersectsVarSet ) +import VarSet import VarEnv import Name ( Name, isSystemName ) import ErrUtils ( Message ) @@ -181,6 +181,7 @@ subFunTys error_herald n_pats res_ty thing_inside ; return (idCoercion, res) } } where mk_res_ty (res_ty' : arg_tys') = mkFunTys arg_tys' res_ty' + mk_res_ty [] = panic "TcUnify.mk_res_ty1" kinds = openTypeKind : take n (repeat argTypeKind) -- Note argTypeKind: the args can have an unboxed type, -- but not an unboxed tuple. @@ -269,6 +270,7 @@ boxySplitAppTy orig_ty ; return (fun_ty, arg_ty) } } where mk_res_ty [fun_ty', arg_ty'] = mkAppTy fun_ty' arg_ty' + mk_res_ty other = panic "TcUnify.mk_res_ty2" tv_kind = tyVarKind tv kinds = [mkArrowKind liftedTypeKind (defaultKind tv_kind), -- m :: * -> k @@ -338,7 +340,7 @@ withBox kind thing_inside \begin{code} preSubType :: [TcTyVar] -- Quantified type variables -> TcTyVarSet -- Subset of quantified type variables - -- that can be instantiated with boxy types + -- see Note [Pre-sub boxy] -> TcType -- The rho-type part; quantified tyvars scopes over this -> BoxySigmaType -- Matching type from the context -> TcM [TcType] -- Types to instantiate the tyvars @@ -347,16 +349,22 @@ preSubType :: [TcTyVar] -- Quantified type variables -- info from the pre-subsumption, if there is any -- a boxy type variable otherwise -- --- The 'btvs' are a subset of 'qtvs'. They are the ones we can --- instantiate to a boxy type variable, because they'll definitely be --- filled in later. This isn't always the case; sometimes we have type --- variables mentioned in the context of the type, but not the body; --- f :: forall a b. C a b => a -> a --- Then we may land up with an unconstrained 'b', so we want to --- instantiate it to a monotype (non-boxy) type variable +-- Note [Pre-sub boxy] +-- The 'btvs' are a subset of 'qtvs'. They are the ones we can +-- instantiate to a boxy type variable, because they'll definitely be +-- filled in later. This isn't always the case; sometimes we have type +-- variables mentioned in the context of the type, but not the body; +-- f :: forall a b. C a b => a -> a +-- Then we may land up with an unconstrained 'b', so we want to +-- instantiate it to a monotype (non-boxy) type variable +-- +-- The 'qtvs' that are *neither* fixed by the pre-subsumption, *nor* are in 'btvs', +-- are instantiated to TauTv meta variables. preSubType qtvs btvs qty expected_ty - = mapM inst_tv qtvs + = do { tys <- mapM inst_tv qtvs + ; traceTc (text "preSubType" <+> (ppr qtvs $$ ppr btvs $$ ppr qty $$ ppr expected_ty $$ ppr pre_subst $$ ppr tys)) + ; return tys } where pre_subst = boxySubMatchType (mkVarSet qtvs) qty expected_ty inst_tv tv @@ -375,26 +383,37 @@ boxySubMatchType -- "Boxy types: inference for higher rank types and impredicativity" boxySubMatchType tmpl_tvs tmpl_ty boxy_ty - = go tmpl_ty emptyVarSet boxy_ty + = go tmpl_tvs tmpl_ty emptyVarSet boxy_ty where - go t_ty b_tvs b_ty - | Just t_ty' <- tcView t_ty = go t_ty' b_tvs b_ty - | Just b_ty' <- tcView b_ty = go t_ty b_tvs b_ty' + go t_tvs t_ty b_tvs b_ty + | Just t_ty' <- tcView t_ty = go t_tvs t_ty' b_tvs b_ty + | Just b_ty' <- tcView b_ty = go t_tvs t_ty b_tvs b_ty' - go (TyVarTy _) b_tvs b_ty = emptyTvSubst -- Rule S-ANY; no bindings + go t_tvs (TyVarTy _) b_tvs b_ty = emptyTvSubst -- Rule S-ANY; no bindings -- Rule S-ANY covers (a) type variables and (b) boxy types -- in the template. Both look like a TyVarTy. -- See Note [Sub-match] below - go (ForAllTy tv t_ty) b_tvs b_ty = go t_ty b_tvs b_ty -- Rule S-SPEC - go t_ty b_tvs (ForAllTy tv b_ty) = go t_ty b_tvs' b_ty -- Rule S-SKOL - where b_tvs' = extendVarSet b_tvs tv + go t_tvs t_ty b_tvs b_ty + | isSigmaTy t_ty, (tvs, _, t_tau) <- tcSplitSigmaTy t_ty + = go (t_tvs `delVarSetList` tvs) t_tau b_tvs b_ty -- Rule S-SPEC + -- Under a forall on the left, if there is shadowing, + -- do not bind! Hence the delVarSetList. + | isSigmaTy b_ty, (tvs, _, b_tau) <- tcSplitSigmaTy b_ty + = go t_tvs t_ty (extendVarSetList b_tvs tvs) b_tau -- Rule S-SKOL + -- Add to the variables we must not bind to + -- NB: it's *important* to discard the theta part. Otherwise + -- consider (forall a. Eq a => a -> b) ~<~ (Int -> Int -> Bool) + -- and end up with a completely bogus binding (b |-> Bool), by lining + -- up the (Eq a) with the Int, whereas it should be (b |-> (Int->Bool)). + -- This pre-subsumption stuff can return too few bindings, but it + -- must *never* return bogus info. - go (FunTy arg1 res1) b_tvs (FunTy arg2 res2) -- Rule S-FUN - = boxy_match tmpl_tvs arg1 b_tvs arg2 (go res1 b_tvs res2) + go t_tvs (FunTy arg1 res1) b_tvs (FunTy arg2 res2) -- Rule S-FUN + = boxy_match t_tvs arg1 b_tvs arg2 (go t_tvs res1 b_tvs res2) -- Match the args, and sub-match the results - go t_ty b_tvs b_ty = boxy_match tmpl_tvs t_ty b_tvs b_ty emptyTvSubst + go t_tvs t_ty b_tvs b_ty = boxy_match t_tvs t_ty b_tvs b_ty emptyTvSubst -- Otherwise defer to boxy matching -- This covers TyConApp, AppTy, PredTy \end{code} @@ -434,9 +453,7 @@ boxyMatchTypes -- It does no unification, and cannot fail -- -- Precondition: the arg lengths are equal --- Precondition: none of the template type variables appear in the [BoxySigmaType] --- Precondition: any nested quantifiers in either type differ from --- the template type variables passed as arguments +-- Precondition: none of the template type variables appear anywhere in the [BoxySigmaType] -- ------------ @@ -448,8 +465,11 @@ boxyMatchTypes tmpl_tvs tmpl_tys boxy_tys boxy_match_s tmpl_tvs [] boxy_tvs [] subst = subst boxy_match_s tmpl_tvs (t_ty:t_tys) boxy_tvs (b_ty:b_tys) subst - = boxy_match_s tmpl_tvs t_tys boxy_tvs b_tys $ - boxy_match tmpl_tvs t_ty boxy_tvs b_ty subst + = boxy_match tmpl_tvs t_ty boxy_tvs b_ty $ + boxy_match_s tmpl_tvs t_tys boxy_tvs b_tys subst +boxy_match_s tmpl_tvs _ boxy_tvs _ subst + = panic "boxy_match_s" -- Lengths do not match + ------------ boxy_match :: TcTyVarSet -> TcType -- Template @@ -470,8 +490,13 @@ boxy_match tmpl_tvs orig_tmpl_ty boxy_tvs orig_boxy_ty subst | Just t_ty' <- tcView t_ty = go t_ty' b_ty | Just b_ty' <- tcView b_ty = go t_ty b_ty' - go (ForAllTy _ ty1) (ForAllTy tv2 ty2) - = boxy_match tmpl_tvs ty1 (boxy_tvs `extendVarSet` tv2) ty2 subst + go ty1 ty2 -- C.f. the isSigmaTy case for boxySubMatchType + | isSigmaTy ty1 + , (tvs1, _, tau1) <- tcSplitSigmaTy ty1 + , (tvs2, _, tau2) <- tcSplitSigmaTy ty2 + , equalLength tvs1 tvs2 + = boxy_match (tmpl_tvs `delVarSetList` tvs1) tau1 + (boxy_tvs `extendVarSetList` tvs2) tau2 subst go (TyConApp tc1 tys1) (TyConApp tc2 tys2) | tc1 == tc2 = go_s tys1 tys2 @@ -490,12 +515,20 @@ boxy_match tmpl_tvs orig_tmpl_ty boxy_tvs orig_boxy_ty subst , not (intersectsVarSet boxy_tvs (tyVarsOfType orig_boxy_ty)) , typeKind b_ty `isSubKind` tyVarKind tv -- See Note [Matching kinds] = extendTvSubst subst tv boxy_ty' + | otherwise + = subst -- Ignore others where boxy_ty' = case lookupTyVar subst tv of Nothing -> orig_boxy_ty Just ty -> ty `boxyLub` orig_boxy_ty - go _ _ = subst -- Always safe + go _ _ = emptyTvSubst -- It's important to *fail* by returning the empty substitution + -- Example: Tree a ~ Maybe Int + -- We do not want to bind (a |-> Int) in pre-matching, because that can give very + -- misleading error messages. An even more confusing case is + -- a -> b ~ Maybe Int + -- Then we do not want to bind (b |-> Int)! It's always safe to discard bindings + -- from this pre-matching phase. -------- go_s tys1 tys2 = boxy_match_s tmpl_tvs tys1 boxy_tvs tys2 subst @@ -565,33 +598,50 @@ tcSubExp :: BoxySigmaType -> BoxySigmaType -> TcM ExprCoFn -- Locally used only -- (tcSub act exp) checks that -- act <= exp tcSubExp actual_ty expected_ty - = addErrCtxtM (unifyCtxt actual_ty expected_ty) - (tc_sub True actual_ty actual_ty expected_ty expected_ty) + = -- addErrCtxtM (unifyCtxt actual_ty expected_ty) $ + -- Adding the error context here leads to some very confusing error + -- messages, such as "can't match foarall a. a->a with forall a. a->a" + -- So instead I'm adding it when moving from tc_sub to u_tys + traceTc (text "tcSubExp" <+> ppr actual_ty <+> ppr expected_ty) >> + tc_sub Nothing actual_ty actual_ty False expected_ty expected_ty tcFunResTy :: Name -> BoxySigmaType -> BoxySigmaType -> TcM ExprCoFn -- Locally used only tcFunResTy fun actual_ty expected_ty - = addErrCtxtM (checkFunResCtxt fun actual_ty expected_ty) $ - (tc_sub True actual_ty actual_ty expected_ty expected_ty) + = traceTc (text "tcFunResTy" <+> ppr actual_ty <+> ppr expected_ty) >> + tc_sub (Just fun) actual_ty actual_ty False expected_ty expected_ty ----------------- -tc_sub :: Outer -- See comments with uTys +tc_sub :: Maybe Name -- Just fun => we're looking at a function result type -> BoxySigmaType -- actual_ty, before expanding synonyms -> BoxySigmaType -- ..and after + -> InBox -- True <=> expected_ty is inside a box -> BoxySigmaType -- expected_ty, before -> BoxySigmaType -- ..and after -> TcM ExprCoFn + -- The acual_ty is never inside a box +-- IMPORTANT pre-condition: if the args contain foralls, the bound type +-- variables are visible non-monadically +-- (i.e. tha args are sufficiently zonked) +-- This invariant is needed so that we can "see" the foralls, ad +-- e.g. in the SPEC rule where we just use splitSigmaTy + +tc_sub mb_fun act_sty act_ty exp_ib exp_sty exp_ty + = tc_sub1 mb_fun act_sty act_ty exp_ib exp_sty exp_ty + -- This indirection is just here to make + -- it easy to insert a debug trace! -tc_sub outer act_sty act_ty exp_sty exp_ty - | Just exp_ty' <- tcView exp_ty = tc_sub False act_sty act_ty exp_sty exp_ty' -tc_sub outer act_sty act_ty exp_sty exp_ty - | Just act_ty' <- tcView act_ty = tc_sub False act_sty act_ty' exp_sty exp_ty +tc_sub1 mb_fun act_sty act_ty exp_ib exp_sty exp_ty + | Just exp_ty' <- tcView exp_ty = tc_sub mb_fun act_sty act_ty exp_ib exp_sty exp_ty' +tc_sub1 mb_fun act_sty act_ty exp_ib exp_sty exp_ty + | Just act_ty' <- tcView act_ty = tc_sub mb_fun act_sty act_ty' exp_ib exp_sty exp_ty ----------------------------------- -- Rule SBOXY, plus other cases when act_ty is a type variable -- Just defer to boxy matching -- This rule takes precedence over SKOL! -tc_sub outer act_sty (TyVarTy tv) exp_sty exp_ty - = do { uVar outer False tv False exp_sty exp_ty +tc_sub1 mb_fun act_sty (TyVarTy tv) exp_ib exp_sty exp_ty + = do { addErrCtxtM (subCtxt mb_fun act_sty exp_sty) $ + uVar True False tv exp_ib exp_sty exp_ty ; return idCoercion } ----------------------------------- @@ -605,10 +655,11 @@ tc_sub outer act_sty (TyVarTy tv) exp_sty exp_ty -- g :: Ord b => b->b -- Consider f g ! -tc_sub outer act_sty act_ty exp_sty exp_ty - | isSigmaTy exp_ty +tc_sub1 mb_fun act_sty act_ty exp_ib exp_sty exp_ty + | not exp_ib, -- SKOL does not apply if exp_ty is inside a box + isSigmaTy exp_ty = do { (gen_fn, co_fn) <- tcGen exp_ty act_tvs $ \ body_exp_ty -> - tc_sub False act_sty act_ty body_exp_ty body_exp_ty + tc_sub mb_fun act_sty act_ty False body_exp_ty body_exp_ty ; return (gen_fn <.> co_fn) } where act_tvs = tyVarsOfType act_ty @@ -621,7 +672,7 @@ tc_sub outer act_sty act_ty exp_sty exp_ty -- expected_ty: Int -> Int -- co_fn e = e Int dOrdInt -tc_sub outer act_sty actual_ty exp_sty expected_ty +tc_sub1 mb_fun act_sty actual_ty exp_ib exp_sty expected_ty -- Implements the new SPEC rule in the Appendix of the paper -- "Boxy types: inference for higher rank types and impredicativity" -- (This appendix isn't in the published version.) @@ -635,48 +686,55 @@ tc_sub outer act_sty actual_ty exp_sty expected_ty -- boxy tyvars if pre-subsumption gives no info let (tyvars, theta, tau) = tcSplitSigmaTy actual_ty tau_tvs = exactTyVarsOfType tau - ; inst_tys <- preSubType tyvars tau_tvs tau expected_ty + ; inst_tys <- if exp_ib then -- Inside a box, do not do clever stuff + do { tyvars' <- mapM tcInstBoxyTyVar tyvars + ; return (mkTyVarTys tyvars') } + else -- Outside, do clever stuff + preSubType tyvars tau_tvs tau expected_ty ; let subst' = zipOpenTvSubst tyvars inst_tys tau' = substTy subst' tau -- Perform a full subsumption check - ; co_fn <- tc_sub False tau' tau' exp_sty expected_ty + ; traceTc (text "tc_sub_spec" <+> vcat [ppr actual_ty, + ppr tyvars <+> ppr theta <+> ppr tau, + ppr tau']) + ; co_fn <- tc_sub mb_fun tau' tau' exp_ib exp_sty expected_ty -- Deal with the dictionaries ; dicts <- newDicts InstSigOrigin (substTheta subst' theta) ; extendLIEs dicts - ; let inst_fn = CoApps (CoTyApps CoHole inst_tys) - (map instToId dicts) + ; let inst_fn = mkInstCoFn inst_tys dicts ; return (co_fn <.> inst_fn) } ----------------------------------- -- Function case (rule F1) -tc_sub _ _ (FunTy act_arg act_res) _ (FunTy exp_arg exp_res) - = tc_sub_funs act_arg act_res exp_arg exp_res +tc_sub1 mb_fun _ (FunTy act_arg act_res) exp_ib _ (FunTy exp_arg exp_res) + = tc_sub_funs mb_fun act_arg act_res exp_ib exp_arg exp_res -- Function case (rule F2) -tc_sub outer act_sty act_ty@(FunTy act_arg act_res) exp_sty (TyVarTy exp_tv) +tc_sub1 mb_fun act_sty act_ty@(FunTy act_arg act_res) _ exp_sty (TyVarTy exp_tv) | isBoxyTyVar exp_tv = do { cts <- readMetaTyVar exp_tv ; case cts of - Indirect ty -> do { u_tys outer False act_sty act_ty True exp_sty ty - ; return idCoercion } + Indirect ty -> tc_sub mb_fun act_sty act_ty True exp_sty ty Flexi -> do { [arg_ty,res_ty] <- withMetaTvs exp_tv fun_kinds mk_res_ty - ; tc_sub_funs act_arg act_res arg_ty res_ty } } + ; tc_sub_funs mb_fun act_arg act_res True arg_ty res_ty } } where mk_res_ty [arg_ty', res_ty'] = mkFunTy arg_ty' res_ty' + mk_res_ty other = panic "TcUnify.mk_res_ty3" fun_kinds = [argTypeKind, openTypeKind] -- Everything else: defer to boxy matching -tc_sub outer act_sty actual_ty exp_sty expected_ty - = do { u_tys outer False act_sty actual_ty False exp_sty expected_ty +tc_sub1 mb_fun act_sty actual_ty exp_ib exp_sty expected_ty + = do { addErrCtxtM (subCtxt mb_fun act_sty exp_sty) $ + u_tys True False act_sty actual_ty exp_ib exp_sty expected_ty ; return idCoercion } ----------------------------------- -tc_sub_funs act_arg act_res exp_arg exp_res - = do { uTys False act_arg False exp_arg - ; co_fn_res <- tc_sub False act_res act_res exp_res exp_res +tc_sub_funs mb_fun act_arg act_res exp_ib exp_arg exp_res + = do { uTys False act_arg exp_ib exp_arg + ; co_fn_res <- tc_sub mb_fun act_res act_res exp_ib exp_res exp_res ; wrapFunResCoercion [exp_arg] co_fn_res } ----------------------------------- @@ -690,7 +748,7 @@ wrapFunResCoercion arg_tys co_fn_res | otherwise = do { us <- newUniqueSupply ; let arg_ids = zipWith (mkSysLocal FSLIT("sub")) (uniqsFromSupply us) arg_tys - ; return (CoLams arg_ids (co_fn_res <.> (CoApps CoHole arg_ids))) } + ; return (CoLams arg_ids <.> co_fn_res <.> CoApps arg_ids) } \end{code} @@ -751,11 +809,9 @@ tcGen expected_ty extra_tvs thing_inside -- We expect expected_ty to be a forall ; traceTc (text "tcGen:done") ; let - -- This HsLet binds any Insts which came out of the simplification. - -- It's a bit out of place here, but using AbsBind involves inventing - -- a couple of new names which seems worse. - dict_ids = map instToId dicts - co_fn = CoTyLams forall_tvs $ CoLams dict_ids $ CoLet inst_binds CoHole + -- The CoLet binds any Insts which came out of the simplification. + dict_ids = map instToId dicts + co_fn = CoTyLams forall_tvs <.> CoLams dict_ids <.> CoLet inst_binds ; returnM (co_fn, result) } where free_tvs = tyVarsOfType expected_ty `unionVarSet` extra_tvs @@ -847,8 +903,12 @@ de-synonym'd version. This way we get better error messages. We call the first one \tr{ps_ty1}, \tr{ps_ty2} for ``possible synomym''. \begin{code} -type NoBoxes = Bool -- True <=> definitely no boxes in this type - -- False <=> there might be boxes (always safe) +type InBox = Bool -- True <=> we are inside a box + -- False <=> we are outside a box + -- The importance of this is that if we get "filled-box meets + -- filled-box", we'll look into the boxes and unify... but + -- we must not allow polytypes. But if we are in a box on + -- just one side, then we can allow polytypes type Outer = Bool -- True <=> this is the outer level of a unification -- so that the types being unified are the @@ -858,16 +918,18 @@ type Outer = Bool -- True <=> this is the outer level of a unification -- pop the context to remove the "Expected/Acutal" context uTysOuter, uTys - :: NoBoxes -> TcType -- ty1 is the *expected* type - -> NoBoxes -> TcType -- ty2 is the *actual* type + :: InBox -> TcType -- ty1 is the *expected* type + -> InBox -> TcType -- ty2 is the *actual* type -> TcM () -uTysOuter nb1 ty1 nb2 ty2 = u_tys True nb1 ty1 ty1 nb2 ty2 ty2 -uTys nb1 ty1 nb2 ty2 = u_tys False nb1 ty1 ty1 nb2 ty2 ty2 +uTysOuter nb1 ty1 nb2 ty2 = do { traceTc (text "uTysOuter" <+> ppr ty1 <+> ppr ty2) + ; u_tys True nb1 ty1 ty1 nb2 ty2 ty2 } +uTys nb1 ty1 nb2 ty2 = do { traceTc (text "uTys" <+> ppr ty1 <+> ppr ty2) + ; u_tys False nb1 ty1 ty1 nb2 ty2 ty2 } -------------- -uTys_s :: NoBoxes -> [TcType] -- ty1 is the *actual* types - -> NoBoxes -> [TcType] -- ty2 is the *expected* types +uTys_s :: InBox -> [TcType] -- ty1 is the *actual* types + -> InBox -> [TcType] -- ty2 is the *expected* types -> TcM () uTys_s nb1 [] nb2 [] = returnM () uTys_s nb1 (ty1:tys1) nb2 (ty2:tys2) = do { uTys nb1 ty1 nb2 ty2 @@ -876,8 +938,8 @@ uTys_s nb1 ty1s nb2 ty2s = panic "Unify.uTys_s: mismatched type lists!" -------------- u_tys :: Outer - -> NoBoxes -> TcType -> TcType -- ty1 is the *actual* type - -> NoBoxes -> TcType -> TcType -- ty2 is the *expected* type + -> InBox -> TcType -> TcType -- ty1 is the *actual* type + -> InBox -> TcType -> TcType -- ty2 is the *expected* type -> TcM () u_tys outer nb1 orig_ty1 ty1 nb2 orig_ty2 ty2 @@ -930,9 +992,12 @@ u_tys outer nb1 orig_ty1 ty1 nb2 orig_ty2 ty2 subst2 = mkTvSubst in_scope (zipTyEnv tvs2 tys) ; uTys nb1 (substTy subst1 body1) nb2 (substTy subst2 body2) - -- If both sides are inside a box, we should not have - -- a polytype at all. This check comes last, because - -- the error message is extremely unhelpful. + -- If both sides are inside a box, we are in a "box-meets-box" + -- situation, and we should not have a polytype at all. + -- If we get here we have two boxes, already filled with + -- the same polytype... but it should be a monotype. + -- This check comes last, because the error message is + -- extremely unhelpful. ; ifM (nb1 && nb2) (notMonoType ty1) } where @@ -1029,7 +1094,7 @@ uVar :: Outer -> Bool -- False => tyvar is the "expected" -- True => ty is the "expected" thing -> TcTyVar - -> NoBoxes -- True <=> definitely no boxes in t2 + -> InBox -- True <=> definitely no boxes in t2 -> TcTauType -> TcTauType -- printing and real versions -> TcM () @@ -1038,32 +1103,31 @@ uVar outer swapped tv1 nb2 ps_ty2 ty2 | otherwise = brackets (equals <+> ppr ty2) ; traceTc (text "uVar" <+> ppr swapped <+> sep [ppr tv1 <+> dcolon <+> ppr (tyVarKind tv1 ), - nest 2 (ptext SLIT(" :=: ")), + nest 2 (ptext SLIT(" <-> ")), ppr ps_ty2 <+> dcolon <+> ppr (typeKind ty2) <+> expansion]) ; details <- lookupTcTyVar tv1 ; case details of IndirectTv ty1 | swapped -> u_tys outer nb2 ps_ty2 ty2 True ty1 ty1 -- Swap back | otherwise -> u_tys outer True ty1 ty1 nb2 ps_ty2 ty2 -- Same order - -- The 'True' here says that ty1 - -- is definitely box-free - DoneTv details1 -> uUnfilledVar outer swapped tv1 details1 nb2 ps_ty2 ty2 + -- The 'True' here says that ty1 is now inside a box + DoneTv details1 -> uUnfilledVar outer swapped tv1 details1 ps_ty2 ty2 } ---------------- uUnfilledVar :: Outer -> Bool -- Args are swapped - -> TcTyVar -> TcTyVarDetails -- Tyvar 1 - -> NoBoxes -> TcTauType -> TcTauType -- Type 2 + -> TcTyVar -> TcTyVarDetails -- Tyvar 1 + -> TcTauType -> TcTauType -- Type 2 -> TcM () -- Invariant: tyvar 1 is not unified with anything -uUnfilledVar outer swapped tv1 details1 nb2 ps_ty2 ty2 +uUnfilledVar outer swapped tv1 details1 ps_ty2 ty2 | Just ty2' <- tcView ty2 = -- Expand synonyms; ignore FTVs - uUnfilledVar False swapped tv1 details1 nb2 ps_ty2 ty2' + uUnfilledVar False swapped tv1 details1 ps_ty2 ty2' -uUnfilledVar outer swapped tv1 details1 nb2 ps_ty2 (TyVarTy tv2) +uUnfilledVar outer swapped tv1 details1 ps_ty2 (TyVarTy tv2) | tv1 == tv2 -- Same type variable => no-op (but watch out for the boxy case) = case details1 of MetaTv BoxTv ref1 -- A boxy type variable meets itself; @@ -1076,14 +1140,14 @@ uUnfilledVar outer swapped tv1 details1 nb2 ps_ty2 (TyVarTy tv2) | otherwise = do { lookup2 <- lookupTcTyVar tv2 ; case lookup2 of - IndirectTv ty2' -> uUnfilledVar outer swapped tv1 details1 True ty2' ty2' + IndirectTv ty2' -> uUnfilledVar outer swapped tv1 details1 ty2' ty2' DoneTv details2 -> uUnfilledVars outer swapped tv1 details1 tv2 details2 } -uUnfilledVar outer swapped tv1 details1 nb2 ps_ty2 non_var_ty2 -- ty2 is not a type variable +uUnfilledVar outer swapped tv1 details1 ps_ty2 non_var_ty2 -- ty2 is not a type variable = case details1 of MetaTv (SigTv _) ref1 -> mis_match -- Can't update a skolem with a non-type-variable - MetaTv info ref1 -> uMetaVar swapped tv1 info ref1 nb2 ps_ty2 non_var_ty2 + MetaTv info ref1 -> uMetaVar swapped tv1 info ref1 ps_ty2 non_var_ty2 skolem_details -> mis_match where mis_match = unifyMisMatch outer swapped (TyVarTy tv1) ps_ty2 @@ -1091,12 +1155,12 @@ uUnfilledVar outer swapped tv1 details1 nb2 ps_ty2 non_var_ty2 -- ty2 is not a t ---------------- uMetaVar :: Bool -> TcTyVar -> BoxInfo -> IORef MetaDetails - -> NoBoxes -> TcType -> TcType + -> TcType -> TcType -> TcM () -- tv1 is an un-filled-in meta type variable (maybe boxy, maybe tau) -- ty2 is not a type variable -uMetaVar swapped tv1 BoxTv ref1 nb2 ps_ty2 non_var_ty2 +uMetaVar swapped tv1 BoxTv ref1 ps_ty2 non_var_ty2 = -- tv1 is a BoxTv. So we must unbox ty2, to ensure -- that any boxes in ty2 are filled with monotypes -- @@ -1114,7 +1178,7 @@ uMetaVar swapped tv1 BoxTv ref1 nb2 ps_ty2 non_var_ty2 #endif ; checkUpdateMeta swapped tv1 ref1 final_ty } -uMetaVar swapped tv1 info1 ref1 nb2 ps_ty2 non_var_ty2 +uMetaVar swapped tv1 info1 ref1 ps_ty2 non_var_ty2 = do { final_ty <- checkTauTvUpdate tv1 ps_ty2 -- Occurs check + monotype check ; checkUpdateMeta swapped tv1 ref1 final_ty } @@ -1415,7 +1479,7 @@ mkExpectedActualMsg act_ty exp_ty ---------------- -- If an error happens we try to figure out whether the function -- function has been given too many or too few arguments, and say so. -checkFunResCtxt fun actual_res_ty expected_res_ty tidy_env +subCtxt mb_fun actual_res_ty expected_res_ty tidy_env = do { exp_ty' <- zonkTcType expected_res_ty ; act_ty' <- zonkTcType actual_res_ty ; let @@ -1427,9 +1491,10 @@ checkFunResCtxt fun actual_res_ty expected_res_ty tidy_env len_act_args = length act_args len_exp_args = length exp_args - message | len_exp_args < len_act_args = wrongArgsCtxt "too few" fun - | len_exp_args > len_act_args = wrongArgsCtxt "too many" fun - | otherwise = mkExpectedActualMsg act_ty'' exp_ty'' + message = case mb_fun of + Just fun | len_exp_args < len_act_args -> wrongArgsCtxt "too few" fun + | len_exp_args > len_act_args -> wrongArgsCtxt "too many" fun + other -> mkExpectedActualMsg act_ty'' exp_ty'' ; return (env2, message) } where @@ -1477,8 +1542,8 @@ ppr_ty env ty simple_result = (env1, quotes (ppr tidy_ty), empty) ; case tidy_ty of TyVarTy tv - | isSkolemTyVar tv -> return (env2, pp_rigid tv', - pprSkolTvBinding tv') + | isSkolemTyVar tv || isSigTyVar tv + -> return (env2, pp_rigid tv', pprSkolTvBinding tv') | otherwise -> return simple_result where (env2, tv') = tidySkolemTyVar env1 tv @@ -1491,7 +1556,7 @@ notMonoType ty = do { ty' <- zonkTcType ty ; env0 <- tcInitTidyEnv ; let (env1, tidy_ty) = tidyOpenType env0 ty' - msg = ptext SLIT("Cannot match a monotype with") <+> ppr tidy_ty + msg = ptext SLIT("Cannot match a monotype with") <+> quotes (ppr tidy_ty) ; failWithTcM (env1, msg) } occurCheck tyvar ty @@ -1518,20 +1583,15 @@ Unifying kinds is much, much simpler than unifying types. unifyKind :: TcKind -- Expected -> TcKind -- Actual -> TcM () -unifyKind LiftedTypeKind LiftedTypeKind = returnM () -unifyKind UnliftedTypeKind UnliftedTypeKind = returnM () - -unifyKind OpenTypeKind k2 | isOpenTypeKind k2 = returnM () -unifyKind ArgTypeKind k2 | isArgTypeKind k2 = returnM () - -- Respect sub-kinding +unifyKind (TyConApp kc1 []) (TyConApp kc2 []) + | isSubKindCon kc2 kc1 = returnM () -unifyKind (FunKind a1 r1) (FunKind a2 r2) - = do { unifyKind a2 a1; unifyKind r1 r2 } +unifyKind (FunTy a1 r1) (FunTy a2 r2) + = do { unifyKind a2 a1; unifyKind r1 r2 } -- Notice the flip in the argument, -- so that the sub-kinding works right - -unifyKind (KindVar kv1) k2 = uKVar False kv1 k2 -unifyKind k1 (KindVar kv2) = uKVar True kv2 k1 +unifyKind (TyVarTy kv1) k2 = uKVar False kv1 k2 +unifyKind k1 (TyVarTy kv2) = uKVar True kv2 k1 unifyKind k1 k2 = unifyKindMisMatch k1 k2 unifyKinds :: [TcKind] -> [TcKind] -> TcM () @@ -1545,19 +1605,19 @@ uKVar :: Bool -> KindVar -> TcKind -> TcM () uKVar swapped kv1 k2 = do { mb_k1 <- readKindVar kv1 ; case mb_k1 of - Nothing -> uUnboundKVar swapped kv1 k2 - Just k1 | swapped -> unifyKind k2 k1 - | otherwise -> unifyKind k1 k2 } + Flexi -> uUnboundKVar swapped kv1 k2 + Indirect k1 | swapped -> unifyKind k2 k1 + | otherwise -> unifyKind k1 k2 } ---------------- uUnboundKVar :: Bool -> KindVar -> TcKind -> TcM () -uUnboundKVar swapped kv1 k2@(KindVar kv2) +uUnboundKVar swapped kv1 k2@(TyVarTy kv2) | kv1 == kv2 = returnM () | otherwise -- Distinct kind variables = do { mb_k2 <- readKindVar kv2 ; case mb_k2 of - Just k2 -> uUnboundKVar swapped kv1 k2 - Nothing -> writeKindVar kv1 k2 } + Indirect k2 -> uUnboundKVar swapped kv1 k2 + Flexi -> writeKindVar kv1 k2 } uUnboundKVar swapped kv1 non_var_k2 = do { k2' <- zonkTcKind non_var_k2 @@ -1574,9 +1634,9 @@ uUnboundKVar swapped kv1 non_var_k2 kindOccurCheck kv1 k2 -- k2 is zonked = checkTc (not_in k2) (kindOccurCheckErr kv1 k2) where - not_in (KindVar kv2) = kv1 /= kv2 - not_in (FunKind a2 r2) = not_in a2 && not_in r2 - not_in other = True + not_in (TyVarTy kv2) = kv1 /= kv2 + not_in (FunTy a2 r2) = not_in a2 && not_in r2 + not_in other = True kindSimpleKind :: Bool -> Kind -> TcM SimpleKind -- (kindSimpleKind True k) returns a simple kind sk such that sk <: k @@ -1586,14 +1646,16 @@ kindSimpleKind :: Bool -> Kind -> TcM SimpleKind kindSimpleKind orig_swapped orig_kind = go orig_swapped orig_kind where - go sw (FunKind k1 k2) = do { k1' <- go (not sw) k1 - ; k2' <- go sw k2 - ; return (FunKind k1' k2') } - go True OpenTypeKind = return liftedTypeKind - go True ArgTypeKind = return liftedTypeKind - go sw LiftedTypeKind = return liftedTypeKind - go sw UnliftedTypeKind = return unliftedTypeKind - go sw k@(KindVar _) = return k -- KindVars are always simple + go sw (FunTy k1 k2) = do { k1' <- go (not sw) k1 + ; k2' <- go sw k2 + ; return (mkArrowKind k1' k2') } + go True k + | isOpenTypeKind k = return liftedTypeKind + | isArgTypeKind k = return liftedTypeKind + go sw k + | isLiftedTypeKind k = return liftedTypeKind + | isUnliftedTypeKind k = return unliftedTypeKind + go sw k@(TyVarTy _) = return k -- KindVars are always simple go swapped kind = failWithTc (ptext SLIT("Unexpected kind unification failure:") <+> ppr orig_swapped <+> ppr orig_kind) -- I think this can't actually happen @@ -1622,17 +1684,18 @@ unifyKindMisMatch ty1 ty2 unifyFunKind :: TcKind -> TcM (Maybe (TcKind, TcKind)) -- Like unifyFunTy, but does not fail; instead just returns Nothing -unifyFunKind (KindVar kvar) - = readKindVar kvar `thenM` \ maybe_kind -> +unifyFunKind (TyVarTy kvar) + = readKindVar kvar `thenM` \ maybe_kind -> case maybe_kind of - Just fun_kind -> unifyFunKind fun_kind - Nothing -> do { arg_kind <- newKindVar - ; res_kind <- newKindVar - ; writeKindVar kvar (mkArrowKind arg_kind res_kind) - ; returnM (Just (arg_kind,res_kind)) } + Indirect fun_kind -> unifyFunKind fun_kind + Flexi -> + do { arg_kind <- newKindVar + ; res_kind <- newKindVar + ; writeKindVar kvar (mkArrowKind arg_kind res_kind) + ; returnM (Just (arg_kind,res_kind)) } -unifyFunKind (FunKind arg_kind res_kind) = returnM (Just (arg_kind,res_kind)) -unifyFunKind other = returnM Nothing +unifyFunKind (FunTy arg_kind res_kind) = returnM (Just (arg_kind,res_kind)) +unifyFunKind other = returnM Nothing \end{code} %************************************************************************