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