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