src/HOL/Tools/datatype_realizer.ML
author wenzelm
Tue Feb 10 14:48:26 2015 +0100 (2015-02-10)
changeset 59498 50b60f501b05
parent 59058 a78612c67ec0
child 59582 0fbed69ff081
permissions -rw-r--r--
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
occasionally clarified use of context;
blanchet@58275
     1
(*  Title:      HOL/Tools/datatype_realizer.ML
berghofe@13467
     2
    Author:     Stefan Berghofer, TU Muenchen
berghofe@13467
     3
haftmann@33968
     4
Program extraction from proofs involving datatypes:
haftmann@33968
     5
realizers for induction and case analysis.
berghofe@13467
     6
*)
berghofe@13467
     7
blanchet@58275
     8
signature DATATYPE_REALIZER =
berghofe@13467
     9
sig
blanchet@58112
    10
  val add_dt_realizers: Old_Datatype_Aux.config -> string list -> theory -> theory
berghofe@13467
    11
end;
berghofe@13467
    12
blanchet@58275
    13
structure Datatype_Realizer : DATATYPE_REALIZER =
berghofe@13467
    14
struct
berghofe@13467
    15
wenzelm@35364
    16
fun subsets i j =
wenzelm@35364
    17
  if i <= j then
wenzelm@35364
    18
    let val is = subsets (i+1) j
wenzelm@35364
    19
    in map (fn ks => i::ks) is @ is end
wenzelm@35364
    20
  else [[]];
berghofe@13467
    21
wenzelm@40844
    22
fun is_unit t = body_type (fastype_of t) = HOLogic.unitT;
berghofe@13467
    23
berghofe@13725
    24
fun tname_of (Type (s, _)) = s
berghofe@13725
    25
  | tname_of _ = "";
berghofe@13725
    26
blanchet@58112
    27
fun make_ind ({descr, rec_names, rec_rewrites, induct, ...} : Old_Datatype_Aux.info) is thy =
berghofe@13467
    28
  let
wenzelm@54742
    29
    val ctxt = Proof_Context.init_global thy;
wenzelm@54742
    30
    val cert = cterm_of thy;
wenzelm@54742
    31
blanchet@58112
    32
    val recTs = Old_Datatype_Aux.get_rec_types descr;
wenzelm@45700
    33
    val pnames =
wenzelm@45700
    34
      if length descr = 1 then ["P"]
berghofe@13467
    35
      else map (fn i => "P" ^ string_of_int i) (1 upto length descr);
berghofe@13467
    36
berghofe@13467
    37
    val rec_result_Ts = map (fn ((i, _), P) =>
wenzelm@56254
    38
        if member (op =) is i then TFree ("'" ^ P, @{sort type}) else HOLogic.unitT)
wenzelm@45700
    39
      (descr ~~ pnames);
berghofe@13467
    40
berghofe@13467
    41
    fun make_pred i T U r x =
haftmann@36692
    42
      if member (op =) is i then
wenzelm@42364
    43
        Free (nth pnames i, T --> U --> HOLogic.boolT) $ r $ x
wenzelm@42364
    44
      else Free (nth pnames i, U --> HOLogic.boolT) $ x;
berghofe@13467
    45
berghofe@13467
    46
    fun mk_all i s T t =
wenzelm@46215
    47
      if member (op =) is i then Logic.all (Free (s, T)) t else t;
berghofe@13467
    48
