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