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