%
+% (c) The University of Glasgow 2006
% (c) The AQUA Project, Glasgow University, 1993-1998
%
-\section[TcRules]{Typechecking transformation rules}
+
+TcRules: Typechecking transformation rules
\begin{code}
module TcRules ( tcRules ) where
#include "HsVersions.h"
-import HsSyn ( RuleDecl(..), LRuleDecl, RuleBndr(..), mkHsDictLet )
+import HsSyn
import TcRnMonad
-import TcSimplify ( tcSimplifyRuleLhs, tcSimplifyInferCheck )
-import TcMType ( newFlexiTyVarTy, zonkQuantifiedTyVar, tcSkolSigTyVars )
-import TcType ( tyVarsOfTypes, openTypeKind, SkolemInfo(..), substTyWith, mkTyVarTys )
-import TcHsType ( UserTypeCtxt(..), tcHsPatSigType )
-import TcExpr ( tcMonoExpr )
-import TcEnv ( tcExtendIdEnv, tcExtendTyVarEnv )
-import Inst ( instToId )
-import Id ( idType, mkLocalId )
-import Name ( Name )
-import SrcLoc ( noLoc, unLoc )
+import TcSimplify
+import TcMType
+import TcType
+import TcHsType
+import TcExpr
+import TcEnv
+import Inst
+import Id
+import Name
+import SrcLoc
import Outputable
\end{code}
--
-- NB: tcSimplifyInferCheck zonks the forall_tvs, and
-- knocks out any that are constrained by the environment
- tcSimplifyInferCheck (text "tcRule")
+ getInstLoc (SigOrigin (RuleSkol name)) `thenM` \ loc ->
+ tcSimplifyInferCheck loc
forall_tvs
lhs_dicts rhs_lie `thenM` \ (forall_tvs1, rhs_binds) ->
- mappM zonkQuantifiedTyVar forall_tvs1 `thenM` \ forall_tvs2 ->
- -- This zonk is exactly the same as the one in TcBinds.tcBindWithSigs
returnM (HsRule name act
- (map (RuleBndr . noLoc) (forall_tvs2 ++ tpl_ids)) -- yuk
+ (map (RuleBndr . noLoc) (forall_tvs1 ++ tpl_ids)) -- yuk
(mkHsDictLet lhs_binds lhs') fv_lhs
(mkHsDictLet rhs_binds rhs') fv_rhs)
-- e.g x :: a->a
-- The tyvar 'a' is brought into scope first, just as if you'd written
-- a::*, x :: a->a
- = do { let ctxt = RuleSigCtxt (unLoc var)
+ = do { let ctxt = FunSigCtxt (unLoc var)
; (tyvars, ty) <- tcHsPatSigType ctxt rn_ty
; let skol_tvs = tcSkolSigTyVars (SigSkol ctxt) tyvars
id_ty = substTyWith tyvars (mkTyVarTys skol_tvs) ty