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