src/HOL/BNF/Tools/bnf_fp_sugar.ML
author blanchet
Wed Sep 26 10:00:59 2012 +0200 (2012-09-26)
changeset 49587 33cf557c7849
parent 49585 5c4a12550491
child 49590 43e2d0e10876
permissions -rw-r--r--
name tuning
blanchet@49509
     1
(*  Title:      HOL/BNF/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@49536
    10
  val datatypes: 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@49585
    13
      (BNF_Def.BNF list * term list * term list * term list * term list * thm * thm list *
blanchet@49585
    14
         thm list * thm list * thm list * thm list list * thm list * thm list * thm list) *
blanchet@49585
    15
      local_theory) ->
blanchet@49298
    16
    bool * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) *
blanchet@49297
    17
      (binding * typ) list) * (binding * term) list) * mixfix) list) list ->
blanchet@49297
    18
    local_theory -> local_theory
blanchet@49308
    19
  val parse_datatype_cmd: bool ->
blanchet@49308
    20
    (mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list ->
blanchet@49308
    21
      BNF_Def.BNF list -> local_theory ->
blanchet@49585
    22
      (BNF_Def.BNF list * term list * term list * term list * term list * thm * thm list *
blanchet@49585
    23
         thm list * thm list * thm list * thm list list * thm list * thm list * thm list) *
blanchet@49585
    24
      local_theory) ->
blanchet@49308
    25
    (local_theory -> local_theory) parser
blanchet@49112
    26
end;
blanchet@49112
    27
blanchet@49112
    28
structure BNF_FP_Sugar : BNF_FP_SUGAR =
blanchet@49112
    29
struct
blanchet@49112
    30
blanchet@49119
    31
open BNF_Util
blanchet@49119
    32
open BNF_Wrap
blanchet@49214
    33
open BNF_Def
blanchet@49457
    34
open BNF_FP
blanchet@49123
    35
open BNF_FP_Sugar_Tactics
blanchet@49119
    36
blanchet@49300
    37
val simp_attrs = @{attributes [simp]};
blanchet@49585
    38
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs;
blanchet@49300
    39
blanchet@49585
    40
fun split_list4 xs = (map #1 xs, map #2 xs, map #3 xs, map #4 xs);
blanchet@49214
    41
blanchet@49342
    42
fun resort_tfree S (TFree (s, _)) = TFree (s, S);
blanchet@49342
    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@49583
    50
fun variant_types ss Ss ctxt =
blanchet@49583
    51
  let
blanchet@49583
    52
    val (tfrees, _) =
blanchet@49583
    53
      fold_map2 (fn s => fn S => Name.variant s #> apfst (rpair S)) ss Ss (Variable.names_of ctxt);
blanchet@49583
    54
    val ctxt' = fold (Variable.declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
blanchet@49583
    55
  in (tfrees, ctxt') end;
blanchet@49583
    56
blanchet@49297
    57
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
blanchet@49202
    58
blanchet@49200
    59
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
blanchet@49200
    60
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
blanchet@49202
    61
fun mk_uncurried2_fun f xss =
blanchet@49200
    62
  mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
blanchet@49200
    63
blanchet@49585
    64
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) =
blanchet@49585
    65
  Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1));
blanchet@49585
    66
blanchet@49585
    67
fun flip_rels lthy n thm =
blanchet@49585
    68
  let
blanchet@49585
    69
    val Rs = Term.add_vars (prop_of thm) [];
blanchet@49585
    70
    val Rs' = rev (drop (length Rs - n) Rs);
blanchet@49585
    71
    val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs';
blanchet@49585
    72
  in
blanchet@49585
    73
    Drule.cterm_instantiate cRs thm
blanchet@49585
    74
  end;
blanchet@49585
    75
blanchet@49536
    76
fun mk_ctor_or_dtor get_T Ts t =
blanchet@49536
    77
  let val Type (_, Ts0) = get_T (fastype_of t) in
blanchet@49536
    78
    Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49536
    79
  end;
blanchet@49536
    80
blanchet@49536
    81
val mk_ctor = mk_ctor_or_dtor range_type;
blanchet@49536
    82
val mk_dtor = mk_ctor_or_dtor domain_type;
blanchet@49536
    83
blanchet@49536
    84
fun mk_rec_like lfp Ts Us t =
blanchet@49536
    85
  let
blanchet@49536
    86
    val (bindings, body) = strip_type (fastype_of t);
blanchet@49536
    87
    val (f_Us, prebody) = split_last bindings;
blanchet@49536
    88
    val Type (_, Ts0) = if lfp then prebody else body;
blanchet@49536
    89
    val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
blanchet@49536
    90
  in
blanchet@49536
    91
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49536
    92
  end;
blanchet@49536
    93
blanchet@49536
    94
fun mk_map live Ts Us t =
blanchet@49536
    95
  let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) |>> List.last in
blanchet@49536
    96
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49536
    97
  end;
blanchet@49536
    98
blanchet@49585
    99
fun liveness_of_fp_bnf n bnf =
blanchet@49585
   100
  (case T_of_bnf bnf of
blanchet@49585
   101
    Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts
blanchet@49585
   102
  | _ => replicate n false);
blanchet@49536
   103
blanchet@49498
   104
fun tick u f = Term.lambda u (HOLogic.mk_prod (u, f $ u));
blanchet@49233
   105
blanchet@49498
   106
fun tack z_name (c, u) f =
blanchet@49498
   107
  let val z = Free (z_name, mk_sumT (fastype_of u, fastype_of c)) in
blanchet@49498
   108
    Term.lambda z (mk_sum_case (Term.lambda u u, Term.lambda c (f $ c)) $ z)
blanchet@49273
   109
  end;
blanchet@49214
   110
blanchet@49124
   111
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
blanchet@49119
   112
blanchet@49298
   113
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types ();
blanchet@49119
   114
blanchet@49298
   115
fun merge_type_args (As, As') =
blanchet@49298
   116
  if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types ();
blanchet@49119
   117
blanchet@49479
   118
fun is_triv_implies thm =
blanchet@49479
   119
  op aconv (Logic.dest_implies (Thm.prop_of thm))
blanchet@49479
   120
  handle TERM _ => false;
blanchet@49479
   121
blanchet@49121
   122
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
blanchet@49336
   123
fun type_binding_of (((_, b), _), _) = b;
blanchet@49181
   124
fun mixfix_of ((_, mx), _) = mx;
blanchet@49121
   125
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
blanchet@49119
   126
blanchet@49286
   127
fun disc_of ((((disc, _), _), _), _) = disc;
blanchet@49286
   128
fun ctr_of ((((_, ctr), _), _), _) = ctr;
blanchet@49286
   129
fun args_of (((_, args), _), _) = args;
blanchet@49286
   130
fun defaults_of ((_, ds), _) = ds;
blanchet@49181
   131
fun ctr_mixfix_of (_, mx) = mx;
blanchet@49119
   132
blanchet@49585
   133
fun define_datatypes prepare_constraint prepare_typ prepare_term lfp construct_fp (no_dests, specs)
blanchet@49298
   134
    no_defs_lthy0 =
blanchet@49112
   135
  let
blanchet@49298
   136
    (* TODO: sanity checks on arguments *)
blanchet@49478
   137
    (* TODO: integration with function package ("size") *)
blanchet@49298
   138
blanchet@49286
   139
    val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes"
blanchet@49278
   140
      else ();
blanchet@49278
   141
blanchet@49367
   142
    val nn = length specs;
blanchet@49361
   143
    val fp_bs = map type_binding_of specs;
blanchet@49498
   144
    val fp_b_names = map Binding.name_of fp_bs;
blanchet@49498
   145
    val fp_common_name = mk_common_name fp_b_names;
blanchet@49298
   146
blanchet@49298
   147
    fun prepare_type_arg (ty, c) =
blanchet@49298
   148
      let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
blanchet@49298
   149
        TFree (s, prepare_constraint no_defs_lthy0 c)
blanchet@49298
   150
      end;
blanchet@49298
   151
blanchet@49298
   152
    val Ass0 = map (map prepare_type_arg o type_args_constrained_of) specs;
blanchet@49298
   153
    val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0;
blanchet@49298
   154
    val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0;
blanchet@49119
   155
blanchet@49585
   156
    val (((Bs0, Cs), Xs), no_defs_lthy) =
blanchet@49298
   157
      no_defs_lthy0
blanchet@49298
   158
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
blanchet@49585
   159
      |> mk_TFrees (length unsorted_As)
blanchet@49585
   160
      ||>> mk_TFrees nn
blanchet@49585
   161
      ||>> apfst (map TFree) o
blanchet@49585
   162
        variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS);
