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