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