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