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