src/HOL/Tools/BNF/bnf_fp_def_sugar.ML
author desharna
Wed Jul 16 10:13:00 2014 +0200 (2014-07-16)
changeset 57563 e3e7c86168b4
parent 57562 c1238062184b
child 57565 ab7f39114507
permissions -rw-r--r--
generate 'rel_sel' theorem for (co)datatypes
blanchet@55061
     1
(*  Title:      HOL/Tools/BNF/bnf_fp_def_sugar.ML
blanchet@49112
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@52349
     3
    Copyright   2012, 2013
blanchet@49112
     4
blanchet@49389
     5
Sugared datatype and codatatype constructions.
blanchet@49112
     6
*)
blanchet@49112
     7
blanchet@49636
     8
signature BNF_FP_DEF_SUGAR =
blanchet@49112
     9
sig
blanchet@56650
    10
  val fp_sugar_of: Proof.context -> string -> BNF_FP_Util.fp_sugar option
blanchet@56650
    11
  val fp_sugars_of: Proof.context -> BNF_FP_Util.fp_sugar list
blanchet@56650
    12
  val fp_sugar_interpretation: (BNF_FP_Util.fp_sugar list -> theory -> theory) -> theory -> theory
blanchet@56650
    13
  val register_fp_sugars: BNF_FP_Util.fp_sugar list -> local_theory -> local_theory
blanchet@51852
    14
traytel@53106
    15
  val co_induct_of: 'a list -> 'a
traytel@53106
    16
  val strong_co_induct_of: 'a list -> 'a
traytel@53106
    17
blanchet@52868
    18
  val flat_corec_preds_predsss_gettersss: 'a list -> 'a list list list -> 'a list list list ->
blanchet@52868
    19
    'a list
blanchet@57397
    20
  val nesting_bnfs: Proof.context -> typ list list list -> typ list -> BNF_Def.bnf list
blanchet@53746
    21
blanchet@53746
    22
  type lfp_sugar_thms =
blanchet@55856
    23
    (thm list * thm * Args.src list) * (thm list list * Args.src list)
blanchet@53746
    24
blanchet@54256
    25
  val morph_lfp_sugar_thms: morphism -> lfp_sugar_thms -> lfp_sugar_thms
blanchet@54256
    26
  val transfer_lfp_sugar_thms: Proof.context -> lfp_sugar_thms -> lfp_sugar_thms
blanchet@54256
    27
blanchet@53746
    28
  type gfp_sugar_thms =
blanchet@57260
    29
    ((thm list * thm) list * (Args.src list * Args.src list))
desharna@57489
    30
    * thm list list
desharna@57489
    31
    * thm list list
blanchet@55856
    32
    * (thm list list * Args.src list)
blanchet@55856
    33
    * (thm list list list * Args.src list)
blanchet@53746
    34
blanchet@54256
    35
  val morph_gfp_sugar_thms: morphism -> gfp_sugar_thms -> gfp_sugar_thms
blanchet@54256
    36
  val transfer_gfp_sugar_thms: Proof.context -> gfp_sugar_thms -> gfp_sugar_thms
blanchet@54256
    37
blanchet@55867
    38
  val mk_co_recs_prelims: BNF_Util.fp_kind -> typ list list list -> typ list -> typ list ->
blanchet@55867
    39
     typ list -> typ list -> int list -> int list list -> term list -> Proof.context ->
blanchet@55867
    40
     (term list
blanchet@55867
    41
      * (typ list list * typ list list list list * term list list * term list list list list) option
blanchet@55862
    42
      * (string * term list * term list list
blanchet@55867
    43
         * ((term list list * term list list list) * typ list)) option)
blanchet@55862
    44
     * Proof.context
blanchet@55772
    45
  val repair_nullary_single_ctr: typ list list -> typ list list
blanchet@55867
    46
  val mk_corec_p_pred_types: typ list -> int list -> typ list list
blanchet@55867
    47
  val mk_corec_fun_arg_types: typ list list list -> typ list -> typ list -> typ list -> int list ->
traytel@55803
    48
    int list list -> term ->
traytel@55803
    49
    typ list list
traytel@55803
    50
    * (typ list list list list * typ list list list * typ list list list list * typ list)
blanchet@55867
    51
  val define_rec:
blanchet@56641
    52
    typ list list * typ list list list list * term list list * term list list list list ->
blanchet@55862
    53
    (string -> binding) -> typ list -> typ list -> term list -> term -> Proof.context ->
blanchet@55864
    54
    (term * thm) * Proof.context
blanchet@55867
    55
  val define_corec: 'a * term list * term list list
blanchet@55862
    56
      * ((term list list * term list list list) * typ list) -> (string -> binding) -> 'b list ->
blanchet@56347
    57
    typ list -> term list -> term -> local_theory -> (term * thm) * local_theory
blanchet@55867
    58
  val derive_induct_recs_thms_for_types: BNF_Def.bnf list ->
blanchet@55867
    59
     ('a * typ list list list list * term list list * 'b) option -> thm -> thm list ->
blanchet@55862
    60
     BNF_Def.bnf list -> BNF_Def.bnf list -> typ list -> typ list -> typ list ->
blanchet@55862
    61
     typ list list list -> thm list -> thm list -> thm list -> term list list -> thm list list ->
blanchet@55864
    62
     term list -> thm list -> Proof.context -> lfp_sugar_thms
blanchet@55867
    63
  val derive_coinduct_corecs_thms_for_types: BNF_Def.bnf list ->
blanchet@55862
    64
    string * term list * term list list * ((term list list * term list list list) * typ list) ->
blanchet@55867
    65
    thm -> thm list -> thm list -> thm list -> BNF_Def.bnf list -> typ list -> typ list ->
traytel@55803
    66
    typ list -> typ list list list -> int list list -> int list list -> int list -> thm list ->
blanchet@55864
    67
    thm list -> (thm -> thm) -> thm list list -> Ctr_Sugar.ctr_sugar list -> term list ->
blanchet@56347
    68
    thm list -> (thm list -> thm list) -> Proof.context -> gfp_sugar_thms
blanchet@55469
    69
blanchet@55575
    70
  val co_datatypes: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
blanchet@52207
    71
      binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
traytel@55803
    72
      BNF_Def.bnf list -> BNF_Comp.absT_info list -> local_theory ->
traytel@55803
    73
      BNF_FP_Util.fp_result * local_theory) ->
blanchet@57200
    74
    (bool * bool)
blanchet@57206
    75
    * ((((((binding option * (typ * sort)) list * binding) * mixfix)
blanchet@57206
    76
         * ((binding, binding * typ) Ctr_Sugar.ctr_spec * mixfix) list) * (binding * binding))
blanchet@57206
    77
       * term list) list ->
blanchet@49297
    78
    local_theory -> local_theory
blanchet@55575
    79
  val parse_co_datatype_cmd: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
blanchet@51867
    80
      binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
traytel@55803
    81
      BNF_Def.bnf list -> BNF_Comp.absT_info list -> local_theory ->
traytel@55803
    82
      BNF_FP_Util.fp_result * local_theory) ->
blanchet@49308
    83
    (local_theory -> local_theory) parser
blanchet@49112
    84
end;
blanchet@49112
    85
blanchet@49636
    86
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR =
blanchet@49112
    87
struct
blanchet@49112
    88
blanchet@54006
    89
open Ctr_Sugar
blanchet@55571
    90
open BNF_FP_Rec_Sugar_Util
blanchet@49119
    91
open BNF_Util
blanchet@53222
    92
open BNF_Comp
blanchet@49214
    93
open BNF_Def
blanchet@51850
    94
open BNF_FP_Util
blanchet@49636
    95
open BNF_FP_Def_Sugar_Tactics
blanchet@56650
    96
open BNF_LFP_Size
blanchet@49119
    97
blanchet@51788
    98
val EqN = "Eq_";
desharna@57489
    99
desharna@57489
   100
val corec_codeN = "corec_code";
desharna@57046
   101
val disc_map_iffN = "disc_map_iff";
desharna@57046
   102
val sel_mapN = "sel_map";
desharna@57152
   103
val sel_setN = "sel_set";
desharna@56956
   104
val set_emptyN = "set_empty";
blanchet@51777
   105
blanchet@51823
   106
structure Data = Generic_Data
blanchet@51823
   107
(
blanchet@51840
   108
  type T = fp_sugar Symtab.table;
blanchet@51823
   109
  val empty = Symtab.empty;
blanchet@51823
   110
  val extend = I;
blanchet@55394
   111
  fun merge data : T = Symtab.merge (K true) data;
blanchet@51823
   112
);
blanchet@51823
   113
desharna@57563
   114
