src/HOL/Codatatype/Tools/bnf_wrap.ML
author blanchet
Wed Sep 05 00:58:54 2012 +0200 (2012-09-05)
changeset 49137 5c8fefe0f103
parent 49136 56a50871e25d
child 49139 e36ce78add78
permissions -rw-r--r--
fixed bugs in one-constructor case
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@49121
    12
  val wrap_data: ({prems: thm list, context: Proof.context} -> tactic) list list ->
blanchet@49119
    13
    (term list * term) * (binding list * binding list list) -> local_theory -> local_theory
blanchet@49017
    14
end;
blanchet@49017
    15
blanchet@49074
    16
structure BNF_Wrap : BNF_WRAP =
blanchet@49017
    17
struct
blanchet@49017
    18
blanchet@49017
    19
open BNF_Util
blanchet@49074
    20
open BNF_Wrap_Tactics
blanchet@49017
    21
blanchet@49046
    22
val is_N = "is_";
blanchet@49054
    23
val un_N = "un_";
blanchet@49054
    24
fun mk_un_N 1 1 suf = un_N ^ suf
blanchet@49054
    25
  | mk_un_N _ l suf = un_N ^ suf ^ string_of_int l;
blanchet@49046
    26
blanchet@49054
    27
val case_congN = "case_cong";
blanchet@49116
    28
val case_eqN = "case_eq";
blanchet@49054
    29
val casesN = "cases";
blanchet@49118
    30
val collapseN = "collapse";
blanchet@49122
    31
val disc_excludeN = "disc_exclude";
blanchet@49054
    32
val disc_exhaustN = "disc_exhaust";
blanchet@49054
    33
val discsN = "discs";
blanchet@49054
    34
val distinctN = "distinct";
blanchet@49075
    35
val exhaustN = "exhaust";
blanchet@49075
    36
val injectN = "inject";
blanchet@49075
    37
val nchotomyN = "nchotomy";
blanchet@49054
    38
val selsN = "sels";
blanchet@49054
    39
val splitN = "split";
blanchet@49054
    40
val split_asmN = "split_asm";
blanchet@49054
    41
val weak_case_cong_thmsN = "weak_case_cong";
blanchet@49019
    42
blanchet@49129
    43
val no_binder = @{binding "*"};
blanchet@49129
    44
val fallback_binder = @{binding _};
blanchet@49046
    45
blanchet@49056
    46
fun pad_list x n xs = xs @ replicate (n - length xs) x;
blanchet@49056
    47
blanchet@49048
    48
fun mk_half_pairss' _ [] = []
blanchet@49056
    49
  | mk_half_pairss' indent (y :: ys) =
