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