1 (* Title: HOL/Codatatype/Tools/bnf_fp_sugar.ML
2 Author: Jasmin Blanchette, TU Muenchen
5 Sugar for constructing LFPs and GFPs.
8 signature BNF_FP_SUGAR =
11 bool * ((((typ * typ option) list * binding) * mixfix) * ((((binding * binding) *
12 (binding * typ) list) * (binding * term) list) * mixfix) list) list ->
13 local_theory -> local_theory
16 structure BNF_FP_Sugar : BNF_FP_SUGAR =
25 open BNF_FP_Sugar_Tactics
28 val coitersN = "coiters";
29 val corecsN = "corecs";
30 val disc_coitersN = "disc_coiters";
31 val disc_corecsN = "disc_corecs";
34 val sel_coitersN = "sel_coiters";
35 val sel_corecsN = "sel_corecs";
38 (map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs, map #8 xs,
39 map #9 xs, map #10 xs, map #11 xs);
41 fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' |>> cons T
42 | strip_map_type T = ([], T);
44 fun typ_subst inst (T as Type (s, Ts)) =
45 (case AList.lookup (op =) inst T of
46 NONE => Type (s, map (typ_subst inst) Ts)
48 | typ_subst inst T = the_default T (AList.lookup (op =) inst T);
50 fun retype_free (Free (s, _)) T = Free (s, T);
52 val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
54 fun mk_predT T = T --> HOLogic.boolT;
56 fun mk_id T = Const (@{const_name id}, T --> T);
58 fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
59 fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
60 fun mk_uncurried2_fun f xss =
61 mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
63 fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v));
65 fun tack z_name (c, v) f =
66 let val z = Free (z_name, mk_sumT (fastype_of v, fastype_of c)) in
67 Term.lambda z (mk_sum_case (Term.lambda v v, Term.lambda c (f $ c)) $ z)
70 fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
72 fun merge_type_arg_constrained ctxt (T, c) (T', c') =
76 | (NONE, _) => (T, c')
81 error ("Inconsistent sort constraints for type variable " ^
82 quote (Syntax.string_of_typ ctxt T)))
84 cannot_merge_types ();
86 fun merge_type_args_constrained ctxt (cAs, cAs') =
87 if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs'
88 else cannot_merge_types ();
90 fun type_args_constrained_of (((cAs, _), _), _) = cAs;
91 val type_args_of = map fst o type_args_constrained_of;
92 fun type_binder_of (((_, b), _), _) = b;
93 fun mixfix_of ((_, mx), _) = mx;
94 fun ctr_specs_of (_, ctr_specs) = ctr_specs;
96 fun disc_of ((((disc, _), _), _), _) = disc;
97 fun ctr_of ((((_, ctr), _), _), _) = ctr;
98 fun args_of (((_, args), _), _) = args;
99 fun defaults_of ((_, ds), _) = ds;
100 fun ctr_mixfix_of (_, mx) = mx;
102 fun prepare_datatype prepare_typ prepare_term lfp (no_dests, specs) fake_lthy no_defs_lthy =
104 val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes"
108 map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs
109 |> Library.foldr1 (merge_type_args_constrained no_defs_lthy);
110 val As = map fst constrained_As;
111 val As' = map dest_TFree As;
113 val _ = (case duplicates (op =) As of [] => ()
114 | A :: _ => error ("Duplicate type parameter " ^
115 quote (Syntax.string_of_typ no_defs_lthy A)));
117 (* TODO: use sort constraints on type args *)
119 val N = length specs;
122 Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
125 val bs = map type_binder_of specs;
126 val fakeTs = map mk_fake_T bs;
128 val mixfixes = map mixfix_of specs;
130 val _ = (case duplicates Binding.eq_name bs of [] => ()
131 | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
133 val ctr_specss = map ctr_specs_of specs;
135 val disc_binderss = map (map disc_of) ctr_specss;
136 val ctr_binderss = map (map ctr_of) ctr_specss;
137 val ctr_argsss = map (map args_of) ctr_specss;
138 val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
140 val sel_bindersss = map (map (map fst)) ctr_argsss;
141 val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
143 val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
145 val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
146 val _ = (case subtract (op =) As' rhs_As' of
148 | A' :: _ => error ("Extra type variables on rhs: " ^
149 quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
153 |> fold Variable.declare_typ As
157 fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) =
158 s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
159 quote (Syntax.string_of_typ fake_lthy T)))
160 | eq_fpT _ _ = false;
162 fun freeze_fp (T as Type (s, Us)) =
163 (case find_index (eq_fpT T) fakeTs of ~1 => Type (s, map freeze_fp Us) | j => nth Bs j)
166 val ctr_TsssBs = map (map (map freeze_fp)) fake_ctr_Tsss;
167 val ctr_sum_prod_TsBs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssBs;
169 val eqs = map dest_TFree Bs ~~ ctr_sum_prod_TsBs;
171 val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects,
172 fp_iter_thms, fp_rec_thms), lthy)) =
173 fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy;
175 val add_nested_bnf_names =
177 fun add (Type (s, Ts)) ss =
178 let val (needs, ss') = fold_map add Ts ss in
179 if exists I needs then (true, insert (op =) s ss') else (false, ss')
181 | add T ss = (member (op =) As T, ss);
185 map_filter (bnf_of lthy) (fold (fold (fold add_nested_bnf_names)) ctr_TsssBs []);
187 val timer = time (Timer.startRealTimer ());
189 fun mk_unf_or_fld get_T Ts t =
190 let val Type (_, Ts0) = get_T (fastype_of t) in
191 Term.subst_atomic_types (Ts0 ~~ Ts) t
194 val mk_unf = mk_unf_or_fld domain_type;
195 val mk_fld = mk_unf_or_fld range_type;
197 val unfs = map (mk_unf As) unfs0;
198 val flds = map (mk_fld As) flds0;
200 val fpTs = map (domain_type o fastype_of) unfs;
202 val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Bs ~~ fpTs)))) ctr_TsssBs;
203 val ns = map length ctr_Tsss;
204 val kss = map (fn n => 1 upto n) ns;
205 val mss = map (map length) ctr_Tsss;
206 val Css = map2 replicate ns Cs;
208 fun mk_iter_like Ts Us t =
210 val (binders, body) = strip_type (fastype_of t);
211 val (f_Us, prebody) = split_last binders;
212 val Type (_, Ts0) = if lfp then prebody else body;
213 val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
215 Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
218 val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0;
219 val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0;
221 val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1)));
222 val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1)));
224 val ((iter_only as (gss, _, _), rec_only as (hss, _, _)),
225 (zs, cs, cpss, coiter_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))) =
229 map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type)
230 ns mss fp_iter_fun_Ts;
231 val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
233 val ((gss, ysss), _) =
235 |> mk_Freess "f" g_Tss
236 ||>> mk_Freesss "x" y_Tsss;
237 val yssss = map (map (map single)) ysss;
239 fun dest_rec_prodT (T as Type (@{type_name prod}, Us as [_, U])) =
240 if member (op =) Cs U then Us else [T]
241 | dest_rec_prodT T = [T];
244 map3 (fn n => fn ms => map2 (map dest_rec_prodT oo dest_tupleT) ms o
245 dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts;
246 val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
248 val hss = map2 (map2 retype_free) gss h_Tss;
249 val zssss_hd = map2 (map2 (map2 (fn y => fn T :: _ => retype_free y T))) ysss z_Tssss;
252 |> mk_Freessss "y" (map (map (map tl)) z_Tssss);
253 val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl;
255 (((gss, g_Tss, yssss), (hss, h_Tss, zssss)),
256 ([], [], [], (([], []), ([], [])), (([], []), ([], []))))
260 (*avoid "'a itself" arguments in coiterators and corecursors*)
261 val mss' = map (fn [0] => [1] | ms => ms) mss;
263 val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_predT) ns Cs;
265 fun zip_predss_getterss qss fss = maps (op @) (qss ~~ fss);
267 fun zip_preds_predsss_gettersss [] [qss] [fss] = zip_predss_getterss qss fss
268 | zip_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
269 p :: zip_predss_getterss qss fss @ zip_preds_predsss_gettersss ps qsss fsss;
271 fun mk_types maybe_dest_sumT fun_Ts =
273 val f_sum_prod_Ts = map range_type fun_Ts;
274 val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
276 map3 (fn C => map2 (map (map (curry (op -->) C) o maybe_dest_sumT) oo dest_tupleT))
279 map (map (map (fn [_] => [] | [_, C] => [mk_predT (domain_type C)]))) f_Tssss;
280 val pf_Tss = map3 zip_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
281 in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end;
283 val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_iter_fun_Ts;
285 val ((((Free (z, _), cs), pss), gssss), _) =
287 |> yield_singleton (mk_Frees "z") dummyT
289 ||>> mk_Freess "p" p_Tss
290 ||>> mk_Freessss "g" g_Tssss;
291 val rssss = map (map (map (fn [] => []))) r_Tssss;
293 fun dest_corec_sumT (T as Type (@{type_name sum}, Us as [_, U])) =
294 if member (op =) Cs U then Us else [T]
295 | dest_corec_sumT T = [T];
297 val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts;
299 val hssss_hd = map2 (map2 (map2 (fn [g] => fn T :: _ => retype_free g T))) gssss h_Tssss;
300 val ((sssss, hssss_tl), _) =
302 |> mk_Freessss "q" s_Tssss
303 ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
304 val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
306 val cpss = map2 (fn c => map (fn p => p $ c)) cs pss;
308 fun mk_preds_getters_join [] [cf] = cf
309 | mk_preds_getters_join [cq] [cf, cf'] =
310 mk_If cq (mk_Inl (fastype_of cf') cf) (mk_Inr (fastype_of cf) cf');
312 fun mk_terms qssss fssss =
314 val pfss = map3 zip_preds_predsss_gettersss pss qssss fssss;
315 val cqssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs qssss;
316 val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss;
317 val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss;
318 in (pfss, cqfsss) end;
320 ((([], [], []), ([], [], [])),
321 ([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)),
322 (mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss))))
325 fun define_ctrs_case_for_type ((((((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec),
326 fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss),
327 disc_binders), sel_binderss), raw_sel_defaultss) no_defs_lthy =
329 val unfT = domain_type (fastype_of fld);
330 val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
331 val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
332 val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
334 val ((((u, v), fs), xss), _) =
336 |> yield_singleton (mk_Frees "u") unfT
337 ||>> yield_singleton (mk_Frees "v") fpT
338 ||>> mk_Frees "f" case_Ts
339 ||>> mk_Freess "x" ctr_Tss;
342 map2 (fn k => fn xs => fold_rev Term.lambda xs (fld $
343 mk_InN_balanced ctr_sum_prod_T n (HOLogic.mk_tuple xs) k)) ks xss;
345 val case_binder = Binding.suffix_name ("_" ^ caseN) b;
348 fold_rev Term.lambda (fs @ [v])
349 (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v));
351 val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
352 |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
353 Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
354 (case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
355 ||> `Local_Theory.restore;
357 (*transforms defined frees into consts (and more)*)
358 val phi = Proof_Context.export_morphism lthy lthy';
360 val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
361 val case_def = Morphism.thm phi raw_case_def;
363 val ctrs0 = map (Morphism.term phi) raw_ctrs;
364 val casex0 = Morphism.term phi raw_case;
366 val ctrs = map (mk_ctr As) ctrs0;
368 fun exhaust_tac {context = ctxt, ...} =
370 val fld_iff_unf_thm =
373 fold_rev Logic.all [u, v]
374 (mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u)));
376 Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
377 mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT])
378 (certify lthy fld) (certify lthy unf) fld_unf unf_fld)
379 |> Thm.close_derivation
384 Local_Defs.unfold lthy @{thms all_unit_eq}
385 (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
386 (mk_sumEN_balanced n))
389 mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm'
393 map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
394 mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs;
396 val half_distinct_tacss =
397 map (map (fn (def, def') => fn {context = ctxt, ...} =>
398 mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs);
401 map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
402 mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs;
404 val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
406 fun define_iter_rec ((selss0, discIs, sel_thmss), no_defs_lthy) =
408 val fpT_to_C = fpT --> C;
410 fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) =
412 val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
414 val binder = Binding.suffix_name ("_" ^ suf) b;
417 mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binder, res_T)),
418 Term.list_comb (fp_iter_like,
419 map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss));
420 in (binder, spec) end;
422 val iter_like_bundles =
423 [(iterN, fp_iter, iter_only),
424 (recN, fp_rec, rec_only)];
426 val (binders, specs) = map generate_iter_like iter_like_bundles |> split_list;
428 val ((csts, defs), (lthy', lthy)) = no_defs_lthy
429 |> apfst split_list o fold_map2 (fn b => fn spec =>
430 Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
431 #>> apsnd snd) binders specs
432 ||> `Local_Theory.restore;
434 (*transforms defined frees into consts (and more)*)
435 val phi = Proof_Context.export_morphism lthy lthy';
437 val [iter_def, rec_def] = map (Morphism.thm phi) defs;
439 val [iter, recx] = map (mk_iter_like As Cs o Morphism.term phi) csts;
441 ((ctrs, selss0, iter, recx, v, xss, ctr_defs, discIs, sel_thmss, iter_def, rec_def),
445 fun define_coiter_corec ((selss0, discIs, sel_thmss), no_defs_lthy) =
447 val B_to_fpT = C --> fpT;
449 fun mk_preds_getterss_join c n cps sum_prod_T cqfss =
450 Term.lambda c (mk_IfN sum_prod_T cps
451 (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)));
453 fun generate_coiter_like (suf, fp_iter_like, ((pfss, cqfsss), (f_sum_prod_Ts,
456 val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
458 val binder = Binding.suffix_name ("_" ^ suf) b;
461 mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)),
462 Term.list_comb (fp_iter_like,
463 map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss));
464 in (binder, spec) end;
466 val coiter_like_bundles =
467 [(coiterN, fp_iter, coiter_only),
468 (corecN, fp_rec, corec_only)];
470 val (binders, specs) = map generate_coiter_like coiter_like_bundles |> split_list;
472 val ((csts, defs), (lthy', lthy)) = no_defs_lthy
473 |> apfst split_list o fold_map2 (fn b => fn spec =>
474 Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
475 #>> apsnd snd) binders specs
476 ||> `Local_Theory.restore;
478 (*transforms defined frees into consts (and more)*)
479 val phi = Proof_Context.export_morphism lthy lthy';
481 val [coiter_def, corec_def] = map (Morphism.thm phi) defs;
483 val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts;
485 ((ctrs, selss0, coiter, corec, v, xss, ctr_defs, discIs, sel_thmss, coiter_def,
490 let val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss in
491 wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_binders, (sel_binderss,
492 sel_defaultss))) lthy
495 val define_iter_likes = if lfp then define_iter_rec else define_coiter_corec;
497 ((wrap, define_iter_likes), lthy')
500 val pre_map_defs = map map_def_of_bnf pre_bnfs;
501 val map_ids = map map_id_of_bnf nested_bnfs;
504 let val (Type (_, Ts0), Type (_, Us0)) = strip_map_type (fastype_of t) |>> List.last in
505 Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
508 fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) =
510 val map0 = map_of_bnf (the (bnf_of lthy s));
511 val mapx = mk_map Ts Us map0;
512 val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx)))));
513 val args = map build_arg TUs;
514 in Term.list_comb (mapx, args) end;
516 fun derive_iter_rec_thms_for_types ((ctrss, _, iters, recs, vs, xsss, ctr_defss, _, _, iter_defs,
519 val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
520 val giters = map (lists_bmoc gss) iters;
521 val hrecs = map (lists_bmoc hss) recs;
523 val (iter_thmss, rec_thmss) =
525 fun mk_goal_iter_like fss fiter_like xctr f xs fxs =
526 fold_rev (fold_rev Logic.all) (xs :: fss)
527 (mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs)));
529 fun build_call fiter_likes maybe_tick (T, U) =
533 (case find_index (curry (op =) T) fpTs of
534 ~1 => build_map (build_call fiter_likes maybe_tick) T U
535 | j => maybe_tick (nth vs j) (nth fiter_likes j));
537 fun mk_U maybe_mk_prodT =
538 typ_subst (map2 (fn fpT => fn C => (fpT, maybe_mk_prodT fpT C)) fpTs Cs);
540 fun repair_calls fiter_likes maybe_cons maybe_tick maybe_mk_prodT (x as Free (_, T)) =
541 if member (op =) fpTs T then
542 maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x]
543 else if exists_subtype (member (op =) fpTs) T then
544 [build_call fiter_likes maybe_tick (T, mk_U maybe_mk_prodT T) $ x]
548 val gxsss = map (map (maps (repair_calls giters (K I) (K I) (K I)))) xsss;
550 map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss;
552 val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss;
553 val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss;
556 map2 (map o mk_iter_like_tac pre_map_defs map_ids iter_defs) fp_iter_thms ctr_defss;
558 map2 (map o mk_iter_like_tac pre_map_defs map_ids rec_defs) fp_rec_thms ctr_defss;
560 (map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
561 goal_iterss iter_tacss,
562 map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
563 goal_recss rec_tacss)
567 [(itersN, iter_thmss),
569 |> maps (fn (thmN, thmss) =>
570 map2 (fn b => fn thms =>
571 ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]))
574 lthy |> Local_Theory.notes notes |> snd
577 fun derive_coiter_corec_thms_for_types ((ctrss, selsss, coiters, corecs, vs, _, ctr_defss,
578 discIss, sel_thmsss, coiter_defs, corec_defs), lthy) =
580 val z = the_single zs;
582 val gcoiters = map (lists_bmoc pgss) coiters;
583 val hcorecs = map (lists_bmoc phss) corecs;
585 val (coiter_thmss, corec_thmss) =
587 fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not);
589 fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' =
590 fold_rev (fold_rev Logic.all) ([c] :: pfss)
591 (Logic.list_implies (seq_conds mk_goal_cond n k cps,
592 mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs'))));
594 fun build_call fiter_likes maybe_tack (T, U) =
598 (case find_index (curry (op =) U) fpTs of
599 ~1 => build_map (build_call fiter_likes maybe_tack) T U
600 | j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j));
602 fun mk_U maybe_mk_sumT =
603 typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs);
605 fun repair_calls fiter_likes maybe_mk_sumT maybe_tack cqf =
606 let val T = fastype_of cqf in
607 if exists_subtype (member (op =) Cs) T then
608 build_call fiter_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf
613 val crgsss' = map (map (map (repair_calls gcoiters (K I) (K I)))) crgsss;
614 val cshsss' = map (map (map (repair_calls hcorecs (curry mk_sumT) (tack z)))) cshsss;
617 map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss crgsss';
619 map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss cshsss';
622 map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs
625 map3 (map oo mk_coiter_like_tac corec_defs map_ids) fp_rec_thms pre_map_defs
628 (map2 (map2 (fn goal => fn tac =>
629 Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation))
630 goal_coiterss coiter_tacss,
631 map2 (map2 (fn goal => fn tac =>
632 Skip_Proof.prove lthy [] [] goal (tac o #context)
633 |> Local_Defs.unfold lthy @{thms sum_case_if} |> Thm.close_derivation))
634 goal_corecss corec_tacss)
637 fun mk_disc_coiter_like_thms [_] = K []
638 | mk_disc_coiter_like_thms thms = map2 (curry (op RS)) thms;
640 val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss;
641 val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss;
643 fun mk_sel_coiter_like_thm coiter_like_thm sel0 sel_thm =
645 val (domT, ranT) = dest_funT (fastype_of sel0);
647 Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
648 [NONE, NONE, SOME (certify lthy sel0)] arg_cong
649 |> Thm.varifyT_global;
650 val sel_thm' = sel_thm RSN (2, trans);
652 coiter_like_thm RS arg_cong' RS sel_thm'
655 val sel_coiter_thmsss =
656 map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss;
657 val sel_corec_thmsss =
658 map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss;
661 [(coitersN, coiter_thmss),
662 (disc_coitersN, disc_coiter_thmss),
663 (sel_coitersN, map flat sel_coiter_thmsss),
664 (corecsN, corec_thmss),
665 (disc_corecsN, disc_corec_thmss),
666 (sel_corecsN, map flat sel_corec_thmsss)]
667 |> maps (fn (thmN, thmss) =>
668 map_filter (fn (_, []) => NONE | (b, thms) =>
669 SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []),
670 [(thms, [])])) (bs ~~ thmss));
672 lthy |> Local_Theory.notes notes |> snd
675 fun wrap_types_and_define_iter_likes ((wraps, define_iter_likess), lthy) =
676 fold_map2 (curry (op o)) define_iter_likess wraps lthy |>> split_list11
679 |> fold_map define_ctrs_case_for_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~
680 fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~
681 ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss ~~ raw_sel_defaultsss)
682 |>> split_list |> wrap_types_and_define_iter_likes
683 |> (if lfp then derive_iter_rec_thms_for_types else derive_coiter_corec_thms_for_types);
685 val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
686 (if lfp then "" else "co") ^ "datatype"));
691 fun datatyp lfp bundle lthy = prepare_datatype (K I) (K I) lfp bundle lthy lthy;
693 fun datatype_cmd lfp (bundle as (_, specs)) lthy =
695 (* TODO: cleaner handling of fake contexts, without "background_theory" *)
696 (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
697 locale and shadows an existing global type*)
698 val fake_thy = Theory.copy
699 #> fold (fn spec => perhaps (try (Sign.add_type lthy
700 (type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
701 val fake_lthy = Proof_Context.background_theory fake_thy lthy;
703 prepare_datatype Syntax.read_typ Syntax.read_term lfp bundle fake_lthy lthy
706 val parse_opt_binding_colon = Scan.optional (Parse.binding --| @{keyword ":"}) no_binder
709 @{keyword "("} |-- parse_opt_binding_colon -- Parse.typ --| @{keyword ")"} ||
710 (Parse.typ >> pair no_binder);
713 @{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"};
715 val parse_single_spec =
716 Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
717 (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
718 Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix));
720 val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec;
723 Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes"
724 (parse_datatype >> datatype_cmd true);
727 Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes"
728 (parse_datatype >> datatype_cmd false);