reverted 3e1d230f1c00 -- pervasiveness is useful, cf. Coinductive_Nat in the AFP
1 (* Title: HOL/BNF/Tools/bnf_fp_def_sugar.ML
2 Author: Jasmin Blanchette, TU Muenchen
5 Sugared datatype and codatatype constructions.
8 signature BNF_FP_DEF_SUGAR =
12 fp: BNF_FP_Util.fp_kind,
14 pre_bnfs: BNF_Def.bnf list,
15 nested_bnfs: BNF_Def.bnf list,
16 nesting_bnfs: BNF_Def.bnf list,
17 fp_res: BNF_FP_Util.fp_result,
18 ctr_defss: thm list list,
19 ctr_sugars: Ctr_Sugar.ctr_sugar list,
20 co_iterss: term list list,
23 co_iter_thmsss: thm list list list,
24 disc_co_itersss: thm list list list,
25 sel_co_iterssss: thm list list list list};
27 val of_fp_sugar: (fp_sugar -> 'a list) -> fp_sugar -> 'a
28 val eq_fp_sugar: fp_sugar * fp_sugar -> bool
29 val morph_fp_sugar: morphism -> fp_sugar -> fp_sugar
30 val transfer_fp_sugar: Proof.context -> fp_sugar -> fp_sugar
31 val fp_sugar_of: Proof.context -> string -> fp_sugar option
32 val fp_sugars_of: Proof.context -> fp_sugar list
34 val co_induct_of: 'a list -> 'a
35 val strong_co_induct_of: 'a list -> 'a
37 val tvar_subst: theory -> typ list -> typ list -> ((string * int) * typ) list
38 val exists_subtype_in: typ list -> typ -> bool
39 val flat_rec_arg_args: 'a list list -> 'a list
40 val flat_corec_preds_predsss_gettersss: 'a list -> 'a list list list -> 'a list list list ->
42 val mk_co_iter: theory -> BNF_FP_Util.fp_kind -> typ -> typ list -> term -> term
43 val nesty_bnfs: Proof.context -> typ list list list -> typ list -> BNF_Def.bnf list
46 (thm list * thm * Args.src list)
47 * (thm list list * thm list list * Args.src list)
49 val morph_lfp_sugar_thms: morphism -> lfp_sugar_thms -> lfp_sugar_thms
50 val transfer_lfp_sugar_thms: Proof.context -> lfp_sugar_thms -> lfp_sugar_thms
53 ((thm list * thm) list * Args.src list)
54 * (thm list list * thm list list * Args.src list)
55 * (thm list list * thm list list * Args.src list)
56 * (thm list list * thm list list * Args.src list)
57 * (thm list list list * thm list list list * Args.src list)
59 val morph_gfp_sugar_thms: morphism -> gfp_sugar_thms -> gfp_sugar_thms
60 val transfer_gfp_sugar_thms: Proof.context -> gfp_sugar_thms -> gfp_sugar_thms
62 val mk_co_iters_prelims: BNF_FP_Util.fp_kind -> typ list list list -> typ list -> typ list ->
63 int list -> int list list -> term list list -> Proof.context ->
65 * (typ list list * typ list list list list * term list list
66 * term list list list list) list option
67 * (string * term list * term list list
68 * ((term list list * term list list list) * (typ list * typ list list)) list) option)
70 val mk_iter_fun_arg_types: typ list list list -> int list -> int list list -> term ->
71 typ list list list list
72 val mk_coiter_fun_arg_types: typ list list list -> typ list -> int list -> term ->
74 * (typ list list list list * typ list list list * typ list list list list * typ list)
75 val define_iters: string list ->
76 (typ list list * typ list list list list * term list list * term list list list list) list ->
77 (string -> binding) -> typ list -> typ list -> term list -> Proof.context ->
78 (term list * thm list) * Proof.context
79 val define_coiters: string list -> string * term list * term list list
80 * ((term list list * term list list list) * (typ list * typ list list)) list ->
81 (string -> binding) -> typ list -> typ list -> term list -> Proof.context ->
82 (term list * thm list) * Proof.context
83 val derive_induct_iters_thms_for_types: BNF_Def.bnf list ->
84 (typ list list * typ list list list list * term list list * term list list list list) list ->
85 thm -> thm list list -> BNF_Def.bnf list -> BNF_Def.bnf list -> typ list -> typ list ->
86 typ list -> typ list list list -> term list list -> thm list list -> term list list ->
87 thm list list -> local_theory -> lfp_sugar_thms
88 val derive_coinduct_coiters_thms_for_types: BNF_Def.bnf list ->
89 string * term list * term list list * ((term list list * term list list list)
90 * (typ list * typ list list)) list ->
91 thm -> thm list -> thm list -> thm list list -> BNF_Def.bnf list -> typ list -> typ list ->
92 typ list -> typ list list list -> int list list -> int list list -> int list -> thm list list ->
93 Ctr_Sugar.ctr_sugar list -> term list list -> thm list list -> (thm list -> thm list) ->
94 local_theory -> gfp_sugar_thms
95 val co_datatypes: BNF_FP_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
96 binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
97 BNF_Def.bnf list -> local_theory -> BNF_FP_Util.fp_result * local_theory) ->
98 (bool * bool) * (((((binding * (typ * sort)) list * binding) * (binding * binding)) * mixfix) *
99 ((((binding * binding) * (binding * typ) list) * (binding * term) list) *
100 mixfix) list) list ->
101 local_theory -> local_theory
102 val parse_co_datatype_cmd: BNF_FP_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
103 binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
104 BNF_Def.bnf list -> local_theory -> BNF_FP_Util.fp_result * local_theory) ->
105 (local_theory -> local_theory) parser
108 structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR =
116 open BNF_FP_Def_Sugar_Tactics
125 nested_bnfs: bnf list,
126 nesting_bnfs: bnf list,
128 ctr_defss: thm list list,
129 ctr_sugars: ctr_sugar list,
130 co_iterss: term list list,
131 mapss: thm list list,
132 co_inducts: thm list,
133 co_iter_thmsss: thm list list list,
134 disc_co_itersss: thm list list list,
135 sel_co_iterssss: thm list list list list};
137 fun of_fp_sugar f (fp_sugar as ({index, ...}: fp_sugar)) = nth (f fp_sugar) index;
139 fun eq_fp_sugar ({T = T1, fp = fp1, index = index1, fp_res = fp_res1, ...} : fp_sugar,
140 {T = T2, fp = fp2, index = index2, fp_res = fp_res2, ...} : fp_sugar) =
141 T1 = T2 andalso fp1 = fp2 andalso index1 = index2 andalso eq_fp_result (fp_res1, fp_res2);
143 fun morph_fp_sugar phi ({T, fp, index, pre_bnfs, nested_bnfs, nesting_bnfs, fp_res, ctr_defss,
144 ctr_sugars, co_iterss, mapss, co_inducts, co_iter_thmsss, disc_co_itersss, sel_co_iterssss}
146 {T = Morphism.typ phi T, fp = fp, index = index, pre_bnfs = map (morph_bnf phi) pre_bnfs,
147 nested_bnfs = map (morph_bnf phi) nested_bnfs, nesting_bnfs = map (morph_bnf phi) nesting_bnfs,
148 fp_res = morph_fp_result phi fp_res,
149 ctr_defss = map (map (Morphism.thm phi)) ctr_defss,
150 ctr_sugars = map (morph_ctr_sugar phi) ctr_sugars,
151 co_iterss = map (map (Morphism.term phi)) co_iterss,
152 mapss = map (map (Morphism.thm phi)) mapss,
153 co_inducts = map (Morphism.thm phi) co_inducts,
154 co_iter_thmsss = map (map (map (Morphism.thm phi))) co_iter_thmsss,
155 disc_co_itersss = map (map (map (Morphism.thm phi))) disc_co_itersss,
156 sel_co_iterssss = map (map (map (map (Morphism.thm phi)))) sel_co_iterssss};
158 val transfer_fp_sugar =
159 morph_fp_sugar o Morphism.thm_morphism o Thm.transfer o Proof_Context.theory_of;
161 structure Data = Generic_Data
163 type T = fp_sugar Symtab.table;
164 val empty = Symtab.empty;
166 val merge = Symtab.merge eq_fp_sugar;
169 fun fp_sugar_of ctxt =
170 Symtab.lookup (Data.get (Context.Proof ctxt))
171 #> Option.map (transfer_fp_sugar ctxt);
173 fun fp_sugars_of ctxt =
174 Symtab.fold (cons o transfer_fp_sugar ctxt o snd) (Data.get (Context.Proof ctxt)) [];
176 fun co_induct_of (i :: _) = i;
177 fun strong_co_induct_of [_, s] = s;
179 (* TODO: register "sum" and "prod" as datatypes to enable N2M reduction for them *)
181 fun register_fp_sugar key fp_sugar =
182 Local_Theory.declaration {syntax = false, pervasive = true}
183 (fn phi => Data.map (Symtab.default (key, morph_fp_sugar phi fp_sugar)));
185 fun register_fp_sugars fp pre_bnfs nested_bnfs nesting_bnfs (fp_res as {Ts, ...}) ctr_defss
186 ctr_sugars co_iterss mapss co_inducts co_iter_thmsss disc_co_itersss sel_co_iterssss lthy =
188 |> fold (fn T as Type (s, _) => fn (kk, lthy) => (kk + 1,
189 register_fp_sugar s {T = T, fp = fp, index = kk, pre_bnfs = pre_bnfs,
190 nested_bnfs = nested_bnfs, nesting_bnfs = nesting_bnfs, fp_res = fp_res,
191 ctr_defss = ctr_defss, ctr_sugars = ctr_sugars, co_iterss = co_iterss, mapss = mapss,
192 co_inducts = co_inducts, co_iter_thmsss = co_iter_thmsss, disc_co_itersss = disc_co_itersss,
193 sel_co_iterssss = sel_co_iterssss}
197 (* This function could produce clashes in contrived examples (e.g., "x.A", "x.x_A", "y.A"). *)
198 fun quasi_unambiguous_case_names names =
200 val ps = map (`Long_Name.base_name) names;
201 val dups = Library.duplicates (op =) (map fst ps);
203 let val ss = space_explode Long_Name.separator s in
204 space_implode "_" (drop (length ss - 2) ss)
207 map (fn (base, full) => if member (op =) dups base then underscore full else base) ps
210 val id_def = @{thm id_def};
211 val mp_conj = @{thm mp_conj};
213 val nitpicksimp_attrs = @{attributes [nitpick_simp]};
214 val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs;
215 val simp_attrs = @{attributes [simp]};
217 fun tvar_subst thy Ts Us =
218 Vartab.fold (cons o apsnd snd) (fold (Sign.typ_match thy) (Ts ~~ Us) Vartab.empty) [];
220 val exists_subtype_in = Term.exists_subtype o member (op =);
222 val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
224 fun flat_rec_arg_args xss =
225 (* FIXME (once the old datatype package is phased out): The first line below gives the preferred
226 order. The second line is for compatibility with the old datatype package. *)
230 map hd xss @ maps tl xss;
232 fun flat_corec_predss_getterss qss fss = maps (op @) (qss ~~ fss);
234 fun flat_corec_preds_predsss_gettersss [] [qss] [fss] = flat_corec_predss_getterss qss fss
235 | flat_corec_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
236 p :: flat_corec_predss_getterss qss fss @ flat_corec_preds_predsss_gettersss ps qsss fsss;
238 fun mk_tupled_fun x f xs =
239 if xs = [x] then f else HOLogic.tupled_lambda x (Term.list_comb (f, xs));
241 fun mk_uncurried2_fun f xss =
242 mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat_rec_arg_args xss);
244 fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) =
245 Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1));
247 fun flip_rels lthy n thm =
249 val Rs = Term.add_vars (prop_of thm) [];
250 val Rs' = rev (drop (length Rs - n) Rs);
251 val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs';
253 Drule.cterm_instantiate cRs thm
256 fun mk_ctor_or_dtor get_T Ts t =
257 let val Type (_, Ts0) = get_T (fastype_of t) in
258 Term.subst_atomic_types (Ts0 ~~ Ts) t
261 val mk_ctor = mk_ctor_or_dtor range_type;
262 val mk_dtor = mk_ctor_or_dtor domain_type;
264 fun mk_co_iter thy fp fpT Cs t =
266 val (f_Cs, Type (_, [prebody, body])) = strip_fun_type (fastype_of t);
267 val fpT0 = fp_case fp prebody body;
268 val Cs0 = distinct (op =) (map (fp_case fp body_type domain_type) f_Cs);
269 val rho = tvar_subst thy (fpT0 :: Cs0) (fpT :: Cs);
271 Term.subst_TVars rho t
274 fun mk_co_iters thy fp fpTs Cs ts0 =
276 val nn = length fpTs;
278 map ((fp = Greatest_FP ? swap) o dest_funT o snd o strip_typeN nn o fastype_of) ts0
280 val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs);
282 map (Term.subst_TVars rho) ts0
285 val mk_fp_iter_fun_types = binder_fun_types o fastype_of;
287 fun unzip_recT (Type (@{type_name prod}, _)) T = [T]
288 | unzip_recT _ (Type (@{type_name prod}, Ts)) = Ts
289 | unzip_recT _ T = [T];
291 fun unzip_corecT (Type (@{type_name sum}, _)) T = [T]
292 | unzip_corecT _ (Type (@{type_name sum}, Ts)) = Ts
293 | unzip_corecT _ T = [T];
295 fun liveness_of_fp_bnf n bnf =
296 (case T_of_bnf bnf of
297 Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts
298 | _ => replicate n false);
300 fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
302 fun merge_type_arg T T' = if T = T' then T else cannot_merge_types ();
304 fun merge_type_args (As, As') =
305 if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types ();
307 fun reassoc_conjs thm =
308 reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]})
311 fun type_args_named_constrained_of ((((ncAs, _), _), _), _) = ncAs;
312 fun type_binding_of ((((_, b), _), _), _) = b;
313 fun map_binding_of (((_, (b, _)), _), _) = b;
314 fun rel_binding_of (((_, (_, b)), _), _) = b;
315 fun mixfix_of ((_, mx), _) = mx;
316 fun ctr_specs_of (_, ctr_specs) = ctr_specs;
318 fun disc_of ((((disc, _), _), _), _) = disc;
319 fun ctr_of ((((_, ctr), _), _), _) = ctr;
320 fun args_of (((_, args), _), _) = args;
321 fun defaults_of ((_, ds), _) = ds;
322 fun ctr_mixfix_of (_, mx) = mx;
324 fun add_nesty_bnf_names Us =
326 fun add (Type (s, Ts)) ss =
327 let val (needs, ss') = fold_map add Ts ss in
328 if exists I needs then (true, insert (op =) s ss') else (false, ss')
330 | add T ss = (member (op =) Us T, ss);
333 fun nesty_bnfs ctxt ctr_Tsss Us =
334 map_filter (bnf_of ctxt) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_Tsss []);
336 fun indexify proj xs f p = f (find_index (curry (op =) (proj p)) xs) p;
338 type lfp_sugar_thms =
339 (thm list * thm * Args.src list)
340 * (thm list list * thm list list * Args.src list)
342 fun morph_lfp_sugar_thms phi ((inducts, induct, induct_attrs), (foldss, recss, iter_attrs)) =
343 ((map (Morphism.thm phi) inducts, Morphism.thm phi induct, induct_attrs),
344 (map (map (Morphism.thm phi)) foldss, map (map (Morphism.thm phi)) recss, iter_attrs));
346 val transfer_lfp_sugar_thms =
347 morph_lfp_sugar_thms o Morphism.thm_morphism o Thm.transfer o Proof_Context.theory_of;
349 type gfp_sugar_thms =
350 ((thm list * thm) list * Args.src list)
351 * (thm list list * thm list list * Args.src list)
352 * (thm list list * thm list list * Args.src list)
353 * (thm list list * thm list list * Args.src list)
354 * (thm list list list * thm list list list * Args.src list);
356 fun morph_gfp_sugar_thms phi ((coinducts_pairs, coinduct_attrs),
357 (unfoldss, corecss, coiter_attrs), (disc_unfoldss, disc_corecss, disc_iter_attrs),
358 (disc_unfold_iffss, disc_corec_iffss, disc_iter_iff_attrs),
359 (sel_unfoldsss, sel_corecsss, sel_iter_attrs)) =
360 ((map (apfst (map (Morphism.thm phi)) o apsnd (Morphism.thm phi)) coinducts_pairs,
362 (map (map (Morphism.thm phi)) unfoldss, map (map (Morphism.thm phi)) corecss, coiter_attrs),
363 (map (map (Morphism.thm phi)) disc_unfoldss, map (map (Morphism.thm phi)) disc_corecss,
365 (map (map (Morphism.thm phi)) disc_unfold_iffss, map (map (Morphism.thm phi)) disc_corec_iffss,
366 disc_iter_iff_attrs),
367 (map (map (map (Morphism.thm phi))) sel_unfoldsss,
368 map (map (map (Morphism.thm phi))) sel_corecsss, sel_iter_attrs));
370 val transfer_gfp_sugar_thms =
371 morph_gfp_sugar_thms o Morphism.thm_morphism o Thm.transfer o Proof_Context.theory_of;
373 fun mk_iter_fun_arg_types0 n ms = map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type;
375 fun mk_iter_fun_arg_types ctr_Tsss ns mss =
377 #> map3 mk_iter_fun_arg_types0 ns mss
378 #> map2 (map2 (map2 unzip_recT)) ctr_Tsss;
380 fun mk_iters_args_types ctr_Tsss Cs ns mss ctor_iter_fun_Tss lthy =
382 val Css = map2 replicate ns Cs;
383 val y_Tsss = map3 mk_iter_fun_arg_types0 ns mss (map un_fold_of ctor_iter_fun_Tss);
384 val g_Tss = map2 (fn C => map (fn y_Ts => y_Ts ---> C)) Cs y_Tsss;
386 val ((gss, ysss), lthy) =
388 |> mk_Freess "f" g_Tss
389 ||>> mk_Freesss "x" y_Tsss;
391 val y_Tssss = map (map (map single)) y_Tsss;
392 val yssss = map (map (map single)) ysss;
395 map4 (fn n => fn ms => fn ctr_Tss => fn ctor_iter_fun_Ts =>
396 map3 (fn m => fn ctr_Ts => fn ctor_iter_fun_T =>
397 map2 unzip_recT ctr_Ts (dest_tupleT m ctor_iter_fun_T))
398 ms ctr_Tss (dest_sumTN_balanced n (domain_type (co_rec_of ctor_iter_fun_Ts))))
399 ns mss ctr_Tsss ctor_iter_fun_Tss;
401 val z_Tsss' = map (map flat_rec_arg_args) z_Tssss;
402 val h_Tss = map2 (map2 (curry (op --->))) z_Tsss' Css;
404 val hss = map2 (map2 retype_free) h_Tss gss;
405 val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss;
406 val (zssss_tl, lthy) =
408 |> mk_Freessss "y" (map (map (map tl)) z_Tssss);
409 val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl;
411 ([(g_Tss, y_Tssss, gss, yssss), (h_Tss, z_Tssss, hss, zssss)], lthy)
414 fun mk_coiter_fun_arg_types0 ctr_Tsss Cs ns fun_Ts =
416 (*avoid "'a itself" arguments in coiterators*)
417 fun repair_arity [[]] = [[@{typ unit}]]
418 | repair_arity Tss = Tss;
420 val ctr_Tsss' = map repair_arity ctr_Tsss;
421 val f_sum_prod_Ts = map range_type fun_Ts;
422 val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
423 val f_Tsss = map2 (map2 (dest_tupleT o length)) ctr_Tsss' f_prod_Tss;
424 val f_Tssss = map3 (fn C => map2 (map2 (map (curry (op -->) C) oo unzip_corecT)))
426 val q_Tssss = map (map (map (fn [_] => [] | [_, T] => [mk_pred1T (domain_type T)]))) f_Tssss;
428 (q_Tssss, f_Tsss, f_Tssss, f_sum_prod_Ts)
431 fun mk_coiter_p_pred_types Cs ns = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs;
433 fun mk_coiter_fun_arg_types ctr_Tsss Cs ns dtor_coiter =
434 (mk_coiter_p_pred_types Cs ns,
435 mk_fp_iter_fun_types dtor_coiter |> mk_coiter_fun_arg_types0 ctr_Tsss Cs ns);
437 fun mk_coiters_args_types ctr_Tsss Cs ns dtor_coiter_fun_Tss lthy =
439 val p_Tss = mk_coiter_p_pred_types Cs ns;
441 fun mk_types get_Ts =
443 val fun_Ts = map get_Ts dtor_coiter_fun_Tss;
444 val (q_Tssss, f_Tsss, f_Tssss, f_sum_prod_Ts) = mk_coiter_fun_arg_types0 ctr_Tsss Cs ns fun_Ts;
445 val pf_Tss = map3 flat_corec_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
447 (q_Tssss, f_Tsss, f_Tssss, (f_sum_prod_Ts, pf_Tss))
450 val (r_Tssss, g_Tsss, g_Tssss, unfold_types) = mk_types un_fold_of;
451 val (s_Tssss, h_Tsss, h_Tssss, corec_types) = mk_types co_rec_of;
453 val ((((Free (z, _), cs), pss), gssss), lthy) =
455 |> yield_singleton (mk_Frees "z") dummyT
457 ||>> mk_Freess "p" p_Tss
458 ||>> mk_Freessss "g" g_Tssss;
459 val rssss = map (map (map (fn [] => []))) r_Tssss;
461 val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss;
462 val ((sssss, hssss_tl), lthy) =
464 |> mk_Freessss "q" s_Tssss
465 ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
466 val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
468 val cpss = map2 (map o rapp) cs pss;
470 fun build_sum_inj mk_inj = build_map lthy (uncurry mk_inj o dest_sumT o snd);
472 fun build_dtor_coiter_arg _ [] [cf] = cf
473 | build_dtor_coiter_arg T [cq] [cf, cf'] =
474 mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf)
475 (build_sum_inj Inr_const (fastype_of cf', T) $ cf');
477 fun mk_args qssss fssss f_Tsss =
479 val pfss = map3 flat_corec_preds_predsss_gettersss pss qssss fssss;
480 val cqssss = map2 (map o map o map o rapp) cs qssss;
481 val cfssss = map2 (map o map o map o rapp) cs fssss;
482 val cqfsss = map3 (map3 (map3 build_dtor_coiter_arg)) f_Tsss cqssss cfssss;
483 in (pfss, cqfsss) end;
485 val unfold_args = mk_args rssss gssss g_Tsss;
486 val corec_args = mk_args sssss hssss h_Tsss;
488 ((z, cs, cpss, [(unfold_args, unfold_types), (corec_args, corec_types)]), lthy)
491 fun mk_co_iters_prelims fp ctr_Tsss fpTs Cs ns mss xtor_co_iterss0 lthy =
493 val thy = Proof_Context.theory_of lthy;
495 val (xtor_co_iter_fun_Tss, xtor_co_iterss) =
496 map (mk_co_iters thy fp fpTs Cs #> `(mk_fp_iter_fun_types o hd)) (transpose xtor_co_iterss0)
497 |> apsnd transpose o apfst transpose o split_list;
499 val ((iters_args_types, coiters_args_types), lthy') =
500 if fp = Least_FP then
501 mk_iters_args_types ctr_Tsss Cs ns mss xtor_co_iter_fun_Tss lthy |>> (rpair NONE o SOME)
503 mk_coiters_args_types ctr_Tsss Cs ns xtor_co_iter_fun_Tss lthy |>> (pair NONE o SOME)
505 ((xtor_co_iterss, iters_args_types, coiters_args_types), lthy')
508 fun mk_iter_body ctor_iter fss xssss =
509 Term.list_comb (ctor_iter, map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss);
511 fun mk_preds_getterss_join c cps sum_prod_T cqfss =
512 let val n = length cqfss in
513 Term.lambda c (mk_IfN sum_prod_T cps
514 (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)))
517 fun mk_coiter_body cs cpss f_sum_prod_Ts cqfsss dtor_coiter =
518 Term.list_comb (dtor_coiter, map4 mk_preds_getterss_join cs cpss f_sum_prod_Ts cqfsss);
520 fun define_co_iters fp fpT Cs binding_specs lthy0 =
522 val thy = Proof_Context.theory_of lthy0;
524 val maybe_conceal_def_binding = Thm.def_binding
525 #> Config.get lthy0 bnf_note_all = false ? Binding.conceal;
527 val ((csts, defs), (lthy', lthy)) = lthy0
528 |> apfst split_list o fold_map (fn (b, spec) =>
529 Specification.definition (SOME (b, NONE, NoSyn), ((maybe_conceal_def_binding b, []), spec))
530 #>> apsnd snd) binding_specs
531 ||> `Local_Theory.restore;
533 val phi = Proof_Context.export_morphism lthy lthy';
535 val csts' = map (mk_co_iter thy fp fpT Cs o Morphism.term phi) csts;
536 val defs' = map (Morphism.thm phi) defs;
538 ((csts', defs'), lthy')
541 fun define_iters iterNs iter_args_typess' mk_binding fpTs Cs ctor_iters lthy =
543 val nn = length fpTs;
545 val fpT_to_C as Type (_, [fpT, _]) = snd (strip_typeN nn (fastype_of (hd ctor_iters)));
547 fun generate_iter suf (f_Tss, _, fss, xssss) ctor_iter =
549 val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
550 val b = mk_binding suf;
552 mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of b, res_T)),
553 mk_iter_body ctor_iter fss xssss);
556 define_co_iters Least_FP fpT Cs (map3 generate_iter iterNs iter_args_typess' ctor_iters) lthy
559 fun define_coiters coiterNs (_, cs, cpss, coiter_args_typess') mk_binding fpTs Cs dtor_coiters
562 val nn = length fpTs;
564 val C_to_fpT as Type (_, [_, fpT]) = snd (strip_typeN nn (fastype_of (hd dtor_coiters)));
566 fun generate_coiter suf ((pfss, cqfsss), (f_sum_prod_Ts, pf_Tss)) dtor_coiter =
568 val res_T = fold_rev (curry (op --->)) pf_Tss C_to_fpT;
569 val b = mk_binding suf;
571 mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of b, res_T)),
572 mk_coiter_body cs cpss f_sum_prod_Ts cqfsss dtor_coiter);
575 define_co_iters Greatest_FP fpT Cs
576 (map3 generate_coiter coiterNs coiter_args_typess' dtor_coiters) lthy
579 fun derive_induct_iters_thms_for_types pre_bnfs [fold_args_types, rec_args_types] ctor_induct
580 ctor_iter_thmss nesting_bnfs nested_bnfs fpTs Cs Xs ctrXs_Tsss ctrss ctr_defss iterss iter_defss
583 val iterss' = transpose iterss;
584 val iter_defss' = transpose iter_defss;
586 val [folds, recs] = iterss';
587 val [fold_defs, rec_defs] = iter_defss';
589 val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss;
591 val nn = length pre_bnfs;
592 val ns = map length ctr_Tsss;
593 val mss = map (map length) ctr_Tsss;
595 val pre_map_defs = map map_def_of_bnf pre_bnfs;
596 val pre_set_defss = map set_defs_of_bnf pre_bnfs;
597 val nesting_map_idents = map (unfold_thms lthy [id_def] o map_id0_of_bnf) nesting_bnfs;
598 val nested_map_idents = map (unfold_thms lthy [id_def] o map_id0_of_bnf) nested_bnfs;
599 val nested_set_maps = maps set_map_of_bnf nested_bnfs;
601 val fp_b_names = map base_name_of_typ fpTs;
603 val ((((ps, ps'), xsss), us'), names_lthy) =
605 |> mk_Frees' "P" (map mk_pred1T fpTs)
606 ||>> mk_Freesss "x" ctr_Tsss
607 ||>> Variable.variant_fixes fp_b_names;
609 val us = map2 (curry Free) us' fpTs;
611 fun mk_sets_nested bnf =
613 val Type (T_name, Us) = T_of_bnf bnf;
614 val lives = lives_of_bnf bnf;
615 val sets = sets_of_bnf bnf;
617 (case find_index (curry (op =) U) lives of
621 (T_name, map mk_set Us)
624 val setss_nested = map mk_sets_nested nested_bnfs;
626 val (induct_thms, induct_thm) =
629 let val Type (_, Ts0) = domain_type (fastype_of t) in
630 Term.subst_atomic_types (Ts0 ~~ Ts) t
633 fun mk_raw_prem_prems _ (x as Free (_, Type _)) (X as TFree _) =
634 [([], (find_index (curry (op =) X) Xs + 1, x))]
635 | mk_raw_prem_prems names_lthy (x as Free (s, Type (T_name, Ts0))) (Type (_, Xs_Ts0)) =
636 (case AList.lookup (op =) setss_nested T_name of
640 val (Xs_Ts, (Ts, raw_sets)) =
641 filter (exists_subtype_in Xs o fst) (Xs_Ts0 ~~ (Ts0 ~~ raw_sets0))
642 |> split_list ||> split_list;
643 val sets = map (mk_set Ts0) raw_sets;
644 val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
645 val xysets = map (pair x) (ys ~~ sets);
646 val ppremss = map2 (mk_raw_prem_prems names_lthy') ys Xs_Ts;
648 flat (map2 (map o apfst o cons) xysets ppremss)
650 | mk_raw_prem_prems _ _ _ = [];
652 fun close_prem_prem xs t =
653 fold_rev Logic.all (map Free (drop (nn + length xs)
654 (rev (Term.add_frees t (map dest_Free xs @ ps'))))) t;
656 fun mk_prem_prem xs (xysets, (j, x)) =
657 close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) =>
658 HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets,
659 HOLogic.mk_Trueprop (nth ps (j - 1) $ x)));
661 fun mk_raw_prem phi ctr ctr_Ts ctrXs_Ts =
663 val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
664 val pprems = flat (map2 (mk_raw_prem_prems names_lthy') xs ctrXs_Ts);
665 in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end;
667 fun mk_prem (xs, raw_pprems, concl) =
668 fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl));
670 val raw_premss = map4 (map3 o mk_raw_prem) ps ctrss ctr_Tsss ctrXs_Tsss;
673 Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss,
674 HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us)));
676 val kksss = map (map (map (fst o snd) o #2)) raw_premss;
678 val ctor_induct' = ctor_induct OF (map mk_sumEN_tupled_balanced mss);
681 Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
682 mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' nested_set_maps
684 |> singleton (Proof_Context.export names_lthy lthy)
685 |> Thm.close_derivation;
690 val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss);
691 val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases));
693 val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
695 fun mk_iter_thmss (_, x_Tssss, fss, _) iters iter_defs ctor_iter_thms =
697 val fiters = map (lists_bmoc fss) iters;
699 fun mk_goal fss fiter xctr f xs fxs =
700 fold_rev (fold_rev Logic.all) (xs :: fss)
701 (mk_Trueprop_eq (fiter $ xctr, Term.list_comb (f, fxs)));
703 fun maybe_tick (T, U) u f =
704 if try (fst o HOLogic.dest_prodT) U = SOME T then
705 Term.lambda u (HOLogic.mk_prod (u, f $ u))
709 fun build_iter (x as Free (_, T)) U =
713 build_map lthy (indexify (perhaps (try (snd o HOLogic.dest_prodT)) o snd) Cs
714 (fn kk => fn TU => maybe_tick TU (nth us kk) (nth fiters kk))) (T, U) $ x;
716 val fxsss = map2 (map2 (flat_rec_arg_args oo map2 (map o build_iter))) xsss x_Tssss;
718 val goalss = map5 (map4 o mk_goal fss) fiters xctrss fss xsss fxsss;
721 map2 (map o mk_iter_tac pre_map_defs (nested_map_idents @ nesting_map_idents) iter_defs)
722 ctor_iter_thms ctr_defss;
725 Goal.prove_sorry lthy [] [] goal (tac o #context)
726 |> Thm.close_derivation;
728 map2 (map2 prove) goalss tacss
731 val fold_thmss = mk_iter_thmss fold_args_types folds fold_defs (map un_fold_of ctor_iter_thmss);
732 val rec_thmss = mk_iter_thmss rec_args_types recs rec_defs (map co_rec_of ctor_iter_thmss);
734 ((induct_thms, induct_thm, [induct_case_names_attr]),
735 (fold_thmss, rec_thmss, code_nitpicksimp_attrs @ simp_attrs))
738 fun derive_coinduct_coiters_thms_for_types pre_bnfs (z, cs, cpss,
739 coiters_args_types as [((pgss, crgsss), _), ((phss, cshsss), _)])
740 dtor_coinduct dtor_injects dtor_ctors dtor_coiter_thmss nesting_bnfs fpTs Cs Xs ctrXs_Tsss kss
741 mss ns ctr_defss (ctr_sugars : ctr_sugar list) coiterss coiter_defss export_args lthy =
743 fun mk_ctor_dtor_coiter_thm dtor_inject dtor_ctor coiter =
744 iffD1 OF [dtor_inject, trans OF [coiter, dtor_ctor RS sym]];
746 val ctor_dtor_coiter_thmss =
747 map3 (map oo mk_ctor_dtor_coiter_thm) dtor_injects dtor_ctors dtor_coiter_thmss;
749 val coiterss' = transpose coiterss;
750 val coiter_defss' = transpose coiter_defss;
752 val [unfold_defs, corec_defs] = coiter_defss';
754 val nn = length pre_bnfs;
756 val pre_map_defs = map map_def_of_bnf pre_bnfs;
757 val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
758 val nesting_map_idents = map (unfold_thms lthy [id_def] o map_id0_of_bnf) nesting_bnfs;
759 val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs;
761 val fp_b_names = map base_name_of_typ fpTs;
763 val ctrss = map #ctrs ctr_sugars;
764 val discss = map #discs ctr_sugars;
765 val selsss = map #selss ctr_sugars;
766 val exhausts = map #exhaust ctr_sugars;
767 val disc_thmsss = map #disc_thmss ctr_sugars;
768 val discIss = map #discIs ctr_sugars;
769 val sel_thmsss = map #sel_thmss ctr_sugars;
771 val (((rs, us'), vs'), names_lthy) =
773 |> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs)
774 ||>> Variable.variant_fixes fp_b_names
775 ||>> Variable.variant_fixes (map (suffix "'") fp_b_names);
777 val us = map2 (curry Free) us' fpTs;
778 val udiscss = map2 (map o rapp) us discss;
779 val uselsss = map2 (map o map o rapp) us selsss;
781 val vs = map2 (curry Free) vs' fpTs;
782 val vdiscss = map2 (map o rapp) vs discss;
783 val vselsss = map2 (map o map o rapp) vs selsss;
785 val coinduct_thms_pairs =
787 val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs;
788 val uv_eqs = map2 (curry HOLogic.mk_eq) us vs;
790 map4 (fn u => fn v => fn uvr => fn uv_eq =>
791 fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs;
793 fun build_the_rel rs' T Xs_T =
794 build_rel lthy (fn (_, X) => nth rs' (find_index (curry (op =) X) Xs)) (T, Xs_T)
795 |> Term.subst_atomic_types (Xs ~~ fpTs);
797 fun build_rel_app rs' usel vsel Xs_T =
798 fold rapp [usel, vsel] (build_the_rel rs' (fastype_of usel) Xs_T);
800 fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels ctrXs_Ts =
801 (if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @
805 [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc],
806 Library.foldr1 HOLogic.mk_conj (map3 (build_rel_app rs') usels vsels ctrXs_Ts))]);
808 fun mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss =
809 Library.foldr1 HOLogic.mk_conj (flat (map6 (mk_prem_ctr_concls rs' n)
810 (1 upto n) udiscs uselss vdiscs vselss ctrXs_Tss))
811 handle List.Empty => @{term True};
813 fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss ctrXs_Tss =
814 fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr,
815 HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss)));
818 HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
819 (map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v)))
823 Logic.list_implies (map9 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss
826 val goals = map mk_goal [rs, strong_rs];
828 fun prove dtor_coinduct' goal =
829 Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
830 mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors
831 exhausts ctr_defss disc_thmsss sel_thmsss)
832 |> singleton (Proof_Context.export names_lthy lthy)
833 |> Thm.close_derivation;
835 fun postproc nn thm =
836 Thm.permute_prems 0 nn
837 (if nn = 1 then thm RS mp else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm)
838 |> Drule.zero_var_indexes
841 val rel_eqs = map rel_eq_of_bnf pre_bnfs;
842 val rel_monos = map rel_mono_of_bnf pre_bnfs;
844 [dtor_coinduct, mk_strong_coinduct_thm dtor_coinduct rel_eqs rel_monos lthy];
846 map2 (postproc nn oo prove) dtor_coinducts goals
849 fun mk_coinduct_concls ms discs ctrs =
851 fun mk_disc_concl disc = [name_of_disc disc];
852 fun mk_ctr_concl 0 _ = []
853 | mk_ctr_concl _ ctor = [name_of_ctr ctor];
854 val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]];
855 val ctr_concls = map2 mk_ctr_concl ms ctrs;
857 flat (map2 append disc_concls ctr_concls)
860 val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names);
861 val coinduct_conclss =
862 map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss;
864 fun mk_maybe_not pos = not pos ? HOLogic.mk_not;
866 val fcoiterss' as [gunfolds, hcorecs] =
867 map2 (fn (pfss, _) => map (lists_bmoc pfss)) (map fst coiters_args_types) coiterss';
869 val (unfold_thmss, corec_thmss) =
871 fun mk_goal pfss c cps fcoiter n k ctr m cfs' =
872 fold_rev (fold_rev Logic.all) ([c] :: pfss)
873 (Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps,
874 mk_Trueprop_eq (fcoiter $ c, Term.list_comb (ctr, take m cfs'))));
876 fun mk_U maybe_mk_sumT =
877 typ_subst_nonatomic (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs);
879 fun tack z_name (c, u) f =
880 let val z = Free (z_name, mk_sumT (fastype_of u, fastype_of c)) in
881 Term.lambda z (mk_sum_case (Term.lambda u u, Term.lambda c (f $ c)) $ z)
884 fun build_coiter fcoiters maybe_mk_sumT maybe_tack cqf =
885 let val T = fastype_of cqf in
886 if exists_subtype_in Cs T then
887 let val U = mk_U maybe_mk_sumT T in
888 build_map lthy (indexify snd fpTs (fn kk => fn _ =>
889 maybe_tack (nth cs kk, nth us kk) (nth fcoiters kk))) (T, U) $ cqf
895 val crgsss' = map (map (map (build_coiter (un_fold_of fcoiterss') (K I) (K I)))) crgsss;
896 val cshsss' = map (map (map (build_coiter (co_rec_of fcoiterss') (curry mk_sumT) (tack z))))
899 val unfold_goalss = map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss';
900 val corec_goalss = map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss';
903 map3 (map oo mk_coiter_tac unfold_defs nesting_map_idents)
904 (map un_fold_of ctor_dtor_coiter_thmss) pre_map_defs ctr_defss;
906 map3 (map oo mk_coiter_tac corec_defs nesting_map_idents)
907 (map co_rec_of ctor_dtor_coiter_thmss) pre_map_defs ctr_defss;
910 Goal.prove_sorry lthy [] [] goal (tac o #context)
911 |> Thm.close_derivation;
913 val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss;
915 map2 (map2 prove) corec_goalss corec_tacss
916 |> map (map (unfold_thms lthy @{thms sum_case_if}));
918 (unfold_thmss, corec_thmss)
921 val (disc_unfold_iff_thmss, disc_corec_iff_thmss) =
923 fun mk_goal c cps fcoiter n k disc =
924 mk_Trueprop_eq (disc $ (fcoiter $ c),
925 if n = 1 then @{const True}
926 else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps));
928 val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss;
929 val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss;
931 fun mk_case_split' cp = Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split};
933 val case_splitss' = map (map mk_case_split') cpss;
936 map3 (map oo mk_disc_coiter_iff_tac) case_splitss' unfold_thmss disc_thmsss;
938 map3 (map oo mk_disc_coiter_iff_tac) case_splitss' corec_thmss disc_thmsss;
941 Goal.prove_sorry lthy [] [] goal (tac o #context)
942 |> singleton export_args
943 |> singleton (Proof_Context.export names_lthy lthy)
944 |> Thm.close_derivation;
946 fun proves [_] [_] = []
947 | proves goals tacs = map2 prove goals tacs;
949 (map2 proves unfold_goalss unfold_tacss, map2 proves corec_goalss corec_tacss)
952 fun mk_disc_coiter_thms coiters discIs = map (op RS) (coiters ~~ discIs);
954 val disc_unfold_thmss = map2 mk_disc_coiter_thms unfold_thmss discIss;
955 val disc_corec_thmss = map2 mk_disc_coiter_thms corec_thmss discIss;
957 fun mk_sel_coiter_thm coiter_thm sel sel_thm =
959 val (domT, ranT) = dest_funT (fastype_of sel);
961 Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
962 [NONE, NONE, SOME (certify lthy sel)] arg_cong
963 |> Thm.varifyT_global;
964 val sel_thm' = sel_thm RSN (2, trans);
966 coiter_thm RS arg_cong' RS sel_thm'
969 fun mk_sel_coiter_thms coiter_thmss =
970 map3 (map3 (map2 o mk_sel_coiter_thm)) coiter_thmss selsss sel_thmsss;
972 val sel_unfold_thmsss = mk_sel_coiter_thms unfold_thmss;
973 val sel_corec_thmsss = mk_sel_coiter_thms corec_thmss;
975 val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn));
976 val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases));
977 val coinduct_case_concl_attrs =
978 map2 (fn casex => fn concls =>
979 Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls))))
980 coinduct_cases coinduct_conclss;
981 val coinduct_case_attrs =
982 coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs;
984 ((coinduct_thms_pairs, coinduct_case_attrs),
985 (unfold_thmss, corec_thmss, code_nitpicksimp_attrs),
986 (disc_unfold_thmss, disc_corec_thmss, []),
987 (disc_unfold_iff_thmss, disc_corec_iff_thmss, simp_attrs),
988 (sel_unfold_thmsss, sel_corec_thmsss, simp_attrs))
991 fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp
992 (wrap_opts as (no_discs_sels, rep_compat), specs) no_defs_lthy0 =
994 (* TODO: sanity checks on arguments *)
996 val _ = if fp = Greatest_FP andalso no_discs_sels then
997 error "Cannot define codatatypes without discriminators and selectors"
1001 fun qualify mandatory fp_b_name =
1002 Binding.qualify mandatory fp_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix);
1004 val nn = length specs;
1005 val fp_bs = map type_binding_of specs;
1006 val fp_b_names = map Binding.name_of fp_bs;
1007 val fp_common_name = mk_common_name fp_b_names;
1008 val map_bs = map map_binding_of specs;
1009 val rel_bs = map rel_binding_of specs;
1011 fun prepare_type_arg (_, (ty, c)) =
1012 let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
1013 TFree (s, prepare_constraint no_defs_lthy0 c)
1016 val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of) specs;
1017 val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0;
1018 val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0;
1019 val num_As = length unsorted_As;
1020 val set_bss = map (map fst o type_args_named_constrained_of) specs;
1022 val (((Bs0, Cs), Xs), no_defs_lthy) =
1024 |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
1027 ||>> variant_tfrees fp_b_names;
1029 fun add_fake_type spec = Typedecl.basic_typedecl (type_binding_of spec, num_As, mixfix_of spec);
1031 val (fake_T_names, fake_lthy) = fold_map add_fake_type specs no_defs_lthy0;
1033 val qsoty = quote o Syntax.string_of_typ fake_lthy;
1035 val _ = (case Library.duplicates (op =) unsorted_As of [] => ()
1036 | A :: _ => error ("Duplicate type parameter " ^ qsoty A ^ " in " ^ co_prefix fp ^
1037 "datatype specification"));
1040 map (Logic.type_map (singleton (Variable.polymorphic no_defs_lthy0))) unsorted_As
1041 |> filter_out Term.is_TVar;
1042 val _ = null bad_args orelse
1043 error ("Locally fixed type argument " ^ qsoty (hd bad_args) ^ " in " ^ co_prefix fp ^
1044 "datatype specification");
1046 val mixfixes = map mixfix_of specs;
1048 val _ = (case Library.duplicates Binding.eq_name fp_bs of [] => ()
1049 | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
1051 val ctr_specss = map ctr_specs_of specs;
1053 val disc_bindingss = map (map disc_of) ctr_specss;
1055 map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss;
1056 val ctr_argsss = map (map args_of) ctr_specss;
1057 val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
1059 val sel_bindingsss = map (map (map fst)) ctr_argsss;
1060 val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
1061 val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
1063 val (As :: _) :: fake_ctr_Tsss =
1064 burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
1065 val As' = map dest_TFree As;
1067 val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
1068 val _ = (case subtract (op =) As' rhs_As' of [] => ()
1069 | extras => error ("Extra type variables on right-hand side: " ^
1070 commas (map (qsoty o TFree) extras)));
1072 val fake_Ts = map (fn s => Type (s, As)) fake_T_names;
1074 fun eq_fpT_check (T as Type (s, Ts)) (T' as Type (s', Ts')) =
1075 s = s' andalso (Ts = Ts' orelse
1076 error ("Wrong type arguments in " ^ co_prefix fp ^ "recursive type " ^ qsoty T ^
1077 " (expected " ^ qsoty T' ^ ")"))
1078 | eq_fpT_check _ _ = false;
1080 fun freeze_fp (T as Type (s, Ts)) =
1081 (case find_index (eq_fpT_check T) fake_Ts of
1082 ~1 => Type (s, map freeze_fp Ts)
1086 val unfreeze_fp = Term.typ_subst_atomic (Xs ~~ fake_Ts);
1088 val ctrXs_Tsss = map (map (map freeze_fp)) fake_ctr_Tsss;
1089 val ctrXs_sum_prod_Ts = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctrXs_Tsss;
1092 map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctrXs_sum_prod_Ts;
1094 val rhsXs_As' = fold (fold (fold Term.add_tfreesT)) ctrXs_Tsss [];
1095 val _ = (case subtract (op =) rhsXs_As' As' of [] => ()
1096 | extras => List.app (fn extra => warning ("Unused type variable on right-hand side of " ^
1097 co_prefix fp ^ "datatype definition: " ^ qsoty (TFree extra))) extras);
1099 val (pre_bnfs, (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0, dtors = dtors0,
1100 xtor_co_iterss = xtor_co_iterss0, xtor_co_induct, dtor_ctors, ctor_dtors, ctor_injects,
1101 dtor_injects, xtor_map_thms, xtor_set_thmss, xtor_rel_thms, xtor_co_iter_thmss, ...},
1103 fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As) fp_eqs
1105 handle BAD_DEAD (X, X_backdrop) =>
1109 val fake_T = qsoty (unfreeze_fp X);
1110 val fake_T_backdrop = qsoty (unfreeze_fp X_backdrop);
1111 fun register_hint () =
1112 "\nUse the " ^ quote (fst (fst @{command_spec "bnf"})) ^ " command to register " ^
1113 quote bad_tc ^ " as a bounded natural functor to allow nested (co)recursion through \
1116 if is_some (bnf_of no_defs_lthy bad_tc) orelse
1117 is_some (fp_sugar_of no_defs_lthy bad_tc) then
1118 error ("Inadmissible " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
1119 " in type expression " ^ fake_T_backdrop)
1120 else if is_some (Datatype_Data.get_info (Proof_Context.theory_of no_defs_lthy)
1122 error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
1123 " via the old-style datatype " ^ quote bad_tc ^ " in type expression " ^
1124 fake_T_backdrop ^ register_hint ())
1126 error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
1127 " via type constructor " ^ quote bad_tc ^ " in type expression " ^ fake_T_backdrop ^
1131 val time = time lthy;
1132 val timer = time (Timer.startRealTimer ());
1134 val nesting_bnfs = nesty_bnfs lthy ctrXs_Tsss As;
1135 val nested_bnfs = nesty_bnfs lthy ctrXs_Tsss Xs;
1137 val pre_map_defs = map map_def_of_bnf pre_bnfs;
1138 val pre_set_defss = map set_defs_of_bnf pre_bnfs;
1139 val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
1140 val nesting_set_maps = maps set_map_of_bnf nesting_bnfs;
1141 val nested_set_maps = maps set_map_of_bnf nested_bnfs;
1143 val live = live_of_bnf any_fp_bnf;
1145 if live = 0 andalso exists (not o Binding.is_empty) (map_bs @ rel_bs) then
1146 warning "Map function and relator names ignored"
1151 map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A)
1152 (liveness_of_fp_bnf num_As any_fp_bnf) As Bs0;
1154 val B_ify = Term.typ_subst_atomic (As ~~ Bs);
1156 val ctors = map (mk_ctor As) ctors0;
1157 val dtors = map (mk_dtor As) dtors0;
1159 val fpTs = map (domain_type o fastype_of) dtors;
1161 fun massage_simple_notes base =
1162 filter_out (null o #2)
1163 #> map (fn (thmN, thms, attrs) =>
1164 ((qualify true base (Binding.name thmN), attrs), [(thms, [])]));
1166 val massage_multi_notes =
1167 maps (fn (thmN, thmss, attrs) =>
1168 map3 (fn fp_b_name => fn Type (T_name, _) => fn thms =>
1169 ((qualify true fp_b_name (Binding.name thmN), attrs T_name), [(thms, [])]))
1170 fp_b_names fpTs thmss)
1171 #> filter_out (null o fst o hd o snd);
1173 val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctrXs_Tsss;
1174 val ns = map length ctr_Tsss;
1175 val kss = map (fn n => 1 upto n) ns;
1176 val mss = map (map length) ctr_Tsss;
1178 val ((xtor_co_iterss, iters_args_types, coiters_args_types), lthy') =
1179 mk_co_iters_prelims fp ctr_Tsss fpTs Cs ns mss xtor_co_iterss0 lthy;
1181 fun define_ctrs_dtrs_for_type (((((((((((((((((((((((fp_bnf, fp_b), fpT), ctor), dtor),
1182 xtor_co_iters), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs),
1183 pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), ctr_bindings),
1184 ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy =
1186 val fp_b_name = Binding.name_of fp_b;
1188 val dtorT = domain_type (fastype_of ctor);
1189 val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
1190 val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
1192 val ((((w, xss), yss), u'), names_lthy) =
1194 |> yield_singleton (mk_Frees "w") dtorT
1195 ||>> mk_Freess "x" ctr_Tss
1196 ||>> mk_Freess "y" (map (map B_ify) ctr_Tss)
1197 ||>> yield_singleton Variable.variant_fixes fp_b_name;
1199 val u = Free (u', fpT);
1201 val tuple_xs = map HOLogic.mk_tuple xss;
1202 val tuple_ys = map HOLogic.mk_tuple yss;
1205 map3 (fn k => fn xs => fn tuple_x => fold_rev Term.lambda xs (ctor $
1206 mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs;
1208 val maybe_conceal_def_binding = Thm.def_binding
1209 #> Config.get no_defs_lthy bnf_note_all = false ? Binding.conceal;
1211 val ((raw_ctrs, raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
1212 |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
1213 Local_Theory.define ((b, mx), ((maybe_conceal_def_binding b, []), rhs)) #>> apsnd snd)
1214 ctr_bindings ctr_mixfixes ctr_rhss
1215 ||> `Local_Theory.restore;
1217 val phi = Proof_Context.export_morphism lthy lthy';
1219 val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
1221 map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs;
1223 val ctrs0 = map (Morphism.term phi) raw_ctrs;
1224 val ctrs = map (mk_ctr As) ctrs0;
1226 fun wrap_ctrs lthy =
1228 fun exhaust_tac {context = ctxt, prems = _} =
1230 val ctor_iff_dtor_thm =
1233 fold_rev Logic.all [w, u]
1234 (mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w)));
1236 Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
1237 mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [dtorT, fpT])
1238 (certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor)
1239 |> Thm.close_derivation
1244 unfold_thms lthy @{thms unit_all_eq1}
1245 (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
1246 (mk_sumEN_balanced n))
1247 |> Morphism.thm phi;
1249 mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm'
1253 map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
1254 mk_inject_tac ctxt ctr_def ctor_inject]) ms ctr_defs;
1256 val half_distinct_tacss =
1257 map (map (fn (def, def') => fn {context = ctxt, ...} =>
1258 mk_half_distinct_tac ctxt ctor_inject [def, def'])) (mk_half_pairss (`I ctr_defs));
1260 val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss;
1262 val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss
1264 wrap_free_constructors tacss (((wrap_opts, ctrs0), standard_binding), (disc_bindings,
1265 (sel_bindingss, sel_defaultss))) lthy
1268 fun derive_maps_sets_rels (ctr_sugar, lthy) =
1270 ((([], [], [], []), ctr_sugar), lthy)
1273 val rel_flip = rel_flip_of_bnf fp_bnf;
1274 val nones = replicate live NONE;
1277 if fp = Least_FP then
1280 let val ctor' = mk_ctor Bs ctor in
1281 cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor')] arg_cong
1285 certify lthy o (fp = Greatest_FP ? curry (op $) (map_types ify ctor)) oo
1286 mk_InN_balanced (ify ctr_sum_prod_T) n;
1288 val cxIns = map2 (mk_cIn I) tuple_xs ks;
1289 val cyIns = map2 (mk_cIn B_ify) tuple_ys ks;
1291 fun mk_map_thm ctr_def' cxIn =
1292 fold_thms lthy [ctr_def']
1293 (unfold_thms lthy (pre_map_def ::
1294 (if fp = Least_FP then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map)
1295 (cterm_instantiate_pos (nones @ [SOME cxIn])
1296 (if fp = Least_FP then fp_map_thm else fp_map_thm RS ctor_cong)))
1297 |> singleton (Proof_Context.export names_lthy no_defs_lthy);
1299 fun mk_set_thm fp_set_thm ctr_def' cxIn =
1300 fold_thms lthy [ctr_def']
1301 (unfold_thms lthy (pre_set_defs @ nested_set_maps @ nesting_set_maps @
1302 (if fp = Least_FP then [] else [dtor_ctor]) @ sum_prod_thms_set)
1303 (cterm_instantiate_pos [SOME cxIn] fp_set_thm))
1304 |> singleton (Proof_Context.export names_lthy no_defs_lthy);
1306 fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns;
1308 val map_thms = map2 mk_map_thm ctr_defs' cxIns;
1309 val set_thmss = map mk_set_thms fp_set_thms;
1311 val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns);
1313 fun mk_rel_thm postproc ctr_defs' cxIn cyIn =
1314 fold_thms lthy ctr_defs'
1315 (unfold_thms lthy (@{thm Inl_Inr_False} :: pre_rel_def ::
1316 (if fp = Least_FP then [] else [dtor_ctor]) @ sum_prod_thms_rel)
1317 (cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm))
1319 |> singleton (Proof_Context.export names_lthy no_defs_lthy);
1321 fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) =
1322 mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn;
1324 val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos);
1326 fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) =
1327 mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def']
1330 fun mk_other_half_rel_distinct_thm thm =
1331 flip_rels lthy live thm
1332 RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2);
1334 val half_rel_distinct_thmss =
1335 map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos);
1336 val other_half_rel_distinct_thmss =
1337 map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss;
1338 val (rel_distinct_thms, _) =
1339 join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss;
1341 val anonymous_notes =
1342 [(map (fn th => th RS @{thm eq_False[THEN iffD2]}) rel_distinct_thms,
1343 code_nitpicksimp_attrs),
1344 (map2 (fn th => fn 0 => th RS @{thm eq_True[THEN iffD2]} | _ => th)
1345 rel_inject_thms ms, code_nitpicksimp_attrs)]
1346 |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
1349 [(mapN, map_thms, code_nitpicksimp_attrs @ simp_attrs),
1350 (rel_distinctN, rel_distinct_thms, simp_attrs),
1351 (rel_injectN, rel_inject_thms, simp_attrs),
1352 (setN, flat set_thmss, code_nitpicksimp_attrs @ simp_attrs)]
1353 |> massage_simple_notes fp_b_name;
1355 (((map_thms, rel_inject_thms, rel_distinct_thms, set_thmss), ctr_sugar),
1356 lthy |> Local_Theory.notes (anonymous_notes @ notes) |> snd)
1359 fun mk_binding suf = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b);
1361 fun massage_res (((maps_sets_rels, ctr_sugar), co_iter_res), lthy) =
1362 (((maps_sets_rels, (ctrs, xss, ctr_defs, ctr_sugar)), co_iter_res), lthy);
1365 #> derive_maps_sets_rels
1367 (if fp = Least_FP then define_iters [foldN, recN] (the iters_args_types)
1368 else define_coiters [unfoldN, corecN] (the coiters_args_types))
1369 mk_binding fpTs Cs xtor_co_iters
1370 #> massage_res, lthy')
1373 fun wrap_types_etc (wrap_types_etcs, lthy) =
1374 fold_map I wrap_types_etcs lthy
1375 |>> apsnd split_list o apfst (apsnd split_list4 o apfst split_list4 o split_list)
1378 fun mk_simp_thms ({injects, distincts, case_thms, ...} : ctr_sugar) un_folds co_recs
1379 mapsx rel_injects rel_distincts setss =
1380 injects @ distincts @ case_thms @ co_recs @ un_folds @ mapsx @ rel_injects @ rel_distincts
1383 fun derive_note_induct_iters_thms_for_types
1384 ((((mapss, rel_injects, rel_distincts, setss), (ctrss, _, ctr_defss, ctr_sugars)),
1385 (iterss, iter_defss)), lthy) =
1387 val ((induct_thms, induct_thm, induct_attrs), (fold_thmss, rec_thmss, iter_attrs)) =
1388 derive_induct_iters_thms_for_types pre_bnfs (the iters_args_types) xtor_co_induct
1389 xtor_co_iter_thmss nesting_bnfs nested_bnfs fpTs Cs Xs ctrXs_Tsss ctrss ctr_defss iterss
1392 val induct_type_attr = Attrib.internal o K o Induct.induct_type;
1395 map7 mk_simp_thms ctr_sugars fold_thmss rec_thmss mapss rel_injects rel_distincts setss;
1398 (if nn > 1 then [(inductN, [induct_thm], induct_attrs)] else [])
1399 |> massage_simple_notes fp_common_name;
1402 [(foldN, fold_thmss, K iter_attrs),
1403 (inductN, map single induct_thms, fn T_name => induct_attrs @ [induct_type_attr T_name]),
1404 (recN, rec_thmss, K iter_attrs),
1405 (simpsN, simp_thmss, K [])]
1406 |> massage_multi_notes;
1409 |> Local_Theory.notes (common_notes @ notes) |> snd
1410 |> register_fp_sugars Least_FP pre_bnfs nested_bnfs nesting_bnfs fp_res ctr_defss ctr_sugars
1411 iterss mapss [induct_thm] (transpose [fold_thmss, rec_thmss]) [] []
1414 fun derive_note_coinduct_coiters_thms_for_types
1415 ((((mapss, rel_injects, rel_distincts, setss), (_, _, ctr_defss, ctr_sugars)),
1416 (coiterss, coiter_defss)), lthy) =
1418 val (([(coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)],
1420 (unfold_thmss, corec_thmss, coiter_attrs),
1421 (disc_unfold_thmss, disc_corec_thmss, disc_coiter_attrs),
1422 (disc_unfold_iff_thmss, disc_corec_iff_thmss, disc_coiter_iff_attrs),
1423 (sel_unfold_thmsss, sel_corec_thmsss, sel_coiter_attrs)) =
1424 derive_coinduct_coiters_thms_for_types pre_bnfs (the coiters_args_types) xtor_co_induct
1425 dtor_injects dtor_ctors xtor_co_iter_thmss nesting_bnfs fpTs Cs Xs ctrXs_Tsss kss mss ns
1426 ctr_defss ctr_sugars coiterss coiter_defss (Proof_Context.export lthy' no_defs_lthy)
1429 val sel_unfold_thmss = map flat sel_unfold_thmsss;
1430 val sel_corec_thmss = map flat sel_corec_thmsss;
1432 val coinduct_type_attr = Attrib.internal o K o Induct.coinduct_type;
1434 val flat_coiter_thms = append oo append;
1437 map7 mk_simp_thms ctr_sugars
1438 (map3 flat_coiter_thms disc_unfold_thmss disc_unfold_iff_thmss sel_unfold_thmss)
1439 (map3 flat_coiter_thms disc_corec_thmss disc_corec_iff_thmss sel_corec_thmss)
1440 mapss rel_injects rel_distincts setss;
1444 [(coinductN, [coinduct_thm], coinduct_attrs),
1445 (strong_coinductN, [strong_coinduct_thm], coinduct_attrs)]
1448 |> massage_simple_notes fp_common_name;
1451 [(coinductN, map single coinduct_thms,
1452 fn T_name => coinduct_attrs @ [coinduct_type_attr T_name]),
1453 (corecN, corec_thmss, K coiter_attrs),
1454 (disc_corecN, disc_corec_thmss, K disc_coiter_attrs),
1455 (disc_corec_iffN, disc_corec_iff_thmss, K disc_coiter_iff_attrs),
1456 (disc_unfoldN, disc_unfold_thmss, K disc_coiter_attrs),
1457 (disc_unfold_iffN, disc_unfold_iff_thmss, K disc_coiter_iff_attrs),
1458 (sel_corecN, sel_corec_thmss, K sel_coiter_attrs),
1459 (sel_unfoldN, sel_unfold_thmss, K sel_coiter_attrs),
1460 (simpsN, simp_thmss, K []),
1461 (strong_coinductN, map single strong_coinduct_thms, K coinduct_attrs),
1462 (unfoldN, unfold_thmss, K coiter_attrs)]
1463 |> massage_multi_notes;
1465 fun is_codatatype (Type (s, _)) =
1466 (case fp_sugar_of lthy s of SOME {fp = Greatest_FP, ...} => true | _ => false)
1467 | is_codatatype _ = false;
1469 val nitpick_supported = forall (is_codatatype o T_of_bnf) nested_bnfs;
1471 fun register_nitpick fpT ({ctrs, casex, ...} : ctr_sugar) =
1472 Nitpick_HOL.register_codatatype fpT (fst (dest_Const casex))
1473 (map (dest_Const o mk_ctr As) ctrs)
1474 |> Generic_Target.theory_declaration;
1477 |> Local_Theory.notes (common_notes @ notes) |> snd
1478 |> register_fp_sugars Greatest_FP pre_bnfs nested_bnfs nesting_bnfs fp_res ctr_defss
1479 ctr_sugars coiterss mapss [coinduct_thm, strong_coinduct_thm]
1480 (transpose [unfold_thmss, corec_thmss]) (transpose [disc_unfold_thmss, disc_corec_thmss])
1481 (transpose [sel_unfold_thmsss, sel_corec_thmsss])
1482 |> nitpick_supported ? fold2 register_nitpick fpTs ctr_sugars
1486 |> fold_map define_ctrs_dtrs_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ ctors ~~ dtors ~~
1487 xtor_co_iterss ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~
1488 pre_set_defss ~~ pre_rel_defs ~~ xtor_map_thms ~~ xtor_set_thmss ~~ xtor_rel_thms ~~ ns ~~
1489 kss ~~ mss ~~ ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~
1490 sel_bindingsss ~~ raw_sel_defaultsss)
1492 |> fp_case fp derive_note_induct_iters_thms_for_types
1493 derive_note_coinduct_coiters_thms_for_types;
1495 val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
1496 co_prefix fp ^ "datatype"));
1501 fun co_datatypes x = define_co_datatypes (K I) (K I) (K I) x;
1503 fun co_datatype_cmd x =
1504 define_co_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term x;
1507 @{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} ||
1508 (Parse.typ >> pair Binding.empty);
1510 val parse_defaults =
1511 @{keyword "("} |-- Parse.reserved "defaults" |-- Scan.repeat parse_bound_term --| @{keyword ")"};
1513 val parse_type_arg_constrained =
1514 Parse.type_ident -- Scan.option (@{keyword "::"} |-- Parse.!!! Parse.sort);
1516 val parse_type_arg_named_constrained = parse_opt_binding_colon -- parse_type_arg_constrained;
1518 val parse_type_args_named_constrained =
1519 parse_type_arg_constrained >> (single o pair Binding.empty) ||
1520 @{keyword "("} |-- Parse.!!! (Parse.list1 parse_type_arg_named_constrained --| @{keyword ")"}) ||
1523 val parse_map_rel_binding = Parse.short_ident --| @{keyword ":"} -- parse_binding;
1525 val no_map_rel = (Binding.empty, Binding.empty);
1527 fun extract_map_rel ("map", b) = apfst (K b)
1528 | extract_map_rel ("rel", b) = apsnd (K b)
1529 | extract_map_rel (s, _) = error ("Unknown label " ^ quote s ^ " (expected \"map\" or \"rel\")");
1531 val parse_map_rel_bindings =
1532 @{keyword "("} |-- Scan.repeat parse_map_rel_binding --| @{keyword ")"}
1533 >> (fn ps => fold extract_map_rel ps no_map_rel) ||
1534 Scan.succeed no_map_rel;
1536 val parse_ctr_spec =
1537 parse_opt_binding_colon -- parse_binding -- Scan.repeat parse_ctr_arg --
1538 Scan.optional parse_defaults [] -- Parse.opt_mixfix;
1541 parse_type_args_named_constrained -- parse_binding -- parse_map_rel_bindings --
1542 Parse.opt_mixfix -- (@{keyword "="} |-- Parse.enum1 "|" parse_ctr_spec);
1544 val parse_co_datatype = parse_wrap_free_constructors_options -- Parse.and_list1 parse_spec;
1546 fun parse_co_datatype_cmd fp construct_fp = parse_co_datatype >> co_datatype_cmd fp construct_fp;