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