src/HOL/BNF/Tools/bnf_fp_def_sugar.ML
author blanchet
Tue Apr 30 11:59:20 2013 +0200 (2013-04-30)
changeset 51831 a5137cd2c2c2
parent 51830 403f7ecd061f
child 51832 35911d5acfa9
permissions -rw-r--r--
tuning
blanchet@49636
     1
(*  Title:      HOL/BNF/Tools/bnf_fp_def_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@49636
     8
signature BNF_FP_DEF_SUGAR =
blanchet@49112
     9
sig
blanchet@51823
    10
  type fp =
blanchet@51824
    11
    {lfp: bool,
blanchet@51824
    12
     fp_index: int,
blanchet@51823
    13
     fp_res: BNF_FP.fp_result,
blanchet@51823
    14
     ctr_wrap_res: BNF_Ctr_Sugar.ctr_wrap_result};
blanchet@51823
    15
blanchet@51823
    16
  val fp_of: Proof.context -> string -> fp option
blanchet@51823
    17
blanchet@51827
    18
  val derive_induct_fold_rec_thms_for_types: BNF_Def.BNF list -> term list -> term list -> thm ->
blanchet@51827
    19
    thm list -> thm list -> BNF_Def.BNF list -> BNF_Def.BNF list -> typ list -> typ list ->
blanchet@51827
    20
    typ list -> term list list -> thm list list -> term list -> term list -> thm list -> thm list ->
blanchet@51827
    21
    Proof.context ->
blanchet@51811
    22
    (thm * thm list * Args.src list) * (thm list list * Args.src list)
blanchet@51827
    23
    * (thm list list * Args.src list)
blanchet@51829
    24
  val derive_coinduct_unfold_corec_thms_for_types: BNF_Def.BNF list -> term list -> term list ->
blanchet@51829
    25
    thm -> thm -> thm list -> thm list -> thm list -> BNF_Def.BNF list -> BNF_Def.BNF list ->
blanchet@51829
    26
    typ list -> typ list -> typ list -> int list list -> int list list -> int list ->
blanchet@51829
    27
    term list list -> thm list list -> BNF_Ctr_Sugar.ctr_wrap_result list -> term list ->
blanchet@51829
    28
    term list -> thm list -> thm list -> Proof.context ->
blanchet@51811
    29
    (thm * thm list * thm * thm list * Args.src list) * (thm list list * thm list list * 'e list)
blanchet@51811
    30
    * (thm list list * thm list list) * (thm list list * thm list list * Args.src list)
blanchet@51824
    31
    * (thm list list * thm list list * Args.src list)
blanchet@51824
    32
    * (thm list list * thm list list * Args.src list)
blanchet@51823
    33
blanchet@49536
    34
  val datatypes: bool ->
blanchet@51767
    35
    (mixfix list -> (string * sort) list option -> binding list -> binding list -> binding list ->
blanchet@51758
    36
      binding list list -> typ list * typ list list -> BNF_Def.BNF list -> local_theory ->
blanchet@51757
    37
      BNF_FP.fp_result * local_theory) ->
blanchet@51767
    38
    (bool * bool) * (((((binding * (typ * sort)) list * binding) * (binding * binding)) * mixfix) *
blanchet@51758
    39
      ((((binding * binding) * (binding * typ) list) * (binding * term) list) *
blanchet@51758
    40
        mixfix) list) list ->
blanchet@49297
    41
    local_theory -> local_theory
blanchet@49308
    42
  val parse_datatype_cmd: bool ->
blanchet@51767
    43
    (mixfix list -> (string * sort) list option -> binding list -> binding list -> binding list ->
blanchet@51758
    44
      binding list list -> typ list * typ list list -> BNF_Def.BNF list -> local_theory ->
blanchet@51757
    45
      BNF_FP.fp_result * local_theory) ->
blanchet@49308
    46
    (local_theory -> local_theory) parser
blanchet@49112
    47
end;
blanchet@49112
    48
blanchet@49636
    49
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR =
blanchet@49112
    50
struct
blanchet@49112
    51
blanchet@49119
    52
open BNF_Util
blanchet@51797
    53
open BNF_Ctr_Sugar
blanchet@49214
    54
open BNF_Def
blanchet@49457
    55
open BNF_FP
blanchet@49636
    56
open BNF_FP_Def_Sugar_Tactics
blanchet@49119
    57
blanchet@51788
    58
val EqN = "Eq_";
blanchet@51777
    59
blanchet@51823
    60
type fp =
blanchet@51824
    61
  {lfp: bool,
blanchet@51824
    62
   fp_index: int,
blanchet@51823
    63
   fp_res: fp_result,
blanchet@51823
    64
   ctr_wrap_res: ctr_wrap_result};
blanchet@51823
    65
blanchet@51824
    66
fun eq_fp ({lfp = lfp1, fp_index = fp_index1, fp_res = fp_res1, ...} : fp,
blanchet@51824
    67
    {lfp = lfp2, fp_index = fp_index2, fp_res = fp_res2, ...} : fp) =
blanchet@51824
    68
  lfp1 = lfp2 andalso fp_index1 = fp_index2 andalso eq_fp_result (fp_res1, fp_res2);
blanchet@51823
    69
blanchet@51824
    70
fun morph_fp phi {lfp, fp_index, fp_res, ctr_wrap_res} =
blanchet@51824
    71
  {lfp = lfp, fp_index = fp_index, fp_res = morph_fp_result phi fp_res,
blanchet@51823
    72
   ctr_wrap_res = morph_ctr_wrap_result phi ctr_wrap_res};
blanchet@51823
    73
blanchet@51823
    74
structure Data = Generic_Data
blanchet@51823
    75
(
blanchet@51823
    76
  type T = fp Symtab.table;
blanchet@51823
    77
  val empty = Symtab.empty;
blanchet@51823
    78
  val extend = I;
blanchet@51823
    79
  val merge = Symtab.merge eq_fp;
blanchet@51823
    80
);
blanchet@51823
    81
blanchet@51823
    82
val fp_of = Symtab.lookup o Data.get o Context.Proof;
blanchet@51823
    83
blanchet@51823
    84
fun register_fp key fp =
blanchet@51823
    85
  Local_Theory.declaration {syntax = false, pervasive = true}
blanchet@51823
    86
    (fn phi => Data.map (Symtab.update_new (key, morph_fp phi fp)));
blanchet@51823
    87
blanchet@51824
    88
val fp_name_of_ctor = fst o dest_Type o range_type o fastype_of;
blanchet@51824
    89
blanchet@51824
    90
fun register_fps lfp (fp_res as {ctors, ...}) ctr_wrap_ress lthy =
blanchet@51824
    91
  ((1, ctors), lthy)
blanchet@51824
    92
  |> fold (fn ctr_wrap_res => fn ((kk, ctor :: ctors), lthy) =>
blanchet@51824
    93
    ((kk + 1, ctors), register_fp (fp_name_of_ctor ctor) {lfp = lfp, fp_index = kk,
blanchet@51824
    94
       fp_res = fp_res, ctr_wrap_res = ctr_wrap_res} lthy)) ctr_wrap_ress
blanchet@51824
    95
  |> snd;
blanchet@51824
    96
blanchet@51777
    97
(* This function could produce clashes in contrived examples (e.g., "x.A", "x.x_A", "y.A"). *)
blanchet@49622
    98
fun quasi_unambiguous_case_names names =
blanchet@49622
    99
  let
blanchet@49622
   100
    val ps = map (`Long_Name.base_name) names;
blanchet@49622
   101
    val dups = Library.duplicates (op =) (map fst ps);
blanchet@49622
   102
    fun underscore s =
blanchet@49622
   103
      let val ss = space_explode Long_Name.separator s in
blanchet@49622
   104
        space_implode "_" (drop (length ss - 2) ss)
blanchet@49622
   105
      end;
blanchet@49622
   106
  in
blanchet@49622
   107
    map (fn (base, full) => if member (op =) dups base then underscore full else base) ps
blanchet@49622
   108
  end;
blanchet@49622
   109
blanchet@49591
   110
val mp_conj = @{thm mp_conj};
blanchet@49591
   111
blanchet@49300
   112
val simp_attrs = @{attributes [simp]};
blanchet@49585
   113
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs;
blanchet@49300
   114
traytel@50170
   115
fun split_list4 [] = ([], [], [], [])
traytel@50170
   116
  | split_list4 ((x1, x2, x3, x4) :: xs) =
traytel@50170
   117
    let val (xs1, xs2, xs3, xs4) = split_list4 xs;
traytel@50170
   118
    in (x1 :: xs1, x2 :: xs2, x3 :: xs3, x4 :: xs4) end;
blanchet@49214
   119
blanchet@51811
   120
fun add_components_of_typ (Type (s, Ts)) =
blanchet@51816
   121
    fold add_components_of_typ Ts #> cons (Long_Name.base_name s)
blanchet@51811
   122
  | add_components_of_typ _ = I;
blanchet@51811
   123
blanchet@51816
   124
fun base_name_of_typ T = space_implode "_" (add_components_of_typ T []);
blanchet@51811
   125
blanchet@51808
   126
fun exists_subtype_in Ts = exists_subtype (member (op =) Ts);
blanchet@51808
   127
blanchet@49342
   128
fun resort_tfree S (TFree (s, _)) = TFree (s, S);
blanchet@49342
   129
blanchet@49214
   130
fun typ_subst inst (T as Type (s, Ts)) =
blanchet@49214
   131
    (case AList.lookup (op =) inst T of
blanchet@49214
   132
      NONE => Type (s, map (typ_subst inst) Ts)
blanchet@49214
   133
    | SOME T' => T')
blanchet@49214
   134
  | typ_subst inst T = the_default T (AList.lookup (op =) inst T);
blanchet@49205
   135
blanchet@49583
   136
fun variant_types ss Ss ctxt =
blanchet@49583
   137
  let
blanchet@49583
   138
    val (tfrees, _) =
blanchet@49583
   139
      fold_map2 (fn s => fn S => Name.variant s #> apfst (rpair S)) ss Ss (Variable.names_of ctxt);
blanchet@49583
   140
    val ctxt' = fold (Variable.declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
blanchet@49583
   141
  in (tfrees, ctxt') end;
blanchet@49583
   142
blanchet@49297
   143
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
blanchet@49202
   144
blanchet@49200
   145
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
blanchet@49200
   146
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
blanchet@49200
   147
blanchet@51794
   148
fun flat_rec unzipf xs =
blanchet@51794
   149
  let val ps = map unzipf xs in
blanchet@51794
   150
    (* The first line below gives the preferred order. The second line is for compatibility with the
blanchet@51794
   151
       old datatype package: *)
blanchet@51795
   152
(*
blanchet@51794
   153
    maps (op @) ps
blanchet@51795
   154
*)
blanchet@51794
   155
    maps fst ps @ maps snd ps
blanchet@51793
   156
  end;
blanchet@51793
   157
blanchet@51829
   158
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss);
blanchet@51829
   159
blanchet@51829
   160
fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss
blanchet@51829
   161
  | flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
blanchet@51829
   162
    p :: flat_predss_getterss qss fss @ flat_preds_predsss_gettersss ps qsss fsss;
blanchet@51829
   163
blanchet@49585
   164
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) =
blanchet@49585
   165
  Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1));
blanchet@49585
   166
blanchet@49585
   167
fun flip_rels lthy n thm =
blanchet@49585
   168
  let
blanchet@49585
   169
    val Rs = Term.add_vars (prop_of thm) [];
blanchet@49585
   170
    val Rs' = rev (drop (length Rs - n) Rs);
blanchet@49585
   171
    val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs';
blanchet@49585
   172
  in
blanchet@49585
   173
    Drule.cterm_instantiate cRs thm
blanchet@49585
   174
  end;
blanchet@49585
   175
blanchet@49536
   176
fun mk_ctor_or_dtor get_T Ts t =
blanchet@49536
   177
  let val Type (_, Ts0) = get_T (fastype_of t) in
blanchet@49536
   178
    Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49536
   179
  end;
blanchet@49536
   180
blanchet@49536
   181
val mk_ctor = mk_ctor_or_dtor range_type;
blanchet@49536
   182
val mk_dtor = mk_ctor_or_dtor domain_type;
blanchet@49536
   183
blanchet@49536
   184
fun mk_rec_like lfp Ts Us t =
blanchet@49536
   185
  let
blanchet@49536
   186
    val (bindings, body) = strip_type (fastype_of t);
blanchet@49536
   187
    val (f_Us, prebody) = split_last bindings;
blanchet@49536
   188
    val Type (_, Ts0) = if lfp then prebody else body;
blanchet@49536
   189
    val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
blanchet@49536
   190
  in
blanchet@49536
   191
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49536
   192
  end;
blanchet@49536
   193
blanchet@51827
   194
val mk_fp_rec_like_fun_types = fst o split_last o binder_types o fastype_of o hd;
blanchet@51827
   195
blanchet@51827
   196
fun mk_fp_rec_like lfp As Cs fp_rec_likes0 =
blanchet@51827
   197
  map (mk_rec_like lfp As Cs) fp_rec_likes0
blanchet@51827
   198
  |> (fn ts => (ts, mk_fp_rec_like_fun_types ts));
blanchet@51827
   199
blanchet@51827
   200
fun mk_rec_like_fun_arg_typess n ms = map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type;
blanchet@51827
   201
blanchet@51829
   202
fun massage_rec_fun_arg_typesss fpTs =
blanchet@51827
   203
  let
blanchet@51829
   204
    fun project_recT proj =
blanchet@51829
   205
      let
blanchet@51829
   206
        fun project (Type (s as @{type_name prod}, Ts as [T, U])) =
blanchet@51829
   207
            if member (op =) fpTs T then proj (T, U) else Type (s, map project Ts)
blanchet@51829
   208
          | project (Type (s, Ts)) = Type (s, map project Ts)
blanchet@51829
   209
          | project T = T;
blanchet@51829
   210
      in project end;
blanchet@51829
   211
    fun unzip_recT T =
blanchet@51829
   212
      if exists_subtype_in fpTs T then ([project_recT fst T], [project_recT snd T]) else ([T], []);
blanchet@51829
   213
  in
blanchet@51829
   214
    map (map (flat_rec unzip_recT))
blanchet@51829
   215
  end;
blanchet@51827
   216
blanchet@51827
   217
val mk_fold_fun_typess = map2 (map2 (curry (op --->)));
blanchet@51827
   218
val mk_rec_fun_typess = mk_fold_fun_typess oo massage_rec_fun_arg_typesss;
blanchet@51827
   219
blanchet@51831
   220
fun mk_unfold_corec_terms_and_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy =
blanchet@51829
   221
  let
blanchet@51829
   222
    (*avoid "'a itself" arguments in coiterators and corecursors*)
blanchet@51829
   223
    fun repair_arity [0] = [1]
blanchet@51829
   224
      | repair_arity ms = ms;
blanchet@51829
   225
blanchet@51829
   226
    fun project_corecT proj =
blanchet@51829
   227
      let
blanchet@51829
   228
        fun project (Type (s as @{type_name sum}, Ts as [T, U])) =
blanchet@51829
   229
            if member (op =) fpTs T then proj (T, U) else Type (s, map project Ts)
blanchet@51829
   230
          | project (Type (s, Ts)) = Type (s, map project Ts)
blanchet@51829
   231
          | project T = T;
blanchet@51829
   232
      in project end;
blanchet@51829
   233
blanchet@51829
   234
    fun unzip_corecT T =
blanchet@51829
   235
      if exists_subtype_in fpTs T then [project_corecT fst T, project_corecT snd T] else [T];
blanchet@51829
   236
blanchet@51831
   237
    val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs;
blanchet@51829
   238
blanchet@51829
   239
    fun mk_types maybe_unzipT fun_Ts =
blanchet@51829
   240
      let
blanchet@51829
   241
        val f_sum_prod_Ts = map range_type fun_Ts;
blanchet@51829
   242
        val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
blanchet@51829
   243
        val f_Tsss = map2 (map2 dest_tupleT o repair_arity) mss f_prod_Tss;
blanchet@51829
   244
        val f_Tssss =
blanchet@51829
   245
          map2 (fn C => map (map (map (curry (op -->) C) o maybe_unzipT))) Cs f_Tsss;
blanchet@51829
   246
        val q_Tssss =
blanchet@51829
   247
          map (map (map (fn [_] => [] | [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss;
blanchet@51829
   248
        val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
blanchet@51829
   249
      in (q_Tssss, f_sum_prod_Ts, f_Tsss, f_Tssss, pf_Tss) end;
blanchet@51829
   250
blanchet@51831
   251
    val (r_Tssss, g_sum_prod_Ts, g_Tsss, g_Tssss, pg_Tss) = mk_types single dtor_unfold_fun_Ts;
blanchet@51831
   252
    val (s_Tssss, h_sum_prod_Ts, h_Tsss, h_Tssss, ph_Tss) = mk_types unzip_corecT dtor_corec_fun_Ts;
blanchet@51831
   253
blanchet@51829
   254
    val (((cs, pss), gssss), lthy) =
blanchet@51829
   255
      lthy
blanchet@51829
   256
      |> mk_Frees "a" Cs
blanchet@51829
   257
      ||>> mk_Freess "p" p_Tss
blanchet@51829
   258
      ||>> mk_Freessss "g" g_Tssss;
blanchet@51829
   259
    val rssss = map (map (map (fn [] => []))) r_Tssss;
blanchet@51829
   260
blanchet@51829
   261
    val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss;
blanchet@51829
   262
    val ((sssss, hssss_tl), lthy) =
blanchet@51829
   263
      lthy
blanchet@51829
   264
      |> mk_Freessss "q" s_Tssss
blanchet@51829
   265
      ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
blanchet@51829
   266
    val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
blanchet@51831
   267
blanchet@51831
   268
    val cpss = map2 (map o rapp) cs pss;
blanchet@51829
   269
blanchet@51831
   270
    fun mk_terms qssss fssss =
blanchet@51831
   271
      let
blanchet@51831
   272
        val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss;
blanchet@51831
   273
        val cqssss = map2 (map o map o map o rapp) cs qssss;
blanchet@51831
   274
        val cfssss = map2 (map o map o map o rapp) cs fssss;
blanchet@51831
   275
      in (pfss, cqssss, cfssss) end;
blanchet@51831
   276
blanchet@51831
   277
    val unfold_terms = mk_terms rssss gssss;
blanchet@51831
   278
    val corec_terms = mk_terms sssss hssss;
blanchet@51831
   279
  in
blanchet@51831
   280
    ((cs, cpss, (unfold_terms, (g_sum_prod_Ts, g_Tsss, pg_Tss)),
blanchet@51831
   281
      (corec_terms, (h_sum_prod_Ts, h_Tsss, ph_Tss))), lthy)
blanchet@51831
   282
  end;
blanchet@51829
   283
blanchet@49536
   284
fun mk_map live Ts Us t =
blanchet@49536
   285
  let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) |>> List.last in
blanchet@49536
   286
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49536
   287
  end;
blanchet@49536
   288
blanchet@49591
   289
fun mk_rel live Ts Us t =
blanchet@49591
   290
  let val [Type (_, Ts0), Type (_, Us0)] = binder_types (snd (strip_typeN live (fastype_of t))) in
blanchet@49591
   291
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49591
   292
  end;
blanchet@49591
   293
blanchet@49585
   294
fun liveness_of_fp_bnf n bnf =
blanchet@49585
   295
  (case T_of_bnf bnf of
blanchet@49585
   296
    Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts
blanchet@49585
   297
  | _ => replicate n false);
blanchet@49536
   298
blanchet@49124
   299
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
blanchet@49119
   300
blanchet@49298
   301
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types ();
blanchet@49119
   302
blanchet@49298
   303
fun merge_type_args (As, As') =
blanchet@49298
   304
  if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types ();
blanchet@49119
   305
blanchet@49591
   306
fun reassoc_conjs thm =
blanchet@49591
   307
  reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]})
blanchet@49591
   308
  handle THM _ => thm;
blanchet@49591
   309
blanchet@51767
   310
fun type_args_named_constrained_of ((((ncAs, _), _), _), _) = ncAs;
blanchet@51767
   311
fun type_binding_of ((((_, b), _), _), _) = b;
blanchet@51767
   312
fun map_binding_of (((_, (b, _)), _), _) = b;
blanchet@51767
   313
fun rel_binding_of (((_, (_, b)), _), _) = b;
blanchet@49181
   314
fun mixfix_of ((_, mx), _) = mx;
blanchet@49121
   315
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
blanchet@49119
   316
blanchet@49286
   317
fun disc_of ((((disc, _), _), _), _) = disc;
blanchet@49286
   318
fun ctr_of ((((_, ctr), _), _), _) = ctr;
blanchet@49286
   319
fun args_of (((_, args), _), _) = args;
blanchet@49286
   320
fun defaults_of ((_, ds), _) = ds;
blanchet@49181
   321
fun ctr_mixfix_of (_, mx) = mx;
blanchet@49119
   322
blanchet@51808
   323
fun build_map lthy build_arg (Type (s, Ts)) (Type (_, Us)) =
blanchet@51808
   324
  let
blanchet@51808
   325
    val bnf = the (bnf_of lthy s);
blanchet@51808
   326
    val live = live_of_bnf bnf;
blanchet@51808
   327
    val mapx = mk_map live Ts Us (map_of_bnf bnf);
blanchet@51808
   328
    val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx)));
blanchet@51808
   329
  in Term.list_comb (mapx, map build_arg TUs') end;
blanchet@51808
   330
blanchet@51808
   331
fun build_rel_step lthy build_arg (Type (s, Ts)) =
blanchet@51808
   332
  let
blanchet@51808
   333
    val bnf = the (bnf_of lthy s);
blanchet@51808
   334
    val live = live_of_bnf bnf;
blanchet@51808
   335
    val rel = mk_rel live Ts Ts (rel_of_bnf bnf);
blanchet@51808
   336
    val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel)));
blanchet@51808
   337
  in Term.list_comb (rel, map build_arg Ts') end;
blanchet@51808
   338
blanchet@51827
   339
fun derive_induct_fold_rec_thms_for_types pre_bnfs ctor_folds0 ctor_recs0 ctor_induct ctor_fold_thms
blanchet@51827
   340
    ctor_rec_thms nesting_bnfs nested_bnfs fpTs Cs As ctrss ctr_defss folds recs fold_defs rec_defs
blanchet@51827
   341
    lthy =
blanchet@51808
   342
  let
blanchet@51827
   343
    val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss;
blanchet@51827
   344
blanchet@51815
   345
    val nn = length pre_bnfs;
blanchet@51827
   346
    val ns = map length ctr_Tsss;
blanchet@51827
   347
    val mss = map (map length) ctr_Tsss;
blanchet@51827
   348
    val Css = map2 replicate ns Cs;
blanchet@51815
   349
blanchet@51808
   350
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@51808
   351
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
blanchet@51830
   352
    val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs;
blanchet@51808
   353
    val nested_map_comp's = map map_comp'_of_bnf nested_bnfs;
blanchet@51808
   354
    val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs;
blanchet@51810
   355
    val nested_set_map's = maps set_map'_of_bnf nested_bnfs;
blanchet@51808
   356
blanchet@51816
   357
    val fp_b_names = map base_name_of_typ fpTs;
blanchet@51811
   358
blanchet@51827
   359
    val (_, ctor_fold_fun_Ts) = mk_fp_rec_like true As Cs ctor_folds0;
blanchet@51827
   360
    val (_, ctor_rec_fun_Ts) = mk_fp_rec_like true As Cs ctor_recs0;
blanchet@51827
   361
blanchet@51827
   362
    val y_Tsss = map3 mk_rec_like_fun_arg_typess ns mss ctor_fold_fun_Ts;
blanchet@51827
   363
    val g_Tss = mk_fold_fun_typess y_Tsss Css;
blanchet@51827
   364
blanchet@51827
   365
    val z_Tsss = map3 mk_rec_like_fun_arg_typess ns mss ctor_rec_fun_Ts;
blanchet@51827
   366
    val h_Tss = mk_rec_fun_typess fpTs z_Tsss Css;
blanchet@51827
   367
blanchet@51827
   368
    val (((((ps, ps'), xsss), gss), us'), names_lthy) =
blanchet@51808
   369
      lthy
blanchet@51808
   370
      |> mk_Frees' "P" (map mk_pred1T fpTs)
blanchet@51827
   371
      ||>> mk_Freesss "x" ctr_Tsss
blanchet@51827
   372
      ||>> mk_Freess "f" g_Tss
blanchet@51816
   373
      ||>> Variable.variant_fixes fp_b_names;
blanchet@51808
   374
blanchet@51827
   375
    val hss = map2 (map2 retype_free) h_Tss gss;
blanchet@51808
   376
    val us = map2 (curry Free) us' fpTs;
blanchet@51808
   377
blanchet@51808
   378
    fun mk_sets_nested bnf =
blanchet@51808
   379
      let
blanchet@51808
   380
        val Type (T_name, Us) = T_of_bnf bnf;
blanchet@51808
   381
        val lives = lives_of_bnf bnf;
blanchet@51808
   382
        val sets = sets_of_bnf bnf;
blanchet@51808
   383
        fun mk_set U =
blanchet@51808
   384
          (case find_index (curry (op =) U) lives of
blanchet@51808
   385
            ~1 => Term.dummy
blanchet@51808
   386
          | i => nth sets i);
blanchet@51808
   387
      in
blanchet@51808
   388
        (T_name, map mk_set Us)
blanchet@51808
   389
      end;
blanchet@51808
   390
blanchet@51808
   391
    val setss_nested = map mk_sets_nested nested_bnfs;
blanchet@51808
   392
blanchet@51808
   393
    val (induct_thms, induct_thm) =
blanchet@51808
   394
      let
blanchet@51808
   395
        fun mk_set Ts t =
blanchet@51808
   396
          let val Type (_, Ts0) = domain_type (fastype_of t) in
blanchet@51808
   397
            Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@51808
   398
          end;
blanchet@51808
   399
blanchet@51808
   400
        fun mk_raw_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) =
blanchet@51808
   401
            (case find_index (curry (op =) T) fpTs of
blanchet@51808
   402
              ~1 =>
blanchet@51808
   403
              (case AList.lookup (op =) setss_nested T_name of
blanchet@51808
   404
                NONE => []
blanchet@51808
   405
              | SOME raw_sets0 =>
blanchet@51808
   406
                let
blanchet@51808
   407
                  val (Ts, raw_sets) =
blanchet@51808
   408
                    split_list (filter (exists_subtype_in fpTs o fst) (Ts0 ~~ raw_sets0));
blanchet@51808
   409
                  val sets = map (mk_set Ts0) raw_sets;
blanchet@51808
   410
                  val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
blanchet@51808
   411
                  val xysets = map (pair x) (ys ~~ sets);
blanchet@51808
   412
                  val ppremss = map (mk_raw_prem_prems names_lthy') ys;
blanchet@51808
   413
                in
blanchet@51808
   414
                  flat (map2 (map o apfst o cons) xysets ppremss)
blanchet@51808
   415
                end)
blanchet@51808
   416
            | kk => [([], (kk + 1, x))])
blanchet@51808
   417
          | mk_raw_prem_prems _ _ = [];
blanchet@51808
   418
blanchet@51808
   419
        fun close_prem_prem xs t =
blanchet@51808
   420
          fold_rev Logic.all (map Free (drop (nn + length xs)
blanchet@51808
   421
            (rev (Term.add_frees t (map dest_Free xs @ ps'))))) t;
blanchet@51808
   422
blanchet@51808
   423
        fun mk_prem_prem xs (xysets, (j, x)) =
blanchet@51808
   424
          close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) =>
blanchet@51808
   425
              HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets,
blanchet@51808
   426
            HOLogic.mk_Trueprop (nth ps (j - 1) $ x)));
blanchet@51808
   427
blanchet@51808
   428
        fun mk_raw_prem phi ctr ctr_Ts =
blanchet@51808
   429
          let
blanchet@51808
   430
            val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
blanchet@51808
   431
            val pprems = maps (mk_raw_prem_prems names_lthy') xs;
blanchet@51808
   432
          in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end;
blanchet@51808
   433
blanchet@51808
   434
        fun mk_prem (xs, raw_pprems, concl) =
blanchet@51808
   435
          fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl));
blanchet@51808
   436
blanchet@51808
   437
        val raw_premss = map3 (map2 o mk_raw_prem) ps ctrss ctr_Tsss;
blanchet@51808
   438
blanchet@51808
   439
        val goal =
blanchet@51808
   440
          Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss,
blanchet@51808
   441
            HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us)));
blanchet@51808
   442
blanchet@51808
   443
        val kksss = map (map (map (fst o snd) o #2)) raw_premss;
blanchet@51808
   444
blanchet@51814
   445
        val ctor_induct' = ctor_induct OF (map mk_sumEN_tupled_balanced mss);
blanchet@51808
   446
blanchet@51808
   447
        val thm =
blanchet@51808
   448
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@51808
   449
            mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' nested_set_map's
blanchet@51808
   450
              pre_set_defss)
blanchet@51808
   451
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@51808
   452
          |> Thm.close_derivation;
blanchet@51808
   453
      in
blanchet@51808
   454
        `(conj_dests nn) thm
blanchet@51808
   455
      end;
blanchet@51808
   456
blanchet@51808
   457
    val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss);
blanchet@51808
   458
blanchet@51808
   459
    val (fold_thmss, rec_thmss) =
blanchet@51808
   460
      let
blanchet@51808
   461
        val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
blanchet@51808
   462
        val gfolds = map (lists_bmoc gss) folds;
blanchet@51808
   463
        val hrecs = map (lists_bmoc hss) recs;
blanchet@51808
   464
blanchet@51808
   465
        fun mk_goal fss frec_like xctr f xs fxs =
blanchet@51808
   466
          fold_rev (fold_rev Logic.all) (xs :: fss)
blanchet@51808
   467
            (mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs)));
