src/HOL/Tools/ctr_sugar.ML
author blanchet
Thu Dec 05 14:11:45 2013 +0100 (2013-12-05)
changeset 54634 366297517091
parent 54626 8a5e82425e55
child 54635 30666a281ae3
permissions -rw-r--r--
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet@54397
     1
(*  Title:      HOL/Tools/ctr_sugar.ML
blanchet@49017
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@54397
     3
    Copyright   2012, 2013
blanchet@49017
     4
blanchet@51797
     5
Wrapping existing freely generated type's constructors.
blanchet@49017
     6
*)
blanchet@49017
     7
blanchet@54006
     8
signature CTR_SUGAR =
blanchet@49017
     9
sig
blanchet@51840
    10
  type ctr_sugar =
blanchet@51839
    11
    {ctrs: term list,
blanchet@52375
    12
     casex: term,
blanchet@51839
    13
     discs: term list,
blanchet@51819
    14
     selss: term list list,
blanchet@51819
    15
     exhaust: thm,
blanchet@52375
    16
     nchotomy: thm,
blanchet@51819
    17
     injects: thm list,
blanchet@51819
    18
     distincts: thm list,
blanchet@51819
    19
     case_thms: thm list,
blanchet@52375
    20
     case_cong: thm,
blanchet@52375
    21
     weak_case_cong: thm,
blanchet@52375
    22
     split: thm,
blanchet@52375
    23
     split_asm: thm,
blanchet@51819
    24
     disc_thmss: thm list list,
blanchet@51819
    25
     discIs: thm list,
blanchet@53475
    26
     sel_thmss: thm list list,
blanchet@53475
    27
     disc_exhausts: thm list,
blanchet@53916
    28
     sel_exhausts: thm list,
blanchet@53475
    29
     collapses: thm list,
blanchet@53475
    30
     expands: thm list,
blanchet@53917
    31
     sel_splits: thm list,
blanchet@53917
    32
     sel_split_asms: thm list,
blanchet@54491
    33
     case_eq_ifs: thm list};
blanchet@51809
    34
blanchet@51840
    35
  val morph_ctr_sugar: morphism -> ctr_sugar -> ctr_sugar
blanchet@54256
    36
  val transfer_ctr_sugar: Proof.context -> ctr_sugar -> ctr_sugar
blanchet@53867
    37
  val ctr_sugar_of: Proof.context -> string -> ctr_sugar option
blanchet@53906
    38
  val ctr_sugars_of: Proof.context -> ctr_sugar list
blanchet@54403
    39
  val ctr_sugar_of_case: Proof.context -> string -> ctr_sugar option
blanchet@54399
    40
  val register_ctr_sugar: string -> ctr_sugar -> local_theory -> local_theory
blanchet@54400
    41
  val register_ctr_sugar_global: string -> ctr_sugar -> theory -> theory
blanchet@51823
    42
blanchet@49633
    43
  val rep_compat_prefix: string
blanchet@49633
    44
blanchet@49585
    45
  val mk_half_pairss: 'a list * 'a list -> ('a * 'a) list list
blanchet@49585
    46
  val join_halves: int -> 'a list list -> 'a list list -> 'a list * 'a list list list
blanchet@49585
    47
blanchet@49203
    48
  val mk_ctr: typ list -> term -> term
blanchet@53864
    49
  val mk_case: typ list -> typ -> term -> term
blanchet@49484
    50
  val mk_disc_or_sel: typ list -> term -> term
blanchet@49622
    51
  val name_of_ctr: term -> string
blanchet@51777
    52
  val name_of_disc: term -> string
blanchet@53888
    53
  val dest_ctr: Proof.context -> string -> term -> term * term list
blanchet@53870
    54
  val dest_case: Proof.context -> string -> typ list -> term -> (term list * term list) option
blanchet@49585
    55
blanchet@51781
    56
  val wrap_free_constructors: ({prems: thm list, context: Proof.context} -> tactic) list list ->
blanchet@54626
    57
    (((bool * (bool * bool)) * term list) * binding) *
blanchet@49280
    58
      (binding list * (binding list list * (binding * term) list list)) -> local_theory ->
blanchet@51840
    59
    ctr_sugar * local_theory
blanchet@54626
    60
  val parse_wrap_free_constructors_options: (bool * (bool * bool)) parser
blanchet@49286
    61
  val parse_bound_term: (binding * string) parser
blanchet@49017
    62
end;
blanchet@49017
    63
blanchet@54006
    64
structure Ctr_Sugar : CTR_SUGAR =
blanchet@49017
    65
struct
blanchet@49017
    66
blanchet@54008
    67
open Ctr_Sugar_Util
blanchet@54006
    68
open Ctr_Sugar_Tactics
blanchet@54615
    69
open Ctr_Sugar_Code
blanchet@49017
    70
blanchet@51840
    71
type ctr_sugar =
blanchet@51839
    72
  {ctrs: term list,
blanchet@52375
    73
   casex: term,
blanchet@51839
    74
   discs: term list,
blanchet@51819
    75
   selss: term list list,
blanchet@51819
    76
   exhaust: thm,
blanchet@52375
    77
   nchotomy: thm,
blanchet@51819
    78
   injects: thm list,
blanchet@51819
    79
   distincts: thm list,
blanchet@51819
    80
   case_thms: thm list,
blanchet@52375
    81
   case_cong: thm,
blanchet@52375
    82
   weak_case_cong: thm,
blanchet@52375
    83
   split: thm,
blanchet@52375
    84
   split_asm: thm,
blanchet@51819
    85
   disc_thmss: thm list list,
blanchet@51819
    86
   discIs: thm list,
blanchet@53475
    87
   sel_thmss: thm list list,
blanchet@53475
    88
   disc_exhausts: thm list,
blanchet@53916
    89
   sel_exhausts: thm list,
blanchet@53475
    90
   collapses: thm list,
blanchet@53475
    91
   expands: thm list,
blanchet@53917
    92
   sel_splits: thm list,
blanchet@53917
    93
   sel_split_asms: thm list,
blanchet@54491
    94
   case_eq_ifs: thm list};
blanchet@51809
    95
blanchet@53906
    96
fun eq_ctr_sugar ({ctrs = ctrs1, casex = case1, discs = discs1, selss = selss1, ...} : ctr_sugar,
blanchet@53906
    97
    {ctrs = ctrs2, casex = case2, discs = discs2, selss = selss2, ...} : ctr_sugar) =
blanchet@53906
    98
  ctrs1 = ctrs2 andalso case1 = case2 andalso discs1 = discs2 andalso selss1 = selss2;
blanchet@53906
    99
blanchet@52375
   100
fun morph_ctr_sugar phi {ctrs, casex, discs, selss, exhaust, nchotomy, injects, distincts,
blanchet@53475
   101
    case_thms, case_cong, weak_case_cong, split, split_asm, disc_thmss, discIs, sel_thmss,
blanchet@54491
   102
    disc_exhausts, sel_exhausts, collapses, expands, sel_splits, sel_split_asms, case_eq_ifs} =
blanchet@51839
   103
  {ctrs = map (Morphism.term phi) ctrs,
blanchet@52375
   104
   casex = Morphism.term phi casex,
blanchet@51839
   105
   discs = map (Morphism.term phi) discs,
blanchet@51823
   106
   selss = map (map (Morphism.term phi)) selss,
blanchet@51823
   107
   exhaust = Morphism.thm phi exhaust,
blanchet@52375
   108
   nchotomy = Morphism.thm phi nchotomy,
blanchet@51823
   109
   injects = map (Morphism.thm phi) injects,
blanchet@51823
   110
   distincts = map (Morphism.thm phi) distincts,
blanchet@51823
   111
   case_thms = map (Morphism.thm phi) case_thms,
blanchet@52375
   112
   case_cong = Morphism.thm phi case_cong,
blanchet@52375
   113
   weak_case_cong = Morphism.thm phi weak_case_cong,
blanchet@52375
   114
   split = Morphism.thm phi split,
blanchet@52375
   115
   split_asm = Morphism.thm phi split_asm,
blanchet@51823
   116
   disc_thmss = map (map (Morphism.thm phi)) disc_thmss,
blanchet@51823
   117
   discIs = map (Morphism.thm phi) discIs,
blanchet@53475
   118
   sel_thmss = map (map (Morphism.thm phi)) sel_thmss,
blanchet@53475
   119
   disc_exhausts = map (Morphism.thm phi) disc_exhausts,
blanchet@53916
   120
   sel_exhausts = map (Morphism.thm phi) sel_exhausts,
blanchet@53475
   121
   collapses = map (Morphism.thm phi) collapses,
blanchet@53475
   122
   expands = map (Morphism.thm phi) expands,
blanchet@53917
   123
   sel_splits = map (Morphism.thm phi) sel_splits,
blanchet@53917
   124
   sel_split_asms = map (Morphism.thm phi) sel_split_asms,
blanchet@54491
   125
   case_eq_ifs = map (Morphism.thm phi) case_eq_ifs};
