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