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