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