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