blanchet@51808
   468
blanchet@51808
   469
        fun build_rec_like frec_likes (T, U) =
blanchet@51808
   470
          if T = U then
blanchet@51808
   471
            id_const T
blanchet@51808
   472
          else
blanchet@51808
   473
            (case find_index (curry (op =) T) fpTs of
blanchet@51808
   474
              ~1 => build_map lthy (build_rec_like frec_likes) T U
blanchet@51808
   475
            | kk => nth frec_likes kk);
blanchet@51808
   476
blanchet@51808
   477
        val mk_U = typ_subst (map2 pair fpTs Cs);
blanchet@51808
   478
blanchet@51808
   479
        fun unzip_rec_likes frec_likes combine (x as Free (_, T)) =
blanchet@51808
   480
          if exists_subtype_in fpTs T then
blanchet@51808
   481
            combine (x, build_rec_like frec_likes (T, mk_U T) $ x)
blanchet@51808
   482
          else
blanchet@51808
   483
            ([x], []);
blanchet@51808
   484
blanchet@51808
   485
        val gxsss = map (map (flat_rec (unzip_rec_likes gfolds (fn (_, t) => ([t], []))))) xsss;
blanchet@51808
   486
        val hxsss = map (map (flat_rec (unzip_rec_likes hrecs (pairself single)))) xsss;
