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