src/HOL/BNF/Tools/bnf_ctr_sugar.ML
author blanchet
Fri May 31 12:28:39 2013 +0200 (2013-05-31)
changeset 52279 1d37d281645d
parent 51861 0a04c2a89ea9
child 52280 c3f837d92537
permissions -rw-r--r--
renamed util function
blanchet@51797
     1
(*  Title:      HOL/BNF/Tools/bnf_ctr_sugar.ML
blanchet@49017
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@49017
     3
    Copyright   2012
blanchet@49017
     4
blanchet@51797
     5
Wrapping existing freely generated type's constructors.
blanchet@49017
     6
*)
blanchet@49017
     7
blanchet@51797
     8
signature BNF_CTR_SUGAR =
blanchet@49017
     9
sig
blanchet@51840
    10
  type ctr_sugar =
blanchet@51839
    11
    {ctrs: term list,
blanchet@51839
    12
     discs: term list,
blanchet@51819
    13
     selss: term list list,
blanchet@51819
    14
     exhaust: thm,
blanchet@51819
    15
     injects: thm list,
blanchet@51819
    16
     distincts: thm list,
blanchet@51819
    17
     case_thms: thm list,
blanchet@51819
    18
     disc_thmss: thm list list,
blanchet@51819
    19
     discIs: thm list,
blanchet@51819
    20
     sel_thmss: thm list list};
blanchet@51809
    21
blanchet@51840
    22
  val morph_ctr_sugar: morphism -> ctr_sugar -> ctr_sugar
blanchet@51823
    23
blanchet@49633
    24
  val rep_compat_prefix: string
blanchet@49633
    25
blanchet@49585
    26
  val mk_half_pairss: 'a list * 'a list -> ('a * 'a) list list
blanchet@49585
    27
  val join_halves: int -> 'a list list -> 'a list list -> 'a list * 'a list list list
blanchet@49585
    28
blanchet@49203
    29
  val mk_ctr: typ list -> term -> term
blanchet@49484
    30
  val mk_disc_or_sel: typ list -> term -> term
blanchet@49585
    31
blanchet@49622
    32
  val name_of_ctr: term -> string
blanchet@51777
    33
  val name_of_disc: term -> string
blanchet@49585
    34
blanchet@51781
    35
  val wrap_free_constructors: ({prems: thm list, context: Proof.context} -> tactic) list list ->
blanchet@49633
    36
    (((bool * bool) * term list) * term) *
blanchet@49280
    37
      (binding list * (binding list list * (binding * term) list list)) -> local_theory ->
blanchet@51840
    38
    ctr_sugar * local_theory
blanchet@49633
    39
  val parse_wrap_options: (bool * bool) parser
blanchet@49286
    40
  val parse_bound_term: (binding * string) parser
blanchet@49017
    41
end;
blanchet@49017
    42
blanchet@51797
    43
structure BNF_Ctr_Sugar : BNF_CTR_SUGAR =
blanchet@49017
    44
struct
blanchet@49017
    45
blanchet@49017
    46
open BNF_Util
blanchet@51797
    47
open BNF_Ctr_Sugar_Tactics
blanchet@49017
    48
blanchet@51840
    49
type ctr_sugar =
blanchet@51839
    50
  {ctrs: term list,
blanchet@51839
    51
   discs: term list,
blanchet@51819
    52
   selss: term list list,
blanchet@51819
    53
   exhaust: thm,
blanchet@51819
    54
   injects: thm list,
blanchet@51819
    55
   distincts: thm list,
blanchet@51819
    56
   case_thms: thm list,
blanchet@51819
    57
   disc_thmss: thm list list,
blanchet@51819
    58
   discIs: thm list,
blanchet@51819
    59
   sel_thmss: thm list list};
blanchet@51809
    60
blanchet@51840
    61
fun morph_ctr_sugar phi {ctrs, discs, selss, exhaust, injects, distincts, case_thms, disc_thmss,
blanchet@51840
    62
    discIs, sel_thmss} =
blanchet@51839
    63
  {ctrs = map (Morphism.term phi) ctrs,
blanchet@51839
    64
   discs = map (Morphism.term phi) discs,
blanchet@51823
    65
   selss = map (map (Morphism.term phi)) selss,
blanchet@51823
    66
   exhaust = Morphism.thm phi exhaust,
blanchet@51823
    67
   injects = map (Morphism.thm phi) injects,
blanchet@51823
    68
   distincts = map (Morphism.thm phi) distincts,
blanchet@51823
    69
   case_thms = map (Morphism.thm phi) case_thms,
blanchet@51823
    70
   disc_thmss = map (map (Morphism.thm phi)) disc_thmss,
blanchet@51823
    71
   discIs = map (Morphism.thm phi) discIs,
blanchet@51823
    72
   sel_thmss = map (map (Morphism.thm phi)) sel_thmss};
blanchet@51823
    73
blanchet@49633
    74
val rep_compat_prefix = "new";
blanchet@49633
    75
blanchet@49223
    76
val isN = "is_";
blanchet@49223
    77
val unN = "un_";
blanchet@49223
    78
fun mk_unN 1 1 suf = unN ^ suf
blanchet@49223
    79
  | mk_unN _ l suf = unN ^ suf ^ string_of_int l;
blanchet@49046
    80
blanchet@49594
    81
val caseN = "case";
blanchet@49054
    82
val case_congN = "case_cong";
blanchet@49594
    83
val case_convN = "case_conv";
blanchet@49118
    84
val collapseN = "collapse";
blanchet@49122
    85
val disc_excludeN = "disc_exclude";
blanchet@49054
    86
val disc_exhaustN = "disc_exhaust";
blanchet@49054
    87
val discsN = "discs";
blanchet@49054
    88
val distinctN = "distinct";
blanchet@49075
    89
val exhaustN = "exhaust";
blanchet@49486
    90
val expandN = "expand";
blanchet@49075
    91
val injectN = "inject";
blanchet@49075
    92
val nchotomyN = "nchotomy";
blanchet@49054
    93
val selsN = "sels";
blanchet@49054
    94
val splitN = "split";
blanchet@49633
    95
val splitsN = "splits";
blanchet@49054
    96
val split_asmN = "split_asm";
blanchet@49054
    97
val weak_case_cong_thmsN = "weak_case_cong";
blanchet@49019
    98
blanchet@49300
    99
val induct_simp_attrs = @{attributes [induct_simp]};
blanchet@49300
   100
