src/HOL/Codatatype/Tools/bnf_fp_sugar.ML
author blanchet
Fri Sep 14 12:09:27 2012 +0200 (2012-09-14)
changeset 49370 be6e749fd003
parent 49368 df359ce891ac
child 49371 9fa21648d0a1
permissions -rw-r--r--
fixed variable exporting problem
blanchet@49112
     1
(*  Title:      HOL/Codatatype/Tools/bnf_fp_sugar.ML
blanchet@49112
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@49112
     3
    Copyright   2012
blanchet@49112
     4
blanchet@49112
     5
Sugar for constructing LFPs and GFPs.
blanchet@49112
     6
*)
blanchet@49112
     7
blanchet@49112
     8
signature BNF_FP_SUGAR =
blanchet@49112
     9
sig
blanchet@49297
    10
  val datatyp: bool ->
blanchet@49308
    11
    (mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list ->
blanchet@49308
    12
      BNF_Def.BNF list -> local_theory ->
blanchet@49337
    13
      (term list * term list * term list * term list * thm * thm list * thm list * thm list *
blanchet@49337
    14
         thm list * thm list) * local_theory) ->
blanchet@49298
    15
    bool * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) *
blanchet@49297
    16
      (binding * typ) list) * (binding * term) list) * mixfix) list) list ->
blanchet@49297
    17
    local_theory -> local_theory
blanchet@49308
    18
  val parse_datatype_cmd: bool ->
blanchet@49308
    19
    (mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list ->
blanchet@49308
    20
      BNF_Def.BNF list -> local_theory ->
blanchet@49337
    21
      (term list * term list * term list * term list * thm * thm list * thm list * thm list *
blanchet@49337
    22
         thm list * thm list) * local_theory) ->
blanchet@49308
    23
    (local_theory -> local_theory) parser
blanchet@49112
    24
end;
blanchet@49112
    25
blanchet@49112
    26
structure BNF_FP_Sugar : BNF_FP_SUGAR =
blanchet@49112
    27
struct
blanchet@49112
    28
blanchet@49119
    29
open BNF_Util
blanchet@49119
    30
open BNF_Wrap
blanchet@49214
    31
open BNF_Def
blanchet@49119
    32
open BNF_FP_Util
blanchet@49123
    33
open BNF_FP_Sugar_Tactics
blanchet@49119
    34
blanchet@49300
    35
val simp_attrs = @{attributes [simp]};
blanchet@49300
    36
blanchet@49370
    37
fun split_list10 xs =
blanchet@49266
    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,
blanchet@49370
    39
   map #9 xs, map #10 xs);
blanchet@49214
    40
blanchet@49217
    41
fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' |>> cons T
blanchet@49217
    42
  | strip_map_type T = ([], T);
blanchet@49217
    43
blanchet@49342
    44
fun resort_tfree S (TFree (s, _)) = TFree (s, S);
blanchet@49342
    45
blanchet@49214
    46
fun typ_subst inst (T as Type (s, Ts)) =
blanchet@49214
    47
    (case AList.lookup (op =) inst T of
blanchet@49214
    48
      NONE => Type (s, map (typ_subst inst) Ts)
blanchet@49214
    49
    | SOME T' => T')
blanchet@49214
    50
  | typ_subst inst T = the_default T (AList.lookup (op =) inst T);
blanchet@49205
    51
blanchet@49297
    52
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
blanchet@49202
    53
blanchet@49200
    54
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
blanchet@49200
    55
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
blanchet@49202
    56
fun mk_uncurried2_fun f xss =
blanchet@49200
    57
  mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
blanchet@49200
    58
blanchet@49233
    59
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v));
blanchet@49233
    60
blanchet@49233
    61
fun tack z_name (c, v) f =
blanchet@49273
    62
  let val z = Free (z_name, mk_sumT (fastype_of v, fastype_of c)) in
blanchet@49273
    63
    Term.lambda z (mk_sum_case (Term.lambda v v, Term.lambda c (f $ c)) $ z)
blanchet@49273
    64
  end;
blanchet@49214
    65
blanchet@49124
    66
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
blanchet@49119
    67
blanchet@49298
    68
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types ();
blanchet@49119
    69
blanchet@49298
    70
fun merge_type_args (As, As') =
blanchet@49298
    71
  if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types ();
blanchet@49119
    72
blanchet@49121
    73
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
blanchet@49336
    74
fun type_binding_of (((_, b), _), _) = b;
blanchet@49181
    75
fun mixfix_of ((_, mx), _) = mx;
blanchet@49121
    76
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
blanchet@49119
    77
blanchet@49286
    78
fun disc_of ((((disc, _), _), _), _) = disc;
blanchet@49286
    79
fun ctr_of ((((_, ctr), _), _), _) = ctr;
blanchet@49286
    80
fun args_of (((_, args), _), _) = args;
blanchet@49286
    81
fun defaults_of ((_, ds), _) = ds;
blanchet@49181
    82
fun ctr_mixfix_of (_, mx) = mx;
blanchet@49119
    83
blanchet@49308
    84
fun define_datatype prepare_constraint prepare_typ prepare_term lfp construct (no_dests, specs)
blanchet@49298
    85
    no_defs_lthy0 =
blanchet@49112
    86
  let
blanchet@49298
    87
    (* TODO: sanity checks on arguments *)
blanchet@49298
    88
blanchet@49286
    89
    val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes"
blanchet@49278
    90
      else ();
blanchet@49278
    91
blanchet@49367
    92
    val nn = length specs;
blanchet@49361
    93
    val fp_bs = map type_binding_of specs;
blanchet@49361
    94
    val fp_common_name = mk_common_name fp_bs;
blanchet@49298
    95
blanchet@49298
    96
    fun prepare_type_arg (ty, c) =
blanchet@49298
    97
      let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
blanchet@49298
    98
        TFree (s, prepare_constraint no_defs_lthy0 c)
blanchet@49298
    99
      end;
blanchet@49298
   100
blanchet@49298
   101
    val Ass0 = map (map prepare_type_arg o type_args_constrained_of) specs;
blanchet@49298
   102
    val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0;
blanchet@49298
   103
    val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0;
blanchet@49119
   104
blanchet@49370
   105
    val ((Bs, Cs), no_defs_lthy) =
blanchet@49298
   106
      no_defs_lthy0
blanchet@49298
   107
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
blanchet@49367
   108
      |> mk_TFrees nn
blanchet@49370
   109
      ||>> mk_TFrees nn;
blanchet@49119
   110
blanchet@49298
   111
    (* TODO: cleaner handling of fake contexts, without "background_theory" *)
blanchet@49298
   112
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
blanchet@49298
   113
      locale and shadows an existing global type*)
