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