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