blanchet@49298
   114
    val fake_thy =
blanchet@49298
   115
      Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy
blanchet@49336
   116
        (type_binding_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
blanchet@49298
   117
    val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy;
blanchet@49119
   118
blanchet@49182
   119
    fun mk_fake_T b =
blanchet@49121
   120
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
blanchet@49298
   121
        unsorted_As);
blanchet@49121
   122
blanchet@49302
   123
    val fake_Ts = map mk_fake_T fp_bs;
blanchet@49121
   124
blanchet@49181
   125
    val mixfixes = map mixfix_of specs;
blanchet@49119
   126
blanchet@49302
   127
    val _ = (case duplicates Binding.eq_name fp_bs of [] => ()
blanchet@49119
   128
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
   129
blanchet@49121
   130
    val ctr_specss = map ctr_specs_of specs;
blanchet@49119
   131
blanchet@49336
   132
    val disc_bindingss = map (map disc_of) ctr_specss;
blanchet@49336
   133
    val ctr_bindingss =
blanchet@49302
   134
      map2 (fn fp_b => map (Binding.qualify false (Binding.name_of fp_b) o ctr_of))
blanchet@49302
   135
        fp_bs ctr_specss;
blanchet@49121
   136
    val ctr_argsss = map (map args_of) ctr_specss;
blanchet@49181
   137
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
blanchet@49119
   138
blanchet@49336
   139
    val sel_bindingsss = map (map (map fst)) ctr_argsss;
blanchet@49298
   140
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@49286
   141
    val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
blanchet@49286
   142
blanchet@49308
   143
    val (As :: _) :: fake_ctr_Tsss =
blanchet@49298
   144
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
blanchet@49298
   145
blanchet@49298
   146
    val _ = (case duplicates (op =) unsorted_As of [] => ()
blanchet@49298
   147
      | A :: _ => error ("Duplicate type parameter " ^
blanchet@49298
   148
          quote (Syntax.string_of_typ no_defs_lthy A)));
blanchet@49298
   149
blanchet@49183
   150
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
blanchet@49298
   151
    val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of
blanchet@49165
   152
        [] => ()
blanchet@49342
   153
      | A' :: _ => error ("Extra type variable on right-hand side: " ^
blanchet@49204
   154
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
blanchet@49165
   155
blanchet@49204
   156
    fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) =
blanchet@49146
   157
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
blanchet@49146
   158
          quote (Syntax.string_of_typ fake_lthy T)))
blanchet@49204
   159
      | eq_fpT _ _ = false;
blanchet@49146
   160
blanchet@49204
   161
    fun freeze_fp (T as Type (s, Us)) =
blanchet@49298
   162
        (case find_index (eq_fpT T) fake_Ts of ~1 => Type (s, map freeze_fp Us) | j => nth Bs j)
blanchet@49204
   163
      | freeze_fp T = T;
blanchet@49121
   164
blanchet@49297
   165
    val ctr_TsssBs = map (map (map freeze_fp)) fake_ctr_Tsss;
blanchet@49297
   166
    val ctr_sum_prod_TsBs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssBs;
blanchet@49119
   167
blanchet@49298
   168
    val fp_eqs =
blanchet@49298
   169
      map dest_TFree Bs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsBs;
blanchet@49121
   170
blanchet@49337
   171
    val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, fp_induct, unf_flds, fld_unfs, fld_injects,
blanchet@49207
   172
        fp_iter_thms, fp_rec_thms), lthy)) =
blanchet@49308
   173
      fp_bnf construct fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0;
blanchet@49121
   174
blanchet@49363
   175
    fun add_nesty_bnf_names Us =
blanchet@49226
   176
      let
blanchet@49226
   177
        fun add (Type (s, Ts)) ss =
blanchet@49226
   178
            let val (needs, ss') = fold_map add Ts ss in
blanchet@49226
   179
              if exists I needs then (true, insert (op =) s ss') else (false, ss')
blanchet@49226
   180
            end
blanchet@49363
   181
          | add T ss = (member (op =) Us T, ss);
blanchet@49226
   182
      in snd oo add end;
blanchet@49226
   183
blanchet@49363
   184
    fun nesty_bnfs Us =
blanchet@49363
   185
      map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssBs []);
blanchet@49363
   186
blanchet@49363
   187
    val nesting_bnfs = nesty_bnfs As;
blanchet@49363
   188
    val nested_bnfs = nesty_bnfs Bs;
blanchet@49226
   189
blanchet@49167
   190
    val timer = time (Timer.startRealTimer ());
blanchet@49167
   191
blanchet@49176
   192
    fun mk_unf_or_fld get_T Ts t =
blanchet@49176
   193
      let val Type (_, Ts0) = get_T (fastype_of t) in
blanchet@49124
   194
        Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49121
   195
      end;
blanchet@49119
   196
blanchet@49126
   197
    val mk_unf = mk_unf_or_fld domain_type;
blanchet@49126
   198
    val mk_fld = mk_unf_or_fld range_type;
blanchet@49121
   199
blanchet@49203
   200
    val unfs = map (mk_unf As) unfs0;
blanchet@49203
   201
    val flds = map (mk_fld As) flds0;
blanchet@49124
   202
blanchet@49201
   203
    val fpTs = map (domain_type o fastype_of) unfs;
blanchet@49362
   204
blanchet@49362
   205
    val exists_fp_subtype = exists_subtype (member (op =) fpTs);
blanchet@49362
   206
blanchet@49297
   207
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Bs ~~ fpTs)))) ctr_TsssBs;
blanchet@49203
   208
    val ns = map length ctr_Tsss;
blanchet@49212
   209
    val kss = map (fn n => 1 upto n) ns;
