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