blanchet@51823
   126
blanchet@53906
   127
val transfer_ctr_sugar =
blanchet@53906
   128
  morph_ctr_sugar o Morphism.thm_morphism o Thm.transfer o Proof_Context.theory_of;
blanchet@53867
   129
blanchet@53867
   130
structure Data = Generic_Data
blanchet@53867
   131
(
blanchet@53867
   132
  type T = ctr_sugar Symtab.table;
blanchet@53867
   133
  val empty = Symtab.empty;
blanchet@53867
   134
  val extend = I;
blanchet@53867
   135
  val merge = Symtab.merge eq_ctr_sugar;
blanchet@53867
   136
);
blanchet@53867
   137
blanchet@53867
   138
fun ctr_sugar_of ctxt =
blanchet@53867
   139
  Symtab.lookup (Data.get (Context.Proof ctxt))
blanchet@53906
   140
  #> Option.map (transfer_ctr_sugar ctxt);
blanchet@53906
   141
blanchet@53906
   142
fun ctr_sugars_of ctxt =
blanchet@53906
   143
  Symtab.fold (cons o transfer_ctr_sugar ctxt o snd) (Data.get (Context.Proof ctxt)) [];
blanchet@53867
   144
blanchet@54403
   145
fun ctr_sugar_of_case ctxt s =
blanchet@54403
   146
  find_first (fn {casex = Const (s', _), ...} => s' = s | _ => false) (ctr_sugars_of ctxt);
blanchet@54403
   147
blanchet@53867
   148
fun register_ctr_sugar key ctr_sugar =
blanchet@54285
   149
  Local_Theory.declaration {syntax = false, pervasive = true}
blanchet@53867
   150
    (fn phi => Data.map (Symtab.default (key, morph_ctr_sugar phi ctr_sugar)));
blanchet@53867
   151
blanchet@54400
   152
fun register_ctr_sugar_global key ctr_sugar =
blanchet@54400
   153
  Context.theory_map (Data.map (Symtab.default (key, ctr_sugar)));
blanchet@54400
   154
blanchet@49633
   155
val rep_compat_prefix = "new";
blanchet@49633
   156
blanchet@49223
   157
val isN = "is_";
blanchet@49223
   158
val unN = "un_";
blanchet@49223
   159
fun mk_unN 1 1 suf = unN ^ suf
blanchet@49223
   160
  | mk_unN _ l suf = unN ^ suf ^ string_of_int l;
blanchet@49046
   161
blanchet@49594
   162
val caseN = "case";
blanchet@49054
   163
val case_congN = "case_cong";
blanchet@54491
   164
val case_eq_ifN = "case_eq_if";
blanchet@49118
   165
val collapseN = "collapse";
blanchet@49122
   166
val disc_excludeN = "disc_exclude";
blanchet@49054
   167
val disc_exhaustN = "disc_exhaust";
blanchet@53694
   168
val discN = "disc";
blanchet@53700
   169
val discIN = "discI";
blanchet@49054
   170
val distinctN = "distinct";
blanchet@49075
   171
val exhaustN = "exhaust";
blanchet@49486
   172
val expandN = "expand";
blanchet@49075
   173
val injectN = "inject";
blanchet@49075
   174
val nchotomyN = "nchotomy";
blanchet@53694
   175
val selN = "sel";
blanchet@53916
   176
val sel_exhaustN = "sel_exhaust";
blanchet@53917
   177
val sel_splitN = "sel_split";
blanchet@53917
   178
val sel_split_asmN = "sel_split_asm";
blanchet@49054
   179
val splitN = "split";
blanchet@49633
   180
val splitsN = "splits";
blanchet@49054
   181
val split_asmN = "split_asm";
blanchet@49054
   182
val weak_case_cong_thmsN = "weak_case_cong";
blanchet@49019
   183
blanchet@53700
   184
val cong_attrs = @{attributes [cong]};
blanchet@53836
   185
val dest_attrs = @{attributes [dest]};
blanchet@53700
   186
val safe_elim_attrs = @{attributes [elim!]};
blanchet@53700
   187
val iff_attrs = @{attributes [iff]};
blanchet@54145
   188
val inductsimp_attrs = @{attributes [induct_simp]};
blanchet@54145
   189
val nitpicksimp_attrs = @{attributes [nitpick_simp]};
blanchet@49300
   190
val simp_attrs = @{attributes [simp]};
blanchet@54151
   191
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs;
blanchet@54151
   192
val code_nitpicksimp_simp_attrs = code_nitpicksimp_attrs @ simp_attrs;
blanchet@49046
   193
blanchet@53040
   194
fun unflat_lookup eq xs ys = map (fn xs' => permute_like eq xs xs' ys);
blanchet@49258
   195
blanchet@49585
   196
fun mk_half_pairss' _ ([], []) = []
blanchet@49591
   197
  | mk_half_pairss' indent (x :: xs, _ :: ys) =
blanchet@49585
   198
    indent @ fold_rev (cons o single o pair x) ys (mk_half_pairss' ([] :: indent) (xs, ys));
blanchet@49486
   199
blanchet@49585
   200
fun mk_half_pairss p = mk_half_pairss' [[]] p;
blanchet@49027
   201
blanchet@49486
   202
fun join_halves n half_xss other_half_xss =
blanchet@49486
   203
  let
blanchet@49486
   204
    val xsss =
blanchet@49486
   205
      map2 (map2 append) (Library.chop_groups n half_xss)
blanchet@49486
   206
        (transpose (Library.chop_groups n other_half_xss))
blanchet@49668
   207
    val xs = splice (flat half_xss) (flat other_half_xss);
blanchet@49585
   208
  in (xs, xsss) end;
blanchet@49027
   209
blanchet@49280
   210
fun mk_undefined T = Const (@{const_name undefined}, T);
blanchet@49055
   211
blanchet@49500
   212
fun mk_ctr Ts t =
blanchet@49500
   213
  let val Type (_, Ts0) = body_type (fastype_of t) in
blanchet@54435
   214
    subst_nonatomic_types (Ts0 ~~ Ts) t
blanchet@49203
   215
  end;
blanchet@49203
   216
blanchet@49536
   217
fun mk_case Ts T t =
blanchet@49536
   218
  let val (Type (_, Ts0), body) = strip_type (fastype_of t) |>> List.last in
blanchet@54435
   219
    subst_nonatomic_types ((body, T) :: (Ts0 ~~ Ts)) t
blanchet@49536
   220
  end;
blanchet@49536
   221
blanchet@53864
   222
fun mk_disc_or_sel Ts t =
blanchet@54435
   223
  subst_nonatomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
blanchet@53864
   224
blanchet@51777
   225
fun name_of_const what t =
blanchet@51777
   226
  (case head_of t of
blanchet@49622
   227
    Const (s, _) => s
blanchet@49622
   228
  | Free (s, _) => s
blanchet@51777
   229
  | _ => error ("Cannot extract name of " ^ what));
blanchet@51777
   230
blanchet@51777
   231
val name_of_ctr = name_of_const "constructor";
blanchet@51777
   232
blanchet@51777
   233
val notN = "not_";
blanchet@51777
   234
val eqN = "eq_";
blanchet@51777
   235
val neqN = "neq_";
blanchet@51777
   236
blanchet@51777
   237
fun name_of_disc t =
blanchet@51777
   238
  (case head_of t of
blanchet@51777
   239
    Abs (_, _, @{const Not} $ (t' $ Bound 0)) =>
blanchet@51777
   240
    Long_Name.map_base_name (prefix notN) (name_of_disc t')
blanchet@51777
   241
  | Abs (_, _, Const (@{const_name HOL.eq}, _) $ Bound 0 $ t') =>
blanchet@51777
   242
    Long_Name.map_base_name (prefix eqN) (name_of_disc t')
blanchet@51777
   243
  | Abs (_, _, @{const Not} $ (Const (@{const_name HOL.eq}, _) $ Bound 0 $ t')) =>
blanchet@51777
   244
    Long_Name.map_base_name (prefix neqN) (name_of_disc t')
blanchet@51777
   245
  | t' => name_of_const "destructor" t');
blanchet@49622
   246
blanchet@49622
   247
val base_name_of_ctr = Long_Name.base_name o name_of_ctr;
blanchet@49046
   248
blanchet@53888
   249
fun dest_ctr ctxt s t =
blanchet@53888
   250
  let
blanchet@53888
   251
    val (f, args) = Term.strip_comb t;
blanchet@53888
   252
  in
blanchet@53888
   253
    (case ctr_sugar_of ctxt s of
blanchet@53888
   254
      SOME {ctrs, ...} =>
blanchet@53888
   255
      (case find_first (can (fo_match ctxt f)) ctrs of
blanchet@53888
   256
        SOME f' => (f', args)
blanchet@53888
   257
      | NONE => raise Fail "dest_ctr")
blanchet@53888
   258
    | NONE => raise Fail "dest_ctr")
blanchet@53888
   259
  end;
blanchet@53888
   260
blanchet@53870
   261
fun dest_case ctxt s Ts t =
blanchet@53870
   262
  (case Term.strip_comb t of
blanchet@53870
   263
    (Const (c, _), args as _ :: _) =>
blanchet@53870
   264
    (case ctr_sugar_of ctxt s of
blanchet@53870
   265
      SOME {casex = Const (case_name, _), discs = discs0, selss = selss0, ...} =>
blanchet@53870
   266
      if case_name = c then
blanchet@53924
   267
        let val n = length discs0 in
blanchet@53924
   268
          if n < length args then
blanchet@53924
   269
            let
blanchet@53924
   270
              val (branches, obj :: leftovers) = chop n args;
blanchet@53924
   271
              val discs = map (mk_disc_or_sel Ts) discs0;
blanchet@53924
   272
              val selss = map (map (mk_disc_or_sel Ts)) selss0;
blanchet@53924
   273
              val conds = map (rapp obj) discs;
blanchet@53924
   274
              val branch_argss = map (fn sels => map (rapp obj) sels @ leftovers) selss;
blanchet@53924
   275
              val branches' = map2 (curry Term.betapplys) branches branch_argss;
blanchet@53924
   276
            in
blanchet@53924
   277
              SOME (conds, branches')
blanchet@53924
   278
            end
blanchet@53924
   279
          else
blanchet@53924
   280
            NONE
blanchet@53870
   281
        end
blanchet@53870
   282
      else
blanchet@53870
   283
        NONE
blanchet@53870
   284
    | _ => NONE)
blanchet@53870
   285
  | _ => NONE);
blanchet@53870
   286
blanchet@49437
   287
fun eta_expand_arg xs f_xs = fold_rev Term.lambda xs f_xs;
blanchet@49437
   288
blanchet@54626
   289
fun prepare_wrap_free_constructors prep_term ((((no_discs_sels, (no_code, rep_compat)), raw_ctrs),
blanchet@52968
   290
    raw_case_binding), (raw_disc_bindings, (raw_sel_bindingss, raw_sel_defaultss))) no_defs_lthy =
blanchet@49017
   291
  let
blanchet@49019
   292
    (* TODO: sanity checks on arguments *)
blanchet@49025
   293
blanchet@49280
   294
    val n = length raw_ctrs;
blanchet@49054
   295
    val ks = 1 upto n;
blanchet@49054
   296
blanchet@49121
   297
    val _ = if n > 0 then () else error "No constructors specified";
blanchet@49121
   298
blanchet@49280
   299
    val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs;
blanchet@49280
   300
    val sel_defaultss =
blanchet@49280
   301
      pad_list [] n (map (map (apsnd (prep_term no_defs_lthy))) raw_sel_defaultss);
blanchet@49280
   302
blanchet@53908
   303
    val Type (fcT_name, As0) = body_type (fastype_of (hd ctrs0));
blanchet@53908
   304
    val fc_b_name = Long_Name.base_name fcT_name;
blanchet@53908
   305
    val fc_b = Binding.name fc_b_name;
blanchet@49055
   306
blanchet@49633
   307
    fun qualify mandatory =
blanchet@53908
   308
      Binding.qualify mandatory fc_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix);
blanchet@49633
   309
blanchet@54386
   310
    fun dest_TFree_or_TVar (TFree sS) = sS
blanchet@53268
   311
      | dest_TFree_or_TVar (TVar ((s, _), S)) = (s, S)
blanchet@53268
   312
      | dest_TFree_or_TVar _ = error "Invalid type argument";
blanchet@52965
   313
blanchet@53268
   314
    val (unsorted_As, B) =
blanchet@49055
   315
      no_defs_lthy
blanchet@53268
   316
      |> variant_tfrees (map (fst o dest_TFree_or_TVar) As0)
blanchet@49055
   317
      ||> the_single o fst o mk_TFrees 1;
blanchet@49055
   318
blanchet@53268
   319
    val As = map2 (resort_tfree o snd o dest_TFree_or_TVar) As0 unsorted_As;
blanchet@53268
   320
blanchet@53908
   321
    val fcT = Type (fcT_name, As);
blanchet@49055
   322
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49055
   323
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49055
   324
blanchet@49055
   325
    val ms = map length ctr_Tss;
blanchet@49055
   326
blanchet@51790
   327
    val raw_disc_bindings' = pad_list Binding.empty n raw_disc_bindings;
blanchet@49120
   328
blanchet@53925
   329
    fun can_definitely_rely_on_disc k = not (Binding.is_empty (nth raw_disc_bindings' (k - 1)));
blanchet@51790
   330
    fun can_rely_on_disc k =
blanchet@51790
   331
      can_definitely_rely_on_disc k orelse (k = 1 andalso not (can_definitely_rely_on_disc 2));
blanchet@53925
   332
    fun should_omit_disc_binding k = n = 1 orelse (n = 2 andalso can_rely_on_disc (3 - k));
blanchet@51790
   333
blanchet@51790
   334
    fun is_disc_binding_valid b =
blanchet@51790
   335
      not (Binding.is_empty b orelse Binding.eq_name (b, equal_binding));
blanchet@51787
   336
blanchet@52322
   337
    val standard_disc_binding = Binding.name o prefix isN o base_name_of_ctr;
blanchet@49120
   338
blanchet@49336
   339
    val disc_bindings =
blanchet@49336
   340
      raw_disc_bindings'
blanchet@49120
   341
      |> map4 (fn k => fn m => fn ctr => fn disc =>
blanchet@51790
   342
        qualify false
blanchet@51787
   343
          (if Binding.is_empty disc then
blanchet@51790
   344
             if should_omit_disc_binding k then disc else standard_disc_binding ctr
blanchet@51790
   345
           else if Binding.eq_name (disc, equal_binding) then
blanchet@51790
   346
             if m = 0 then disc
blanchet@51790
   347
             else error "Cannot use \"=\" syntax for discriminating nonnullary constructor"
blanchet@51790
   348
           else if Binding.eq_name (disc, standard_binding) then
blanchet@51790
   349
             standard_disc_binding ctr
blanchet@49302
   350
           else
blanchet@51790
   351
             disc)) ks ms ctrs0;
blanchet@49056
   352
blanchet@51787
   353
    fun standard_sel_binding m l = Binding.name o mk_unN m l o base_name_of_ctr;
blanchet@49120
   354
blanchet@49336
   355
    val sel_bindingss =
blanchet@49336
   356
      pad_list [] n raw_sel_bindingss
blanchet@49056
   357
      |> map3 (fn ctr => fn m => map2 (fn l => fn sel =>
blanchet@49633
   358
        qualify false
blanchet@51790
   359
          (if Binding.is_empty sel orelse Binding.eq_name (sel, standard_binding) then
blanchet@51787
   360
            standard_sel_binding m l ctr
blanchet@49302
   361
          else
traytel@49434
   362
            sel)) (1 upto m) o pad_list Binding.empty m) ctrs0 ms;
blanchet@49020
   363
blanchet@49201
   364
    val case_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49043
   365
blanchet@52968
   366
    val ((((((((xss, xss'), yss), fs), gs), [u', v']), [w]), (p, p')), names_lthy) = no_defs_lthy |>
blanchet@49364
   367
      mk_Freess' "x" ctr_Tss
blanchet@49025
   368
      ||>> mk_Freess "y" ctr_Tss
blanchet@49201
   369
      ||>> mk_Frees "f" case_Ts
blanchet@49201
   370
      ||>> mk_Frees "g" case_Ts
blanchet@53908
   371
      ||>> (apfst (map (rpair fcT)) oo Variable.variant_fixes) [fc_b_name, fc_b_name ^ "'"]
blanchet@52968
   372
      ||>> mk_Frees "z" [B]
blanchet@49043
   373
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT;
blanchet@49043
   374
blanchet@49498
   375
    val u = Free u';
blanchet@49498
   376
    val v = Free v';
blanchet@49463
   377
    val q = Free (fst p', mk_pred1T B);
blanchet@49020
   378
blanchet@49025
   379
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
   380
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49032
   381
blanchet@49043
   382
    val xfs = map2 (curry Term.list_comb) fs xss;
blanchet@49043
   383
    val xgs = map2 (curry Term.list_comb) gs xss;
blanchet@49043
   384
blanchet@52968
   385
    (* TODO: Eta-expension is for compatibility with the old datatype package (but it also provides
blanchet@52968
   386
       nicer names). Consider removing. *)
blanchet@52968
   387
    val eta_fs = map2 eta_expand_arg xss xfs;
blanchet@52968
   388
    val eta_gs = map2 eta_expand_arg xss xgs;
blanchet@52968
   389
blanchet@52968
   390
    val case_binding =
blanchet@52968
   391
      qualify false
blanchet@52968
   392
        (if Binding.is_empty raw_case_binding orelse
blanchet@52968
   393
            Binding.eq_name (raw_case_binding, standard_binding) then
blanchet@54493
   394
           Binding.prefix_name (caseN ^ "_") fc_b
blanchet@52968
   395
         else
blanchet@52968
   396
           raw_case_binding);
blanchet@52968
   397
blanchet@52968
   398
    fun mk_case_disj xctr xf xs =
blanchet@52968
   399
      list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr), HOLogic.mk_eq (w, xf)));
blanchet@52968
   400
blanchet@53925
   401
    val case_rhs = fold_rev (fold_rev Term.lambda) [fs, [u]]
blanchet@53925
   402
      (Const (@{const_name The}, (B --> HOLogic.boolT) --> B) $
blanchet@53925
   403
         Term.lambda w (Library.foldr1 HOLogic.mk_disj (map3 mk_case_disj xctrs xfs xss)));
blanchet@52968
   404
blanchet@52968
   405
    val ((raw_case, (_, raw_case_def)), (lthy', lthy)) = no_defs_lthy
blanchet@54155
   406
      |> Local_Theory.define ((case_binding, NoSyn),
blanchet@54155
   407
        ((Binding.conceal (Thm.def_binding case_binding), []), case_rhs))
blanchet@52968
   408
      ||> `Local_Theory.restore;
blanchet@52968
   409
blanchet@52968
   410
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet@52968
   411
blanchet@52968
   412
    val case_def = Morphism.thm phi raw_case_def;
blanchet@52968
   413
blanchet@52968
   414
    val case0 = Morphism.term phi raw_case;
blanchet@52968
   415
    val casex = mk_case As B case0;
blanchet@52968
   416
blanchet@51759
   417
    val fcase = Term.list_comb (casex, fs);
blanchet@51759
   418
blanchet@51759
   419
    val ufcase = fcase $ u;
blanchet@51759
   420
    val vfcase = fcase $ v;
blanchet@51759
   421
blanchet@51759
   422
    val eta_fcase = Term.list_comb (casex, eta_fs);
blanchet@51759
   423
    val eta_gcase = Term.list_comb (casex, eta_gs);
blanchet@49020
   424
blanchet@51759
   425
    val eta_ufcase = eta_fcase $ u;
blanchet@51759
   426
    val eta_vgcase = eta_gcase $ v;
blanchet@49486
   427
blanchet@49591
   428
    fun mk_uu_eq () = HOLogic.mk_eq (u, u);
blanchet@49486
   429
blanchet@49591
   430
    val uv_eq = mk_Trueprop_eq (u, v);
blanchet@49486
   431
blanchet@49486
   432
    val exist_xs_u_eq_ctrs =
blanchet@49486
   433
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (u, xctr))) xctrs xss;
blanchet@49022
   434
blanchet@51743
   435
    val unique_disc_no_def = TrueI; (*arbitrary marker*)
blanchet@51743
   436
    val alternate_disc_no_def = FalseE; (*arbitrary marker*)
blanchet@51743
   437
blanchet@49486
   438
    fun alternate_disc_lhs get_udisc k =
blanchet@49116
   439
      HOLogic.mk_not
blanchet@51790
   440
        (let val b = nth disc_bindings (k - 1) in
blanchet@51790
   441
           if is_disc_binding_valid b then get_udisc b (k - 1) else nth exist_xs_u_eq_ctrs (k - 1)
blanchet@51790
   442
         end);
blanchet@49116
   443
blanchet@53917
   444
    val (all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy') =
blanchet@52969
   445
      if no_discs_sels then
blanchet@53917
   446
        (true, [], [], [], [], [], lthy)
blanchet@49278
   447
      else
blanchet@49278
   448
        let
blanchet@53908
   449
          fun disc_free b = Free (Binding.name_of b, mk_pred1T fcT);
blanchet@49025
   450
blanchet@54634
   451
          fun disc_spec b exist_xs_u_eq_ctr = mk_Trueprop_eq (disc_free b $ u, exist_xs_u_eq_ctr);
blanchet@54634
   452
blanchet@49500
   453
          fun alternate_disc k =
blanchet@49500
   454
            Term.lambda u (alternate_disc_lhs (K o rapp u o disc_free) (3 - k));
blanchet@49278
   455
blanchet@49280
   456
          fun mk_sel_case_args b proto_sels T =
blanchet@49280
   457
            map2 (fn Ts => fn k =>
blanchet@49280
   458
              (case AList.lookup (op =) proto_sels k of
blanchet@49280
   459
                NONE =>
blanchet@49364
   460
                (case AList.lookup Binding.eq_name (rev (nth sel_defaultss (k - 1))) b of
blanchet@49364
   461
                  NONE => fold_rev (Term.lambda o curry Free Name.uu) Ts (mk_undefined T)
blanchet@52968
   462
                | SOME t => t |> Type.constraint (Ts ---> T) |> Syntax.check_term lthy)
blanchet@49280
   463
              | SOME (xs, x) => fold_rev Term.lambda xs x)) ctr_Tss ks;
blanchet@49258
   464
blanchet@54634
   465
          fun sel_spec b proto_sels =
blanchet@49278
   466
            let
blanchet@49278
   467
              val _ =
blanchet@49278
   468
                (case duplicates (op =) (map fst proto_sels) of
blanchet@49278
   469
                   k :: _ => error ("Duplicate selector name " ^ quote (Binding.name_of b) ^
blanchet@49278
   470
                     " for constructor " ^
blanchet@52968
   471
                     quote (Syntax.string_of_term lthy (nth ctrs (k - 1))))
blanchet@49278
   472
                 | [] => ())
blanchet@49278
   473
              val T =
blanchet@49278
   474
                (case distinct (op =) (map (fastype_of o snd o snd) proto_sels) of
blanchet@49278
   475
                  [T] => T
blanchet@49278
   476
                | T :: T' :: _ => error ("Inconsistent range type for selector " ^
blanchet@52968
   477
                    quote (Binding.name_of b) ^ ": " ^ quote (Syntax.string_of_typ lthy T) ^ " vs. "
blanchet@52968
   478
                    ^ quote (Syntax.string_of_typ lthy T')));
blanchet@49278
   479
            in
blanchet@54634
   480
              mk_Trueprop_eq (Free (Binding.name_of b, fcT --> T) $ u,
blanchet@54634
   481
                Term.list_comb (mk_case As T case0, mk_sel_case_args b proto_sels T) $ u)
blanchet@49278
   482
            end;
blanchet@49116
   483
blanchet@49336
   484
          val sel_bindings = flat sel_bindingss;
blanchet@49336
   485
          val uniq_sel_bindings = distinct Binding.eq_name sel_bindings;
blanchet@49336
   486
          val all_sels_distinct = (length uniq_sel_bindings = length sel_bindings);
blanchet@49285
   487
blanchet@49336
   488
          val sel_binding_index =
blanchet@49336
   489
            if all_sels_distinct then 1 upto length sel_bindings
blanchet@49336
   490
            else map (fn b => find_index (curry Binding.eq_name b) uniq_sel_bindings) sel_bindings;
blanchet@49285
   491
blanchet@49285
   492
          val proto_sels = flat (map3 (fn k => fn xs => map (fn x => (k, (xs, x)))) ks xss xss);
blanchet@49300
   493
          val sel_infos =
blanchet@49336
   494
            AList.group (op =) (sel_binding_index ~~ proto_sels)
blanchet@49285
   495
            |> sort (int_ord o pairself fst)
blanchet@49336
   496
            |> map snd |> curry (op ~~) uniq_sel_bindings;
blanchet@49336
   497
          val sel_bindings = map fst sel_infos;
blanchet@49258
   498
blanchet@49336
   499
          fun unflat_selss xs = unflat_lookup Binding.eq_name sel_bindings xs sel_bindingss;
blanchet@49258
   500
blanchet@49278
   501
          val (((raw_discs, raw_disc_defs), (raw_sels, raw_sel_defs)), (lthy', lthy)) =
blanchet@52968
   502
            lthy
blanchet@51809
   503
            |> apfst split_list o fold_map3 (fn k => fn exist_xs_u_eq_ctr => fn b =>
blanchet@54634
   504
                if Binding.is_empty b then
blanchet@54634
   505
                  if n = 1 then pair (Term.lambda u (mk_uu_eq ()), unique_disc_no_def)
blanchet@54634
   506
                  else pair (alternate_disc k, alternate_disc_no_def)
blanchet@54634
   507
                else if Binding.eq_name (b, equal_binding) then
blanchet@54634
   508
                  pair (Term.lambda u exist_xs_u_eq_ctr, refl)
blanchet@54634
   509
                else
blanchet@54634
   510
                  Specification.definition (SOME (b, NONE, NoSyn),
blanchet@54634
   511
                    ((Thm.def_binding b, []), disc_spec b exist_xs_u_eq_ctr)) #>> apsnd snd)
blanchet@54634
   512
              ks exist_xs_u_eq_ctrs disc_bindings
blanchet@49278
   513
            ||>> apfst split_list o fold_map (fn (b, proto_sels) =>
blanchet@54634
   514
              Specification.definition (SOME (b, NONE, NoSyn),
blanchet@54634
   515
                ((Thm.def_binding b, []), sel_spec b proto_sels)) #>> apsnd snd) sel_infos
blanchet@49278
   516
            ||> `Local_Theory.restore;
blanchet@49022
   517
blanchet@49278
   518
          val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   519
blanchet@49278
   520
          val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49281
   521
          val sel_defs = map (Morphism.thm phi) raw_sel_defs;
blanchet@49281
   522
          val sel_defss = unflat_selss sel_defs;
blanchet@49278
   523
blanchet@49278
   524
          val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49278
   525
          val selss0 = unflat_selss (map (Morphism.term phi) raw_sels);
blanchet@49028
   526
blanchet@49278
   527
          val discs = map (mk_disc_or_sel As) discs0;
blanchet@49278
   528
          val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49278
   529
        in
blanchet@53917
   530
          (all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy')
blanchet@49278
   531
        end;
blanchet@49025
   532
blanchet@49032
   533
    fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p);
blanchet@49029
   534
blanchet@49458
   535
    val exhaust_goal =
blanchet@49486
   536
      let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (u, xctr)]) in
blanchet@49486
   537
        fold_rev Logic.all [p, u] (mk_imp_p (map2 mk_prem xctrs xss))
blanchet@49020
   538
      end;
blanchet@49019
   539
blanchet@49484
   540
    val inject_goalss =
blanchet@49017
   541
      let
blanchet@49034
   542
        fun mk_goal _ _ [] [] = []
blanchet@49025
   543
          | mk_goal xctr yctr xs ys =
blanchet@49121
   544
            [fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr),
blanchet@49121
   545
              Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))];
blanchet@49017
   546
      in
blanchet@49034
   547
        map4 mk_goal xctrs yctrs xss yss
blanchet@49017
   548
      end;
blanchet@49017
   549
blanchet@49484
   550
    val half_distinct_goalss =
blanchet@49121
   551
      let
blanchet@49203
   552
        fun mk_goal ((xs, xc), (xs', xc')) =
blanchet@49121
   553
          fold_rev Logic.all (xs @ xs')
blanchet@49203
   554
            (HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (xc, xc'))));
blanchet@49121
   555
      in
blanchet@49585
   556
        map (map mk_goal) (mk_half_pairss (`I (xss ~~ xctrs)))
blanchet@49121
   557
      end;
blanchet@49019
   558
blanchet@52968
   559
    val goalss = [exhaust_goal] :: inject_goalss @ half_distinct_goalss;
blanchet@49019
   560
blanchet@49019
   561
    fun after_qed thmss lthy =
blanchet@49019
   562
      let
blanchet@52968
   563
        val ([exhaust_thm], (inject_thmss, half_distinct_thmss)) = (hd thmss, chop n (tl thmss));
blanchet@49019
   564
blanchet@49438
   565
        val inject_thms = flat inject_thmss;
blanchet@49438
   566
blanchet@53210
   567
        val rho_As = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As);
blanchet@49486
   568
blanchet@49486
   569
        fun inst_thm t thm =
blanchet@49486
   570
          Drule.instantiate' [] [SOME (certify lthy t)]
blanchet@53210
   571
            (Thm.instantiate (rho_As, []) (Drule.zero_var_indexes thm));
blanchet@49486
   572
blanchet@49486
   573
        val uexhaust_thm = inst_thm u exhaust_thm;
blanchet@49032
   574
blanchet@49300
   575
        val exhaust_cases = map base_name_of_ctr ctrs;
blanchet@49300
   576
blanchet@49048
   577
        val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss;
blanchet@49048
   578
blanchet@49486
   579
        val (distinct_thms, (distinct_thmsss', distinct_thmsss)) =
blanchet@49585
   580
          join_halves n half_distinct_thmss other_half_distinct_thmss ||> `transpose;
blanchet@49019
   581
blanchet@49020
   582
        val nchotomy_thm =
blanchet@49020
   583
          let
blanchet@49020
   584
            val goal =
blanchet@49486
   585
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst u', snd u',
blanchet@49486
   586
                Library.foldr1 HOLogic.mk_disj exist_xs_u_eq_ctrs));
blanchet@49020
   587
          in
wenzelm@51551
   588
            Goal.prove_sorry lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
traytel@49667
   589
            |> Thm.close_derivation
blanchet@49020
   590
          end;
blanchet@49020
   591
blanchet@52968
   592
        val case_thms =
blanchet@52968
   593
          let
blanchet@52968
   594
            val goals =
blanchet@52968
   595
              map3 (fn xctr => fn xf => fn xs =>
blanchet@52968
   596
                fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (fcase $ xctr, xf))) xctrs xfs xss;
blanchet@52968
   597
          in
blanchet@52968
   598
            map4 (fn k => fn goal => fn injects => fn distinctss =>
blanchet@52968
   599
                Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@52968
   600
                  mk_case_tac ctxt n k case_def injects distinctss)
blanchet@52968
   601
                |> Thm.close_derivation)
blanchet@52968
   602
              ks goals inject_thmss distinct_thmsss
blanchet@52968
   603
          end;
blanchet@52968
   604
blanchet@53917
   605
        val (case_cong_thm, weak_case_cong_thm) =
blanchet@53917
   606
          let
blanchet@53917
   607
            fun mk_prem xctr xs xf xg =
blanchet@53917
   608
              fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (v, xctr),
blanchet@53917
   609
                mk_Trueprop_eq (xf, xg)));
blanchet@53917
   610
blanchet@53917
   611
            val goal =
blanchet@53917
   612
              Logic.list_implies (uv_eq :: map4 mk_prem xctrs xss xfs xgs,
blanchet@53917
   613
                 mk_Trueprop_eq (eta_ufcase, eta_vgcase));
blanchet@53917
   614
            val weak_goal = Logic.mk_implies (uv_eq, mk_Trueprop_eq (ufcase, vfcase));
blanchet@53917
   615
          in
blanchet@53917
   616
            (Goal.prove_sorry lthy [] [] goal (fn _ => mk_case_cong_tac lthy uexhaust_thm case_thms),
blanchet@53917
   617
             Goal.prove_sorry lthy [] [] weak_goal (K (etac arg_cong 1)))
blanchet@53917
   618
            |> pairself (Thm.close_derivation #> singleton (Proof_Context.export names_lthy lthy))
blanchet@53917
   619
          end;
blanchet@53917
   620
blanchet@53917
   621
        val split_lhs = q $ ufcase;
blanchet@53917
   622
blanchet@53917
   623
        fun mk_split_conjunct xctr xs f_xs =
blanchet@53917
   624
          list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (u, xctr), q $ f_xs));
blanchet@53917
   625
        fun mk_split_disjunct xctr xs f_xs =
blanchet@53917
   626
          list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr),
blanchet@53917
   627
            HOLogic.mk_not (q $ f_xs)));
blanchet@53917
   628
blanchet@53917
   629
        fun mk_split_goal xctrs xss xfs =
blanchet@53917
   630
          mk_Trueprop_eq (split_lhs, Library.foldr1 HOLogic.mk_conj
blanchet@53917
   631
            (map3 mk_split_conjunct xctrs xss xfs));
blanchet@53917
   632
        fun mk_split_asm_goal xctrs xss xfs =
blanchet@53917
   633
          mk_Trueprop_eq (split_lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj
blanchet@53917
   634
            (map3 mk_split_disjunct xctrs xss xfs)));
blanchet@53917
   635
blanchet@53917
   636
        fun prove_split selss goal =
blanchet@53917
   637
          Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@53917
   638
            mk_split_tac lthy uexhaust_thm case_thms selss inject_thmss distinct_thmsss)
blanchet@53917
   639
          |> Thm.close_derivation
blanchet@53917
   640
          |> singleton (Proof_Context.export names_lthy lthy);
blanchet@53917
   641
blanchet@53917
   642
        fun prove_split_asm asm_goal split_thm =
blanchet@53917
   643
          Goal.prove_sorry lthy [] [] asm_goal (fn {context = ctxt, ...} =>
blanchet@53917
   644
            mk_split_asm_tac ctxt split_thm)
blanchet@53917
   645
          |> Thm.close_derivation
blanchet@53917
   646
          |> singleton (Proof_Context.export names_lthy lthy);
blanchet@53917
   647
blanchet@53917
   648
        val (split_thm, split_asm_thm) =
blanchet@53917
   649
          let
blanchet@53917
   650
            val goal = mk_split_goal xctrs xss xfs;
blanchet@53917
   651
            val asm_goal = mk_split_asm_goal xctrs xss xfs;
blanchet@53917
   652
blanchet@53917
   653
            val thm = prove_split (replicate n []) goal;
blanchet@53917
   654
            val asm_thm = prove_split_asm asm_goal thm;
blanchet@53917
   655
          in
blanchet@53917
   656
            (thm, asm_thm)
blanchet@53917
   657
          end;
blanchet@53917
   658
blanchet@53704
   659
        val (all_sel_thms, sel_thmss, disc_thmss, nontriv_disc_thms, discI_thms, nontriv_discI_thms,
blanchet@53916
   660
             disc_exclude_thms, disc_exhaust_thms, sel_exhaust_thms, all_collapse_thms,
blanchet@54491
   661
             safe_collapse_thms, expand_thms, sel_split_thms, sel_split_asm_thms, case_eq_if_thms) =
blanchet@52969
   662
          if no_discs_sels then
blanchet@53917
   663
            ([], [], [], [], [], [], [], [], [], [], [], [], [], [], [])
blanchet@49116
   664
          else
blanchet@49116
   665
            let
blanchet@53917
   666
              val udiscs = map (rapp u) discs;
blanchet@53917
   667
              val uselss = map (map (rapp u)) selss;
blanchet@53917
   668
              val usel_ctrs = map2 (curry Term.list_comb) ctrs uselss;
blanchet@53917
   669
              val usel_fs = map2 (curry Term.list_comb) fs uselss;
blanchet@53917
   670
blanchet@53917
   671
              val vdiscs = map (rapp v) discs;
blanchet@53917
   672
              val vselss = map (map (rapp v)) selss;
blanchet@53917
   673
blanchet@49364
   674
              fun make_sel_thm xs' case_thm sel_def =
blanchet@49364
   675
                zero_var_indexes (Drule.gen_all (Drule.rename_bvars' (map (SOME o fst) xs')
blanchet@54634
   676
                    (Drule.forall_intr_vars (case_thm RS (sel_def RS trans)))));
blanchet@49281
   677
blanchet@53704
   678
              val sel_thmss = map3 (map oo make_sel_thm) xss' case_thms sel_defss;
blanchet@53704
   679
blanchet@49281
   680
              fun has_undefined_rhs thm =
blanchet@49281
   681
                (case snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of thm))) of
blanchet@49281
   682
                  Const (@{const_name undefined}, _) => true
blanchet@49281
   683
                | _ => false);
blanchet@49281
   684
blanchet@49281
   685
              val all_sel_thms =
blanchet@49285
   686
                (if all_sels_distinct andalso forall null sel_defaultss then
blanchet@49285
   687
                   flat sel_thmss
blanchet@49285
   688
                 else
blanchet@49364
   689
                   map_product (fn s => fn (xs', c) => make_sel_thm xs' c s) sel_defs
blanchet@49364
   690
                     (xss' ~~ case_thms))
blanchet@49285
   691
                |> filter_out has_undefined_rhs;
blanchet@49278
   692
blanchet@49278
   693
              fun mk_unique_disc_def () =
blanchet@49278
   694
                let
blanchet@49278
   695
                  val m = the_single ms;
blanchet@49591
   696
                  val goal = mk_Trueprop_eq (mk_uu_eq (), the_single exist_xs_u_eq_ctrs);
blanchet@49278
   697
                in
wenzelm@51551
   698
                  Goal.prove_sorry lthy [] [] goal (fn _ => mk_unique_disc_def_tac m uexhaust_thm)
blanchet@49692
   699
                  |> Thm.close_derivation
blanchet@49278
   700
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   701
                end;
blanchet@49278
   702
blanchet@49278
   703
              fun mk_alternate_disc_def k =
blanchet@49278
   704
                let
blanchet@49278
   705
                  val goal =
blanchet@49486
   706
                    mk_Trueprop_eq (alternate_disc_lhs (K (nth udiscs)) (3 - k),
blanchet@49486
   707
                      nth exist_xs_u_eq_ctrs (k - 1));
blanchet@49278
   708
                in
wenzelm@51551
   709
                  Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@54634
   710
                    mk_alternate_disc_def_tac ctxt k (nth disc_defs (2 - k))
blanchet@49486
   711
                      (nth distinct_thms (2 - k)) uexhaust_thm)
blanchet@49692
   712
                  |> Thm.close_derivation
blanchet@49278
   713
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   714
                end;
blanchet@49028
   715
blanchet@49278
   716
              val has_alternate_disc_def =
blanchet@49278
   717
                exists (fn def => Thm.eq_thm_prop (def, alternate_disc_no_def)) disc_defs;
blanchet@49278
   718
blanchet@49278
   719
              val disc_defs' =
blanchet@49278
   720
                map2 (fn k => fn def =>
blanchet@49278
   721
                  if Thm.eq_thm_prop (def, unique_disc_no_def) then mk_unique_disc_def ()
blanchet@49278
   722
                  else if Thm.eq_thm_prop (def, alternate_disc_no_def) then mk_alternate_disc_def k
blanchet@54634
   723
                  else def) ks disc_defs;
blanchet@49278
   724
blanchet@49278
   725
              val discD_thms = map (fn def => def RS iffD1) disc_defs';
blanchet@49278
   726
              val discI_thms =
blanchet@49278
   727
                map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms
blanchet@49278
   728
                  disc_defs';
blanchet@49278
   729
              val not_discI_thms =
blanchet@49278
   730
                map2 (fn m => fn def => funpow m (fn thm => allI RS thm)
blanchet@49504
   731
                    (unfold_thms lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]})))
