2 % (c) The University of Glasgow 2006
3 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
8 buildSynTyCon, buildAlgTyCon, buildDataCon,
10 mkAbstractTyConRhs, mkOpenDataTyConRhs, mkOpenNewTyConRhs,
11 mkNewTyConRhs, mkDataTyConRhs
14 #include "HsVersions.h"
38 ------------------------------------------------------
39 buildSynTyCon :: Name -> [TyVar] -> SynTyConRhs -> TyCon
40 buildSynTyCon name tvs rhs@(OpenSynTyCon rhs_ki)
41 = mkSynTyCon name kind tvs rhs
43 kind = mkArrowKinds (map tyVarKind tvs) rhs_ki
44 buildSynTyCon name tvs rhs@(SynonymTyCon rhs_ty)
45 = mkSynTyCon name kind tvs rhs
47 kind = mkArrowKinds (map tyVarKind tvs) (typeKind rhs_ty)
50 ------------------------------------------------------
51 buildAlgTyCon :: Name -> [TyVar]
52 -> ThetaType -- Stupid theta
55 -> Bool -- True <=> want generics functions
56 -> Bool -- True <=> was declared in GADT syntax
57 -> Maybe (TyCon, [Type]) -- family instance if applicable
60 buildAlgTyCon tc_name tvs stupid_theta rhs is_rec want_generics gadt_syn
62 = do { -- We need to tie a knot as the coercion of a data instance depends
63 -- on the instance representation tycon and vice versa.
64 ; tycon <- fixM (\ tycon_rec -> do
65 { parent <- parentInfo mb_family tycon_rec
66 ; let { tycon = mkAlgTyCon tc_name kind tvs stupid_theta rhs
67 fields parent is_rec want_generics gadt_syn
68 ; kind = mkArrowKinds (map tyVarKind tvs) liftedTypeKind
69 ; fields = mkTyConSelIds tycon rhs
76 -- If a family tycon with instance types is given, the current tycon is an
77 -- instance of that family and we need to
79 -- (1) create a coercion that identifies the family instance type and the
80 -- representation type from Step (1); ie, it is of the form
81 -- `Co tvs :: F ts :=: R tvs', where `Co' is the name of the coercion,
82 -- `F' the family tycon and `R' the (derived) representation tycon,
84 -- (2) produce a `AlgTyConParent' value containing the parent and coercion
87 parentInfo Nothing rep_tycon =
89 parentInfo (Just (family, instTys)) rep_tycon =
90 do { -- Create the coercion
91 ; co_tycon_name <- newImplicitBinder tc_name mkInstTyCoOcc
92 ; let co_tycon = mkDataInstCoercion co_tycon_name tvs
93 family instTys rep_tycon
94 ; return $ FamilyTyCon family instTys co_tycon
98 ------------------------------------------------------
99 mkAbstractTyConRhs :: AlgTyConRhs
100 mkAbstractTyConRhs = AbstractTyCon
102 mkOpenDataTyConRhs :: AlgTyConRhs
103 mkOpenDataTyConRhs = OpenDataTyCon
105 mkOpenNewTyConRhs :: AlgTyConRhs
106 mkOpenNewTyConRhs = OpenNewTyCon
108 mkDataTyConRhs :: [DataCon] -> AlgTyConRhs
110 = DataTyCon { data_cons = cons, is_enum = all isNullarySrcDataCon cons }
112 mkNewTyConRhs :: Name -> TyCon -> DataCon -> TcRnIf m n AlgTyConRhs
113 -- Monadic because it makes a Name for the coercion TyCon
114 -- We pass the Name of the parent TyCon, as well as the TyCon itself,
115 -- because the latter is part of a knot, whereas the former is not.
116 mkNewTyConRhs tycon_name tycon con
117 = do { co_tycon_name <- newImplicitBinder tycon_name mkNewTyCoOcc
118 ; let co_tycon = mkNewTypeCoercion co_tycon_name tycon etad_rhs
119 cocon_maybe | all_coercions || isRecursiveTyCon tycon
123 ; return (NewTyCon { data_con = con,
125 nt_etad_rhs = etad_rhs,
127 -- Coreview looks through newtypes with a Nothing
128 -- for nt_co, or uses explicit coercions otherwise
129 nt_rep = mkNewTyConRep tycon rhs_ty }) }
131 -- If all_coercions is True then we use coercions for all newtypes
132 -- otherwise we use coercions for recursive newtypes and look through
133 -- non-recursive newtypes
135 tvs = tyConTyVars tycon
136 rhs_ty = head (dataConInstOrigArgTys con (mkTyVarTys tvs))
137 -- Instantiate the data con with the
138 -- type variables from the tycon
140 etad_rhs :: ([TyVar], Type)
141 etad_rhs = eta_reduce (reverse tvs) rhs_ty
143 eta_reduce :: [TyVar] -- Reversed
145 -> ([TyVar], Type) -- Eta-reduced version (tyvars in normal order)
146 eta_reduce (a:as) ty | Just (fun, arg) <- splitAppTy_maybe ty,
147 Just tv <- getTyVar_maybe arg,
149 not (a `elemVarSet` tyVarsOfType fun)
151 eta_reduce tvs ty = (reverse tvs, ty)
154 mkNewTyConRep :: TyCon -- The original type constructor
155 -> Type -- The arg type of its constructor
156 -> Type -- Chosen representation type
157 -- The "representation type" is guaranteed not to be another newtype
158 -- at the outermost level; but it might have newtypes in type arguments
160 -- Find the representation type for this newtype TyCon
161 -- Remember that the representation type is the *ultimate* representation
162 -- type, looking through other newtypes.
164 -- splitTyConApp_maybe no longer looks through newtypes, so we must
165 -- deal explicitly with this case
167 -- The trick is to to deal correctly with recursive newtypes
168 -- such as newtype T = MkT T
170 mkNewTyConRep tc rhs_ty
171 | null (tyConDataCons tc) = unitTy
172 -- External Core programs can have newtypes with no data constructors
173 | otherwise = go [tc] rhs_ty
175 -- Invariant: tcs have been seen before
177 = case splitTyConApp_maybe rep_ty of
179 | tc `elem` tcs -> unitTy -- Recursive loop
181 if isRecursiveTyCon tc then
182 go (tc:tcs) (substTyWith tvs tys rhs_ty)
184 substTyWith tvs tys rhs_ty
186 (tvs, rhs_ty) = newTyConRhs tc
190 ------------------------------------------------------
191 buildDataCon :: Name -> Bool
193 -> [Name] -- Field labels
194 -> [TyVar] -> [TyVar] -- Univ and ext
195 -> [(TyVar,Type)] -- Equality spec
196 -> ThetaType -- Does not include the "stupid theta"
197 -- or the GADT equalities
199 -> TcRnIf m n DataCon
200 -- A wrapper for DataCon.mkDataCon that
201 -- a) makes the worker Id
202 -- b) makes the wrapper Id if necessary, including
203 -- allocating its unique (hence monadic)
204 buildDataCon src_name declared_infix arg_stricts field_lbls
205 univ_tvs ex_tvs eq_spec ctxt arg_tys tycon
206 = do { wrap_name <- newImplicitBinder src_name mkDataConWrapperOcc
207 ; work_name <- newImplicitBinder src_name mkDataConWorkerOcc
208 -- This last one takes the name of the data constructor in the source
209 -- code, which (for Haskell source anyway) will be in the DataName name
210 -- space, and puts it into the VarName name space
213 stupid_ctxt = mkDataConStupidTheta tycon arg_tys univ_tvs
214 data_con = mkDataCon src_name declared_infix
215 arg_stricts field_lbls
216 univ_tvs ex_tvs eq_spec ctxt
219 dc_ids = mkDataConIds wrap_name work_name data_con
224 -- The stupid context for a data constructor should be limited to
225 -- the type variables mentioned in the arg_tys
226 -- ToDo: Or functionally dependent on?
227 -- This whole stupid theta thing is, well, stupid.
228 mkDataConStupidTheta tycon arg_tys univ_tvs
229 | null stupid_theta = [] -- The common case
230 | otherwise = filter in_arg_tys stupid_theta
232 tc_subst = zipTopTvSubst (tyConTyVars tycon) (mkTyVarTys univ_tvs)
233 stupid_theta = substTheta tc_subst (tyConStupidTheta tycon)
234 -- Start by instantiating the master copy of the
235 -- stupid theta, taken from the TyCon
237 arg_tyvars = tyVarsOfTypes arg_tys
238 in_arg_tys pred = not $ isEmptyVarSet $
239 tyVarsOfPred pred `intersectVarSet` arg_tyvars
241 ------------------------------------------------------
242 mkTyConSelIds :: TyCon -> AlgTyConRhs -> [Id]
243 mkTyConSelIds tycon rhs
244 = [ mkRecordSelId tycon fld
245 | fld <- nub (concatMap dataConFieldLabels (visibleDataCons rhs)) ]
246 -- We'll check later that fields with the same name
247 -- from different constructors have the same type.
251 ------------------------------------------------------
253 buildClass :: Name -> [TyVar] -> ThetaType
254 -> [FunDep TyVar] -- Functional dependencies
255 -> [TyThing] -- Associated types
256 -> [(Name, DefMeth, Type)] -- Method info
257 -> RecFlag -- Info for type constructor
260 buildClass class_name tvs sc_theta fds ats sig_stuff tc_isrec
261 = do { tycon_name <- newImplicitBinder class_name mkClassTyConOcc
262 ; datacon_name <- newImplicitBinder class_name mkClassDataConOcc
263 -- The class name is the 'parent' for this datacon, not its tycon,
264 -- because one should import the class to get the binding for
266 ; sc_sel_names <- mapM (newImplicitBinder class_name . mkSuperDictSelOcc)
268 -- We number off the superclass selectors, 1, 2, 3 etc so that we
269 -- can construct names for the selectors. Thus
270 -- class (C a, C b) => D a b where ...
271 -- gives superclass selectors
273 -- (We used to call them D_C, but now we can have two different
274 -- superclasses both called C!)
276 ; fixM (\ rec_clas -> do { -- Only name generation inside loop
278 let { rec_tycon = classTyCon rec_clas
279 ; op_tys = [ty | (_,_,ty) <- sig_stuff]
280 ; sc_tys = mkPredTys sc_theta
281 ; dict_component_tys = sc_tys ++ op_tys
282 ; sc_sel_ids = [mkDictSelId sc_name rec_clas | sc_name <- sc_sel_names]
283 ; op_items = [ (mkDictSelId op_name rec_clas, dm_info)
284 | (op_name, dm_info, _) <- sig_stuff ] }
285 -- Build the selector id and default method id
287 ; dict_con <- buildDataCon datacon_name
288 False -- Not declared infix
289 (map (const NotMarkedStrict) dict_component_tys)
290 [{- No labelled fields -}]
291 tvs [{- no existentials -}]
292 [{- No equalities -}] [{-No context-}]
296 ; rhs <- case dict_component_tys of
297 [rep_ty] -> mkNewTyConRhs tycon_name rec_tycon dict_con
298 other -> return (mkDataTyConRhs [dict_con])
300 ; let { clas_kind = mkArrowKinds (map tyVarKind tvs) liftedTypeKind
302 ; tycon = mkClassTyCon tycon_name clas_kind tvs
303 rhs rec_clas tc_isrec
304 -- A class can be recursive, and in the case of newtypes
305 -- this matters. For example
306 -- class C a where { op :: C b => a -> b -> Int }
307 -- Because C has only one operation, it is represented by
308 -- a newtype, and it should be a *recursive* newtype.
309 -- [If we don't make it a recursive newtype, we'll expand the
310 -- newtype like a synonym, but that will lead to an infinite
312 ; atTyCons = [tycon | ATyCon tycon <- ats]
314 ; return (mkClass class_name tvs fds
315 sc_theta sc_sel_ids atTyCons op_items