blanchet@49119
   163
blanchet@49298
   164
    (* TODO: cleaner handling of fake contexts, without "background_theory" *)
blanchet@49298
   165
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
blanchet@49298
   166
      locale and shadows an existing global type*)
blanchet@49298
   167
    val fake_thy =
blanchet@49298
   168
      Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy
blanchet@49336
   169
        (type_binding_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
blanchet@49298
   170
    val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy;
blanchet@49119
   171
blanchet@49182
   172
    fun mk_fake_T b =
blanchet@49121
   173
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
blanchet@49298
   174
        unsorted_As);
blanchet@49121
   175
blanchet@49302
   176
    val fake_Ts = map mk_fake_T fp_bs;
blanchet@49121
   177
blanchet@49181
   178
    val mixfixes = map mixfix_of specs;
blanchet@49119
   179
blanchet@49302
   180
    val _ = (case duplicates Binding.eq_name fp_bs of [] => ()
blanchet@49119
   181
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
   182
blanchet@49121
   183
    val ctr_specss = map ctr_specs_of specs;
blanchet@49119
   184
blanchet@49336
   185
    val disc_bindingss = map (map disc_of) ctr_specss;
blanchet@49336
   186
    val ctr_bindingss =
blanchet@49498
   187
      map2 (fn fp_b_name => map (Binding.qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss;
blanchet@49121
   188
    val ctr_argsss = map (map args_of) ctr_specss;
blanchet@49181
   189
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
blanchet@49119
   190
blanchet@49336
   191
    val sel_bindingsss = map (map (map fst)) ctr_argsss;
blanchet@49298
   192
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@49286
   193
    val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
blanchet@49286
   194
blanchet@49308
   195
    val (As :: _) :: fake_ctr_Tsss =
blanchet@49298
   196
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
blanchet@49298
   197
blanchet@49298
   198
    val _ = (case duplicates (op =) unsorted_As of [] => ()
blanchet@49298
   199
      | A :: _ => error ("Duplicate type parameter " ^
blanchet@49298
   200
          quote (Syntax.string_of_typ no_defs_lthy A)));
blanchet@49298
   201
blanchet@49183
   202
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
blanchet@49298
   203
    val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of
blanchet@49165
   204
        [] => ()
blanchet@49342
   205
      | A' :: _ => error ("Extra type variable on right-hand side: " ^
blanchet@49204
   206
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
blanchet@49165
   207
blanchet@49204
   208
    fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) =
blanchet@49146
   209
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
blanchet@49146
   210
          quote (Syntax.string_of_typ fake_lthy T)))
blanchet@49204
   211
      | eq_fpT _ _ = false;
blanchet@49146
   212
blanchet@49204
   213
    fun freeze_fp (T as Type (s, Us)) =
blanchet@49536
   214
        (case find_index (eq_fpT T) fake_Ts of ~1 => Type (s, map freeze_fp Us) | j => nth Xs j)
blanchet@49204
   215
      | freeze_fp T = T;
blanchet@49121
   216
blanchet@49536
   217
    val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss;
blanchet@49536
   218
    val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs;
blanchet@49119
   219
blanchet@49298
   220
    val fp_eqs =
blanchet@49536
   221
      map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs;
blanchet@49121
   222
blanchet@49585
   223
    (* TODO: clean up list *)
blanchet@49585
   224
    val (pre_bnfs, ((fp_bnfs as any_fp_bnf :: _, dtors0, ctors0, fp_folds0, fp_recs0, fp_induct,
blanchet@49585
   225
           dtor_ctors, ctor_dtors, ctor_injects, fp_map_thms, fp_set_thmss, fp_rel_thms,
blanchet@49585
   226
           fp_fold_thms, fp_rec_thms), lthy)) =
blanchet@49585
   227
      fp_bnf construct_fp fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0;
blanchet@49585
   228
blanchet@49585
   229
    val timer = time (Timer.startRealTimer ());
blanchet@49121
   230
blanchet@49363
   231
    fun add_nesty_bnf_names Us =
blanchet@49226
   232
      let
blanchet@49226
   233
        fun add (Type (s, Ts)) ss =
blanchet@49226
   234
            let val (needs, ss') = fold_map add Ts ss in
blanchet@49226
   235
              if exists I needs then (true, insert (op =) s ss') else (false, ss')
blanchet@49226
   236
            end
blanchet@49363
   237
          | add T ss = (member (op =) Us T, ss);
blanchet@49226
   238
      in snd oo add end;
blanchet@49226
   239
blanchet@49363
   240
    fun nesty_bnfs Us =
blanchet@49536
   241
      map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []);
blanchet@49363
   242
blanchet@49363
   243
    val nesting_bnfs = nesty_bnfs As;
blanchet@49536
   244
    val nested_bnfs = nesty_bnfs Xs;
blanchet@49226
   245
blanchet@49585
   246
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@49585
   247
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
blanchet@49585
   248
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
blanchet@49585
   249
    val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs;
blanchet@49585
   250
    val nesting_set_natural's = maps set_natural'_of_bnf nesting_bnfs;
blanchet@49585
   251
    val nesting_map_ids = map map_id_of_bnf nesting_bnfs;
blanchet@49585
   252
blanchet@49585
   253
    val live = live_of_bnf any_fp_bnf;
blanchet@49585
   254
blanchet@49585
   255
    val Bs =
blanchet@49585
   256
      map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A)
blanchet@49585
   257
        (liveness_of_fp_bnf (length As) any_fp_bnf) As Bs0;
blanchet@49585
   258
blanchet@49585
   259
    val B_ify = Term.typ_subst_atomic (As ~~ Bs);
blanchet@49167
   260
blanchet@49501
   261
    val ctors = map (mk_ctor As) ctors0;
blanchet@49501
   262
    val dtors = map (mk_dtor As) dtors0;
blanchet@49124
   263
blanchet@49501
   264
    val fpTs = map (domain_type o fastype_of) dtors;
blanchet@49362
   265
blanchet@49362
   266
    val exists_fp_subtype = exists_subtype (member (op =) fpTs);
blanchet@49362
   267
blanchet@49536
   268
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs;
blanchet@49203
   269
    val ns = map length ctr_Tsss;
blanchet@49212
   270
    val kss = map (fn n => 1 upto n) ns;
blanchet@49203
   271
    val mss = map (map length) ctr_Tsss;
blanchet@49203
   272
    val Css = map2 replicate ns Cs;
blanchet@49203
   273
blanchet@49585
   274
    val fp_folds as any_fp_fold :: _ = map (mk_rec_like lfp As Cs) fp_folds0;
blanchet@49585
   275
    val fp_recs as any_fp_rec :: _ = map (mk_rec_like lfp As Cs) fp_recs0;
blanchet@49210
   276
blanchet@49585
   277
    val fp_fold_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_fold)));
blanchet@49585
   278
    val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_rec)));
blanchet@49204
   279
blanchet@49504
   280
    val (((fold_only as (gss, _, _), rec_only as (hss, _, _)),
blanchet@49504
   281
          (zs, cs, cpss, unfold_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))),
blanchet@49484
   282
         names_lthy) =
blanchet@49208
   283
      if lfp then