blanchet@49278
   732
                  ms disc_defs';
blanchet@49278
   733
blanchet@49278
   734
              val (disc_thmss', disc_thmss) =
blanchet@49278
   735
                let
blanchet@49278
   736
                  fun mk_thm discI _ [] = refl RS discI
blanchet@49278
   737
                    | mk_thm _ not_discI [distinct] = distinct RS not_discI;
blanchet@49278
   738
                  fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss;
blanchet@49278
   739
                in
blanchet@49278
   740
                  map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose
blanchet@49278
   741
                end;
blanchet@49278
   742
blanchet@53704
   743
              val nontriv_disc_thms =
blanchet@53704
   744
                flat (map2 (fn b => if is_disc_binding_valid b then I else K [])
blanchet@53704
   745
                  disc_bindings disc_thmss);
blanchet@53704
   746
blanchet@53704
   747
              fun is_discI_boring b =
blanchet@53704
   748
                (n = 1 andalso Binding.is_empty b) orelse Binding.eq_name (b, equal_binding);
blanchet@53704
   749
blanchet@53704
   750
              val nontriv_discI_thms =
blanchet@53704
   751
                flat (map2 (fn b => if is_discI_boring b then K [] else single) disc_bindings
blanchet@53704
   752
                  discI_thms);
blanchet@49028
   753
blanchet@49486
   754
              val (disc_exclude_thms, (disc_exclude_thmsss', disc_exclude_thmsss)) =
blanchet@49486
   755
                let
blanchet@49486
   756
                  fun mk_goal [] = []
blanchet@49486
   757
                    | mk_goal [((_, udisc), (_, udisc'))] =
blanchet@49486
   758
                      [Logic.all u (Logic.mk_implies (HOLogic.mk_Trueprop udisc,
blanchet@49486
   759
                         HOLogic.mk_Trueprop (HOLogic.mk_not udisc')))];
blanchet@49486
   760
traytel@49667
   761
                  fun prove tac goal =
wenzelm@51551
   762
                    Goal.prove_sorry lthy [] [] goal (K tac)
traytel@49667
   763
                    |> Thm.close_derivation;
blanchet@49486
   764
blanchet@49585
   765
                  val half_pairss = mk_half_pairss (`I (ms ~~ discD_thms ~~ udiscs));
blanchet@49486
   766
blanchet@49486
   767
                  val half_goalss = map mk_goal half_pairss;
blanchet@49486
   768
                  val half_thmss =
blanchet@49486
   769
                    map3 (fn [] => K (K []) | [goal] => fn [(((m, discD), _), _)] =>
wenzelm@51798
   770
                        fn disc_thm => [prove (mk_half_disc_exclude_tac lthy m discD disc_thm) goal])
blanchet@49486
   771
                      half_goalss half_pairss (flat disc_thmss');
blanchet@49278
   772
blanchet@49486
   773
                  val other_half_goalss = map (mk_goal o map swap) half_pairss;
blanchet@49486
   774
                  val other_half_thmss =
blanchet@49486
   775
                    map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss
blanchet@49486
   776
                      other_half_goalss;
blanchet@49486
   777
                in
blanchet@49585
   778
                  join_halves n half_thmss other_half_thmss ||> `transpose
blanchet@49486
   779
                  |>> has_alternate_disc_def ? K []
blanchet@49486
   780
                end;
blanchet@49278
   781
blanchet@49486
   782
              val disc_exhaust_thm =
blanchet@49486
   783
                let
blanchet@49486
   784
                  fun mk_prem udisc = mk_imp_p [HOLogic.mk_Trueprop udisc];
blanchet@49486
   785
                  val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem udiscs));
blanchet@49486
   786
                in
wenzelm@51551
   787
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@49486
   788
                    mk_disc_exhaust_tac n exhaust_thm discI_thms)
traytel@49667
   789
                  |> Thm.close_derivation
blanchet@49486
   790
                end;
blanchet@49028
   791
blanchet@53740
   792
              val (safe_collapse_thms, all_collapse_thms) =
blanchet@49486
   793
                let
blanchet@54008
   794
                  fun mk_goal m udisc usel_ctr =
blanchet@49486
   795
                    let
blanchet@49486
   796
                      val prem = HOLogic.mk_Trueprop udisc;
blanchet@53916
   797
                      val concl = mk_Trueprop_eq ((usel_ctr, u) |> m = 0 ? swap);
blanchet@49486
   798
                    in
blanchet@53740
   799
                      (prem aconv concl, Logic.all u (Logic.mk_implies (prem, concl)))
blanchet@49486
   800
                    end;
blanchet@54008
   801
                  val (trivs, goals) = map3 mk_goal ms udiscs usel_ctrs |> split_list;
blanchet@53740
   802
                  val thms =
blanchet@53740
   803
                    map5 (fn m => fn discD => fn sel_thms => fn triv => fn goal =>
blanchet@53740
   804
                        Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@53740
   805
                          mk_collapse_tac ctxt m discD sel_thms ORELSE HEADGOAL atac)
blanchet@53740
   806
                        |> Thm.close_derivation
blanchet@53740
   807
                        |> not triv ? perhaps (try (fn thm => refl RS thm)))
blanchet@53740
   808
                      ms discD_thms sel_thmss trivs goals;
blanchet@49486
   809
                in
blanchet@53740
   810
                  (map_filter (fn (true, _) => NONE | (false, thm) => SOME thm) (trivs ~~ thms),
blanchet@53740
   811
                   thms)
blanchet@49486
   812
                end;
blanchet@49025
   813
blanchet@53916
   814
              val swapped_all_collapse_thms =
blanchet@53916
   815
                map2 (fn m => fn thm => if m = 0 then thm else thm RS sym) ms all_collapse_thms;
blanchet@53916
   816
blanchet@53916
   817
              val sel_exhaust_thm =
blanchet@53916
   818
                let
blanchet@53916
   819
                  fun mk_prem usel_ctr = mk_imp_p [mk_Trueprop_eq (u, usel_ctr)];
blanchet@53916
   820
                  val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem usel_ctrs));
blanchet@53916
   821
                in
blanchet@53916
   822
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@53916
   823
                    mk_sel_exhaust_tac n disc_exhaust_thm swapped_all_collapse_thms)
blanchet@53916
   824
                  |> Thm.close_derivation
blanchet@53916
   825
                end;
blanchet@53916
   826
blanchet@53919
   827
              val expand_thm =
blanchet@49486
   828
                let
blanchet@49486
   829
                  fun mk_prems k udisc usels vdisc vsels =
blanchet@49486
   830
                    (if k = n then [] else [mk_Trueprop_eq (udisc, vdisc)]) @
blanchet@49486
   831
                    (if null usels then
blanchet@49486
   832
                       []
blanchet@49486
   833
                     else
blanchet@49486
   834
                       [Logic.list_implies
blanchet@49486
   835
                          (if n = 1 then [] else map HOLogic.mk_Trueprop [udisc, vdisc],
blanchet@49486
   836
                             HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@49486
   837
                               (map2 (curry HOLogic.mk_eq) usels vsels)))]);
blanchet@49486
   838
blanchet@49591
   839
                  val goal =
blanchet@49591
   840
                    Library.foldr Logic.list_implies
blanchet@49591
   841
                      (map5 mk_prems ks udiscs uselss vdiscs vselss, uv_eq);
blanchet@49486
   842
                  val uncollapse_thms =
blanchet@53740
   843
                    map2 (fn thm => fn [] => thm | _ => thm RS sym) all_collapse_thms uselss;
blanchet@49486
   844
                in
blanchet@53919
   845
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@53919
   846
                    mk_expand_tac lthy n ms (inst_thm u disc_exhaust_thm)
blanchet@53919
   847
                      (inst_thm v disc_exhaust_thm) uncollapse_thms disc_exclude_thmsss
blanchet@53919
   848
                      disc_exclude_thmsss')
blanchet@53919
   849
                  |> Thm.close_derivation
blanchet@53919
   850
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49486
   851
                end;
blanchet@49278
   852
blanchet@53917
   853
              val (sel_split_thm, sel_split_asm_thm) =
blanchet@53917
   854
                let
blanchet@53917
   855
                  val zss = map (K []) xss;
blanchet@53917
   856
                  val goal = mk_split_goal usel_ctrs zss usel_fs;
blanchet@53917
   857
                  val asm_goal = mk_split_asm_goal usel_ctrs zss usel_fs;
blanchet@53917
   858
blanchet@53917
   859
                  val thm = prove_split sel_thmss goal;
blanchet@53917
   860
                  val asm_thm = prove_split_asm asm_goal thm;
blanchet@53917
   861
                in
blanchet@53917
   862
                  (thm, asm_thm)
blanchet@53917
   863
                end;
blanchet@53917
   864
blanchet@54491
   865
              val case_eq_if_thm =
blanchet@49486
   866
                let
blanchet@53917
   867
                  val goal = mk_Trueprop_eq (ufcase, mk_IfN B udiscs usel_fs);
blanchet@49486
   868
                in
blanchet@53919
   869
                  Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@54491
   870
                    mk_case_eq_if_tac ctxt n uexhaust_thm case_thms disc_thmss' sel_thmss)
blanchet@53919
   871
                  |> Thm.close_derivation
blanchet@53919
   872
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49486
   873
                end;
blanchet@49116
   874
            in
blanchet@53704
   875
              (all_sel_thms, sel_thmss, disc_thmss, nontriv_disc_thms, discI_thms,
blanchet@53916
   876
               nontriv_discI_thms, disc_exclude_thms, [disc_exhaust_thm], [sel_exhaust_thm],
blanchet@53919
   877
               all_collapse_thms, safe_collapse_thms, [expand_thm], [sel_split_thm],
blanchet@54491
   878
               [sel_split_asm_thm], [case_eq_if_thm])
blanchet@49116
   879
            end;
blanchet@49025
   880
blanchet@49437
   881
        val exhaust_case_names_attr = Attrib.internal (K (Rule_Cases.case_names exhaust_cases));
blanchet@53908
   882
        val cases_type_attr = Attrib.internal (K (Induct.cases_type fcT_name));
blanchet@49300
   883
blanchet@54151
   884
        val anonymous_notes =
blanchet@54151
   885
          [(map (fn th => th RS notE) distinct_thms, safe_elim_attrs),
blanchet@54151
   886
           (map (fn th => th RS @{thm eq_False[THEN iffD2]}
blanchet@54151
   887
              handle THM _ => th RS @{thm eq_True[THEN iffD2]}) nontriv_disc_thms,
blanchet@54151
   888
            code_nitpicksimp_attrs)]
blanchet@54151
   889
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@54151
   890
blanchet@49052
   891
        val notes =
blanchet@54145
   892
          [(caseN, case_thms, code_nitpicksimp_simp_attrs),
blanchet@49594
   893
           (case_congN, [case_cong_thm], []),
blanchet@54491
   894
           (case_eq_ifN, case_eq_if_thms, []),
blanchet@53740
   895
           (collapseN, safe_collapse_thms, simp_attrs),
blanchet@53704
   896
           (discN, nontriv_disc_thms, simp_attrs),
blanchet@53700
   897
           (discIN, nontriv_discI_thms, []),
blanchet@53836
   898
           (disc_excludeN, disc_exclude_thms, dest_attrs),
blanchet@49300
   899
           (disc_exhaustN, disc_exhaust_thms, [exhaust_case_names_attr]),
blanchet@54145
   900
           (distinctN, distinct_thms, simp_attrs @ inductsimp_attrs),
blanchet@49300
   901
           (exhaustN, [exhaust_thm], [exhaust_case_names_attr, cases_type_attr]),
blanchet@49486
   902
           (expandN, expand_thms, []),
blanchet@54145
   903
           (injectN, inject_thms, iff_attrs @ inductsimp_attrs),
blanchet@49300
   904
           (nchotomyN, [nchotomy_thm], []),
blanchet@54145
   905
           (selN, all_sel_thms, code_nitpicksimp_simp_attrs),
blanchet@53916
   906
           (sel_exhaustN, sel_exhaust_thms, [exhaust_case_names_attr]),
blanchet@53917
   907
           (sel_splitN, sel_split_thms, []),
blanchet@53917
   908
           (sel_split_asmN, sel_split_asm_thms, []),
blanchet@49300
   909
           (splitN, [split_thm], []),
blanchet@49300
   910
           (split_asmN, [split_asm_thm], []),
blanchet@49633
   911
           (splitsN, [split_thm, split_asm_thm], []),
blanchet@49300
   912
           (weak_case_cong_thmsN, [weak_case_cong_thm], cong_attrs)]
blanchet@49300
   913
          |> filter_out (null o #2)
blanchet@49300
   914
          |> map (fn (thmN, thms, attrs) =>
blanchet@49633
   915
            ((qualify true (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49300
   916
blanchet@53867
   917
        val ctr_sugar =
blanchet@53867
   918
          {ctrs = ctrs, casex = casex, discs = discs, selss = selss, exhaust = exhaust_thm,
blanchet@53867
   919
           nchotomy = nchotomy_thm, injects = inject_thms, distincts = distinct_thms,
blanchet@53867
   920
           case_thms = case_thms, case_cong = case_cong_thm, weak_case_cong = weak_case_cong_thm,
blanchet@53867
   921
           split = split_thm, split_asm = split_asm_thm, disc_thmss = disc_thmss,
blanchet@53867
   922
           discIs = discI_thms, sel_thmss = sel_thmss, disc_exhausts = disc_exhaust_thms,
blanchet@53916
   923
           sel_exhausts = sel_exhaust_thms, collapses = all_collapse_thms, expands = expand_thms,
blanchet@53917
   924
           sel_splits = sel_split_thms, sel_split_asms = sel_split_asm_thms,
blanchet@54491
   925
           case_eq_ifs = case_eq_if_thms};
blanchet@49019
   926
      in
blanchet@53867
   927
        (ctr_sugar,
blanchet@51819
   928
         lthy
blanchet@51819
   929
         |> not rep_compat ?
blanchet@54615
   930
            Local_Theory.declaration {syntax = false, pervasive = true}
blanchet@54615
   931
              (fn phi => Case_Translation.register
blanchet@54615
   932
                 (Morphism.term phi casex) (map (Morphism.term phi) ctrs))
blanchet@54145
   933
         |> Local_Theory.notes (anonymous_notes @ notes) |> snd
blanchet@54615
   934
         |> register_ctr_sugar fcT_name ctr_sugar
blanchet@54626
   935
         |> (not no_code andalso null (Thm.hyps_of (hd case_thms)))
blanchet@54617
   936
           ? Local_Theory.background_theory
blanchet@54617
   937
             (add_ctr_code fcT_name As (map dest_Const ctrs) inject_thms distinct_thms case_thms))
blanchet@49019
   938
      end;
blanchet@49017
   939
  in
blanchet@49121
   940
    (goalss, after_qed, lthy')
blanchet@49017
   941
  end;
blanchet@49017
   942
blanchet@51781
   943
fun wrap_free_constructors tacss = (fn (goalss, after_qed, lthy) =>
wenzelm@51551
   944
  map2 (map2 (Thm.close_derivation oo Goal.prove_sorry lthy [] [])) goalss tacss
blanchet@51781
   945
  |> (fn thms => after_qed thms lthy)) oo prepare_wrap_free_constructors (K I);
blanchet@49280
   946
blanchet@51781
   947
val wrap_free_constructors_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49297
   948
  Proof.theorem NONE (snd oo after_qed) (map (map (rpair [])) goalss) lthy) oo
blanchet@51781
   949
  prepare_wrap_free_constructors Syntax.read_term;
blanchet@49297
   950
blanchet@49280
   951
fun parse_bracket_list parser = @{keyword "["} |-- Parse.list parser --|  @{keyword "]"};
blanchet@49111
   952
blanchet@51790
   953
val parse_bindings = parse_bracket_list parse_binding;
blanchet@49280
   954
val parse_bindingss = parse_bracket_list parse_bindings;
blanchet@49280
   955
blanchet@51790
   956
val parse_bound_term = (parse_binding --| @{keyword ":"}) -- Parse.term;
blanchet@49280
   957
val parse_bound_terms = parse_bracket_list parse_bound_term;
blanchet@49280
   958
val parse_bound_termss = parse_bracket_list parse_bound_terms;
blanchet@49017
   959
blanchet@52823
   960
val parse_wrap_free_constructors_options =
blanchet@54626
   961
  Scan.optional (@{keyword "("} |-- Parse.list1
blanchet@54626
   962
        (Parse.reserved "no_discs_sels" >> K 0 || Parse.reserved "no_code" >> K 1 ||
blanchet@54626
   963
         Parse.reserved "rep_compat" >> K 2) --| @{keyword ")"}
blanchet@54626
   964
      >> (fn js => (member (op =) js 0, (member (op =) js 1, member (op =) js 2))))
blanchet@54626
   965
    (false, (false, false));
blanchet@49278
   966
blanchet@49017
   967
val _ =
blanchet@51781
   968
  Outer_Syntax.local_theory_to_proof @{command_spec "wrap_free_constructors"}
blanchet@51797
   969
    "wrap an existing freely generated type's constructors"
blanchet@52823
   970
    ((parse_wrap_free_constructors_options -- (@{keyword "["} |-- Parse.list Parse.term --|
blanchet@52823
   971
        @{keyword "]"}) --
blanchet@52968
   972
      parse_binding -- Scan.optional (parse_bindings -- Scan.optional (parse_bindingss --
blanchet@49280
   973
        Scan.optional parse_bound_termss []) ([], [])) ([], ([], [])))
blanchet@51781
   974
     >> wrap_free_constructors_cmd);
blanchet@49017
   975
blanchet@49017
   976
end;