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