blanchet@51808
   487
blanchet@51808
   488
        val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss;
blanchet@51808
   489
        val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss;
blanchet@51808
   490
blanchet@51808
   491
        val fold_tacss =
blanchet@51814
   492
          map2 (map o mk_rec_like_tac pre_map_defs [] nesting_map_ids'' fold_defs) ctor_fold_thms
blanchet@51808
   493
            ctr_defss;
blanchet@51808
   494
        val rec_tacss =
blanchet@51808
   495
          map2 (map o mk_rec_like_tac pre_map_defs nested_map_comp's
blanchet@51814
   496
            (nested_map_ids'' @ nesting_map_ids'') rec_defs) ctor_rec_thms ctr_defss;
blanchet@51808
   497
blanchet@51808
   498
        fun prove goal tac =
blanchet@51808
   499
          Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@51808
   500
          |> Thm.close_derivation;
blanchet@51808
   501
      in
blanchet@51808
   502
        (map2 (map2 prove) fold_goalss fold_tacss, map2 (map2 prove) rec_goalss rec_tacss)
blanchet@51808
   503
      end;
blanchet@51808
   504
blanchet@51808
   505
    val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases));
blanchet@51808
   506
  in
blanchet@51810
   507
    ((induct_thm, induct_thms, [induct_case_names_attr]),
blanchet@51808
   508
     (fold_thmss, code_simp_attrs), (rec_thmss, code_simp_attrs))
blanchet@51808
   509
  end;
blanchet@51808
   510
blanchet@51829
   511
fun derive_coinduct_unfold_corec_thms_for_types pre_bnfs dtor_unfolds0 dtor_corecs0 dtor_coinduct
blanchet@51814
   512
    dtor_strong_induct dtor_ctors dtor_unfold_thms dtor_corec_thms nesting_bnfs nested_bnfs fpTs Cs
blanchet@51829
   513
    As kss mss ns ctrss ctr_defss ctr_wrap_ress unfolds corecs unfold_defs corec_defs lthy =
blanchet@51810
   514
  let
blanchet@51815
   515
    val nn = length pre_bnfs;
blanchet@51815
   516
blanchet@51810
   517
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@51810
   518
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
blanchet@51830
   519
    val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs;
blanchet@51830
   520
    val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs;
blanchet@51810
   521
    val nested_map_comp's = map map_comp'_of_bnf nested_bnfs;
blanchet@51810
   522
    val nested_map_comps'' = map ((fn thm => thm RS sym) o map_comp_of_bnf) nested_bnfs;
blanchet@51810
   523
    val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs;
blanchet@51810
   524
blanchet@51816
   525
    val fp_b_names = map base_name_of_typ fpTs;
blanchet@51811
   526
blanchet@51829
   527
    val (_, dtor_unfold_fun_Ts) = mk_fp_rec_like false As Cs dtor_unfolds0;
blanchet@51829
   528
    val (_, dtor_corec_fun_Ts) = mk_fp_rec_like false As Cs dtor_corecs0;
blanchet@51829
   529
