src/HOL/Codatatype/Tools/bnf_wrap.ML
author blanchet
Wed Sep 12 00:20:37 2012 +0200 (2012-09-12)
changeset 49300 c707df2e2083
parent 49298 36e551d3af3b
child 49302 f5bd87aac224
permissions -rw-r--r--
added attributes to theorems
blanchet@49074
     1
(*  Title:      HOL/Codatatype/Tools/bnf_wrap.ML
blanchet@49017
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@49017
     3
    Copyright   2012
blanchet@49017
     4
blanchet@49074
     5
Wrapping existing datatypes.
blanchet@49017
     6
*)
blanchet@49017
     7
blanchet@49074
     8
signature BNF_WRAP =
blanchet@49017
     9
sig
blanchet@49129
    10
  val no_binder: binding
blanchet@49121
    11
  val mk_half_pairss: 'a list -> ('a * 'a) list list
blanchet@49203
    12
  val mk_ctr: typ list -> term -> term
blanchet@49199
    13
  val wrap_datatype: ({prems: thm list, context: Proof.context} -> tactic) list list ->
blanchet@49280
    14
    ((bool * term list) * term) *
blanchet@49280
    15
      (binding list * (binding list list * (binding * term) list list)) -> local_theory ->
blanchet@49266
    16
    (term list list * thm list * thm list list) * local_theory
blanchet@49278
    17
  val parse_wrap_options: bool parser
blanchet@49286
    18
  val parse_bound_term: (binding * string) parser
blanchet@49017
    19
end;
blanchet@49017
    20
blanchet@49074
    21
structure BNF_Wrap : BNF_WRAP =
blanchet@49017
    22
struct
blanchet@49017
    23
blanchet@49017
    24
open BNF_Util
blanchet@49074
    25
open BNF_Wrap_Tactics
blanchet@49017
    26
blanchet@49223
    27
val isN = "is_";
blanchet@49223
    28
val unN = "un_";
blanchet@49223
    29
fun mk_unN 1 1 suf = unN ^ suf
blanchet@49223
    30
  | mk_unN _ l suf = unN ^ suf ^ string_of_int l;
blanchet@49046
    31
blanchet@49054
    32
val case_congN = "case_cong";
blanchet@49116
    33
val case_eqN = "case_eq";
blanchet@49054
    34
val casesN = "cases";
blanchet@49118
    35
val collapseN = "collapse";
blanchet@49122
    36
val disc_excludeN = "disc_exclude";
blanchet@49054
    37
val disc_exhaustN = "disc_exhaust";
blanchet@49054
    38
val discsN = "discs";
blanchet@49054
    39
val distinctN = "distinct";
blanchet@49075
    40
val exhaustN = "exhaust";
blanchet@49075
    41
val injectN = "inject";
blanchet@49075
    42
val nchotomyN = "nchotomy";
blanchet@49054
    43
val selsN = "sels";
blanchet@49054
    44
val splitN = "split";
blanchet@49054
    45
val split_asmN = "split_asm";
blanchet@49054
    46
val weak_case_cong_thmsN = "weak_case_cong";
blanchet@49019
    47
blanchet@49139
    48
val no_binder = @{binding ""};
blanchet@49300
    49
val std_binder = @{binding _};
blanchet@49300
    50
blanchet@49300
    51
val induct_simp_attrs = @{attributes [induct_simp]};
blanchet@49300
    52
val cong_attrs = @{attributes [cong]};
blanchet@49300
    53
val iff_attrs = @{attributes [iff]};
blanchet@49300
    54
val safe_elim_attrs = @{attributes [elim!]};
blanchet@49300
    55
val simp_attrs = @{attributes [simp]};
blanchet@49046
    56
blanchet@49056
    57
fun pad_list x n xs = xs @ replicate (n - length xs) x;
blanchet@49056
    58
blanchet@49259
    59
fun unflat_lookup eq ys zs = map (map (fn x => nth zs (find_index (curry eq x) ys)));
blanchet@49258
    60
blanchet@49048
    61
fun mk_half_pairss' _ [] = []
blanchet@49056
    62
  | mk_half_pairss' indent (y :: ys) =
