src/HOL/Codatatype/Tools/bnf_wrap.ML
author blanchet
Tue Sep 04 13:02:25 2012 +0200 (2012-09-04)
changeset 49111 9d511132394e
parent 49075 ed769978dc8d
child 49113 ef3eea7ae251
permissions -rw-r--r--
export "wrap" function
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@49111
    10
  val wrap: ({prems: thm list, context: Proof.context} -> tactic) list list ->
blanchet@49111
    11
    (term list * term) * (binding list * binding list list) -> Proof.context -> local_theory
blanchet@49017
    12
end;
blanchet@49017
    13
blanchet@49074
    14
structure BNF_Wrap : BNF_WRAP =
blanchet@49017
    15
struct
blanchet@49017
    16
blanchet@49017
    17
open BNF_Util
blanchet@49074
    18
open BNF_Wrap_Tactics
blanchet@49017
    19
blanchet@49046
    20
val is_N = "is_";
blanchet@49054
    21
val un_N = "un_";
blanchet@49054
    22
fun mk_un_N 1 1 suf = un_N ^ suf
blanchet@49054
    23
  | mk_un_N _ l suf = un_N ^ suf ^ string_of_int l;
blanchet@49046
    24
blanchet@49054
    25
val case_congN = "case_cong";
blanchet@49054
    26
val case_discsN = "case_discs";
blanchet@49054
    27
val casesN = "cases";
blanchet@49054
    28
val ctr_selsN = "ctr_sels";
blanchet@49054
    29
val disc_exclusN = "disc_exclus";
blanchet@49054
    30
val disc_exhaustN = "disc_exhaust";
blanchet@49054
    31
val discsN = "discs";
blanchet@49054
    32
val distinctN = "distinct";
blanchet@49075
    33
val exhaustN = "exhaust";
blanchet@49075
    34
val injectN = "inject";
blanchet@49075
    35
val nchotomyN = "nchotomy";
blanchet@49054
    36
val selsN = "sels";
blanchet@49054
    37
val splitN = "split";
blanchet@49054
    38
val split_asmN = "split_asm";
blanchet@49054
    39
val weak_case_cong_thmsN = "weak_case_cong";
blanchet@49019
    40
blanchet@49046
    41
val default_name = @{binding _};
blanchet@49046
    42
blanchet@49056
    43
fun pad_list x n xs = xs @ replicate (n - length xs) x;
blanchet@49056
    44
blanchet@49048
    45
fun mk_half_pairss' _ [] = []
blanchet@49056
    46
  | mk_half_pairss' indent (y :: ys) =