blanchet@51819
   530
    val discss = map (map (mk_disc_or_sel As) o #discs) ctr_wrap_ress;
blanchet@51819
   531
    val selsss = map (map (map (mk_disc_or_sel As)) o #selss) ctr_wrap_ress;
blanchet@51819
   532
    val exhausts = map #exhaust ctr_wrap_ress;
blanchet@51819
   533
    val disc_thmsss = map #disc_thmss ctr_wrap_ress;
blanchet@51819
   534
    val discIss = map #discIs ctr_wrap_ress;
blanchet@51819
   535
    val sel_thmsss = map #sel_thmss ctr_wrap_ress;
blanchet@51810
   536
blanchet@51831
   537
    val ((cs, cpss, ((pgss, crssss, cgssss), _), ((phss, csssss, chssss), _)), names_lthy0) =
blanchet@51831
   538
      mk_unfold_corec_terms_and_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy;
blanchet@51831
   539
blanchet@51810
   540
    val (((rs, us'), vs'), names_lthy) =
blanchet@51831
   541
      names_lthy0
blanchet@51810
   542
      |> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs)
blanchet@51816
   543
      ||>> Variable.variant_fixes fp_b_names
blanchet@51816
   544
      ||>> Variable.variant_fixes (map (suffix "'") fp_b_names);
blanchet@51810
   545
blanchet@51810
   546
    val us = map2 (curry Free) us' fpTs;
blanchet@51810
   547
    val udiscss = map2 (map o rapp) us discss;
blanchet@51810
   548
    val uselsss = map2 (map o map o rapp) us selsss;
blanchet@51810
   549
blanchet@51810
   550
    val vs = map2 (curry Free) vs' fpTs;
blanchet@51810
   551
    val vdiscss = map2 (map o rapp) vs discss;
blanchet@51810
   552
    val vselsss = map2 (map o map o rapp) vs selsss;
blanchet@51810
   553
blanchet@51810
   554
    val ((coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)) =
blanchet@51810
   555
      let
blanchet@51810
   556
        val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs;
blanchet@51810
   557
        val uv_eqs = map2 (curry HOLogic.mk_eq) us vs;
blanchet@51810
   558
        val strong_rs =
blanchet@51810
   559
          map4 (fn u => fn v => fn uvr => fn uv_eq =>
blanchet@51810
   560
            fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs;
blanchet@51810
   561
blanchet@51810
   562
        fun build_rel rs' T =
blanchet@51810
   563
          (case find_index (curry (op =) T) fpTs of
blanchet@51810
   564
            ~1 =>
blanchet@51810
   565
            if exists_subtype_in fpTs T then build_rel_step lthy (build_rel rs') T
blanchet@51810
   566
            else HOLogic.eq_const T
blanchet@51810
   567
          | kk => nth rs' kk);
blanchet@51810
   568
blanchet@51810
   569
        fun build_rel_app rs' usel vsel =
blanchet@51810
   570
          fold rapp [usel, vsel] (build_rel rs' (fastype_of usel));
blanchet@51810
   571
blanchet@51810
   572
        fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels =
blanchet@51810
   573
          (if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @
blanchet@51810
   574
          (if null usels then
blanchet@51810
   575
             []
blanchet@51810
   576
           else
blanchet@51810
   577
             [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc],
blanchet@51810
   578
                Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app rs') usels vsels))]);
blanchet@51810
   579
blanchet@51810
   580
        fun mk_prem_concl rs' n udiscs uselss vdiscs vselss =
blanchet@51810
   581
          Library.foldr1 HOLogic.mk_conj
blanchet@51810
   582
            (flat (map5 (mk_prem_ctr_concls rs' n) (1 upto n) udiscs uselss vdiscs vselss))
blanchet@51810
   583
          handle List.Empty => @{term True};
blanchet@51810
   584
blanchet@51810
   585
        fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss =
blanchet@51810
   586
          fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr,
blanchet@51810
   587
            HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss)));
blanchet@51810
   588
blanchet@51810
   589
        val concl =
blanchet@51810
   590
          HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@51810
   591
            (map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v)))
blanchet@51810
   592
               uvrs us vs));
blanchet@51810
   593
blanchet@51810
   594
        fun mk_goal rs' =
blanchet@51810
   595
          Logic.list_implies (map8 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss,
blanchet@51810
   596
            concl);
blanchet@51810
   597
blanchet@51810
   598
        val goal = mk_goal rs;
blanchet@51810
   599
        val strong_goal = mk_goal strong_rs;
blanchet@51810
   600
blanchet@51810
   601
        fun prove dtor_coinduct' goal =
blanchet@51810
   602
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@51810
   603
            mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors
blanchet@51819
   604
              exhausts ctr_defss disc_thmsss sel_thmsss)
blanchet@51810
   605
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@51810
   606
          |> Thm.close_derivation;
blanchet@51810
   607
blanchet@51810
   608
        fun postproc nn thm =
blanchet@51810
   609
          Thm.permute_prems 0 nn
blanchet@51828
   610
            (if nn = 1 then thm RS mp else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm)
blanchet@51810
   611
          |> Drule.zero_var_indexes
blanchet@51810
   612
          |> `(conj_dests nn);
blanchet@51810
   613
      in
blanchet@51814
   614
        (postproc nn (prove dtor_coinduct goal), postproc nn (prove dtor_strong_induct strong_goal))
blanchet@51810
   615
      end;
blanchet@51810
   616
blanchet@51810
   617
    fun mk_coinduct_concls ms discs ctrs =
blanchet@51810
   618
      let
blanchet@51810
   619
        fun mk_disc_concl disc = [name_of_disc disc];
blanchet@51810
   620
        fun mk_ctr_concl 0 _ = []
blanchet@51810
   621
          | mk_ctr_concl _ ctor = [name_of_ctr ctor];
blanchet@51810
   622
        val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]];
blanchet@51810
   623
        val ctr_concls = map2 mk_ctr_concl ms ctrs;
blanchet@51810
   624
      in
blanchet@51810
   625
        flat (map2 append disc_concls ctr_concls)
blanchet@51810
   626
      end;
blanchet@51810
   627
blanchet@51816
   628
    val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names);
blanchet@51810
   629
    val coinduct_conclss =
blanchet@51810
   630
      map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss;
blanchet@51810
   631
blanchet@51810
   632
    fun mk_maybe_not pos = not pos ? HOLogic.mk_not;
blanchet@51810
   633
blanchet@51810
   634
    val gunfolds = map (lists_bmoc pgss) unfolds;
blanchet@51810
   635
    val hcorecs = map (lists_bmoc phss) corecs;
blanchet@51810
   636
blanchet@51810
   637
    val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) =
blanchet@51810
   638
      let
blanchet@51810
   639
        fun mk_goal pfss c cps fcorec_like n k ctr m cfs' =
blanchet@51810
   640
          fold_rev (fold_rev Logic.all) ([c] :: pfss)
blanchet@51810
   641
            (Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps,
blanchet@51810
   642
               mk_Trueprop_eq (fcorec_like $ c, Term.list_comb (ctr, take m cfs'))));
blanchet@51810
   643
blanchet@51810
   644
        fun build_corec_like fcorec_likes (T, U) =
blanchet@51810
   645
          if T = U then
blanchet@51810
   646
            id_const T
blanchet@51810
   647
          else
blanchet@51810
   648
            (case find_index (curry (op =) U) fpTs of
blanchet@51810
   649
              ~1 => build_map lthy (build_corec_like fcorec_likes) T U
blanchet@51810
   650
            | kk => nth fcorec_likes kk);
blanchet@51810
   651
blanchet@51810
   652
        val mk_U = typ_subst (map2 pair Cs fpTs);
blanchet@51810
   653
blanchet@51810
   654
        fun intr_corec_likes fcorec_likes [] [cf] =
blanchet@51810
   655
            let val T = fastype_of cf in
blanchet@51828
   656
              if exists_subtype_in Cs T then build_corec_like fcorec_likes (T, mk_U T) $ cf else cf
blanchet@51810
   657
            end
blanchet@51810
   658
          | intr_corec_likes fcorec_likes [cq] [cf, cf'] =
blanchet@51810
   659
            mk_If cq (intr_corec_likes fcorec_likes [] [cf])
blanchet@51810
   660
              (intr_corec_likes fcorec_likes [] [cf']);
blanchet@51810
   661
blanchet@51810
   662
        val crgsss = map2 (map2 (map2 (intr_corec_likes gunfolds))) crssss cgssss;
blanchet@51810
   663
        val cshsss = map2 (map2 (map2 (intr_corec_likes hcorecs))) csssss chssss;
blanchet@51810
   664
blanchet@51828
   665
        val unfold_goalss = map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss;
blanchet@51828
   666
        val corec_goalss = map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss;
blanchet@51810
   667
blanchet@51810
   668
        fun mk_map_if_distrib bnf =
blanchet@51810
   669
          let
blanchet@51810
   670
            val mapx = map_of_bnf bnf;
blanchet@51810
   671
            val live = live_of_bnf bnf;
blanchet@51810
   672
            val ((Ts, T), U) = strip_typeN (live + 1) (fastype_of mapx) |>> split_last;
blanchet@51810
   673
            val fs = Variable.variant_frees lthy [mapx] (map (pair "f") Ts);
blanchet@51810
   674
            val t = Term.list_comb (mapx, map (Var o apfst (rpair 0)) fs);
blanchet@51810
   675
          in
blanchet@51810
   676
            Drule.instantiate' (map (SOME o certifyT lthy) [U, T]) [SOME (certify lthy t)]
blanchet@51810
   677
              @{thm if_distrib}
blanchet@51810
   678
          end;
blanchet@51810
   679
blanchet@51810
   680
        val nested_map_if_distribs = map mk_map_if_distrib nested_bnfs;
blanchet@51810
   681
blanchet@51810
   682
        val unfold_tacss =
blanchet@51810
   683
          map3 (map oo mk_corec_like_tac unfold_defs [] [] nesting_map_ids'' [])
blanchet@51814
   684
            dtor_unfold_thms pre_map_defs ctr_defss;
blanchet@51810
   685
        val corec_tacss =
blanchet@51810
   686
          map3 (map oo mk_corec_like_tac corec_defs nested_map_comps'' nested_map_comp's
blanchet@51810
   687
              (nested_map_ids'' @ nesting_map_ids'') nested_map_if_distribs)
blanchet@51814
   688
            dtor_corec_thms pre_map_defs ctr_defss;
blanchet@51810
   689
blanchet@51810
   690
        fun prove goal tac =
blanchet@51815
   691
          Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@51815
   692
          |> Thm.close_derivation;
blanchet@51810
   693
blanchet@51810
   694
        val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss;
blanchet@51810
   695
        val corec_thmss = map2 (map2 prove) corec_goalss corec_tacss;
blanchet@51810
   696
blanchet@51810
   697
        val filter_safesss =
blanchet@51810
   698
          map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo
blanchet@51810
   699
            curry (op ~~)) (map2 (map2 (map2 (member (op =)))) cgssss crgsss);
blanchet@51810
   700
blanchet@51810
   701
        val safe_unfold_thmss = filter_safesss unfold_thmss;
blanchet@51810
   702
        val safe_corec_thmss = filter_safesss corec_thmss;
blanchet@51810
   703
      in
blanchet@51810
   704
        (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss)
blanchet@51810
   705
      end;
blanchet@51810
   706
blanchet@51810
   707
    val (disc_unfold_iff_thmss, disc_corec_iff_thmss) =
blanchet@51810
   708
      let
blanchet@51810
   709
        fun mk_goal c cps fcorec_like n k disc =
blanchet@51810
   710
          mk_Trueprop_eq (disc $ (fcorec_like $ c),
blanchet@51810
   711
            if n = 1 then @{const True}
blanchet@51810
   712
            else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps));
blanchet@51810
   713
blanchet@51810
   714
        val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss;
blanchet@51810
   715
        val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss;
blanchet@51810
   716
blanchet@51828
   717
        fun mk_case_split' cp = Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split};
blanchet@51810
   718
blanchet@51810
   719
        val case_splitss' = map (map mk_case_split') cpss;
blanchet@51810
   720
blanchet@51810
   721
        val unfold_tacss =
blanchet@51810
   722
          map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' unfold_thmss disc_thmsss;
blanchet@51810
   723
        val corec_tacss =
blanchet@51810
   724
          map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss;
blanchet@51810
   725
blanchet@51810
   726
        fun prove goal tac =
blanchet@51810
   727
          Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@51829
   728
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@51810
   729
          |> Thm.close_derivation;
blanchet@51810
   730
blanchet@51810
   731
        fun proves [_] [_] = []
blanchet@51810
   732
          | proves goals tacs = map2 prove goals tacs;
blanchet@51810
   733
      in
blanchet@51828
   734
        (map2 proves unfold_goalss unfold_tacss, map2 proves corec_goalss corec_tacss)
blanchet@51810
   735
      end;
blanchet@51810
   736
blanchet@51810
   737
    val is_triv_discI = is_triv_implies orf is_concl_refl;
blanchet@51810
   738
blanchet@51810
   739
    fun mk_disc_corec_like_thms corec_likes discIs =
blanchet@51810
   740
      map (op RS) (filter_out (is_triv_discI o snd) (corec_likes ~~ discIs));
blanchet@51810
   741
blanchet@51810
   742
    val disc_unfold_thmss = map2 mk_disc_corec_like_thms unfold_thmss discIss;
blanchet@51810
   743
    val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss;
blanchet@51810
   744
blanchet@51810
   745
    fun mk_sel_corec_like_thm corec_like_thm sel sel_thm =
blanchet@51810
   746
      let
blanchet@51810
   747
        val (domT, ranT) = dest_funT (fastype_of sel);
blanchet@51810
   748
        val arg_cong' =
blanchet@51810
   749
          Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
blanchet@51810
   750
            [NONE, NONE, SOME (certify lthy sel)] arg_cong
blanchet@51810
   751
          |> Thm.varifyT_global;
blanchet@51810
   752
        val sel_thm' = sel_thm RSN (2, trans);
blanchet@51810
   753
      in
blanchet@51810
   754
        corec_like_thm RS arg_cong' RS sel_thm'
blanchet@51810
   755
      end;
blanchet@51810
   756
blanchet@51810
   757
    fun mk_sel_corec_like_thms corec_likess =
blanchet@51810
   758
      map3 (map3 (map2 o mk_sel_corec_like_thm)) corec_likess selsss sel_thmsss |> map flat;
blanchet@51810
   759
blanchet@51810
   760
    val sel_unfold_thmss = mk_sel_corec_like_thms unfold_thmss;
blanchet@51810
   761
    val sel_corec_thmss = mk_sel_corec_like_thms corec_thmss;
blanchet@51810
   762
blanchet@51810
   763
    val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn));
blanchet@51810
   764
    val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases));
blanchet@51810
   765
    val coinduct_case_concl_attrs =
blanchet@51810
   766
      map2 (fn casex => fn concls =>
blanchet@51810
   767
          Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls))))
blanchet@51810
   768
        coinduct_cases coinduct_conclss;
blanchet@51810
   769
    val coinduct_case_attrs =
blanchet@51810
   770
      coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs;
blanchet@51810
   771
  in
blanchet@51810
   772
    ((coinduct_thm, coinduct_thms, strong_coinduct_thm, strong_coinduct_thms, coinduct_case_attrs),
blanchet@51810
   773
     (unfold_thmss, corec_thmss, []),
blanchet@51810
   774
     (safe_unfold_thmss, safe_corec_thmss),
blanchet@51810
   775
     (disc_unfold_thmss, disc_corec_thmss, simp_attrs),
blanchet@51810
   776
     (disc_unfold_iff_thmss, disc_corec_iff_thmss, simp_attrs),
blanchet@51810
   777
     (sel_unfold_thmss, sel_corec_thmss, simp_attrs))
blanchet@51810
   778
  end;
blanchet@51810
   779
blanchet@49633
   780
fun define_datatypes prepare_constraint prepare_typ prepare_term lfp construct_fp
blanchet@49633
   781
    (wrap_opts as (no_dests, rep_compat), specs) no_defs_lthy0 =
blanchet@49112
   782
  let
blanchet@49298
   783
    (* TODO: sanity checks on arguments *)
blanchet@49298
   784
blanchet@49286
   785
    val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes"
blanchet@49278
   786
      else ();
blanchet@49278
   787
blanchet@49633
   788
    fun qualify mandatory fp_b_name =
blanchet@49633
   789
      Binding.qualify mandatory fp_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix);
blanchet@49633
   790
blanchet@49367
   791
    val nn = length specs;
blanchet@49361
   792
    val fp_bs = map type_binding_of specs;
blanchet@49498
   793
    val fp_b_names = map Binding.name_of fp_bs;
blanchet@49498
   794
    val fp_common_name = mk_common_name fp_b_names;
blanchet@51758
   795
    val map_bs = map map_binding_of specs;
blanchet@51767
   796
    val rel_bs = map rel_binding_of specs;
blanchet@49298
   797
blanchet@51758
   798
    fun prepare_type_arg (_, (ty, c)) =
blanchet@49298
   799
      let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
blanchet@49298
   800
        TFree (s, prepare_constraint no_defs_lthy0 c)
blanchet@49298
   801
      end;
blanchet@49298
   802
blanchet@51758
   803
    val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of) specs;
blanchet@49298
   804
    val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0;
blanchet@49298
   805
    val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0;
blanchet@51758
   806
    val set_bss = map (map fst o type_args_named_constrained_of) specs;
blanchet@49119
   807
blanchet@49585
   808
    val (((Bs0, Cs), Xs), no_defs_lthy) =
blanchet@49298
   809
      no_defs_lthy0
blanchet@49298
   810
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
blanchet@49585
   811
      |> mk_TFrees (length unsorted_As)
blanchet@49585
   812
      ||>> mk_TFrees nn
blanchet@49585
   813
      ||>> apfst (map TFree) o
blanchet@49585
   814
        variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS);
blanchet@49119
   815
blanchet@49298
   816
    (* TODO: cleaner handling of fake contexts, without "background_theory" *)
blanchet@49298
   817
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
blanchet@49298
   818
      locale and shadows an existing global type*)
blanchet@51768
   819
blanchet@51769
   820
    fun add_fake_type spec =
blanchet@51768
   821
      Sign.add_type no_defs_lthy (type_binding_of spec,
blanchet@51769
   822
        length (type_args_named_constrained_of spec), mixfix_of spec);
blanchet@51768
   823
blanchet@51769
   824
    val fake_thy = Theory.copy #> fold add_fake_type specs;
blanchet@49298
   825
    val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy;
blanchet@49119
   826
blanchet@49182
   827
    fun mk_fake_T b =
blanchet@49121
   828
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
blanchet@49298
   829
        unsorted_As);
blanchet@49121
   830
blanchet@49302
   831
    val fake_Ts = map mk_fake_T fp_bs;
blanchet@49121
   832
blanchet@49181
   833
    val mixfixes = map mixfix_of specs;
blanchet@49119
   834
blanchet@49302
   835
    val _ = (case duplicates Binding.eq_name fp_bs of [] => ()
blanchet@49119
   836
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
   837
blanchet@49121
   838
    val ctr_specss = map ctr_specs_of specs;
blanchet@49119
   839
blanchet@49336
   840
    val disc_bindingss = map (map disc_of) ctr_specss;
blanchet@49336
   841
    val ctr_bindingss =
blanchet@49633
   842
      map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss;
blanchet@49121
   843
    val ctr_argsss = map (map args_of) ctr_specss;
blanchet@49181
   844
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
blanchet@49119
   845
blanchet@49336
   846
    val sel_bindingsss = map (map (map fst)) ctr_argsss;
blanchet@49298
   847
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@49286
   848
    val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
blanchet@49286
   849
blanchet@49308
   850
    val (As :: _) :: fake_ctr_Tsss =
blanchet@49298
   851
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
blanchet@49298
   852
blanchet@49298
   853
    val _ = (case duplicates (op =) unsorted_As of [] => ()
blanchet@49298
   854
      | A :: _ => error ("Duplicate type parameter " ^
blanchet@49298
   855
          quote (Syntax.string_of_typ no_defs_lthy A)));
blanchet@49298
   856
blanchet@49183
   857
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
blanchet@49298
   858
    val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of
blanchet@49165
   859
        [] => ()
blanchet@49342
   860
      | A' :: _ => error ("Extra type variable on right-hand side: " ^
blanchet@49204
   861
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
blanchet@49165
   862
blanchet@49591
   863
    fun eq_fpT_check (T as Type (s, Us)) (Type (s', Us')) =
blanchet@49146
   864
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
blanchet@49146
   865
          quote (Syntax.string_of_typ fake_lthy T)))
blanchet@49591
   866
      | eq_fpT_check _ _ = false;
blanchet@49146
   867
blanchet@49204
   868
    fun freeze_fp (T as Type (s, Us)) =
blanchet@49591
   869
        (case find_index (eq_fpT_check T) fake_Ts of
blanchet@49591
   870
          ~1 => Type (s, map freeze_fp Us)
blanchet@49591
   871
        | kk => nth Xs kk)
blanchet@49204
   872
      | freeze_fp T = T;
blanchet@49121
   873
blanchet@49536
   874
    val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss;
blanchet@49536
   875
    val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs;
blanchet@49119
   876
blanchet@49298
   877
    val fp_eqs =
blanchet@49536
   878
      map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs;
blanchet@49121
   879
blanchet@51824
   880
    val (pre_bnfs, (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, dtors = dtors0, ctors = ctors0,
blanchet@51805
   881
           folds = fp_folds0, recs = fp_recs0, induct = fp_induct, strong_induct = fp_strong_induct,
blanchet@51805
   882
           dtor_ctors, ctor_dtors, ctor_injects, map_thms = fp_map_thms, set_thmss = fp_set_thmss,
blanchet@51805
   883
           rel_thms = fp_rel_thms, fold_thms = fp_fold_thms, rec_thms = fp_rec_thms}, lthy)) =
blanchet@51767
   884
      fp_bnf construct_fp fp_bs mixfixes map_bs rel_bs set_bss (map dest_TFree unsorted_As) fp_eqs
blanchet@51758
   885
        no_defs_lthy0;
blanchet@49585
   886
blanchet@49585
   887
    val timer = time (Timer.startRealTimer ());
blanchet@49121
   888
blanchet@49363
   889
    fun add_nesty_bnf_names Us =
blanchet@49226
   890
      let
blanchet@49226
   891
        fun add (Type (s, Ts)) ss =
blanchet@49226
   892
            let val (needs, ss') = fold_map add Ts ss in
blanchet@49226
   893
              if exists I needs then (true, insert (op =) s ss') else (false, ss')
blanchet@49226
   894
            end
blanchet@49363
   895
          | add T ss = (member (op =) Us T, ss);
blanchet@49226
   896
      in snd oo add end;
blanchet@49226
   897
blanchet@49363
   898
    fun nesty_bnfs Us =
blanchet@49536
   899
      map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []);
blanchet@49363
   900
blanchet@49363
   901
    val nesting_bnfs = nesty_bnfs As;
blanchet@49536
   902
    val nested_bnfs = nesty_bnfs Xs;
blanchet@49226
   903
blanchet@49585
   904
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@49585
   905
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
blanchet@49585
   906
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
blanchet@51830
   907
    val nesting_set_map's = maps set_map'_of_bnf nesting_bnfs;
blanchet@51766
   908
    val nested_set_map's = maps set_map'_of_bnf nested_bnfs;
blanchet@49585
   909
blanchet@49585
   910
    val live = live_of_bnf any_fp_bnf;
blanchet@49585
   911
blanchet@49585
   912
    val Bs =
blanchet@49585
   913
      map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A)
blanchet@49585
   914
        (liveness_of_fp_bnf (length As) any_fp_bnf) As Bs0;
blanchet@49585
   915
blanchet@49585
   916
    val B_ify = Term.typ_subst_atomic (As ~~ Bs);
blanchet@49167
   917
blanchet@49501
   918
    val ctors = map (mk_ctor As) ctors0;
blanchet@49501
   919
    val dtors = map (mk_dtor As) dtors0;
blanchet@49124
   920
blanchet@49501
   921
    val fpTs = map (domain_type o fastype_of) dtors;
blanchet@49362
   922
blanchet@51780
   923
    fun massage_simple_notes base =
blanchet@51780
   924
      filter_out (null o #2)
blanchet@51780
   925
      #> map (fn (thmN, thms, attrs) =>
blanchet@51780
   926
        ((qualify true base (Binding.name thmN), attrs), [(thms, [])]));
blanchet@51780
   927
blanchet@51780
   928
    val massage_multi_notes =
blanchet@51780
   929
      maps (fn (thmN, thmss, attrs) =>
blanchet@51780
   930
        if forall null thmss then
blanchet@51780
   931
          []
blanchet@51780
   932
        else
blanchet@51780
   933
          map3 (fn fp_b_name => fn Type (T_name, _) => fn thms =>
blanchet@51780
   934
            ((qualify true fp_b_name (Binding.name thmN), attrs T_name),
blanchet@51780
   935
             [(thms, [])])) fp_b_names fpTs thmss);
blanchet@51780
   936
blanchet@49536
   937
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs;
blanchet@49203
   938
    val ns = map length ctr_Tsss;
blanchet@49212
   939
    val kss = map (fn n => 1 upto n) ns;
blanchet@49203
   940
    val mss = map (map length) ctr_Tsss;
blanchet@49203
   941
    val Css = map2 replicate ns Cs;
blanchet@49203
   942
blanchet@51827
   943
    val (fp_folds, fp_fold_fun_Ts) = mk_fp_rec_like lfp As Cs fp_folds0;
blanchet@51827
   944
    val (fp_recs, fp_rec_fun_Ts) = mk_fp_rec_like lfp As Cs fp_recs0;
blanchet@49210
   945
blanchet@51827
   946
    val (((fold_only, rec_only),
blanchet@51830
   947
          (cs, cpss, unfold_only as ((_, crssss, cgssss), (_, g_Tsss, _)),
blanchet@51830
   948
           corec_only as ((_, csssss, chssss), (_, h_Tsss, _)))), _) =
blanchet@49208
   949
      if lfp then
blanchet@49208
   950
        let
blanchet@51827
   951
          val y_Tsss = map3 mk_rec_like_fun_arg_typess ns mss fp_fold_fun_Ts;
blanchet@51827
   952
          val g_Tss = mk_fold_fun_typess y_Tsss Css;
blanchet@49208
   953
blanchet@49484
   954
          val ((gss, ysss), lthy) =
blanchet@49208
   955
            lthy
blanchet@49208
   956
            |> mk_Freess "f" g_Tss
blanchet@49208
   957
            ||>> mk_Freesss "x" y_Tsss;
blanchet@49670
   958
blanchet@51827
   959
          val z_Tsss = map3 mk_rec_like_fun_arg_typess ns mss fp_rec_fun_Ts;
blanchet@51827
   960
          val h_Tss = mk_rec_fun_typess fpTs z_Tsss Css;
blanchet@49204
   961
blanchet@49298
   962
          val hss = map2 (map2 retype_free) h_Tss gss;
blanchet@49670
   963
          val zsss = map2 (map2 (map2 retype_free)) z_Tsss ysss;
blanchet@49210
   964
        in
blanchet@49670
   965
          ((((gss, g_Tss, ysss), (hss, h_Tss, zsss)),
blanchet@49683
   966
            ([], [], (([], [], []), ([], [], [])), (([], [], []), ([], [], [])))), lthy)
blanchet@49210
   967
        end
blanchet@49208
   968
      else
blanchet@51831
   969
        mk_unfold_corec_terms_and_types fpTs Cs ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy
blanchet@51831
   970
        |>> pair (([], [], []), ([], [], []));
blanchet@49210
   971
blanchet@49585
   972
    fun define_ctrs_case_for_type (((((((((((((((((((((((((fp_bnf, fp_b), fpT), C), ctor), dtor),
blanchet@49585
   973
            fp_fold), fp_rec), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs),
blanchet@49585
   974
          pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), ctr_bindings),
blanchet@49585
   975
        ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy =
blanchet@49176
   976
      let
blanchet@49498
   977
        val fp_b_name = Binding.name_of fp_b;
blanchet@49498
   978
blanchet@49501
   979
        val dtorT = domain_type (fastype_of ctor);
blanchet@49210
   980
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
blanchet@49255
   981
        val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
blanchet@49134
   982
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
blanchet@49119
   983
blanchet@49593
   984
        val (((((w, fs), xss), yss), u'), names_lthy) =
blanchet@49204
   985
          no_defs_lthy
blanchet@49501
   986
          |> yield_singleton (mk_Frees "w") dtorT
blanchet@49176
   987
          ||>> mk_Frees "f" case_Ts
blanchet@49370
   988
          ||>> mk_Freess "x" ctr_Tss
blanchet@49585
   989
          ||>> mk_Freess "y" (map (map B_ify) ctr_Tss)
blanchet@49498
   990
          ||>> yield_singleton Variable.variant_fixes fp_b_name;
blanchet@49370
   991
blanchet@49498
   992
        val u = Free (u', fpT);
blanchet@49121
   993
blanchet@49585
   994
        val tuple_xs = map HOLogic.mk_tuple xss;
blanchet@49585
   995
        val tuple_ys = map HOLogic.mk_tuple yss;
blanchet@49585
   996
blanchet@49129
   997
        val ctr_rhss =
blanchet@49585
   998
          map3 (fn k => fn xs => fn tuple_x => fold_rev Term.lambda xs (ctor $
blanchet@49585
   999
            mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs;
blanchet@49121
  1000
blanchet@49633
  1001
        val case_binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ caseN) fp_b);
blanchet@49129
  1002
blanchet@49134
  1003
        val case_rhs =
blanchet@49498
  1004
          fold_rev Term.lambda (fs @ [u])
blanchet@49501
  1005
            (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u));
blanchet@49129
  1006
blanchet@49201
  1007
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
blanchet@49169
  1008
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
blanchet@49302
  1009
              Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
blanchet@49336
  1010
            (case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
blanchet@49121
  1011
          ||> `Local_Theory.restore;
blanchet@49121
  1012
blanchet@49121
  1013
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
  1014
blanchet@49121
  1015
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49585
  1016
        val ctr_defs' =
blanchet@49585
  1017
          map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs;
blanchet@49130
  1018
        val case_def = Morphism.thm phi raw_case_def;
blanchet@49130
  1019
blanchet@49203
  1020
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
blanchet@49203
  1021
        val casex0 = Morphism.term phi raw_case;
blanchet@49203
  1022
blanchet@49203
  1023
        val ctrs = map (mk_ctr As) ctrs0;
blanchet@49121
  1024
blanchet@49585
  1025
        fun wrap lthy =
blanchet@49123
  1026
          let
traytel@50170
  1027
            fun exhaust_tac {context = ctxt, prems = _} =
blanchet@49135
  1028
              let
blanchet@49585
  1029
                val ctor_iff_dtor_thm =
blanchet@49585
  1030
                  let
blanchet@49585
  1031
                    val goal =
blanchet@49585
  1032
                      fold_rev Logic.all [w, u]
blanchet@49585
  1033
                        (mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w)));
blanchet@49585
  1034
                  in
wenzelm@51551
  1035
                    Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49585
  1036
                      mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [dtorT, fpT])
