src/HOL/Codatatype/Tools/bnf_sugar.ML
author blanchet
Thu Aug 30 13:42:05 2012 +0200 (2012-08-30)
changeset 49028 487427a02bee
parent 49027 fc3b9b49c92d
child 49029 f0ecfa9575a9
permissions -rw-r--r--
generate "disc_distinct" theorems
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@49025
    19
val case_congN = "case_cong"
blanchet@49025
    20
val case_discsN = "case_discs"
blanchet@49025
    21
val casesN = "cases"
blanchet@49025
    22
val ctr_selsN = "ctr_sels"
blanchet@49025
    23
val disc_disjointN = "disc_disjoint"
blanchet@49027
    24
val disc_exhaustN = "disc_exhaust"
blanchet@49027
    25
val discsN = "discs"
blanchet@49025
    26
val distinctN = "distinct"
blanchet@49025
    27
val selsN = "sels"
blanchet@49025
    28
val splitN = "split"
blanchet@49025
    29
val split_asmN = "split_asm"
blanchet@49025
    30
val weak_case_cong_thmsN = "weak_case_cong"
blanchet@49019
    31
blanchet@49028
    32
fun mk_half_pairs [] = []
blanchet@49028
    33
  | mk_half_pairs (x :: xs) = fold_rev (cons o pair x) xs (mk_half_pairs xs);
blanchet@49027
    34
blanchet@49028
    35
fun index_of_half_row _ 0 = 0
blanchet@49028
    36
  | index_of_half_row n j = index_of_half_row n (j - 1) + n - j;
blanchet@49028
    37
blanchet@49028
    38
fun index_of_half_cell n j k = index_of_half_row n j + k - (j + 1);
blanchet@49027
    39
blanchet@49025
    40
fun prepare_sugar prep_term (((raw_ctrs, raw_caseof), disc_names), sel_namess) no_defs_lthy =
blanchet@49017
    41
  let
blanchet@49019
    42
    (* TODO: sanity checks on arguments *)
blanchet@49017
    43
blanchet@49025
    44
    (* TODO: normalize types of constructors w.r.t. each other *)
blanchet@49025
    45
blanchet@49025
    46
    val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs;
blanchet@49025
    47
    val caseof0 = prep_term no_defs_lthy raw_caseof;
blanchet@49017
    48
blanchet@49025
    49
    val n = length ctrs0;
blanchet@49025
    50
    val ks = 1 upto n;
blanchet@49022
    51
blanchet@49025
    52
    val (T_name, As0) = dest_Type (body_type (fastype_of (hd ctrs0)));
blanchet@49020
    53
    val b = Binding.qualified_name T_name;
blanchet@49020
    54
blanchet@49025
    55
    val (As, B) =
blanchet@49025
    56
      no_defs_lthy
blanchet@49025
    57
      |> mk_TFrees (length As0)
blanchet@49025
    58
      ||> the_single o fst o mk_TFrees 1;
blanchet@49025
    59
blanchet@49025
    60
    fun mk_undef T Ts = Const (@{const_name undefined}, Ts ---> T);
blanchet@49025
    61
blanchet@49025
    62
    fun mk_ctr Ts ctr =
blanchet@49028
    63
      let val Ts0 = snd (dest_Type (body_type (fastype_of ctr))) in
blanchet@49025
    64
        Term.subst_atomic_types (Ts0 ~~ Ts) ctr
blanchet@49025
    65
      end;
blanchet@49020
    66
blanchet@49028
    67
    fun mk_caseof Ts T =
blanchet@49028
    68
      let val (binders, body) = strip_type (fastype_of caseof0) in
blanchet@49028
    69
        Term.subst_atomic_types ((body, T) :: (snd (dest_Type (List.last binders)) ~~ Ts)) caseof0
blanchet@49022
    70
      end;
blanchet@49022
    71
blanchet@49025
    72
    val T = Type (T_name, As);
blanchet@49025
    73
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49025
    74
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49025
    75
blanchet@49028
    76
    val ms = map length ctr_Tss;
blanchet@49028
    77
blanchet@49028
    78
    val caseofB = mk_caseof As B;
blanchet@49025
    79
    val caseofB_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49025
    80