blanchet@49056
    63
    indent @ fold_rev (cons o single o pair y) ys (mk_half_pairss' ([] :: indent) ys);
blanchet@49027
    64
blanchet@49048
    65
fun mk_half_pairss ys = mk_half_pairss' [[]] ys;
blanchet@49027
    66
blanchet@49280
    67
fun mk_undefined T = Const (@{const_name undefined}, T);
blanchet@49055
    68
blanchet@49203
    69
fun mk_ctr Ts ctr =
blanchet@49203
    70
  let val Type (_, Ts0) = body_type (fastype_of ctr) in
blanchet@49203
    71
    Term.subst_atomic_types (Ts0 ~~ Ts) ctr
blanchet@49203
    72
  end;
blanchet@49203
    73
blanchet@49130
    74
fun eta_expand_case_arg xs f_xs = fold_rev Term.lambda xs f_xs;
blanchet@49032
    75
blanchet@49300
    76
fun base_name_of_ctr c =
blanchet@49300
    77
  Long_Name.base_name (case head_of c of
blanchet@49300
    78
      Const (s, _) => s
blanchet@49300
    79
    | Free (s, _) => s
blanchet@49300
    80
    | _ => error "Cannot extract name of constructor");
blanchet@49046
    81
blanchet@49278
    82
fun prepare_wrap_datatype prep_term (((no_dests, raw_ctrs), raw_case),
blanchet@49280
    83
    (raw_disc_binders, (raw_sel_binderss, raw_sel_defaultss))) no_defs_lthy =
blanchet@49017
    84
  let
blanchet@49019
    85
    (* TODO: sanity checks on arguments *)
blanchet@49113
    86
    (* TODO: attributes (simp, case_names, etc.) *)
blanchet@49113
    87
    (* TODO: case syntax *)
blanchet@49113
    88
    (* TODO: integration with function package ("size") *)
blanchet@49025
    89
blanchet@49280
    90
    val n = length raw_ctrs;
blanchet@49054
    91
    val ks = 1 upto n;
blanchet@49054
    92
blanchet@49121
    93
    val _ = if n > 0 then () else error "No constructors specified";
blanchet@49121
    94
blanchet@49280
    95
    val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs;
blanchet@49280
    96
    val case0 = prep_term no_defs_lthy raw_case;
blanchet@49280
    97
    val sel_defaultss =
blanchet@49280
    98
      pad_list [] n (map (map (apsnd (prep_term no_defs_lthy))) raw_sel_defaultss);
blanchet@49280
    99
blanchet@49300
   100
    val Type (dataT_name, As0) = body_type (fastype_of (hd ctrs0));
blanchet@49300
   101
    val b = Binding.qualified_name dataT_name;
blanchet@49055
   102
blanchet@49055
   103
    val (As, B) =
blanchet@49055
   104
      no_defs_lthy
blanchet@49298
   105
      |> mk_TFrees' (map Type.sort_of_atyp As0)
blanchet@49055
   106
      ||> the_single o fst o mk_TFrees 1;
blanchet@49055
   107
blanchet@49300
   108
    val dataT = Type (dataT_name, As);
blanchet@49055
   109
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49055
   110
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49055
   111
blanchet@49055
   112
    val ms = map length ctr_Tss;
blanchet@49055
   113
blanchet@49129
   114
    val raw_disc_binders' = pad_list no_binder n raw_disc_binders;
blanchet@49120
   115
blanchet@49174
   116
    fun can_really_rely_on_disc k =
blanchet@49152
   117
      not (Binding.eq_name (nth raw_disc_binders' (k - 1), no_binder)) orelse nth ms (k - 1) = 0;
blanchet@49174
   118
    fun can_rely_on_disc k =
blanchet@49174
   119
      can_really_rely_on_disc k orelse (k = 1 andalso not (can_really_rely_on_disc 2));
blanchet@49129
   120
    fun can_omit_disc_binder k m =
blanchet@49174
   121
      n = 1 orelse m = 0 orelse (n = 2 andalso can_rely_on_disc (3 - k));
blanchet@49120
   122
blanchet@49300
   123
    val std_disc_binder = Binding.name o prefix isN o base_name_of_ctr;
blanchet@49120
   124
blanchet@49129
   125
    val disc_binders =
blanchet@49129
   126
      raw_disc_binders'
blanchet@49120
   127
      |> map4 (fn k => fn m => fn ctr => fn disc =>
blanchet@49129
   128
        if Binding.eq_name (disc, no_binder) then
blanchet@49300
   129
          if can_omit_disc_binder k m then NONE else SOME (std_disc_binder ctr)
blanchet@49300
   130
        else if Binding.eq_name (disc, std_binder) then
blanchet@49300
   131
          SOME (std_disc_binder ctr)
blanchet@49046
   132
        else
blanchet@49120
   133
          SOME disc) ks ms ctrs0;
blanchet@49056
   134
blanchet@49129
   135
    val no_discs = map is_none disc_binders;
blanchet@49137
   136
    val no_discs_at_all = forall I no_discs;
blanchet@49116
   137
blanchet@49300
   138
    fun std_sel_binder m l = Binding.name o mk_unN m l o base_name_of_ctr;
blanchet@49120
   139
blanchet@49129
   140
    val sel_binderss =
blanchet@49129
   141
      pad_list [] n raw_sel_binderss
blanchet@49056
   142
      |> map3 (fn ctr => fn m => map2 (fn l => fn sel =>
blanchet@49300
   143
        if Binding.eq_name (sel, no_binder) orelse Binding.eq_name (sel, std_binder) then
blanchet@49300
   144
          std_sel_binder m l ctr
blanchet@49056
   145
        else
blanchet@49129
   146
          sel) (1 upto m) o pad_list no_binder m) ctrs0 ms;
blanchet@49020
   147
blanchet@49130
   148
    fun mk_case Ts T =
blanchet@49121
   149
      let
blanchet@49130
   150
        val (binders, body) = strip_type (fastype_of case0)
blanchet@49121
   151
        val Type (_, Ts0) = List.last binders
blanchet@49130
   152
      in Term.subst_atomic_types ((body, T) :: (Ts0 ~~ Ts)) case0 end;
blanchet@49022
   153
blanchet@49201
   154
    val casex = mk_case As B;
blanchet@49201
   155
    val case_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49043
   156
blanchet@49043
   157
    val (((((((xss, yss), fs), gs), (v, v')), w), (p, p')), names_lthy) = no_defs_lthy |>
blanchet@49025
   158
      mk_Freess "x" ctr_Tss
blanchet@49025
   159
      ||>> mk_Freess "y" ctr_Tss
blanchet@49201
   160
      ||>> mk_Frees "f" case_Ts
blanchet@49201
   161
      ||>> mk_Frees "g" case_Ts
blanchet@49300
   162
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "v") dataT
blanchet@49300
   163
      ||>> yield_singleton (mk_Frees "w") dataT
blanchet@49043
   164
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT;
blanchet@49043
   165
blanchet@49043
   166
    val q = Free (fst p', B --> HOLogic.boolT);
blanchet@49020
   167
blanchet@49210
   168
    fun ap_v t = t $ v;
blanchet@49137
   169
    fun mk_v_eq_v () = HOLogic.mk_eq (v, v);
blanchet@49137
   170
blanchet@49025
   171
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
   172
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49032
   173
blanchet@49043
   174
    val xfs = map2 (curry Term.list_comb) fs xss;
blanchet@49043
   175
    val xgs = map2 (curry Term.list_comb) gs xss;
blanchet@49043
   176
blanchet@49130
   177
    val eta_fs = map2 eta_expand_case_arg xss xfs;
blanchet@49130
   178
    val eta_gs = map2 eta_expand_case_arg xss xgs;
blanchet@49043
   179
blanchet@49201
   180
    val fcase = Term.list_comb (casex, eta_fs);
blanchet@49201
   181
    val gcase = Term.list_comb (casex, eta_gs);
blanchet@49020
   182
blanchet@49025
   183
    val exist_xs_v_eq_ctrs =
blanchet@49025
   184
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (v, xctr))) xctrs xss;
blanchet@49022
   185
blanchet@49278
   186
    val unique_disc_no_def = TrueI; (*arbitrary marker*)
blanchet@49278
   187
    val alternate_disc_no_def = FalseE; (*arbitrary marker*)
blanchet@49116
   188
blanchet@49278
   189
    fun alternate_disc_lhs get_disc k =
blanchet@49116
   190
      HOLogic.mk_not
blanchet@49152
   191
        (case nth disc_binders (k - 1) of
blanchet@49152
   192
          NONE => nth exist_xs_v_eq_ctrs (k - 1)
blanchet@49278
   193
        | SOME b => get_disc b (k - 1) $ v);
blanchet@49116
   194
blanchet@49285
   195
    val (all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy') =
blanchet@49278
   196
      if no_dests then
blanchet@49285
   197
        (true, [], [], [], [], [], no_defs_lthy)
blanchet@49278
   198
      else
blanchet@49278
   199
        let
blanchet@49300
   200
          fun disc_free b = Free (Binding.name_of b, dataT --> HOLogic.boolT);
blanchet@49025
   201
blanchet@49278
   202
          fun disc_spec b exist_xs_v_eq_ctr = mk_Trueprop_eq (disc_free b $ v, exist_xs_v_eq_ctr);
blanchet@49278
   203
blanchet@49278
   204
          fun alternate_disc k = Term.lambda v (alternate_disc_lhs (K o disc_free) (3 - k));
blanchet@49278
   205
blanchet@49280
   206
          fun mk_sel_case_args b proto_sels T =
blanchet@49280
   207
            map2 (fn Ts => fn k =>
blanchet@49280
   208
              (case AList.lookup (op =) proto_sels k of
blanchet@49280
   209
                NONE =>
blanchet@49280
   210
                let val def_T = Ts ---> T in
blanchet@49280
   211
                  (case AList.lookup Binding.eq_name (rev (nth sel_defaultss (k - 1))) b of
blanchet@49280
   212
                    NONE => mk_undefined def_T
blanchet@49280
   213
                  | SOME t => fold_rev (fn T => Term.lambda (Free (Name.uu, T))) Ts
blanchet@49280
   214
                      (Term.subst_atomic_types [(fastype_of t, T)] t))
blanchet@49280
   215
                end
blanchet@49280
   216
              | SOME (xs, x) => fold_rev Term.lambda xs x)) ctr_Tss ks;
blanchet@49258
   217
blanchet@49278
   218
          fun sel_spec b proto_sels =
blanchet@49278
   219
            let
blanchet@49278
   220
              val _ =
blanchet@49278
   221
                (case duplicates (op =) (map fst proto_sels) of
blanchet@49278
   222
                   k :: _ => error ("Duplicate selector name " ^ quote (Binding.name_of b) ^
blanchet@49278
   223
                     " for constructor " ^
blanchet@49278
   224
                     quote (Syntax.string_of_term no_defs_lthy (nth ctrs (k - 1))))
blanchet@49278
   225
                 | [] => ())
blanchet@49278
   226
              val T =
blanchet@49278
   227
                (case distinct (op =) (map (fastype_of o snd o snd) proto_sels) of
blanchet@49278
   228
                  [T] => T
blanchet@49278
   229
                | T :: T' :: _ => error ("Inconsistent range type for selector " ^
blanchet@49278
   230
                    quote (Binding.name_of b) ^ ": " ^ quote (Syntax.string_of_typ no_defs_lthy T) ^
blanchet@49278
   231
                    " vs. " ^ quote (Syntax.string_of_typ no_defs_lthy T')));
blanchet@49278
   232
            in
blanchet@49300
   233
              mk_Trueprop_eq (Free (Binding.name_of b, dataT --> T) $ v,
blanchet@49280
   234
                Term.list_comb (mk_case As T, mk_sel_case_args b proto_sels T) $ v)
blanchet@49278
   235
            end;
blanchet@49116
   236
blanchet@49285
   237
          val sel_binders = flat sel_binderss;
blanchet@49285
   238
          val uniq_sel_binders = distinct Binding.eq_name sel_binders;
blanchet@49285
   239
          val all_sels_distinct = (length uniq_sel_binders = length sel_binders);
blanchet@49285
   240
blanchet@49285
   241
          val sel_binder_index =
blanchet@49285
   242
            if all_sels_distinct then 1 upto length sel_binders
blanchet@49285
   243
            else map (fn b => find_index (curry Binding.eq_name b) uniq_sel_binders) sel_binders;
blanchet@49285
   244
blanchet@49285
   245
          val proto_sels = flat (map3 (fn k => fn xs => map (fn x => (k, (xs, x)))) ks xss xss);
blanchet@49300
   246
          val sel_infos =
blanchet@49285
   247
            AList.group (op =) (sel_binder_index ~~ proto_sels)
blanchet@49285
   248
            |> sort (int_ord o pairself fst)
blanchet@49285
   249
            |> map snd |> curry (op ~~) uniq_sel_binders;
blanchet@49300
   250
          val sel_binders = map fst sel_infos;
blanchet@49258
   251
blanchet@49278
   252
          fun unflat_selss xs = unflat_lookup Binding.eq_name sel_binders xs sel_binderss;
blanchet@49258
   253
blanchet@49278
   254
          val (((raw_discs, raw_disc_defs), (raw_sels, raw_sel_defs)), (lthy', lthy)) =
blanchet@49278
   255
            no_defs_lthy
blanchet@49278
   256
            |> apfst split_list o fold_map4 (fn k => fn m => fn exist_xs_v_eq_ctr =>
blanchet@49278
   257
              fn NONE =>
blanchet@49278
   258
                 if n = 1 then pair (Term.lambda v (mk_v_eq_v ()), unique_disc_no_def)
blanchet@49278
   259
                 else if m = 0 then pair (Term.lambda v exist_xs_v_eq_ctr, refl)
blanchet@49278
   260
                 else pair (alternate_disc k, alternate_disc_no_def)
blanchet@49278
   261
               | SOME b => Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49278
   262
                   ((Thm.def_binding b, []), disc_spec b exist_xs_v_eq_ctr)) #>> apsnd snd)
blanchet@49278
   263
              ks ms exist_xs_v_eq_ctrs disc_binders
blanchet@49278
   264
            ||>> apfst split_list o fold_map (fn (b, proto_sels) =>
blanchet@49278
   265
              Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49300
   266
                ((Thm.def_binding b, []), sel_spec b proto_sels)) #>> apsnd snd) sel_infos
blanchet@49278
   267
            ||> `Local_Theory.restore;
blanchet@49022
   268
blanchet@49278
   269
          (*transforms defined frees into consts (and more)*)
blanchet@49278
   270
          val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   271
blanchet@49278
   272
          val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49281
   273
          val sel_defs = map (Morphism.thm phi) raw_sel_defs;
blanchet@49281
   274
          val sel_defss = unflat_selss sel_defs;
blanchet@49278
   275
blanchet@49278
   276
          val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49278
   277
          val selss0 = unflat_selss (map (Morphism.term phi) raw_sels);
blanchet@49028
   278
blanchet@49278
   279
          fun mk_disc_or_sel Ts c =
blanchet@49278
   280
            Term.subst_atomic_types (snd (Term.dest_Type (domain_type (fastype_of c))) ~~ Ts) c;
blanchet@49025
   281
blanchet@49278
   282
          val discs = map (mk_disc_or_sel As) discs0;
blanchet@49278
   283
          val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49278
   284
        in
blanchet@49285
   285
          (all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy')
blanchet@49278
   286
        end;
blanchet@49025
   287
blanchet@49032
   288
    fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p);
blanchet@49029
   289
blanchet@49020
   290
    val goal_exhaust =
blanchet@49032
   291
      let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (v, xctr)]) in
blanchet@49121
   292
        fold_rev Logic.all [p, v] (mk_imp_p (map2 mk_prem xctrs xss))
blanchet@49020
   293
      end;
blanchet@49019
   294
blanchet@49034
   295
    val goal_injectss =
blanchet@49017
   296
      let
blanchet@49034
   297
        fun mk_goal _ _ [] [] = []
blanchet@49025
   298
          | mk_goal xctr yctr xs ys =
blanchet@49121
   299
            [fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr),
blanchet@49121
   300
              Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))];
blanchet@49017
   301
      in
blanchet@49034
   302
        map4 mk_goal xctrs yctrs xss yss
blanchet@49017
   303
      end;
blanchet@49017
   304
blanchet@49048
   305
    val goal_half_distinctss =
blanchet@49121
   306
      let
blanchet@49203
   307
        fun mk_goal ((xs, xc), (xs', xc')) =
blanchet@49121
   308
          fold_rev Logic.all (xs @ xs')
blanchet@49203
   309
            (HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (xc, xc'))));
blanchet@49121
   310
      in
blanchet@49121
   311
        map (map mk_goal) (mk_half_pairss (xss ~~ xctrs))
blanchet@49121
   312
      end;
blanchet@49019
   313
blanchet@49121
   314
    val goal_cases =
blanchet@49121
   315
      map3 (fn xs => fn xctr => fn xf =>
blanchet@49201
   316
        fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (fcase $ xctr, xf))) xss xctrs xfs;
blanchet@49025
   317
blanchet@49121
   318
    val goalss = [goal_exhaust] :: goal_injectss @ goal_half_distinctss @ [goal_cases];
blanchet@49019
   319
blanchet@49019
   320
    fun after_qed thmss lthy =
blanchet@49019
   321
      let
blanchet@49048
   322
        val ([exhaust_thm], (inject_thmss, (half_distinct_thmss, [case_thms]))) =
blanchet@49048
   323
          (hd thmss, apsnd (chop (n * n)) (chop n (tl thmss)));
blanchet@49019
   324
blanchet@49032
   325
        val exhaust_thm' =
blanchet@49032
   326
          let val Tinst = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As) in
blanchet@49032
   327
            Drule.instantiate' [] [SOME (certify lthy v)]
blanchet@49032
   328
              (Thm.instantiate (Tinst, []) (Drule.zero_var_indexes exhaust_thm))
blanchet@49032
   329
          end;
blanchet@49032
   330
blanchet@49300
   331
        val exhaust_cases = map base_name_of_ctr ctrs;
blanchet@49300
   332
blanchet@49048
   333
        val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss;
blanchet@49048
   334
blanchet@49052
   335
        val (distinct_thmsss', distinct_thmsss) =
blanchet@49048
   336
          map2 (map2 append) (Library.chop_groups n half_distinct_thmss)
blanchet@49052
   337
            (transpose (Library.chop_groups n other_half_distinct_thmss))
blanchet@49052
   338
          |> `transpose;
blanchet@49048
   339
        val distinct_thms = interleave (flat half_distinct_thmss) (flat other_half_distinct_thmss);
blanchet@49019
   340
blanchet@49020
   341
        val nchotomy_thm =
blanchet@49020
   342
          let
blanchet@49020
   343
            val goal =
blanchet@49022
   344
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst v', snd v',
blanchet@49029
   345
                Library.foldr1 HOLogic.mk_disj exist_xs_v_eq_ctrs));
blanchet@49020
   346
          in
blanchet@49020
   347
            Skip_Proof.prove lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
blanchet@49020
   348
          end;
blanchet@49020
   349
blanchet@49281
   350
        val (all_sel_thms, sel_thmss, disc_thms, discI_thms, disc_exclude_thms, disc_exhaust_thms,
blanchet@49281
   351
             collapse_thms, case_eq_thms) =
blanchet@49278
   352
          if no_dests then
blanchet@49281
   353
            ([], [], [], [], [], [], [], [])
blanchet@49116
   354
          else
blanchet@49116
   355
            let
blanchet@49281
   356
              fun make_sel_thm case_thm sel_def = case_thm RS (sel_def RS trans);
blanchet@49281
   357
blanchet@49281
   358
              fun has_undefined_rhs thm =
blanchet@49281
   359
                (case snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of thm))) of
blanchet@49281
   360
                  Const (@{const_name undefined}, _) => true
blanchet@49281
   361
                | _ => false);
blanchet@49281
   362
blanchet@49281
   363
              val sel_thmss = map2 (map o make_sel_thm) case_thms sel_defss;
blanchet@49281
   364
blanchet@49281
   365
              val all_sel_thms =
blanchet@49285
   366
                (if all_sels_distinct andalso forall null sel_defaultss then
blanchet@49285
   367
                   flat sel_thmss
blanchet@49285
   368
                 else
blanchet@49285
   369
                   map_product (fn s => fn c => make_sel_thm c s) sel_defs case_thms)
blanchet@49285
   370
                |> filter_out has_undefined_rhs;
blanchet@49278
   371
blanchet@49278
   372
              fun mk_unique_disc_def () =
blanchet@49278
   373
                let
blanchet@49278
   374
                  val m = the_single ms;
blanchet@49278
   375
                  val goal = mk_Trueprop_eq (mk_v_eq_v (), the_single exist_xs_v_eq_ctrs);
blanchet@49278
   376
                in
blanchet@49278
   377
                  Skip_Proof.prove lthy [] [] goal (fn _ => mk_unique_disc_def_tac m exhaust_thm')
blanchet@49278
   378
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   379
                  |> Thm.close_derivation
blanchet@49278
   380
                end;
blanchet@49278
   381
blanchet@49278
   382
              fun mk_alternate_disc_def k =
blanchet@49278
   383
                let
blanchet@49278
   384
                  val goal =
blanchet@49278
   385
                    mk_Trueprop_eq (alternate_disc_lhs (K (nth discs)) (3 - k),
blanchet@49278
   386
                      nth exist_xs_v_eq_ctrs (k - 1));
blanchet@49278
   387
                in
blanchet@49278
   388
                  Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49278
   389
                    mk_alternate_disc_def_tac ctxt k (nth disc_defs (2 - k))
blanchet@49278
   390
                      (nth distinct_thms (2 - k)) exhaust_thm')
blanchet@49278
   391
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   392
                  |> Thm.close_derivation
blanchet@49278
   393
                end;
blanchet@49028
   394
blanchet@49278
   395
              val has_alternate_disc_def =
blanchet@49278
   396
                exists (fn def => Thm.eq_thm_prop (def, alternate_disc_no_def)) disc_defs;
blanchet@49278
   397
blanchet@49278
   398
              val disc_defs' =
blanchet@49278
   399
                map2 (fn k => fn def =>
blanchet@49278
   400
                  if Thm.eq_thm_prop (def, unique_disc_no_def) then mk_unique_disc_def ()
blanchet@49278
   401
                  else if Thm.eq_thm_prop (def, alternate_disc_no_def) then mk_alternate_disc_def k
blanchet@49278
   402
                  else def) ks disc_defs;
blanchet@49278
   403
blanchet@49278
   404
              val discD_thms = map (fn def => def RS iffD1) disc_defs';
blanchet@49278
   405
              val discI_thms =
blanchet@49278
   406
                map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms
blanchet@49278
   407
                  disc_defs';
blanchet@49278
   408
              val not_discI_thms =
blanchet@49278
   409
                map2 (fn m => fn def => funpow m (fn thm => allI RS thm)
blanchet@49278
   410
                    (Local_Defs.unfold lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]})))
blanchet@49278
   411
                  ms disc_defs';
blanchet@49278
   412
blanchet@49278
   413
              val (disc_thmss', disc_thmss) =
blanchet@49278
   414
                let
blanchet@49278
   415
                  fun mk_thm discI _ [] = refl RS discI
blanchet@49278
   416
                    | mk_thm _ not_discI [distinct] = distinct RS not_discI;
blanchet@49278
   417
                  fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss;
blanchet@49278
   418
                in
blanchet@49278
   419
                  map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose
blanchet@49278
   420
                end;
blanchet@49278
   421
blanchet@49278
   422
              val disc_thms = flat (map2 (fn true => K [] | false => I) no_discs disc_thmss);
blanchet@49028
   423
blanchet@49278
   424
              val disc_exclude_thms =
blanchet@49278
   425
                if has_alternate_disc_def then
blanchet@49278
   426
                  []
blanchet@49278
   427
                else
blanchet@49278
   428
                  let
blanchet@49278
   429
                    fun mk_goal [] = []
blanchet@49278
   430
                      | mk_goal [((_, true), (_, true))] = []
blanchet@49278
   431
                      | mk_goal [(((_, disc), _), ((_, disc'), _))] =
blanchet@49278
   432
                        [Logic.all v (Logic.mk_implies (HOLogic.mk_Trueprop (betapply (disc, v)),
blanchet@49278
   433
                           HOLogic.mk_Trueprop (HOLogic.mk_not (betapply (disc', v)))))];
blanchet@49278
   434
                    fun prove tac goal = Skip_Proof.prove lthy [] [] goal (K tac);
blanchet@49278
   435
blanchet@49300
   436
                    val infos = ms ~~ discD_thms ~~ discs ~~ no_discs;
blanchet@49300
   437
                    val half_pairss = mk_half_pairss infos;
blanchet@49278
   438
blanchet@49278
   439
                    val goal_halvess = map mk_goal half_pairss;
blanchet@49278
   440
                    val half_thmss =
blanchet@49278
   441
                      map3 (fn [] => K (K []) | [goal] => fn [((((m, discD), _), _), _)] =>
blanchet@49278
   442
                          fn disc_thm => [prove (mk_half_disc_exclude_tac m discD disc_thm) goal])
blanchet@49278
   443
                        goal_halvess half_pairss (flat disc_thmss');
blanchet@49278
   444
blanchet@49278
   445
                    val goal_other_halvess = map (mk_goal o map swap) half_pairss;
blanchet@49278
   446
                    val other_half_thmss =
blanchet@49278
   447
                      map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss
blanchet@49278
   448
                        goal_other_halvess;
blanchet@49278
   449
                  in
blanchet@49278
   450
                    interleave (flat half_thmss) (flat other_half_thmss)
blanchet@49278
   451
                  end;
blanchet@49028
   452
blanchet@49278
   453
              val disc_exhaust_thms =
blanchet@49278
   454
                if has_alternate_disc_def orelse no_discs_at_all then
blanchet@49278
   455
                  []
blanchet@49278
   456
                else
blanchet@49278
   457
                  let
blanchet@49278
   458
                    fun mk_prem disc = mk_imp_p [HOLogic.mk_Trueprop (betapply (disc, v))];
blanchet@49278
   459
                    val goal = fold_rev Logic.all [p, v] (mk_imp_p (map mk_prem discs));
blanchet@49278
   460
                  in
blanchet@49278
   461
                    [Skip_Proof.prove lthy [] [] goal (fn _ =>
blanchet@49278
   462
                       mk_disc_exhaust_tac n exhaust_thm discI_thms)]
blanchet@49278
   463
                  end;
blanchet@49025
   464
blanchet@49278
   465
              val collapse_thms =
blanchet@49278
   466
                if no_dests then
blanchet@49278
   467
                  []
blanchet@49278
   468
                else
blanchet@49278
   469
                  let
blanchet@49278
   470
                    fun mk_goal ctr disc sels =
blanchet@49278
   471
                      let
blanchet@49278
   472
                        val prem = HOLogic.mk_Trueprop (betapply (disc, v));
blanchet@49278
   473
                        val concl =
blanchet@49278
   474
                          mk_Trueprop_eq ((null sels ? swap)
blanchet@49278
   475
                            (Term.list_comb (ctr, map ap_v sels), v));
blanchet@49278
   476
                      in
blanchet@49278
   477
                        if prem aconv concl then NONE
blanchet@49278
   478
                        else SOME (Logic.all v (Logic.mk_implies (prem, concl)))
blanchet@49278
   479
                      end;
blanchet@49278
   480
                    val goals = map3 mk_goal ctrs discs selss;
blanchet@49278
   481
                  in
blanchet@49278
   482
                    map4 (fn m => fn discD => fn sel_thms => Option.map (fn goal =>
blanchet@49278
   483
                      Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49278
   484
                        mk_collapse_tac ctxt m discD sel_thms)
blanchet@49278
   485
                      |> perhaps (try (fn thm => refl RS thm)))) ms discD_thms sel_thmss goals
blanchet@49278
   486
                    |> map_filter I
blanchet@49278
   487
                  end;
blanchet@49278
   488
blanchet@49278
   489
              val case_eq_thms =
blanchet@49278
   490
                if no_dests then
blanchet@49278
   491
                  []
blanchet@49278
   492
                else
blanchet@49278
   493
                  let
blanchet@49278
   494
                    fun mk_body f sels = Term.list_comb (f, map ap_v sels);
blanchet@49278
   495
                    val goal =
blanchet@49278
   496
                      mk_Trueprop_eq (fcase $ v, mk_IfN B (map ap_v discs) (map2 mk_body fs selss));
blanchet@49278
   497
                  in
blanchet@49278
   498
                    [Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49278
   499
                      mk_case_eq_tac ctxt n exhaust_thm' case_thms disc_thmss' sel_thmss)]
blanchet@49278
   500
                    |> Proof_Context.export names_lthy lthy
blanchet@49278
   501
                  end;
blanchet@49116
   502
            in
blanchet@49281
   503
              (all_sel_thms, sel_thmss, disc_thms, discI_thms, disc_exclude_thms, disc_exhaust_thms,
blanchet@49278
   504
               collapse_thms, case_eq_thms)
blanchet@49116
   505
            end;
blanchet@49025
   506
blanchet@49033
   507
        val (case_cong_thm, weak_case_cong_thm) =
blanchet@49032
   508
          let
blanchet@49032
   509
            fun mk_prem xctr xs f g =
blanchet@49045
   510
              fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (w, xctr),
blanchet@49032
   511
                mk_Trueprop_eq (f, g)));
blanchet@49033
   512
blanchet@49033
   513
            val v_eq_w = mk_Trueprop_eq (v, w);
blanchet@49032
   514
blanchet@49032
   515
            val goal =
blanchet@49033
   516
              Logic.list_implies (v_eq_w :: map4 mk_prem xctrs xss fs gs,
blanchet@49201
   517
                 mk_Trueprop_eq (fcase $ v, gcase $ w));
blanchet@49201
   518
            val goal_weak = Logic.mk_implies (v_eq_w, mk_Trueprop_eq (fcase $ v, fcase $ w));
blanchet@49032
   519
          in
blanchet@49049
   520
            (Skip_Proof.prove lthy [] [] goal (fn _ => mk_case_cong_tac exhaust_thm' case_thms),
blanchet@49033
   521
             Skip_Proof.prove lthy [] [] goal_weak (K (etac arg_cong 1)))
blanchet@49033
   522
            |> pairself (singleton (Proof_Context.export names_lthy lthy))
blanchet@49032
   523
          end;
blanchet@49025
   524
blanchet@49044
   525
        val (split_thm, split_asm_thm) =
blanchet@49043
   526
          let
blanchet@49044
   527
            fun mk_conjunct xctr xs f_xs =
blanchet@49043
   528
              list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (v, xctr), q $ f_xs));
blanchet@49044
   529
            fun mk_disjunct xctr xs f_xs =
blanchet@49044
   530
              list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (v, xctr),
blanchet@49044
   531
                HOLogic.mk_not (q $ f_xs)));
blanchet@49044
   532
blanchet@49201
   533
            val lhs = q $ (fcase $ v);
blanchet@49044
   534
blanchet@49043
   535
            val goal =
blanchet@49044
   536
              mk_Trueprop_eq (lhs, Library.foldr1 HOLogic.mk_conj (map3 mk_conjunct xctrs xss xfs));
blanchet@49044
   537
            val goal_asm =
blanchet@49044
   538
              mk_Trueprop_eq (lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj
blanchet@49044
   539
                (map3 mk_disjunct xctrs xss xfs)));
blanchet@49044
   540
blanchet@49044
   541
            val split_thm =
blanchet@49049
   542
              Skip_Proof.prove lthy [] [] goal
blanchet@49052
   543
                (fn _ => mk_split_tac exhaust_thm' case_thms inject_thmss distinct_thmsss)
blanchet@49044
   544
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49044
   545
            val split_asm_thm =
blanchet@49044
   546
              Skip_Proof.prove lthy [] [] goal_asm (fn {context = ctxt, ...} =>
blanchet@49044
   547
                mk_split_asm_tac ctxt split_thm)
blanchet@49044
   548
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49043
   549
          in
blanchet@49044
   550
            (split_thm, split_asm_thm)
blanchet@49043
   551
          end;
blanchet@49025
   552
blanchet@49300
   553
        val cases_type_attr = Attrib.internal (K (Induct.cases_type dataT_name));
blanchet@49300
   554
        val exhaust_case_names_attr = Attrib.internal (K (Rule_Cases.case_names exhaust_cases));
blanchet@49300
   555
blanchet@49052
   556
        val notes =
blanchet@49300
   557
          [(case_congN, [case_cong_thm], []),
blanchet@49300
   558
           (case_eqN, case_eq_thms, []),
blanchet@49300
   559
           (casesN, case_thms, simp_attrs),
blanchet@49300
   560
           (collapseN, collapse_thms, simp_attrs),
blanchet@49300
   561
           (discsN, disc_thms, simp_attrs),
blanchet@49300
   562
           (disc_excludeN, disc_exclude_thms, []),
blanchet@49300
   563
           (disc_exhaustN, disc_exhaust_thms, [exhaust_case_names_attr]),
blanchet@49300
   564
           (distinctN, distinct_thms, simp_attrs @ induct_simp_attrs),
blanchet@49300
   565
           (exhaustN, [exhaust_thm], [exhaust_case_names_attr, cases_type_attr]),
blanchet@49300
   566
           (injectN, flat inject_thmss, iff_attrs @ induct_simp_attrs),
blanchet@49300
   567
           (nchotomyN, [nchotomy_thm], []),
blanchet@49300
   568
           (selsN, all_sel_thms, simp_attrs),
blanchet@49300
   569
           (splitN, [split_thm], []),
blanchet@49300
   570
           (split_asmN, [split_asm_thm], []),
blanchet@49300
   571
           (weak_case_cong_thmsN, [weak_case_cong_thm], cong_attrs)]
blanchet@49300
   572
          |> filter_out (null o #2)
blanchet@49300
   573
          |> map (fn (thmN, thms, attrs) =>
blanchet@49300
   574
            ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49300
   575
blanchet@49300
   576
        val notes' =
blanchet@49300
   577
          [(map (fn th => th RS notE) distinct_thms, safe_elim_attrs)]
blanchet@49300
   578
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@49019
   579
      in
blanchet@49300
   580
        ((selss, discI_thms, sel_thmss), lthy |> Local_Theory.notes (notes' @ notes) |> snd)
blanchet@49019
   581
      end;
blanchet@49017
   582
  in
blanchet@49121
   583
    (goalss, after_qed, lthy')
blanchet@49017
   584
  end;
blanchet@49017
   585
blanchet@49199
   586
fun wrap_datatype tacss = (fn (goalss, after_qed, lthy) =>
blanchet@49111
   587
  map2 (map2 (Skip_Proof.prove lthy [] [])) goalss tacss
blanchet@49280
   588
  |> (fn thms => after_qed thms lthy)) oo prepare_wrap_datatype (K I);
blanchet@49280
   589
blanchet@49297
   590
val wrap_datatype_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49297
   591
  Proof.theorem NONE (snd oo after_qed) (map (map (rpair [])) goalss) lthy) oo
blanchet@49297
   592
  prepare_wrap_datatype Syntax.read_term;
blanchet@49297
   593
blanchet@49280
   594
fun parse_bracket_list parser = @{keyword "["} |-- Parse.list parser --|  @{keyword "]"};
blanchet@49111
   595
blanchet@49280
   596
val parse_bindings = parse_bracket_list Parse.binding;
blanchet@49280
   597
val parse_bindingss = parse_bracket_list parse_bindings;
blanchet@49280
   598
blanchet@49280
   599
val parse_bound_term = (Parse.binding --| @{keyword ":"}) -- Parse.term;
blanchet@49280
   600
val parse_bound_terms = parse_bracket_list parse_bound_term;
blanchet@49280
   601
val parse_bound_termss = parse_bracket_list parse_bound_terms;
blanchet@49017
   602
blanchet@49278
   603
val parse_wrap_options =
blanchet@49278
   604
  Scan.optional (@{keyword "("} |-- (@{keyword "no_dests"} >> K true) --| @{keyword ")"}) false;
blanchet@49278
   605
blanchet@49017
   606
val _ =
blanchet@49074
   607
  Outer_Syntax.local_theory_to_proof @{command_spec "wrap_data"} "wraps an existing datatype"
blanchet@49278
   608
    ((parse_wrap_options -- (@{keyword "["} |-- Parse.list Parse.term --| @{keyword "]"}) --
blanchet@49280
   609
      Parse.term -- Scan.optional (parse_bindings -- Scan.optional (parse_bindingss --
blanchet@49280
   610
        Scan.optional parse_bound_termss []) ([], [])) ([], ([], [])))
blanchet@49199
   611
     >> wrap_datatype_cmd);
blanchet@49017
   612
blanchet@49017
   613
end;