blanchet@49585
  1037
                        (certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor)
blanchet@49585
  1038
                    |> Thm.close_derivation
blanchet@49585
  1039
                    |> Morphism.thm phi
blanchet@49585
  1040
                  end;
blanchet@49585
  1041
blanchet@49585
  1042
                val sumEN_thm' =
blanchet@49585
  1043
                  unfold_thms lthy @{thms all_unit_eq}
blanchet@49585
  1044
                    (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
blanchet@49585
  1045
                       (mk_sumEN_balanced n))
blanchet@49585
  1046
                  |> Morphism.thm phi;
blanchet@49135
  1047
              in
blanchet@49585
  1048
                mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm'
blanchet@49135
  1049
              end;
blanchet@49135
  1050
blanchet@49585
  1051
            val inject_tacss =
blanchet@49585
  1052
              map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
blanchet@49585
  1053
                  mk_inject_tac ctxt ctr_def ctor_inject]) ms ctr_defs;
blanchet@49585
  1054
blanchet@49585
  1055
            val half_distinct_tacss =
blanchet@49585
  1056
              map (map (fn (def, def') => fn {context = ctxt, ...} =>
blanchet@49585
  1057
                mk_half_distinct_tac ctxt ctor_inject [def, def'])) (mk_half_pairss (`I ctr_defs));
blanchet@49585
  1058
blanchet@49585
  1059
            val case_tacs =
blanchet@49585
  1060
              map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
blanchet@49585
  1061
                mk_case_tac ctxt n k m case_def ctr_def dtor_ctor) ks ms ctr_defs;
blanchet@49585
  1062
blanchet@49585
  1063
            val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
blanchet@49585
  1064
blanchet@49585
  1065
            val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss
blanchet@49123
  1066
          in
blanchet@51781
  1067
            wrap_free_constructors tacss (((wrap_opts, ctrs0), casex0), (disc_bindings,
blanchet@51781
  1068
              (sel_bindingss, sel_defaultss))) lthy
blanchet@49123
  1069
          end;
blanchet@49121
  1070
blanchet@51810
  1071
        fun derive_maps_sets_rels (ctr_wrap_res, lthy) =
blanchet@49585
  1072
          let
blanchet@49585
  1073
            val rel_flip = rel_flip_of_bnf fp_bnf;
blanchet@49585
  1074
            val nones = replicate live NONE;
blanchet@49585
  1075
blanchet@49585
  1076
            val ctor_cong =
blanchet@51746
  1077
              if lfp then
blanchet@51746
  1078
                Drule.dummy_thm
blanchet@51746
  1079
              else
blanchet@51746
  1080
                let val ctor' = mk_ctor Bs ctor in
blanchet@51746
  1081
                  cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor')] arg_cong
blanchet@51746
  1082
                end;
blanchet@49585
  1083
blanchet@49585
  1084
            fun mk_cIn ify =
blanchet@49585
  1085
              certify lthy o (not lfp ? curry (op $) (map_types ify ctor)) oo
blanchet@49585
  1086
              mk_InN_balanced (ify ctr_sum_prod_T) n;
blanchet@49585
  1087
blanchet@49585
  1088
            val cxIns = map2 (mk_cIn I) tuple_xs ks;
blanchet@49585
  1089
            val cyIns = map2 (mk_cIn B_ify) tuple_ys ks;
blanchet@49585
  1090
blanchet@49682
  1091
            fun mk_map_thm ctr_def' cxIn =
blanchet@49585
  1092
              fold_thms lthy [ctr_def']
blanchet@49585
  1093
                (unfold_thms lthy (pre_map_def ::
blanchet@49585
  1094
                     (if lfp then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map)
blanchet@49585
  1095
                   (cterm_instantiate_pos (nones @ [SOME cxIn])
blanchet@49585
  1096
                      (if lfp then fp_map_thm else fp_map_thm RS ctor_cong)))
blanchet@49593
  1097
              |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
  1098
blanchet@49682
  1099
            fun mk_set_thm fp_set_thm ctr_def' cxIn =
blanchet@49585
  1100
              fold_thms lthy [ctr_def']
blanchet@51766
  1101
                (unfold_thms lthy (pre_set_defs @ nested_set_map's @ nesting_set_map's @
blanchet@49585
  1102
                     (if lfp then [] else [dtor_ctor]) @ sum_prod_thms_set)
blanchet@49585
  1103
                   (cterm_instantiate_pos [SOME cxIn] fp_set_thm))
blanchet@49593
  1104
              |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
  1105
blanchet@49682
  1106
            fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns;
blanchet@49585
  1107
blanchet@49682
  1108
            val map_thms = map2 mk_map_thm ctr_defs' cxIns;
blanchet@49585
  1109
            val set_thmss = map mk_set_thms fp_set_thms;
blanchet@49127
  1110
blanchet@49682
  1111
            val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns);
blanchet@49585
  1112
blanchet@49682
  1113
            fun mk_rel_thm postproc ctr_defs' cxIn cyIn =
blanchet@49585
  1114
              fold_thms lthy ctr_defs'
blanchet@51745
  1115
                 (unfold_thms lthy (@{thm Inl_Inr_False} :: pre_rel_def ::
blanchet@51745
  1116
                      (if lfp then [] else [dtor_ctor]) @ sum_prod_thms_rel)
blanchet@49585
  1117
                    (cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm))
blanchet@49593
  1118
              |> postproc
blanchet@49593
  1119
              |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
  1120
blanchet@49682
  1121
            fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) =
blanchet@49682
  1122
              mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn;
blanchet@49585
  1123
blanchet@49592
  1124
            val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos);
blanchet@49585
  1125
blanchet@49682
  1126
            fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) =
blanchet@49585
  1127
              mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def']
blanchet@49682
  1128
                cxIn cyIn;
blanchet@49121
  1129
blanchet@49592
  1130
            fun mk_other_half_rel_distinct_thm thm =
blanchet@49585
  1131
              flip_rels lthy live thm RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2);
blanchet@49585
  1132
blanchet@49592
  1133
            val half_rel_distinct_thmss =
blanchet@49592
  1134
              map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos);
