2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[TcExpr]{Typecheck an expression}
7 module TcExpr ( tcExpr, tcMonoExpr, tcId ) where
9 #include "HsVersions.h"
11 import HsSyn ( HsExpr(..), HsLit(..), ArithSeqInfo(..),
12 HsMatchContext(..), HsDoContext(..),
15 import RnHsSyn ( RenamedHsExpr, RenamedRecordBinds )
16 import TcHsSyn ( TcExpr, TcRecordBinds, simpleHsLitTy, mkHsDictApp, mkHsTyApp )
19 import TcUnify ( tcSubExp, tcGen, (<$>),
20 unifyTauTy, unifyFunTy, unifyListTy, unifyPArrTy,
22 import BasicTypes ( RecFlag(..), isMarkedStrict )
23 import Inst ( InstOrigin(..),
24 LIE, mkLIE, emptyLIE, unitLIE, plusLIE, plusLIEs,
25 newOverloadedLit, newMethod, newIPDict,
26 newDicts, newMethodWithGivenTy,
27 instToId, tcInstCall, tcInstDataCon
29 import TcBinds ( tcBindsAndThen )
30 import TcEnv ( tcLookupClass, tcLookupGlobalId, tcLookupGlobal_maybe,
31 tcLookupTyCon, tcLookupDataCon, tcLookupId
33 import TcMatches ( tcMatchesCase, tcMatchLambda, tcStmts )
34 import TcMonoType ( tcHsSigType, UserTypeCtxt(..) )
35 import TcPat ( badFieldCon )
36 import TcSimplify ( tcSimplifyIPs )
37 import TcMType ( tcInstTyVars, tcInstType, newHoleTyVarTy, zapToType,
38 newTyVarTy, newTyVarTys, zonkTcType, readHoleResult )
39 import TcType ( TcType, TcSigmaType, TcRhoType, TyVarDetails(VanillaTv),
40 tcSplitFunTys, tcSplitTyConApp, mkTyVarTys,
41 isSigmaTy, mkFunTy, mkAppTy, mkTyConTy, mkFunTys,
42 mkTyConApp, mkClassPred, tcFunArgTy,
43 tyVarsOfTypes, isLinearPred,
44 liftedTypeKind, openTypeKind, mkArrowKind,
45 tcSplitSigmaTy, tcTyConAppTyCon,
48 import FieldLabel ( FieldLabel, fieldLabelName, fieldLabelType, fieldLabelTyCon )
49 import Id ( idType, recordSelectorFieldLabel, isRecordSelector, isDataConWrapId_maybe )
50 import DataCon ( dataConFieldLabels, dataConSig,
54 import TyCon ( TyCon, tyConTyVars, tyConTheta, isAlgTyCon, tyConDataCons )
55 import Subst ( mkTopTyVarSubst, substTheta, substTy )
56 import VarSet ( emptyVarSet, elemVarSet )
57 import TysWiredIn ( boolTy, mkListTy, mkPArrTy, listTyCon, parrTyCon )
58 import PrelNames ( cCallableClassName,
60 enumFromName, enumFromThenName,
61 enumFromToName, enumFromThenToName,
62 enumFromToPName, enumFromThenToPName,
63 thenMName, failMName, returnMName, ioTyConName
66 import ListSetOps ( minusList )
69 import HscTypes ( TyThing(..) )
73 %************************************************************************
75 \subsection{Main wrappers}
77 %************************************************************************
80 tcExpr :: RenamedHsExpr -- Expession to type check
81 -> TcSigmaType -- Expected type (could be a polytpye)
82 -> TcM (TcExpr, LIE) -- Generalised expr with expected type, and LIE
84 tcExpr expr expected_ty
85 = traceTc (text "tcExpr" <+> (ppr expected_ty $$ ppr expr)) `thenNF_Tc_`
86 tc_expr' expr expected_ty
88 tc_expr' expr expected_ty
89 | not (isSigmaTy expected_ty) -- Monomorphic case
90 = tcMonoExpr expr expected_ty
93 = tcGen expected_ty emptyVarSet (
95 ) `thenTc` \ (gen_fn, expr', lie) ->
96 returnTc (gen_fn <$> expr', lie)
100 %************************************************************************
102 \subsection{The TAUT rules for variables}
104 %************************************************************************
107 tcMonoExpr :: RenamedHsExpr -- Expession to type check
108 -> TcRhoType -- Expected type (could be a type variable)
109 -- Definitely no foralls at the top
113 tcMonoExpr (HsVar name) res_ty
114 = tcId name `thenNF_Tc` \ (expr', lie1, id_ty) ->
115 tcSubExp res_ty id_ty `thenTc` \ (co_fn, lie2) ->
116 returnTc (co_fn <$> expr', lie1 `plusLIE` lie2)
118 tcMonoExpr (HsIPVar ip) res_ty
119 = -- Implicit parameters must have a *tau-type* not a
120 -- type scheme. We enforce this by creating a fresh
121 -- type variable as its type. (Because res_ty may not
123 newTyVarTy openTypeKind `thenNF_Tc` \ ip_ty ->
124 newIPDict (IPOcc ip) ip ip_ty `thenNF_Tc` \ (ip', inst) ->
125 tcSubExp res_ty ip_ty `thenTc` \ (co_fn, lie) ->
126 returnNF_Tc (co_fn <$> HsIPVar ip', lie `plusLIE` unitLIE inst)
130 %************************************************************************
132 \subsection{Expressions type signatures}
134 %************************************************************************
137 tcMonoExpr in_expr@(ExprWithTySig expr poly_ty) res_ty
138 = tcHsSigType ExprSigCtxt poly_ty `thenTc` \ sig_tc_ty ->
139 tcExpr expr sig_tc_ty `thenTc` \ (expr', lie1) ->
141 -- Must instantiate the outer for-alls of sig_tc_ty
142 -- else we risk instantiating a ? res_ty to a forall-type
143 -- which breaks the invariant that tcMonoExpr only returns phi-types
144 tcAddErrCtxt (exprSigCtxt in_expr) $
145 tcInstCall SignatureOrigin sig_tc_ty `thenNF_Tc` \ (inst_fn, lie2, inst_sig_ty) ->
146 tcSubExp res_ty inst_sig_ty `thenTc` \ (co_fn, lie3) ->
148 returnTc (co_fn <$> inst_fn expr', lie1 `plusLIE` lie2 `plusLIE` lie3)
152 %************************************************************************
154 \subsection{Other expression forms}
156 %************************************************************************
159 tcMonoExpr (HsLit lit) res_ty = tcLit lit res_ty
160 tcMonoExpr (HsOverLit lit) res_ty = newOverloadedLit (LiteralOrigin lit) lit res_ty
161 tcMonoExpr (HsPar expr) res_ty = tcMonoExpr expr res_ty
163 tcMonoExpr (NegApp expr neg_name) res_ty
164 = tcMonoExpr (HsApp (HsVar neg_name) expr) res_ty
166 tcMonoExpr (HsLam match) res_ty
167 = tcMatchLambda match res_ty `thenTc` \ (match',lie) ->
168 returnTc (HsLam match', lie)
170 tcMonoExpr (HsApp e1 e2) res_ty
171 = tcApp e1 [e2] res_ty
174 Note that the operators in sections are expected to be binary, and
175 a type error will occur if they aren't.
178 -- Left sections, equivalent to
185 tcMonoExpr in_expr@(SectionL arg1 op) res_ty
186 = tcExpr_id op `thenTc` \ (op', lie1, op_ty) ->
187 split_fun_ty op_ty 2 {- two args -} `thenTc` \ ([arg1_ty, arg2_ty], op_res_ty) ->
188 tcArg op (arg1, arg1_ty, 1) `thenTc` \ (arg1',lie2) ->
189 tcAddErrCtxt (exprCtxt in_expr) $
190 tcSubExp res_ty (mkFunTy arg2_ty op_res_ty) `thenTc` \ (co_fn, lie3) ->
191 returnTc (co_fn <$> SectionL arg1' op', lie1 `plusLIE` lie2 `plusLIE` lie3)
193 -- Right sections, equivalent to \ x -> x op expr, or
196 tcMonoExpr in_expr@(SectionR op arg2) res_ty
197 = tcExpr_id op `thenTc` \ (op', lie1, op_ty) ->
198 split_fun_ty op_ty 2 {- two args -} `thenTc` \ ([arg1_ty, arg2_ty], op_res_ty) ->
199 tcArg op (arg2, arg2_ty, 2) `thenTc` \ (arg2',lie2) ->
200 tcAddErrCtxt (exprCtxt in_expr) $
201 tcSubExp res_ty (mkFunTy arg1_ty op_res_ty) `thenTc` \ (co_fn, lie3) ->
202 returnTc (co_fn <$> SectionR op' arg2', lie1 `plusLIE` lie2 `plusLIE` lie3)
204 -- equivalent to (op e1) e2:
206 tcMonoExpr in_expr@(OpApp arg1 op fix arg2) res_ty
207 = tcExpr_id op `thenTc` \ (op', lie1, op_ty) ->
208 split_fun_ty op_ty 2 {- two args -} `thenTc` \ ([arg1_ty, arg2_ty], op_res_ty) ->
209 tcArg op (arg1, arg1_ty, 1) `thenTc` \ (arg1',lie2a) ->
210 tcArg op (arg2, arg2_ty, 2) `thenTc` \ (arg2',lie2b) ->
211 tcAddErrCtxt (exprCtxt in_expr) $
212 tcSubExp res_ty op_res_ty `thenTc` \ (co_fn, lie3) ->
213 returnTc (OpApp arg1' op' fix arg2',
214 lie1 `plusLIE` lie2a `plusLIE` lie2b `plusLIE` lie3)
217 The interesting thing about @ccall@ is that it is just a template
218 which we instantiate by filling in details about the types of its
219 argument and result (ie minimal typechecking is performed). So, the
220 basic story is that we allocate a load of type variables (to hold the
221 arg/result types); unify them with the args/result; and store them for
225 tcMonoExpr e0@(HsCCall lbl args may_gc is_casm ignored_fake_result_ty) res_ty
227 = getDOptsTc `thenNF_Tc` \ dflags ->
229 checkTc (not (is_casm && dopt_HscLang dflags /= HscC))
230 (vcat [text "_casm_ is only supported when compiling via C (-fvia-C).",
231 text "Either compile with -fvia-C, or, better, rewrite your code",
232 text "to use the foreign function interface. _casm_s are deprecated",
233 text "and support for them may one day disappear."])
236 -- Get the callable and returnable classes.
237 tcLookupClass cCallableClassName `thenNF_Tc` \ cCallableClass ->
238 tcLookupClass cReturnableClassName `thenNF_Tc` \ cReturnableClass ->
239 tcLookupTyCon ioTyConName `thenNF_Tc` \ ioTyCon ->
241 new_arg_dict (arg, arg_ty)
242 = newDicts (CCallOrigin (_UNPK_ lbl) (Just arg))
243 [mkClassPred cCallableClass [arg_ty]] `thenNF_Tc` \ arg_dicts ->
244 returnNF_Tc arg_dicts -- Actually a singleton bag
246 result_origin = CCallOrigin (_UNPK_ lbl) Nothing {- Not an arg -}
250 let tv_idxs | null args = []
251 | otherwise = [1..length args]
253 newTyVarTys (length tv_idxs) openTypeKind `thenNF_Tc` \ arg_tys ->
254 tcMonoExprs args arg_tys `thenTc` \ (args', args_lie) ->
256 -- The argument types can be unlifted or lifted; the result
257 -- type must, however, be lifted since it's an argument to the IO
259 newTyVarTy liftedTypeKind `thenNF_Tc` \ result_ty ->
261 io_result_ty = mkTyConApp ioTyCon [result_ty]
263 unifyTauTy res_ty io_result_ty `thenTc_`
265 -- Construct the extra insts, which encode the
266 -- constraints on the argument and result types.
267 mapNF_Tc new_arg_dict (zipEqual "tcMonoExpr:CCall" args arg_tys) `thenNF_Tc` \ ccarg_dicts_s ->
268 newDicts result_origin [mkClassPred cReturnableClass [result_ty]] `thenNF_Tc` \ ccres_dict ->
269 returnTc (HsCCall lbl args' may_gc is_casm io_result_ty,
270 mkLIE (ccres_dict ++ concat ccarg_dicts_s) `plusLIE` args_lie)
274 tcMonoExpr (HsSCC lbl expr) res_ty
275 = tcMonoExpr expr res_ty `thenTc` \ (expr', lie) ->
276 returnTc (HsSCC lbl expr', lie)
278 tcMonoExpr (HsLet binds expr) res_ty
281 binds -- Bindings to check
282 tc_expr `thenTc` \ (expr', lie) ->
283 returnTc (expr', lie)
285 tc_expr = tcMonoExpr expr res_ty `thenTc` \ (expr', lie) ->
286 returnTc (expr', lie)
287 combiner is_rec bind expr = HsLet (mkMonoBind bind [] is_rec) expr
289 tcMonoExpr in_expr@(HsCase scrut matches src_loc) res_ty
290 = tcAddSrcLoc src_loc $
291 tcAddErrCtxt (caseCtxt in_expr) $
293 -- Typecheck the case alternatives first.
294 -- The case patterns tend to give good type info to use
295 -- when typechecking the scrutinee. For example
298 -- will report that map is applied to too few arguments
300 -- Not only that, but it's better to check the matches on their
301 -- own, so that we get the expected results for scoped type variables.
303 -- (p::a, q::b) -> (q,p)
304 -- The above should work: the match (p,q) -> (q,p) is polymorphic as
305 -- claimed by the pattern signatures. But if we typechecked the
306 -- match with x in scope and x's type as the expected type, we'd be hosed.
308 tcMatchesCase matches res_ty `thenTc` \ (scrut_ty, matches', lie2) ->
310 tcAddErrCtxt (caseScrutCtxt scrut) (
311 tcMonoExpr scrut scrut_ty
312 ) `thenTc` \ (scrut',lie1) ->
314 returnTc (HsCase scrut' matches' src_loc, plusLIE lie1 lie2)
316 tcMonoExpr (HsIf pred b1 b2 src_loc) res_ty
317 = tcAddSrcLoc src_loc $
318 tcAddErrCtxt (predCtxt pred) (
319 tcMonoExpr pred boolTy ) `thenTc` \ (pred',lie1) ->
321 zapToType res_ty `thenTc` \ res_ty' ->
322 -- C.f. the call to zapToType in TcMatches.tcMatches
324 tcMonoExpr b1 res_ty' `thenTc` \ (b1',lie2) ->
325 tcMonoExpr b2 res_ty' `thenTc` \ (b2',lie3) ->
326 returnTc (HsIf pred' b1' b2' src_loc, plusLIE lie1 (plusLIE lie2 lie3))
330 tcMonoExpr expr@(HsDo do_or_lc stmts src_loc) res_ty
331 = tcDoStmts do_or_lc stmts src_loc res_ty
335 tcMonoExpr in_expr@(ExplicitList _ exprs) res_ty -- Non-empty list
336 = unifyListTy res_ty `thenTc` \ elt_ty ->
337 mapAndUnzipTc (tc_elt elt_ty) exprs `thenTc` \ (exprs', lies) ->
338 returnTc (ExplicitList elt_ty exprs', plusLIEs lies)
341 = tcAddErrCtxt (listCtxt expr) $
342 tcMonoExpr expr elt_ty
344 tcMonoExpr in_expr@(ExplicitPArr _ exprs) res_ty -- maybe empty
345 = unifyPArrTy res_ty `thenTc` \ elt_ty ->
346 mapAndUnzipTc (tc_elt elt_ty) exprs `thenTc` \ (exprs', lies) ->
347 returnTc (ExplicitPArr elt_ty exprs', plusLIEs lies)
350 = tcAddErrCtxt (parrCtxt expr) $
351 tcMonoExpr expr elt_ty
353 tcMonoExpr (ExplicitTuple exprs boxity) res_ty
354 = unifyTupleTy boxity (length exprs) res_ty `thenTc` \ arg_tys ->
355 mapAndUnzipTc (\ (expr, arg_ty) -> tcMonoExpr expr arg_ty)
356 (exprs `zip` arg_tys) -- we know they're of equal length.
357 `thenTc` \ (exprs', lies) ->
358 returnTc (ExplicitTuple exprs' boxity, plusLIEs lies)
360 tcMonoExpr expr@(RecordCon con_name rbinds) res_ty
361 = tcAddErrCtxt (recordConCtxt expr) $
362 tcId con_name `thenNF_Tc` \ (con_expr, con_lie, con_tau) ->
364 (_, record_ty) = tcSplitFunTys con_tau
365 (tycon, ty_args) = tcSplitTyConApp record_ty
367 ASSERT( isAlgTyCon tycon )
368 unifyTauTy res_ty record_ty `thenTc_`
370 -- Check that the record bindings match the constructor
371 -- con_name is syntactically constrained to be a data constructor
372 tcLookupDataCon con_name `thenTc` \ data_con ->
374 bad_fields = badFields rbinds data_con
376 if not (null bad_fields) then
377 mapNF_Tc (addErrTc . badFieldCon con_name) bad_fields `thenNF_Tc_`
378 failTc -- Fail now, because tcRecordBinds will crash on a bad field
381 -- Typecheck the record bindings
382 tcRecordBinds tycon ty_args rbinds `thenTc` \ (rbinds', rbinds_lie) ->
385 (missing_s_fields, missing_fields) = missingFields rbinds data_con
387 checkTcM (null missing_s_fields)
388 (mapNF_Tc (addErrTc . missingStrictFieldCon con_name) missing_s_fields `thenNF_Tc_`
389 returnNF_Tc ()) `thenNF_Tc_`
390 doptsTc Opt_WarnMissingFields `thenNF_Tc` \ warn ->
391 checkTcM (not (warn && not (null missing_fields)))
392 (mapNF_Tc ((warnTc True) . missingFieldCon con_name) missing_fields `thenNF_Tc_`
393 returnNF_Tc ()) `thenNF_Tc_`
395 returnTc (RecordConOut data_con con_expr rbinds', con_lie `plusLIE` rbinds_lie)
397 -- The main complication with RecordUpd is that we need to explicitly
398 -- handle the *non-updated* fields. Consider:
400 -- data T a b = MkT1 { fa :: a, fb :: b }
401 -- | MkT2 { fa :: a, fc :: Int -> Int }
402 -- | MkT3 { fd :: a }
404 -- upd :: T a b -> c -> T a c
405 -- upd t x = t { fb = x}
407 -- The type signature on upd is correct (i.e. the result should not be (T a b))
408 -- because upd should be equivalent to:
410 -- upd t x = case t of
411 -- MkT1 p q -> MkT1 p x
412 -- MkT2 a b -> MkT2 p b
413 -- MkT3 d -> error ...
415 -- So we need to give a completely fresh type to the result record,
416 -- and then constrain it by the fields that are *not* updated ("p" above).
418 -- Note that because MkT3 doesn't contain all the fields being updated,
419 -- its RHS is simply an error, so it doesn't impose any type constraints
421 -- All this is done in STEP 4 below.
423 tcMonoExpr expr@(RecordUpd record_expr rbinds) res_ty
424 = tcAddErrCtxt (recordUpdCtxt expr) $
427 -- Check that the field names are really field names
428 ASSERT( not (null rbinds) )
430 field_names = [field_name | (field_name, _, _) <- rbinds]
432 mapNF_Tc tcLookupGlobal_maybe field_names `thenNF_Tc` \ maybe_sel_ids ->
434 bad_guys = [ addErrTc (notSelector field_name)
435 | (field_name, maybe_sel_id) <- field_names `zip` maybe_sel_ids,
437 Just (AnId sel_id) -> not (isRecordSelector sel_id)
441 checkTcM (null bad_guys) (listNF_Tc bad_guys `thenNF_Tc_` failTc) `thenTc_`
444 -- Figure out the tycon and data cons from the first field name
446 -- It's OK to use the non-tc splitters here (for a selector)
447 (Just (AnId sel_id) : _) = maybe_sel_ids
449 (_, _, tau) = tcSplitSigmaTy (idType sel_id) -- Selectors can be overloaded
450 -- when the data type has a context
451 data_ty = tcFunArgTy tau -- Must succeed since sel_id is a selector
452 tycon = tcTyConAppTyCon data_ty
453 data_cons = tyConDataCons tycon
454 tycon_tyvars = tyConTyVars tycon -- The data cons use the same type vars
456 tcInstTyVars VanillaTv tycon_tyvars `thenNF_Tc` \ (_, result_inst_tys, inst_env) ->
459 -- Check that at least one constructor has all the named fields
460 -- i.e. has an empty set of bad fields returned by badFields
461 checkTc (any (null . badFields rbinds) data_cons)
462 (badFieldsUpd rbinds) `thenTc_`
465 -- Typecheck the update bindings.
466 -- (Do this after checking for bad fields in case there's a field that
467 -- doesn't match the constructor.)
469 result_record_ty = mkTyConApp tycon result_inst_tys
471 unifyTauTy res_ty result_record_ty `thenTc_`
472 tcRecordBinds tycon result_inst_tys rbinds `thenTc` \ (rbinds', rbinds_lie) ->
475 -- Use the un-updated fields to find a vector of booleans saying
476 -- which type arguments must be the same in updatee and result.
478 -- WARNING: this code assumes that all data_cons in a common tycon
479 -- have FieldLabels abstracted over the same tyvars.
481 upd_field_lbls = [recordSelectorFieldLabel sel_id | (sel_id, _, _) <- rbinds']
482 con_field_lbls_s = map dataConFieldLabels data_cons
484 -- A constructor is only relevant to this process if
485 -- it contains all the fields that are being updated
486 relevant_field_lbls_s = filter is_relevant con_field_lbls_s
487 is_relevant con_field_lbls = all (`elem` con_field_lbls) upd_field_lbls
489 non_upd_field_lbls = concat relevant_field_lbls_s `minusList` upd_field_lbls
490 common_tyvars = tyVarsOfTypes (map fieldLabelType non_upd_field_lbls)
492 mk_inst_ty (tyvar, result_inst_ty)
493 | tyvar `elemVarSet` common_tyvars = returnNF_Tc result_inst_ty -- Same as result type
494 | otherwise = newTyVarTy liftedTypeKind -- Fresh type
496 mapNF_Tc mk_inst_ty (zip tycon_tyvars result_inst_tys) `thenNF_Tc` \ inst_tys ->
499 -- Typecheck the expression to be updated
501 record_ty = mkTyConApp tycon inst_tys
503 tcMonoExpr record_expr record_ty `thenTc` \ (record_expr', record_lie) ->
506 -- Figure out the LIE we need. We have to generate some
507 -- dictionaries for the data type context, since we are going to
508 -- do pattern matching over the data cons.
510 -- What dictionaries do we need?
511 -- We just take the context of the type constructor
513 theta' = substTheta inst_env (tyConTheta tycon)
515 newDicts RecordUpdOrigin theta' `thenNF_Tc` \ dicts ->
518 returnTc (RecordUpdOut record_expr' record_ty result_record_ty rbinds',
519 mkLIE dicts `plusLIE` record_lie `plusLIE` rbinds_lie)
521 tcMonoExpr (ArithSeqIn seq@(From expr)) res_ty
522 = unifyListTy res_ty `thenTc` \ elt_ty ->
523 tcMonoExpr expr elt_ty `thenTc` \ (expr', lie1) ->
525 tcLookupGlobalId enumFromName `thenNF_Tc` \ sel_id ->
526 newMethod (ArithSeqOrigin seq)
527 sel_id [elt_ty] `thenNF_Tc` \ enum_from ->
529 returnTc (ArithSeqOut (HsVar (instToId enum_from)) (From expr'),
530 lie1 `plusLIE` unitLIE enum_from)
532 tcMonoExpr in_expr@(ArithSeqIn seq@(FromThen expr1 expr2)) res_ty
533 = tcAddErrCtxt (arithSeqCtxt in_expr) $
534 unifyListTy res_ty `thenTc` \ elt_ty ->
535 tcMonoExpr expr1 elt_ty `thenTc` \ (expr1',lie1) ->
536 tcMonoExpr expr2 elt_ty `thenTc` \ (expr2',lie2) ->
537 tcLookupGlobalId enumFromThenName `thenNF_Tc` \ sel_id ->
538 newMethod (ArithSeqOrigin seq) sel_id [elt_ty] `thenNF_Tc` \ enum_from_then ->
540 returnTc (ArithSeqOut (HsVar (instToId enum_from_then))
541 (FromThen expr1' expr2'),
542 lie1 `plusLIE` lie2 `plusLIE` unitLIE enum_from_then)
544 tcMonoExpr in_expr@(ArithSeqIn seq@(FromTo expr1 expr2)) res_ty
545 = tcAddErrCtxt (arithSeqCtxt in_expr) $
546 unifyListTy res_ty `thenTc` \ elt_ty ->
547 tcMonoExpr expr1 elt_ty `thenTc` \ (expr1',lie1) ->
548 tcMonoExpr expr2 elt_ty `thenTc` \ (expr2',lie2) ->
549 tcLookupGlobalId enumFromToName `thenNF_Tc` \ sel_id ->
550 newMethod (ArithSeqOrigin seq) sel_id [elt_ty] `thenNF_Tc` \ enum_from_to ->
552 returnTc (ArithSeqOut (HsVar (instToId enum_from_to))
553 (FromTo expr1' expr2'),
554 lie1 `plusLIE` lie2 `plusLIE` unitLIE enum_from_to)
556 tcMonoExpr in_expr@(ArithSeqIn seq@(FromThenTo expr1 expr2 expr3)) res_ty
557 = tcAddErrCtxt (arithSeqCtxt in_expr) $
558 unifyListTy res_ty `thenTc` \ elt_ty ->
559 tcMonoExpr expr1 elt_ty `thenTc` \ (expr1',lie1) ->
560 tcMonoExpr expr2 elt_ty `thenTc` \ (expr2',lie2) ->
561 tcMonoExpr expr3 elt_ty `thenTc` \ (expr3',lie3) ->
562 tcLookupGlobalId enumFromThenToName `thenNF_Tc` \ sel_id ->
563 newMethod (ArithSeqOrigin seq) sel_id [elt_ty] `thenNF_Tc` \ eft ->
565 returnTc (ArithSeqOut (HsVar (instToId eft))
566 (FromThenTo expr1' expr2' expr3'),
567 lie1 `plusLIE` lie2 `plusLIE` lie3 `plusLIE` unitLIE eft)
569 tcMonoExpr in_expr@(PArrSeqIn seq@(FromTo expr1 expr2)) res_ty
570 = tcAddErrCtxt (parrSeqCtxt in_expr) $
571 unifyPArrTy res_ty `thenTc` \ elt_ty ->
572 tcMonoExpr expr1 elt_ty `thenTc` \ (expr1',lie1) ->
573 tcMonoExpr expr2 elt_ty `thenTc` \ (expr2',lie2) ->
574 tcLookupGlobalId enumFromToPName `thenNF_Tc` \ sel_id ->
575 newMethod (PArrSeqOrigin seq) sel_id [elt_ty] `thenNF_Tc` \ enum_from_to ->
577 returnTc (PArrSeqOut (HsVar (instToId enum_from_to))
578 (FromTo expr1' expr2'),
579 lie1 `plusLIE` lie2 `plusLIE` unitLIE enum_from_to)
581 tcMonoExpr in_expr@(PArrSeqIn seq@(FromThenTo expr1 expr2 expr3)) res_ty
582 = tcAddErrCtxt (parrSeqCtxt in_expr) $
583 unifyPArrTy res_ty `thenTc` \ elt_ty ->
584 tcMonoExpr expr1 elt_ty `thenTc` \ (expr1',lie1) ->
585 tcMonoExpr expr2 elt_ty `thenTc` \ (expr2',lie2) ->
586 tcMonoExpr expr3 elt_ty `thenTc` \ (expr3',lie3) ->
587 tcLookupGlobalId enumFromThenToPName `thenNF_Tc` \ sel_id ->
588 newMethod (PArrSeqOrigin seq) sel_id [elt_ty] `thenNF_Tc` \ eft ->
590 returnTc (PArrSeqOut (HsVar (instToId eft))
591 (FromThenTo expr1' expr2' expr3'),
592 lie1 `plusLIE` lie2 `plusLIE` lie3 `plusLIE` unitLIE eft)
594 tcMonoExpr (PArrSeqIn _) _
595 = panic "TcExpr.tcMonoExpr: Infinite parallel array!"
596 -- the parser shouldn't have generated it and the renamer shouldn't have
600 %************************************************************************
602 \subsection{Implicit Parameter bindings}
604 %************************************************************************
607 tcMonoExpr (HsWith expr binds) res_ty
608 = tcMonoExpr expr res_ty `thenTc` \ (expr', expr_lie) ->
609 mapAndUnzip3Tc tcIPBind binds `thenTc` \ (avail_ips, binds', bind_lies) ->
611 -- If the binding binds ?x = E, we must now
612 -- discharge any ?x constraints in expr_lie
613 tcSimplifyIPs avail_ips expr_lie `thenTc` \ (expr_lie', dict_binds) ->
615 expr'' = HsLet (mkMonoBind dict_binds [] Recursive) expr'
617 returnTc (HsWith expr'' binds', expr_lie' `plusLIE` plusLIEs bind_lies)
620 = newTyVarTy openTypeKind `thenTc` \ ty ->
621 tcGetSrcLoc `thenTc` \ loc ->
622 newIPDict (IPBind ip) ip ty `thenNF_Tc` \ (ip', ip_inst) ->
623 tcMonoExpr expr ty `thenTc` \ (expr', lie) ->
624 returnTc (ip_inst, (ip', expr'), lie)
627 %************************************************************************
629 \subsection{@tcApp@ typchecks an application}
631 %************************************************************************
635 tcApp :: RenamedHsExpr -> [RenamedHsExpr] -- Function and args
636 -> TcType -- Expected result type of application
637 -> TcM (TcExpr, LIE) -- Translated fun and args
639 tcApp (HsApp e1 e2) args res_ty
640 = tcApp e1 (e2:args) res_ty -- Accumulate the arguments
642 tcApp fun args res_ty
643 = -- First type-check the function
644 tcExpr_id fun `thenTc` \ (fun', lie_fun, fun_ty) ->
646 tcAddErrCtxt (wrongArgsCtxt "too many" fun args) (
647 traceTc (text "tcApp" <+> (ppr fun $$ ppr fun_ty)) `thenNF_Tc_`
648 split_fun_ty fun_ty (length args)
649 ) `thenTc` \ (expected_arg_tys, actual_result_ty) ->
651 -- Now typecheck the args
652 mapAndUnzipTc (tcArg fun)
653 (zip3 args expected_arg_tys [1..]) `thenTc` \ (args', lie_args_s) ->
655 -- Unify with expected result after type-checking the args
656 -- so that the info from args percolates to actual_result_ty.
657 -- This is when we might detect a too-few args situation.
658 -- (One can think of cases when the opposite order would give
659 -- a better error message.)
660 tcAddErrCtxtM (checkArgsCtxt fun args res_ty actual_result_ty)
661 (tcSubExp res_ty actual_result_ty) `thenTc` \ (co_fn, lie_res) ->
663 returnTc (co_fn <$> foldl HsApp fun' args',
664 lie_res `plusLIE` lie_fun `plusLIE` plusLIEs lie_args_s)
667 -- If an error happens we try to figure out whether the
668 -- function has been given too many or too few arguments,
670 checkArgsCtxt fun args expected_res_ty actual_res_ty tidy_env
671 = zonkTcType expected_res_ty `thenNF_Tc` \ exp_ty' ->
672 zonkTcType actual_res_ty `thenNF_Tc` \ act_ty' ->
674 (env1, exp_ty'') = tidyOpenType tidy_env exp_ty'
675 (env2, act_ty'') = tidyOpenType env1 act_ty'
676 (exp_args, _) = tcSplitFunTys exp_ty''
677 (act_args, _) = tcSplitFunTys act_ty''
679 len_act_args = length act_args
680 len_exp_args = length exp_args
682 message | len_exp_args < len_act_args = wrongArgsCtxt "too few" fun args
683 | len_exp_args > len_act_args = wrongArgsCtxt "too many" fun args
684 | otherwise = appCtxt fun args
686 returnNF_Tc (env2, message)
689 split_fun_ty :: TcType -- The type of the function
690 -> Int -- Number of arguments
691 -> TcM ([TcType], -- Function argument types
692 TcType) -- Function result types
694 split_fun_ty fun_ty 0
695 = returnTc ([], fun_ty)
697 split_fun_ty fun_ty n
698 = -- Expect the function to have type A->B
699 unifyFunTy fun_ty `thenTc` \ (arg_ty, res_ty) ->
700 split_fun_ty res_ty (n-1) `thenTc` \ (arg_tys, final_res_ty) ->
701 returnTc (arg_ty:arg_tys, final_res_ty)
705 tcArg :: RenamedHsExpr -- The function (for error messages)
706 -> (RenamedHsExpr, TcSigmaType, Int) -- Actual argument and expected arg type
707 -> TcM (TcExpr, LIE) -- Resulting argument and LIE
709 tcArg the_fun (arg, expected_arg_ty, arg_no)
710 = tcAddErrCtxt (funAppCtxt the_fun arg arg_no) $
711 tcExpr arg expected_arg_ty
715 %************************************************************************
717 \subsection{@tcId@ typchecks an identifier occurrence}
719 %************************************************************************
721 tcId instantiates an occurrence of an Id.
722 The instantiate_it loop runs round instantiating the Id.
723 It has to be a loop because we are now prepared to entertain
725 f:: forall a. Eq a => forall b. Baz b => tau
726 We want to instantiate this to
727 f2::tau {f2 = f1 b (Baz b), f1 = f a (Eq a)}
729 The -fno-method-sharing flag controls what happens so far as the LIE
730 is concerned. The default case is that for an overloaded function we
731 generate a "method" Id, and add the Method Inst to the LIE. So you get
734 f = /\a (d:Num a) -> let m = (+) a d in \ (x:a) -> m x x
735 If you specify -fno-method-sharing, the dictionary application
736 isn't shared, so we get
738 f = /\a (d:Num a) (x:a) -> (+) a d x x
739 This gets a bit less sharing, but
740 a) it's better for RULEs involving overloaded functions
741 b) perhaps fewer separated lambdas
744 tcId :: Name -> NF_TcM (TcExpr, LIE, TcType)
745 tcId name -- Look up the Id and instantiate its type
746 = tcLookupId name `thenNF_Tc` \ id ->
747 case isDataConWrapId_maybe id of
748 Nothing -> loop (HsVar id) emptyLIE (idType id)
749 Just data_con -> inst_data_con id data_con
751 orig = OccurrenceOf name
753 loop (HsVar fun_id) lie fun_ty
754 | want_method_inst fun_ty
755 = tcInstType VanillaTv fun_ty `thenNF_Tc` \ (tyvars, theta, tau) ->
756 newMethodWithGivenTy orig fun_id
757 (mkTyVarTys tyvars) theta tau `thenNF_Tc` \ meth ->
758 loop (HsVar (instToId meth))
759 (unitLIE meth `plusLIE` lie) tau
763 = tcInstCall orig fun_ty `thenNF_Tc` \ (inst_fn, inst_lie, tau) ->
764 loop (inst_fn fun) (inst_lie `plusLIE` lie) tau
767 = returnNF_Tc (fun, lie, fun_ty)
769 want_method_inst fun_ty
770 | opt_NoMethodSharing = False
771 | otherwise = case tcSplitSigmaTy fun_ty of
772 (_,[],_) -> False -- Not overloaded
773 (_,theta,_) -> not (any isLinearPred theta)
774 -- This is a slight hack.
775 -- If f :: (%x :: T) => Int -> Int
776 -- Then if we have two separate calls, (f 3, f 4), we cannot
777 -- make a method constraint that then gets shared, thus:
778 -- let m = f %x in (m 3, m 4)
779 -- because that loses the linearity of the constraint.
780 -- The simplest thing to do is never to construct a method constraint
781 -- in the first place that has a linear implicit parameter in it.
783 -- We treat data constructors differently, because we have to generate
784 -- constraints for their silly theta, which no longer appears in
785 -- the type of dataConWrapId. It's dual to TcPat.tcConstructor
786 inst_data_con id data_con
787 = tcInstDataCon orig data_con `thenNF_Tc` \ (ty_args, ex_dicts, arg_tys, result_ty, stupid_lie, ex_lie, _) ->
788 returnNF_Tc (mkHsDictApp (mkHsTyApp (HsVar id) ty_args) ex_dicts,
789 stupid_lie `plusLIE` ex_lie,
790 mkFunTys arg_tys result_ty)
793 Typecheck expression which in most cases will be an Id.
794 The expression can return a higher-ranked type, such as
795 (forall a. a->a) -> Int
796 so we must create a HoleTyVarTy to pass in as the expected tyvar.
799 tcExpr_id :: RenamedHsExpr -> TcM (TcExpr, LIE, TcType)
800 tcExpr_id (HsVar name) = tcId name
801 tcExpr_id expr = newHoleTyVarTy `thenNF_Tc` \ id_ty ->
802 tcMonoExpr expr id_ty `thenTc` \ (expr', lie_id) ->
803 readHoleResult id_ty `thenTc` \ id_ty' ->
804 returnTc (expr', lie_id, id_ty')
808 %************************************************************************
810 \subsection{@tcDoStmts@ typechecks a {\em list} of do statements}
812 %************************************************************************
815 -- I don't like this lumping together of do expression and list/array
816 -- comprehensions; creating the monad instances is entirely pointless in the
817 -- latter case; I'll leave the list case as it is for the moment, but handle
818 -- arrays extra (would be better to handle arrays and lists together, though)
821 tcDoStmts PArrComp stmts src_loc res_ty
823 ASSERT( not (null stmts) )
824 tcAddSrcLoc src_loc $
826 unifyPArrTy res_ty `thenTc` \elt_ty ->
827 let tc_ty = mkTyConTy parrTyCon
828 m_ty = (mkPArrTy, elt_ty)
830 tcStmts (DoCtxt PArrComp) m_ty stmts `thenTc` \(stmts', stmts_lie) ->
831 returnTc (HsDoOut PArrComp stmts'
832 undefined undefined undefined -- don't touch!
836 tcDoStmts do_or_lc stmts src_loc res_ty
837 = -- get the Monad and MonadZero classes
838 -- create type consisting of a fresh monad tyvar
839 ASSERT( not (null stmts) )
840 tcAddSrcLoc src_loc $
842 -- If it's a comprehension we're dealing with,
843 -- force it to be a list comprehension.
844 -- (as of Haskell 98, monad comprehensions are no more.)
845 -- Similarily, array comprehensions must involve parallel arrays types
848 ListComp -> unifyListTy res_ty `thenTc` \ elt_ty ->
849 returnNF_Tc (mkTyConTy listTyCon, (mkListTy, elt_ty))
851 PArrComp -> panic "TcExpr.tcDoStmts: How did we get here?!?"
853 _ -> newTyVarTy (mkArrowKind liftedTypeKind liftedTypeKind) `thenNF_Tc` \ m_ty ->
854 newTyVarTy liftedTypeKind `thenNF_Tc` \ elt_ty ->
855 unifyTauTy res_ty (mkAppTy m_ty elt_ty) `thenTc_`
856 returnNF_Tc (m_ty, (mkAppTy m_ty, elt_ty))
857 ) `thenNF_Tc` \ (tc_ty, m_ty) ->
859 tcStmts (DoCtxt do_or_lc) m_ty stmts `thenTc` \ (stmts', stmts_lie) ->
861 -- Build the then and zero methods in case we need them
862 -- It's important that "then" and "return" appear just once in the final LIE,
863 -- not only for typechecker efficiency, but also because otherwise during
864 -- simplification we end up with silly stuff like
865 -- then = case d of (t,r) -> t
867 -- where the second "then" sees that it already exists in the "available" stuff.
869 tcLookupGlobalId returnMName `thenNF_Tc` \ return_sel_id ->
870 tcLookupGlobalId thenMName `thenNF_Tc` \ then_sel_id ->
871 tcLookupGlobalId failMName `thenNF_Tc` \ fail_sel_id ->
872 newMethod DoOrigin return_sel_id [tc_ty] `thenNF_Tc` \ return_inst ->
873 newMethod DoOrigin then_sel_id [tc_ty] `thenNF_Tc` \ then_inst ->
874 newMethod DoOrigin fail_sel_id [tc_ty] `thenNF_Tc` \ fail_inst ->
876 monad_lie = mkLIE [return_inst, then_inst, fail_inst]
878 returnTc (HsDoOut do_or_lc stmts'
879 (instToId return_inst) (instToId then_inst) (instToId fail_inst)
881 stmts_lie `plusLIE` monad_lie)
885 %************************************************************************
887 \subsection{Record bindings}
889 %************************************************************************
891 Game plan for record bindings
892 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
893 1. Find the TyCon for the bindings, from the first field label.
895 2. Instantiate its tyvars and unify (T a1 .. an) with expected_ty.
897 For each binding field = value
899 3. Instantiate the field type (from the field label) using the type
902 4 Type check the value using tcArg, passing the field type as
903 the expected argument type.
905 This extends OK when the field types are universally quantified.
910 :: TyCon -- Type constructor for the record
911 -> [TcType] -- Args of this type constructor
912 -> RenamedRecordBinds
913 -> TcM (TcRecordBinds, LIE)
915 tcRecordBinds tycon ty_args rbinds
916 = mapAndUnzipTc do_bind rbinds `thenTc` \ (rbinds', lies) ->
917 returnTc (rbinds', plusLIEs lies)
919 tenv = mkTopTyVarSubst (tyConTyVars tycon) ty_args
921 do_bind (field_lbl_name, rhs, pun_flag)
922 = tcLookupGlobalId field_lbl_name `thenNF_Tc` \ sel_id ->
924 field_lbl = recordSelectorFieldLabel sel_id
925 field_ty = substTy tenv (fieldLabelType field_lbl)
927 ASSERT( isRecordSelector sel_id )
928 -- This lookup and assertion will surely succeed, because
929 -- we check that the fields are indeed record selectors
930 -- before calling tcRecordBinds
931 ASSERT2( fieldLabelTyCon field_lbl == tycon, ppr field_lbl )
932 -- The caller of tcRecordBinds has already checked
933 -- that all the fields come from the same type
935 tcExpr rhs field_ty `thenTc` \ (rhs', lie) ->
937 returnTc ((sel_id, rhs', pun_flag), lie)
939 badFields rbinds data_con
940 = [field_name | (field_name, _, _) <- rbinds,
941 not (field_name `elem` field_names)
944 field_names = map fieldLabelName (dataConFieldLabels data_con)
946 missingFields rbinds data_con
947 | null field_labels = ([], []) -- Not declared as a record;
948 -- But C{} is still valid
950 = (missing_strict_fields, other_missing_fields)
952 missing_strict_fields
953 = [ fl | (fl, str) <- field_info,
955 not (fieldLabelName fl `elem` field_names_used)
958 = [ fl | (fl, str) <- field_info,
959 not (isMarkedStrict str),
960 not (fieldLabelName fl `elem` field_names_used)
963 field_names_used = [ field_name | (field_name, _, _) <- rbinds ]
964 field_labels = dataConFieldLabels data_con
966 field_info = zipEqual "missingFields"
968 (dropList ex_theta (dataConStrictMarks data_con))
969 -- The 'drop' is because dataConStrictMarks
970 -- includes the existential dictionaries
971 (_, _, _, ex_theta, _, _) = dataConSig data_con
974 %************************************************************************
976 \subsection{@tcMonoExprs@ typechecks a {\em list} of expressions}
978 %************************************************************************
981 tcMonoExprs :: [RenamedHsExpr] -> [TcType] -> TcM ([TcExpr], LIE)
983 tcMonoExprs [] [] = returnTc ([], emptyLIE)
984 tcMonoExprs (expr:exprs) (ty:tys)
985 = tcMonoExpr expr ty `thenTc` \ (expr', lie1) ->
986 tcMonoExprs exprs tys `thenTc` \ (exprs', lie2) ->
987 returnTc (expr':exprs', lie1 `plusLIE` lie2)
991 %************************************************************************
993 \subsection{Literals}
995 %************************************************************************
1000 tcLit :: HsLit -> TcType -> TcM (TcExpr, LIE)
1001 tcLit (HsLitLit s _) res_ty
1002 = tcLookupClass cCallableClassName `thenNF_Tc` \ cCallableClass ->
1003 newDicts (LitLitOrigin (_UNPK_ s))
1004 [mkClassPred cCallableClass [res_ty]] `thenNF_Tc` \ dicts ->
1005 returnTc (HsLit (HsLitLit s res_ty), mkLIE dicts)
1008 = unifyTauTy res_ty (simpleHsLitTy lit) `thenTc_`
1009 returnTc (HsLit lit, emptyLIE)
1013 %************************************************************************
1015 \subsection{Errors and contexts}
1017 %************************************************************************
1021 Boring and alphabetical:
1024 = hang (ptext SLIT("In an arithmetic sequence:")) 4 (ppr expr)
1027 = hang (ptext SLIT("In a parallel array sequence:")) 4 (ppr expr)
1030 = hang (ptext SLIT("In the case expression:")) 4 (ppr expr)
1033 = hang (ptext SLIT("In the scrutinee of a case expression:")) 4 (ppr expr)
1036 = hang (ptext SLIT("When checking the type signature of the expression:"))
1040 = hang (ptext SLIT("In the list element:")) 4 (ppr expr)
1043 = hang (ptext SLIT("In the parallel array element:")) 4 (ppr expr)
1046 = hang (ptext SLIT("In the predicate expression:")) 4 (ppr expr)
1049 = hang (ptext SLIT("In the expression:")) 4 (ppr expr)
1051 funAppCtxt fun arg arg_no
1052 = hang (hsep [ ptext SLIT("In the"), speakNth arg_no, ptext SLIT("argument of"),
1053 quotes (ppr fun) <> text ", namely"])
1054 4 (quotes (ppr arg))
1056 wrongArgsCtxt too_many_or_few fun args
1057 = hang (ptext SLIT("Probable cause:") <+> quotes (ppr fun)
1058 <+> ptext SLIT("is applied to") <+> text too_many_or_few
1059 <+> ptext SLIT("arguments in the call"))
1060 4 (parens (ppr the_app))
1062 the_app = foldl HsApp fun args -- Used in error messages
1065 = ptext SLIT("In the application") <+> quotes (ppr the_app)
1067 the_app = foldl HsApp fun args -- Used in error messages
1069 lurkingRank2Err fun fun_ty
1070 = hang (hsep [ptext SLIT("Illegal use of"), quotes (ppr fun)])
1071 4 (vcat [ptext SLIT("It is applied to too few arguments"),
1072 ptext SLIT("so that the result type has for-alls in it:") <+> ppr fun_ty])
1075 = hang (ptext SLIT("No constructor has all these fields:"))
1076 4 (pprQuotedList fields)
1078 fields = [field | (field, _, _) <- rbinds]
1080 recordUpdCtxt expr = ptext SLIT("In the record update:") <+> ppr expr
1081 recordConCtxt expr = ptext SLIT("In the record construction:") <+> ppr expr
1084 = hsep [quotes (ppr field), ptext SLIT("is not a record selector")]
1086 missingStrictFieldCon :: Name -> FieldLabel -> SDoc
1087 missingStrictFieldCon con field
1088 = hsep [ptext SLIT("Constructor") <+> quotes (ppr con),
1089 ptext SLIT("does not have the required strict field"), quotes (ppr field)]
1091 missingFieldCon :: Name -> FieldLabel -> SDoc
1092 missingFieldCon con field
1093 = hsep [ptext SLIT("Field") <+> quotes (ppr field),
1094 ptext SLIT("is not initialised")]