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