blanchet@49592
  1135
            val other_half_rel_distinct_thmss =
blanchet@49592
  1136
              map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss;
blanchet@49592
  1137
            val (rel_distinct_thms, _) =
blanchet@49592
  1138
              join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss;
blanchet@49134
  1139
blanchet@49585
  1140
            val notes =
blanchet@49594
  1141
              [(mapN, map_thms, code_simp_attrs),
blanchet@49592
  1142
               (rel_distinctN, rel_distinct_thms, code_simp_attrs),
blanchet@49592
  1143
               (rel_injectN, rel_inject_thms, code_simp_attrs),
blanchet@49585
  1144
               (setsN, flat set_thmss, code_simp_attrs)]
blanchet@51780
  1145
              |> massage_simple_notes fp_b_name;
blanchet@49585
  1146
          in
blanchet@51810
  1147
            (ctr_wrap_res, lthy |> Local_Theory.notes notes |> snd)
blanchet@49585
  1148
          end;
blanchet@49585
  1149
blanchet@49585
  1150
        fun define_fold_rec no_defs_lthy =
blanchet@49134
  1151
          let
blanchet@49208
  1152
            val fpT_to_C = fpT --> C;
blanchet@49199
  1153
blanchet@49681
  1154
            fun build_prod_proj mk_proj (T, U) =
