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