val cong_attrs = @{attributes [cong]};
blanchet@49300
   101
val iff_attrs = @{attributes [iff]};
blanchet@49300
   102
val safe_elim_attrs = @{attributes [elim!]};
blanchet@49300
   103
val simp_attrs = @{attributes [simp]};
blanchet@49046
   104
blanchet@52279
   105
fun unflat_lookup eq = map oo sort_like eq;
blanchet@49258
   106
blanchet@49585
   107
fun mk_half_pairss' _ ([], []) = []
blanchet@49591
   108
  | mk_half_pairss' indent (x :: xs, _ :: ys) =
blanchet@49585
   109
    indent @ fold_rev (cons o single o pair x) ys (mk_half_pairss' ([] :: indent) (xs, ys));
blanchet@49486
   110
blanchet@49585
   111
fun mk_half_pairss p = mk_half_pairss' [[]] p;
blanchet@49027
   112
blanchet@49486
   113
fun join_halves n half_xss other_half_xss =
blanchet@49486
   114
  let
blanchet@49486
   115
    val xsss =
blanchet@49486
   116
      map2 (map2 append) (Library.chop_groups n half_xss)
blanchet@49486
   117
        (transpose (Library.chop_groups n other_half_xss))
blanchet@49668
   118
    val xs = splice (flat half_xss) (flat other_half_xss);
blanchet@49585
   119
  in (xs, xsss) end;
blanchet@49027
   120
blanchet@49280
   121
fun mk_undefined T = Const (@{const_name undefined}, T);
blanchet@49055
   122
blanchet@49500
   123
fun mk_ctr Ts t =
blanchet@49500
   124
  let val Type (_, Ts0) = body_type (fastype_of t) in
blanchet@49500
   125
    Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49203
   126
  end;
blanchet@49203
   127
blanchet@49484
   128
fun mk_disc_or_sel Ts t =
blanchet@49484
   129
  Term.subst_atomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
blanchet@49484
   130
blanchet@49536
   131
fun mk_case Ts T t =
blanchet@49536
   132
  let val (Type (_, Ts0), body) = strip_type (fastype_of t) |>> List.last in
blanchet@49536
   133
    Term.subst_atomic_types ((body, T) :: (Ts0 ~~ Ts)) t
blanchet@49536
   134
  end;
blanchet@49536
   135
blanchet@51777
   136
fun name_of_const what t =
blanchet@51777
   137
  (case head_of t of
blanchet@49622
   138
    Const (s, _) => s
blanchet@49622
   139
  | Free (s, _) => s
blanchet@51777
   140
  | _ => error ("Cannot extract name of " ^ what));
blanchet@51777
   141
blanchet@51777
   142
val name_of_ctr = name_of_const "constructor";
blanchet@51777
   143
blanchet@51777
   144
val notN = "not_";
blanchet@51777
   145
val eqN = "eq_";
blanchet@51777
   146
val neqN = "neq_";
blanchet@51777
   147
blanchet@51777
   148
fun name_of_disc t =
blanchet@51777
   149
  (case head_of t of
blanchet@51777
   150
    Abs (_, _, @{const Not} $ (t' $ Bound 0)) =>
blanchet@51777
   151
    Long_Name.map_base_name (prefix notN) (name_of_disc t')
blanchet@51777
   152
  | Abs (_, _, Const (@{const_name HOL.eq}, _) $ Bound 0 $ t') =>
blanchet@51777
   153
    Long_Name.map_base_name (prefix eqN) (name_of_disc t')
blanchet@51777
   154
  | Abs (_, _, @{const Not} $ (Const (@{const_name HOL.eq}, _) $ Bound 0 $ t')) =>
blanchet@51777
   155
    Long_Name.map_base_name (prefix neqN) (name_of_disc t')
blanchet@51777
   156
  | t' => name_of_const "destructor" t');
blanchet@49622
   157
blanchet@49622
   158
val base_name_of_ctr = Long_Name.base_name o name_of_ctr;
blanchet@49046
   159
blanchet@49437
   160
fun eta_expand_arg xs f_xs = fold_rev Term.lambda xs f_xs;
blanchet@49437
   161
blanchet@51781
   162
fun prepare_wrap_free_constructors prep_term ((((no_dests, rep_compat), raw_ctrs), raw_case),
blanchet@49336
   163
    (raw_disc_bindings, (raw_sel_bindingss, raw_sel_defaultss))) no_defs_lthy =
blanchet@49017
   164
  let
blanchet@49019
   165
    (* TODO: sanity checks on arguments *)
blanchet@49025
   166
blanchet@49280
   167
    val n = length raw_ctrs;
blanchet@49054
   168
    val ks = 1 upto n;
blanchet@49054
   169
blanchet@49121
   170
    val _ = if n > 0 then () else error "No constructors specified";
blanchet@49121
   171
blanchet@49280
   172
    val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs;
blanchet@49280
   173
    val case0 = prep_term no_defs_lthy raw_case;
blanchet@49280
   174
    val sel_defaultss =
blanchet@49280
   175
      pad_list [] n (map (map (apsnd (prep_term no_defs_lthy))) raw_sel_defaultss);
blanchet@49280
   176
blanchet@51771
   177
    val case0T = fastype_of case0;
blanchet@51771
   178
    val Type (dataT_name, As0) =
blanchet@51771
   179
      domain_type (snd (strip_typeN (length (binder_types case0T) - 1) case0T));
blanchet@49302
   180
    val data_b = Binding.qualified_name dataT_name;
blanchet@49498
   181
    val data_b_name = Binding.name_of data_b;
blanchet@49055
   182
blanchet@49633
   183
    fun qualify mandatory =
blanchet@49633
   184
      Binding.qualify mandatory data_b_name o
blanchet@49633
   185
      (rep_compat ? Binding.qualify false rep_compat_prefix);
blanchet@49633
   186
blanchet@49055
   187
    val (As, B) =
blanchet@49055
   188
      no_defs_lthy
blanchet@49298
   189
      |> mk_TFrees' (map Type.sort_of_atyp As0)
blanchet@49055
   190
      ||> the_single o fst o mk_TFrees 1;
blanchet@49055
   191
blanchet@49300
   192
    val dataT = Type (dataT_name, As);
blanchet@49055
   193
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49055
   194
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49055
   195
blanchet@49055
   196
    val ms = map length ctr_Tss;
blanchet@49055
   197
blanchet@51790
   198
    val raw_disc_bindings' = pad_list Binding.empty n raw_disc_bindings;
blanchet@49120
   199
blanchet@51790
   200
    fun can_definitely_rely_on_disc k =
blanchet@51790
   201
      not (Binding.is_empty (nth raw_disc_bindings' (k - 1)));
blanchet@51790
   202
    fun can_rely_on_disc k =
blanchet@51790
   203
      can_definitely_rely_on_disc k orelse (k = 1 andalso not (can_definitely_rely_on_disc 2));
blanchet@51787
   204
    fun should_omit_disc_binding k =
blanchet@51790
   205
      n = 1 orelse (n = 2 andalso can_rely_on_disc (3 - k));
blanchet@51790
   206
blanchet@51790
   207
    fun is_disc_binding_valid b =
blanchet@51790
   208
      not (Binding.is_empty b orelse Binding.eq_name (b, equal_binding));
blanchet@51787
   209
blanchet@51787
   210
    val standard_disc_binding = qualify false o Binding.name o prefix isN o base_name_of_ctr;
blanchet@49120
   211
blanchet@49336
   212
    val disc_bindings =
blanchet@49336
   213
      raw_disc_bindings'
blanchet@49120
   214
      |> map4 (fn k => fn m => fn ctr => fn disc =>
blanchet@51790
   215
        qualify false
blanchet@51787
   216
          (if Binding.is_empty disc then
blanchet@51790
   217
             if should_omit_disc_binding k then disc else standard_disc_binding ctr
blanchet@51790
   218
           else if Binding.eq_name (disc, equal_binding) then
blanchet@51790
   219
             if m = 0 then disc
blanchet@51790
   220
             else error "Cannot use \"=\" syntax for discriminating nonnullary constructor"
blanchet@51790
   221
           else if Binding.eq_name (disc, standard_binding) then
blanchet@51790
   222
             standard_disc_binding ctr
blanchet@49302
   223
           else
blanchet@51790
   224
             disc)) ks ms ctrs0;
blanchet@49056
   225
blanchet@51787
   226
    fun standard_sel_binding m l = Binding.name o mk_unN m l o base_name_of_ctr;
blanchet@49120
   227
blanchet@49336
   228
    val sel_bindingss =
blanchet@49336
   229
      pad_list [] n raw_sel_bindingss
blanchet@49056
   230
      |> map3 (fn ctr => fn m => map2 (fn l => fn sel =>
blanchet@49633
   231
        qualify false
blanchet@51790
   232
          (if Binding.is_empty sel orelse Binding.eq_name (sel, standard_binding) then
blanchet@51787
   233
            standard_sel_binding m l ctr
blanchet@49302
   234
          else
traytel@49434
   235
            sel)) (1 upto m) o pad_list Binding.empty m) ctrs0 ms;
blanchet@49020
   236
blanchet@49536
   237
    val casex = mk_case As B case0;
blanchet@49201
   238
    val case_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49043
   239
blanchet@49498
   240
    val (((((((xss, xss'), yss), fs), gs), [u', v']), (p, p')), names_lthy) = no_defs_lthy |>
blanchet@49364
   241
      mk_Freess' "x" ctr_Tss
blanchet@49025
   242
      ||>> mk_Freess "y" ctr_Tss
blanchet@49201
   243
      ||>> mk_Frees "f" case_Ts
blanchet@49201
   244
      ||>> mk_Frees "g" case_Ts
blanchet@49498
   245
      ||>> (apfst (map (rpair dataT)) oo Variable.variant_fixes) [data_b_name, data_b_name ^ "'"]
blanchet@49043
   246
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT;
blanchet@49043
   247
blanchet@49498
   248
    val u = Free u';
blanchet@49498
   249
    val v = Free v';
blanchet@49463
   250
    val q = Free (fst p', mk_pred1T B);
blanchet@49020
   251
blanchet@49025
   252
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
   253
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49032
   254
blanchet@49043
   255
    val xfs = map2 (curry Term.list_comb) fs xss;
blanchet@49043
   256
    val xgs = map2 (curry Term.list_comb) gs xss;
blanchet@49043
   257
blanchet@51759
   258
    val fcase = Term.list_comb (casex, fs);
blanchet@51759
   259
blanchet@51759
   260
    val ufcase = fcase $ u;
blanchet@51759
   261
    val vfcase = fcase $ v;
blanchet@51759
   262
blanchet@51759
   263
    (* TODO: Eta-expension is for compatibility with the old datatype package (but it also provides
blanchet@51759
   264
       nicer names). Consider removing. *)
blanchet@49437
   265
    val eta_fs = map2 eta_expand_arg xss xfs;
blanchet@49437
   266
    val eta_gs = map2 eta_expand_arg xss xgs;
blanchet@49043
   267
blanchet@51759
   268
    val eta_fcase = Term.list_comb (casex, eta_fs);
blanchet@51759
   269
    val eta_gcase = Term.list_comb (casex, eta_gs);
blanchet@49020
   270
blanchet@51759
   271
    val eta_ufcase = eta_fcase $ u;
blanchet@51759
   272
    val eta_vgcase = eta_gcase $ v;
blanchet@49486
   273
blanchet@49591
   274
    fun mk_uu_eq () = HOLogic.mk_eq (u, u);
blanchet@49486
   275
blanchet@49591
   276
    val uv_eq = mk_Trueprop_eq (u, v);
blanchet@49486
   277
blanchet@49486
   278
    val exist_xs_u_eq_ctrs =
blanchet@49486
   279
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (u, xctr))) xctrs xss;
blanchet@49022
   280
blanchet@51743
   281
    val unique_disc_no_def = TrueI; (*arbitrary marker*)
blanchet@51743
   282
    val alternate_disc_no_def = FalseE; (*arbitrary marker*)
blanchet@51743
   283
blanchet@49486
   284
    fun alternate_disc_lhs get_udisc k =
blanchet@49116
   285
      HOLogic.mk_not
blanchet@51790
   286
        (let val b = nth disc_bindings (k - 1) in
blanchet@51790
   287
           if is_disc_binding_valid b then get_udisc b (k - 1) else nth exist_xs_u_eq_ctrs (k - 1)
blanchet@51790
   288
         end);
blanchet@49116
   289
blanchet@49486
   290
    val (all_sels_distinct, discs, selss, udiscs, uselss, vdiscs, vselss, disc_defs, sel_defs,
blanchet@49486
   291
         sel_defss, lthy') =
blanchet@49278
   292
      if no_dests then
blanchet@49486
   293
        (true, [], [], [], [], [], [], [], [], [], no_defs_lthy)
blanchet@49278
   294
      else
blanchet@49278
   295
        let
blanchet@49463
   296
          fun disc_free b = Free (Binding.name_of b, mk_pred1T dataT);
blanchet@49025
   297
blanchet@49486
   298
          fun disc_spec b exist_xs_u_eq_ctr = mk_Trueprop_eq (disc_free b $ u, exist_xs_u_eq_ctr);
blanchet@49278
   299
blanchet@49500
   300
          fun alternate_disc k =
blanchet@49500
   301
            Term.lambda u (alternate_disc_lhs (K o rapp u o disc_free) (3 - k));
blanchet@49278
   302
blanchet@49280
   303
          fun mk_sel_case_args b proto_sels T =
blanchet@49280
   304
            map2 (fn Ts => fn k =>
blanchet@49280
   305
              (case AList.lookup (op =) proto_sels k of
blanchet@49280
   306
                NONE =>
blanchet@49364
   307
                (case AList.lookup Binding.eq_name (rev (nth sel_defaultss (k - 1))) b of
blanchet@49364
   308
                  NONE => fold_rev (Term.lambda o curry Free Name.uu) Ts (mk_undefined T)
blanchet@51380
   309
                | SOME t => t |> Type.constraint (Ts ---> T) |> Syntax.check_term no_defs_lthy)
blanchet@49280
   310
              | SOME (xs, x) => fold_rev Term.lambda xs x)) ctr_Tss ks;
blanchet@49258
   311
blanchet@49278
   312
          fun sel_spec b proto_sels =
blanchet@49278
   313
            let
blanchet@49278
   314
              val _ =
blanchet@49278
   315
                (case duplicates (op =) (map fst proto_sels) of
blanchet@49278
   316
                   k :: _ => error ("Duplicate selector name " ^ quote (Binding.name_of b) ^
blanchet@49278
   317
                     " for constructor " ^
blanchet@49278
   318
                     quote (Syntax.string_of_term no_defs_lthy (nth ctrs (k - 1))))
blanchet@49278
   319
                 | [] => ())
blanchet@49278
   320
              val T =
blanchet@49278
   321
                (case distinct (op =) (map (fastype_of o snd o snd) proto_sels) of
blanchet@49278
   322
                  [T] => T
blanchet@49278
   323
                | T :: T' :: _ => error ("Inconsistent range type for selector " ^
blanchet@49278
   324
                    quote (Binding.name_of b) ^ ": " ^ quote (Syntax.string_of_typ no_defs_lthy T) ^
blanchet@49278
   325
                    " vs. " ^ quote (Syntax.string_of_typ no_defs_lthy T')));
blanchet@49278
   326
            in
blanchet@49486
   327
              mk_Trueprop_eq (Free (Binding.name_of b, dataT --> T) $ u,
blanchet@49536
   328
                Term.list_comb (mk_case As T case0, mk_sel_case_args b proto_sels T) $ u)
blanchet@49278
   329
            end;
blanchet@49116
   330
blanchet@49336
   331
          val sel_bindings = flat sel_bindingss;
blanchet@49336
   332
          val uniq_sel_bindings = distinct Binding.eq_name sel_bindings;
blanchet@49336
   333
          val all_sels_distinct = (length uniq_sel_bindings = length sel_bindings);
blanchet@49285
   334
blanchet@49336
   335
          val sel_binding_index =
blanchet@49336
   336
            if all_sels_distinct then 1 upto length sel_bindings
blanchet@49336
   337
            else map (fn b => find_index (curry Binding.eq_name b) uniq_sel_bindings) sel_bindings;
blanchet@49285
   338
blanchet@49285
   339
          val proto_sels = flat (map3 (fn k => fn xs => map (fn x => (k, (xs, x)))) ks xss xss);
blanchet@49300
   340
          val sel_infos =
blanchet@49336
   341
            AList.group (op =) (sel_binding_index ~~ proto_sels)
blanchet@49285
   342
            |> sort (int_ord o pairself fst)
blanchet@49336
   343
            |> map snd |> curry (op ~~) uniq_sel_bindings;
blanchet@49336
   344
          val sel_bindings = map fst sel_infos;
blanchet@49258
   345
blanchet@49336
   346
          fun unflat_selss xs = unflat_lookup Binding.eq_name sel_bindings xs sel_bindingss;
blanchet@49258
   347
blanchet@49278
   348
          val (((raw_discs, raw_disc_defs), (raw_sels, raw_sel_defs)), (lthy', lthy)) =
blanchet@49278
   349
            no_defs_lthy
blanchet@51809
   350
            |> apfst split_list o fold_map3 (fn k => fn exist_xs_u_eq_ctr => fn b =>
blanchet@51790
   351
                if Binding.is_empty b then
blanchet@51790
   352
                  if n = 1 then pair (Term.lambda u (mk_uu_eq ()), unique_disc_no_def)
blanchet@51790
   353
                  else pair (alternate_disc k, alternate_disc_no_def)
blanchet@51790
   354
                else if Binding.eq_name (b, equal_binding) then
blanchet@51790
   355
                  pair (Term.lambda u exist_xs_u_eq_ctr, refl)
blanchet@51790
   356
                else
blanchet@51790
   357
                  Specification.definition (SOME (b, NONE, NoSyn),
blanchet@51790
   358
                    ((Thm.def_binding b, []), disc_spec b exist_xs_u_eq_ctr)) #>> apsnd snd)
blanchet@51809
   359
              ks exist_xs_u_eq_ctrs disc_bindings
blanchet@49278
   360
            ||>> apfst split_list o fold_map (fn (b, proto_sels) =>
blanchet@49278
   361
              Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49300
   362
                ((Thm.def_binding b, []), sel_spec b proto_sels)) #>> apsnd snd) sel_infos
blanchet@49278
   363
            ||> `Local_Theory.restore;
blanchet@49022
   364
blanchet@49278
   365
          val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   366
blanchet@49278
   367
          val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49281
   368
          val sel_defs = map (Morphism.thm phi) raw_sel_defs;
blanchet@49281
   369
          val sel_defss = unflat_selss sel_defs;
blanchet@49278
   370
blanchet@49278
   371
          val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49278
   372
          val selss0 = unflat_selss (map (Morphism.term phi) raw_sels);
blanchet@49028
   373
blanchet@49278
   374
          val discs = map (mk_disc_or_sel As) discs0;
blanchet@49278
   375
          val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49486
   376
blanchet@49500
   377
          val udiscs = map (rapp u) discs;
blanchet@49500
   378
          val uselss = map (map (rapp u)) selss;
blanchet@49486
   379
blanchet@49500
   380
          val vdiscs = map (rapp v) discs;
blanchet@49500
   381
          val vselss = map (map (rapp v)) selss;
blanchet@49278
   382
        in
blanchet@49486
   383
          (all_sels_distinct, discs, selss, udiscs, uselss, vdiscs, vselss, disc_defs, sel_defs,
blanchet@49486
   384
           sel_defss, lthy')
blanchet@49278
   385
        end;
blanchet@49025
   386
blanchet@49032
   387
    fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p);
blanchet@49029
   388
blanchet@49458
   389
    val exhaust_goal =
blanchet@49486
   390
      let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (u, xctr)]) in
blanchet@49486
   391
        fold_rev Logic.all [p, u] (mk_imp_p (map2 mk_prem xctrs xss))
blanchet@49020
   392
      end;
blanchet@49019
   393
blanchet@49484
   394
    val inject_goalss =
blanchet@49017
   395
      let
blanchet@49034
   396
        fun mk_goal _ _ [] [] = []
blanchet@49025
   397
          | mk_goal xctr yctr xs ys =
blanchet@49121
   398
            [fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr),
blanchet@49121
   399
              Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))];
blanchet@49017
   400
      in
blanchet@49034
   401
        map4 mk_goal xctrs yctrs xss yss
blanchet@49017
   402
      end;
blanchet@49017
   403
blanchet@49484
   404
    val half_distinct_goalss =
blanchet@49121
   405
      let
blanchet@49203
   406
        fun mk_goal ((xs, xc), (xs', xc')) =
blanchet@49121
   407
          fold_rev Logic.all (xs @ xs')
blanchet@49203
   408
            (HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (xc, xc'))));
blanchet@49121
   409
      in
blanchet@49585
   410
        map (map mk_goal) (mk_half_pairss (`I (xss ~~ xctrs)))
blanchet@49121
   411
      end;
blanchet@49019
   412
blanchet@49458
   413
    val cases_goal =
blanchet@49121
   414
      map3 (fn xs => fn xctr => fn xf =>
blanchet@51770
   415
        fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (fcase $ xctr, xf))) xss xctrs xfs;
blanchet@49025
   416
blanchet@49484
   417
    val goalss = [exhaust_goal] :: inject_goalss @ half_distinct_goalss @ [cases_goal];
blanchet@49019
   418
blanchet@49019
   419
    fun after_qed thmss lthy =
blanchet@49019
   420
      let
blanchet@49048
   421
        val ([exhaust_thm], (inject_thmss, (half_distinct_thmss, [case_thms]))) =
blanchet@49048
   422
          (hd thmss, apsnd (chop (n * n)) (chop n (tl thmss)));
blanchet@49019
   423
blanchet@49438
   424
        val inject_thms = flat inject_thmss;
blanchet@49438
   425
blanchet@49486
   426
        val Tinst = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As);
blanchet@49486
   427
blanchet@49486
   428
        fun inst_thm t thm =
blanchet@49486
   429
          Drule.instantiate' [] [SOME (certify lthy t)]
blanchet@49486
   430
            (Thm.instantiate (Tinst, []) (Drule.zero_var_indexes thm));
blanchet@49486
   431
blanchet@49486
   432
        val uexhaust_thm = inst_thm u exhaust_thm;
blanchet@49032
   433
blanchet@49300
   434
        val exhaust_cases = map base_name_of_ctr ctrs;
blanchet@49300
   435
blanchet@49048
   436
        val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss;
blanchet@49048
   437
blanchet@49486
   438
        val (distinct_thms, (distinct_thmsss', distinct_thmsss)) =
blanchet@49585
   439
          join_halves n half_distinct_thmss other_half_distinct_thmss ||> `transpose;
blanchet@49019
   440
blanchet@49020
   441
        val nchotomy_thm =
blanchet@49020
   442
          let
blanchet@49020
   443
            val goal =
blanchet@49486
   444
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst u', snd u',
blanchet@49486
   445
                Library.foldr1 HOLogic.mk_disj exist_xs_u_eq_ctrs));
blanchet@49020
   446
          in
wenzelm@51551
   447
            Goal.prove_sorry lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
traytel@49667
   448
            |> Thm.close_derivation
blanchet@49020
   449
          end;
blanchet@49020
   450
blanchet@49484
   451
        val (all_sel_thms, sel_thmss, disc_thmss, disc_thms, discI_thms, disc_exclude_thms,
blanchet@49594
   452
             disc_exhaust_thms, collapse_thms, expand_thms, case_conv_thms) =
blanchet@49278
   453
          if no_dests then
blanchet@49486
   454
            ([], [], [], [], [], [], [], [], [], [])
blanchet@49116
   455
          else
blanchet@49116
   456
            let
blanchet@49364
   457
              fun make_sel_thm xs' case_thm sel_def =
blanchet@49364
   458
                zero_var_indexes (Drule.gen_all (Drule.rename_bvars' (map (SOME o fst) xs')
blanchet@49364
   459
                    (Drule.forall_intr_vars (case_thm RS (sel_def RS trans)))));
blanchet@49281
   460
blanchet@49281
   461
              fun has_undefined_rhs thm =
blanchet@49281
   462
                (case snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of thm))) of
blanchet@49281
   463
                  Const (@{const_name undefined}, _) => true
blanchet@49281
   464
                | _ => false);
blanchet@49281
   465
blanchet@49364
   466
              val sel_thmss = map3 (map oo make_sel_thm) xss' case_thms sel_defss;
blanchet@49281
   467
blanchet@49281
   468
              val all_sel_thms =
blanchet@49285
   469
                (if all_sels_distinct andalso forall null sel_defaultss then
blanchet@49285
   470
                   flat sel_thmss
blanchet@49285
   471
                 else
blanchet@49364
   472
                   map_product (fn s => fn (xs', c) => make_sel_thm xs' c s) sel_defs
blanchet@49364
   473
                     (xss' ~~ case_thms))
blanchet@49285
   474
                |> filter_out has_undefined_rhs;
blanchet@49278
   475
blanchet@49278
   476
              fun mk_unique_disc_def () =
blanchet@49278
   477
                let
blanchet@49278
   478
                  val m = the_single ms;
blanchet@49591
   479
                  val goal = mk_Trueprop_eq (mk_uu_eq (), the_single exist_xs_u_eq_ctrs);
blanchet@49278
   480
                in
wenzelm@51551
   481
                  Goal.prove_sorry lthy [] [] goal (fn _ => mk_unique_disc_def_tac m uexhaust_thm)
blanchet@49692
   482
                  |> Thm.close_derivation
blanchet@49278
   483
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   484
                end;
blanchet@49278
   485
blanchet@49278
   486
              fun mk_alternate_disc_def k =
blanchet@49278
   487
                let
blanchet@49278
   488
                  val goal =
blanchet@49486
   489
                    mk_Trueprop_eq (alternate_disc_lhs (K (nth udiscs)) (3 - k),
blanchet@49486
   490
                      nth exist_xs_u_eq_ctrs (k - 1));
blanchet@49278
   491
                in
wenzelm@51551
   492
                  Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49278
   493
                    mk_alternate_disc_def_tac ctxt k (nth disc_defs (2 - k))
blanchet@49486
   494
                      (nth distinct_thms (2 - k)) uexhaust_thm)
blanchet@49692
   495
                  |> Thm.close_derivation
blanchet@49278
   496
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   497
                end;
blanchet@49028
   498
blanchet@49278
   499
              val has_alternate_disc_def =
blanchet@49278
   500
                exists (fn def => Thm.eq_thm_prop (def, alternate_disc_no_def)) disc_defs;
blanchet@49278
   501
blanchet@49278
   502
              val disc_defs' =
blanchet@49278
   503
                map2 (fn k => fn def =>
blanchet@49278
   504
                  if Thm.eq_thm_prop (def, unique_disc_no_def) then mk_unique_disc_def ()
blanchet@49278
   505
                  else if Thm.eq_thm_prop (def, alternate_disc_no_def) then mk_alternate_disc_def k
blanchet@49278
   506
                  else def) ks disc_defs;
blanchet@49278
   507
blanchet@49278
   508
              val discD_thms = map (fn def => def RS iffD1) disc_defs';
blanchet@49278
   509
              val discI_thms =
blanchet@49278
   510
                map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms
blanchet@49278
   511
                  disc_defs';
blanchet@49278
   512
              val not_discI_thms =
blanchet@49278
   513
                map2 (fn m => fn def => funpow m (fn thm => allI RS thm)
blanchet@49504
   514
                    (unfold_thms lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]})))
blanchet@49278
   515
                  ms disc_defs';
blanchet@49278
   516
blanchet@49278
   517
              val (disc_thmss', disc_thmss) =
blanchet@49278
   518
                let
blanchet@49278
   519
                  fun mk_thm discI _ [] = refl RS discI
blanchet@49278
   520
                    | mk_thm _ not_discI [distinct] = distinct RS not_discI;
blanchet@49278
   521
                  fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss;
blanchet@49278
   522
                in
blanchet@49278
   523
                  map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose
blanchet@49278
   524
                end;
blanchet@49278
   525
blanchet@51790
   526
              val disc_thms = flat (map2 (fn b => if is_disc_binding_valid b then I else K [])
blanchet@51790
   527
                disc_bindings disc_thmss);
blanchet@49028
   528
blanchet@49486
   529
              val (disc_exclude_thms, (disc_exclude_thmsss', disc_exclude_thmsss)) =
blanchet@49486
   530
                let
blanchet@49486
   531
                  fun mk_goal [] = []
blanchet@49486
   532
                    | mk_goal [((_, udisc), (_, udisc'))] =
blanchet@49486
   533
                      [Logic.all u (Logic.mk_implies (HOLogic.mk_Trueprop udisc,
blanchet@49486
   534
                         HOLogic.mk_Trueprop (HOLogic.mk_not udisc')))];
blanchet@49486
   535
traytel@49667
   536
                  fun prove tac goal =
wenzelm@51551
   537
                    Goal.prove_sorry lthy [] [] goal (K tac)
traytel@49667
   538
                    |> Thm.close_derivation;
blanchet@49486
   539
blanchet@49585
   540
                  val half_pairss = mk_half_pairss (`I (ms ~~ discD_thms ~~ udiscs));
blanchet@49486
   541
blanchet@49486
   542
                  val half_goalss = map mk_goal half_pairss;
blanchet@49486
   543
                  val half_thmss =
blanchet@49486
   544
                    map3 (fn [] => K (K []) | [goal] => fn [(((m, discD), _), _)] =>
wenzelm@51798
   545
                        fn disc_thm => [prove (mk_half_disc_exclude_tac lthy m discD disc_thm) goal])
blanchet@49486
   546
                      half_goalss half_pairss (flat disc_thmss');
blanchet@49278
   547
blanchet@49486
   548
                  val other_half_goalss = map (mk_goal o map swap) half_pairss;
blanchet@49486
   549
                  val other_half_thmss =
blanchet@49486
   550
                    map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss
blanchet@49486
   551
                      other_half_goalss;
blanchet@49486
   552
                in
blanchet@49585
   553
                  join_halves n half_thmss other_half_thmss ||> `transpose
blanchet@49486
   554
                  |>> has_alternate_disc_def ? K []
blanchet@49486
   555
                end;
blanchet@49278
   556
blanchet@49486
   557
              val disc_exhaust_thm =
blanchet@49486
   558
                let
blanchet@49486
   559
                  fun mk_prem udisc = mk_imp_p [HOLogic.mk_Trueprop udisc];
blanchet@49486
   560
                  val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem udiscs));
blanchet@49486
   561
                in
wenzelm@51551
   562
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@49486
   563
                    mk_disc_exhaust_tac n exhaust_thm discI_thms)
traytel@49667
   564
                  |> Thm.close_derivation
blanchet@49486
   565
                end;
blanchet@49028
   566
blanchet@49486
   567
              val (collapse_thms, collapse_thm_opts) =
blanchet@49486
   568
                let
blanchet@49486
   569
                  fun mk_goal ctr udisc usels =
blanchet@49486
   570
                    let
blanchet@49486
   571
                      val prem = HOLogic.mk_Trueprop udisc;
blanchet@49486
   572
                      val concl =
blanchet@49486
   573
                        mk_Trueprop_eq ((null usels ? swap) (Term.list_comb (ctr, usels), u));
blanchet@49486
   574
                    in
blanchet@49486
   575
                      if prem aconv concl then NONE
blanchet@49486
   576
                      else SOME (Logic.all u (Logic.mk_implies (prem, concl)))
blanchet@49486
   577
                    end;
blanchet@49486
   578
                  val goals = map3 mk_goal ctrs udiscs uselss;
blanchet@49486
   579
                in
blanchet@49486
   580
                  map4 (fn m => fn discD => fn sel_thms => Option.map (fn goal =>
wenzelm@51551
   581
                    Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49486
   582
                      mk_collapse_tac ctxt m discD sel_thms)
traytel@49667
   583
                    |> Thm.close_derivation
blanchet@49486
   584
                    |> perhaps (try (fn thm => refl RS thm)))) ms discD_thms sel_thmss goals
blanchet@49486
   585
                  |> `(map_filter I)
blanchet@49486
   586
                end;
blanchet@49025
   587
blanchet@49486
   588
              val expand_thms =
blanchet@49486
   589
                let
blanchet@49486
   590
                  fun mk_prems k udisc usels vdisc vsels =
blanchet@49486
   591
                    (if k = n then [] else [mk_Trueprop_eq (udisc, vdisc)]) @
blanchet@49486
   592
                    (if null usels then
blanchet@49486
   593
                       []
blanchet@49486
   594
                     else
blanchet@49486
   595
                       [Logic.list_implies
blanchet@49486
   596
                          (if n = 1 then [] else map HOLogic.mk_Trueprop [udisc, vdisc],
blanchet@49486
   597
                             HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@49486
   598
                               (map2 (curry HOLogic.mk_eq) usels vsels)))]);
blanchet@49486
   599
blanchet@49591
   600
                  val goal =
blanchet@49591
   601
                    Library.foldr Logic.list_implies
blanchet@49591
   602
                      (map5 mk_prems ks udiscs uselss vdiscs vselss, uv_eq);
blanchet@49486
   603
                  val uncollapse_thms =
blanchet@51742
   604
                    map2 (fn NONE => K asm_rl | SOME thm => fn [] => thm | _ => thm RS sym)
blanchet@51742
   605
                      collapse_thm_opts uselss;
blanchet@49486
   606
                in
wenzelm@51551
   607
                  [Goal.prove_sorry lthy [] [] goal (fn _ =>
wenzelm@51717
   608
                     mk_expand_tac lthy n ms (inst_thm u disc_exhaust_thm)
blanchet@49486
   609
                       (inst_thm v disc_exhaust_thm) uncollapse_thms disc_exclude_thmsss
blanchet@49486
   610
                       disc_exclude_thmsss')]
blanchet@49692
   611
                  |> map Thm.close_derivation
blanchet@49486
   612
                  |> Proof_Context.export names_lthy lthy
blanchet@49486
   613
                end;
blanchet@49278
   614
blanchet@49594
   615
              val case_conv_thms =
blanchet@49486
   616
                let
blanchet@49486
   617
                  fun mk_body f usels = Term.list_comb (f, usels);
blanchet@51770
   618
                  val goal = mk_Trueprop_eq (ufcase, mk_IfN B udiscs (map2 mk_body fs uselss));
blanchet@49486
   619
                in
wenzelm@51551
   620
                  [Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49594
   621
                     mk_case_conv_tac ctxt n uexhaust_thm case_thms disc_thmss' sel_thmss)]
blanchet@49692
   622
                  |> map Thm.close_derivation
blanchet@49486
   623
                  |> Proof_Context.export names_lthy lthy
blanchet@49486
   624
                end;
blanchet@49116
   625
            in
blanchet@49484
   626
              (all_sel_thms, sel_thmss, disc_thmss, disc_thms, discI_thms, disc_exclude_thms,
blanchet@49594
   627
               [disc_exhaust_thm], collapse_thms, expand_thms, case_conv_thms)
blanchet@49116
   628
            end;
blanchet@49025
   629
blanchet@49033
   630
        val (case_cong_thm, weak_case_cong_thm) =
blanchet@49032
   631
          let
blanchet@51763
   632
            fun mk_prem xctr xs xf xg =
blanchet@49486
   633
              fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (v, xctr),
blanchet@51763
   634
                mk_Trueprop_eq (xf, xg)));
blanchet@49033
   635
blanchet@49032
   636
            val goal =
blanchet@51763
   637
              Logic.list_implies (uv_eq :: map4 mk_prem xctrs xss xfs xgs,
blanchet@51759
   638
                 mk_Trueprop_eq (eta_ufcase, eta_vgcase));
blanchet@49591
   639
            val weak_goal = Logic.mk_implies (uv_eq, mk_Trueprop_eq (ufcase, vfcase));
blanchet@49032
   640
          in
wenzelm@51717
   641
            (Goal.prove_sorry lthy [] [] goal (fn _ => mk_case_cong_tac lthy uexhaust_thm case_thms),
wenzelm@51551
   642
             Goal.prove_sorry lthy [] [] weak_goal (K (etac arg_cong 1)))
blanchet@49692
   643
            |> pairself (Thm.close_derivation #> singleton (Proof_Context.export names_lthy lthy))
blanchet@49032
   644
          end;
blanchet@49025
   645
blanchet@49044
   646
        val (split_thm, split_asm_thm) =
blanchet@49043
   647
          let
blanchet@49044
   648
            fun mk_conjunct xctr xs f_xs =
blanchet@49486
   649
              list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (u, xctr), q $ f_xs));
blanchet@49044
   650
            fun mk_disjunct xctr xs f_xs =
blanchet@49486
   651
              list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr),
blanchet@49044
   652
                HOLogic.mk_not (q $ f_xs)));
blanchet@49044
   653
blanchet@51770
   654
            val lhs = q $ ufcase;
blanchet@49044
   655
blanchet@49043
   656
            val goal =
blanchet@49044
   657
              mk_Trueprop_eq (lhs, Library.foldr1 HOLogic.mk_conj (map3 mk_conjunct xctrs xss xfs));
blanchet@49458
   658
            val asm_goal =
blanchet@49044
   659
              mk_Trueprop_eq (lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj
blanchet@49044
   660
                (map3 mk_disjunct xctrs xss xfs)));
blanchet@49044
   661
blanchet@49044
   662
            val split_thm =
wenzelm@51551
   663
              Goal.prove_sorry lthy [] [] goal
wenzelm@51717
   664
                (fn _ => mk_split_tac lthy uexhaust_thm case_thms inject_thmss distinct_thmsss)
blanchet@49692
   665
              |> Thm.close_derivation
blanchet@49692
   666
              |> singleton (Proof_Context.export names_lthy lthy);
blanchet@49044
   667
            val split_asm_thm =
wenzelm@51551
   668
              Goal.prove_sorry lthy [] [] asm_goal (fn {context = ctxt, ...} =>
blanchet@49044
   669
                mk_split_asm_tac ctxt split_thm)
blanchet@49692
   670
              |> Thm.close_derivation
blanchet@49692
   671
              |> singleton (Proof_Context.export names_lthy lthy);
blanchet@49043
   672
          in
blanchet@49044
   673
            (split_thm, split_asm_thm)
blanchet@49043
   674
          end;
blanchet@49025
   675
blanchet@49437
   676
        val exhaust_case_names_attr = Attrib.internal (K (Rule_Cases.case_names exhaust_cases));
blanchet@49300
   677
        val cases_type_attr = Attrib.internal (K (Induct.cases_type dataT_name));
blanchet@49300
   678
blanchet@49052
   679
        val notes =
blanchet@49594
   680
          [(caseN, case_thms, simp_attrs),
blanchet@49594
   681
           (case_congN, [case_cong_thm], []),
blanchet@49594
   682
           (case_convN, case_conv_thms, []),
blanchet@49300
   683
           (collapseN, collapse_thms, simp_attrs),
blanchet@49300
   684
           (discsN, disc_thms, simp_attrs),
blanchet@49300
   685
           (disc_excludeN, disc_exclude_thms, []),
blanchet@49300
   686
           (disc_exhaustN, disc_exhaust_thms, [exhaust_case_names_attr]),
blanchet@49300
   687
           (distinctN, distinct_thms, simp_attrs @ induct_simp_attrs),
blanchet@49300
   688
           (exhaustN, [exhaust_thm], [exhaust_case_names_attr, cases_type_attr]),
blanchet@49486
   689
           (expandN, expand_thms, []),
blanchet@49438
   690
           (injectN, inject_thms, iff_attrs @ induct_simp_attrs),
blanchet@49300
   691
           (nchotomyN, [nchotomy_thm], []),
blanchet@49300
   692
           (selsN, all_sel_thms, simp_attrs),
blanchet@49300
   693
           (splitN, [split_thm], []),
blanchet@49300
   694
           (split_asmN, [split_asm_thm], []),
blanchet@49633
   695
           (splitsN, [split_thm, split_asm_thm], []),
blanchet@49300
   696
           (weak_case_cong_thmsN, [weak_case_cong_thm], cong_attrs)]
blanchet@49300
   697
          |> filter_out (null o #2)
blanchet@49300
   698
          |> map (fn (thmN, thms, attrs) =>
blanchet@49633
   699
            ((qualify true (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49300
   700
blanchet@49300
   701
        val notes' =
blanchet@49300
   702
          [(map (fn th => th RS notE) distinct_thms, safe_elim_attrs)]
blanchet@49300
   703
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@49019
   704
      in
blanchet@51839
   705
        ({ctrs = ctrs, discs = discs, selss = selss, exhaust = exhaust_thm, injects = inject_thms,
blanchet@51819
   706
          distincts = distinct_thms, case_thms = case_thms, disc_thmss = disc_thmss,
blanchet@51819
   707
          discIs = discI_thms, sel_thmss = sel_thmss},
blanchet@51819
   708
         lthy
blanchet@51819
   709
         |> not rep_compat ?
blanchet@51819
   710
            (Local_Theory.declaration {syntax = false, pervasive = true}
traytel@51697
   711
               (fn phi => Case_Translation.register
blanchet@51819
   712
                  (Morphism.term phi casex) (map (Morphism.term phi) ctrs)))
blanchet@51819
   713
         |> Local_Theory.notes (notes' @ notes) |> snd)
blanchet@49019
   714
      end;
blanchet@49017
   715
  in
blanchet@49121
   716
    (goalss, after_qed, lthy')
blanchet@49017
   717
  end;
blanchet@49017
   718
blanchet@51781
   719
fun wrap_free_constructors tacss = (fn (goalss, after_qed, lthy) =>
wenzelm@51551
   720
  map2 (map2 (Thm.close_derivation oo Goal.prove_sorry lthy [] [])) goalss tacss
blanchet@51781
   721
  |> (fn thms => after_qed thms lthy)) oo prepare_wrap_free_constructors (K I);
blanchet@49280
   722
blanchet@51781
   723
val wrap_free_constructors_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49297
   724
  Proof.theorem NONE (snd oo after_qed) (map (map (rpair [])) goalss) lthy) oo
blanchet@51781
   725
  prepare_wrap_free_constructors Syntax.read_term;
blanchet@49297
   726
blanchet@49280
   727
fun parse_bracket_list parser = @{keyword "["} |-- Parse.list parser --|  @{keyword "]"};
blanchet@49111
   728
blanchet@51790
   729
val parse_bindings = parse_bracket_list parse_binding;
blanchet@49280
   730
val parse_bindingss = parse_bracket_list parse_bindings;
blanchet@49280
   731
blanchet@51790
   732
val parse_bound_term = (parse_binding --| @{keyword ":"}) -- Parse.term;
blanchet@49280
   733
val parse_bound_terms = parse_bracket_list parse_bound_term;
blanchet@49280
   734
val parse_bound_termss = parse_bracket_list parse_bound_terms;
blanchet@49017
   735
blanchet@49278
   736
val parse_wrap_options =
blanchet@49633
   737
  Scan.optional (@{keyword "("} |-- Parse.list1 ((@{keyword "no_dests"} >> K (true, false)) ||
blanchet@49633
   738
      (@{keyword "rep_compat"} >> K (false, true))) --| @{keyword ")"}
blanchet@49633
   739
    >> (pairself (exists I) o split_list)) (false, false);
blanchet@49278
   740
blanchet@49017
   741
val _ =
blanchet@51781
   742
  Outer_Syntax.local_theory_to_proof @{command_spec "wrap_free_constructors"}
blanchet@51797
   743
    "wrap an existing freely generated type's constructors"
blanchet@49278
   744
    ((parse_wrap_options -- (@{keyword "["} |-- Parse.list Parse.term --| @{keyword "]"}) --
blanchet@49280
   745
      Parse.term -- Scan.optional (parse_bindings -- Scan.optional (parse_bindingss --
blanchet@49280
   746
        Scan.optional parse_bound_termss []) ([], [])) ([], ([], [])))
blanchet@51781
   747
     >> wrap_free_constructors_cmd);
blanchet@49017
   748
blanchet@49017
   749
end;