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