blanchet@49670
  1155
              if T = U then
blanchet@49670
  1156
                id_const T
blanchet@49670
  1157
              else
blanchet@49670
  1158
                (case (T, U) of
blanchet@49670
  1159
                  (Type (s, _), Type (s', _)) =>
blanchet@51808
  1160
                  if s = s' then build_map lthy (build_prod_proj mk_proj) T U else mk_proj T
blanchet@49670
  1161
                | _ => mk_proj T);
blanchet@49670
  1162
blanchet@49681
  1163
            (* TODO: Avoid these complications; cf. corec case *)
blanchet@49672
  1164
            fun mk_U proj (Type (s as @{type_name prod}, Ts as [T', U])) =
blanchet@49672
  1165
                if member (op =) fpTs T' then proj (T', U) else Type (s, map (mk_U proj) Ts)
blanchet@49670
  1166
              | mk_U proj (Type (s, Ts)) = Type (s, map (mk_U proj) Ts)
blanchet@49670
  1167
              | mk_U _ T = T;
blanchet@49670
  1168
blanchet@51794
  1169
            fun unzip_rec (x as Free (_, T)) =
blanchet@51808
  1170
              if exists_subtype_in fpTs T then
blanchet@51794
  1171
                ([build_prod_proj fst_const (T, mk_U fst T) $ x],
blanchet@51794
  1172
                 [build_prod_proj snd_const (T, mk_U snd T) $ x])
blanchet@49670
  1173
              else
blanchet@51794
  1174
                ([x], []);
blanchet@49670
  1175
blanchet@51793
  1176
            fun mk_rec_like_arg f xs =
blanchet@51794
  1177
              mk_tupled_fun (HOLogic.mk_tuple xs) f (flat_rec unzip_rec xs);
blanchet@49670
  1178
blanchet@49670
  1179
            fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xsss)) =
blanchet@49215
  1180
              let
blanchet@49215
  1181
                val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
blanchet@49633
  1182
                val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b);
blanchet@49215
  1183
                val spec =
blanchet@49336
  1184
                  mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)),
blanchet@49504
  1185
                    Term.list_comb (fp_rec_like,
blanchet@49670
  1186
                      map2 (mk_sum_caseN_balanced oo map2 mk_rec_like_arg) fss xsss));
blanchet@49336
  1187
              in (binding, spec) end;
blanchet@49199
  1188
blanchet@49504
  1189
            val rec_like_infos =
blanchet@49504
  1190
              [(foldN, fp_fold, fold_only),
blanchet@49215
  1191
               (recN, fp_rec, rec_only)];
blanchet@49215
  1192
blanchet@49504
  1193
            val (bindings, specs) = map generate_rec_like rec_like_infos |> split_list;
blanchet@49215
  1194
blanchet@49215
  1195
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49201
  1196
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49199
  1197
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
  1198
                #>> apsnd snd) bindings specs
blanchet@49199
  1199
              ||> `Local_Theory.restore;
blanchet@49201
  1200
blanchet@49201
  1201
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49201
  1202
blanchet@49504
  1203
            val [fold_def, rec_def] = map (Morphism.thm phi) defs;
blanchet@49201
  1204
blanchet@49536
  1205
            val [foldx, recx] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts;
blanchet@49134
  1206
          in
blanchet@49693
  1207
            ((foldx, recx, fold_def, rec_def), lthy')
blanchet@49134
  1208
          end;
blanchet@49134
  1209
blanchet@49585
  1210
        fun define_unfold_corec no_defs_lthy =
blanchet@49210
  1211
          let
blanchet@49210
  1212
            val B_to_fpT = C --> fpT;
blanchet@49211
  1213
blanchet@49683
  1214
            fun build_sum_inj mk_inj (T, U) =
blanchet@49683
  1215
              if T = U then
blanchet@49683
  1216
                id_const T
blanchet@49683
  1217
              else
blanchet@49683
  1218
                (case (T, U) of
blanchet@49683
  1219
                  (Type (s, _), Type (s', _)) =>
blanchet@51808
  1220
                  if s = s' then build_map lthy (build_sum_inj mk_inj) T U
blanchet@49683
  1221
                  else uncurry mk_inj (dest_sumT U)
blanchet@49683
  1222
                | _ => uncurry mk_inj (dest_sumT U));
blanchet@49683
  1223
blanchet@49683
  1224
            fun build_dtor_corec_like_arg _ [] [cf] = cf
blanchet@49683
  1225
              | build_dtor_corec_like_arg T [cq] [cf, cf'] =
blanchet@49683
  1226
                mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf)
blanchet@49683
  1227
                  (build_sum_inj Inr_const (fastype_of cf', T) $ cf')
blanchet@49683
  1228
blanchet@49683
  1229
            val crgsss = map3 (map3 (map3 build_dtor_corec_like_arg)) g_Tsss crssss cgssss;
blanchet@49683
  1230
            val cshsss = map3 (map3 (map3 build_dtor_corec_like_arg)) h_Tsss csssss chssss;
blanchet@49683
  1231
blanchet@49276
  1232
            fun mk_preds_getterss_join c n cps sum_prod_T cqfss =
blanchet@49276
  1233
              Term.lambda c (mk_IfN sum_prod_T cps
blanchet@49276
  1234
                (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)));
blanchet@49275
  1235
blanchet@49683
  1236
            fun generate_corec_like (suf, fp_rec_like, (cqfsss, ((pfss, _, _), (f_sum_prod_Ts, _,
blanchet@49683
  1237
                pf_Tss)))) =
blanchet@49211
  1238
              let
blanchet@49211
  1239
                val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
blanchet@49633
  1240
                val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b);
blanchet@49211
  1241
                val spec =
blanchet@49336
  1242
                  mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)),
blanchet@49504
  1243
                    Term.list_comb (fp_rec_like,
blanchet@49276
  1244
                      map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss));
blanchet@49336
  1245
              in (binding, spec) end;
blanchet@49210
  1246
blanchet@49504
  1247
            val corec_like_infos =
blanchet@49683
  1248
              [(unfoldN, fp_fold, (crgsss, unfold_only)),
blanchet@49683
  1249
               (corecN, fp_rec, (cshsss, corec_only))];
blanchet@49212
  1250
blanchet@49504
  1251
            val (bindings, specs) = map generate_corec_like corec_like_infos |> split_list;
blanchet@49211
  1252
blanchet@49211
  1253
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49210
  1254
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49210
  1255
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
  1256
                #>> apsnd snd) bindings specs
blanchet@49210
  1257
              ||> `Local_Theory.restore;
blanchet@49210
  1258
blanchet@49210
  1259
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49210
  1260
blanchet@49504
  1261
            val [unfold_def, corec_def] = map (Morphism.thm phi) defs;
blanchet@49210
  1262
blanchet@49536
  1263
            val [unfold, corec] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts;
blanchet@49210
  1264
          in