fun choose_relator Rs AB = find_first (fastype_of #> binder_types #> (fn [A, B] => AB = (A, B))) Rs;
desharna@57563
   115
fun build_the_rel ctxt Rs Ts A B = build_rel ctxt Ts (the o choose_relator Rs) (A, B);
desharna@57563
   116
fun build_rel_app ctxt Rs Ts a b = build_the_rel ctxt Rs Ts (fastype_of a) (fastype_of b) $ a $ b;
desharna@57525
   117
traytel@53126
   118
fun fp_sugar_of ctxt =
traytel@53126
   119
  Symtab.lookup (Data.get (Context.Proof ctxt))
blanchet@53907
   120
  #> Option.map (transfer_fp_sugar ctxt);
blanchet@53907
   121
blanchet@53907
   122
fun fp_sugars_of ctxt =
blanchet@53907
   123
  Symtab.fold (cons o transfer_fp_sugar ctxt o snd) (Data.get (Context.Proof ctxt)) [];
blanchet@51823
   124
traytel@53106
   125
fun co_induct_of (i :: _) = i;
traytel@53106
   126
fun strong_co_induct_of [_, s] = s;
traytel@53106
   127
blanchet@56347
   128
structure FP_Sugar_Interpretation = Interpretation
blanchet@56347
   129
(
blanchet@56637
   130
  type T = fp_sugar list;
blanchet@56637
   131
  val eq: T * T -> bool = op = o pairself (map #T);
blanchet@56347
   132
);
blanchet@56347
   133
blanchet@56648
   134
fun with_repaired_path f (fp_sugars as ({T = Type (s, _), ...} : fp_sugar) :: _) thy =
blanchet@56376
   135
  thy
blanchet@56767
   136
  |> Sign.root_path
blanchet@56767
   137
  |> Sign.add_path (Long_Name.qualifier s)
blanchet@56637
   138
  |> f fp_sugars
blanchet@56767
   139
  |> Sign.restore_naming thy;
blanchet@56376
   140
blanchet@56657
   141
fun fp_sugar_interpretation f = FP_Sugar_Interpretation.interpretation (with_repaired_path f);
blanchet@56347
   142
blanchet@56650
   143
fun register_fp_sugars (fp_sugars as {fp, ...} :: _) =
blanchet@56648
   144
  fold (fn fp_sugar as {T = Type (s, _), ...} =>
blanchet@56637
   145
      Local_Theory.declaration {syntax = false, pervasive = true}
blanchet@56637
   146
        (fn phi => Data.map (Symtab.update (s, morph_fp_sugar phi fp_sugar))))
blanchet@56637
   147
    fp_sugars
blanchet@56651
   148
  #> fp = Least_FP ? generate_lfp_size fp_sugars
blanchet@56637
   149
  #> Local_Theory.background_theory (FP_Sugar_Interpretation.data fp_sugars);
blanchet@51823
   150
blanchet@57397
   151
fun register_as_fp_sugars Ts BTs Xs fp pre_bnfs absT_infos fp_nesting_bnfs live_nesting_bnfs fp_res
blanchet@56648
   152
    ctrXs_Tsss ctr_defss ctr_sugars co_recs co_rec_defs mapss common_co_inducts co_inductss
blanchet@56648
   153
    co_rec_thmss disc_co_recss sel_co_recsss rel_injectss rel_distinctss =
blanchet@56637
   154
  let
blanchet@56637
   155
    val fp_sugars =
blanchet@56637
   156
      map_index (fn (kk, T) =>
blanchet@56648
   157
        {T = T, BT = nth BTs kk, X = nth Xs kk, fp = fp, fp_res = fp_res, fp_res_index = kk,
blanchet@57397
   158
         pre_bnf = nth pre_bnfs kk, absT_info = nth absT_infos kk,
blanchet@57397
   159
         fp_nesting_bnfs = fp_nesting_bnfs, live_nesting_bnfs = live_nesting_bnfs,
blanchet@57397
   160
         ctrXs_Tss = nth ctrXs_Tsss kk, ctr_defs = nth ctr_defss kk, ctr_sugar = nth ctr_sugars kk,
blanchet@57397
   161
         co_rec = nth co_recs kk, co_rec_def = nth co_rec_defs kk, maps = nth mapss kk,
blanchet@57397
   162
         common_co_inducts = common_co_inducts, co_inducts = nth co_inductss kk,
blanchet@57397
   163
         co_rec_thms = nth co_rec_thmss kk, disc_co_recs = nth disc_co_recss kk,
blanchet@57397
   164
         sel_co_recss = nth sel_co_recsss kk, rel_injects = nth rel_injectss kk,
blanchet@57397
   165
         rel_distincts = nth rel_distinctss kk}) Ts
blanchet@56637
   166
  in
blanchet@56637
   167
    register_fp_sugars fp_sugars
blanchet@56637
   168
  end;
blanchet@51824
   169
blanchet@55342
   170
(* This function could produce (fairly harmless) clashes in contrived examples (e.g., "x.A",
blanchet@55342
   171
   "x.x_A", "y.A"). *)
blanchet@49622
   172
fun quasi_unambiguous_case_names names =
blanchet@49622
   173
  let
blanchet@49622
   174
    val ps = map (`Long_Name.base_name) names;
blanchet@49622
   175
    val dups = Library.duplicates (op =) (map fst ps);
blanchet@49622
   176
    fun underscore s =
blanchet@49622
   177
      let val ss = space_explode Long_Name.separator s in
blanchet@49622
   178
        space_implode "_" (drop (length ss - 2) ss)
blanchet@49622
   179
      end;
blanchet@49622
   180
  in
blanchet@49622
   181
    map (fn (base, full) => if member (op =) dups base then underscore full else base) ps
blanchet@49622
   182
  end;
blanchet@49622
   183
blanchet@49591
   184
val mp_conj = @{thm mp_conj};
blanchet@49591
   185
blanchet@55397
   186
val fundefcong_attrs = @{attributes [fundef_cong]};
blanchet@54145
   187
val nitpicksimp_attrs = @{attributes [nitpick_simp]};
blanchet@54145
   188
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs;
blanchet@49300
   189
val simp_attrs = @{attributes [simp]};
blanchet@49300
   190
blanchet@49297
   191
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
blanchet@49202
   192
blanchet@55871
   193
fun flat_corec_predss_getterss qss gss = maps (op @) (qss ~~ gss);
blanchet@51829
   194
blanchet@55871
   195
fun flat_corec_preds_predsss_gettersss [] [qss] [gss] = flat_corec_predss_getterss qss gss
blanchet@55871
   196
  | flat_corec_preds_predsss_gettersss (p :: ps) (qss :: qsss) (gss :: gsss) =
blanchet@55871
   197
    p :: flat_corec_predss_getterss qss gss @ flat_corec_preds_predsss_gettersss ps qsss gsss;
blanchet@51829
   198
blanchet@49585
   199
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) =
blanchet@49585
   200
  Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1));
blanchet@49585
   201
blanchet@49585
   202
fun flip_rels lthy n thm =
blanchet@49585
   203
  let
blanchet@49585
   204
    val Rs = Term.add_vars (prop_of thm) [];
blanchet@49585
   205
    val Rs' = rev (drop (length Rs - n) Rs);
blanchet@49585
   206
    val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs';
blanchet@49585
   207
  in
blanchet@49585
   208
    Drule.cterm_instantiate cRs thm
blanchet@49585
   209
  end;
blanchet@49585
   210
blanchet@49536
   211
fun mk_ctor_or_dtor get_T Ts t =
blanchet@49536
   212
  let val Type (_, Ts0) = get_T (fastype_of t) in
blanchet@49536
   213
    Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49536
   214
  end;
blanchet@49536
   215
blanchet@49536
   216
val mk_ctor = mk_ctor_or_dtor range_type;
blanchet@49536
   217
val mk_dtor = mk_ctor_or_dtor domain_type;
blanchet@49536
   218
blanchet@55867
   219
fun mk_xtor_co_recs thy fp fpTs Cs ts0 =
blanchet@51911
   220
  let
blanchet@51911
   221
    val nn = length fpTs;
blanchet@51911
   222
    val (fpTs0, Cs0) =
blanchet@52207
   223
      map ((fp = Greatest_FP ? swap) o dest_funT o snd o strip_typeN nn o fastype_of) ts0
blanchet@51911
   224
      |> split_list;
blanchet@51911
   225
    val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs);
blanchet@51911
   226
  in
blanchet@52170
   227
    map (Term.subst_TVars rho) ts0
blanchet@51911
   228
  end;
blanchet@51827
   229
blanchet@55575
   230
fun unzip_recT (Type (@{type_name prod}, _)) T = [T]
blanchet@55575
   231
  | unzip_recT _ (Type (@{type_name prod}, Ts)) = Ts
blanchet@55575
   232
  | unzip_recT _ T = [T];
blanchet@55575
   233
blanchet@53591
   234
fun unzip_corecT (Type (@{type_name sum}, _)) T = [T]
blanchet@53901
   235
  | unzip_corecT _ (Type (@{type_name sum}, Ts)) = Ts
blanchet@52871
   236
  | unzip_corecT _ T = [T];
blanchet@52871
   237
blanchet@52347
   238
fun liveness_of_fp_bnf n bnf =
blanchet@52347
   239
  (case T_of_bnf bnf of
blanchet@52347
   240
    Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts
blanchet@52347
   241
  | _ => replicate n false);
blanchet@52347
   242
blanchet@55700
   243
fun cannot_merge_types fp =
blanchet@55700
   244
  error ("Mutually " ^ co_prefix fp ^ "recursive types must have the same type parameters");
blanchet@52347
   245
blanchet@55700
   246
fun merge_type_arg fp T T' = if T = T' then T else cannot_merge_types fp;
blanchet@52347
   247
blanchet@55700
   248
fun merge_type_args fp (As, As') =
blanchet@55700
   249
  if length As = length As' then map2 (merge_type_arg fp) As As' else cannot_merge_types fp;
blanchet@52347
   250
blanchet@57200
   251
fun type_args_named_constrained_of_spec (((((ncAs, _), _), _), _), _) = ncAs;
blanchet@57200
   252
fun type_binding_of_spec (((((_, b), _), _), _), _) = b;
blanchet@57206
   253
fun mixfix_of_spec ((((_, mx), _), _), _) = mx;
blanchet@57206
   254
fun mixfixed_ctr_specs_of_spec (((_, mx_ctr_specs), _), _) = mx_ctr_specs;
blanchet@57206
   255
fun map_binding_of_spec ((_, (b, _)), _) = b;
blanchet@57206
   256
fun rel_binding_of_spec ((_, (_, b)), _) = b;
blanchet@57200
   257
fun sel_default_eqs_of_spec (_, ts) = ts;
blanchet@52347
   258
blanchet@57397
   259
fun add_nesting_bnf_names Us =
blanchet@52347
   260
  let
blanchet@52347
   261
    fun add (Type (s, Ts)) ss =
blanchet@52347
   262
        let val (needs, ss') = fold_map add Ts ss in
blanchet@52347
   263
          if exists I needs then (true, insert (op =) s ss') else (false, ss')
blanchet@52347
   264
        end
blanchet@52347
   265
      | add T ss = (member (op =) Us T, ss);
blanchet@52347
   266
  in snd oo add end;
blanchet@52347
   267
blanchet@57397
   268
fun nesting_bnfs ctxt ctr_Tsss Us =
blanchet@57397
   269
  map_filter (bnf_of ctxt) (fold (fold (fold (add_nesting_bnf_names Us))) ctr_Tsss []);
blanchet@52347
   270
blanchet@54237
   271
fun indexify proj xs f p = f (find_index (curry (op =) (proj p)) xs) p;
blanchet@52347
   272
blanchet@53746
   273
type lfp_sugar_thms =
blanchet@55856
   274
  (thm list * thm * Args.src list) * (thm list list * Args.src list);
blanchet@53746
   275
blanchet@55867
   276
fun morph_lfp_sugar_thms phi ((inducts, induct, induct_attrs), (recss, rec_attrs)) =
blanchet@54256
   277
  ((map (Morphism.thm phi) inducts, Morphism.thm phi induct, induct_attrs),
blanchet@55867
   278
   (map (map (Morphism.thm phi)) recss, rec_attrs))
blanchet@55095
   279
  : lfp_sugar_thms;
blanchet@54256
   280
blanchet@54256
   281
val transfer_lfp_sugar_thms =
wenzelm@54740
   282
  morph_lfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of;
blanchet@54256
   283
blanchet@53746
   284
type gfp_sugar_thms =
blanchet@57260
   285
  ((thm list * thm) list * (Args.src list * Args.src list))
desharna@57489
   286
  * thm list list
desharna@57489
   287
  * thm list list
blanchet@55856
   288
  * (thm list list * Args.src list)
blanchet@55856
   289
  * (thm list list list * Args.src list);
blanchet@53746
   290
blanchet@57260
   291
fun morph_gfp_sugar_thms phi ((coinducts_pairs, coinduct_attrs_pair),
desharna@57489
   292
    corecss, disc_corecss, (disc_corec_iffss, disc_corec_iff_attrs),
desharna@57489
   293
    (sel_corecsss, sel_corec_attrs)) =
blanchet@54256
   294
  ((map (apfst (map (Morphism.thm phi)) o apsnd (Morphism.thm phi)) coinducts_pairs,
blanchet@57260
   295
    coinduct_attrs_pair),
desharna@57489
   296
   map (map (Morphism.thm phi)) corecss,
desharna@57489
   297
   map (map (Morphism.thm phi)) disc_corecss,
blanchet@55871
   298
   (map (map (Morphism.thm phi)) disc_corec_iffss, disc_corec_iff_attrs),
blanchet@55871
   299
   (map (map (map (Morphism.thm phi))) sel_corecsss, sel_corec_attrs)) : gfp_sugar_thms;
blanchet@54256
   300
blanchet@54256
   301
val transfer_gfp_sugar_thms =
wenzelm@54740
   302
  morph_gfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of;
blanchet@54256
   303
blanchet@55867
   304
fun mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss ctor_rec_fun_Ts lthy =
blanchet@51832
   305
  let
blanchet@52214
   306
    val Css = map2 replicate ns Cs;
blanchet@55869
   307
    val x_Tssss =
blanchet@55867
   308
      map6 (fn absT => fn repT => fn n => fn ms => fn ctr_Tss => fn ctor_rec_fun_T =>
traytel@55803
   309
          map2 (map2 unzip_recT)
blanchet@55867
   310
            ctr_Tss (dest_absumprodT absT repT n ms (domain_type ctor_rec_fun_T)))
blanchet@55867
   311
        absTs repTs ns mss ctr_Tsss ctor_rec_fun_Ts;
blanchet@51832
   312
blanchet@55869
   313
    val x_Tsss' = map (map flat_rec_arg_args) x_Tssss;
blanchet@55869
   314
    val f_Tss = map2 (map2 (curry (op --->))) x_Tsss' Css;
blanchet@51832
   315
blanchet@55869
   316
    val ((fss, xssss), lthy) =
blanchet@52214
   317
      lthy
blanchet@55869
   318
      |> mk_Freess "f" f_Tss
blanchet@55869
   319
      ||>> mk_Freessss "x" x_Tssss;
blanchet@51832
   320
  in
blanchet@55869
   321
    ((f_Tss, x_Tssss, fss, xssss), lthy)
blanchet@51832
   322
  end;
blanchet@51832
   323
blanchet@55867
   324
(*avoid "'a itself" arguments in corecursors*)
blanchet@55966
   325
fun repair_nullary_single_ctr [[]] = [[HOLogic.unitT]]
blanchet@55772
   326
  | repair_nullary_single_ctr Tss = Tss;
blanchet@55772
   327
blanchet@55867
   328
fun mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss fun_Ts =
blanchet@51829
   329
  let
blanchet@55772
   330
    val ctr_Tsss' = map repair_nullary_single_ctr ctr_Tsss;
blanchet@55869
   331
    val g_absTs = map range_type fun_Ts;
blanchet@55869
   332
    val g_Tsss = map repair_nullary_single_ctr (map5 dest_absumprodT absTs repTs ns mss g_absTs);
blanchet@55869
   333
    val g_Tssss = map3 (fn C => map2 (map2 (map (curry (op -->) C) oo unzip_corecT)))
blanchet@55869
   334
      Cs ctr_Tsss' g_Tsss;
blanchet@55869
   335
    val q_Tssss = map (map (map (fn [_] => [] | [_, T] => [mk_pred1T (domain_type T)]))) g_Tssss;
blanchet@52870
   336
  in
blanchet@55869
   337
    (q_Tssss, g_Tsss, g_Tssss, g_absTs)
blanchet@52870
   338
  end;
blanchet@51829
   339
blanchet@55867
   340
fun mk_corec_p_pred_types Cs ns = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs;
blanchet@52898
   341
blanchet@55867
   342
fun mk_corec_fun_arg_types ctr_Tsss Cs absTs repTs ns mss dtor_corec =
blanchet@55867
   343
  (mk_corec_p_pred_types Cs ns,
blanchet@55867
   344
   mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss
blanchet@55867
   345
     (binder_fun_types (fastype_of dtor_corec)));
blanchet@51829
   346
blanchet@55867
   347
fun mk_corecs_args_types ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts lthy =
blanchet@55867
   348
  let
blanchet@55867
   349
    val p_Tss = mk_corec_p_pred_types Cs ns;
blanchet@51829
   350
blanchet@55869
   351
    val (q_Tssss, g_Tsss, g_Tssss, corec_types) =
blanchet@55867
   352
      mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts;
blanchet@51831
   353
blanchet@55869
   354
    val (((((Free (x, _), cs), pss), qssss), gssss), lthy) =
blanchet@51829
   355
      lthy
blanchet@55869
   356
      |> yield_singleton (mk_Frees "x") dummyT
blanchet@52347
   357
      ||>> mk_Frees "a" Cs
blanchet@51829
   358
      ||>> mk_Freess "p" p_Tss
blanchet@55869
   359
      ||>> mk_Freessss "q" q_Tssss
blanchet@55869
   360
      ||>> mk_Freessss "g" g_Tssss;
blanchet@51831
   361
blanchet@51831
   362
    val cpss = map2 (map o rapp) cs pss;
blanchet@51829
   363
desharna@57303
   364
    fun build_sum_inj mk_inj = build_map lthy [] (uncurry mk_inj o dest_sumT o snd);
blanchet@52347
   365
blanchet@55871
   366
    fun build_dtor_corec_arg _ [] [cg] = cg
blanchet@55871
   367
      | build_dtor_corec_arg T [cq] [cg, cg'] =
blanchet@55871
   368
        mk_If cq (build_sum_inj Inl_const (fastype_of cg, T) $ cg)
blanchet@55871
   369
          (build_sum_inj Inr_const (fastype_of cg', T) $ cg');
blanchet@52347
   370
blanchet@55869
   371
    val pgss = map3 flat_corec_preds_predsss_gettersss pss qssss gssss;
blanchet@55869
   372
    val cqssss = map2 (map o map o map o rapp) cs qssss;
blanchet@55869
   373
    val cgssss = map2 (map o map o map o rapp) cs gssss;
blanchet@55869
   374
    val cqgsss = map3 (map3 (map3 build_dtor_corec_arg)) g_Tsss cqssss cgssss;
blanchet@51831
   375
  in
blanchet@55869
   376
    ((x, cs, cpss, ((pgss, cqgsss), corec_types)), lthy)
blanchet@51831
   377
  end;
blanchet@51829
   378
blanchet@55867
   379
fun mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy =
blanchet@51903
   380
  let
blanchet@52169
   381
    val thy = Proof_Context.theory_of lthy;
blanchet@52169
   382
blanchet@55867
   383
    val (xtor_co_rec_fun_Ts, xtor_co_recs) =
blanchet@55867
   384
      mk_xtor_co_recs thy fp fpTs Cs xtor_co_recs0 |> `(binder_fun_types o fastype_of o hd);
blanchet@51903
   385
blanchet@55867
   386
    val ((recs_args_types, corecs_args_types), lthy') =
blanchet@52207
   387
      if fp = Least_FP then
blanchet@56641
   388
        mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_rec_fun_Ts lthy
blanchet@56641
   389
        |>> (rpair NONE o SOME)
blanchet@51903
   390
      else
blanchet@55867
   391
        mk_corecs_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_rec_fun_Ts lthy
traytel@55803
   392
        |>> (pair NONE o SOME);
blanchet@51903
   393
  in
blanchet@55867
   394
    ((xtor_co_recs, recs_args_types, corecs_args_types), lthy')
blanchet@51903
   395
  end;
blanchet@51903
   396
blanchet@55869
   397
fun mk_preds_getterss_join c cps absT abs cqgss =
traytel@55803
   398
  let
blanchet@55869
   399
    val n = length cqgss;
blanchet@55869
   400
    val ts = map2 (mk_absumprod absT abs n) (1 upto n) cqgss;
traytel@55803
   401
  in
traytel@55803
   402
    Term.lambda c (mk_IfN absT cps ts)
blanchet@51900
   403
  end;
blanchet@51886
   404
blanchet@55867
   405
fun define_co_rec fp fpT Cs b rhs lthy0 =
blanchet@51897
   406
  let
blanchet@52170
   407
    val thy = Proof_Context.theory_of lthy0;
blanchet@52170
   408
traytel@53569
   409
    val maybe_conceal_def_binding = Thm.def_binding
traytel@53569
   410
      #> Config.get lthy0 bnf_note_all = false ? Binding.conceal;
traytel@53569
   411
blanchet@55864
   412
    val ((cst, (_, def)), (lthy', lthy)) = lthy0
blanchet@55864
   413
      |> Local_Theory.define ((b, NoSyn), ((maybe_conceal_def_binding b, []), rhs))
blanchet@52327
   414
      ||> `Local_Theory.restore;
blanchet@52327
   415
blanchet@52327
   416
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet@52327
   417
blanchet@55869
   418
    val cst' = mk_co_rec thy fp fpT Cs (Morphism.term phi cst);
blanchet@55864
   419
    val def' = Morphism.thm phi def;
blanchet@52327
   420
  in
blanchet@55864
   421
    ((cst', def'), lthy')
blanchet@52327
   422
  end;
blanchet@52327
   423
blanchet@56641
   424
fun define_rec (_, _, fss, xssss) mk_binding fpTs Cs reps ctor_rec =
blanchet@56641
   425
  let
blanchet@56641
   426
    val nn = length fpTs;
blanchet@56641
   427
    val (ctor_rec_absTs, fpT) = strip_typeN nn (fastype_of ctor_rec)
blanchet@56641
   428
      |>> map domain_type ||> domain_type;
blanchet@56641
   429
  in
blanchet@56641
   430
    define_co_rec Least_FP fpT Cs (mk_binding recN)
blanchet@56641
   431
      (fold_rev (fold_rev Term.lambda) fss (Term.list_comb (ctor_rec,
blanchet@56641
   432
         map4 (fn ctor_rec_absT => fn rep => fn fs => fn xsss =>
blanchet@56641
   433
             mk_case_absumprod ctor_rec_absT rep fs (map (map HOLogic.mk_tuple) xsss)
blanchet@56641
   434
               (map flat_rec_arg_args xsss))
blanchet@56641
   435
           ctor_rec_absTs reps fss xssss)))
blanchet@56641
   436
  end;
blanchet@51897
   437
blanchet@55869
   438
fun define_corec (_, cs, cpss, ((pgss, cqgsss), f_absTs)) mk_binding fpTs Cs abss dtor_corec =
blanchet@51897
   439
  let
blanchet@51899
   440
    val nn = length fpTs;
blanchet@55867
   441
    val fpT = range_type (snd (strip_typeN nn (fastype_of dtor_corec)));
blanchet@51897
   442
  in
blanchet@55867
   443
    define_co_rec Greatest_FP fpT Cs (mk_binding corecN)
blanchet@55869
   444
      (fold_rev (fold_rev Term.lambda) pgss (Term.list_comb (dtor_corec,
blanchet@55869
   445
         map5 mk_preds_getterss_join cs cpss f_absTs abss cqgsss)))
blanchet@52320
   446
  end;
blanchet@51897
   447
desharna@57471
   448
fun postproc_co_induct lthy nn prop prop_conj =
desharna@57471
   449
  Drule.zero_var_indexes
desharna@57471
   450
  #> `(conj_dests nn)
desharna@57471
   451
  #>> map (fn thm => Thm.permute_prems 0 (~1) (thm RS prop))
desharna@57471
   452
  ##> (fn thm => Thm.permute_prems 0 (~nn)
desharna@57471
   453
    (if nn = 1 then thm RS prop
desharna@57471
   454
     else funpow nn (fn thm => Local_Defs.unfold lthy @{thms conj_assoc} (thm RS prop_conj)) thm));
desharna@57471
   455
desharna@57471
   456
fun mk_induct_attrs ctrss =
desharna@57471
   457
  let
desharna@57471
   458
    val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss);
desharna@57471
   459
    val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases));
desharna@57471
   460
  in
desharna@57471
   461
    [induct_case_names_attr]
desharna@57471
   462
  end;
desharna@57471
   463
blanchet@57535
   464
fun derive_rel_induct_thms_for_types lthy fpA_Ts As Bs ctrAss ctrAs_Tsss exhausts ctor_rel_induct
blanchet@57535
   465
    ctor_defss ctor_injects pre_rel_defs abs_inverses live_nesting_rel_eqs =
desharna@57471
   466
  let
desharna@57471
   467
    val B_ify = typ_subst_nonatomic (As ~~ Bs)
desharna@57471
   468
    val fpB_Ts = map B_ify fpA_Ts;
desharna@57471
   469
    val ctrBs_Tsss = map (map (map B_ify)) ctrAs_Tsss;
desharna@57471
   470
    val ctrBss = map (map (subst_nonatomic_types (As ~~ Bs))) ctrAss;
desharna@57471
   471
desharna@57471
   472
    val ((((Rs, IRs), ctrAsss), ctrBsss), names_lthy) = lthy
desharna@57471
   473
      |> mk_Frees "R" (map2 mk_pred2T As Bs)
desharna@57471
   474
      ||>> mk_Frees "IR" (map2 mk_pred2T fpA_Ts fpB_Ts)
desharna@57471
   475
      ||>> mk_Freesss "a" ctrAs_Tsss
desharna@57471
   476
      ||>> mk_Freesss "b" ctrBs_Tsss;
desharna@57471
   477
desharna@57471
   478
    val premises =
desharna@57471
   479
      let
desharna@57525
   480
        fun build_the_rel A B = build_rel lthy fpA_Ts (the o choose_relator (Rs @ IRs)) (A, B);
desharna@57471
   481
        fun build_rel_app a b = build_the_rel (fastype_of a) (fastype_of b) $ a $ b;
desharna@57471
   482
desharna@57471
   483
        fun mk_prem ctrA ctrB argAs argBs =
desharna@57471
   484
          fold_rev Logic.all (argAs @ argBs) (fold_rev (curry Logic.mk_implies)
desharna@57471
   485
            (map2 (HOLogic.mk_Trueprop oo build_rel_app) argAs argBs)
desharna@57471
   486
            (HOLogic.mk_Trueprop
desharna@57471
   487
              (build_rel_app (Term.list_comb (ctrA, argAs)) (Term.list_comb (ctrB, argBs)))));
desharna@57471
   488
      in
desharna@57471
   489
        flat (map4 (map4 mk_prem) ctrAss ctrBss ctrAsss ctrBsss)
desharna@57471
   490
      end;
desharna@57471
   491
desharna@57525
   492
    val goal = HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 mk_leq
desharna@57525
   493
      (map (build_rel lthy [] (the o choose_relator (Rs @ IRs))) (fpA_Ts ~~ fpB_Ts)) IRs));
desharna@57471
   494
desharna@57471
   495
    val rel_induct0_thm = Goal.prove_sorry lthy [] premises goal
desharna@57471
   496
      (fn {context = ctxt, prems = prems} =>
blanchet@57535
   497
          mk_rel_induct0_tac ctxt ctor_rel_induct prems (map (certify ctxt) IRs) exhausts ctor_defss
blanchet@57535
   498
            ctor_injects pre_rel_defs abs_inverses live_nesting_rel_eqs)
desharna@57471
   499
      |> singleton (Proof_Context.export names_lthy lthy)
desharna@57471
   500
      |> Thm.close_derivation;
desharna@57471
   501
  in
desharna@57471
   502
    (postproc_co_induct lthy (length fpA_Ts) @{thm predicate2D} @{thm predicate2D_conj}
desharna@57471
   503
       rel_induct0_thm,
desharna@57471
   504
     mk_induct_attrs ctrAss)
desharna@57471
   505
  end;
desharna@57471
   506
blanchet@55867
   507
fun derive_induct_recs_thms_for_types pre_bnfs rec_args_typess ctor_induct ctor_rec_thms
blanchet@57397
   508
    live_nesting_bnfs fp_nesting_bnfs fpTs Cs Xs ctrXs_Tsss fp_abs_inverses fp_type_definitions
blanchet@57397
   509
    abs_inverses ctrss ctr_defss recs rec_defs lthy =
blanchet@51808
   510
  let
blanchet@51827
   511
    val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss;
blanchet@51827
   512
blanchet@51815
   513
    val nn = length pre_bnfs;
blanchet@51827
   514
    val ns = map length ctr_Tsss;
blanchet@51827
   515
    val mss = map (map length) ctr_Tsss;
blanchet@51815
   516
blanchet@51808
   517
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@51808
   518
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
blanchet@57399
   519
    val live_nesting_map_ident0s = map map_ident0_of_bnf live_nesting_bnfs;
blanchet@57399
   520
    val fp_nesting_map_ident0s = map map_ident0_of_bnf fp_nesting_bnfs;
blanchet@57397
   521
    val fp_nesting_set_maps = maps set_map_of_bnf fp_nesting_bnfs;
blanchet@51808
   522
blanchet@51816
   523
    val fp_b_names = map base_name_of_typ fpTs;
blanchet@51811
   524
blanchet@51832
   525
    val ((((ps, ps'), xsss), us'), names_lthy) =
blanchet@52315
   526
      lthy
blanchet@51808
   527
      |> mk_Frees' "P" (map mk_pred1T fpTs)
blanchet@51827
   528
      ||>> mk_Freesss "x" ctr_Tsss
blanchet@51816
   529
      ||>> Variable.variant_fixes fp_b_names;
blanchet@51808
   530
blanchet@51808
   531
    val us = map2 (curry Free) us' fpTs;
blanchet@51808
   532
blanchet@51808
   533
    fun mk_sets_nested bnf =
blanchet@51808
   534
      let
blanchet@51808
   535
        val Type (T_name, Us) = T_of_bnf bnf;
blanchet@51808
   536
        val lives = lives_of_bnf bnf;
blanchet@51808
   537
        val sets = sets_of_bnf bnf;
blanchet@51808
   538
        fun mk_set U =
blanchet@54237
   539
          (case find_index (curry (op =) U) lives of
blanchet@51808
   540
            ~1 => Term.dummy
blanchet@51808
   541
          | i => nth sets i);
blanchet@51808
   542
      in
blanchet@51808
   543
        (T_name, map mk_set Us)
blanchet@51808
   544
      end;
blanchet@51808
   545
blanchet@57397
   546
    val setss_nested = map mk_sets_nested fp_nesting_bnfs;
blanchet@51808
   547
blanchet@51808
   548
    val (induct_thms, induct_thm) =
blanchet@51808
   549
      let
blanchet@51808
   550
        fun mk_set Ts t =
blanchet@51808
   551
          let val Type (_, Ts0) = domain_type (fastype_of t) in
blanchet@51808
   552
            Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@51808
   553
          end;
blanchet@51808
   554
blanchet@52310
   555
        fun mk_raw_prem_prems _ (x as Free (_, Type _)) (X as TFree _) =
blanchet@54237
   556
            [([], (find_index (curry (op =) X) Xs + 1, x))]
blanchet@52310
   557
          | mk_raw_prem_prems names_lthy (x as Free (s, Type (T_name, Ts0))) (Type (_, Xs_Ts0)) =
blanchet@52310
   558
            (case AList.lookup (op =) setss_nested T_name of
blanchet@52310
   559
              NONE => []
blanchet@52310
   560
            | SOME raw_sets0 =>
blanchet@52310
   561
              let
blanchet@52310
   562
                val (Xs_Ts, (Ts, raw_sets)) =
blanchet@52310
   563
                  filter (exists_subtype_in Xs o fst) (Xs_Ts0 ~~ (Ts0 ~~ raw_sets0))
blanchet@52310
   564
                  |> split_list ||> split_list;
blanchet@52310
   565
                val sets = map (mk_set Ts0) raw_sets;
blanchet@52310
   566
                val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
blanchet@52310
   567
                val xysets = map (pair x) (ys ~~ sets);
blanchet@52310
   568
                val ppremss = map2 (mk_raw_prem_prems names_lthy') ys Xs_Ts;
blanchet@52310
   569
              in
blanchet@52310
   570
                flat (map2 (map o apfst o cons) xysets ppremss)
blanchet@52310
   571
              end)
blanchet@52310
   572
          | mk_raw_prem_prems _ _ _ = [];
blanchet@51808
   573
blanchet@51808
   574
        fun close_prem_prem xs t =
blanchet@51808
   575
          fold_rev Logic.all (map Free (drop (nn + length xs)
blanchet@51808
   576
            (rev (Term.add_frees t (map dest_Free xs @ ps'))))) t;
blanchet@51808
   577
blanchet@51808
   578
        fun mk_prem_prem xs (xysets, (j, x)) =
blanchet@51808
   579
          close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) =>
blanchet@51808
   580
              HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets,
blanchet@51808
   581
            HOLogic.mk_Trueprop (nth ps (j - 1) $ x)));
blanchet@51808
   582
blanchet@52310
   583
        fun mk_raw_prem phi ctr ctr_Ts ctrXs_Ts =
blanchet@51808
   584
          let
blanchet@51808
   585
            val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
blanchet@52310
   586
            val pprems = flat (map2 (mk_raw_prem_prems names_lthy') xs ctrXs_Ts);
blanchet@51808
   587
          in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end;
blanchet@51808
   588
blanchet@51808
   589
        fun mk_prem (xs, raw_pprems, concl) =
blanchet@51808
   590
          fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl));
blanchet@51808
   591
blanchet@52310
   592
        val raw_premss = map4 (map3 o mk_raw_prem) ps ctrss ctr_Tsss ctrXs_Tsss;
blanchet@51808
   593
blanchet@51808
   594
        val goal =
blanchet@51808
   595
          Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss,
blanchet@54237
   596
            HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us)));
blanchet@51808
   597
blanchet@51808
   598
        val kksss = map (map (map (fst o snd) o #2)) raw_premss;
blanchet@51808
   599
traytel@55803
   600
        val ctor_induct' = ctor_induct OF (map2 mk_absumprodE fp_type_definitions mss);
blanchet@51808
   601
blanchet@51808
   602
        val thm =
blanchet@51808
   603
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
traytel@55803
   604
            mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' fp_abs_inverses
blanchet@57397
   605
              abs_inverses fp_nesting_set_maps pre_set_defss)
blanchet@51808
   606
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@55409
   607
          (* for "datatype_realizer.ML": *)
blanchet@55409
   608
          |> Thm.name_derivation (fst (dest_Type (hd fpTs)) ^ Long_Name.separator ^
blanchet@55409
   609
            (if nn > 1 then space_implode "_" (tl fp_b_names) ^ Long_Name.separator else "") ^
blanchet@55409
   610
            inductN);
blanchet@51808
   611
      in
blanchet@51808
   612
        `(conj_dests nn) thm
blanchet@51808
   613
      end;
blanchet@51808
   614
blanchet@52305
   615
    val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
blanchet@52305
   616
blanchet@55867
   617
    fun mk_rec_thmss (_, x_Tssss, fss, _) recs rec_defs ctor_rec_thms =
blanchet@51808
   618
      let
blanchet@55867
   619
        val frecs = map (lists_bmoc fss) recs;
blanchet@51808
   620
blanchet@55871
   621
        fun mk_goal frec xctr f xs fxs =
blanchet@51808
   622
          fold_rev (fold_rev Logic.all) (xs :: fss)
blanchet@55867
   623
            (mk_Trueprop_eq (frec $ xctr, Term.list_comb (f, fxs)));
blanchet@51808
   624
blanchet@52302
   625
        fun maybe_tick (T, U) u f =
blanchet@52302
   626
          if try (fst o HOLogic.dest_prodT) U = SOME T then
blanchet@52302
   627
            Term.lambda u (HOLogic.mk_prod (u, f $ u))
blanchet@52302
   628
          else
blanchet@52302
   629
            f;
blanchet@51808
   630
blanchet@55867
   631
        fun build_rec (x as Free (_, T)) U =
blanchet@52368
   632
          if T = U then
blanchet@52368
   633
            x
blanchet@52368
   634
          else
desharna@57303
   635
            build_map lthy [] (indexify (perhaps (try (snd o HOLogic.dest_prodT)) o snd) Cs
blanchet@55867
   636
              (fn kk => fn TU => maybe_tick TU (nth us kk) (nth frecs kk))) (T, U) $ x;
blanchet@52301
   637
blanchet@55867
   638
        val fxsss = map2 (map2 (flat_rec_arg_args oo map2 (map o build_rec))) xsss x_Tssss;
blanchet@55871
   639
        val goalss = map5 (map4 o mk_goal) frecs xctrss fss xsss fxsss;
blanchet@51808
   640
blanchet@57397
   641
        val tacss = map4 (map ooo
blanchet@57399
   642
              mk_rec_tac pre_map_defs (fp_nesting_map_ident0s @ live_nesting_map_ident0s) rec_defs)
blanchet@55867
   643
            ctor_rec_thms fp_abs_inverses abs_inverses ctr_defss;
blanchet@51808
   644
blanchet@51808
   645
        fun prove goal tac =
blanchet@51808
   646
          Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@51808
   647
          |> Thm.close_derivation;
blanchet@51808
   648
      in
blanchet@52305
   649
        map2 (map2 prove) goalss tacss
blanchet@51808
   650
      end;
blanchet@51808
   651
blanchet@56641
   652
    val rec_thmss = mk_rec_thmss (the rec_args_typess) recs rec_defs ctor_rec_thms;
blanchet@51808
   653
  in
desharna@57471
   654
    ((induct_thms, induct_thm, mk_induct_attrs ctrss),
blanchet@55856
   655
     (rec_thmss, code_nitpicksimp_attrs @ simp_attrs))
blanchet@51808
   656
  end;
blanchet@51808
   657
blanchet@57535
   658
fun mk_coinduct_attributes fpTs ctrss discss mss =
desharna@57302
   659
  let
desharna@57302
   660
    val nn = length fpTs;
desharna@57302
   661
    val fp_b_names = map base_name_of_typ fpTs;
blanchet@57535
   662
desharna@57302
   663
    fun mk_coinduct_concls ms discs ctrs =
desharna@57302
   664
      let
desharna@57302
   665
        fun mk_disc_concl disc = [name_of_disc disc];
desharna@57302
   666
        fun mk_ctr_concl 0 _ = []
desharna@57302
   667
          | mk_ctr_concl _ ctor = [name_of_ctr ctor];
desharna@57302
   668
        val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]];
desharna@57302
   669
        val ctr_concls = map2 mk_ctr_concl ms ctrs;
desharna@57302
   670
      in
desharna@57302
   671
        flat (map2 append disc_concls ctr_concls)
desharna@57302
   672
      end;
blanchet@57535
   673
desharna@57302
   674
    val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names);
desharna@57302
   675
    val coinduct_conclss =
desharna@57302
   676
      map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss;
desharna@57302
   677
desharna@57302
   678
    val common_coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn));
desharna@57302
   679
    val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes 1));
desharna@57302
   680
desharna@57302
   681
    val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases));
desharna@57302
   682
    val coinduct_case_concl_attrs =
desharna@57302
   683
      map2 (fn casex => fn concls =>
desharna@57302
   684
          Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls))))
desharna@57302
   685
        coinduct_cases coinduct_conclss;
desharna@57302
   686
desharna@57302
   687
    val common_coinduct_attrs =
desharna@57302
   688
      common_coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs;
desharna@57302
   689
    val coinduct_attrs =
desharna@57302
   690
      coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs;
desharna@57302
   691
  in
desharna@57302
   692
    (coinduct_attrs, common_coinduct_attrs)
desharna@57302
   693
  end;
desharna@57302
   694
blanchet@57535
   695
fun derive_rel_coinduct_thm_for_types lthy fpA_Ts ns As Bs mss (ctr_sugars : ctr_sugar list)
blanchet@57535
   696
    abs_inverses abs_injects ctor_injects dtor_ctors rel_pre_defs ctor_defss dtor_rel_coinduct
blanchet@57535
   697
    live_nesting_rel_eqs =
desharna@57301
   698
  let
desharna@57302
   699
    val fpB_Ts = map (typ_subst_nonatomic (As ~~ Bs)) fpA_Ts;
desharna@57301
   700
desharna@57301
   701
    val (Rs, IRs, fpAs, fpBs, names_lthy) =
desharna@57301
   702
      let
desharna@57301
   703
        val fp_names = map base_name_of_typ fpA_Ts;
desharna@57301
   704
        val ((((Rs, IRs), fpAs_names), fpBs_names), names_lthy) = lthy
desharna@57301
   705
          |> mk_Frees "R" (map2 mk_pred2T As Bs)
desharna@57301
   706
          ||>> mk_Frees "IR" (map2 mk_pred2T fpA_Ts fpB_Ts)
desharna@57301
   707
          ||>> Variable.variant_fixes fp_names
desharna@57301
   708
          ||>> Variable.variant_fixes (map (suffix "'") fp_names);
desharna@57301
   709
      in
desharna@57301
   710
        (Rs, IRs,
desharna@57301
   711
          map2 (curry Free) fpAs_names fpA_Ts,
desharna@57302
   712
          map2 (curry Free) fpBs_names fpB_Ts,
desharna@57302
   713
          names_lthy)
desharna@57301
   714
      end;
desharna@57301
   715
desharna@57301
   716
    val ((discA_tss, selA_tsss), (discB_tss, selB_tsss)) =
desharna@57301
   717
      let
desharna@57301
   718
        val discss = map #discs ctr_sugars;
desharna@57301
   719
        val selsss = map #selss ctr_sugars;
desharna@57301
   720
        fun mk_discss ts Ts = map2 (map o rapp) ts (map (map (mk_disc_or_sel Ts)) discss);
desharna@57301
   721
        fun mk_selsss ts Ts = map2 (map o map o rapp) ts (map (map (map (mk_disc_or_sel Ts)))
desharna@57301
   722
          selsss);
desharna@57301
   723
      in
desharna@57302
   724
        ((mk_discss fpAs As, mk_selsss fpAs As),
desharna@57302
   725
         (mk_discss fpBs Bs, mk_selsss fpBs Bs))
desharna@57301
   726
      end;
desharna@57301
   727
desharna@57301
   728
    val premises =
desharna@57301
   729
      let
desharna@57525
   730
        fun build_the_rel A B = build_rel lthy fpA_Ts (the o choose_relator (Rs @ IRs)) (A, B);
desharna@57301
   731
desharna@57301
   732
        fun build_rel_app selA_t selB_t =
desharna@57301
   733
          (build_the_rel (fastype_of selA_t) (fastype_of selB_t )) $ selA_t $ selB_t
desharna@57301
   734
desharna@57301
   735
        fun mk_prem_ctr_concls n k discA_t selA_ts discB_t selB_ts =
desharna@57301
   736
          (if k = n then [] else [HOLogic.mk_eq (discA_t, discB_t)]) @
desharna@57301
   737
          (case (selA_ts, selB_ts) of
desharna@57303
   738
            ([], []) => []
desharna@57301
   739
          | (_ :: _, _ :: _) =>
desharna@57301
   740
            [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [discA_t, discB_t],
desharna@57301
   741
              Library.foldr1 HOLogic.mk_conj (map2 build_rel_app selA_ts selB_ts))]);
desharna@57301
   742
desharna@57301
   743
        fun mk_prem_concl n discA_ts selA_tss discB_ts selB_tss =
desharna@57301
   744
          Library.foldr1 HOLogic.mk_conj (flat (map5 (mk_prem_ctr_concls n)
desharna@57301
   745
            (1 upto n) discA_ts selA_tss discB_ts selB_tss))
desharna@57301
   746
          handle List.Empty => @{term True};
desharna@57301
   747
desharna@57301
   748
        fun mk_prem IR tA tB n discA_ts selA_tss discB_ts selB_tss =
desharna@57301
   749
          fold_rev Logic.all [tA, tB] (Logic.mk_implies (HOLogic.mk_Trueprop (IR $ tA $ tB),
desharna@57301
   750
            HOLogic.mk_Trueprop (mk_prem_concl n discA_ts selA_tss discB_ts selB_tss)));
desharna@57301
   751
      in
desharna@57301
   752
        map8 mk_prem IRs fpAs fpBs ns discA_tss selA_tsss discB_tss selB_tsss
desharna@57301
   753
      end;
desharna@57301
   754
desharna@57525
   755
    val goal = HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 mk_leq
desharna@57525
   756
      IRs (map (build_rel lthy [] (the o choose_relator (Rs @ IRs))) (fpA_Ts ~~ fpB_Ts))));
desharna@57302
   757
desharna@57302
   758
    val rel_coinduct0_thm = Goal.prove_sorry lthy [] premises goal
desharna@57301
   759
      (fn {context = ctxt, prems = prems} =>
desharna@57301
   760
          mk_rel_coinduct0_tac ctxt dtor_rel_coinduct (map (certify ctxt) IRs) prems
desharna@57303
   761
            (map #exhaust ctr_sugars) (map (flat o #disc_thmss) ctr_sugars)
desharna@57303
   762
            (map (flat o #sel_thmss) ctr_sugars) ctor_defss dtor_ctors ctor_injects abs_injects
desharna@57471
   763
            rel_pre_defs abs_inverses live_nesting_rel_eqs)
desharna@57301
   764
      |> singleton (Proof_Context.export names_lthy lthy)
desharna@57302
   765
      |> Thm.close_derivation;
desharna@57302
   766
  in
desharna@57471
   767
    (postproc_co_induct lthy (length fpA_Ts) @{thm predicate2D} @{thm predicate2D_conj}
desharna@57471
   768
       rel_coinduct0_thm,
blanchet@57535
   769
     mk_coinduct_attributes fpA_Ts (map #ctrs ctr_sugars) (map #discs ctr_sugars) mss)
desharna@57301
   770
  end;
desharna@57301
   771
blanchet@55871
   772
fun derive_coinduct_corecs_thms_for_types pre_bnfs (x, cs, cpss, ((pgss, cqgsss), _))
blanchet@57397
   773
    dtor_coinduct dtor_injects dtor_ctors dtor_corec_thms live_nesting_bnfs fpTs Cs Xs ctrXs_Tsss
blanchet@57397
   774
    kss mss ns fp_abs_inverses abs_inverses mk_vimage2p ctr_defss (ctr_sugars : ctr_sugar list)
blanchet@55864
   775
    corecs corec_defs export_args lthy =
blanchet@51810
   776
  let
blanchet@55867
   777
    fun mk_ctor_dtor_corec_thm dtor_inject dtor_ctor corec =
blanchet@55867
   778
      iffD1 OF [dtor_inject, trans OF [corec, dtor_ctor RS sym]];
traytel@53203
   779
blanchet@55867
   780
    val ctor_dtor_corec_thms = map3 mk_ctor_dtor_corec_thm dtor_injects dtor_ctors dtor_corec_thms;
traytel@53203
   781
blanchet@51815
   782
    val nn = length pre_bnfs;
blanchet@51815
   783
blanchet@51810
   784
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@51810
   785
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
blanchet@57399
   786
    val live_nesting_map_ident0s = map map_ident0_of_bnf live_nesting_bnfs;
blanchet@57397
   787
    val live_nesting_rel_eqs = map rel_eq_of_bnf live_nesting_bnfs;
blanchet@51810
   788
blanchet@51816
   789
    val fp_b_names = map base_name_of_typ fpTs;
blanchet@51811
   790
blanchet@53210
   791
    val ctrss = map #ctrs ctr_sugars;
blanchet@53210
   792
    val discss = map #discs ctr_sugars;
blanchet@53210
   793
    val selsss = map #selss ctr_sugars;
blanchet@51840
   794
    val exhausts = map #exhaust ctr_sugars;
blanchet@51840
   795
    val disc_thmsss = map #disc_thmss ctr_sugars;
blanchet@51840
   796
    val discIss = map #discIs ctr_sugars;
blanchet@51840
   797
    val sel_thmsss = map #sel_thmss ctr_sugars;
blanchet@51810
   798
blanchet@51810
   799
    val (((rs, us'), vs'), names_lthy) =
blanchet@52341
   800
      lthy
blanchet@51810
   801
      |> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs)
blanchet@51816
   802
      ||>> Variable.variant_fixes fp_b_names
blanchet@51816
   803
      ||>> Variable.variant_fixes (map (suffix "'") fp_b_names);
blanchet@51810
   804
blanchet@51810
   805
    val us = map2 (curry Free) us' fpTs;
blanchet@51810
   806
    val udiscss = map2 (map o rapp) us discss;
blanchet@51810
   807
    val uselsss = map2 (map o map o rapp) us selsss;
blanchet@51810
   808
blanchet@51810
   809
    val vs = map2 (curry Free) vs' fpTs;
blanchet@51810
   810
    val vdiscss = map2 (map o rapp) vs discss;
blanchet@51810
   811
    val vselsss = map2 (map o map o rapp) vs selsss;
blanchet@51810
   812
blanchet@52345
   813
    val coinduct_thms_pairs =
blanchet@51810
   814
      let
blanchet@51810
   815
        val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs;
blanchet@51810
   816
        val uv_eqs = map2 (curry HOLogic.mk_eq) us vs;
blanchet@51810
   817
        val strong_rs =
blanchet@51810
   818
          map4 (fn u => fn v => fn uvr => fn uv_eq =>
blanchet@51810
   819
            fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs;
blanchet@51810
   820
blanchet@54237
   821
        fun build_the_rel rs' T Xs_T =
desharna@57303
   822
          build_rel lthy [] (fn (_, X) => nth rs' (find_index (curry (op =) X) Xs)) (T, Xs_T)
blanchet@54237
   823
          |> Term.subst_atomic_types (Xs ~~ fpTs);
blanchet@51810
   824
blanchet@54237
   825
        fun build_rel_app rs' usel vsel Xs_T =
blanchet@54237
   826
          fold rapp [usel, vsel] (build_the_rel rs' (fastype_of usel) Xs_T);
blanchet@51810
   827
blanchet@54237
   828
        fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels ctrXs_Ts =
blanchet@51810
   829
          (if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @
blanchet@51810
   830
          (if null usels then
blanchet@51810
   831
             []
blanchet@51810
   832
           else
blanchet@51810
   833
             [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc],
blanchet@54237
   834
                Library.foldr1 HOLogic.mk_conj (map3 (build_rel_app rs') usels vsels ctrXs_Ts))]);
blanchet@51810
   835
blanchet@54237
   836
        fun mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss =
blanchet@54237
   837
          Library.foldr1 HOLogic.mk_conj (flat (map6 (mk_prem_ctr_concls rs' n)
blanchet@54237
   838
            (1 upto n) udiscs uselss vdiscs vselss ctrXs_Tss))
blanchet@51810
   839
          handle List.Empty => @{term True};
blanchet@51810
   840
blanchet@54237
   841
        fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss ctrXs_Tss =
blanchet@51810
   842
          fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr,
blanchet@54237
   843
            HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss)));
blanchet@51810
   844
blanchet@51810
   845
        val concl =
blanchet@51810
   846
          HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@51810
   847
            (map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v)))
blanchet@51810
   848
               uvrs us vs));
blanchet@51810
   849
blanchet@51810
   850
        fun mk_goal rs' =
blanchet@54237
   851
          Logic.list_implies (map9 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss
blanchet@54237
   852
            ctrXs_Tsss, concl);
blanchet@51810
   853
blanchet@52345
   854
        val goals = map mk_goal [rs, strong_rs];
blanchet@51810
   855
blanchet@51810
   856
        fun prove dtor_coinduct' goal =
blanchet@51810
   857
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@57397
   858
            mk_coinduct_tac ctxt live_nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs
blanchet@57397
   859
              fp_abs_inverses abs_inverses dtor_ctors exhausts ctr_defss disc_thmsss sel_thmsss)
blanchet@51810
   860
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@51810
   861
          |> Thm.close_derivation;
blanchet@51810
   862
traytel@53106
   863
        val rel_eqs = map rel_eq_of_bnf pre_bnfs;
traytel@53106
   864
        val rel_monos = map rel_mono_of_bnf pre_bnfs;
traytel@53106
   865
        val dtor_coinducts =
traytel@55803
   866
          [dtor_coinduct, mk_strong_coinduct_thm dtor_coinduct rel_eqs rel_monos mk_vimage2p lthy]
blanchet@51810
   867
      in
desharna@57471
   868
        map2 (postproc_co_induct lthy nn mp mp_conj oo prove) dtor_coinducts goals
blanchet@51810
   869
      end;
blanchet@51810
   870
blanchet@51810
   871
    fun mk_maybe_not pos = not pos ? HOLogic.mk_not;
blanchet@51810
   872
blanchet@55869
   873
    val gcorecs = map (lists_bmoc pgss) corecs;
blanchet@51810
   874
blanchet@55856
   875
    val corec_thmss =
blanchet@51810
   876
      let
blanchet@55869
   877
        fun mk_goal c cps gcorec n k ctr m cfs' =
blanchet@55869
   878
          fold_rev (fold_rev Logic.all) ([c] :: pgss)
blanchet@51810
   879
            (Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps,
blanchet@55869
   880
               mk_Trueprop_eq (gcorec $ c, Term.list_comb (ctr, take m cfs'))));
blanchet@51810
   881
blanchet@55869
   882
        val mk_U = typ_subst_nonatomic (map2 (fn C => fn fpT => (mk_sumT (fpT, C), fpT)) Cs fpTs);
blanchet@52347
   883
blanchet@55869
   884
        fun tack (c, u) f =
blanchet@55869
   885
          let val x' = Free (x, mk_sumT (fastype_of u, fastype_of c)) in
blanchet@55869
   886
            Term.lambda x' (mk_case_sum (Term.lambda u u, Term.lambda c (f $ c)) $ x')
blanchet@52347
   887
          end;
blanchet@51810
   888
blanchet@55869
   889
        fun build_corec cqg =
blanchet@55869
   890
          let val T = fastype_of cqg in
blanchet@52347
   891
            if exists_subtype_in Cs T then
blanchet@55869
   892
              let val U = mk_U T in
desharna@57303
   893
                build_map lthy [] (indexify fst (map2 (curry mk_sumT) fpTs Cs) (fn kk => fn _ =>
blanchet@55869
   894
                  tack (nth cs kk, nth us kk) (nth gcorecs kk))) (T, U) $ cqg
blanchet@52368
   895
              end
blanchet@52347
   896
            else
blanchet@55869
   897
              cqg
blanchet@52347
   898
          end;
blanchet@51810
   899
blanchet@55869
   900
        val cqgsss' = map (map (map build_corec)) cqgsss;
blanchet@55869
   901
        val goalss = map8 (map4 oooo mk_goal) cs cpss gcorecs ns kss ctrss mss cqgsss';
blanchet@51810
   902
blanchet@55856
   903
        val tacss =
blanchet@57399
   904
          map4 (map ooo mk_corec_tac corec_defs live_nesting_map_ident0s)
blanchet@55867
   905
            ctor_dtor_corec_thms pre_map_defs abs_inverses ctr_defss;
blanchet@51810
   906
blanchet@51810
   907
        fun prove goal tac =
blanchet@51815
   908
          Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@51815
   909
          |> Thm.close_derivation;
blanchet@51810
   910
      in
blanchet@55856
   911
        map2 (map2 prove) goalss tacss
blanchet@55856
   912
        |> map (map (unfold_thms lthy @{thms case_sum_if}))
blanchet@51810
   913
      end;
blanchet@51810
   914
blanchet@55856
   915
    val disc_corec_iff_thmss =
blanchet@51810
   916
      let
blanchet@55869
   917
        fun mk_goal c cps gcorec n k disc =
blanchet@55869
   918
          mk_Trueprop_eq (disc $ (gcorec $ c),
blanchet@51810
   919
            if n = 1 then @{const True}
blanchet@51810
   920
            else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps));
blanchet@51810
   921
blanchet@55869
   922
        val goalss = map6 (map2 oooo mk_goal) cs cpss gcorecs ns kss discss;
blanchet@51810
   923
blanchet@51828
   924
        fun mk_case_split' cp = Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split};
blanchet@51810
   925
blanchet@51810
   926
        val case_splitss' = map (map mk_case_split') cpss;
blanchet@51810
   927
blanchet@55867
   928
        val tacss = map3 (map oo mk_disc_corec_iff_tac) case_splitss' corec_thmss disc_thmsss;
blanchet@51810
   929
blanchet@51810
   930
        fun prove goal tac =
blanchet@51810
   931
          Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@52357
   932
          |> singleton export_args
blanchet@51829
   933
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@51810
   934
          |> Thm.close_derivation;
blanchet@51810
   935
blanchet@51810
   936
        fun proves [_] [_] = []
blanchet@51810
   937
          | proves goals tacs = map2 prove goals tacs;
blanchet@51810
   938
      in
blanchet@55856
   939
        map2 proves goalss tacss
blanchet@51810
   940
      end;
blanchet@51810
   941
blanchet@55867
   942
    fun mk_disc_corec_thms corecs discIs = map (op RS) (corecs ~~ discIs);
blanchet@51810
   943
blanchet@55867
   944
    val disc_corec_thmss = map2 mk_disc_corec_thms corec_thmss discIss;
blanchet@51810
   945
blanchet@55867
   946
    fun mk_sel_corec_thm corec_thm sel sel_thm =
blanchet@51810
   947
      let
blanchet@51810
   948
        val (domT, ranT) = dest_funT (fastype_of sel);
blanchet@51810
   949
        val arg_cong' =
blanchet@51810
   950
          Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
blanchet@51810
   951
            [NONE, NONE, SOME (certify lthy sel)] arg_cong
blanchet@51810
   952
          |> Thm.varifyT_global;
blanchet@51810
   953
        val sel_thm' = sel_thm RSN (2, trans);
blanchet@51810
   954
      in
blanchet@55867
   955
        corec_thm RS arg_cong' RS sel_thm'
blanchet@51810
   956
      end;
blanchet@51810
   957
blanchet@55867
   958
    fun mk_sel_corec_thms corec_thmss =
blanchet@55867
   959
      map3 (map3 (map2 o mk_sel_corec_thm)) corec_thmss selsss sel_thmsss;
blanchet@51810
   960
blanchet@55867
   961
    val sel_corec_thmsss = mk_sel_corec_thms corec_thmss;
blanchet@51810
   962
  in
blanchet@57535
   963
    ((coinduct_thms_pairs,
blanchet@57535
   964
      mk_coinduct_attributes fpTs (map #ctrs ctr_sugars) (map #discs ctr_sugars) mss),
desharna@57489
   965
     corec_thmss,
desharna@57489
   966
     disc_corec_thmss,
blanchet@55856
   967
     (disc_corec_iff_thmss, simp_attrs),
blanchet@55856
   968
     (sel_corec_thmsss, simp_attrs))
blanchet@51810
   969
  end;
blanchet@51810
   970
blanchet@52207
   971
fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp
blanchet@57094
   972
    ((discs_sels0, no_code), specs) no_defs_lthy0 =
blanchet@49112
   973
  let
blanchet@49298
   974
    (* TODO: sanity checks on arguments *)
blanchet@49298
   975
blanchet@57094
   976
    val discs_sels = discs_sels0 orelse fp = Greatest_FP;
blanchet@49278
   977
blanchet@49367
   978
    val nn = length specs;
blanchet@55469
   979
    val fp_bs = map type_binding_of_spec specs;
blanchet@49498
   980
    val fp_b_names = map Binding.name_of fp_bs;
blanchet@49498
   981
    val fp_common_name = mk_common_name fp_b_names;
blanchet@55469
   982
    val map_bs = map map_binding_of_spec specs;
blanchet@55469
   983
    val rel_bs = map rel_binding_of_spec specs;
blanchet@49298
   984
blanchet@51758
   985
    fun prepare_type_arg (_, (ty, c)) =
blanchet@49298
   986
      let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
blanchet@49298
   987
        TFree (s, prepare_constraint no_defs_lthy0 c)
blanchet@49298
   988
      end;
blanchet@49298
   989
blanchet@55469
   990
    val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of_spec) specs;
wenzelm@56254
   991
    val unsorted_Ass0 = map (map (resort_tfree @{sort type})) Ass0;
blanchet@55700
   992
    val unsorted_As = Library.foldr1 (merge_type_args fp) unsorted_Ass0;
blanchet@53266
   993
    val num_As = length unsorted_As;
blanchet@55699
   994
blanchet@55699
   995
    val set_boss = map (map fst o type_args_named_constrained_of_spec) specs;
blanchet@55699
   996
    val set_bss = map (map (the_default Binding.empty)) set_boss;
blanchet@49119
   997
blanchet@49585
   998
    val (((Bs0, Cs), Xs), no_defs_lthy) =
blanchet@49298
   999
      no_defs_lthy0
blanchet@49298
  1000
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
blanchet@53266
  1001
      |> mk_TFrees num_As
blanchet@49585
  1002
      ||>> mk_TFrees nn
blanchet@51858
  1003
      ||>> variant_tfrees fp_b_names;
blanchet@49119
  1004
blanchet@55469
  1005
    fun add_fake_type spec =
blanchet@55469
  1006
      Typedecl.basic_typedecl (type_binding_of_spec spec, num_As, mixfix_of_spec spec);
blanchet@51768
  1007
blanchet@53268
  1008
    val (fake_T_names, fake_lthy) = fold_map add_fake_type specs no_defs_lthy0;
blanchet@49119
  1009
blanchet@53262
  1010
    val qsoty = quote o Syntax.string_of_typ fake_lthy;
blanchet@53262
  1011
blanchet@54253
  1012
    val _ = (case Library.duplicates (op =) unsorted_As of [] => ()
blanchet@53262
  1013
      | A :: _ => error ("Duplicate type parameter " ^ qsoty A ^ " in " ^ co_prefix fp ^
blanchet@53262
  1014
          "datatype specification"));
blanchet@53262
  1015
blanchet@53262
  1016
    val bad_args =
blanchet@53262
  1017
      map (Logic.type_map (singleton (Variable.polymorphic no_defs_lthy0))) unsorted_As
blanchet@53262
  1018
      |> filter_out Term.is_TVar;
blanchet@53262
  1019
    val _ = null bad_args orelse
blanchet@53262
  1020
      error ("Locally fixed type argument " ^ qsoty (hd bad_args) ^ " in " ^ co_prefix fp ^
blanchet@53262
  1021
        "datatype specification");
blanchet@53262
  1022
blanchet@55469
  1023
    val mixfixes = map mixfix_of_spec specs;
blanchet@49119
  1024
blanchet@54253
  1025
    val _ = (case Library.duplicates Binding.eq_name fp_bs of [] => ()
blanchet@49119
  1026
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
  1027
blanchet@55469
  1028
    val mx_ctr_specss = map mixfixed_ctr_specs_of_spec specs;
blanchet@55469
  1029
    val ctr_specss = map (map fst) mx_ctr_specss;
blanchet@55469
  1030
    val ctr_mixfixess = map (map snd) mx_ctr_specss;
blanchet@49119
  1031
blanchet@55469
  1032
    val disc_bindingss = map (map disc_of_ctr_spec) ctr_specss;
blanchet@49336
  1033
    val ctr_bindingss =
blanchet@55469
  1034
      map2 (fn fp_b_name => map (Binding.qualify false fp_b_name o ctr_of_ctr_spec)) fp_b_names
blanchet@55469
  1035
        ctr_specss;
blanchet@55469
  1036
    val ctr_argsss = map (map args_of_ctr_spec) ctr_specss;
blanchet@49119
  1037
blanchet@49336
  1038
    val sel_bindingsss = map (map (map fst)) ctr_argsss;
blanchet@49298
  1039
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@57200
  1040
    val raw_sel_default_eqss = map sel_default_eqs_of_spec specs;
blanchet@49286
  1041
blanchet@49308
  1042
    val (As :: _) :: fake_ctr_Tsss =
blanchet@49298
  1043
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
blanchet@53262
  1044
    val As' = map dest_TFree As;
blanchet@49298
  1045
blanchet@49183
  1046
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
blanchet@53262
  1047
    val _ = (case subtract (op =) As' rhs_As' of [] => ()
blanchet@53262
  1048
      | extras => error ("Extra type variables on right-hand side: " ^
blanchet@53262
  1049
          commas (map (qsoty o TFree) extras)));
blanchet@49165
  1050
blanchet@53268
  1051
    val fake_Ts = map (fn s => Type (s, As)) fake_T_names;
blanchet@53268
  1052
blanchet@53262
  1053
    fun eq_fpT_check (T as Type (s, Ts)) (T' as Type (s', Ts')) =
blanchet@53262
  1054
        s = s' andalso (Ts = Ts' orelse
blanchet@53262
  1055
          error ("Wrong type arguments in " ^ co_prefix fp ^ "recursive type " ^ qsoty T ^
blanchet@53262
  1056
            " (expected " ^ qsoty T' ^ ")"))
blanchet@49591
  1057
      | eq_fpT_check _ _ = false;
blanchet@49146
  1058
blanchet@53222
  1059
    fun freeze_fp (T as Type (s, Ts)) =
blanchet@49591
  1060
        (case find_index (eq_fpT_check T) fake_Ts of
blanchet@53222
  1061
          ~1 => Type (s, map freeze_fp Ts)
blanchet@49591
  1062
        | kk => nth Xs kk)
blanchet@49204
  1063
      | freeze_fp T = T;
blanchet@49121
  1064
blanchet@53222
  1065
    val unfreeze_fp = Term.typ_subst_atomic (Xs ~~ fake_Ts);
blanchet@53222
  1066
blanchet@52310
  1067
    val ctrXs_Tsss = map (map (map freeze_fp)) fake_ctr_Tsss;
blanchet@55966
  1068
    val ctrXs_repTs = map mk_sumprodT_balanced ctrXs_Tsss;
blanchet@49119
  1069
blanchet@49298
  1070
    val fp_eqs =
traytel@55803
  1071
      map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctrXs_repTs;
blanchet@49121
  1072
blanchet@53262
  1073
    val rhsXs_As' = fold (fold (fold Term.add_tfreesT)) ctrXs_Tsss [];
blanchet@53262
  1074
    val _ = (case subtract (op =) rhsXs_As' As' of [] => ()
blanchet@53266
  1075
      | extras => List.app (fn extra => warning ("Unused type variable on right-hand side of " ^
blanchet@53266
  1076
          co_prefix fp ^ "datatype definition: " ^ qsoty (TFree extra))) extras);
blanchet@53262
  1077
blanchet@55701
  1078
    val killed_As =
blanchet@55701
  1079
      map_filter (fn (A, set_bos) => if exists is_none set_bos then SOME A else NONE)
blanchet@55701
  1080
        (unsorted_As ~~ transpose set_boss);
blanchet@55701
  1081
traytel@55803
  1082
    val ((pre_bnfs, absT_infos), (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0,
blanchet@55868
  1083
             dtors = dtors0, xtor_co_recs = xtor_co_recs0, xtor_co_induct, dtor_ctors,
traytel@55803
  1084
             ctor_dtors, ctor_injects, dtor_injects, xtor_map_thms, xtor_set_thmss, xtor_rel_thms,
desharna@57301
  1085
             xtor_co_rec_thms, rel_xtor_co_induct_thm, ...},
traytel@53203
  1086
           lthy)) =
blanchet@55701
  1087
      fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As)
blanchet@55701
  1088
        (map dest_TFree killed_As) fp_eqs no_defs_lthy0
blanchet@53222
  1089
      handle BAD_DEAD (X, X_backdrop) =>
blanchet@53222
  1090
        (case X_backdrop of
blanchet@53222
  1091
          Type (bad_tc, _) =>
blanchet@53222
  1092
          let
blanchet@53222
  1093
            val fake_T = qsoty (unfreeze_fp X);
blanchet@53222
  1094
            val fake_T_backdrop = qsoty (unfreeze_fp X_backdrop);
blanchet@53222
  1095
            fun register_hint () =
blanchet@53222
  1096
              "\nUse the " ^ quote (fst (fst @{command_spec "bnf"})) ^ " command to register " ^
blanchet@53222
  1097
              quote bad_tc ^ " as a bounded natural functor to allow nested (co)recursion through \
blanchet@53222
  1098
              \it";
blanchet@53222
  1099
          in
blanchet@53222
  1100
            if is_some (bnf_of no_defs_lthy bad_tc) orelse
blanchet@53222
  1101
               is_some (fp_sugar_of no_defs_lthy bad_tc) then
blanchet@53256
  1102
              error ("Inadmissible " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
blanchet@53256
  1103
                " in type expression " ^ fake_T_backdrop)
blanchet@53222
  1104
            else if is_some (Datatype_Data.get_info (Proof_Context.theory_of no_defs_lthy)
blanchet@53222
  1105
                bad_tc) then
blanchet@53222
  1106
              error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
blanchet@53222
  1107
                " via the old-style datatype " ^ quote bad_tc ^ " in type expression " ^
blanchet@53222
  1108
                fake_T_backdrop ^ register_hint ())
blanchet@53222
  1109
            else
blanchet@53222
  1110
              error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
blanchet@53222
  1111
                " via type constructor " ^ quote bad_tc ^ " in type expression " ^ fake_T_backdrop ^
blanchet@53222
  1112
                register_hint ())
blanchet@53222
  1113
          end);
blanchet@49585
  1114
traytel@55803
  1115
    val abss = map #abs absT_infos;
traytel@55803
  1116
    val reps = map #rep absT_infos;
traytel@55803
  1117
    val absTs = map #absT absT_infos;
traytel@55803
  1118
    val repTs = map #repT absT_infos;
traytel@55803
  1119
    val abs_injects = map #abs_inject absT_infos;
traytel@55803
  1120
    val abs_inverses = map #abs_inverse absT_infos;
traytel@55803
  1121
    val type_definitions = map #type_definition absT_infos;
traytel@55803
  1122
traytel@53143
  1123
    val time = time lthy;
blanchet@49585
  1124
    val timer = time (Timer.startRealTimer ());
blanchet@49121
  1125
blanchet@57397
  1126
    val fp_nesting_bnfs = nesting_bnfs lthy ctrXs_Tsss Xs;
blanchet@57397
  1127
    val live_nesting_bnfs = nesting_bnfs lthy ctrXs_Tsss As;
blanchet@49226
  1128
blanchet@49585
  1129
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@49585
  1130
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
blanchet@49585
  1131
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
blanchet@57397
  1132
    val fp_nesting_set_maps = maps set_map_of_bnf fp_nesting_bnfs;
blanchet@57397
  1133
    val live_nesting_set_maps = maps set_map_of_bnf live_nesting_bnfs;
blanchet@49585
  1134
blanchet@49585
  1135
    val live = live_of_bnf any_fp_bnf;
blanchet@52961
  1136
    val _ =
blanchet@52961
  1137
      if live = 0 andalso exists (not o Binding.is_empty) (map_bs @ rel_bs) then
blanchet@53266
  1138
        warning "Map function and relator names ignored"
blanchet@52961
  1139
      else
blanchet@52961
  1140
        ();
blanchet@49585
  1141
blanchet@49585
  1142
    val Bs =
blanchet@49585
  1143
      map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A)
blanchet@53266
  1144
        (liveness_of_fp_bnf num_As any_fp_bnf) As Bs0;
blanchet@49585
  1145
blanchet@49585
  1146
    val B_ify = Term.typ_subst_atomic (As ~~ Bs);
blanchet@49167
  1147
blanchet@49501
  1148
    val ctors = map (mk_ctor As) ctors0;
blanchet@49501
  1149
    val dtors = map (mk_dtor As) dtors0;
blanchet@49124
  1150
blanchet@49501
  1151
    val fpTs = map (domain_type o fastype_of) dtors;
blanchet@56638
  1152
    val fpBTs = map B_ify fpTs;
blanchet@49362
  1153
blanchet@51780
  1154
    fun massage_simple_notes base =
blanchet@51780
  1155
      filter_out (null o #2)
blanchet@51780
  1156
      #> map (fn (thmN, thms, attrs) =>
blanchet@55410
  1157
        ((Binding.qualify true base (Binding.name thmN), attrs), [(thms, [])]));
blanchet@51780
  1158
blanchet@51780
  1159
    val massage_multi_notes =
blanchet@51780
  1160
      maps (fn (thmN, thmss, attrs) =>
blanchet@53792
  1161
        map3 (fn fp_b_name => fn Type (T_name, _) => fn thms =>
blanchet@55410
  1162
            ((Binding.qualify true fp_b_name (Binding.name thmN), attrs T_name), [(thms, [])]))
blanchet@53792
  1163
          fp_b_names fpTs thmss)
blanchet@53792
  1164
      #> filter_out (null o fst o hd o snd);
blanchet@51780
  1165
blanchet@52310
  1166
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctrXs_Tsss;
blanchet@49203
  1167
    val ns = map length ctr_Tsss;
blanchet@49212
  1168
    val kss = map (fn n => 1 upto n) ns;
blanchet@49203
  1169
    val mss = map (map length) ctr_Tsss;
blanchet@49203
  1170
blanchet@55867
  1171
    val ((xtor_co_recs, recs_args_types, corecs_args_types), lthy') =
blanchet@55868
  1172
      mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy;
blanchet@49210
  1173
traytel@55803
  1174
    fun define_ctrs_dtrs_for_type (((((((((((((((((((((((((((fp_bnf, fp_b), fpT), ctor), dtor),
blanchet@55867
  1175
              xtor_co_rec), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs),
traytel@55803
  1176
            pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), abs),
traytel@55803
  1177
          abs_inject), abs_inverse), type_definition), ctr_bindings), ctr_mixfixes), ctr_Tss),
blanchet@57200
  1178
        disc_bindings), sel_bindingss), raw_sel_default_eqs) no_defs_lthy =
blanchet@49176
  1179
      let
blanchet@49498
  1180
        val fp_b_name = Binding.name_of fp_b;
blanchet@49498
  1181
traytel@55803
  1182
        val ctr_absT = domain_type (fastype_of ctor);
blanchet@49119
  1183
blanchet@52968
  1184
        val ((((w, xss), yss), u'), names_lthy) =
blanchet@49204
  1185
          no_defs_lthy
traytel@55803
  1186
          |> yield_singleton (mk_Frees "w") ctr_absT
blanchet@49370
  1187
          ||>> mk_Freess "x" ctr_Tss
blanchet@49585
  1188
          ||>> mk_Freess "y" (map (map B_ify) ctr_Tss)
blanchet@49498
  1189
          ||>> yield_singleton Variable.variant_fixes fp_b_name;
blanchet@49370
  1190
blanchet@49498
  1191
        val u = Free (u', fpT);
blanchet@49121
  1192
blanchet@49129
  1193
        val ctr_rhss =
traytel@55803
  1194
          map2 (fn k => fn xs => fold_rev Term.lambda xs (ctor $ mk_absumprod ctr_absT abs n k xs))
traytel@55803
  1195
            ks xss;
blanchet@49121
  1196
traytel@53569
  1197
        val maybe_conceal_def_binding = Thm.def_binding
traytel@53569
  1198
          #> Config.get no_defs_lthy bnf_note_all = false ? Binding.conceal;
traytel@53569
  1199
blanchet@52968
  1200
        val ((raw_ctrs, raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
blanchet@49169
  1201
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
traytel@53569
  1202
              Local_Theory.define ((b, mx), ((maybe_conceal_def_binding b, []), rhs)) #>> apsnd snd)
blanchet@52968
  1203
            ctr_bindings ctr_mixfixes ctr_rhss
blanchet@49121
  1204
          ||> `Local_Theory.restore;
blanchet@49121
  1205
blanchet@49121
  1206
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
  1207
blanchet@49121
  1208
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49585
  1209
        val ctr_defs' =
blanchet@49585
  1210
          map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs;
blanchet@49130
  1211
blanchet@49203
  1212
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
blanchet@49203
  1213
        val ctrs = map (mk_ctr As) ctrs0;
blanchet@49121
  1214
blanchet@51897
  1215
        fun wrap_ctrs lthy =
blanchet@49123
  1216
          let
traytel@50170
  1217
            fun exhaust_tac {context = ctxt, prems = _} =
blanchet@49135
  1218
              let
blanchet@49585
  1219
                val ctor_iff_dtor_thm =
blanchet@49585
  1220
                  let
blanchet@49585
  1221
                    val goal =
blanchet@49585
  1222
                      fold_rev Logic.all [w, u]
blanchet@49585
  1223
                        (mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w)));
blanchet@49585
  1224
                  in
wenzelm@51551
  1225
                    Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
traytel@55803
  1226
                      mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [ctr_absT, fpT])
blanchet@49585
  1227
                        (certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor)
blanchet@55409
  1228
                    |> Morphism.thm phi
blanchet@49585
  1229
                    |> Thm.close_derivation
blanchet@49585
  1230
                  end;
blanchet@49585
  1231
blanchet@49585
  1232
                val sumEN_thm' =
traytel@55803
  1233
                  unfold_thms lthy @{thms unit_all_eq1} (mk_absumprodE type_definition ms)
blanchet@49585
  1234
                  |> Morphism.thm phi;
blanchet@49135
  1235
              in
blanchet@49585
  1236
                mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm'
blanchet@49135
  1237
              end;
blanchet@49135
  1238
blanchet@49585
  1239
            val inject_tacss =
traytel@55803
  1240
              map2 (fn ctr_def => fn 0 => [] | _ => [fn {context = ctxt, ...} =>
traytel@55803
  1241
                mk_inject_tac ctxt ctr_def ctor_inject abs_inject]) ctr_defs ms;
blanchet@49585
  1242
blanchet@49585
  1243
            val half_distinct_tacss =
blanchet@49585
  1244
              map (map (fn (def, def') => fn {context = ctxt, ...} =>
traytel@55803
  1245
                  mk_half_distinct_tac ctxt ctor_inject abs_inject [def, def']))
traytel@55803
  1246
                (mk_half_pairss (`I ctr_defs));
blanchet@49585
  1247
blanchet@52968
  1248
            val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss;
blanchet@49585
  1249
blanchet@57200
  1250
            val sel_default_eqs = map (prepare_term lthy) raw_sel_default_eqs;
blanchet@55469
  1251
blanchet@57200
  1252
            fun ctr_spec_of disc_b ctr0 sel_bs = ((disc_b, ctr0), sel_bs);
blanchet@57200
  1253
            val ctr_specs = map3 ctr_spec_of disc_bindings ctrs0 sel_bindingss;
blanchet@49123
  1254
          in
blanchet@57200
  1255
            free_constructors tacss ((((discs_sels, no_code), standard_binding), ctr_specs),
blanchet@57200
  1256
              sel_default_eqs) lthy
blanchet@49123
  1257
          end;
blanchet@49121
  1258
desharna@57152
  1259
        fun derive_maps_sets_rels (ctr_sugar as {case_cong, discs, selss, ctrs, exhaust, disc_thmss,
desharna@57525
  1260
          sel_thmss, injects, distincts, ...} : ctr_sugar, lthy) =
blanchet@51835
  1261
          if live = 0 then
blanchet@51840
  1262
            ((([], [], [], []), ctr_sugar), lthy)
blanchet@51835
  1263
          else
blanchet@51835
  1264
            let
blanchet@51835
  1265
              val rel_flip = rel_flip_of_bnf fp_bnf;
blanchet@51835
  1266
              val nones = replicate live NONE;
blanchet@49585
  1267
blanchet@51835
  1268
              val ctor_cong =
blanchet@52207
  1269
                if fp = Least_FP then
blanchet@51835
  1270
                  Drule.dummy_thm
blanchet@51835
  1271
                else
blanchet@51835
  1272
                  let val ctor' = mk_ctor Bs ctor in
blanchet@51835
  1273
                    cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor')] arg_cong
blanchet@51835
  1274
                  end;
blanchet@49585
  1275
traytel@55803
  1276
              fun mk_cIn ctor k xs =
traytel@55803
  1277
                let val absT = domain_type (fastype_of ctor) in
traytel@55803
  1278
                  mk_absumprod absT abs n k xs
traytel@55803
  1279
                  |> fp = Greatest_FP ? curry (op $) ctor
traytel@55803
  1280
                  |> certify lthy
traytel@55803
  1281
                end;
blanchet@49585
  1282
traytel@55803
  1283
              val cxIns = map2 (mk_cIn ctor) ks xss;
blanchet@56638
  1284
              val cyIns = map2 (mk_cIn (Term.map_types B_ify ctor)) ks yss;
blanchet@49585
  1285
blanchet@51835
  1286
              fun mk_map_thm ctr_def' cxIn =
blanchet@51835
  1287
                fold_thms lthy [ctr_def']
traytel@55803
  1288
                  (unfold_thms lthy (o_apply :: pre_map_def ::
blanchet@56978
  1289
                       (if fp = Least_FP then [] else [dtor_ctor]) @ sumprod_thms_map @
traytel@55803
  1290
                       abs_inverses)
blanchet@51835
  1291
                     (cterm_instantiate_pos (nones @ [SOME cxIn])
blanchet@56978
  1292
                        (if fp = Least_FP then fp_map_thm
blanchet@56978
  1293
                         else fp_map_thm RS ctor_cong RS (ctor_dtor RS sym RS trans))))
blanchet@51835
  1294
                |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
  1295
blanchet@51835
  1296
              fun mk_set_thm fp_set_thm ctr_def' cxIn =
blanchet@51835
  1297
                fold_thms lthy [ctr_def']
blanchet@57397
  1298
                  (unfold_thms lthy (pre_set_defs @ fp_nesting_set_maps @ live_nesting_set_maps @
blanchet@55966
  1299
                       (if fp = Least_FP then [] else [dtor_ctor]) @ sumprod_thms_set @
traytel@55803
  1300
                       abs_inverses)
blanchet@51835
  1301
                     (cterm_instantiate_pos [SOME cxIn] fp_set_thm))
blanchet@51835
  1302
                |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
  1303
blanchet@51835
  1304
              fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns;
blanchet@49127
  1305
blanchet@51835
  1306
              val map_thms = map2 mk_map_thm ctr_defs' cxIns;
blanchet@51835
  1307
              val set_thmss = map mk_set_thms fp_set_thms;
blanchet@55463
  1308
              val set_thms = flat set_thmss;
blanchet@51835
  1309
desharna@57152
  1310
              fun mk_set Ts t =
desharna@57152
  1311
                subst_nonatomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
desharna@56956
  1312
desharna@57152
  1313
              val sets = map (mk_set (snd (Term.dest_Type fpT))) (sets_of_bnf fp_bnf);
desharna@56991
  1314
desharna@57525
  1315
              val set_empty_thms =
desharna@57525
  1316
                let
desharna@57525
  1317
                  val ctr_argT_namess = map ((fn Ts => fold Term.add_tfree_namesT Ts []) o
desharna@57525
  1318
                    binder_types o fastype_of) ctrs;
desharna@57525
  1319
                  val setTs = map (HOLogic.dest_setT o range_type o fastype_of) sets;
desharna@57525
  1320
                  val setT_names = map (fn T => the_single (Term.add_tfree_namesT T [])) setTs;
desharna@57525
  1321
desharna@57525
  1322
                  fun mk_set_empty_goal disc set T =
desharna@57525
  1323
                    Logic.mk_implies (HOLogic.mk_Trueprop (disc $ u),
desharna@57525
  1324
                      mk_Trueprop_eq (set $ u, HOLogic.mk_set T []));
desharna@57525
  1325
desharna@57525
  1326
                  val goals =
desharna@57525
  1327
                    if null discs then
desharna@57525
  1328
                      []
desharna@57525
  1329
                    else
desharna@57525
  1330
                      map_filter I (flat
desharna@57525
  1331
                        (map2 (fn names => fn disc =>
desharna@57525
  1332
                          map3 (fn name => fn setT => fn set =>
desharna@57525
  1333
                            if member (op =) names name then NONE
desharna@57525
  1334
                            else SOME (mk_set_empty_goal disc set setT))
desharna@57525
  1335
                          setT_names setTs sets)
desharna@57525
  1336
                        ctr_argT_namess discs));
desharna@57525
  1337
                in
desharna@57525
  1338
                  if null goals then
desharna@57525
  1339
                    []
desharna@57525
  1340
                  else
desharna@57525
  1341
                    Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals)
desharna@57525
  1342
                      (fn {context = ctxt, prems = _} =>
desharna@57525
  1343
                        mk_set_empty_tac ctxt (certify ctxt u) exhaust set_thms (flat disc_thmss))
desharna@57525
  1344
                      |> Conjunction.elim_balanced (length goals)
desharna@57525
  1345
                      |> Proof_Context.export names_lthy lthy
desharna@57525
  1346
                end;
desharna@57525
  1347
desharna@57525
  1348
              val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns);
desharna@57525
  1349
desharna@57525
  1350
              fun mk_rel_thm postproc ctr_defs' cxIn cyIn =
desharna@57525
  1351
                fold_thms lthy ctr_defs'
desharna@57525
  1352
                  (unfold_thms lthy (pre_rel_def :: abs_inverse ::
desharna@57525
  1353
                       (if fp = Least_FP then [] else [dtor_ctor]) @ sumprod_thms_rel @
desharna@57525
  1354
                       @{thms vimage2p_def sum.inject sum.distinct(1)[THEN eq_False[THEN iffD2]]})
desharna@57525
  1355
                     (cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm))
desharna@57525
  1356
                |> postproc
desharna@57525
  1357
                |> singleton (Proof_Context.export names_lthy no_defs_lthy);
desharna@57525
  1358
desharna@57525
  1359
              fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) =
desharna@57525
  1360
                mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn;
desharna@57525
  1361
desharna@57525
  1362
              fun mk_rel_intro_thm thm =
desharna@57525
  1363
                let
desharna@57525
  1364
                  fun impl thm = rotate_prems (~1) (impl (rotate_prems 1 (conjI RS thm)))
desharna@57525
  1365
                    handle THM _ => thm
desharna@57525
  1366
                in
desharna@57525
  1367
                  impl (thm RS iffD2)
desharna@57525
  1368
                  handle THM _ => thm
desharna@57525
  1369
                end;
desharna@57525
  1370
desharna@57525
  1371
              fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) =
desharna@57525
  1372
                mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def']
desharna@57525
  1373
                  cxIn cyIn;
desharna@57525
  1374
desharna@57525
  1375
              fun mk_other_half_rel_distinct_thm thm =
desharna@57525
  1376
                flip_rels lthy live thm
desharna@57525
  1377
                RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2);
desharna@57525
  1378
desharna@57525
  1379
              val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos);
desharna@57525
  1380
              val rel_intro_thms = map mk_rel_intro_thm rel_inject_thms;
desharna@57525
  1381
desharna@57525
  1382
              val half_rel_distinct_thmss =
desharna@57525
  1383
                map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos);
desharna@57525
  1384
              val other_half_rel_distinct_thmss =
desharna@57525
  1385
                map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss;
desharna@57525
  1386
              val (rel_distinct_thms, _) =
desharna@57525
  1387
                join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss;
desharna@57525
  1388
desharna@57525
  1389
              val rel_eq_thms =
desharna@57525
  1390
                map (fn th => th RS @{thm eq_False[THEN iffD2]}) rel_distinct_thms @
desharna@57525
  1391
                map2 (fn th => fn 0 => th RS @{thm eq_True[THEN iffD2]} | _ => th)
desharna@57525
  1392
                  rel_inject_thms ms;
desharna@57525
  1393
desharna@57563
  1394
              val (disc_map_iff_thms, sel_map_thms, sel_set_thms, rel_sel_thms,
desharna@57563
  1395
                (rel_cases_thm, rel_cases_attrs)) =
desharna@56991
  1396
                let
desharna@56991
  1397
                  val (((Ds, As), Bs), names_lthy) = lthy
desharna@56991
  1398
                    |> mk_TFrees (dead_of_bnf fp_bnf)
desharna@56991
  1399
                    ||>> mk_TFrees (live_of_bnf fp_bnf)
desharna@56991
  1400
                    ||>> mk_TFrees (live_of_bnf fp_bnf);
desharna@57046
  1401
                  val TA as Type (_, ADs) = mk_T_of_bnf Ds As fp_bnf;
desharna@57525
  1402
                  val TB as Type (_, BDs) = mk_T_of_bnf Ds Bs fp_bnf;
desharna@56991
  1403
                  val fTs = map2 (curry op -->) As Bs;
desharna@57563
  1404
                  val rel = mk_rel_of_bnf Ds As Bs fp_bnf;
desharna@57563
  1405
                  val ((((fs, Rs), ta), tb), names_lthy) = names_lthy
desharna@56991
  1406
                    |> mk_Frees "f" fTs
desharna@57563
  1407
                    ||>> mk_Frees "R" (map2 mk_pred2T As Bs)
desharna@57563
  1408
                    ||>> yield_singleton (mk_Frees "a") TA
desharna@57563
  1409
                    ||>> yield_singleton (mk_Frees "b") TB;
desharna@56991
  1410
                  val map_term = mk_map_of_bnf Ds As Bs fp_bnf;
desharna@57563
  1411
                  val discAs = map (mk_disc_or_sel ADs) discs;
desharna@57563
  1412
                  val selAss = map (map (mk_disc_or_sel ADs)) selss;
desharna@57563
  1413
                  val discAs_selAss = flat (map2 (map o pair) discAs selAss);
desharna@57563
  1414
desharna@57563
  1415
                  val rel_sel_thms =
desharna@57563
  1416
                    let
desharna@57563
  1417
                      val discBs = map (mk_disc_or_sel BDs) discs;
desharna@57563
  1418
                      val selBss = map (map (mk_disc_or_sel BDs)) selss;
desharna@57563
  1419
                      val n = length discAs;
desharna@57563
  1420
desharna@57563
  1421
                      fun mk_rhs n k discA selAs discB selBs =
desharna@57563
  1422
                        (if k = n then [] else [HOLogic.mk_eq (discA $ ta, discB $ tb)]) @
desharna@57563
  1423
                        (case (selAs, selBs) of
desharna@57563
  1424
                           ([], []) => []
desharna@57563
  1425
                         | (_ :: _, _ :: _) => [Library.foldr HOLogic.mk_imp
desharna@57563
  1426
                           (if n = 1 then [] else [discA $ ta, discB $ tb],
desharna@57563
  1427
                            Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app names_lthy Rs [])
desharna@57563
  1428
                              (map (rapp ta) selAs) (map (rapp tb) selBs)))]);
desharna@57563
  1429
desharna@57563
  1430
                      val goals = if n = 0 then []
desharna@57563
  1431
                        else [mk_Trueprop_eq
desharna@57563
  1432
                          (build_rel_app names_lthy Rs [] ta tb,
desharna@57563
  1433
                           Library.foldr1 HOLogic.mk_conj
desharna@57563
  1434
                             (flat (map5 (mk_rhs n) (1 upto n) discAs selAss discBs selBss)))];
desharna@57563
  1435
                    in
desharna@57563
  1436
                      if null goals then
desharna@57563
  1437
                        []
desharna@57563
  1438
                      else
desharna@57563
  1439
                        Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals)
desharna@57563
  1440
                          (fn {context = ctxt, prems = _} =>
desharna@57563
  1441
                            mk_rel_sel_tac ctxt (certify ctxt ta) (certify ctxt tb) exhaust
desharna@57563
  1442
                              (flat disc_thmss) (flat sel_thmss) rel_inject_thms distincts
desharna@57563
  1443
                              rel_distinct_thms)
desharna@57563
  1444
                          |> Conjunction.elim_balanced (length goals)
desharna@57563
  1445
                          |> Proof_Context.export names_lthy lthy
desharna@57563
  1446
                    end;
blanchet@57094
  1447
desharna@57525
  1448
                  val (rel_cases_thm, rel_cases_attrs) =
desharna@57525
  1449
                    let
desharna@57563
  1450
                      val (thesis, names_lthy) = apfst HOLogic.mk_Trueprop
desharna@57563
  1451
                        (yield_singleton (mk_Frees "thesis") HOLogic.boolT names_lthy);
desharna@57525
  1452
desharna@57525
  1453
                      val rel_Rs_a_b = list_comb (rel, Rs) $ ta $ tb;
desharna@57525
  1454
                      val ctrAs = map (mk_ctr ADs) ctrs;
desharna@57525
  1455
                      val ctrBs = map (mk_ctr BDs) ctrs;
desharna@57525
  1456
desharna@57525
  1457
                      fun mk_assms ctrA ctrB ctxt =
desharna@57525
  1458
                        let
desharna@57525
  1459
                          val argA_Ts = binder_types (fastype_of ctrA);
desharna@57525
  1460
                          val argB_Ts = binder_types (fastype_of ctrB);
desharna@57525
  1461
                          val ((argAs, argBs), names_ctxt) =  ctxt
desharna@57525
  1462
                            |> mk_Frees "x" argA_Ts
desharna@57525
  1463
                            ||>> mk_Frees "y" argB_Ts;
desharna@57525
  1464
                          val ctrA_args = list_comb (ctrA, argAs);
desharna@57525
  1465
                          val ctrB_args = list_comb (ctrB, argBs);
desharna@57525
  1466
                          fun build_the_rel A B =
desharna@57525
  1467
                            build_rel lthy [] (the o choose_relator Rs) (A, B);
desharna@57525
  1468
                          fun build_rel_app a b =
desharna@57525
  1469
                            build_the_rel (fastype_of a) (fastype_of b) $ a $ b;
desharna@57525
  1470
                        in
desharna@57525
  1471
                          (fold_rev Logic.all (argAs @ argBs) (Logic.list_implies
desharna@57525
  1472
                             (mk_Trueprop_eq (ta, ctrA_args) ::
desharna@57525
  1473
                                mk_Trueprop_eq (tb, ctrB_args) ::
desharna@57525
  1474
                                  map2 (HOLogic.mk_Trueprop oo build_rel_app) argAs argBs,
desharna@57525
  1475
                              thesis)),
desharna@57525
  1476
                           names_ctxt)
desharna@57525
  1477
                        end;
desharna@57525
  1478
desharna@57525
  1479
                      val (assms, names_lthy) = fold_map2 mk_assms ctrAs ctrBs names_lthy;
desharna@57525
  1480
                      val goal = Logic.list_implies (HOLogic.mk_Trueprop rel_Rs_a_b :: assms,
desharna@57525
  1481
                        thesis);
desharna@57525
  1482
                      val thm = Goal.prove_sorry lthy [] [] goal
desharna@57525
  1483
                          (fn {context = ctxt, prems = _} =>
desharna@57525
  1484
                            mk_rel_cases_tac ctxt (certify ctxt ta) (certify ctxt tb) exhaust
desharna@57525
  1485
                              injects rel_inject_thms distincts rel_distinct_thms)
desharna@57525
  1486
                        |> singleton (Proof_Context.export names_lthy lthy)
desharna@57525
  1487
                        |> Thm.close_derivation;
desharna@57525
  1488
desharna@57525
  1489
                      val ctr_names = quasi_unambiguous_case_names ((map name_of_ctr) ctrAs);
desharna@57525
  1490
                      val case_names_attr = Attrib.internal (K (Rule_Cases.case_names ctr_names));
desharna@57525
  1491
                      val consumes_attr = Attrib.internal (K (Rule_Cases.consumes 1));
desharna@57525
  1492
                      val cases_pred_attr = Attrib.internal o K o Induct.cases_pred;
desharna@57525
  1493
                    in
desharna@57525
  1494
                      (thm, [consumes_attr, case_names_attr, cases_pred_attr ""])
desharna@57525
  1495
                    end;
desharna@57525
  1496
desharna@57046
  1497
                  val disc_map_iff_thms =
desharna@56991
  1498
                    let
desharna@57046
  1499
                      val discsB = map (mk_disc_or_sel BDs) discs;
desharna@57563
  1500
                      val discsA_t = map (fn disc1 => Term.betapply (disc1, ta)) discAs;
blanchet@57094
  1501
desharna@57046
  1502
                      fun mk_goal (discA_t, discB) =
blanchet@57205
  1503
                        if head_of discA_t aconv HOLogic.Not orelse is_refl_bool discA_t then
blanchet@57094
  1504
                          NONE
blanchet@57094
  1505
                        else
blanchet@57094
  1506
                          SOME (mk_Trueprop_eq
blanchet@57094
  1507
                            (betapply (discB, (Term.list_comb (map_term, fs) $ ta)), discA_t));
blanchet@57094
  1508
desharna@57046
  1509
                      val goals = map_filter mk_goal (discsA_t ~~ discsB);
desharna@56991
  1510
                    in
blanchet@57199
  1511
                      if null goals then
blanchet@57199
  1512
                        []
desharna@56991
  1513
                      else
desharna@57046
  1514
                        Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals)
desharna@57046
  1515
                          (fn {context = ctxt, prems = _} =>
desharna@57046
  1516
                            mk_disc_map_iff_tac ctxt (certify ctxt ta) exhaust (flat disc_thmss)
desharna@57046
  1517
                              map_thms)
desharna@57046
  1518
                          |> Conjunction.elim_balanced (length goals)
desharna@57046
  1519
                          |> Proof_Context.export names_lthy lthy
desharna@56991
  1520
                    end;
blanchet@57094
  1521
desharna@57046
  1522
                  val sel_map_thms =
desharna@57046
  1523
                    let
desharna@57152
  1524
                      fun mk_goal (discA, selA) =
desharna@57046
  1525
                        let
blanchet@57199
  1526
                          val prem = Term.betapply (discA, ta);
desharna@57046
  1527
                          val selB = mk_disc_or_sel BDs selA;
desharna@57046
  1528
                          val lhs = selB $ (Term.list_comb (map_term, fs) $ ta);
desharna@57046
  1529
                          val lhsT = fastype_of lhs;
desharna@57046
  1530
                          val map_rhsT = map_atyps (perhaps (AList.lookup (op =) (Bs ~~ As))) lhsT;
desharna@57303
  1531
                          val map_rhs = build_map lthy []
desharna@57046
  1532
                            (the o (AList.lookup (op =) ((As ~~ Bs) ~~ fs))) (map_rhsT, lhsT);
desharna@57046
  1533
                          val rhs = (case map_rhs of
desharna@57046
  1534
                            Const (@{const_name id}, _) => selA $ ta
desharna@57046
  1535
                            | _ => map_rhs $ (selA $ ta));
blanchet@57199
  1536
                          val concl = mk_Trueprop_eq (lhs, rhs);
desharna@57046
  1537
                        in
blanchet@57205
  1538
                          if is_refl_bool prem then concl
blanchet@57199
  1539
                          else Logic.mk_implies (HOLogic.mk_Trueprop prem, concl)
desharna@57046
  1540
                        end;
desharna@57563
  1541
                      val goals = map mk_goal discAs_selAss;
desharna@57046
  1542
                    in
blanchet@57199
  1543
                      if null goals then
blanchet@57199
  1544
                        []
desharna@57046
  1545
                      else
desharna@57046
  1546
                        Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals)
desharna@57046
  1547
                          (fn {context = ctxt, prems = _} =>
desharna@57046
  1548
                            mk_sel_map_tac ctxt (certify ctxt ta) exhaust (flat disc_thmss)
desharna@57046
  1549
                              map_thms (flat sel_thmss))
desharna@57046
  1550
                          |> Conjunction.elim_balanced (length goals)
desharna@57046
  1551
                          |> Proof_Context.export names_lthy lthy
desharna@57046
  1552
                    end;
blanchet@57199
  1553
desharna@57152
  1554
                  val sel_set_thms =
desharna@57152
  1555
                    let
desharna@57152
  1556
                      val setsA = map (mk_set ADs) (sets_of_bnf fp_bnf);
blanchet@57199
  1557
desharna@57152
  1558
                      fun mk_goal discA selA setA ctxt =
desharna@57152
  1559
                        let
blanchet@57199
  1560
                          val prem = Term.betapply (discA, ta);
desharna@57152
  1561
                          val sel_rangeT = range_type (fastype_of selA);
desharna@57152
  1562
                          val A = HOLogic.dest_setT (range_type (fastype_of setA));
blanchet@57199
  1563
desharna@57152
  1564
                          fun travese_nested_types t ctxt =
desharna@57152
  1565
                            (case fastype_of t of
desharna@57152
  1566
                              Type (type_name, xs) =>
desharna@57152
  1567
                              (case bnf_of lthy type_name of
desharna@57152
  1568
                                NONE => ([], ctxt)
desharna@57152
  1569
                              | SOME bnf =>
desharna@57152
  1570
                                let
desharna@57152
  1571
                                  fun seq_assm a set ctxt =
desharna@57152
  1572
                                    let
desharna@57152
  1573
                                      val X = HOLogic.dest_setT (range_type (fastype_of set));
desharna@57152
  1574
                                      val (x, ctxt') = yield_singleton (mk_Frees "x") X ctxt;
blanchet@57397
  1575
                                      val assm = HOLogic.mk_Trueprop (HOLogic.mk_mem (x, set $ a));
desharna@57152
  1576
                                    in
desharna@57152
  1577
                                      travese_nested_types x ctxt'
desharna@57152
  1578
                                      |>> map (Logic.mk_implies o pair assm)
desharna@57152
  1579
                                    end;
desharna@57152
  1580
                                in
desharna@57152
  1581
                                  fold_map (seq_assm t o mk_set xs) (sets_of_bnf bnf) ctxt
desharna@57152
  1582
                                  |>> flat
desharna@57152
  1583
                                end)
desharna@57152
  1584
                            | T =>
desharna@57152
  1585
                              if T = A then
desharna@57152
  1586
                                ([HOLogic.mk_Trueprop (HOLogic.mk_mem (t, setA $ ta))], ctxt)
desharna@57152
  1587
                              else
desharna@57152
  1588
                                ([], ctxt));
blanchet@57199
  1589
blanchet@57199
  1590
                          val (concls, ctxt') =
desharna@57152
  1591
                            if sel_rangeT = A then
desharna@57152
  1592
                              ([HOLogic.mk_Trueprop (HOLogic.mk_mem (selA $ ta, setA $ ta))], ctxt)
desharna@57152
  1593
                            else
desharna@57152
  1594
                              travese_nested_types (selA $ ta) names_lthy;
desharna@57152
  1595
                        in
desharna@57152
  1596
                          if exists_subtype_in [A] sel_rangeT then
blanchet@57205
  1597
                            if is_refl_bool prem then
blanchet@57199
  1598
                              (concls, ctxt')
desharna@57152
  1599
                            else
blanchet@57199
  1600
                              (map (Logic.mk_implies o pair (HOLogic.mk_Trueprop prem)) concls,
blanchet@57199
  1601
                               ctxt')
blanchet@57199
  1602
                          else
blanchet@57199
  1603
                            ([], ctxt)
desharna@57152
  1604
                        end;
desharna@57152
  1605
                      val (goals, names_lthy) = apfst (flat o flat) (fold_map (fn (disc, sel) =>
desharna@57563
  1606
                        fold_map (mk_goal disc sel) setsA) discAs_selAss names_lthy);
desharna@57152
  1607
                    in
blanchet@57199
  1608
                      if null goals then
blanchet@57199
  1609
                        []
desharna@57152
  1610
                      else
desharna@57152
  1611
                        Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals)
desharna@57152
  1612
                          (fn {context = ctxt, prems = _} =>
desharna@57152
  1613
                            mk_sel_set_tac ctxt (certify ctxt ta) exhaust (flat disc_thmss)
desharna@57152
  1614
                              (flat sel_thmss) set_thms)
desharna@57152
  1615
                          |> Conjunction.elim_balanced (length goals)
desharna@57152
  1616
                          |> Proof_Context.export names_lthy lthy
desharna@57152
  1617
                    end;
desharna@56991
  1618
                in
desharna@57563
  1619
                  (disc_map_iff_thms, sel_map_thms, sel_set_thms, rel_sel_thms,
desharna@57563
  1620
                    (rel_cases_thm, rel_cases_attrs))
blanchet@57094
  1621
                end;
desharna@56956
  1622
blanchet@54145
  1623
              val anonymous_notes =
blanchet@55397
  1624
                [([case_cong], fundefcong_attrs),
blanchet@55463
  1625
                 (rel_eq_thms, code_nitpicksimp_attrs)]
blanchet@54145
  1626
                |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@54145
  1627
blanchet@51835
  1628
              val notes =
desharna@56991
  1629
                [(disc_map_iffN, disc_map_iff_thms, simp_attrs),
desharna@56991
  1630
                 (mapN, map_thms, code_nitpicksimp_attrs @ simp_attrs),
desharna@57562
  1631
                 (rel_casesN, [rel_cases_thm], rel_cases_attrs),
blanchet@54145
  1632
                 (rel_distinctN, rel_distinct_thms, simp_attrs),
blanchet@54145
  1633
                 (rel_injectN, rel_inject_thms, simp_attrs),
desharna@57493
  1634
                 (rel_introsN, rel_intro_thms, []),
desharna@57563
  1635
                 (rel_selN, rel_sel_thms, []),
desharna@56956
  1636
                 (setN, set_thms, code_nitpicksimp_attrs @ simp_attrs),
desharna@57046
  1637
                 (sel_mapN, sel_map_thms, []),
desharna@57152
  1638
                 (sel_setN, sel_set_thms, []),
desharna@56956
  1639
                 (set_emptyN, set_empty_thms, [])]
blanchet@51835
  1640
                |> massage_simple_notes fp_b_name;
blanchet@51835
  1641
            in
blanchet@51840
  1642
              (((map_thms, rel_inject_thms, rel_distinct_thms, set_thmss), ctr_sugar),
blanchet@55463
  1643
               lthy
blanchet@55535
  1644
               |> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) map_thms)
blanchet@55903
  1645
               |> fp = Least_FP
blanchet@55903
  1646
                 ? Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) rel_eq_thms)
blanchet@55535
  1647
               |> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) set_thms)
blanchet@55463
  1648
               |> Local_Theory.notes (anonymous_notes @ notes)
blanchet@55463
  1649
               |> snd)
blanchet@51835
  1650
            end;
blanchet@49585
  1651
blanchet@55410
  1652
        fun mk_binding pre = Binding.qualify false fp_b_name (Binding.prefix_name (pre ^ "_") fp_b);
blanchet@49287
  1653
blanchet@55867
  1654
        fun massage_res (((maps_sets_rels, ctr_sugar), co_rec_res), lthy) =
blanchet@55867
  1655
          (((maps_sets_rels, (ctrs, xss, ctr_defs, ctr_sugar)), co_rec_res), lthy);
blanchet@49119
  1656
      in
blanchet@51897
  1657
        (wrap_ctrs
blanchet@51835
  1658
         #> derive_maps_sets_rels
blanchet@52313
  1659
         ##>>
blanchet@56641
  1660
           (if fp = Least_FP then define_rec (the recs_args_types) mk_binding fpTs Cs reps
blanchet@55867
  1661
           else define_corec (the corecs_args_types) mk_binding fpTs Cs abss) xtor_co_rec
blanchet@51835
  1662
         #> massage_res, lthy')
blanchet@49119
  1663
      end;
blanchet@49167
  1664
blanchet@51835
  1665
    fun wrap_types_etc (wrap_types_etcs, lthy) =
blanchet@51835
  1666
      fold_map I wrap_types_etcs lthy
blanchet@52342
  1667
      |>> apsnd split_list o apfst (apsnd split_list4 o apfst split_list4 o split_list)
blanchet@52342
  1668
        o split_list;
blanchet@49226
  1669
blanchet@55856
  1670
    fun mk_simp_thms ({injects, distincts, case_thms, ...} : ctr_sugar) co_recs mapsx rel_injects
blanchet@55856
  1671
        rel_distincts setss =
blanchet@55856
  1672
      injects @ distincts @ case_thms @ co_recs @ mapsx @ rel_injects @ rel_distincts @ flat setss;
blanchet@49479
  1673
blanchet@55867
  1674
    fun derive_note_induct_recs_thms_for_types
blanchet@56648
  1675
        ((((mapss, rel_injectss, rel_distinctss, setss), (ctrss, _, ctr_defss, ctr_sugars)),
blanchet@55864
  1676
          (recs, rec_defs)), lthy) =
blanchet@49202
  1677
      let
blanchet@55869
  1678
        val ((induct_thms, induct_thm, induct_attrs), (rec_thmss, rec_attrs)) =
blanchet@55868
  1679
          derive_induct_recs_thms_for_types pre_bnfs recs_args_types xtor_co_induct xtor_co_rec_thms
blanchet@57397
  1680
            live_nesting_bnfs fp_nesting_bnfs fpTs Cs Xs ctrXs_Tsss abs_inverses type_definitions
blanchet@55868
  1681
            abs_inverses ctrss ctr_defss recs rec_defs lthy;
blanchet@49201
  1682
blanchet@51830
  1683
        val induct_type_attr = Attrib.internal o K o Induct.induct_type;
desharna@57471
  1684
        val induct_pred_attr = Attrib.internal o K o Induct.induct_pred;
desharna@57471
  1685
desharna@57471
  1686
        val ((rel_induct_thmss, common_rel_induct_thms),
desharna@57471
  1687
             (rel_induct_attrs, common_rel_induct_attrs)) =
desharna@57471
  1688
          if live = 0 then
desharna@57471
  1689
            ((replicate nn [], []), ([], []))
desharna@57471
  1690
          else
desharna@57471
  1691
            let
desharna@57471
  1692
              val ((rel_induct_thms, common_rel_induct_thm), rel_induct_attrs) =
blanchet@57535
  1693
                derive_rel_induct_thms_for_types lthy fpTs As Bs ctrss ctr_Tsss
blanchet@57535
  1694
                  (map #exhaust ctr_sugars) rel_xtor_co_induct_thm ctr_defss ctor_injects
blanchet@57535
  1695
                  pre_rel_defs abs_inverses (map rel_eq_of_bnf live_nesting_bnfs);
desharna@57471
  1696
            in
desharna@57471
  1697
              ((map single rel_induct_thms, single common_rel_induct_thm),
desharna@57471
  1698
               (rel_induct_attrs, rel_induct_attrs))
desharna@57471
  1699
            end;
blanchet@51810
  1700
blanchet@51835
  1701
        val simp_thmss =
blanchet@56648
  1702
          map6 mk_simp_thms ctr_sugars rec_thmss mapss rel_injectss rel_distinctss setss;
blanchet@49438
  1703
blanchet@49337
  1704
        val common_notes =
desharna@57471
  1705
          (if nn > 1 then
desharna@57471
  1706
             [(inductN, [induct_thm], induct_attrs),
desharna@57471
  1707
              (rel_inductN, common_rel_induct_thms, common_rel_induct_attrs)]
desharna@57471
  1708
           else [])
blanchet@51780
  1709
          |> massage_simple_notes fp_common_name;
blanchet@49337
  1710
blanchet@49226
  1711
        val notes =
blanchet@55856
  1712
          [(inductN, map single induct_thms, fn T_name => induct_attrs @ [induct_type_attr T_name]),
blanchet@55869
  1713
           (recN, rec_thmss, K rec_attrs),
desharna@57471
  1714
           (rel_inductN, rel_induct_thmss, K (rel_induct_attrs @ [induct_pred_attr ""])),
blanchet@49585
  1715
           (simpsN, simp_thmss, K [])]
blanchet@51780
  1716
          |> massage_multi_notes;
blanchet@49202
  1717
      in
blanchet@51824
  1718
        lthy
blanchet@56641
  1719
        |> Spec_Rules.add Spec_Rules.Equational (recs, flat rec_thmss)
blanchet@51824
  1720
        |> Local_Theory.notes (common_notes @ notes) |> snd
blanchet@57397
  1721
        |> register_as_fp_sugars fpTs fpBTs Xs Least_FP pre_bnfs absT_infos fp_nesting_bnfs
blanchet@57397
  1722
          live_nesting_bnfs fp_res ctrXs_Tsss ctr_defss ctr_sugars recs rec_defs mapss [induct_thm]
blanchet@56648
  1723
          (map single induct_thms) rec_thmss (replicate nn []) (replicate nn []) rel_injectss
blanchet@56648
  1724
          rel_distinctss
blanchet@49202
  1725
      end;
blanchet@49202
  1726
blanchet@55867
  1727
    fun derive_note_coinduct_corecs_thms_for_types
blanchet@56648
  1728
        ((((mapss, rel_injectss, rel_distinctss, setss), (_, _, ctr_defss, ctr_sugars)),
blanchet@55867
  1729
          (corecs, corec_defs)), lthy) =
blanchet@49212
  1730
      let
blanchet@52345
  1731
        val (([(coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)],
blanchet@57260
  1732
              (coinduct_attrs, common_coinduct_attrs)),
desharna@57489
  1733
             corec_thmss, disc_corec_thmss,
blanchet@55871
  1734
             (disc_corec_iff_thmss, disc_corec_iff_attrs), (sel_corec_thmsss, sel_corec_attrs)) =
blanchet@55867
  1735
          derive_coinduct_corecs_thms_for_types pre_bnfs (the corecs_args_types) xtor_co_induct
blanchet@57397
  1736
            dtor_injects dtor_ctors xtor_co_rec_thms live_nesting_bnfs fpTs Cs Xs ctrXs_Tsss kss mss
blanchet@57397
  1737
            ns abs_inverses abs_inverses I ctr_defss ctr_sugars corecs corec_defs
traytel@55803
  1738
            (Proof_Context.export lthy' no_defs_lthy) lthy;
blanchet@49212
  1739
desharna@57489
  1740
        fun distinct_prems ctxt th =
desharna@57489
  1741
          Goal.prove ctxt [] []
desharna@57489
  1742
            (th |> Thm.prop_of |> Logic.strip_horn |>> distinct (op aconv) |> Logic.list_implies)
desharna@57489
  1743
            (fn _ => HEADGOAL (cut_tac th THEN' atac) THEN ALLGOALS eq_assume_tac);
desharna@57489
  1744
desharna@57489
  1745
        fun eq_ifIN _ [thm] = thm
desharna@57489
  1746
          | eq_ifIN ctxt (thm :: thms) =
desharna@57489
  1747
              distinct_prems ctxt (@{thm eq_ifI} OF
desharna@57489
  1748
                (map (unfold_thms ctxt @{thms atomize_imp[of _ "t = u" for t u]})
desharna@57489
  1749
                  [thm, eq_ifIN ctxt thms]));
desharna@57489
  1750
desharna@57489
  1751
        val corec_code_thms = map (eq_ifIN lthy) corec_thmss
blanchet@53475
  1752
        val sel_corec_thmss = map flat sel_corec_thmsss;
blanchet@53475
  1753
blanchet@51830
  1754
        val coinduct_type_attr = Attrib.internal o K o Induct.coinduct_type;
desharna@57302
  1755
        val coinduct_pred_attr = Attrib.internal o K o Induct.coinduct_pred;
blanchet@49479
  1756
blanchet@55867
  1757
        val flat_corec_thms = append oo append;
blanchet@49479
  1758
desharna@57471
  1759
        val ((rel_coinduct_thmss, common_rel_coinduct_thms),
desharna@57471
  1760
             (rel_coinduct_attrs, common_rel_coinduct_attrs)) =
desharna@57471
  1761
          if live = 0 then
desharna@57471
  1762
            ((replicate nn [], []), ([], []))
desharna@57471
  1763
          else
desharna@57471
  1764
            let
desharna@57471
  1765
              val ((rel_coinduct_thms, common_rel_coinduct_thm),
desharna@57471
  1766
                   (rel_coinduct_attrs, common_rel_coinduct_attrs)) =
desharna@57471
  1767
                derive_rel_coinduct_thm_for_types lthy fpTs ns As Bs mss ctr_sugars abs_inverses
desharna@57471
  1768
                  abs_injects ctor_injects dtor_ctors pre_rel_defs ctr_defss rel_xtor_co_induct_thm
desharna@57471
  1769
                  (map rel_eq_of_bnf live_nesting_bnfs)
desharna@57471
  1770
            in
desharna@57471
  1771
              ((map single rel_coinduct_thms, single common_rel_coinduct_thm),
desharna@57471
  1772
               (rel_coinduct_attrs, common_rel_coinduct_attrs))
desharna@57471
  1773
            end;
desharna@57471
  1774
blanchet@49479
  1775
        val simp_thmss =
blanchet@55856
  1776
          map6 mk_simp_thms ctr_sugars
blanchet@55867
  1777
            (map3 flat_corec_thms disc_corec_thmss disc_corec_iff_thmss sel_corec_thmss)
blanchet@56648
  1778
            mapss rel_injectss rel_distinctss setss;
blanchet@49479
  1779
blanchet@49342
  1780
        val common_notes =
desharna@57302
  1781
          (if nn > 1 then
desharna@57471
  1782
            [(coinductN, [coinduct_thm], common_coinduct_attrs),
desharna@57471
  1783
             (rel_coinductN, common_rel_coinduct_thms, common_rel_coinduct_attrs),
desharna@57302
  1784
             (strong_coinductN, [strong_coinduct_thm], common_coinduct_attrs)]
desharna@57471
  1785
          else [])
blanchet@51780
  1786
          |> massage_simple_notes fp_common_name;
blanchet@49342
  1787
blanchet@49212
  1788
        val notes =
blanchet@51780
  1789
          [(coinductN, map single coinduct_thms,
blanchet@51810
  1790
            fn T_name => coinduct_attrs @ [coinduct_type_attr T_name]),
desharna@57489
  1791
           (corecN, corec_thmss, K []),
desharna@57489
  1792
           (corec_codeN, map single corec_code_thms, K code_nitpicksimp_attrs),
desharna@57489
  1793
           (disc_corecN, disc_corec_thmss, K []),
blanchet@55867
  1794
           (disc_corec_iffN, disc_corec_iff_thmss, K disc_corec_iff_attrs),
desharna@57471
  1795
           (rel_coinductN, rel_coinduct_thmss, K (rel_coinduct_attrs @ [coinduct_pred_attr ""])),
blanchet@55867
  1796
           (sel_corecN, sel_corec_thmss, K sel_corec_attrs),
blanchet@51780
  1797
           (simpsN, simp_thmss, K []),
blanchet@55856
  1798
           (strong_coinductN, map single strong_coinduct_thms, K coinduct_attrs)]
blanchet@51780
  1799
          |> massage_multi_notes;
blanchet@49212
  1800
      in
blanchet@51824
  1801
        lthy
blanchet@55864
  1802
        (* TODO: code theorems *)
blanchet@55867
  1803
        |> fold (curry (Spec_Rules.add Spec_Rules.Equational) corecs)
blanchet@55864
  1804
          [flat sel_corec_thmss, flat corec_thmss]
blanchet@54030
  1805
        |> Local_Theory.notes (common_notes @ notes) |> snd
blanchet@57397
  1806
        |> register_as_fp_sugars fpTs fpBTs Xs Greatest_FP pre_bnfs absT_infos fp_nesting_bnfs
blanchet@57397
  1807
          live_nesting_bnfs fp_res ctrXs_Tsss ctr_defss ctr_sugars corecs corec_defs mapss
blanchet@56648
  1808
          [coinduct_thm, strong_coinduct_thm] (transpose [coinduct_thms, strong_coinduct_thms])
blanchet@56648
  1809
          corec_thmss disc_corec_thmss sel_corec_thmsss rel_injectss rel_distinctss
blanchet@49212
  1810
      end;
blanchet@49212
  1811
blanchet@52367
  1812
    val lthy'' = lthy'
blanchet@52968
  1813
      |> fold_map define_ctrs_dtrs_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ ctors ~~ dtors ~~
blanchet@55867
  1814
        xtor_co_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~ pre_set_defss ~~
blanchet@55867
  1815
        pre_rel_defs ~~ xtor_map_thms ~~ xtor_set_thmss ~~ xtor_rel_thms ~~ ns ~~ kss ~~ mss ~~
blanchet@55867
  1816
        abss ~~ abs_injects ~~ abs_inverses ~~ type_definitions ~~ ctr_bindingss ~~ ctr_mixfixess ~~
blanchet@57200
  1817
        ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ raw_sel_default_eqss)
blanchet@51835
  1818
      |> wrap_types_etc
blanchet@55966
  1819
      |> case_fp fp derive_note_induct_recs_thms_for_types
blanchet@55867
  1820
           derive_note_coinduct_corecs_thms_for_types;
blanchet@49167
  1821
blanchet@49167
  1822
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
blanchet@52899
  1823
      co_prefix fp ^ "datatype"));
blanchet@49112
  1824
  in
blanchet@52367
  1825
    timer; lthy''
blanchet@49112
  1826
  end;
blanchet@49112
  1827
wenzelm@53974
  1828
fun co_datatypes x = define_co_datatypes (K I) (K I) (K I) x;
blanchet@49297
  1829
wenzelm@53974
  1830
fun co_datatype_cmd x =
wenzelm@53974
  1831
  define_co_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term x;
blanchet@49119
  1832
blanchet@55469
  1833
val parse_ctr_arg =
blanchet@57205
  1834
  @{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"}
blanchet@57205
  1835
  || Parse.typ >> pair Binding.empty;
blanchet@55469
  1836
blanchet@55469
  1837
val parse_ctr_specs =
blanchet@57091
  1838
  Parse.enum1 "|" (parse_ctr_spec Parse.binding parse_ctr_arg -- Parse.opt_mixfix);
blanchet@51767
  1839
blanchet@51767
  1840
val parse_spec =
blanchet@57206
  1841
  parse_type_args_named_constrained -- Parse.binding -- Parse.opt_mixfix --
blanchet@57206
  1842
  (@{keyword "="} |-- parse_ctr_specs) -- parse_map_rel_bindings -- parse_sel_default_eqs;
blanchet@51767
  1843
blanchet@55469
  1844
val parse_co_datatype = parse_ctr_options -- Parse.and_list1 parse_spec;
blanchet@49278
  1845
blanchet@52207
  1846
fun parse_co_datatype_cmd fp construct_fp = parse_co_datatype >> co_datatype_cmd fp construct_fp;
blanchet@49112
  1847
kuncar@56522
  1848
val _ = Context.>> (Context.map_theory FP_Sugar_Interpretation.init);
kuncar@56522
  1849
blanchet@49112
  1850
end;