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