blanchet@49025
    81
    val (((((xss, yss), fs), (v, v')), p), _) = no_defs_lthy |>
blanchet@49025
    82
      mk_Freess "x" ctr_Tss
blanchet@49025
    83
      ||>> mk_Freess "y" ctr_Tss
blanchet@49025
    84
      ||>> mk_Frees "f" caseofB_Ts
blanchet@49020
    85
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "v") T
blanchet@49020
    86
      ||>> yield_singleton (mk_Frees "P") HOLogic.boolT;
blanchet@49020
    87
blanchet@49025
    88
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
    89
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49025
    90
    val eta_fs = map2 (fn f => fn xs => fold_rev Term.lambda xs (Term.list_comb (f, xs))) fs xss;
blanchet@49020
    91
blanchet@49025
    92
    val exist_xs_v_eq_ctrs =
blanchet@49025
    93
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (v, xctr))) xctrs xss;
blanchet@49022
    94
blanchet@49025
    95
    fun mk_caseof_args k xs x T =
blanchet@49025
    96
      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
    97
blanchet@49025
    98
    fun disc_spec b exist_xs_v_eq_ctr =
blanchet@49025
    99
      HOLogic.mk_Trueprop (HOLogic.mk_eq (Free (Binding.name_of b, T --> HOLogic.boolT) $ v,
blanchet@49025
   100
        exist_xs_v_eq_ctr));
blanchet@49025
   101
blanchet@49028
   102
    fun sel_spec b x xs k =
blanchet@49025
   103
      let val T' = fastype_of x in
blanchet@49025
   104
        HOLogic.mk_Trueprop (HOLogic.mk_eq (Free (Binding.name_of b, T --> T') $ v,
blanchet@49028
   105
            Term.list_comb (mk_caseof As T', mk_caseof_args k xs x T') $ v))
blanchet@49022
   106
      end;
blanchet@49022
   107
blanchet@49028
   108
    val (((raw_discs, (_, raw_disc_defs)), (raw_selss, (_, raw_sel_defss))), (lthy', lthy)) =
blanchet@49022
   109
      no_defs_lthy
blanchet@49025
   110
      |> apfst (apsnd split_list o split_list) o fold_map2 (fn b => fn exist_xs_v_eq_ctr =>
blanchet@49022
   111
        Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49025
   112
          ((Thm.def_binding b, []), disc_spec b exist_xs_v_eq_ctr))) disc_names exist_xs_v_eq_ctrs
blanchet@49028
   113
      ||>> apfst (apsnd split_list o split_list) o fold_map3 (fn bs => fn xs => fn k =>
blanchet@49025
   114
        apfst (apsnd split_list o split_list) o fold_map2 (fn b => fn x =>
blanchet@49022
   115
          Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49028
   116
            ((Thm.def_binding b, []), sel_spec b x xs k))) bs xs) sel_namess xss ks
blanchet@49022
   117
      ||> `Local_Theory.restore;
blanchet@49022
   118
blanchet@49025
   119
    (*transforms defined frees into consts (and more)*)
blanchet@49025
   120
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   121
blanchet@49028
   122
    val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49028
   123
    val sel_defss = map (map (Morphism.thm phi)) raw_sel_defss;
blanchet@49028
   124
blanchet@49028
   125
    val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49028
   126
    val selss0 = map (map (Morphism.term phi)) raw_selss;
blanchet@49025
   127
blanchet@49028
   128
    fun mk_disc_or_sel Ts t =
blanchet@49028
   129
      Term.subst_atomic_types (snd (dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
blanchet@49028
   130
blanchet@49028
   131
    val discs = map (mk_disc_or_sel As) discs0;
blanchet@49028
   132
    val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49025
   133
blanchet@49020
   134
    val goal_exhaust =
blanchet@49020
   135
      let
blanchet@49020
   136
        fun mk_imp_p Q = Logic.list_implies (Q, HOLogic.mk_Trueprop p);
blanchet@49025
   137
        fun mk_prem xctr xs =
blanchet@49025
   138
          fold_rev Logic.all xs (mk_imp_p [HOLogic.mk_Trueprop (HOLogic.mk_eq (v, xctr))]);
blanchet@49020
   139
      in
blanchet@49025
   140
        mk_imp_p (map2 mk_prem xctrs xss)
blanchet@49020
   141
      end;
blanchet@49019
   142
blanchet@49019
   143
    val goal_injects =
blanchet@49017
   144
      let
blanchet@49020
   145
        fun mk_goal _ _ [] [] = NONE
blanchet@49025
   146
          | mk_goal xctr yctr xs ys =
blanchet@49019
   147
            SOME (HOLogic.mk_Trueprop (HOLogic.mk_eq
blanchet@49025
   148
              (HOLogic.mk_eq (xctr, yctr),
blanchet@49019
   149
               Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys))));
blanchet@49017
   150
      in
blanchet@49025
   151
        map_filter I (map4 mk_goal xctrs yctrs xss yss)
blanchet@49017
   152
      end;
blanchet@49017
   153
blanchet@49019
   154
    val goal_half_distincts =
blanchet@49028
   155
      map (HOLogic.mk_Trueprop o HOLogic.mk_not o HOLogic.mk_eq) (mk_half_pairs xctrs);
blanchet@49019
   156
blanchet@49025
   157
    val goal_cases =
blanchet@49025
   158
      let
blanchet@49025
   159
        val lhs0 = Term.list_comb (caseofB, eta_fs);
blanchet@49028
   160
        fun mk_goal xctr xs f =
blanchet@49028
   161
          HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs0 $ xctr, Term.list_comb (f, xs)));
blanchet@49025
   162
      in
blanchet@49028
   163
        map3 mk_goal xctrs xss fs
blanchet@49025
   164
      end;
blanchet@49025
   165
blanchet@49025
   166
    val goals = [[goal_exhaust], goal_injects, goal_half_distincts, goal_cases];
blanchet@49019
   167
blanchet@49019
   168
    fun after_qed thmss lthy =
blanchet@49019
   169
      let
blanchet@49025
   170
        val [[exhaust_thm], inject_thms, half_distinct_thms, case_thms] = thmss;
blanchet@49019
   171
blanchet@49019
   172
        val other_half_distinct_thms = map (fn thm => thm RS not_sym) half_distinct_thms;
blanchet@49019
   173
blanchet@49020
   174
        val nchotomy_thm =
blanchet@49020
   175
          let
blanchet@49020
   176
            val goal =
blanchet@49022
   177
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst v', snd v',
blanchet@49025
   178
                   Library.foldr1 HOLogic.mk_disj exist_xs_v_eq_ctrs));
blanchet@49020
   179
          in
blanchet@49020
   180
            Skip_Proof.prove lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
blanchet@49020
   181
          end;
blanchet@49020
   182
blanchet@49025
   183
        val sel_thms =
blanchet@49025
   184
          let
blanchet@49028
   185
            fun mk_thm k xs goal_case case_thm x sel_def =
blanchet@49025
   186
              let
blanchet@49025
   187
                val T = fastype_of x;
blanchet@49025
   188
                val cTs =
blanchet@49025
   189
                  map ((fn T' => certifyT lthy (if T' = B then T else T')) o TFree)
blanchet@49025
   190
                    (rev (Term.add_tfrees goal_case []));
blanchet@49025
   191
                val cxs = map (certify lthy) (mk_caseof_args k xs x T);
blanchet@49025
   192
              in
blanchet@49025
   193
                Local_Defs.fold lthy [sel_def]
blanchet@49025
   194
                  (Drule.instantiate' (map SOME cTs) (map SOME cxs) case_thm)
blanchet@49025
   195
              end;
blanchet@49028
   196
            fun mk_thms k xs goal_case case_thm sel_defs =
blanchet@49028
   197
              map2 (mk_thm k xs goal_case case_thm) xs sel_defs;
blanchet@49025
   198
          in
blanchet@49028
   199
            flat (map5 mk_thms ks xss goal_cases case_thms sel_defss)
blanchet@49025
   200
          end;
blanchet@49025
   201
blanchet@49028
   202
        val discI_thms =
blanchet@49028
   203
          map2 (fn m => fn disc_def => funpow m (fn thm => exI RS thm) (disc_def RS iffD2))
blanchet@49028
   204
            ms disc_defs;
blanchet@49028
   205
        val not_disc_thms =
blanchet@49028
   206
          map2 (fn m => fn disc_def => funpow m (fn thm => allI RS thm)
blanchet@49028
   207
                  (Local_Defs.unfold lthy @{thms not_ex} (disc_def RS @{thm ssubst[of _ _ Not]})))
blanchet@49028
   208
            ms disc_defs;
blanchet@49028
   209
blanchet@49027
   210
        val disc_thms =
blanchet@49027
   211
          let
blanchet@49027
   212
            fun get_distinct_thm k k' =
blanchet@49028
   213
              if k > k' then nth half_distinct_thms (index_of_half_cell n (k' - 1) (k - 1))
blanchet@49028
   214
              else nth other_half_distinct_thms (index_of_half_cell n (k' - 1) (k' - 1))
blanchet@49028
   215
            fun mk_thm ((k, discI), not_disc) k' =
blanchet@49028
   216
              if k = k' then refl RS discI else get_distinct_thm k k' RS not_disc;
blanchet@49027
   217
          in
blanchet@49028
   218
            map_product mk_thm (ks ~~ discI_thms ~~ not_disc_thms) ks
blanchet@49027
   219
          end;
blanchet@49025
   220
blanchet@49028
   221
        val disc_disjoint_thms =
blanchet@49028
   222
          let
blanchet@49028
   223
            fun get_disc_thm k k' = nth disc_thms ((k' - 1) * n + (k - 1));
blanchet@49028
   224
            fun mk_goal ((_, disc), (_, disc')) =
blanchet@49028
   225
              Logic.mk_implies (HOLogic.mk_Trueprop (disc $ v),
blanchet@49028
   226
                HOLogic.mk_Trueprop (HOLogic.mk_not (disc' $ v)));
blanchet@49028
   227
            fun prove tac goal = Skip_Proof.prove lthy [] [] goal (K tac);
blanchet@49028
   228
blanchet@49028
   229
            val bundles = ks ~~ ms ~~ disc_defs ~~ discs;
blanchet@49028
   230
            val half_pairs = mk_half_pairs bundles;
blanchet@49028
   231
blanchet@49028
   232
            val goal_halves = map mk_goal half_pairs;
blanchet@49028
   233
            val half_thms =
blanchet@49028
   234
              map2 (fn ((((k, m), disc_def), _), (((k', _), _), _)) =>
blanchet@49028
   235
                prove (mk_half_disc_disjoint_tac m disc_def (get_disc_thm k k')))
blanchet@49028
   236
              half_pairs goal_halves;
blanchet@49028
   237
blanchet@49028
   238
            val goal_other_halves = map (mk_goal o swap) half_pairs;
blanchet@49028
   239
            val other_half_thms =
blanchet@49028
   240
              map2 (prove o mk_other_half_disc_disjoint_tac) half_thms goal_other_halves;
blanchet@49028
   241
          in
blanchet@49028
   242
            half_thms @ other_half_thms
blanchet@49028
   243
          end;
blanchet@49025
   244
blanchet@49025
   245
        val disc_exhaust_thms = [];
blanchet@49025
   246
blanchet@49025
   247
        val ctr_sel_thms = [];
blanchet@49025
   248
blanchet@49025
   249
        val case_disc_thms = [];
blanchet@49025
   250
blanchet@49025
   251
        val case_cong_thm = TrueI;
blanchet@49025
   252
blanchet@49025
   253
        val weak_case_cong_thms = TrueI;
blanchet@49025
   254
blanchet@49025
   255
        val split_thms = [];
blanchet@49025
   256
blanchet@49025
   257
        val split_asm_thms = [];
blanchet@49025
   258
blanchet@49025
   259
        (* case syntax *)
blanchet@49025
   260
blanchet@49019
   261
        fun note thmN thms =
blanchet@49019
   262
          snd o Local_Theory.note
blanchet@49019
   263
            ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), thms);
blanchet@49019
   264
      in
blanchet@49019
   265
        lthy
blanchet@49025
   266
        |> note case_congN [case_cong_thm]
blanchet@49025
   267
        |> note case_discsN case_disc_thms
blanchet@49025
   268
        |> note casesN case_thms
blanchet@49025
   269
        |> note ctr_selsN ctr_sel_thms
blanchet@49027
   270
        |> note discsN disc_thms
blanchet@49025
   271
        |> note disc_disjointN disc_disjoint_thms
blanchet@49025
   272
        |> note disc_exhaustN disc_exhaust_thms
blanchet@49020
   273
        |> note distinctN (half_distinct_thms @ other_half_distinct_thms)
blanchet@49020
   274
        |> note exhaustN [exhaust_thm]
blanchet@49019
   275
        |> note injectN inject_thms
blanchet@49020
   276
        |> note nchotomyN [nchotomy_thm]
blanchet@49025
   277
        |> note selsN sel_thms
blanchet@49025
   278
        |> note splitN split_thms
blanchet@49025
   279
        |> note split_asmN split_asm_thms
blanchet@49025
   280
        |> note weak_case_cong_thmsN [weak_case_cong_thms]
blanchet@49019
   281
      end;
blanchet@49017
   282
  in
blanchet@49025
   283
    (goals, after_qed, lthy')
blanchet@49017
   284
  end;
blanchet@49017
   285
blanchet@49017
   286
val parse_binding_list = Parse.$$$ "[" |--  Parse.list Parse.binding --| Parse.$$$ "]";
blanchet@49017
   287
blanchet@49019
   288
val bnf_sugar_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49019
   289
  Proof.theorem NONE after_qed (map (map (rpair [])) goalss) lthy) oo
blanchet@49020
   290
  prepare_sugar Syntax.read_term;
blanchet@49017
   291
blanchet@49017
   292
val _ =
blanchet@49017
   293
  Outer_Syntax.local_theory_to_proof @{command_spec "bnf_sugar"} "adds sugar on top of a BNF"
blanchet@49023
   294
    (((Parse.$$$ "[" |-- Parse.list Parse.term --| Parse.$$$ "]") -- Parse.term --
blanchet@49023
   295
      parse_binding_list -- (Parse.$$$ "[" |-- Parse.list parse_binding_list --| Parse.$$$ "]"))
blanchet@49023
   296
      >> bnf_sugar_cmd);
blanchet@49017
   297
blanchet@49017
   298
end;