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