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