blanchet@49208
   284
        let
blanchet@49208
   285
          val y_Tsss =
blanchet@49255
   286
            map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type)
blanchet@49504
   287
              ns mss fp_fold_fun_Ts;
blanchet@49208
   288
          val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
blanchet@49208
   289
blanchet@49484
   290
          val ((gss, ysss), lthy) =
blanchet@49208
   291
            lthy
blanchet@49208
   292
            |> mk_Freess "f" g_Tss
blanchet@49208
   293
            ||>> mk_Freesss "x" y_Tsss;
blanchet@49274
   294
          val yssss = map (map (map single)) ysss;
blanchet@49274
   295
blanchet@49274
   296
          fun dest_rec_prodT (T as Type (@{type_name prod}, Us as [_, U])) =
blanchet@49274
   297
              if member (op =) Cs U then Us else [T]
blanchet@49274
   298
            | dest_rec_prodT T = [T];
blanchet@49204
   299
blanchet@49208
   300
          val z_Tssss =
blanchet@49274
   301
            map3 (fn n => fn ms => map2 (map dest_rec_prodT oo dest_tupleT) ms o
blanchet@49255
   302
              dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts;
blanchet@49208
   303
          val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
blanchet@49204
   304
blanchet@49298
   305
          val hss = map2 (map2 retype_free) h_Tss gss;
blanchet@49298
   306
          val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss;
blanchet@49484
   307
          val (zssss_tl, lthy) =
blanchet@49208
   308
            lthy
blanchet@49274
   309
            |> mk_Freessss "y" (map (map (map tl)) z_Tssss);
blanchet@49274
   310
          val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl;
blanchet@49210
   311
        in
blanchet@49484
   312
          ((((gss, g_Tss, yssss), (hss, h_Tss, zssss)),
blanchet@49484
   313
            ([], [], [], (([], []), ([], [])), (([], []), ([], [])))), lthy)
blanchet@49210
   314
        end
blanchet@49208
   315
      else
blanchet@49210
   316
        let
blanchet@49221
   317
          (*avoid "'a itself" arguments in coiterators and corecursors*)
blanchet@49221
   318
          val mss' =  map (fn [0] => [1] | ms => ms) mss;
blanchet@49221
   319
blanchet@49463
   320
          val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs;
blanchet@49275
   321
blanchet@49587
   322
          fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss);
blanchet@49211
   323
blanchet@49587
   324
          fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss
blanchet@49587
   325
            | flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
blanchet@49587
   326
              p :: flat_predss_getterss qss fss @ flat_preds_predsss_gettersss ps qsss fsss;
blanchet@49274
   327
blanchet@49274
   328
          fun mk_types maybe_dest_sumT fun_Ts =
blanchet@49212
   329
            let
blanchet@49212
   330
              val f_sum_prod_Ts = map range_type fun_Ts;
blanchet@49255
   331
              val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
blanchet@49275
   332
              val f_Tssss =
blanchet@49275
   333
                map3 (fn C => map2 (map (map (curry (op -->) C) o maybe_dest_sumT) oo dest_tupleT))
blanchet@49275
   334
                  Cs mss' f_prod_Tss;
blanchet@49275
   335
              val q_Tssss =
