2 % (c) The AQUA Project, Glasgow University, 1993-1998
4 \section[TcRules]{Typechecking transformation rules}
7 module TcRules ( tcRules ) where
9 #include "HsVersions.h"
11 import HsSyn ( HsDecl(..), RuleDecl(..), RuleBndr(..) )
12 import CoreSyn ( CoreRule(..) )
13 import RnHsSyn ( RenamedHsDecl )
14 import TcHsSyn ( TypecheckedRuleDecl, mkHsLet )
16 import TcSimplify ( tcSimplifyToDicts, tcSimplifyAndCheck )
17 import TcType ( zonkTcTypes, zonkTcTyVarToTyVar, newTyVarTy )
18 import TcIfaceSig ( tcCoreExpr, tcCoreLamBndrs, tcVar )
19 import TcMonoType ( kcHsSigType, tcHsSigType, tcTyVars, checkSigTyVars )
20 import TcExpr ( tcExpr )
21 import TcEnv ( tcExtendLocalValEnv, tcExtendTyVarEnv )
22 import Inst ( LIE, emptyLIE, plusLIEs, instToId )
23 import Id ( idType, idName, mkVanillaId )
25 import Type ( tyVarsOfTypes, openTypeKind )
26 import Bag ( bagToList )
31 tcRules :: [RenamedHsDecl] -> TcM (LIE, [TypecheckedRuleDecl])
32 tcRules decls = mapAndUnzipTc tcRule [rule | RuleD rule <- decls] `thenTc` \ (lies, rules) ->
33 returnTc (plusLIEs lies, rules)
35 tcRule (IfaceRule name vars fun args rhs src_loc)
36 = tcAddSrcLoc src_loc $
37 tcAddErrCtxt (ruleCtxt name) $
38 tcVar fun `thenTc` \ fun' ->
39 tcCoreLamBndrs vars $ \ vars' ->
40 mapTc tcCoreExpr args `thenTc` \ args' ->
41 tcCoreExpr rhs `thenTc` \ rhs' ->
42 returnTc (emptyLIE, IfaceRuleOut fun' (Rule name vars' args' rhs'))
44 tcRule (IfaceRuleOut fun rule)
45 = tcVar fun `thenTc` \ fun' ->
46 returnTc (emptyLIE, IfaceRuleOut fun' rule)
48 tcRule (HsRule name sig_tvs vars lhs rhs src_loc)
49 = tcAddSrcLoc src_loc $
50 tcAddErrCtxt (ruleCtxt name) $
51 newTyVarTy openTypeKind `thenNF_Tc` \ rule_ty ->
53 -- Deal with the tyvars mentioned in signatures
54 tcTyVars sig_tvs (mapTc_ kcHsSigType sig_tys) `thenTc` \ sig_tyvars ->
55 tcExtendTyVarEnv sig_tyvars (
57 -- Ditto forall'd variables
58 mapNF_Tc new_id vars `thenNF_Tc` \ ids ->
59 tcExtendLocalValEnv [(idName id, id) | id <- ids] $
62 tcExpr lhs rule_ty `thenTc` \ (lhs', lhs_lie) ->
63 tcExpr rhs rule_ty `thenTc` \ (rhs', rhs_lie) ->
65 returnTc (sig_tyvars, ids, lhs', rhs', lhs_lie, rhs_lie)
66 ) `thenTc` \ (sig_tyvars, ids, lhs', rhs', lhs_lie, rhs_lie) ->
68 -- Check that LHS has no overloading at all
69 tcSimplifyToDicts lhs_lie `thenTc` \ (lhs_dicts, lhs_binds) ->
70 checkSigTyVars sig_tyvars emptyVarSet `thenTc_`
72 -- Gather the template variables and tyvars
74 tpl_ids = map instToId (bagToList lhs_dicts) ++ ids
76 -- IMPORTANT! We *quantify* over any dicts that appear in the LHS
78 -- a) The particular dictionary isn't important, because its value
79 -- depends only on the type
80 -- e.g gcd Int $fIntegralInt
81 -- Here we'd like to match against (gcd Int any_d) for any 'any_d'
83 -- b) We'd like to make available the dictionaries bound
84 -- on the LHS in the RHS, so quantifying over them is good
85 -- See the 'lhs_dicts' in tcSimplifyAndCheck for the RHS
88 -- Gather type variables to quantify over
89 -- and turn them into real TyVars (just as in TcBinds.tcBindWithSigs)
90 zonkTcTypes (rule_ty : map idType tpl_ids) `thenNF_Tc` \ zonked_tys ->
91 mapTc zonkTcTyVarToTyVar (varSetElems (tyVarsOfTypes zonked_tys)) `thenTc` \ tvs ->
93 -- RHS can be a bit more lenient. In particular,
94 -- we let constant dictionaries etc float outwards
95 tcSimplifyAndCheck (text "tcRule") (mkVarSet tvs)
96 lhs_dicts rhs_lie `thenTc` \ (lie', rhs_binds) ->
98 returnTc (lie', HsRule name tvs
99 (map RuleBndr tpl_ids) -- yuk
100 (mkHsLet lhs_binds lhs')
101 (mkHsLet rhs_binds rhs')
104 sig_tys = [t | RuleBndrSig _ t <- vars]
106 new_id (RuleBndr var) = newTyVarTy openTypeKind `thenNF_Tc` \ ty ->
107 returnNF_Tc (mkVanillaId var ty)
108 new_id (RuleBndrSig var rn_ty) = tcHsSigType rn_ty `thenTc` \ ty ->
109 returnNF_Tc (mkVanillaId var ty)
111 ruleCtxt name = ptext SLIT("When checking the transformation rule") <+>
112 doubleQuotes (ptext name)