blanchet@49203
   210
    val mss = map (map length) ctr_Tsss;
blanchet@49203
   211
    val Css = map2 replicate ns Cs;
blanchet@49203
   212
blanchet@49214
   213
    fun mk_iter_like Ts Us t =
blanchet@49121
   214
      let
blanchet@49336
   215
        val (bindings, body) = strip_type (fastype_of t);
blanchet@49336
   216
        val (f_Us, prebody) = split_last bindings;
blanchet@49210
   217
        val Type (_, Ts0) = if lfp then prebody else body;
blanchet@49210
   218
        val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
blanchet@49176
   219
      in
blanchet@49214
   220
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49176
   221
      end;
blanchet@49176
   222
blanchet@49210
   223
    val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0;
blanchet@49210
   224
    val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0;
blanchet@49210
   225
blanchet@49212
   226
    val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1)));
blanchet@49212
   227
    val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1)));
blanchet@49204
   228
blanchet@49256
   229
    val ((iter_only as (gss, _, _), rec_only as (hss, _, _)),
blanchet@49276
   230
         (zs, cs, cpss, coiter_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))) =
blanchet@49208
   231
      if lfp then
blanchet@49208
   232
        let
blanchet@49208
   233
          val y_Tsss =
blanchet@49255
   234
            map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type)
blanchet@49212
   235
              ns mss fp_iter_fun_Ts;
blanchet@49208
   236
          val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
blanchet@49208
   237
blanchet@49208
   238
          val ((gss, ysss), _) =
blanchet@49208
   239
            lthy
blanchet@49208
   240
            |> mk_Freess "f" g_Tss
blanchet@49208
   241
            ||>> mk_Freesss "x" y_Tsss;
blanchet@49274
   242
          val yssss = map (map (map single)) ysss;
blanchet@49274
   243
blanchet@49274
   244
          fun dest_rec_prodT (T as Type (@{type_name prod}, Us as [_, U])) =
blanchet@49274
   245
              if member (op =) Cs U then Us else [T]
blanchet@49274
   246
            | dest_rec_prodT T = [T];
blanchet@49204
   247
blanchet@49208
   248
          val z_Tssss =
blanchet@49274
   249
            map3 (fn n => fn ms => map2 (map dest_rec_prodT oo dest_tupleT) ms o
blanchet@49255
   250
              dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts;
blanchet@49208
   251
          val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
blanchet@49204
   252
blanchet@49298
   253
          val hss = map2 (map2 retype_free) h_Tss gss;
blanchet@49298
   254
          val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss;
blanchet@49274
   255
          val (zssss_tl, _) =
blanchet@49208
   256
            lthy
blanchet@49274
   257
            |> mk_Freessss "y" (map (map (map tl)) z_Tssss);
blanchet@49274
   258
          val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl;
blanchet@49210
   259
        in
blanchet@49274
   260
          (((gss, g_Tss, yssss), (hss, h_Tss, zssss)),
blanchet@49276
   261
           ([], [], [], (([], []), ([], [])), (([], []), ([], []))))
blanchet@49210
   262
        end
blanchet@49208
   263
      else
blanchet@49210
   264
        let
blanchet@49221
   265
          (*avoid "'a itself" arguments in coiterators and corecursors*)
blanchet@49221
   266
          val mss' =  map (fn [0] => [1] | ms => ms) mss;
blanchet@49221
   267
blanchet@49275
   268
          val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_predT) ns Cs;
blanchet@49275
   269
blanchet@49276
   270
          fun zip_predss_getterss qss fss = maps (op @) (qss ~~ fss);
blanchet@49211
   271
blanchet@49276
   272
          fun zip_preds_predsss_gettersss [] [qss] [fss] = zip_predss_getterss qss fss
blanchet@49276
   273
            | zip_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
blanchet@49276
   274
              p :: zip_predss_getterss qss fss @ zip_preds_predsss_gettersss ps qsss fsss;
blanchet@49274
   275
blanchet@49274
   276
          fun mk_types maybe_dest_sumT fun_Ts =
blanchet@49212
   277
            let
blanchet@49212
   278
              val f_sum_prod_Ts = map range_type fun_Ts;
blanchet@49255
   279
              val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
blanchet@49275
   280
              val f_Tssss =
blanchet@49275
   281
                map3 (fn C => map2 (map (map (curry (op -->) C) o maybe_dest_sumT) oo dest_tupleT))
blanchet@49275
   282
                  Cs mss' f_prod_Tss;
blanchet@49275
   283
              val q_Tssss =
blanchet@49275
   284
                map (map (map (fn [_] => [] | [_, C] => [mk_predT (domain_type C)]))) f_Tssss;
blanchet@49276
   285
              val pf_Tss = map3 zip_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
blanchet@49275
   286
            in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end;
blanchet@49176
   287
blanchet@49275
   288
          val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_iter_fun_Ts;
blanchet@49211
   289
blanchet@49275
   290
          val ((((Free (z, _), cs), pss), gssss), _) =
blanchet@49210
   291
            lthy
blanchet@49233
   292
            |> yield_singleton (mk_Frees "z") dummyT
blanchet@49233
   293
            ||>> mk_Frees "a" Cs
blanchet@49211
   294
            ||>> mk_Freess "p" p_Tss
blanchet@49275
   295
            ||>> mk_Freessss "g" g_Tssss;
blanchet@49275
   296
          val rssss = map (map (map (fn [] => []))) r_Tssss;
blanchet@49274
   297
blanchet@49274
   298
          fun dest_corec_sumT (T as Type (@{type_name sum}, Us as [_, U])) =
blanchet@49274
   299
              if member (op =) Cs U then Us else [T]
blanchet@49274
   300
            | dest_corec_sumT T = [T];
blanchet@49274
   301
blanchet@49275
   302
          val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts;
blanchet@49210
   303
blanchet@49298
   304
          val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss;
blanchet@49275
   305
          val ((sssss, hssss_tl), _) =
blanchet@49275
   306
            lthy
blanchet@49275
   307
            |> mk_Freessss "q" s_Tssss
blanchet@49275
   308
            ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
blanchet@49275
   309
          val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
