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