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