blanchet@49056
    47
    indent @ fold_rev (cons o single o pair y) ys (mk_half_pairss' ([] :: indent) ys);
blanchet@49027
    48
blanchet@49048
    49
fun mk_half_pairss ys = mk_half_pairss' [[]] ys;
blanchet@49027
    50
blanchet@49032
    51
val mk_Trueprop_eq = HOLogic.mk_Trueprop o HOLogic.mk_eq;
blanchet@49032
    52
blanchet@49055
    53
fun mk_undef T Ts = Const (@{const_name undefined}, Ts ---> T);
blanchet@49055
    54
blanchet@49043
    55
fun eta_expand_caseof_arg xs f_xs = fold_rev Term.lambda xs f_xs;
blanchet@49032
    56
blanchet@49046
    57
fun name_of_ctr t =
blanchet@49046
    58
  case head_of t of
blanchet@49046
    59
    Const (s, _) => s
blanchet@49046
    60
  | Free (s, _) => s
blanchet@49046
    61
  | _ => error "Cannot extract name of constructor";
blanchet@49046
    62
blanchet@49074
    63
fun prepare_wrap prep_term ((raw_ctrs, raw_caseof), (raw_disc_names, raw_sel_namess))
blanchet@49054
    64
  no_defs_lthy =
blanchet@49017
    65
  let
blanchet@49019
    66
    (* TODO: sanity checks on arguments *)
blanchet@49017
    67
blanchet@49025
    68
    (* TODO: normalize types of constructors w.r.t. each other *)
blanchet@49025
    69
blanchet@49025
    70
    val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs;
blanchet@49025
    71
    val caseof0 = prep_term no_defs_lthy raw_caseof;
blanchet@49017
    72
blanchet@49054
    73
    val n = length ctrs0;
blanchet@49054
    74
    val ks = 1 upto n;
blanchet@49054
    75
blanchet@49055
    76
    val (T_name, As0) = dest_Type (body_type (fastype_of (hd ctrs0)));
blanchet@49055
    77
    val b = Binding.qualified_name T_name;
blanchet@49055
    78
blanchet@49055
    79
    val (As, B) =
blanchet@49055
    80
      no_defs_lthy
blanchet@49055
    81
      |> mk_TFrees (length As0)
blanchet@49055
    82
      ||> the_single o fst o mk_TFrees 1;
blanchet@49055
    83
blanchet@49055
    84
    fun mk_ctr Ts ctr =
blanchet@49055
    85
      let val Ts0 = snd (dest_Type (body_type (fastype_of ctr))) in
blanchet@49055
    86
        Term.subst_atomic_types (Ts0 ~~ Ts) ctr
blanchet@49055
    87
      end;
blanchet@49055
    88
blanchet@49055
    89
    val T = Type (T_name, As);
blanchet@49055
    90
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49055
    91
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49055
    92
blanchet@49055
    93
    val ms = map length ctr_Tss;
blanchet@49055
    94
blanchet@49046
    95
    val disc_names =
blanchet@49056
    96
      pad_list default_name n raw_disc_names
blanchet@49056
    97
      |> map2 (fn ctr => fn disc =>
blanchet@49046
    98
        if Binding.eq_name (disc, default_name) then
blanchet@49046
    99
          Binding.name (prefix is_N (Long_Name.base_name (name_of_ctr ctr)))
blanchet@49046
   100
        else
blanchet@49056
   101
          disc) ctrs0;
blanchet@49056
   102
blanchet@49054
   103
    val sel_namess =
blanchet@49056
   104
      pad_list [] n raw_sel_namess
blanchet@49056
   105
      |> map3 (fn ctr => fn m => map2 (fn l => fn sel =>
blanchet@49056
   106
        if Binding.eq_name (sel, default_name) then
blanchet@49056
   107
          Binding.name (mk_un_N m l (Long_Name.base_name (name_of_ctr ctr)))
blanchet@49056
   108
        else
blanchet@49056
   109
          sel) (1 upto m) o pad_list default_name m) ctrs0 ms;
blanchet@49020
   110
blanchet@49028
   111
    fun mk_caseof Ts T =
blanchet@49028
   112
      let val (binders, body) = strip_type (fastype_of caseof0) in
blanchet@49028
   113
        Term.subst_atomic_types ((body, T) :: (snd (dest_Type (List.last binders)) ~~ Ts)) caseof0
blanchet@49022
   114
      end;
blanchet@49022
   115
blanchet@49028
   116
    val caseofB = mk_caseof As B;
blanchet@49025
   117
    val caseofB_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49025
   118
blanchet@49043
   119
    fun mk_caseofB_term eta_fs = Term.list_comb (caseofB, eta_fs);
blanchet@49043
   120
blanchet@49043
   121
    val (((((((xss, yss), fs), gs), (v, v')), w), (p, p')), names_lthy) = no_defs_lthy |>
blanchet@49025
   122
      mk_Freess "x" ctr_Tss
blanchet@49025
   123
      ||>> mk_Freess "y" ctr_Tss
blanchet@49025
   124
      ||>> mk_Frees "f" caseofB_Ts
blanchet@49032
   125
      ||>> mk_Frees "g" caseofB_Ts
blanchet@49020
   126
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "v") T
blanchet@49032
   127
      ||>> yield_singleton (mk_Frees "w") T
blanchet@49043
   128
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT;
blanchet@49043
   129
blanchet@49043
   130
    val q = Free (fst p', B --> HOLogic.boolT);
blanchet@49020
   131
blanchet@49025
   132
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
   133
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49032
   134
blanchet@49043
   135
    val xfs = map2 (curry Term.list_comb) fs xss;
blanchet@49043
   136
    val xgs = map2 (curry Term.list_comb) gs xss;
blanchet@49043
   137
blanchet@49043
   138
    val eta_fs = map2 eta_expand_caseof_arg xss xfs;
blanchet@49043
   139
    val eta_gs = map2 eta_expand_caseof_arg xss xgs;
blanchet@49043
   140
blanchet@49043
   141
    val caseofB_fs = Term.list_comb (caseofB, eta_fs);
blanchet@49020
   142
blanchet@49025
   143
    val exist_xs_v_eq_ctrs =
blanchet@49025
   144
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (v, xctr))) xctrs xss;
blanchet@49022
   145
blanchet@49032
   146
    fun mk_sel_caseof_args k xs x T =
blanchet@49025
   147
      map2 (fn Ts => fn i => if i = k then fold_rev Term.lambda xs x else mk_undef T Ts) ctr_Tss ks;
blanchet@49025
   148
blanchet@49025
   149
    fun disc_spec b exist_xs_v_eq_ctr =
blanchet@49032
   150
      mk_Trueprop_eq (Free (Binding.name_of b, T --> HOLogic.boolT) $ v, exist_xs_v_eq_ctr);
blanchet@49025
   151
blanchet@49028
   152
    fun sel_spec b x xs k =
blanchet@49025
   153
      let val T' = fastype_of x in
blanchet@49032
   154
        mk_Trueprop_eq (Free (Binding.name_of b, T --> T') $ v,
blanchet@49032
   155
          Term.list_comb (mk_caseof As T', mk_sel_caseof_args k xs x T') $ v)
blanchet@49022
   156
      end;
blanchet@49022
   157
blanchet@49028
   158
    val (((raw_discs, (_, raw_disc_defs)), (raw_selss, (_, raw_sel_defss))), (lthy', lthy)) =
blanchet@49022
   159
      no_defs_lthy
blanchet@49025
   160
      |> apfst (apsnd split_list o split_list) o fold_map2 (fn b => fn exist_xs_v_eq_ctr =>
blanchet@49022
   161
        Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49025
   162
          ((Thm.def_binding b, []), disc_spec b exist_xs_v_eq_ctr))) disc_names exist_xs_v_eq_ctrs
blanchet@49028
   163
      ||>> apfst (apsnd split_list o split_list) o fold_map3 (fn bs => fn xs => fn k =>
blanchet@49025
   164
        apfst (apsnd split_list o split_list) o fold_map2 (fn b => fn x =>
blanchet@49022
   165
          Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49028
   166
            ((Thm.def_binding b, []), sel_spec b x xs k))) bs xs) sel_namess xss ks
blanchet@49022
   167
      ||> `Local_Theory.restore;
blanchet@49022
   168
blanchet@49025
   169
    (*transforms defined frees into consts (and more)*)
blanchet@49025
   170
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   171
blanchet@49028
   172
    val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49028
   173
    val sel_defss = map (map (Morphism.thm phi)) raw_sel_defss;
blanchet@49028
   174
blanchet@49028
   175
    val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49028
   176
    val selss0 = map (map (Morphism.term phi)) raw_selss;
blanchet@49025
   177
blanchet@49028
   178
    fun mk_disc_or_sel Ts t =
blanchet@49028
   179
      Term.subst_atomic_types (snd (dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
blanchet@49028
   180
blanchet@49028
   181
    val discs = map (mk_disc_or_sel As) discs0;
blanchet@49028
   182
    val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49025
   183
blanchet@49032
   184
    fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p);
blanchet@49029
   185
blanchet@49020
   186
    val goal_exhaust =
blanchet@49032
   187
      let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (v, xctr)]) in
blanchet@49025
   188
        mk_imp_p (map2 mk_prem xctrs xss)
blanchet@49020
   189
      end;
blanchet@49019
   190
blanchet@49034
   191
    val goal_injectss =
blanchet@49017
   192
      let
blanchet@49034
   193
        fun mk_goal _ _ [] [] = []
blanchet@49025
   194
          | mk_goal xctr yctr xs ys =
blanchet@49034
   195
            [mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr),
blanchet@49034
   196
              Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys))];
blanchet@49017
   197
      in
blanchet@49034
   198
        map4 mk_goal xctrs yctrs xss yss
blanchet@49017
   199
      end;
blanchet@49017
   200
blanchet@49048
   201
    val goal_half_distinctss =
blanchet@49048
   202
      map (map (HOLogic.mk_Trueprop o HOLogic.mk_not o HOLogic.mk_eq)) (mk_half_pairss xctrs);
blanchet@49019
   203
blanchet@49043
   204
    val goal_cases = map2 (fn xctr => fn xf => mk_Trueprop_eq (caseofB_fs $ xctr, xf)) xctrs xfs;
blanchet@49025
   205
blanchet@49048
   206
    val goals = [goal_exhaust] :: goal_injectss @ goal_half_distinctss @ [goal_cases];
blanchet@49019
   207
blanchet@49019
   208
    fun after_qed thmss lthy =
blanchet@49019
   209
      let
blanchet@49048
   210
        val ([exhaust_thm], (inject_thmss, (half_distinct_thmss, [case_thms]))) =
blanchet@49048
   211
          (hd thmss, apsnd (chop (n * n)) (chop n (tl thmss)));
blanchet@49019
   212
blanchet@49032
   213
        val exhaust_thm' =
blanchet@49032
   214
          let val Tinst = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As) in
blanchet@49032
   215
            Drule.instantiate' [] [SOME (certify lthy v)]
blanchet@49032
   216
              (Thm.instantiate (Tinst, []) (Drule.zero_var_indexes exhaust_thm))
blanchet@49032
   217
          end;
blanchet@49032
   218
blanchet@49048
   219
        val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss;
blanchet@49048
   220
blanchet@49052
   221
        val (distinct_thmsss', distinct_thmsss) =
blanchet@49048
   222
          map2 (map2 append) (Library.chop_groups n half_distinct_thmss)
blanchet@49052
   223
            (transpose (Library.chop_groups n other_half_distinct_thmss))
blanchet@49052
   224
          |> `transpose;
blanchet@49048
   225
        val distinct_thms = interleave (flat half_distinct_thmss) (flat other_half_distinct_thmss);
blanchet@49019
   226
blanchet@49020
   227
        val nchotomy_thm =
blanchet@49020
   228
          let
blanchet@49020
   229
            val goal =
blanchet@49022
   230
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst v', snd v',
blanchet@49029
   231
                Library.foldr1 HOLogic.mk_disj exist_xs_v_eq_ctrs));
