--- a/src/HOLCF/Tools/Domain/domain_library.ML Wed Dec 02 11:29:49 2009 +0100
+++ b/src/HOLCF/Tools/Domain/domain_library.ML Fri Dec 04 12:17:43 2009 +0100
@@ -230,7 +230,7 @@
val mk_arg = I;
fun rec_of ((_,dtyp),_,_) =
- case dtyp of DatatypeAux.DtRec i => i | _ => ~1;
+ case dtyp of Datatype_Aux.DtRec i => i | _ => ~1;
(* FIXME: what about indirect recursion? *)
fun is_lazy arg = fst (first arg);
@@ -246,12 +246,12 @@
(* ----- combinators for making dtyps ----- *)
-fun mk_uD T = DatatypeAux.DtType(@{type_name "u"}, [T]);
-fun mk_sprodD (T, U) = DatatypeAux.DtType(@{type_name "**"}, [T, U]);
-fun mk_ssumD (T, U) = DatatypeAux.DtType(@{type_name "++"}, [T, U]);
-fun mk_liftD T = DatatypeAux.DtType(@{type_name "lift"}, [T]);
-val unitD = DatatypeAux.DtType(@{type_name "unit"}, []);
-val boolD = DatatypeAux.DtType(@{type_name "bool"}, []);
+fun mk_uD T = Datatype_Aux.DtType(@{type_name "u"}, [T]);
+fun mk_sprodD (T, U) = Datatype_Aux.DtType(@{type_name "**"}, [T, U]);
+fun mk_ssumD (T, U) = Datatype_Aux.DtType(@{type_name "++"}, [T, U]);
+fun mk_liftD T = Datatype_Aux.DtType(@{type_name "lift"}, [T]);
+val unitD = Datatype_Aux.DtType(@{type_name "unit"}, []);
+val boolD = Datatype_Aux.DtType(@{type_name "bool"}, []);
val oneD = mk_liftD unitD;
val trD = mk_liftD boolD;
fun big_sprodD ds = case ds of [] => oneD | _ => foldr1 mk_sprodD ds;