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