blanchet@49020
   232
          in
blanchet@49020
   233
            Skip_Proof.prove lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
blanchet@49020
   234
          end;
blanchet@49020
   235
blanchet@49030
   236
        val sel_thmss =
blanchet@49025
   237
          let
blanchet@49028
   238
            fun mk_thm k xs goal_case case_thm x sel_def =
blanchet@49025
   239
              let
blanchet@49025
   240
                val T = fastype_of x;
blanchet@49025
   241
                val cTs =
blanchet@49025
   242
                  map ((fn T' => certifyT lthy (if T' = B then T else T')) o TFree)
blanchet@49025
   243
                    (rev (Term.add_tfrees goal_case []));
blanchet@49032
   244
                val cxs = map (certify lthy) (mk_sel_caseof_args k xs x T);
blanchet@49025
   245
              in
blanchet@49025
   246
                Local_Defs.fold lthy [sel_def]
blanchet@49025
   247
                  (Drule.instantiate' (map SOME cTs) (map SOME cxs) case_thm)
blanchet@49025
   248
              end;
blanchet@49028
   249
            fun mk_thms k xs goal_case case_thm sel_defs =
blanchet@49028
   250
              map2 (mk_thm k xs goal_case case_thm) xs sel_defs;
blanchet@49025
   251
          in
blanchet@49030
   252
            map5 mk_thms ks xss goal_cases case_thms sel_defss
blanchet@49025
   253
          end;
blanchet@49025
   254
blanchet@49030
   255
        val discD_thms = map (fn def => def RS iffD1) disc_defs;
blanchet@49028
   256
        val discI_thms =
blanchet@49030
   257
          map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms disc_defs;
blanchet@49028
   258
        val not_disc_thms =
blanchet@49030
   259
          map2 (fn m => fn def => funpow m (fn thm => allI RS thm)
blanchet@49030
   260
                  (Local_Defs.unfold lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]})))
