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