blanchet@49211
   310
blanchet@49212
   311
          val cpss = map2 (fn c => map (fn p => p $ c)) cs pss;
blanchet@49212
   312
blanchet@49276
   313
          fun mk_preds_getters_join [] [cf] = cf
blanchet@49276
   314
            | mk_preds_getters_join [cq] [cf, cf'] =
blanchet@49276
   315
              mk_If cq (mk_Inl (fastype_of cf') cf) (mk_Inr (fastype_of cf) cf');
blanchet@49276
   316
blanchet@49275
   317
          fun mk_terms qssss fssss =
blanchet@49212
   318
            let
blanchet@49276
   319
              val pfss = map3 zip_preds_predsss_gettersss pss qssss fssss;
blanchet@49275
   320
              val cqssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs qssss;
blanchet@49274
   321
              val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss;
blanchet@49276
   322
              val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss;
blanchet@49276
   323
            in (pfss, cqfsss) end;
blanchet@49210
   324
        in
blanchet@49212
   325
          ((([], [], []), ([], [], [])),
blanchet@49275
   326
           ([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)),
blanchet@49275
   327
            (mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss))))
blanchet@49210
   328
        end;
blanchet@49210
   329
blanchet@49370
   330
    fun define_ctrs_case_for_type ((((((((((((((((((fp_b, fpT), C), fld), unf), fp_iter), fp_rec),
blanchet@49370
   331
          fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_bindings), ctr_mixfixes), ctr_Tss),
blanchet@49370
   332
        disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy =
blanchet@49176
   333
      let
blanchet@49201
   334
        val unfT = domain_type (fastype_of fld);
blanchet@49210
   335
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
blanchet@49255
   336
        val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
blanchet@49134
   337
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
blanchet@49119
   338
blanchet@49370
   339
        val ((((u, fs), xss), v'), _) =
blanchet@49204
   340
          no_defs_lthy
blanchet@49201
   341
          |> yield_singleton (mk_Frees "u") unfT
blanchet@49176
   342
          ||>> mk_Frees "f" case_Ts
blanchet@49370
   343
          ||>> mk_Freess "x" ctr_Tss
blanchet@49370
   344
          ||>> yield_singleton (Variable.variant_fixes) (Binding.name_of fp_b);
blanchet@49370
   345
blanchet@49370
   346
        val v = Free (v', fpT);
blanchet@49121
   347
blanchet@49129
   348
        val ctr_rhss =
blanchet@49256
   349
          map2 (fn k => fn xs => fold_rev Term.lambda xs (fld $
blanchet@49256
   350
            mk_InN_balanced ctr_sum_prod_T n (HOLogic.mk_tuple xs) k)) ks xss;
blanchet@49121
   351
blanchet@49336
   352
        val case_binding = Binding.suffix_name ("_" ^ caseN) fp_b;
blanchet@49129
   353
blanchet@49134
   354
        val case_rhs =
blanchet@49255
   355
          fold_rev Term.lambda (fs @ [v])
blanchet@49255
   356
            (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v));
blanchet@49129
   357
blanchet@49201
   358
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
blanchet@49169
   359
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
blanchet@49302
   360
              Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
blanchet@49336
   361
            (case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
blanchet@49121
   362
          ||> `Local_Theory.restore;
blanchet@49121
   363
blanchet@49121
   364
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
   365
blanchet@49121
   366
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49130
   367
        val case_def = Morphism.thm phi raw_case_def;
blanchet@49130
   368
blanchet@49203
   369
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
blanchet@49203
   370
        val casex0 = Morphism.term phi raw_case;
blanchet@49203
   371
blanchet@49203
   372
        val ctrs = map (mk_ctr As) ctrs0;
blanchet@49121
   373
blanchet@49135
   374
        fun exhaust_tac {context = ctxt, ...} =
blanchet@49123
   375
          let
blanchet@49135
   376
            val fld_iff_unf_thm =
blanchet@49135
   377
              let
blanchet@49135
   378
                val goal =
blanchet@49135
   379
                  fold_rev Logic.all [u, v]
blanchet@49135
   380
                    (mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u)));
blanchet@49135
   381
              in
blanchet@49135
   382
                Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49201
   383
                  mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT])
blanchet@49176
   384
                    (certify lthy fld) (certify lthy unf) fld_unf unf_fld)
blanchet@49135
   385
                |> Thm.close_derivation
blanchet@49135
   386
                |> Morphism.thm phi
blanchet@49135
   387
              end;
blanchet@49135
   388
blanchet@49135
   389
            val sumEN_thm' =
blanchet@49135
   390
              Local_Defs.unfold lthy @{thms all_unit_eq}
blanchet@49255
   391
                (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
blanchet@49255
   392
                   (mk_sumEN_balanced n))
blanchet@49135
   393
              |> Morphism.thm phi;
blanchet@49123
   394
          in
blanchet@49161
   395
            mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm'
blanchet@49123
   396
          end;
blanchet@49121
   397
blanchet@49126
   398
        val inject_tacss =
blanchet@49205
   399
          map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
blanchet@49205
   400
              mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs;
blanchet@49126
   401
blanchet@49127
   402
        val half_distinct_tacss =
blanchet@49127
   403
          map (map (fn (def, def') => fn {context = ctxt, ...} =>
blanchet@49127
   404
            mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs);
blanchet@49127
   405
blanchet@49130
   406
        val case_tacs =
blanchet@49130
   407
          map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
blanchet@49130
   408
            mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs;
blanchet@49121
   409
blanchet@49121
   410
        val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
blanchet@49134
   411
blanchet@49287
   412
        fun define_iter_rec ((selss0, discIs, sel_thmss), no_defs_lthy) =
blanchet@49134
   413
          let
blanchet@49208
   414
            val fpT_to_C = fpT --> C;
blanchet@49199
   415
blanchet@49215
   416
            fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) =
blanchet@49215
   417
              let
blanchet@49215
   418
                val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
blanchet@49336
   419
                val binding = Binding.suffix_name ("_" ^ suf) fp_b;
blanchet@49215
   420
                val spec =
blanchet@49336
   421
                  mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)),
blanchet@49215
   422
                    Term.list_comb (fp_iter_like,
blanchet@49255
   423
                      map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss));
blanchet@49336
   424
              in (binding, spec) end;
blanchet@49199
   425
blanchet@49300
   426
            val iter_like_infos =
blanchet@49215
   427
              [(iterN, fp_iter, iter_only),
blanchet@49215
   428
               (recN, fp_rec, rec_only)];
blanchet@49215
   429
blanchet@49336
   430
            val (bindings, specs) = map generate_iter_like iter_like_infos |> split_list;
blanchet@49215
   431
blanchet@49215
   432
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49201
   433
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49199
   434
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
   435
                #>> apsnd snd) bindings specs
blanchet@49199
   436
              ||> `Local_Theory.restore;
blanchet@49201
   437
blanchet@49201
   438
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49201
   439
blanchet@49215
   440
            val [iter_def, rec_def] = map (Morphism.thm phi) defs;
blanchet@49201
   441
blanchet@49215
   442
            val [iter, recx] = map (mk_iter_like As Cs o Morphism.term phi) csts;
blanchet@49134
   443
          in
blanchet@49370
   444
            ((ctrs, selss0, iter, recx, xss, ctr_defs, discIs, sel_thmss, iter_def, rec_def), lthy)
blanchet@49134
   445
          end;
blanchet@49134
   446
blanchet@49287
   447
        fun define_coiter_corec ((selss0, discIs, sel_thmss), no_defs_lthy) =
blanchet@49210
   448
          let
blanchet@49210
   449
            val B_to_fpT = C --> fpT;
blanchet@49211
   450
blanchet@49276
   451
            fun mk_preds_getterss_join c n cps sum_prod_T cqfss =
blanchet@49276
   452
              Term.lambda c (mk_IfN sum_prod_T cps
blanchet@49276
   453
                (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)));
blanchet@49275
   454
blanchet@49276
   455
            fun generate_coiter_like (suf, fp_iter_like, ((pfss, cqfsss), (f_sum_prod_Ts,
blanchet@49274
   456
                pf_Tss))) =
blanchet@49211
   457
              let
blanchet@49211
   458
                val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
blanchet@49336
   459
                val binding = Binding.suffix_name ("_" ^ suf) fp_b;
blanchet@49211
   460
                val spec =
blanchet@49336
   461
                  mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)),
blanchet@49211
   462
                    Term.list_comb (fp_iter_like,
blanchet@49276
   463
                      map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss));
blanchet@49336
   464
              in (binding, spec) end;
blanchet@49210
   465
blanchet@49300
   466
            val coiter_like_infos =
blanchet@49215
   467
              [(coiterN, fp_iter, coiter_only),
blanchet@49215
   468
               (corecN, fp_rec, corec_only)];
blanchet@49212
   469
blanchet@49336
   470
            val (bindings, specs) = map generate_coiter_like coiter_like_infos |> split_list;
blanchet@49211
   471
blanchet@49211
   472
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49210
   473
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49210
   474
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
   475
                #>> apsnd snd) bindings specs
blanchet@49210
   476
              ||> `Local_Theory.restore;
blanchet@49210
   477
blanchet@49210
   478
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49210
   479
blanchet@49211
   480
            val [coiter_def, corec_def] = map (Morphism.thm phi) defs;
blanchet@49210
   481
blanchet@49211
   482
            val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts;
blanchet@49210
   483
          in
blanchet@49370
   484
            ((ctrs, selss0, coiter, corec, xss, ctr_defs, discIs, sel_thmss, coiter_def, corec_def),
blanchet@49370
   485
             lthy)
blanchet@49210
   486
          end;
blanchet@49286
   487
blanchet@49287
   488
        fun wrap lthy =
blanchet@49287
   489
          let val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss in
blanchet@49336
   490
            wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_bindings, (sel_bindingss,
blanchet@49287
   491
              sel_defaultss))) lthy
blanchet@49287
   492
          end;
blanchet@49287
   493
blanchet@49287
   494
        val define_iter_likes = if lfp then define_iter_rec else define_coiter_corec;
blanchet@49119
   495
      in
blanchet@49287
   496
        ((wrap, define_iter_likes), lthy')
blanchet@49119
   497
      end;
blanchet@49167
   498
blanchet@49368
   499
    (* TODO: remove all "nested" and "nesting" BNFs from pre_bnfs, if they're there ### *)
blanchet@49226
   500
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@49342
   501
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
blanchet@49368
   502
    val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs;
blanchet@49363
   503
    val nesting_map_ids = map map_id_of_bnf nesting_bnfs;
blanchet@49226
   504
blanchet@49214
   505
    fun mk_map Ts Us t =
blanchet@49217
   506
      let val (Type (_, Ts0), Type (_, Us0)) = strip_map_type (fastype_of t) |>> List.last in
blanchet@49214
   507
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49214
   508
      end;
blanchet@49214
   509
blanchet@49234
   510
    fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) =
blanchet@49234
   511
      let
traytel@49236
   512
        val map0 = map_of_bnf (the (bnf_of lthy s));
blanchet@49234
   513
        val mapx = mk_map Ts Us map0;
blanchet@49234
   514
        val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx)))));
blanchet@49234
   515
        val args = map build_arg TUs;
blanchet@49234
   516
      in Term.list_comb (mapx, args) end;
blanchet@49234
   517
blanchet@49370
   518
    fun derive_induct_iter_rec_thms_for_types ((ctrss, _, iters, recs, xsss, ctr_defss, _, _,
blanchet@49337
   519
        iter_defs, rec_defs), lthy) =
blanchet@49202
   520
      let
blanchet@49370
   521
        val (((phis, phis'), vs'), names_lthy) =
blanchet@49370
   522
          lthy
blanchet@49370
   523
          |> mk_Frees' "P" (map mk_predT fpTs)
blanchet@49370
   524
          ||>> Variable.variant_fixes (map Binding.name_of fp_bs);
blanchet@49370
   525
blanchet@49370
   526
        val vs = map2 (curry Free) vs' fpTs;
blanchet@49370
   527
blanchet@49362
   528
        fun mk_sets_nested bnf =
blanchet@49362
   529
          let
blanchet@49362
   530
            val Type (T_name, Us) = T_of_bnf bnf;
blanchet@49362
   531
            val lives = lives_of_bnf bnf;
blanchet@49362
   532
            val sets = sets_of_bnf bnf;
blanchet@49362
   533
            fun mk_set U =
blanchet@49362
   534
              (case find_index (curry (op =) U) lives of
blanchet@49362
   535
                ~1 => Term.dummy
blanchet@49362
   536
              | i => nth sets i);
blanchet@49362
   537
          in
blanchet@49362
   538
            (T_name, map mk_set Us)
blanchet@49362
   539
          end;
blanchet@49362
   540
blanchet@49362
   541
        val setss_nested = map mk_sets_nested nested_bnfs;
blanchet@49362
   542
blanchet@49337
   543
        val (induct_thms, induct_thm) =
blanchet@49337
   544
          let
blanchet@49362
   545
            fun mk_set Ts t =
blanchet@49362
   546
              let val Type (_, Ts0) = domain_type (fastype_of t) in
blanchet@49362
   547
                Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49362
   548
              end;
blanchet@49362
   549
blanchet@49362
   550
            fun mk_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) =
blanchet@49361
   551
                (case find_index (curry (op =) T) fpTs of
blanchet@49362
   552
                  ~1 =>
blanchet@49362
   553
                  (case AList.lookup (op =) setss_nested T_name of
blanchet@49362
   554
                    NONE => []
blanchet@49362
   555
                  | SOME raw_sets0 =>
blanchet@49362
   556
                    let
blanchet@49362
   557
                      val (Ts, raw_sets) =
blanchet@49362
   558
                        split_list (filter (exists_fp_subtype o fst) (Ts0 ~~ raw_sets0));
blanchet@49362
   559
                      val sets = map (mk_set Ts0) raw_sets;
blanchet@49362
   560
                      val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
blanchet@49362
   561
                      val heads =
blanchet@49362
   562
                        map2 (fn y => fn set => HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x)))
blanchet@49362
   563
                          ys sets;
blanchet@49362
   564
                      val bodies = flat (map (mk_prem_prems names_lthy') ys);
blanchet@49362
   565
                    in
blanchet@49362
   566
                      map2 (curry Logic.mk_implies) heads bodies
blanchet@49362
   567
                    end)
blanchet@49362
   568
                | i => [HOLogic.mk_Trueprop (nth phis i $ x)])
blanchet@49362
   569
              | mk_prem_prems _ _ = [];
blanchet@49342
   570
blanchet@49362
   571
            fun close_prem_prem (Free x') t =
blanchet@49367
   572
              fold_rev Logic.all
blanchet@49367
   573
                (map Free (drop (nn + 1) (rev (Term.add_frees t (x' :: phis'))))) t;
blanchet@49362
   574
blanchet@49368
   575
            fun mk_prem_triple phi ctr ctr_Ts =
blanchet@49362
   576
              let
blanchet@49362
   577
                val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
blanchet@49362
   578
                val prem_prems =
blanchet@49362
   579
                  maps (fn x => map (close_prem_prem x) (mk_prem_prems names_lthy' x)) xs;
blanchet@49362
   580
              in
blanchet@49368
   581
                (xs, prem_prems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs)))
blanchet@49361
   582
              end;
blanchet@49342
   583
blanchet@49368
   584
            val prem_tripless = map3 (map2 o mk_prem_triple) phis ctrss ctr_Tsss;
blanchet@49368
   585
blanchet@49368
   586
            fun mk_prem (xs, prem_prems, concl) =
blanchet@49368
   587
              fold_rev Logic.all xs (Logic.list_implies (prem_prems, concl));
blanchet@49368
   588
blanchet@49361
   589
            val goal =
blanchet@49368
   590
              Library.foldr (Logic.list_implies o apfst (map mk_prem)) (prem_tripless,
blanchet@49368
   591
                HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@49368
   592
                  (map2 (curry (op $)) phis vs)));
blanchet@49368
   593
blanchet@49368
   594
            val rss = map (map (length o #2)) prem_tripless;
blanchet@49368
   595
blanchet@49368
   596
            val fld_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss);
blanchet@49342
   597
blanchet@49342
   598
            val induct_thm =
blanchet@49361
   599
              Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49368
   600
                mk_induct_tac ctxt ns mss rss (flat ctr_defss) fld_induct' pre_set_defss
blanchet@49368
   601
                  nested_set_natural's)
blanchet@49368
   602
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49337
   603
          in
blanchet@49367
   604
            `(conj_dests nn) induct_thm
blanchet@49337
   605
          end;
blanchet@49201
   606
blanchet@49202
   607
        val (iter_thmss, rec_thmss) =
blanchet@49207
   608
          let
blanchet@49337
   609
            val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
blanchet@49337
   610
            val giters = map (lists_bmoc gss) iters;
blanchet@49337
   611
            val hrecs = map (lists_bmoc hss) recs;
blanchet@49337
   612
blanchet@49212
   613
            fun mk_goal_iter_like fss fiter_like xctr f xs fxs =
blanchet@49207
   614
              fold_rev (fold_rev Logic.all) (xs :: fss)
blanchet@49212
   615
                (mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs)));
blanchet@49204
   616
blanchet@49234
   617
            fun build_call fiter_likes maybe_tick (T, U) =
blanchet@49234
   618
              if T = U then
blanchet@49368
   619
                id_const T
blanchet@49234
   620
              else
blanchet@49234
   621
                (case find_index (curry (op =) T) fpTs of
blanchet@49234
   622
                  ~1 => build_map (build_call fiter_likes maybe_tick) T U
blanchet@49234
   623
                | j => maybe_tick (nth vs j) (nth fiter_likes j));
blanchet@49233
   624
blanchet@49274
   625
            fun mk_U maybe_mk_prodT =
blanchet@49274
   626
              typ_subst (map2 (fn fpT => fn C => (fpT, maybe_mk_prodT fpT C)) fpTs Cs);
blanchet@49214
   627
blanchet@49342
   628
            fun intr_calls fiter_likes maybe_cons maybe_tick maybe_mk_prodT (x as Free (_, T)) =
blanchet@49214
   629
              if member (op =) fpTs T then
blanchet@49233
   630
                maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x]
blanchet@49362
   631
              else if exists_fp_subtype T then
blanchet@49274
   632
                [build_call fiter_likes maybe_tick (T, mk_U maybe_mk_prodT T) $ x]
blanchet@49214
   633
              else
blanchet@49214
   634
                [x];
blanchet@49214
   635
blanchet@49342
   636
            val gxsss = map (map (maps (intr_calls giters (K I) (K I) (K I)))) xsss;
blanchet@49342
   637
            val hxsss = map (map (maps (intr_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss;
blanchet@49204
   638
blanchet@49212
   639
            val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss;
blanchet@49212
   640
            val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss;
blanchet@49204
   641
blanchet@49203
   642
            val iter_tacss =
blanchet@49363
   643
              map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids iter_defs) fp_iter_thms
blanchet@49363
   644
                ctr_defss;
blanchet@49203
   645
            val rec_tacss =
blanchet@49363
   646
              map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms
blanchet@49363
   647
                ctr_defss;
blanchet@49202
   648
          in
blanchet@49276
   649
            (map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
blanchet@49205
   650
               goal_iterss iter_tacss,
blanchet@49276
   651
             map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
blanchet@49205
   652
               goal_recss rec_tacss)
blanchet@49202
   653
          end;
blanchet@49201
   654
blanchet@49337
   655
        val common_notes =
blanchet@49367
   656
          (if nn > 1 then [(inductN, [induct_thm], [])] (* FIXME: attribs *) else [])
blanchet@49337
   657
          |> map (fn (thmN, thms, attrs) =>
blanchet@49337
   658
              ((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49337
   659
blanchet@49226
   660
        val notes =
blanchet@49342
   661
          [(inductN, map single induct_thms, []), (* FIXME: attribs *)
blanchet@49342
   662
           (itersN, iter_thmss, simp_attrs),
blanchet@49300
   663
           (recsN, rec_thmss, Code.add_default_eqn_attrib :: simp_attrs)]
blanchet@49300
   664
          |> maps (fn (thmN, thmss, attrs) =>
blanchet@49202
   665
            map2 (fn b => fn thms =>
blanchet@49300
   666
              ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs),
blanchet@49302
   667
                [(thms, [])])) fp_bs thmss);
blanchet@49202
   668
      in
blanchet@49337
   669
        lthy |> Local_Theory.notes (common_notes @ notes) |> snd
blanchet@49202
   670
      end;
blanchet@49202
   671
blanchet@49370
   672
    fun derive_coinduct_coiter_corec_thms_for_types ((ctrss, selsss, coiters, corecs, _, ctr_defss,
blanchet@49370
   673
        discIss, sel_thmsss, coiter_defs, corec_defs), lthy) =
blanchet@49212
   674
      let
blanchet@49370
   675
        val (vs', names_lthy) =
blanchet@49370
   676
          lthy
blanchet@49370
   677
          |> Variable.variant_fixes (map Binding.name_of fp_bs);
blanchet@49370
   678
blanchet@49370
   679
        val vs = map2 (curry Free) vs' fpTs;
blanchet@49370
   680
blanchet@49337
   681
        val (coinduct_thms, coinduct_thm) =
blanchet@49337
   682
          let
blanchet@49337
   683
            val coinduct_thm = fp_induct;
blanchet@49337
   684
          in
blanchet@49367
   685
            `(conj_dests nn) coinduct_thm
blanchet@49337
   686
          end;
blanchet@49212
   687
blanchet@49212
   688
        val (coiter_thmss, corec_thmss) =
blanchet@49212
   689
          let
blanchet@49337
   690
            val z = the_single zs;
blanchet@49337
   691
            val gcoiters = map (lists_bmoc pgss) coiters;
blanchet@49337
   692
            val hcorecs = map (lists_bmoc phss) corecs;
blanchet@49337
   693
blanchet@49232
   694
            fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not);
blanchet@49212
   695
blanchet@49276
   696
            fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' =
blanchet@49212
   697
              fold_rev (fold_rev Logic.all) ([c] :: pfss)
blanchet@49232
   698
                (Logic.list_implies (seq_conds mk_goal_cond n k cps,
blanchet@49276
   699
                   mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs'))));
blanchet@49212
   700
blanchet@49234
   701
            fun build_call fiter_likes maybe_tack (T, U) =
blanchet@49234
   702
              if T = U then
blanchet@49368
   703
                id_const T
blanchet@49234
   704
              else
blanchet@49234
   705
                (case find_index (curry (op =) U) fpTs of
blanchet@49234
   706
                  ~1 => build_map (build_call fiter_likes maybe_tack) T U
blanchet@49234
   707
                | j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j));
blanchet@49233
   708
blanchet@49274
   709
            fun mk_U maybe_mk_sumT =
blanchet@49274
   710
              typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs);
blanchet@49212
   711
blanchet@49342
   712
            fun intr_calls fiter_likes maybe_mk_sumT maybe_tack cqf =
blanchet@49276
   713
              let val T = fastype_of cqf in
blanchet@49276
   714
                if exists_subtype (member (op =) Cs) T then
blanchet@49276
   715
                  build_call fiter_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf
blanchet@49276
   716
                else
blanchet@49276
   717
                  cqf
blanchet@49276
   718
              end;
blanchet@49232
   719
blanchet@49342
   720
            val crgsss' = map (map (map (intr_calls gcoiters (K I) (K I)))) crgsss;
blanchet@49342
   721
            val cshsss' = map (map (map (intr_calls hcorecs (curry mk_sumT) (tack z)))) cshsss;
blanchet@49212
   722
blanchet@49212
   723
            val goal_coiterss =
blanchet@49276
   724
              map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss crgsss';
blanchet@49233
   725
            val goal_corecss =
blanchet@49276
   726
              map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss cshsss';
blanchet@49213
   727
blanchet@49213
   728
            val coiter_tacss =
blanchet@49363
   729
              map3 (map oo mk_coiter_like_tac coiter_defs nesting_map_ids) fp_iter_thms pre_map_defs
blanchet@49226
   730
                ctr_defss;
blanchet@49233
   731
            val corec_tacss =
blanchet@49363
   732
              map3 (map oo mk_coiter_like_tac corec_defs nesting_map_ids) fp_rec_thms pre_map_defs
blanchet@49233
   733
                ctr_defss;
blanchet@49212
   734
          in
blanchet@49276
   735
            (map2 (map2 (fn goal => fn tac =>
blanchet@49276
   736
                 Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation))
blanchet@49213
   737
               goal_coiterss coiter_tacss,
blanchet@49276
   738
             map2 (map2 (fn goal => fn tac =>
blanchet@49276
   739
                 Skip_Proof.prove lthy [] [] goal (tac o #context)
blanchet@49276
   740
                 |> Local_Defs.unfold lthy @{thms sum_case_if} |> Thm.close_derivation))
blanchet@49233
   741
               goal_corecss corec_tacss)
blanchet@49212
   742
          end;
blanchet@49212
   743
blanchet@49266
   744
        fun mk_disc_coiter_like_thms [_] = K []
blanchet@49266
   745
          | mk_disc_coiter_like_thms thms = map2 (curry (op RS)) thms;
blanchet@49266
   746
blanchet@49266
   747
        val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss;
blanchet@49266
   748
        val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss;
blanchet@49266
   749
blanchet@49267
   750
        fun mk_sel_coiter_like_thm coiter_like_thm sel0 sel_thm =
blanchet@49266
   751
          let
blanchet@49267
   752
            val (domT, ranT) = dest_funT (fastype_of sel0);
blanchet@49266
   753
            val arg_cong' =
blanchet@49266
   754
              Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
blanchet@49267
   755
                [NONE, NONE, SOME (certify lthy sel0)] arg_cong
blanchet@49267
   756
              |> Thm.varifyT_global;
blanchet@49266
   757
            val sel_thm' = sel_thm RSN (2, trans);
blanchet@49266
   758
          in
blanchet@49267
   759
            coiter_like_thm RS arg_cong' RS sel_thm'
blanchet@49266
   760
          end;
blanchet@49266
   761
blanchet@49266
   762
        val sel_coiter_thmsss =
blanchet@49266
   763
          map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss;
blanchet@49266
   764
        val sel_corec_thmsss =
blanchet@49267
   765
          map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss;
blanchet@49266
   766
blanchet@49342
   767
        val common_notes =
blanchet@49367
   768
          (if nn > 1 then [(coinductN, [coinduct_thm], [])] (* FIXME: attribs *) else [])
blanchet@49342
   769
          |> map (fn (thmN, thms, attrs) =>
blanchet@49342
   770
              ((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49342
   771
blanchet@49212
   772
        val notes =
blanchet@49342
   773
          [(coinductN, map single coinduct_thms, []), (* FIXME: attribs *)
blanchet@49342
   774
           (coitersN, coiter_thmss, []),
blanchet@49300
   775
           (disc_coitersN, disc_coiter_thmss, []),
blanchet@49300
   776
           (sel_coitersN, map flat sel_coiter_thmsss, []),
blanchet@49300
   777
           (corecsN, corec_thmss, []),
blanchet@49300
   778
           (disc_corecsN, disc_corec_thmss, []),
blanchet@49300
   779
           (sel_corecsN, map flat sel_corec_thmsss, [])]
blanchet@49300
   780
          |> maps (fn (thmN, thmss, attrs) =>
blanchet@49266
   781
            map_filter (fn (_, []) => NONE | (b, thms) =>
blanchet@49300
   782
              SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs),
blanchet@49302
   783
                [(thms, [])])) (fp_bs ~~ thmss));
blanchet@49212
   784
      in
blanchet@49361
   785
        lthy |> Local_Theory.notes (common_notes @ notes) |> snd
blanchet@49212
   786
      end;
blanchet@49212
   787
blanchet@49287
   788
    fun wrap_types_and_define_iter_likes ((wraps, define_iter_likess), lthy) =
blanchet@49370
   789
      fold_map2 (curry (op o)) define_iter_likess wraps lthy |>> split_list10
blanchet@49287
   790
blanchet@49204
   791
    val lthy' = lthy
blanchet@49370
   792
      |> fold_map define_ctrs_case_for_type (fp_bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~
blanchet@49370
   793
        fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_bindingss ~~
blanchet@49370
   794
        ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ raw_sel_defaultsss)
blanchet@49287
   795
      |>> split_list |> wrap_types_and_define_iter_likes
blanchet@49337
   796
      |> (if lfp then derive_induct_iter_rec_thms_for_types
blanchet@49337
   797
          else derive_coinduct_coiter_corec_thms_for_types);
blanchet@49167
   798
blanchet@49167
   799
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
blanchet@49208
   800
      (if lfp then "" else "co") ^ "datatype"));
blanchet@49112
   801
  in
blanchet@49308
   802
    timer; lthy'
blanchet@49112
   803
  end;
blanchet@49112
   804
blanchet@49298
   805
val datatyp = define_datatype (K I) (K I) (K I);
blanchet@49297
   806
blanchet@49298
   807
val datatype_cmd = define_datatype Typedecl.read_constraint Syntax.parse_typ Syntax.read_term;
blanchet@49119
   808
blanchet@49329
   809
val parse_binding_colon = Parse.binding --| @{keyword ":"};
blanchet@49336
   810
val parse_opt_binding_colon = Scan.optional parse_binding_colon no_binding;
blanchet@49119
   811
blanchet@49112
   812
val parse_ctr_arg =
blanchet@49329
   813
  @{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} ||
blanchet@49336
   814
  (Parse.typ >> pair no_binding);
blanchet@49112
   815
blanchet@49286
   816
val parse_defaults =
blanchet@49286
   817
  @{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"};
blanchet@49286
   818
blanchet@49112
   819
val parse_single_spec =
blanchet@49112
   820
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
blanchet@49119
   821
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
blanchet@49286
   822
    Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix));
blanchet@49112
   823
blanchet@49278
   824
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec;
blanchet@49278
   825
blanchet@49308
   826
fun parse_datatype_cmd lfp construct = parse_datatype >> datatype_cmd lfp construct;
blanchet@49112
   827
blanchet@49112
   828
end;