blanchet@49693
  1265
            ((unfold, corec, unfold_def, corec_def), lthy')
blanchet@49287
  1266
          end;
blanchet@49287
  1267
blanchet@49504
  1268
        val define_rec_likes = if lfp then define_fold_rec else define_unfold_corec;
blanchet@49585
  1269
blanchet@51810
  1270
        fun massage_res ((ctr_wrap_res, rec_like_res), lthy) =
blanchet@51810
  1271
          (((ctrs, xss, ctr_defs, ctr_wrap_res), rec_like_res), lthy);
blanchet@49119
  1272
      in
blanchet@49585
  1273
        (wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy')
blanchet@49119
  1274
      end;
blanchet@49167
  1275
blanchet@49585
  1276
    fun wrap_types_and_more (wrap_types_and_mores, lthy) =
blanchet@49585
  1277
      fold_map I wrap_types_and_mores lthy
blanchet@49585
  1278
      |>> apsnd split_list4 o apfst split_list4 o split_list;
blanchet@49226
  1279
blanchet@49585
  1280
    (* TODO: Add map, sets, rel simps *)
blanchet@49479
  1281
    val mk_simp_thmss =
blanchet@51819
  1282
      map3 (fn {injects, distincts, case_thms, ...} => fn rec_likes => fn fold_likes =>
blanchet@51819
  1283
        injects @ distincts @ case_thms @ rec_likes @ fold_likes);
blanchet@49479
  1284
blanchet@51810
  1285
    fun derive_and_note_induct_fold_rec_thms_for_types
blanchet@51827
  1286
        (((ctrss, _, ctr_defss, ctr_wrap_ress), (folds, recs, fold_defs, rec_defs)), lthy) =
blanchet@49202
  1287
      let
blanchet@51810
  1288
        val ((induct_thm, induct_thms, induct_attrs),
blanchet@51810
  1289
             (fold_thmss, fold_attrs),
blanchet@51808
  1290
             (rec_thmss, rec_attrs)) =
blanchet@51827
  1291
          derive_induct_fold_rec_thms_for_types pre_bnfs fp_folds0 fp_recs0 fp_induct fp_fold_thms
blanchet@51827
  1292
            fp_rec_thms nesting_bnfs nested_bnfs fpTs Cs As ctrss ctr_defss folds recs fold_defs
blanchet@51827
  1293
            rec_defs lthy;
blanchet@49201
  1294
blanchet@51830
  1295
        val induct_type_attr = Attrib.internal o K o Induct.induct_type;
blanchet@51810
  1296
blanchet@51810
  1297
        val simp_thmss = mk_simp_thmss ctr_wrap_ress rec_thmss fold_thmss;
blanchet@49438
  1298
blanchet@49337
  1299
        val common_notes =
blanchet@51808
  1300
          (if nn > 1 then [(inductN, [induct_thm], induct_attrs)] else [])
blanchet@51780
  1301
          |> massage_simple_notes fp_common_name;
blanchet@49337
  1302
blanchet@49226
  1303
        val notes =
blanchet@51808
  1304
          [(foldN, fold_thmss, K fold_attrs),
blanchet@51810
  1305
           (inductN, map single induct_thms, fn T_name => induct_attrs @ [induct_type_attr T_name]),
blanchet@51808
  1306
           (recN, rec_thmss, K rec_attrs),
blanchet@49585
  1307
           (simpsN, simp_thmss, K [])]
blanchet@51780
  1308
          |> massage_multi_notes;
blanchet@49202
  1309
      in
blanchet@51824
  1310
        lthy
blanchet@51824
  1311
        |> Local_Theory.notes (common_notes @ notes) |> snd
blanchet@51824
  1312
        |> register_fps true fp_res ctr_wrap_ress
blanchet@49202
  1313
      end;
blanchet@49202
  1314
blanchet@51810
  1315
    fun derive_and_note_coinduct_unfold_corec_thms_for_types
blanchet@51811
  1316
        (((ctrss, _, ctr_defss, ctr_wrap_ress), (unfolds, corecs, unfold_defs, corec_defs)), lthy) =
blanchet@49212
  1317
      let
blanchet@51810
  1318
        val ((coinduct_thm, coinduct_thms, strong_coinduct_thm, strong_coinduct_thms,
blanchet@51810
  1319
              coinduct_attrs),
blanchet@51810
  1320
             (unfold_thmss, corec_thmss, corec_like_attrs),
blanchet@51810
  1321
             (safe_unfold_thmss, safe_corec_thmss),
blanchet@51810
  1322
             (disc_unfold_thmss, disc_corec_thmss, disc_corec_like_attrs),
blanchet@51810
  1323
             (disc_unfold_iff_thmss, disc_corec_iff_thmss, disc_corec_like_iff_attrs),
blanchet@51810
  1324
             (sel_unfold_thmss, sel_corec_thmss, sel_corec_like_attrs)) =
blanchet@51829
  1325
          derive_coinduct_unfold_corec_thms_for_types pre_bnfs fp_folds0 fp_recs0 fp_induct
blanchet@51811
  1326
            fp_strong_induct dtor_ctors fp_fold_thms fp_rec_thms nesting_bnfs nested_bnfs fpTs Cs As
blanchet@51829
  1327
            kss mss ns ctrss ctr_defss ctr_wrap_ress unfolds corecs unfold_defs corec_defs lthy;
blanchet@49212
  1328
blanchet@51830
  1329
        val coinduct_type_attr = Attrib.internal o K o Induct.coinduct_type;
blanchet@49479
  1330
blanchet@49587
  1331
        fun flat_corec_like_thms corec_likes disc_corec_likes sel_corec_likes =
blanchet@49504
  1332
          corec_likes @ disc_corec_likes @ sel_corec_likes;
blanchet@49479
  1333
blanchet@49479
  1334
        val simp_thmss =
blanchet@51810
  1335
          mk_simp_thmss ctr_wrap_ress
blanchet@49587
  1336
            (map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss)
blanchet@49587
  1337
            (map3 flat_corec_like_thms safe_unfold_thmss disc_unfold_thmss sel_unfold_thmss);
blanchet@49479
  1338
blanchet@49479
  1339
        val anonymous_notes =
blanchet@49504
  1340
          [(flat safe_unfold_thmss @ flat safe_corec_thmss, simp_attrs)]
blanchet@49479
  1341
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@49266
  1342
blanchet@49342
  1343
        val common_notes =
blanchet@49591
  1344
          (if nn > 1 then
blanchet@51810
  1345
             [(coinductN, [coinduct_thm], coinduct_attrs),
blanchet@51810
  1346
              (strong_coinductN, [strong_coinduct_thm], coinduct_attrs)]
blanchet@49591
  1347
           else
blanchet@49591
  1348
             [])
blanchet@51780
  1349
          |> massage_simple_notes fp_common_name;
blanchet@49342
  1350
blanchet@49212
  1351
        val notes =
blanchet@51780
  1352
          [(coinductN, map single coinduct_thms,
blanchet@51810
  1353
            fn T_name => coinduct_attrs @ [coinduct_type_attr T_name]),
blanchet@51810
  1354
           (corecN, corec_thmss, K corec_like_attrs),
blanchet@51810
  1355
           (disc_corecN, disc_corec_thmss, K disc_corec_like_attrs),
blanchet@51810
  1356
           (disc_corec_iffN, disc_corec_iff_thmss, K disc_corec_like_iff_attrs),
blanchet@51810
  1357
           (disc_unfoldN, disc_unfold_thmss, K disc_corec_like_attrs),
blanchet@51810
  1358
           (disc_unfold_iffN, disc_unfold_iff_thmss, K disc_corec_like_iff_attrs),
blanchet@51810
  1359
           (sel_corecN, sel_corec_thmss, K sel_corec_like_attrs),
blanchet@51810
  1360
           (sel_unfoldN, sel_unfold_thmss, K sel_corec_like_attrs),
blanchet@51780
  1361
           (simpsN, simp_thmss, K []),
blanchet@51810
  1362
           (strong_coinductN, map single strong_coinduct_thms, K coinduct_attrs),
blanchet@51810
  1363
           (unfoldN, unfold_thmss, K corec_like_attrs)]
blanchet@51780
  1364
          |> massage_multi_notes;
blanchet@49212
  1365
      in
blanchet@51824
  1366
        lthy
blanchet@51824
  1367
        |> Local_Theory.notes (anonymous_notes @ common_notes @ notes) |> snd
blanchet@51824
  1368
        |> register_fps false fp_res ctr_wrap_ress
blanchet@49212
  1369
      end;
blanchet@49212
  1370
blanchet@49204
  1371
    val lthy' = lthy
blanchet@49585
  1372
      |> fold_map define_ctrs_case_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ Cs ~~ ctors ~~ dtors ~~
blanchet@49585
  1373
        fp_folds ~~ fp_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~
blanchet@49585
  1374
        pre_set_defss ~~ pre_rel_defs ~~ fp_map_thms ~~ fp_set_thmss ~~ fp_rel_thms ~~ ns ~~ kss ~~
blanchet@49585
  1375
        mss ~~ ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~
blanchet@49585
  1376
        raw_sel_defaultsss)
blanchet@49585
  1377
      |> wrap_types_and_more
blanchet@51808
  1378
      |> (if lfp then derive_and_note_induct_fold_rec_thms_for_types
blanchet@51808
  1379
          else derive_and_note_coinduct_unfold_corec_thms_for_types);
blanchet@49167
  1380
blanchet@49167
  1381
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
blanchet@49208
  1382
      (if lfp then "" else "co") ^ "datatype"));
blanchet@49112
  1383
  in
blanchet@49308
  1384
    timer; lthy'
blanchet@49112
  1385
  end;
blanchet@49112
  1386
blanchet@49536
  1387
val datatypes = define_datatypes (K I) (K I) (K I);
blanchet@49297
  1388
blanchet@51380
  1389
val datatype_cmd = define_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term;
blanchet@49119
  1390
blanchet@49112
  1391
val parse_ctr_arg =
blanchet@49329
  1392
  @{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} ||
traytel@49434
  1393
  (Parse.typ >> pair Binding.empty);
blanchet@49112
  1394
blanchet@49286
  1395
val parse_defaults =
blanchet@49286
  1396
  @{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"};
blanchet@49286
  1397
blanchet@51758
  1398
val parse_type_arg_constrained =
blanchet@51790
  1399
  Parse.type_ident -- Scan.option (@{keyword "::"} |-- Parse.!!! Parse.sort);
blanchet@51758
  1400
blanchet@51790
  1401
val parse_type_arg_named_constrained = parse_opt_binding_colon -- parse_type_arg_constrained;
blanchet@51758
  1402
blanchet@51758
  1403
val parse_type_args_named_constrained =
blanchet@51758
  1404
  parse_type_arg_constrained >> (single o pair Binding.empty) ||
blanchet@51758
  1405
  @{keyword "("} |-- Parse.!!! (Parse.list1 parse_type_arg_named_constrained --| @{keyword ")"}) ||
blanchet@51756
  1406
  Scan.succeed [];
blanchet@51756
  1407
blanchet@51790
  1408
val parse_map_rel_binding = Parse.short_ident --| @{keyword ":"} -- parse_binding;
blanchet@51767
  1409
blanchet@51767
  1410
val no_map_rel = (Binding.empty, Binding.empty);
blanchet@51767
  1411
blanchet@51767
  1412
(* "map" and "rel" are purposedly not registered as keywords, because they are short and nice names
blanchet@51767
  1413
   that we don't want them to be highlighted everywhere because of some obscure feature of the BNF
blanchet@51767
  1414
   package. *)
blanchet@51767
  1415
fun extract_map_rel ("map", b) = apfst (K b)
blanchet@51767
  1416
  | extract_map_rel ("rel", b) = apsnd (K b)
blanchet@51767
  1417
  | extract_map_rel (s, _) = error ("Expected \"map\" or \"rel\" instead of " ^ quote s);
blanchet@49112
  1418
blanchet@51767
  1419
val parse_map_rel_bindings =
blanchet@51767
  1420
  @{keyword "("} |-- Scan.repeat parse_map_rel_binding --| @{keyword ")"}
blanchet@51767
  1421
    >> (fn ps => fold extract_map_rel ps no_map_rel) ||
blanchet@51767
  1422
  Scan.succeed no_map_rel;
blanchet@51767
  1423
blanchet@51767
  1424
val parse_ctr_spec =
blanchet@51790
  1425
  parse_opt_binding_colon -- parse_binding -- Scan.repeat parse_ctr_arg --
blanchet@51767
  1426
  Scan.optional parse_defaults [] -- Parse.opt_mixfix;
blanchet@51767
  1427
blanchet@51767
  1428
val parse_spec =
blanchet@51790
  1429
  parse_type_args_named_constrained -- parse_binding -- parse_map_rel_bindings --
blanchet@51767
  1430
  Parse.opt_mixfix -- (@{keyword "="} |-- Parse.enum1 "|" parse_ctr_spec);
blanchet@51767
  1431
blanchet@51767
  1432
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_spec;
blanchet@49278
  1433
blanchet@49585
  1434
fun parse_datatype_cmd lfp construct_fp = parse_datatype >> datatype_cmd lfp construct_fp;
blanchet@49112
  1435
blanchet@49112
  1436
end;