blanchet@49028
   261
            ms disc_defs;
blanchet@49028
   262
blanchet@49050
   263
        val (disc_thmss', disc_thmss) =
blanchet@49027
   264
          let
blanchet@49048
   265
            fun mk_thm discI _ [] = refl RS discI
blanchet@49048
   266
              | mk_thm _ not_disc [distinct] = distinct RS not_disc;
blanchet@49048
   267
            fun mk_thms discI not_disc distinctss = map (mk_thm discI not_disc) distinctss;
blanchet@49027
   268
          in
blanchet@49052
   269
            map3 mk_thms discI_thms not_disc_thms distinct_thmsss'
blanchet@49050
   270
            |> `transpose
blanchet@49027
   271
          end;
blanchet@49025
   272
blanchet@49053
   273
        val disc_exclus_thms =
blanchet@49028
   274
          let
blanchet@49028
   275
            fun mk_goal ((_, disc), (_, disc')) =
blanchet@49029
   276
              Logic.all v (Logic.mk_implies (HOLogic.mk_Trueprop (disc $ v),
blanchet@49029
   277
                HOLogic.mk_Trueprop (HOLogic.mk_not (disc' $ v))));
blanchet@49028
   278
            fun prove tac goal = Skip_Proof.prove lthy [] [] goal (K tac);
blanchet@49028
   279
blanchet@49048
   280
            val bundles = ms ~~ discD_thms ~~ discs;
blanchet@49048
   281
            val half_pairss = mk_half_pairss bundles;
blanchet@49028
   282
blanchet@49048
   283
            val goal_halvess = map (map mk_goal) half_pairss;
blanchet@49048
   284
            val half_thmss =
blanchet@49048
   285
              map3 (fn [] => K (K [])
blanchet@49048
   286
                     | [(((m, discD), _), _)] => fn disc_thm => fn [goal] =>
blanchet@49053
   287
                [prove (mk_half_disc_exclus_tac m discD disc_thm) goal])
blanchet@49050
   288
              half_pairss (flat disc_thmss') goal_halvess;
blanchet@49028
   289
blanchet@49048
   290
            val goal_other_halvess = map (map (mk_goal o swap)) half_pairss;
blanchet@49048
   291
            val other_half_thmss =
blanchet@49053
   292
              map2 (map2 (prove o mk_other_half_disc_exclus_tac)) half_thmss goal_other_halvess;
blanchet@49028
   293
          in
blanchet@49048
   294
            interleave (flat half_thmss) (flat other_half_thmss)
blanchet@49028
   295
          end;
blanchet@49025
   296
blanchet@49029
   297
        val disc_exhaust_thm =
blanchet@49029
   298
          let
blanchet@49029
   299
            fun mk_prem disc = mk_imp_p [HOLogic.mk_Trueprop (disc $ v)];
blanchet@49029
   300
            val goal = fold Logic.all [p, v] (mk_imp_p (map mk_prem discs));
blanchet@49029
   301
          in
blanchet@49029
   302
            Skip_Proof.prove lthy [] [] goal (fn _ => mk_disc_exhaust_tac n exhaust_thm discI_thms)
blanchet@49029
   303
          end;
blanchet@49025
   304
blanchet@49030
   305
        val ctr_sel_thms =
blanchet@49030
   306
          let
blanchet@49030
   307
            fun mk_goal ctr disc sels =
blanchet@49030
   308
              Logic.all v (Logic.mk_implies (HOLogic.mk_Trueprop (disc $ v),
blanchet@49032
   309
                mk_Trueprop_eq ((null sels ? swap)
blanchet@49032
   310
                  (Term.list_comb (ctr, map (fn sel => sel $ v) sels), v))));
blanchet@49030
   311
            val goals = map3 mk_goal ctrs discs selss;
blanchet@49030
   312
          in
blanchet@49030
   313
            map4 (fn goal => fn m => fn discD => fn sel_thms =>
blanchet@49030
   314
              Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49030
   315
                mk_ctr_sel_tac ctxt m discD sel_thms))
blanchet@49030
   316
              goals ms discD_thms sel_thmss
blanchet@49030
   317
          end;
blanchet@49025
   318
blanchet@49031
   319
        val case_disc_thm =
blanchet@49031
   320
          let
blanchet@49031
   321
            fun mk_core f sels = Term.list_comb (f, map (fn sel => sel $ v) sels);
blanchet@49031
   322
            fun mk_rhs _ [f] [sels] = mk_core f sels
blanchet@49031
   323
              | mk_rhs (disc :: discs) (f :: fs) (sels :: selss) =
blanchet@49031
   324
                Const (@{const_name If}, HOLogic.boolT --> B --> B --> B) $
blanchet@49031
   325
                  (disc $ v) $ mk_core f sels $ mk_rhs discs fs selss;
blanchet@49043
   326
            val goal = mk_Trueprop_eq (caseofB_fs $ v, mk_rhs discs fs selss);
blanchet@49031
   327
          in
blanchet@49031
   328
            Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49050
   329
              mk_case_disc_tac ctxt exhaust_thm' case_thms disc_thmss' sel_thmss)
blanchet@49031
   330
            |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49031
   331
          end;
blanchet@49025
   332
blanchet@49033
   333
        val (case_cong_thm, weak_case_cong_thm) =
blanchet@49032
   334
          let
blanchet@49032
   335
            fun mk_prem xctr xs f g =
blanchet@49045
   336
              fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (w, xctr),
blanchet@49032
   337
                mk_Trueprop_eq (f, g)));
blanchet@49033
   338
blanchet@49033
   339
            val v_eq_w = mk_Trueprop_eq (v, w);
blanchet@49043
   340
            val caseof_fs = mk_caseofB_term eta_fs;
blanchet@49043
   341
            val caseof_gs = mk_caseofB_term eta_gs;
blanchet@49032
   342
blanchet@49032
   343
            val goal =
blanchet@49033
   344
              Logic.list_implies (v_eq_w :: map4 mk_prem xctrs xss fs gs,
blanchet@49033
   345
                 mk_Trueprop_eq (caseof_fs $ v, caseof_gs $ w));
blanchet@49033
   346
            val goal_weak =
blanchet@49033
   347
              Logic.mk_implies (v_eq_w, mk_Trueprop_eq (caseof_fs $ v, caseof_fs $ w));
blanchet@49032
   348
          in
blanchet@49049
   349
            (Skip_Proof.prove lthy [] [] goal (fn _ => mk_case_cong_tac exhaust_thm' case_thms),
blanchet@49033
   350
             Skip_Proof.prove lthy [] [] goal_weak (K (etac arg_cong 1)))
blanchet@49033
   351
            |> pairself (singleton (Proof_Context.export names_lthy lthy))
blanchet@49032
   352
          end;
blanchet@49025
   353
blanchet@49044
   354
        val (split_thm, split_asm_thm) =
blanchet@49043
   355
          let
blanchet@49044
   356
            fun mk_conjunct xctr xs f_xs =
blanchet@49043
   357
              list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (v, xctr), q $ f_xs));
blanchet@49044
   358
            fun mk_disjunct xctr xs f_xs =
blanchet@49044
   359
              list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (v, xctr),
blanchet@49044
   360
                HOLogic.mk_not (q $ f_xs)));
blanchet@49044
   361
blanchet@49044
   362
            val lhs = q $ (mk_caseofB_term eta_fs $ v);
blanchet@49044
   363
blanchet@49043
   364
            val goal =
blanchet@49044
   365
              mk_Trueprop_eq (lhs, Library.foldr1 HOLogic.mk_conj (map3 mk_conjunct xctrs xss xfs));
blanchet@49044
   366
            val goal_asm =
blanchet@49044
   367
              mk_Trueprop_eq (lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj
blanchet@49044
   368
                (map3 mk_disjunct xctrs xss xfs)));
blanchet@49044
   369
blanchet@49044
   370
            val split_thm =
blanchet@49049
   371
              Skip_Proof.prove lthy [] [] goal
blanchet@49052
   372
                (fn _ => mk_split_tac exhaust_thm' case_thms inject_thmss distinct_thmsss)
blanchet@49044
   373
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49044
   374
            val split_asm_thm =
blanchet@49044
   375
              Skip_Proof.prove lthy [] [] goal_asm (fn {context = ctxt, ...} =>
blanchet@49044
   376
                mk_split_asm_tac ctxt split_thm)
blanchet@49044
   377
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49043
   378
          in
blanchet@49044
   379
            (split_thm, split_asm_thm)
blanchet@49043
   380
          end;
blanchet@49025
   381
blanchet@49043
   382
        (* TODO: case syntax *)
blanchet@49043
   383
        (* TODO: attributes (simp, case_names, etc.) *)
blanchet@49025
   384
blanchet@49052
   385
        val notes =
blanchet@49052
   386
          [(case_congN, [case_cong_thm]),
blanchet@49052
   387
           (case_discsN, [case_disc_thm]),
blanchet@49052
   388
           (casesN, case_thms),
blanchet@49052
   389
           (ctr_selsN, ctr_sel_thms),
blanchet@49052
   390
           (discsN, (flat disc_thmss)),
blanchet@49053
   391
           (disc_exclusN, disc_exclus_thms),
blanchet@49052
   392
           (disc_exhaustN, [disc_exhaust_thm]),
blanchet@49052
   393
           (distinctN, distinct_thms),
blanchet@49052
   394
           (exhaustN, [exhaust_thm]),
blanchet@49052
   395
           (injectN, (flat inject_thmss)),
blanchet@49052
   396
           (nchotomyN, [nchotomy_thm]),
blanchet@49052
   397
           (selsN, (flat sel_thmss)),
blanchet@49052
   398
           (splitN, [split_thm]),
blanchet@49052
   399
           (split_asmN, [split_asm_thm]),
blanchet@49052
   400
           (weak_case_cong_thmsN, [weak_case_cong_thm])]
blanchet@49052
   401
          |> map (fn (thmN, thms) =>
blanchet@49052
   402
            ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]));
blanchet@49019
   403
      in
blanchet@49052
   404
        lthy |> Local_Theory.notes notes |> snd
blanchet@49019
   405
      end;
blanchet@49017
   406
  in
blanchet@49025
   407
    (goals, after_qed, lthy')
blanchet@49017
   408
  end;
blanchet@49017
   409
blanchet@49111
   410
fun wrap tacss = (fn (goalss, after_qed, lthy) =>
blanchet@49111
   411
  map2 (map2 (Skip_Proof.prove lthy [] [])) goalss tacss
blanchet@49111
   412
  |> (fn thms => after_qed thms lthy)) oo
blanchet@49111
   413
  prepare_wrap (singleton o Type_Infer_Context.infer_types)
blanchet@49111
   414
blanchet@49057
   415
val parse_bindings = Parse.$$$ "[" |--  Parse.list Parse.binding --| Parse.$$$ "]";
blanchet@49057
   416
blanchet@49057
   417
val parse_bindingss = Parse.$$$ "[" |-- Parse.list parse_bindings --| Parse.$$$ "]";
blanchet@49017
   418
blanchet@49074
   419
val wrap_data_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49019
   420
  Proof.theorem NONE after_qed (map (map (rpair [])) goalss) lthy) oo
blanchet@49074
   421
  prepare_wrap Syntax.read_term;
blanchet@49017
   422
blanchet@49017
   423
val _ =
blanchet@49074
   424
  Outer_Syntax.local_theory_to_proof @{command_spec "wrap_data"} "wraps an existing datatype"
blanchet@49023
   425
    (((Parse.$$$ "[" |-- Parse.list Parse.term --| Parse.$$$ "]") -- Parse.term --
blanchet@49057
   426
      Scan.optional (parse_bindings -- Scan.optional parse_bindingss []) ([], []))
blanchet@49074
   427
     >> wrap_data_cmd);
blanchet@49017
   428
blanchet@49017
   429
end;