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