blanchet@49056
    50
    indent @ fold_rev (cons o single o pair y) ys (mk_half_pairss' ([] :: indent) ys);
blanchet@49027
    51
blanchet@49048
    52
fun mk_half_pairss ys = mk_half_pairss' [[]] ys;
blanchet@49027
    53
blanchet@49055
    54
fun mk_undef T Ts = Const (@{const_name undefined}, Ts ---> T);
blanchet@49055
    55
blanchet@49130
    56
fun eta_expand_case_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@49130
    64
fun prepare_wrap_data prep_term ((raw_ctrs, raw_case), (raw_disc_binders, raw_sel_binderss))
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@49130
    73
    val case0 = prep_term no_defs_lthy raw_case;
blanchet@49017
    74
blanchet@49054
    75
    val n = length ctrs0;
blanchet@49054
    76
    val ks = 1 upto n;
blanchet@49054
    77
blanchet@49121
    78
    val _ = if n > 0 then () else error "No constructors specified";
blanchet@49121
    79
blanchet@49121
    80
    val Type (T_name, As0) = body_type (fastype_of (hd ctrs0));
blanchet@49055
    81
    val b = Binding.qualified_name T_name;
blanchet@49055
    82
blanchet@49055
    83
    val (As, B) =
blanchet@49055
    84
      no_defs_lthy
blanchet@49055
    85
      |> mk_TFrees (length As0)
blanchet@49055
    86
      ||> the_single o fst o mk_TFrees 1;
blanchet@49055
    87
blanchet@49055
    88
    fun mk_ctr Ts ctr =
blanchet@49121
    89
      let val Type (_, Ts0) = body_type (fastype_of ctr) in
blanchet@49055
    90
        Term.subst_atomic_types (Ts0 ~~ Ts) ctr
blanchet@49055
    91
      end;
blanchet@49055
    92
blanchet@49055
    93
    val T = Type (T_name, As);
blanchet@49055
    94
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49055
    95
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49055
    96
blanchet@49055
    97
    val ms = map length ctr_Tss;
blanchet@49055
    98
blanchet@49129
    99
    val raw_disc_binders' = pad_list no_binder n raw_disc_binders;
blanchet@49120
   100
blanchet@49120
   101
    fun can_rely_on_disc i =
blanchet@49129
   102
      not (Binding.eq_name (nth raw_disc_binders' i, no_binder)) orelse nth ms i = 0;
blanchet@49129
   103
    fun can_omit_disc_binder k m =
blanchet@49120
   104
      n = 1 orelse m = 0 orelse (n = 2 andalso can_rely_on_disc (2 - k))
blanchet@49120
   105
blanchet@49129
   106
    val fallback_disc_binder = Binding.name o prefix is_N o Long_Name.base_name o name_of_ctr;
blanchet@49120
   107
blanchet@49129
   108
    val disc_binders =
blanchet@49129
   109
      raw_disc_binders'
blanchet@49120
   110
      |> map4 (fn k => fn m => fn ctr => fn disc =>
blanchet@49129
   111
        if Binding.eq_name (disc, no_binder) then
blanchet@49129
   112
          if can_omit_disc_binder k m then NONE else SOME (fallback_disc_binder ctr)
blanchet@49129
   113
        else if Binding.eq_name (disc, fallback_binder) then
blanchet@49129
   114
          SOME (fallback_disc_binder ctr)
blanchet@49046
   115
        else
blanchet@49120
   116
          SOME disc) ks ms ctrs0;
blanchet@49056
   117
blanchet@49129
   118
    val no_discs = map is_none disc_binders;
blanchet@49137
   119
    val no_discs_at_all = forall I no_discs;
blanchet@49116
   120
blanchet@49129
   121
    fun fallback_sel_binder m l = Binding.name o mk_un_N m l o Long_Name.base_name o name_of_ctr;
blanchet@49120
   122
blanchet@49129
   123
    val sel_binderss =
blanchet@49129
   124
      pad_list [] n raw_sel_binderss
blanchet@49056
   125
      |> map3 (fn ctr => fn m => map2 (fn l => fn sel =>
blanchet@49129
   126
        if Binding.eq_name (sel, no_binder) orelse Binding.eq_name (sel, fallback_binder) then
blanchet@49129
   127
          fallback_sel_binder m l ctr
blanchet@49056
   128
        else
blanchet@49129
   129
          sel) (1 upto m) o pad_list no_binder m) ctrs0 ms;
blanchet@49020
   130
blanchet@49130
   131
    fun mk_case Ts T =
blanchet@49121
   132
      let
blanchet@49130
   133
        val (binders, body) = strip_type (fastype_of case0)
blanchet@49121
   134
        val Type (_, Ts0) = List.last binders
blanchet@49130
   135
      in Term.subst_atomic_types ((body, T) :: (Ts0 ~~ Ts)) case0 end;
blanchet@49022
   136
blanchet@49130
   137
    val caseB = mk_case As B;
blanchet@49130
   138
    val caseB_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49025
   139
blanchet@49130
   140
    fun mk_caseB_term eta_fs = Term.list_comb (caseB, eta_fs);
blanchet@49043
   141
blanchet@49043
   142
    val (((((((xss, yss), fs), gs), (v, v')), w), (p, p')), names_lthy) = no_defs_lthy |>
blanchet@49025
   143
      mk_Freess "x" ctr_Tss
blanchet@49025
   144
      ||>> mk_Freess "y" ctr_Tss
blanchet@49130
   145
      ||>> mk_Frees "f" caseB_Ts
blanchet@49130
   146
      ||>> mk_Frees "g" caseB_Ts
blanchet@49020
   147
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "v") T
blanchet@49032
   148
      ||>> yield_singleton (mk_Frees "w") T
blanchet@49043
   149
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT;
blanchet@49043
   150
blanchet@49043
   151
    val q = Free (fst p', B --> HOLogic.boolT);
blanchet@49020
   152
blanchet@49137
   153
    fun mk_v_eq_v () = HOLogic.mk_eq (v, v);
blanchet@49137
   154
blanchet@49025
   155
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
   156
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49032
   157
blanchet@49043
   158
    val xfs = map2 (curry Term.list_comb) fs xss;
blanchet@49043
   159
    val xgs = map2 (curry Term.list_comb) gs xss;
blanchet@49043
   160
blanchet@49130
   161
    val eta_fs = map2 eta_expand_case_arg xss xfs;
blanchet@49130
   162
    val eta_gs = map2 eta_expand_case_arg xss xgs;
blanchet@49043
   163
blanchet@49130
   164
    val caseB_fs = Term.list_comb (caseB, eta_fs);
blanchet@49020
   165
blanchet@49025
   166
    val exist_xs_v_eq_ctrs =
blanchet@49025
   167
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (v, xctr))) xctrs xss;
blanchet@49022
   168
blanchet@49130
   169
    fun mk_sel_case_args k xs x T =
blanchet@49025
   170
      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
   171
blanchet@49116
   172
    fun disc_free b = Free (Binding.name_of b, T --> HOLogic.boolT);
blanchet@49116
   173
blanchet@49116
   174
    fun disc_spec b exist_xs_v_eq_ctr = mk_Trueprop_eq (disc_free b $ v, exist_xs_v_eq_ctr);
blanchet@49116
   175
blanchet@49137
   176
    fun alternate_disc_lhs i =
blanchet@49116
   177
      HOLogic.mk_not
blanchet@49129
   178
        (case nth disc_binders i of NONE => nth exist_xs_v_eq_ctrs i | SOME b => disc_free b $ v);
blanchet@49116
   179
blanchet@49137
   180
    fun alternate_disc k =
blanchet@49137
   181
      if n = 2 then Term.lambda v (alternate_disc_lhs (2 - k)) else error "Cannot use \"*\" here"
blanchet@49025
   182
blanchet@49028
   183
    fun sel_spec b x xs k =
blanchet@49025
   184
      let val T' = fastype_of x in
blanchet@49032
   185
        mk_Trueprop_eq (Free (Binding.name_of b, T --> T') $ v,
blanchet@49130
   186
          Term.list_comb (mk_case As T', mk_sel_case_args k xs x T') $ v)
blanchet@49022
   187
      end;
blanchet@49022
   188
blanchet@49137
   189
    val missing_unique_disc_def = TrueI; (*arbitrary marker*)
blanchet@49137
   190
    val missing_alternate_disc_def = FalseE; (*arbitrary marker*)
blanchet@49116
   191
blanchet@49114
   192
    val (((raw_discs, raw_disc_defs), (raw_selss, raw_sel_defss)), (lthy', lthy)) =
blanchet@49022
   193
      no_defs_lthy
blanchet@49116
   194
      |> apfst split_list o fold_map4 (fn k => fn m => fn exist_xs_v_eq_ctr =>
blanchet@49116
   195
        fn NONE =>
blanchet@49137
   196
           if n = 1 then pair (Term.lambda v (mk_v_eq_v ()), missing_unique_disc_def)
blanchet@49136
   197
           else if m = 0 then pair (Term.lambda v exist_xs_v_eq_ctr, refl)
blanchet@49137
   198
           else pair (alternate_disc k, missing_alternate_disc_def)
blanchet@49114
   199
         | SOME b => Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49114
   200
             ((Thm.def_binding b, []), disc_spec b exist_xs_v_eq_ctr)) #>> apsnd snd)
blanchet@49129
   201
        ks ms exist_xs_v_eq_ctrs disc_binders
blanchet@49114
   202
      ||>> apfst split_list o fold_map3 (fn bs => fn xs => fn k => apfst split_list o
blanchet@49114
   203
          fold_map2 (fn b => fn x => Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49129
   204
            ((Thm.def_binding b, []), sel_spec b x xs k)) #>> apsnd snd) bs xs) sel_binderss xss ks
blanchet@49022
   205
      ||> `Local_Theory.restore;
blanchet@49022
   206
blanchet@49025
   207
    (*transforms defined frees into consts (and more)*)
blanchet@49025
   208
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   209
blanchet@49028
   210
    val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49028
   211
    val sel_defss = map (map (Morphism.thm phi)) raw_sel_defss;
blanchet@49028
   212
blanchet@49028
   213
    val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49028
   214
    val selss0 = map (map (Morphism.term phi)) raw_selss;
blanchet@49025
   215
blanchet@49028
   216
    fun mk_disc_or_sel Ts t =
blanchet@49121
   217
      Term.subst_atomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
blanchet@49028
   218
blanchet@49028
   219
    val discs = map (mk_disc_or_sel As) discs0;
blanchet@49028
   220
    val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49025
   221
blanchet@49032
   222
    fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p);
blanchet@49029
   223
blanchet@49020
   224
    val goal_exhaust =
blanchet@49032
   225
      let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (v, xctr)]) in
blanchet@49121
   226
        fold_rev Logic.all [p, v] (mk_imp_p (map2 mk_prem xctrs xss))
blanchet@49020
   227
      end;
blanchet@49019
   228
blanchet@49034
   229
    val goal_injectss =
blanchet@49017
   230
      let
blanchet@49034
   231
        fun mk_goal _ _ [] [] = []
blanchet@49025
   232
          | mk_goal xctr yctr xs ys =
blanchet@49121
   233
            [fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr),
blanchet@49121
   234
              Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))];
blanchet@49017
   235
      in
blanchet@49034
   236
        map4 mk_goal xctrs yctrs xss yss
blanchet@49017
   237
      end;
blanchet@49017
   238
blanchet@49048
   239
    val goal_half_distinctss =
blanchet@49121
   240
      let
blanchet@49121
   241
        fun mk_goal ((xs, t), (xs', t')) =
blanchet@49121
   242
          fold_rev Logic.all (xs @ xs')
blanchet@49121
   243
            (HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (t, t'))));
blanchet@49121
   244
      in
blanchet@49121
   245
        map (map mk_goal) (mk_half_pairss (xss ~~ xctrs))
blanchet@49121
   246
      end;
blanchet@49019
   247
blanchet@49121
   248
    val goal_cases =
blanchet@49121
   249
      map3 (fn xs => fn xctr => fn xf =>
blanchet@49130
   250
        fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (caseB_fs $ xctr, xf))) xss xctrs xfs;
blanchet@49025
   251
blanchet@49121
   252
    val goalss = [goal_exhaust] :: goal_injectss @ goal_half_distinctss @ [goal_cases];
blanchet@49019
   253
blanchet@49019
   254
    fun after_qed thmss lthy =
blanchet@49019
   255
      let
blanchet@49048
   256
        val ([exhaust_thm], (inject_thmss, (half_distinct_thmss, [case_thms]))) =
blanchet@49048
   257
          (hd thmss, apsnd (chop (n * n)) (chop n (tl thmss)));
blanchet@49019
   258
blanchet@49032
   259
        val exhaust_thm' =
blanchet@49032
   260
          let val Tinst = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As) in
blanchet@49032
   261
            Drule.instantiate' [] [SOME (certify lthy v)]
blanchet@49032
   262
              (Thm.instantiate (Tinst, []) (Drule.zero_var_indexes exhaust_thm))
blanchet@49032
   263
          end;
blanchet@49032
   264
blanchet@49048
   265
        val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss;
blanchet@49048
   266
blanchet@49052
   267
        val (distinct_thmsss', distinct_thmsss) =
blanchet@49048
   268
          map2 (map2 append) (Library.chop_groups n half_distinct_thmss)
blanchet@49052
   269
            (transpose (Library.chop_groups n other_half_distinct_thmss))
blanchet@49052
   270
          |> `transpose;
blanchet@49048
   271
        val distinct_thms = interleave (flat half_distinct_thmss) (flat other_half_distinct_thmss);
blanchet@49019
   272
blanchet@49020
   273
        val nchotomy_thm =
blanchet@49020
   274
          let
blanchet@49020
   275
            val goal =
blanchet@49022
   276
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst v', snd v',
blanchet@49029
   277
                Library.foldr1 HOLogic.mk_disj exist_xs_v_eq_ctrs));
blanchet@49020
   278
          in
blanchet@49020
   279
            Skip_Proof.prove lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
blanchet@49020
   280
          end;
blanchet@49020
   281
blanchet@49030
   282
        val sel_thmss =
blanchet@49025
   283
          let
blanchet@49028
   284
            fun mk_thm k xs goal_case case_thm x sel_def =
blanchet@49025
   285
              let
blanchet@49025
   286
                val T = fastype_of x;
blanchet@49025
   287
                val cTs =
blanchet@49025
   288
                  map ((fn T' => certifyT lthy (if T' = B then T else T')) o TFree)
blanchet@49025
   289
                    (rev (Term.add_tfrees goal_case []));
blanchet@49130
   290
                val cxs = map (certify lthy) (mk_sel_case_args k xs x T);
blanchet@49025
   291
              in
blanchet@49025
   292
                Local_Defs.fold lthy [sel_def]
blanchet@49025
   293
                  (Drule.instantiate' (map SOME cTs) (map SOME cxs) case_thm)
blanchet@49025
   294
              end;
blanchet@49028
   295
            fun mk_thms k xs goal_case case_thm sel_defs =
blanchet@49028
   296
              map2 (mk_thm k xs goal_case case_thm) xs sel_defs;
blanchet@49025
   297
          in
blanchet@49030
   298
            map5 mk_thms ks xss goal_cases case_thms sel_defss
blanchet@49025
   299
          end;
blanchet@49025
   300
blanchet@49137
   301
        fun mk_unique_disc_def k =
blanchet@49137
   302
          let
blanchet@49137
   303
            val m = the_single ms;
blanchet@49137
   304
            val goal = mk_Trueprop_eq (mk_v_eq_v (), the_single exist_xs_v_eq_ctrs);
blanchet@49137
   305
          in
blanchet@49137
   306
            Skip_Proof.prove lthy [] [] goal (fn _ => mk_unique_disc_def_tac m exhaust_thm')
blanchet@49137
   307
            |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49137
   308
            |> Thm.close_derivation
blanchet@49137
   309
          end;
blanchet@49137
   310
blanchet@49137
   311
        fun mk_alternate_disc_def k =
blanchet@49116
   312
          let
blanchet@49116
   313
            val goal =
blanchet@49137
   314
              mk_Trueprop_eq (Morphism.term phi (alternate_disc_lhs (2 - k)),
blanchet@49116
   315
                nth exist_xs_v_eq_ctrs (k - 1));
blanchet@49116
   316
          in
blanchet@49116
   317
            Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49137
   318
              mk_alternate_disc_def_tac ctxt (nth disc_defs (2 - k)) (nth distinct_thms (2 - k))
blanchet@49116
   319
                exhaust_thm')
blanchet@49116
   320
            |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49125
   321
            |> Thm.close_derivation
blanchet@49116
   322
          end;
blanchet@49116
   323
blanchet@49137
   324
        val has_alternate_disc_def =
blanchet@49137
   325
          exists (fn def => Thm.eq_thm_prop (def, missing_alternate_disc_def)) disc_defs;
blanchet@49116
   326
blanchet@49116
   327
        val disc_defs' =
blanchet@49116
   328
          map2 (fn k => fn def =>
blanchet@49137
   329
            if Thm.eq_thm_prop (def, missing_unique_disc_def) then mk_unique_disc_def k
blanchet@49137
   330
            else if Thm.eq_thm_prop (def, missing_alternate_disc_def) then mk_alternate_disc_def k
blanchet@49137
   331
            else def)
blanchet@49116
   332
          ks disc_defs;
blanchet@49116
   333
blanchet@49116
   334
        val discD_thms = map (fn def => def RS iffD1) disc_defs';
blanchet@49028
   335
        val discI_thms =
blanchet@49116
   336
          map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms disc_defs';
blanchet@49137
   337
        val not_discI_thms =
blanchet@49030
   338
          map2 (fn m => fn def => funpow m (fn thm => allI RS thm)
blanchet@49116
   339
            (Local_Defs.unfold lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]})))
blanchet@49116
   340
          ms disc_defs';
blanchet@49028
   341
blanchet@49050
   342
        val (disc_thmss', disc_thmss) =
blanchet@49027
   343
          let
blanchet@49048
   344
            fun mk_thm discI _ [] = refl RS discI
blanchet@49137
   345
              | mk_thm _ not_discI [distinct] = distinct RS not_discI;
blanchet@49137
   346
            fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss;
blanchet@49027
   347
          in
blanchet@49137
   348
            map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose
blanchet@49027
   349
          end;
blanchet@49025
   350
blanchet@49116
   351
        val disc_thms = flat (map2 (fn true => K [] | false => I) no_discs disc_thmss);
blanchet@49116
   352
blanchet@49122
   353
        val disc_exclude_thms =
blanchet@49137
   354
          if has_alternate_disc_def then
blanchet@49116
   355
            []
blanchet@49116
   356
          else
blanchet@49116
   357
            let
blanchet@49116
   358
              fun mk_goal [] = []
blanchet@49116
   359
                | mk_goal [((_, true), (_, true))] = []
blanchet@49116
   360
                | mk_goal [(((_, disc), _), ((_, disc'), _))] =
blanchet@49116
   361
                  [Logic.all v (Logic.mk_implies (HOLogic.mk_Trueprop (betapply (disc, v)),
blanchet@49116
   362
                     HOLogic.mk_Trueprop (HOLogic.mk_not (betapply (disc', v)))))];
blanchet@49116
   363
              fun prove tac goal = Skip_Proof.prove lthy [] [] goal (K tac);
blanchet@49028
   364
blanchet@49116
   365
              val bundles = ms ~~ discD_thms ~~ discs ~~ no_discs;
blanchet@49116
   366
              val half_pairss = mk_half_pairss bundles;
blanchet@49028
   367
blanchet@49116
   368
              val goal_halvess = map mk_goal half_pairss;
blanchet@49116
   369
              val half_thmss =
blanchet@49116
   370
                map3 (fn [] => K (K []) | [goal] => fn [((((m, discD), _), _), _)] => fn disc_thm =>
blanchet@49122
   371
                  [prove (mk_half_disc_exclude_tac m discD disc_thm) goal])
blanchet@49116
   372
                goal_halvess half_pairss (flat disc_thmss');
blanchet@49028
   373
blanchet@49116
   374
              val goal_other_halvess = map (mk_goal o map swap) half_pairss;
blanchet@49116
   375
              val other_half_thmss =
blanchet@49122
   376
                map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss goal_other_halvess;
blanchet@49116
   377
            in
blanchet@49116
   378
              interleave (flat half_thmss) (flat other_half_thmss)
blanchet@49116
   379
            end;
blanchet@49025
   380
blanchet@49116
   381
        val disc_exhaust_thms =
blanchet@49137
   382
          if has_alternate_disc_def orelse no_discs_at_all then
blanchet@49116
   383
            []
blanchet@49116
   384
          else
blanchet@49116
   385
            let
blanchet@49116
   386
              fun mk_prem disc = mk_imp_p [HOLogic.mk_Trueprop (betapply (disc, v))];
blanchet@49121
   387
              val goal = fold_rev Logic.all [p, v] (mk_imp_p (map mk_prem discs));
blanchet@49116
   388
            in
blanchet@49116
   389
              [Skip_Proof.prove lthy [] [] goal (fn _ =>
blanchet@49116
   390
                 mk_disc_exhaust_tac n exhaust_thm discI_thms)]
blanchet@49116
   391
            end;
blanchet@49025
   392
blanchet@49118
   393
        val collapse_thms =
blanchet@49030
   394
          let
blanchet@49030
   395
            fun mk_goal ctr disc sels =
blanchet@49114
   396
              let
blanchet@49114
   397
                val prem = HOLogic.mk_Trueprop (betapply (disc, v));
blanchet@49114
   398
                val concl =
blanchet@49114
   399
                  mk_Trueprop_eq ((null sels ? swap)
blanchet@49114
   400
                    (Term.list_comb (ctr, map (fn sel => sel $ v) sels), v));
blanchet@49114
   401
              in
blanchet@49114
   402
                if prem aconv concl then NONE
blanchet@49114
   403
                else SOME (Logic.all v (Logic.mk_implies (prem, concl)))
blanchet@49114
   404
              end;
blanchet@49030
   405
            val goals = map3 mk_goal ctrs discs selss;
blanchet@49030
   406
          in
blanchet@49114
   407
            map4 (fn m => fn discD => fn sel_thms => Option.map (fn goal =>
blanchet@49030
   408
              Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49137
   409
                mk_collapse_tac ctxt m discD sel_thms)
blanchet@49137
   410
              |> perhaps (try (fn thm => refl RS thm)))) ms discD_thms sel_thmss goals
blanchet@49114
   411
            |> map_filter I
blanchet@49030
   412
          end;
blanchet@49025
   413
blanchet@49116
   414
        val case_eq_thm =
blanchet@49031
   415
          let
blanchet@49031
   416
            fun mk_core f sels = Term.list_comb (f, map (fn sel => sel $ v) sels);
blanchet@49031
   417
            fun mk_rhs _ [f] [sels] = mk_core f sels
blanchet@49031
   418
              | mk_rhs (disc :: discs) (f :: fs) (sels :: selss) =
blanchet@49031
   419
                Const (@{const_name If}, HOLogic.boolT --> B --> B --> B) $
blanchet@49114
   420
                  betapply (disc, v) $ mk_core f sels $ mk_rhs discs fs selss;
blanchet@49130
   421
            val goal = mk_Trueprop_eq (caseB_fs $ v, mk_rhs discs fs selss);
blanchet@49031
   422
          in
blanchet@49031
   423
            Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49116
   424
              mk_case_eq_tac ctxt exhaust_thm' case_thms disc_thmss' sel_thmss)
blanchet@49031
   425
            |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49031
   426
          end;
blanchet@49025
   427
blanchet@49033
   428
        val (case_cong_thm, weak_case_cong_thm) =
blanchet@49032
   429
          let
blanchet@49032
   430
            fun mk_prem xctr xs f g =
blanchet@49045
   431
              fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (w, xctr),
blanchet@49032
   432
                mk_Trueprop_eq (f, g)));
blanchet@49033
   433
blanchet@49033
   434
            val v_eq_w = mk_Trueprop_eq (v, w);
blanchet@49130
   435
            val case_fs = mk_caseB_term eta_fs;
blanchet@49130
   436
            val case_gs = mk_caseB_term eta_gs;
blanchet@49032
   437
blanchet@49032
   438
            val goal =
blanchet@49033
   439
              Logic.list_implies (v_eq_w :: map4 mk_prem xctrs xss fs gs,
blanchet@49130
   440
                 mk_Trueprop_eq (case_fs $ v, case_gs $ w));
blanchet@49130
   441
            val goal_weak = Logic.mk_implies (v_eq_w, mk_Trueprop_eq (case_fs $ v, case_fs $ w));
blanchet@49032
   442
          in
blanchet@49049
   443
            (Skip_Proof.prove lthy [] [] goal (fn _ => mk_case_cong_tac exhaust_thm' case_thms),
blanchet@49033
   444
             Skip_Proof.prove lthy [] [] goal_weak (K (etac arg_cong 1)))
blanchet@49033
   445
            |> pairself (singleton (Proof_Context.export names_lthy lthy))
blanchet@49032
   446
          end;
blanchet@49025
   447
blanchet@49044
   448
        val (split_thm, split_asm_thm) =
blanchet@49043
   449
          let
blanchet@49044
   450
            fun mk_conjunct xctr xs f_xs =
blanchet@49043
   451
              list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (v, xctr), q $ f_xs));
blanchet@49044
   452
            fun mk_disjunct xctr xs f_xs =
blanchet@49044
   453
              list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (v, xctr),
blanchet@49044
   454
                HOLogic.mk_not (q $ f_xs)));
blanchet@49044
   455
blanchet@49130
   456
            val lhs = q $ (mk_caseB_term eta_fs $ v);
blanchet@49044
   457
blanchet@49043
   458
            val goal =
blanchet@49044
   459
              mk_Trueprop_eq (lhs, Library.foldr1 HOLogic.mk_conj (map3 mk_conjunct xctrs xss xfs));
blanchet@49044
   460
            val goal_asm =
blanchet@49044
   461
              mk_Trueprop_eq (lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj
blanchet@49044
   462
                (map3 mk_disjunct xctrs xss xfs)));
blanchet@49044
   463
blanchet@49044
   464
            val split_thm =
blanchet@49049
   465
              Skip_Proof.prove lthy [] [] goal
blanchet@49052
   466
                (fn _ => mk_split_tac exhaust_thm' case_thms inject_thmss distinct_thmsss)
blanchet@49044
   467
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49044
   468
            val split_asm_thm =
blanchet@49044
   469
              Skip_Proof.prove lthy [] [] goal_asm (fn {context = ctxt, ...} =>
blanchet@49044
   470
                mk_split_asm_tac ctxt split_thm)
blanchet@49044
   471
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49043
   472
          in
blanchet@49044
   473
            (split_thm, split_asm_thm)
blanchet@49043
   474
          end;
blanchet@49025
   475
blanchet@49052
   476
        val notes =
blanchet@49052
   477
          [(case_congN, [case_cong_thm]),
blanchet@49116
   478
           (case_eqN, [case_eq_thm]),
blanchet@49052
   479
           (casesN, case_thms),
blanchet@49118
   480
           (collapseN, collapse_thms),
blanchet@49116
   481
           (discsN, disc_thms),
blanchet@49122
   482
           (disc_excludeN, disc_exclude_thms),
blanchet@49116
   483
           (disc_exhaustN, disc_exhaust_thms),
blanchet@49052
   484
           (distinctN, distinct_thms),
blanchet@49052
   485
           (exhaustN, [exhaust_thm]),
blanchet@49121
   486
           (injectN, flat inject_thmss),
blanchet@49052
   487
           (nchotomyN, [nchotomy_thm]),
blanchet@49121
   488
           (selsN, flat sel_thmss),
blanchet@49052
   489
           (splitN, [split_thm]),
blanchet@49052
   490
           (split_asmN, [split_asm_thm]),
blanchet@49052
   491
           (weak_case_cong_thmsN, [weak_case_cong_thm])]
blanchet@49116
   492
          |> filter_out (null o snd)
blanchet@49052
   493
          |> map (fn (thmN, thms) =>
blanchet@49052
   494
            ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]));
blanchet@49019
   495
      in
blanchet@49052
   496
        lthy |> Local_Theory.notes notes |> snd
blanchet@49019
   497
      end;
blanchet@49017
   498
  in
blanchet@49121
   499
    (goalss, after_qed, lthy')
blanchet@49017
   500
  end;
blanchet@49017
   501
blanchet@49121
   502
fun wrap_data tacss = (fn (goalss, after_qed, lthy) =>
blanchet@49111
   503
  map2 (map2 (Skip_Proof.prove lthy [] [])) goalss tacss
blanchet@49111
   504
  |> (fn thms => after_qed thms lthy)) oo
blanchet@49121
   505
  prepare_wrap_data (K I) (* FIXME? (singleton o Type_Infer_Context.infer_types) *)
blanchet@49111
   506
blanchet@49114
   507
val parse_bindings = Parse.$$$ "[" |-- Parse.list Parse.binding --| Parse.$$$ "]";
blanchet@49057
   508
val parse_bindingss = Parse.$$$ "[" |-- Parse.list parse_bindings --| Parse.$$$ "]";
blanchet@49017
   509
blanchet@49074
   510
val wrap_data_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49019
   511
  Proof.theorem NONE after_qed (map (map (rpair [])) goalss) lthy) oo
blanchet@49121
   512
  prepare_wrap_data Syntax.read_term;
blanchet@49017
   513
blanchet@49017
   514
val _ =
blanchet@49074
   515
  Outer_Syntax.local_theory_to_proof @{command_spec "wrap_data"} "wraps an existing datatype"
blanchet@49023
   516
    (((Parse.$$$ "[" |-- Parse.list Parse.term --| Parse.$$$ "]") -- Parse.term --
blanchet@49057
   517
      Scan.optional (parse_bindings -- Scan.optional parse_bindingss []) ([], []))
blanchet@49074
   518
     >> wrap_data_cmd);
blanchet@49017
   519
blanchet@49017
   520
end;