blanchet@49463
   336
                map (map (map (fn [_] => [] | [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss;
blanchet@49587
   337
              val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
blanchet@49275
   338
            in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end;
blanchet@49176
   339
blanchet@49504
   340
          val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_fold_fun_Ts;
blanchet@49211
   341
blanchet@49484
   342
          val ((((Free (z, _), cs), pss), gssss), lthy) =
blanchet@49210
   343
            lthy
blanchet@49233
   344
            |> yield_singleton (mk_Frees "z") dummyT
blanchet@49233
   345
            ||>> mk_Frees "a" Cs
blanchet@49211
   346
            ||>> mk_Freess "p" p_Tss
blanchet@49275
   347
            ||>> mk_Freessss "g" g_Tssss;
blanchet@49275
   348
          val rssss = map (map (map (fn [] => []))) r_Tssss;
blanchet@49274
   349
blanchet@49274
   350
          fun dest_corec_sumT (T as Type (@{type_name sum}, Us as [_, U])) =
blanchet@49274
   351
              if member (op =) Cs U then Us else [T]
blanchet@49274
   352
            | dest_corec_sumT T = [T];
blanchet@49274
   353
blanchet@49275
   354
          val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts;
blanchet@49210
   355
blanchet@49298
   356
          val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss;
blanchet@49484
   357
          val ((sssss, hssss_tl), lthy) =
blanchet@49275
   358
            lthy
blanchet@49275
   359
            |> mk_Freessss "q" s_Tssss
blanchet@49275
   360
            ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
blanchet@49275
   361
          val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
blanchet@49211
   362
blanchet@49212
   363
          val cpss = map2 (fn c => map (fn p => p $ c)) cs pss;
blanchet@49212
   364
blanchet@49276
   365
          fun mk_preds_getters_join [] [cf] = cf
blanchet@49276
   366
            | mk_preds_getters_join [cq] [cf, cf'] =
blanchet@49276
   367
              mk_If cq (mk_Inl (fastype_of cf') cf) (mk_Inr (fastype_of cf) cf');
blanchet@49276
   368
blanchet@49275
   369
          fun mk_terms qssss fssss =
blanchet@49212
   370
            let
blanchet@49587
   371
              val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss;
blanchet@49275
   372
              val cqssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs qssss;
blanchet@49274
   373
              val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss;
blanchet@49276
   374
              val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss;
blanchet@49276
   375
            in (pfss, cqfsss) end;
blanchet@49210
   376
        in
blanchet@49484
   377
          (((([], [], []), ([], [], [])),
blanchet@49484
   378
            ([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)),
blanchet@49484
   379
             (mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss)))), lthy)
blanchet@49210
   380
        end;
blanchet@49210
   381
blanchet@49585
   382
    fun define_ctrs_case_for_type (((((((((((((((((((((((((fp_bnf, fp_b), fpT), C), ctor), dtor),
blanchet@49585
   383
            fp_fold), fp_rec), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs),
blanchet@49585
   384
          pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), ctr_bindings),
blanchet@49585
   385
        ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy =
blanchet@49176
   386
      let
blanchet@49498
   387
        val fp_b_name = Binding.name_of fp_b;
blanchet@49498
   388
blanchet@49501
   389
        val dtorT = domain_type (fastype_of ctor);
blanchet@49210
   390
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
blanchet@49255
   391
        val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
blanchet@49134
   392
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
blanchet@49119
   393
blanchet@49536
   394
        val (((((w, fs), xss), yss), u'), _) =
blanchet@49204
   395
          no_defs_lthy
blanchet@49501
   396
          |> yield_singleton (mk_Frees "w") dtorT
blanchet@49176
   397
          ||>> mk_Frees "f" case_Ts
blanchet@49370
   398
          ||>> mk_Freess "x" ctr_Tss
blanchet@49585
   399
          ||>> mk_Freess "y" (map (map B_ify) ctr_Tss)
blanchet@49498
   400
          ||>> yield_singleton Variable.variant_fixes fp_b_name;
blanchet@49370
   401
blanchet@49498
   402
        val u = Free (u', fpT);
blanchet@49121
   403
blanchet@49585
   404
        val tuple_xs = map HOLogic.mk_tuple xss;
blanchet@49585
   405
        val tuple_ys = map HOLogic.mk_tuple yss;
blanchet@49585
   406
blanchet@49129
   407
        val ctr_rhss =
blanchet@49585
   408
          map3 (fn k => fn xs => fn tuple_x => fold_rev Term.lambda xs (ctor $
blanchet@49585
   409
            mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs;
blanchet@49121
   410
blanchet@49336
   411
        val case_binding = Binding.suffix_name ("_" ^ caseN) fp_b;
blanchet@49129
   412
blanchet@49134
   413
        val case_rhs =
blanchet@49498
   414
          fold_rev Term.lambda (fs @ [u])
blanchet@49501
   415
            (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u));
blanchet@49129
   416
blanchet@49201
   417
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
blanchet@49169
   418
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
blanchet@49302
   419
              Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
blanchet@49336
   420
            (case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
blanchet@49121
   421
          ||> `Local_Theory.restore;
blanchet@49121
   422
blanchet@49121
   423
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
   424
blanchet@49121
   425
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49585
   426
        val ctr_defs' =
blanchet@49585
   427
          map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs;
blanchet@49130
   428
        val case_def = Morphism.thm phi raw_case_def;
blanchet@49130
   429
blanchet@49203
   430
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
blanchet@49203
   431
        val casex0 = Morphism.term phi raw_case;
blanchet@49203
   432
blanchet@49203
   433
        val ctrs = map (mk_ctr As) ctrs0;
blanchet@49121
   434
blanchet@49585
   435
        fun wrap lthy =
blanchet@49123
   436
          let
blanchet@49585
   437
            fun exhaust_tac {context = ctxt, ...} =
blanchet@49135
   438
              let
blanchet@49585
   439
                val ctor_iff_dtor_thm =
blanchet@49585
   440
                  let
blanchet@49585
   441
                    val goal =
blanchet@49585
   442
                      fold_rev Logic.all [w, u]
blanchet@49585
   443
                        (mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w)));
blanchet@49585
   444
                  in
blanchet@49585
   445
                    Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49585
   446
                      mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [dtorT, fpT])
blanchet@49585
   447
                        (certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor)
blanchet@49585
   448
                    |> Thm.close_derivation
blanchet@49585
   449
                    |> Morphism.thm phi
blanchet@49585
   450
                  end;
blanchet@49585
   451
blanchet@49585
   452
                val sumEN_thm' =
blanchet@49585
   453
                  unfold_thms lthy @{thms all_unit_eq}
blanchet@49585
   454
                    (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
blanchet@49585
   455
                       (mk_sumEN_balanced n))
blanchet@49585
   456
                  |> Morphism.thm phi;
blanchet@49135
   457
              in
blanchet@49585
   458
                mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm'
blanchet@49135
   459
              end;
blanchet@49135
   460
blanchet@49585
   461
            val inject_tacss =
blanchet@49585
   462
              map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
blanchet@49585
   463
                  mk_inject_tac ctxt ctr_def ctor_inject]) ms ctr_defs;
blanchet@49585
   464
blanchet@49585
   465
            val half_distinct_tacss =
blanchet@49585
   466
              map (map (fn (def, def') => fn {context = ctxt, ...} =>
blanchet@49585
   467
                mk_half_distinct_tac ctxt ctor_inject [def, def'])) (mk_half_pairss (`I ctr_defs));
blanchet@49585
   468
blanchet@49585
   469
            val case_tacs =
blanchet@49585
   470
              map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
blanchet@49585
   471
                mk_case_tac ctxt n k m case_def ctr_def dtor_ctor) ks ms ctr_defs;
blanchet@49585
   472
blanchet@49585
   473
            val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
blanchet@49585
   474
blanchet@49585
   475
            val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss
blanchet@49123
   476
          in
blanchet@49585
   477
            wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_bindings, (sel_bindingss,
blanchet@49585
   478
              sel_defaultss))) lthy
blanchet@49123
   479
          end;
blanchet@49121
   480
blanchet@49585
   481
        fun derive_maps_sets_rels (wrap_res, lthy) =
blanchet@49585
   482
          let
blanchet@49585
   483
            val rel_flip = rel_flip_of_bnf fp_bnf;
blanchet@49585
   484
            val nones = replicate live NONE;
blanchet@49585
   485
blanchet@49585
   486
            val ctor_cong =
blanchet@49585
   487
              if lfp then Drule.dummy_thm
blanchet@49585
   488
              else cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor)] arg_cong;
blanchet@49585
   489
blanchet@49585
   490
            fun mk_cIn ify =
blanchet@49585
   491
              certify lthy o (not lfp ? curry (op $) (map_types ify ctor)) oo
blanchet@49585
   492
              mk_InN_balanced (ify ctr_sum_prod_T) n;
blanchet@49585
   493
blanchet@49585
   494
            val cxIns = map2 (mk_cIn I) tuple_xs ks;
blanchet@49585
   495
            val cyIns = map2 (mk_cIn B_ify) tuple_ys ks;
blanchet@49585
   496
blanchet@49585
   497
            fun thaw xs = Thm.generalize ([], map (fst o dest_Free) xs) 1 o Drule.zero_var_indexes;
blanchet@49126
   498
blanchet@49585
   499
            fun mk_map_thm ctr_def' xs cxIn =
blanchet@49585
   500
              fold_thms lthy [ctr_def']
blanchet@49585
   501
                (unfold_thms lthy (pre_map_def ::
blanchet@49585
   502
                     (if lfp then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map)
blanchet@49585
   503
                   (cterm_instantiate_pos (nones @ [SOME cxIn])
blanchet@49585
   504
                      (if lfp then fp_map_thm else fp_map_thm RS ctor_cong)))
blanchet@49585
   505
              |> thaw xs;
blanchet@49585
   506
blanchet@49585
   507
            fun mk_set_thm fp_set_thm ctr_def' xs cxIn =
blanchet@49585
   508
              fold_thms lthy [ctr_def']
blanchet@49585
   509
                (unfold_thms lthy (pre_set_defs @ nested_set_natural's @ nesting_set_natural's @
blanchet@49585
   510
                     (if lfp then [] else [dtor_ctor]) @ sum_prod_thms_set)
blanchet@49585
   511
                   (cterm_instantiate_pos [SOME cxIn] fp_set_thm))
blanchet@49585
   512
              |> thaw xs;
blanchet@49585
   513
blanchet@49585
   514
            fun mk_set_thms fp_set_thm = map3 (mk_set_thm fp_set_thm) ctr_defs' xss cxIns;
blanchet@49585
   515
blanchet@49585
   516
            val map_thms = map3 mk_map_thm ctr_defs' xss cxIns;
blanchet@49585
   517
            val set_thmss = map mk_set_thms fp_set_thms;
blanchet@49127
   518
blanchet@49585
   519
            val rel_infos = (ctr_defs' ~~ xss ~~ cxIns, ctr_defs' ~~ yss ~~ cyIns);
blanchet@49585
   520
blanchet@49585
   521
            fun mk_rel_thm finish_off ctr_defs' xs cxIn ys cyIn =
blanchet@49585
   522
              fold_thms lthy ctr_defs'
blanchet@49585
   523
                 (unfold_thms lthy (pre_rel_def ::
blanchet@49585
   524
                      (if lfp then [] else [dtor_ctor]) @ sum_prod_thms_rel)
blanchet@49585
   525
                    (cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm))
blanchet@49585
   526
              |> finish_off |> thaw (xs @ ys);
blanchet@49585
   527
blanchet@49585
   528
            fun mk_pos_rel_thm (((ctr_def', xs), cxIn), ((_, ys), cyIn)) =
blanchet@49585
   529
              mk_rel_thm (perhaps (try (fn th => th RS @{thm eq_sym_Unity_imp}))) [ctr_def']
blanchet@49585
   530
                xs cxIn ys cyIn;
blanchet@49585
   531
blanchet@49585
   532
            val pos_rel_thms = map mk_pos_rel_thm (op ~~ rel_infos);
blanchet@49585
   533
blanchet@49585
   534
            fun mk_half_neg_rel_thm (((xctr_def', xs), cxIn), ((yctr_def', ys), cyIn)) =
blanchet@49585
   535
              mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def']
blanchet@49585
   536
                xs cxIn ys cyIn;
blanchet@49121
   537
blanchet@49585
   538
            fun mk_other_half_neg_rel_thm thm =
blanchet@49585
   539
              flip_rels lthy live thm RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2);
blanchet@49585
   540
blanchet@49585
   541
            val half_neg_rel_thmss = map (map mk_half_neg_rel_thm) (mk_half_pairss rel_infos);
blanchet@49585
   542
            val other_half_neg_rel_thmss = map (map mk_other_half_neg_rel_thm) half_neg_rel_thmss;
blanchet@49585
   543
            val (neg_rel_thms, _) = join_halves n half_neg_rel_thmss other_half_neg_rel_thmss;
blanchet@49585
   544
blanchet@49585
   545
            val rel_thms = pos_rel_thms @ neg_rel_thms;
blanchet@49134
   546
blanchet@49585
   547
            val notes =
blanchet@49585
   548
              [(mapsN, map_thms, code_simp_attrs),
blanchet@49585
   549
               (relsN, rel_thms, code_simp_attrs),
blanchet@49585
   550
               (setsN, flat set_thmss, code_simp_attrs)]
blanchet@49585
   551
              |> filter_out (null o #2)
blanchet@49585
   552
              |> map (fn (thmN, thms, attrs) =>
blanchet@49585
   553
                ((Binding.qualify true fp_b_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49585
   554
          in
blanchet@49585
   555
            (wrap_res, lthy |> Local_Theory.notes notes |> snd)
blanchet@49585
   556
          end;
blanchet@49585
   557
blanchet@49585
   558
        fun define_fold_rec no_defs_lthy =
blanchet@49134
   559
          let
blanchet@49208
   560
            val fpT_to_C = fpT --> C;
blanchet@49199
   561
blanchet@49504
   562
            fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xssss)) =
blanchet@49215
   563
              let
blanchet@49215
   564
                val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
blanchet@49336
   565
                val binding = Binding.suffix_name ("_" ^ suf) fp_b;
blanchet@49215
   566
                val spec =
blanchet@49336
   567
                  mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)),
blanchet@49504
   568
                    Term.list_comb (fp_rec_like,
blanchet@49255
   569
                      map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss));
blanchet@49336
   570
              in (binding, spec) end;
blanchet@49199
   571
blanchet@49504
   572
            val rec_like_infos =
blanchet@49504
   573
              [(foldN, fp_fold, fold_only),
blanchet@49215
   574
               (recN, fp_rec, rec_only)];
blanchet@49215
   575
blanchet@49504
   576
            val (bindings, specs) = map generate_rec_like rec_like_infos |> split_list;
blanchet@49215
   577
blanchet@49215
   578
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49201
   579
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49199
   580
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
   581
                #>> apsnd snd) bindings specs
blanchet@49199
   582
              ||> `Local_Theory.restore;
blanchet@49201
   583
blanchet@49201
   584
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49201
   585
blanchet@49504
   586
            val [fold_def, rec_def] = map (Morphism.thm phi) defs;
blanchet@49201
   587
blanchet@49536
   588
            val [foldx, recx] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts;
blanchet@49134
   589
          in
blanchet@49585
   590
            ((foldx, recx, fold_def, rec_def), lthy)
blanchet@49134
   591
          end;
blanchet@49134
   592
blanchet@49585
   593
        fun define_unfold_corec no_defs_lthy =
blanchet@49210
   594
          let
blanchet@49210
   595
            val B_to_fpT = C --> fpT;
blanchet@49211
   596
blanchet@49276
   597
            fun mk_preds_getterss_join c n cps sum_prod_T cqfss =
blanchet@49276
   598
              Term.lambda c (mk_IfN sum_prod_T cps
blanchet@49276
   599
                (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)));
blanchet@49275
   600
blanchet@49504
   601
            fun generate_corec_like (suf, fp_rec_like, ((pfss, cqfsss), (f_sum_prod_Ts,
blanchet@49274
   602
                pf_Tss))) =
blanchet@49211
   603
              let
blanchet@49211
   604
                val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
blanchet@49336
   605
                val binding = Binding.suffix_name ("_" ^ suf) fp_b;
blanchet@49211
   606
                val spec =
blanchet@49336
   607
                  mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)),
blanchet@49504
   608
                    Term.list_comb (fp_rec_like,
blanchet@49276
   609
                      map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss));
blanchet@49336
   610
              in (binding, spec) end;
blanchet@49210
   611
blanchet@49504
   612
            val corec_like_infos =
blanchet@49504
   613
              [(unfoldN, fp_fold, unfold_only),
blanchet@49215
   614
               (corecN, fp_rec, corec_only)];
blanchet@49212
   615
blanchet@49504
   616
            val (bindings, specs) = map generate_corec_like corec_like_infos |> split_list;
blanchet@49211
   617
blanchet@49211
   618
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49210
   619
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49210
   620
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
   621
                #>> apsnd snd) bindings specs
blanchet@49210
   622
              ||> `Local_Theory.restore;
blanchet@49210
   623
blanchet@49210
   624
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49210
   625
blanchet@49504
   626
            val [unfold_def, corec_def] = map (Morphism.thm phi) defs;
blanchet@49210
   627
blanchet@49536
   628
            val [unfold, corec] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts;
blanchet@49210
   629
          in
blanchet@49585
   630
            ((unfold, corec, unfold_def, corec_def), lthy)
blanchet@49287
   631
          end;
blanchet@49287
   632
blanchet@49504
   633
        val define_rec_likes = if lfp then define_fold_rec else define_unfold_corec;
blanchet@49585
   634
blanchet@49585
   635
        fun massage_res ((wrap_res, rec_like_res), lthy) =
blanchet@49585
   636
          (((ctrs, xss, ctr_defs, wrap_res), rec_like_res), lthy);
blanchet@49119
   637
      in
blanchet@49585
   638
        (wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy')
blanchet@49119
   639
      end;
blanchet@49167
   640
blanchet@49585
   641
    fun wrap_types_and_more (wrap_types_and_mores, lthy) =
blanchet@49585
   642
      fold_map I wrap_types_and_mores lthy
blanchet@49585
   643
      |>> apsnd split_list4 o apfst split_list4 o split_list;
blanchet@49226
   644
blanchet@49437
   645
    fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) =
blanchet@49234
   646
      let
blanchet@49392
   647
        val bnf = the (bnf_of lthy s);
blanchet@49393
   648
        val live = live_of_bnf bnf;
blanchet@49393
   649
        val mapx = mk_map live Ts Us (map_of_bnf bnf);
blanchet@49393
   650
        val TUs = map dest_funT (fst (strip_typeN live (fastype_of mapx)));
blanchet@49234
   651
        val args = map build_arg TUs;
blanchet@49234
   652
      in Term.list_comb (mapx, args) end;
blanchet@49234
   653
blanchet@49585
   654
    (* TODO: Add map, sets, rel simps *)
blanchet@49479
   655
    val mk_simp_thmss =
blanchet@49505
   656
      map3 (fn (_, _, injects, distincts, cases, _, _, _) => fn rec_likes => fn fold_likes =>
blanchet@49505
   657
        injects @ distincts @ cases @ rec_likes @ fold_likes);
blanchet@49479
   658
blanchet@49585
   659
    fun derive_induct_fold_rec_thms_for_types (((ctrss, xsss, ctr_defss, wrap_ress), (folds, recs,
blanchet@49585
   660
        fold_defs, rec_defs)), lthy) =
blanchet@49202
   661
      let
blanchet@49498
   662
        val (((phis, phis'), us'), names_lthy) =
blanchet@49370
   663
          lthy
blanchet@49463
   664
          |> mk_Frees' "P" (map mk_pred1T fpTs)
blanchet@49498
   665
          ||>> Variable.variant_fixes fp_b_names;
blanchet@49370
   666
blanchet@49498
   667
        val us = map2 (curry Free) us' fpTs;
blanchet@49370
   668
blanchet@49362
   669
        fun mk_sets_nested bnf =
blanchet@49362
   670
          let
blanchet@49362
   671
            val Type (T_name, Us) = T_of_bnf bnf;
blanchet@49362
   672
            val lives = lives_of_bnf bnf;
blanchet@49362
   673
            val sets = sets_of_bnf bnf;
blanchet@49362
   674
            fun mk_set U =
blanchet@49362
   675
              (case find_index (curry (op =) U) lives of
blanchet@49362
   676
                ~1 => Term.dummy
blanchet@49362
   677
              | i => nth sets i);
blanchet@49362
   678
          in
blanchet@49362
   679
            (T_name, map mk_set Us)
blanchet@49362
   680
          end;
blanchet@49362
   681
blanchet@49362
   682
        val setss_nested = map mk_sets_nested nested_bnfs;
blanchet@49362
   683
blanchet@49337
   684
        val (induct_thms, induct_thm) =
blanchet@49337
   685
          let
blanchet@49362
   686
            fun mk_set Ts t =
blanchet@49362
   687
              let val Type (_, Ts0) = domain_type (fastype_of t) in
blanchet@49362
   688
                Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49362
   689
              end;
blanchet@49362
   690
blanchet@49375
   691
            fun mk_raw_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) =
blanchet@49361
   692
                (case find_index (curry (op =) T) fpTs of
blanchet@49362
   693
                  ~1 =>
blanchet@49362
   694
                  (case AList.lookup (op =) setss_nested T_name of
blanchet@49362
   695
                    NONE => []
blanchet@49362
   696
                  | SOME raw_sets0 =>
blanchet@49362
   697
                    let
blanchet@49362
   698
                      val (Ts, raw_sets) =
blanchet@49362
   699
                        split_list (filter (exists_fp_subtype o fst) (Ts0 ~~ raw_sets0));
blanchet@49362
   700
                      val sets = map (mk_set Ts0) raw_sets;
blanchet@49362
   701
                      val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
blanchet@49375
   702
                      val xysets = map (pair x) (ys ~~ sets);
blanchet@49375
   703
                      val ppremss = map (mk_raw_prem_prems names_lthy') ys;
blanchet@49362
   704
                    in
blanchet@49375
   705
                      flat (map2 (map o apfst o cons) xysets ppremss)
blanchet@49362
   706
                    end)
blanchet@49376
   707
                | i => [([], (i + 1, x))])
blanchet@49375
   708
              | mk_raw_prem_prems _ _ = [];
blanchet@49342
   709
blanchet@49378
   710
            fun close_prem_prem xs t =
blanchet@49378
   711
              fold_rev Logic.all (map Free (drop (nn + length xs)
blanchet@49378
   712
                (rev (Term.add_frees t (map dest_Free xs @ phis'))))) t;
blanchet@49362
   713
blanchet@49378
   714
            fun mk_prem_prem xs (xysets, (j, x)) =
blanchet@49378
   715
              close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) =>
blanchet@49376
   716
                  HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets,
blanchet@49376
   717
                HOLogic.mk_Trueprop (nth phis (j - 1) $ x)));
blanchet@49375
   718
blanchet@49372
   719
            fun mk_raw_prem phi ctr ctr_Ts =
blanchet@49362
   720
              let
blanchet@49362
   721
                val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
blanchet@49376
   722
                val pprems = maps (mk_raw_prem_prems names_lthy') xs;
blanchet@49378
   723
              in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end;
blanchet@49342
   724
blanchet@49376
   725
            fun mk_prem (xs, raw_pprems, concl) =
blanchet@49378
   726
              fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl));
blanchet@49368
   727
blanchet@49389
   728
            val raw_premss = map3 (map2 o mk_raw_prem) phis ctrss ctr_Tsss;
blanchet@49389
   729
blanchet@49361
   730
            val goal =
blanchet@49372
   731
              Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss,
blanchet@49498
   732
                HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) phis us)));
blanchet@49368
   733
blanchet@49429
   734
            val kksss = map (map (map (fst o snd) o #2)) raw_premss;
blanchet@49368
   735
blanchet@49501
   736
            val ctor_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss);
blanchet@49342
   737
blanchet@49342
   738
            val induct_thm =
blanchet@49361
   739
              Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49501
   740
                mk_induct_tac ctxt ns mss kksss (flat ctr_defss) ctor_induct'
blanchet@49389
   741
                  nested_set_natural's pre_set_defss)
blanchet@49368
   742
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49337
   743
          in
blanchet@49367
   744
            `(conj_dests nn) induct_thm
blanchet@49337
   745
          end;
blanchet@49201
   746
blanchet@49438
   747
        (* TODO: Generate nicer names in case of clashes *)
blanchet@49437
   748
        val induct_cases = Datatype_Prop.indexify_names (maps (map base_name_of_ctr) ctrss);
blanchet@49437
   749
blanchet@49504
   750
        val (fold_thmss, rec_thmss) =
blanchet@49207
   751
          let
blanchet@49337
   752
            val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
blanchet@49504
   753
            val gfolds = map (lists_bmoc gss) folds;
blanchet@49337
   754
            val hrecs = map (lists_bmoc hss) recs;
blanchet@49337
   755
blanchet@49504
   756
            fun mk_goal fss frec_like xctr f xs fxs =
blanchet@49207
   757
              fold_rev (fold_rev Logic.all) (xs :: fss)
blanchet@49504
   758
                (mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs)));
blanchet@49204
   759
blanchet@49504
   760
            fun build_call frec_likes maybe_tick (T, U) =
blanchet@49234
   761
              if T = U then
blanchet@49368
   762
                id_const T
blanchet@49234
   763
              else
blanchet@49234
   764
                (case find_index (curry (op =) T) fpTs of
blanchet@49504
   765
                  ~1 => build_map (build_call frec_likes maybe_tick) T U
blanchet@49504
   766
                | j => maybe_tick (nth us j) (nth frec_likes j));
blanchet@49233
   767
blanchet@49274
   768
            fun mk_U maybe_mk_prodT =
blanchet@49274
   769
              typ_subst (map2 (fn fpT => fn C => (fpT, maybe_mk_prodT fpT C)) fpTs Cs);
blanchet@49214
   770
blanchet@49504
   771
            fun intr_calls frec_likes maybe_cons maybe_tick maybe_mk_prodT (x as Free (_, T)) =
blanchet@49214
   772
              if member (op =) fpTs T then
blanchet@49504
   773
                maybe_cons x [build_call frec_likes (K I) (T, mk_U (K I) T) $ x]
blanchet@49362
   774
              else if exists_fp_subtype T then
blanchet@49504
   775
                [build_call frec_likes maybe_tick (T, mk_U maybe_mk_prodT T) $ x]
blanchet@49214
   776
              else
blanchet@49214
   777
                [x];
blanchet@49214
   778
blanchet@49504
   779
            val gxsss = map (map (maps (intr_calls gfolds (K I) (K I) (K I)))) xsss;
blanchet@49342
   780
            val hxsss = map (map (maps (intr_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss;
blanchet@49204
   781
blanchet@49504
   782
            val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss;
blanchet@49484
   783
            val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss;
blanchet@49204
   784
blanchet@49504
   785
            val fold_tacss =
blanchet@49504
   786
              map2 (map o mk_rec_like_tac pre_map_defs nesting_map_ids fold_defs) fp_fold_thms
blanchet@49363
   787
                ctr_defss;
blanchet@49203
   788
            val rec_tacss =
blanchet@49504
   789
              map2 (map o mk_rec_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms
blanchet@49363
   790
                ctr_defss;
blanchet@49484
   791
blanchet@49484
   792
            fun prove goal tac = Skip_Proof.prove lthy [] [] goal (tac o #context);
blanchet@49202
   793
          in
blanchet@49504
   794
            (map2 (map2 prove) fold_goalss fold_tacss,
blanchet@49484
   795
             map2 (map2 prove) rec_goalss rec_tacss)
blanchet@49202
   796
          end;
blanchet@49201
   797
blanchet@49504
   798
        val simp_thmss = mk_simp_thmss wrap_ress rec_thmss fold_thmss;
blanchet@49438
   799
blanchet@49437
   800
        val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases));
blanchet@49437
   801
        fun induct_type_attr T_name = Attrib.internal (K (Induct.induct_type T_name));
blanchet@49437
   802
blanchet@49337
   803
        val common_notes =
blanchet@49437
   804
          (if nn > 1 then [(inductN, [induct_thm], [induct_case_names_attr])] else [])
blanchet@49337
   805
          |> map (fn (thmN, thms, attrs) =>
blanchet@49479
   806
            ((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49337
   807
blanchet@49226
   808
        val notes =
blanchet@49437
   809
          [(inductN, map single induct_thms,
blanchet@49437
   810
            fn T_name => [induct_case_names_attr, induct_type_attr T_name]),
blanchet@49585
   811
           (foldsN, fold_thmss, K (code_simp_attrs)),
blanchet@49585
   812
           (recsN, rec_thmss, K (code_simp_attrs)),
blanchet@49585
   813
           (simpsN, simp_thmss, K [])]
blanchet@49300
   814
          |> maps (fn (thmN, thmss, attrs) =>
blanchet@49437
   815
            map3 (fn b => fn Type (T_name, _) => fn thms =>
blanchet@49437
   816
              ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs T_name),
blanchet@49437
   817
                [(thms, [])])) fp_bs fpTs thmss);
blanchet@49202
   818
      in
blanchet@49337
   819
        lthy |> Local_Theory.notes (common_notes @ notes) |> snd
blanchet@49202
   820
      end;
blanchet@49202
   821
blanchet@49585
   822
    fun derive_coinduct_unfold_corec_thms_for_types (((ctrss, _, ctr_defss, wrap_ress), (unfolds,
blanchet@49585
   823
        corecs, unfold_defs, corec_defs)), lthy) =
blanchet@49212
   824
      let
blanchet@49484
   825
        val discss = map (map (mk_disc_or_sel As) o #1) wrap_ress;
blanchet@49484
   826
        val selsss = map #2 wrap_ress;
blanchet@49484
   827
        val disc_thmsss = map #6 wrap_ress;
blanchet@49484
   828
        val discIss = map #7 wrap_ress;
blanchet@49484
   829
        val sel_thmsss = map #8 wrap_ress;
blanchet@49438
   830
blanchet@49498
   831
        val (us', _) =
blanchet@49370
   832
          lthy
blanchet@49498
   833
          |> Variable.variant_fixes fp_b_names;
blanchet@49370
   834
blanchet@49498
   835
        val us = map2 (curry Free) us' fpTs;
blanchet@49370
   836
blanchet@49337
   837
        val (coinduct_thms, coinduct_thm) =
blanchet@49337
   838
          let
blanchet@49585
   839
(*            val goal =
blanchet@49585
   840
  *)
blanchet@49585
   841
blanchet@49337
   842
            val coinduct_thm = fp_induct;
blanchet@49337
   843
          in
blanchet@49367
   844
            `(conj_dests nn) coinduct_thm
blanchet@49337
   845
          end;
blanchet@49212
   846
blanchet@49484
   847
        fun mk_maybe_not pos = not pos ? HOLogic.mk_not;
blanchet@49484
   848
blanchet@49484
   849
        val z = the_single zs;
blanchet@49504
   850
        val gunfolds = map (lists_bmoc pgss) unfolds;
blanchet@49484
   851
        val hcorecs = map (lists_bmoc phss) corecs;
blanchet@49484
   852
blanchet@49504
   853
        val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) =
blanchet@49212
   854
          let
blanchet@49504
   855
            fun mk_goal pfss c cps fcorec_like n k ctr m cfs' =
blanchet@49212
   856
              fold_rev (fold_rev Logic.all) ([c] :: pfss)
blanchet@49484
   857
                (Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps,
blanchet@49504
   858
                   mk_Trueprop_eq (fcorec_like $ c, Term.list_comb (ctr, take m cfs'))));
blanchet@49212
   859
blanchet@49504
   860
            fun build_call frec_likes maybe_tack (T, U) =
blanchet@49234
   861
              if T = U then
blanchet@49368
   862
                id_const T
blanchet@49234
   863
              else
blanchet@49234
   864
                (case find_index (curry (op =) U) fpTs of
blanchet@49504
   865
                  ~1 => build_map (build_call frec_likes maybe_tack) T U
blanchet@49504
   866
                | j => maybe_tack (nth cs j, nth us j) (nth frec_likes j));
blanchet@49233
   867
blanchet@49274
   868
            fun mk_U maybe_mk_sumT =
blanchet@49274
   869
              typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs);
blanchet@49212
   870
blanchet@49504
   871
            fun intr_calls frec_likes maybe_mk_sumT maybe_tack cqf =
blanchet@49276
   872
              let val T = fastype_of cqf in
blanchet@49276
   873
                if exists_subtype (member (op =) Cs) T then
blanchet@49504
   874
                  build_call frec_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf
blanchet@49276
   875
                else
blanchet@49276
   876
                  cqf
blanchet@49276
   877
              end;
blanchet@49232
   878
blanchet@49504
   879
            val crgsss' = map (map (map (intr_calls gunfolds (K I) (K I)))) crgsss;
blanchet@49342
   880
            val cshsss' = map (map (map (intr_calls hcorecs (curry mk_sumT) (tack z)))) cshsss;
blanchet@49212
   881
blanchet@49504
   882
            val unfold_goalss =
blanchet@49504
   883
              map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss';
blanchet@49484
   884
            val corec_goalss =
blanchet@49484
   885
              map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss';
blanchet@49213
   886
blanchet@49504
   887
            val unfold_tacss =
blanchet@49504
   888
              map3 (map oo mk_corec_like_tac unfold_defs nesting_map_ids) fp_fold_thms pre_map_defs
blanchet@49226
   889
                ctr_defss;
blanchet@49233
   890
            val corec_tacss =
blanchet@49504
   891
              map3 (map oo mk_corec_like_tac corec_defs nesting_map_ids) fp_rec_thms pre_map_defs
blanchet@49233
   892
                ctr_defss;
blanchet@49479
   893
blanchet@49484
   894
            fun prove goal tac =
blanchet@49484
   895
              Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation;
blanchet@49484
   896
blanchet@49504
   897
            val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss;
blanchet@49479
   898
            val corec_thmss =
blanchet@49484
   899
              map2 (map2 prove) corec_goalss corec_tacss
blanchet@49504
   900
              |> map (map (unfold_thms lthy @{thms sum_case_if}));
blanchet@49479
   901
blanchet@49504
   902
            val unfold_safesss = map2 (map2 (map2 (curry (op =)))) crgsss' crgsss;
blanchet@49479
   903
            val corec_safesss = map2 (map2 (map2 (curry (op =)))) cshsss' cshsss;
blanchet@49479
   904
blanchet@49479
   905
            val filter_safesss =
blanchet@49479
   906
              map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo
blanchet@49479
   907
                curry (op ~~));
blanchet@49479
   908
blanchet@49504
   909
            val safe_unfold_thmss = filter_safesss unfold_safesss unfold_thmss;
blanchet@49479
   910
            val safe_corec_thmss = filter_safesss corec_safesss corec_thmss;
blanchet@49479
   911
          in
blanchet@49504
   912
            (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss)
blanchet@49212
   913
          end;
blanchet@49212
   914
blanchet@49504
   915
        val (disc_unfold_iff_thmss, disc_corec_iff_thmss) =
blanchet@49482
   916
          let
blanchet@49504
   917
            fun mk_goal c cps fcorec_like n k disc =
blanchet@49504
   918
              mk_Trueprop_eq (disc $ (fcorec_like $ c),
blanchet@49484
   919
                if n = 1 then @{const True}
blanchet@49484
   920
                else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps));
blanchet@49484
   921
blanchet@49504
   922
            val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss;
blanchet@49484
   923
            val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss;
blanchet@49484
   924
blanchet@49484
   925
            fun mk_case_split' cp =
blanchet@49484
   926
              Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split};
blanchet@49484
   927
blanchet@49484
   928
            val case_splitss' = map (map mk_case_split') cpss;
blanchet@49482
   929
blanchet@49504
   930
            val unfold_tacss =
blanchet@49504
   931
              map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' unfold_thmss disc_thmsss;
blanchet@49484
   932
            val corec_tacss =
blanchet@49504
   933
              map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss;
blanchet@49484
   934
blanchet@49484
   935
            fun prove goal tac =
blanchet@49484
   936
              Skip_Proof.prove lthy [] [] goal (tac o #context)
blanchet@49484
   937
              |> Thm.close_derivation
blanchet@49484
   938
              |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49484
   939
blanchet@49484
   940
            fun proves [_] [_] = []
blanchet@49484
   941
              | proves goals tacs = map2 prove goals tacs;
blanchet@49482
   942
          in
blanchet@49504
   943
            (map2 proves unfold_goalss unfold_tacss,
blanchet@49484
   944
             map2 proves corec_goalss corec_tacss)
blanchet@49482
   945
          end;
blanchet@49482
   946
blanchet@49504
   947
        fun mk_disc_corec_like_thms corec_likes discIs =
blanchet@49504
   948
          map (op RS) (filter_out (is_triv_implies o snd) (corec_likes ~~ discIs));
blanchet@49266
   949
blanchet@49504
   950
        val disc_unfold_thmss = map2 mk_disc_corec_like_thms unfold_thmss discIss;
blanchet@49504
   951
        val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss;
blanchet@49266
   952
blanchet@49504
   953
        fun mk_sel_corec_like_thm corec_like_thm sel sel_thm =
blanchet@49266
   954
          let
blanchet@49479
   955
            val (domT, ranT) = dest_funT (fastype_of sel);
blanchet@49266
   956
            val arg_cong' =
blanchet@49266
   957
              Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
blanchet@49479
   958
                [NONE, NONE, SOME (certify lthy sel)] arg_cong
blanchet@49267
   959
              |> Thm.varifyT_global;
blanchet@49266
   960
            val sel_thm' = sel_thm RSN (2, trans);
blanchet@49266
   961
          in
blanchet@49504
   962
            corec_like_thm RS arg_cong' RS sel_thm'
blanchet@49266
   963
          end;
blanchet@49266
   964
blanchet@49504
   965
        fun mk_sel_corec_like_thms corec_likess =
blanchet@49504
   966
          map3 (map3 (map2 o mk_sel_corec_like_thm)) corec_likess selsss sel_thmsss |> map flat;
blanchet@49479
   967
blanchet@49504
   968
        val sel_unfold_thmss = mk_sel_corec_like_thms unfold_thmss;
blanchet@49504
   969
        val sel_corec_thmss = mk_sel_corec_like_thms corec_thmss;
blanchet@49479
   970
blanchet@49587
   971
        fun flat_corec_like_thms corec_likes disc_corec_likes sel_corec_likes =
blanchet@49504
   972
          corec_likes @ disc_corec_likes @ sel_corec_likes;
blanchet@49479
   973
blanchet@49479
   974
        val simp_thmss =
blanchet@49479
   975
          mk_simp_thmss wrap_ress
blanchet@49587
   976
            (map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss)
blanchet@49587
   977
            (map3 flat_corec_like_thms safe_unfold_thmss disc_unfold_thmss sel_unfold_thmss);
blanchet@49479
   978
blanchet@49479
   979
        val anonymous_notes =
blanchet@49504
   980
          [(flat safe_unfold_thmss @ flat safe_corec_thmss, simp_attrs)]
blanchet@49479
   981
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@49266
   982
blanchet@49342
   983
        val common_notes =
blanchet@49367
   984
          (if nn > 1 then [(coinductN, [coinduct_thm], [])] (* FIXME: attribs *) else [])
blanchet@49342
   985
          |> map (fn (thmN, thms, attrs) =>
blanchet@49479
   986
            ((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49342
   987
blanchet@49212
   988
        val notes =
blanchet@49342
   989
          [(coinductN, map single coinduct_thms, []), (* FIXME: attribs *)
blanchet@49482
   990
           (corecsN, corec_thmss, []),
blanchet@49585
   991
           (disc_corec_iffsN, disc_corec_iff_thmss, simp_attrs),
blanchet@49585
   992
           (disc_corecsN, disc_corec_thmss, simp_attrs),
blanchet@49585
   993
           (disc_unfold_iffsN, disc_unfold_iff_thmss, simp_attrs),
blanchet@49504
   994
           (disc_unfoldsN, disc_unfold_thmss, simp_attrs),
blanchet@49504
   995
           (sel_unfoldsN, sel_unfold_thmss, simp_attrs),
blanchet@49479
   996
           (sel_corecsN, sel_corec_thmss, simp_attrs),
blanchet@49585
   997
           (simpsN, simp_thmss, []),
blanchet@49518
   998
           (unfoldsN, unfold_thmss, [])]
blanchet@49300
   999
          |> maps (fn (thmN, thmss, attrs) =>
blanchet@49266
  1000
            map_filter (fn (_, []) => NONE | (b, thms) =>
blanchet@49300
  1001
              SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs),
blanchet@49302
  1002
                [(thms, [])])) (fp_bs ~~ thmss));
blanchet@49212
  1003
      in
blanchet@49479
  1004
        lthy |> Local_Theory.notes (anonymous_notes @ common_notes @ notes) |> snd
blanchet@49212
  1005
      end;
blanchet@49212
  1006
blanchet@49204
  1007
    val lthy' = lthy
blanchet@49585
  1008
      |> fold_map define_ctrs_case_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ Cs ~~ ctors ~~ dtors ~~
blanchet@49585
  1009
        fp_folds ~~ fp_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~
blanchet@49585
  1010
        pre_set_defss ~~ pre_rel_defs ~~ fp_map_thms ~~ fp_set_thmss ~~ fp_rel_thms ~~ ns ~~ kss ~~
blanchet@49585
  1011
        mss ~~ ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~
blanchet@49585
  1012
        raw_sel_defaultsss)
blanchet@49585
  1013
      |> wrap_types_and_more
blanchet@49585
  1014
      |> (if lfp then derive_induct_fold_rec_thms_for_types
blanchet@49585
  1015
          else derive_coinduct_unfold_corec_thms_for_types);
blanchet@49167
  1016
blanchet@49167
  1017
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
blanchet@49208
  1018
      (if lfp then "" else "co") ^ "datatype"));
blanchet@49112
  1019
  in
blanchet@49308
  1020
    timer; lthy'
blanchet@49112
  1021
  end;
blanchet@49112
  1022
blanchet@49536
  1023
val datatypes = define_datatypes (K I) (K I) (K I);
blanchet@49297
  1024
blanchet@49536
  1025
val datatype_cmd = define_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.read_term;
blanchet@49119
  1026
blanchet@49112
  1027
val parse_ctr_arg =
blanchet@49329
  1028
  @{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} ||
traytel@49434
  1029
  (Parse.typ >> pair Binding.empty);
blanchet@49112
  1030
blanchet@49286
  1031
val parse_defaults =
blanchet@49286
  1032
  @{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"};
blanchet@49286
  1033
blanchet@49112
  1034
val parse_single_spec =
blanchet@49112
  1035
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
blanchet@49119
  1036
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
blanchet@49286
  1037
    Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix));
blanchet@49112
  1038
blanchet@49278
  1039
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec;
blanchet@49278
  1040
blanchet@49585
  1041
fun parse_datatype_cmd lfp construct_fp = parse_datatype >> datatype_cmd lfp construct_fp;
blanchet@49112
  1042
blanchet@49112
  1043
end;