haftmann@31458
    49
    val (prems, rec_fns) = split_list (flat (fst (fold_map
haftmann@31458
    50
      (fn ((i, (_, _, constrs)), T) => fold_map (fn (cname, cargs) => fn j =>
berghofe@13467
    51
        let
blanchet@58112
    52
          val Ts = map (Old_Datatype_Aux.typ_of_dtyp descr) cargs;
blanchet@58112
    53
          val tnames = Name.variant_list pnames (Old_Datatype_Prop.make_tnames Ts);
blanchet@58112
    54
          val recs = filter (Old_Datatype_Aux.is_rec_type o fst o fst) (cargs ~~ tnames ~~ Ts);
berghofe@13467
    55
          val frees = tnames ~~ Ts;
berghofe@13467
    56
wenzelm@38977
    57
          fun mk_prems vs [] =
berghofe@13467
    58
                let
haftmann@31458
    59
                  val rT = nth (rec_result_Ts) i;
berghofe@13467
    60
                  val vs' = filter_out is_unit vs;
blanchet@58112
    61
                  val f = Old_Datatype_Aux.mk_Free "f" (map fastype_of vs' ---> rT) j;
wenzelm@45700
    62
                  val f' =
wenzelm@45700
    63
                    Envir.eta_contract (fold_rev (absfree o dest_Free) vs
wenzelm@45700
    64
                      (if member (op =) is i then list_comb (f, vs') else HOLogic.unit));
wenzelm@45700
    65
                in
wenzelm@45700
    66
                  (HOLogic.mk_Trueprop (make_pred i rT T (list_comb (f, vs'))
wenzelm@45700
    67
                    (list_comb (Const (cname, Ts ---> T), map Free frees))), f')
berghofe@13467
    68
                end
wenzelm@38977
    69
            | mk_prems vs (((dt, s), T) :: ds) =
berghofe@13467
    70
                let
blanchet@58112
    71
                  val k = Old_Datatype_Aux.body_index dt;
berghofe@13641
    72
                  val (Us, U) = strip_type T;
berghofe@13641
    73
                  val i = length Us;
haftmann@31458
    74
                  val rT = nth (rec_result_Ts) k;
berghofe@13641
    75
                  val r = Free ("r" ^ s, Us ---> rT);
wenzelm@45700
    76
                  val (p, f) = mk_prems (vs @ [r]) ds;
wenzelm@45700
    77
                in
wenzelm@45700
    78
                  (mk_all k ("r" ^ s) (Us ---> rT) (Logic.mk_implies
wenzelm@46218
    79
                    (Logic.list_all (map (pair "x") Us, HOLogic.mk_Trueprop
blanchet@58112
    80
                      (make_pred k rT U (Old_Datatype_Aux.app_bnds r i)
blanchet@58112
    81
                        (Old_Datatype_Aux.app_bnds (Free (s, T)) i))), p)), f)
wenzelm@45700
    82
                end;
wenzelm@46215
    83
        in (apfst (fold_rev (Logic.all o Free) frees) (mk_prems (map Free frees) recs), j + 1) end)
haftmann@31458
    84
          constrs) (descr ~~ recTs) 1)));
wenzelm@38977
    85
blanchet@58111
    86
    fun mk_proj _ [] t = t
wenzelm@45700
    87
      | mk_proj j (i :: is) t =
wenzelm@45700
    88
          if null is then t
wenzelm@45700
    89
          else if (j: int) = i then HOLogic.mk_fst t
berghofe@13467
    90
          else mk_proj j is (HOLogic.mk_snd t);
berghofe@13467
    91
blanchet@58112
    92
    val tnames = Old_Datatype_Prop.make_tnames recTs;
berghofe@13467
    93
    val fTs = map fastype_of rec_fns;
berghofe@13467
    94
    val ps = map (fn ((((i, _), T), U), s) => Abs ("x", T, make_pred i U T
berghofe@13467
    95
      (list_comb (Const (s, fTs ---> T --> U), rec_fns) $ Bound 0) (Bound 0)))
berghofe@13467
    96
        (descr ~~ recTs ~~ rec_result_Ts ~~ rec_names);
wenzelm@45700
    97
    val r =
wenzelm@45700
    98
      if null is then Extraction.nullt
wenzelm@45700
    99
      else
wenzelm@45700
   100
        foldr1 HOLogic.mk_prod (map_filter (fn (((((i, _), T), U), s), tname) =>
wenzelm@45700
   101
          if member (op =) is i then SOME
wenzelm@45700
   102
            (list_comb (Const (s, fTs ---> T --> U), rec_fns) $ Free (tname, T))
wenzelm@45700
   103
          else NONE) (descr ~~ recTs ~~ rec_result_Ts ~~ rec_names ~~ tnames));
wenzelm@45700
   104
    val concl =
wenzelm@45700
   105
      HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop @{const_name HOL.conj})
wenzelm@45700
   106
        (map (fn ((((i, _), T), U), tname) =>
wenzelm@45700
   107
          make_pred i U T (mk_proj i is r) (Free (tname, T)))
wenzelm@45700
   108
            (descr ~~ recTs ~~ rec_result_Ts ~~ tnames)));
wenzelm@59058
   109
    val inst = map (apply2 cert) (map head_of (HOLogic.dest_conj
haftmann@32712
   110
      (HOLogic.dest_Trueprop (concl_of induct))) ~~ ps);
berghofe@13467
   111
wenzelm@45700
   112
    val thm =
wenzelm@54883
   113
      Goal.prove_internal ctxt (map cert prems) (cert concl)
wenzelm@45700
   114
        (fn prems =>
wenzelm@45700
   115
           EVERY [
wenzelm@54742
   116
            rewrite_goals_tac ctxt (map mk_meta_eq [@{thm fst_conv}, @{thm snd_conv}]),
wenzelm@45700
   117
            rtac (cterm_instantiate inst induct) 1,
wenzelm@54742
   118
            ALLGOALS (Object_Logic.atomize_prems_tac ctxt),
wenzelm@54742
   119
            rewrite_goals_tac ctxt (@{thm o_def} :: map mk_meta_eq rec_rewrites),
wenzelm@59498
   120
            REPEAT ((resolve_tac ctxt prems THEN_ALL_NEW (fn i =>
wenzelm@58963
   121
              REPEAT (etac allE i) THEN assume_tac ctxt i)) 1)])
wenzelm@38977
   122
      |> Drule.export_without_context;
berghofe@13467
   123
wenzelm@36744
   124
    val ind_name = Thm.derivation_name induct;
wenzelm@42364
   125
    val vs = map (nth pnames) is;
haftmann@18358
   126
    val (thm', thy') = thy
wenzelm@30435
   127
      |> Sign.root_path
wenzelm@39557
   128
      |> Global_Theory.store_thm
wenzelm@30435
   129
        (Binding.qualified_name (space_implode "_" (ind_name :: vs @ ["correctness"])), thm)
wenzelm@24712
   130
      ||> Sign.restore_naming thy;
berghofe@13467
   131
blanchet@58112
   132
    val ivs = rev (Term.add_vars (Logic.varify_global (Old_Datatype_Prop.make_ind [descr])) []);
wenzelm@22691
   133
    val rvs = rev (Thm.fold_terms Term.add_vars thm' []);
wenzelm@45700
   134
    val ivs1 = map Var (filter_out (fn (_, T) => @{type_name bool} = tname_of (body_type T)) ivs);
wenzelm@33035
   135
    val ivs2 = map (fn (ixn, _) => Var (ixn, the (AList.lookup (op =) rvs ixn))) ivs;
berghofe@13467
   136
wenzelm@33338
   137
    val prf =
berghofe@37233
   138
      Extraction.abs_corr_shyps thy' induct vs ivs2
wenzelm@33338
   139
        (fold_rev (fn (f, p) => fn prf =>
wenzelm@45700
   140
            (case head_of (strip_abs_body f) of
wenzelm@45700
   141
              Free (s, T) =>
wenzelm@45700
   142
                let val T' = Logic.varifyT_global T in
wenzelm@45700
   143
                  Abst (s, SOME T', Proofterm.prf_abstract_over
wenzelm@45700
   144
                    (Var ((s, 0), T')) (AbsP ("H", SOME p, prf)))
wenzelm@45700
   145
                end
wenzelm@45700
   146
            | _ => AbsP ("H", SOME p, prf)))
wenzelm@45700
   147
          (rec_fns ~~ prems_of thm)
wenzelm@45700
   148
          (Proofterm.proof_combP
wenzelm@45700
   149
            (Reconstruct.proof_of thm', map PBound (length prems - 1 downto 0))));
berghofe@13467
   150
wenzelm@33338
   151
    val r' =
wenzelm@33338
   152
      if null is then r
wenzelm@45700
   153
      else
wenzelm@45700
   154
        Logic.varify_global (fold_rev lambda
wenzelm@45700
   155
          (map Logic.unvarify_global ivs1 @ filter_out is_unit
wenzelm@45700
   156
              (map (head_of o strip_abs_body) rec_fns)) r);
berghofe@13467
   157
blanchet@58277
   158
  in Extraction.add_realizers_i [(ind_name, (vs, r', prf))] thy' end;
berghofe@13467
   159
blanchet@58182
   160
fun make_casedists ({index, descr, case_name, case_rewrites, exhaust, ...} : Old_Datatype_Aux.info) thy =
berghofe@13467
   161
  let
wenzelm@54883
   162
    val ctxt = Proof_Context.init_global thy;
wenzelm@19806
   163
    val cert = cterm_of thy;
wenzelm@56254
   164
    val rT = TFree ("'P", @{sort type});
wenzelm@56254
   165
    val rT' = TVar (("'P", 0), @{sort type});
berghofe@13467
   166
berghofe@13467
   167
    fun make_casedist_prem T (cname, cargs) =
berghofe@13467
   168
      let
blanchet@58112
   169
        val Ts = map (Old_Datatype_Aux.typ_of_dtyp descr) cargs;
blanchet@58112
   170
        val frees = Name.variant_list ["P", "y"] (Old_Datatype_Prop.make_tnames Ts) ~~ Ts;
berghofe@13467
   171
        val free_ts = map Free frees;
wenzelm@30364
   172
        val r = Free ("r" ^ Long_Name.base_name cname, Ts ---> rT)
wenzelm@45700
   173
      in
wenzelm@46215
   174
        (r, fold_rev Logic.all free_ts
wenzelm@46215
   175
          (Logic.mk_implies (HOLogic.mk_Trueprop
wenzelm@46215
   176
            (HOLogic.mk_eq (Free ("y", T), list_comb (Const (cname, Ts ---> T), free_ts))),
wenzelm@46215
   177
              HOLogic.mk_Trueprop (Free ("P", rT --> HOLogic.boolT) $
wenzelm@46215
   178
                list_comb (r, free_ts)))))
berghofe@13467
   179
      end;
berghofe@13467
   180
haftmann@17521
   181
    val SOME (_, _, constrs) = AList.lookup (op =) descr index;
blanchet@58112
   182
    val T = nth (Old_Datatype_Aux.get_rec_types descr) index;
berghofe@13467
   183
    val (rs, prems) = split_list (map (make_casedist_prem T) constrs);
berghofe@13467
   184
    val r = Const (case_name, map fastype_of rs ---> T --> rT);
berghofe@13467
   185
wenzelm@35845
   186
    val y = Var (("y", 0), Logic.varifyT_global T);
berghofe@13467
   187
    val y' = Free ("y", T);
berghofe@13467
   188
wenzelm@45700
   189
    val thm =
wenzelm@54883
   190
      Goal.prove_internal ctxt (map cert prems)
wenzelm@45700
   191
        (cert (HOLogic.mk_Trueprop (Free ("P", rT --> HOLogic.boolT) $ list_comb (r, rs @ [y']))))
wenzelm@45700
   192
        (fn prems =>
wenzelm@45700
   193
           EVERY [
wenzelm@45700
   194
            rtac (cterm_instantiate [(cert y, cert y')] exhaust) 1,
wenzelm@45700
   195
            ALLGOALS (EVERY'
wenzelm@54895
   196
              [asm_simp_tac (put_simpset HOL_basic_ss ctxt addsimps case_rewrites),
wenzelm@59498
   197
               resolve_tac ctxt prems, asm_simp_tac (put_simpset HOL_basic_ss ctxt)])])
wenzelm@38977
   198
      |> Drule.export_without_context;
berghofe@13467
   199
wenzelm@36744
   200
    val exh_name = Thm.derivation_name exhaust;
haftmann@18358
   201
    val (thm', thy') = thy
wenzelm@30435
   202
      |> Sign.root_path
wenzelm@39557
   203
      |> Global_Theory.store_thm (Binding.qualified_name (exh_name ^ "_P_correctness"), thm)
wenzelm@24712
   204
      ||> Sign.restore_naming thy;
berghofe@13467
   205
berghofe@13725
   206
    val P = Var (("P", 0), rT' --> HOLogic.boolT);
wenzelm@45700
   207
    val prf =
wenzelm@45700
   208
      Extraction.abs_corr_shyps thy' exhaust ["P"] [y, P]
wenzelm@45700
   209
        (fold_rev (fn (p, r) => fn prf =>
wenzelm@45700
   210
            Proofterm.forall_intr_proof' (Logic.varify_global r)
wenzelm@45700
   211
              (AbsP ("H", SOME (Logic.varify_global p), prf)))
wenzelm@45700
   212
          (prems ~~ rs)
wenzelm@45700
   213
          (Proofterm.proof_combP
wenzelm@45700
   214
            (Reconstruct.proof_of thm', map PBound (length prems - 1 downto 0))));
wenzelm@45700
   215
    val prf' =
wenzelm@45700
   216
      Extraction.abs_corr_shyps thy' exhaust []
wenzelm@45700
   217
        (map Var (Term.add_vars (prop_of exhaust) [])) (Reconstruct.proof_of exhaust);
wenzelm@45700
   218
    val r' =
wenzelm@45700
   219
      Logic.varify_global (Abs ("y", T,
wenzelm@46219
   220
        (fold_rev (Term.abs o dest_Free) rs
wenzelm@46219
   221
          (list_comb (r, map Bound ((length rs - 1 downto 0) @ [length rs]))))));
wenzelm@45700
   222
  in
wenzelm@45700
   223
    Extraction.add_realizers_i
wenzelm@45700
   224
      [(exh_name, (["P"], r', prf)),
wenzelm@45700
   225
       (exh_name, ([], Extraction.nullt, prf'))] thy'
berghofe@13467
   226
  end;
berghofe@13467
   227
haftmann@31668
   228
fun add_dt_realizers config names thy =
wenzelm@52487
   229
  if not (Proofterm.proofs_enabled ()) then thy
wenzelm@38977
   230
  else
wenzelm@38977
   231
    let
blanchet@58112
   232
      val _ = Old_Datatype_Aux.message config "Adding realizers for induction and case analysis ...";
blanchet@58354
   233
      val infos = map (BNF_LFP_Compat.the_info thy []) names;
wenzelm@38977
   234
      val info :: _ = infos;
wenzelm@38977
   235
    in
wenzelm@38977
   236
      thy
blanchet@58277
   237
      |> fold_rev (perhaps o try o make_ind info) (subsets 0 (length (#descr info) - 1))
blanchet@58277
   238
      |> fold_rev (perhaps o try o make_casedists) infos
wenzelm@38977
   239
    end;
berghofe@13467
   240
wenzelm@58659
   241
val _ = Theory.setup (BNF_LFP_Compat.interpretation @{plugin extraction} [] add_dt_realizers);
berghofe@13467
   242
berghofe@13467
   243
end;