src/HOL/Tools/datatype_package/datatype_realizer.ML
author haftmann
Fri Jun 19 17:23:21 2009 +0200 (2009-06-19)
changeset 31723 f5cafe803b55
parent 31668 a616e56a5ec8
child 31737 b3f63611784e
permissions -rw-r--r--
discontinued ancient tradition to suffix certain ML module names with "_package"
berghofe@13467
     1
(*  Title:      HOL/Tools/datatype_realizer.ML
berghofe@13467
     2
    Author:     Stefan Berghofer, TU Muenchen
berghofe@13467
     3
berghofe@13467
     4
Porgram extraction from proofs involving datatypes:
berghofe@13467
     5
Realizers for induction and case analysis
berghofe@13467
     6
*)
berghofe@13467
     7
berghofe@13467
     8
signature DATATYPE_REALIZER =
berghofe@13467
     9
sig
haftmann@31668
    10
  val add_dt_realizers: DatatypeAux.datatype_config -> string list -> theory -> theory
haftmann@24699
    11
  val setup: theory -> theory
berghofe@13467
    12
end;
berghofe@13467
    13
berghofe@13467
    14
structure DatatypeRealizer : DATATYPE_REALIZER =
berghofe@13467
    15
struct
berghofe@13467
    16
berghofe@13467
    17
open DatatypeAux;
berghofe@13467
    18
berghofe@13467
    19
fun subsets i j = if i <= j then
berghofe@13467
    20
       let val is = subsets (i+1) j
berghofe@13467
    21
       in map (fn ks => i::ks) is @ is end
berghofe@13467
    22
     else [[]];
berghofe@13467
    23
berghofe@13467
    24
fun forall_intr_prf (t, prf) =
berghofe@13467
    25
  let val (a, T) = (case t of Var ((a, _), T) => (a, T) | Free p => p)
skalberg@15531
    26
  in Abst (a, SOME T, Proofterm.prf_abstract_over t prf) end;
berghofe@13467
    27
berghofe@13467
    28
fun prf_of thm =
wenzelm@28814
    29
  Reconstruct.reconstruct_proof (Thm.theory_of_thm thm) (Thm.prop_of thm) (Thm.proof_of thm);
berghofe@13467
    30
berghofe@13467
    31
fun prf_subst_vars inst =
berghofe@13467
    32
  Proofterm.map_proof_terms (subst_vars ([], inst)) I;
berghofe@13467
    33
berghofe@13467
    34
fun is_unit t = snd (strip_type (fastype_of t)) = HOLogic.unitT;
berghofe@13467
    35
berghofe@13725
    36
fun tname_of (Type (s, _)) = s
berghofe@13725
    37
  | tname_of _ = "";
berghofe@13725
    38
berghofe@13467
    39
fun mk_realizes T = Const ("realizes", T --> HOLogic.boolT --> HOLogic.boolT);
berghofe@13467
    40
haftmann@24699
    41
fun make_ind sorts ({descr, rec_names, rec_rewrites, induction, ...} : datatype_info) is thy =
berghofe@13467
    42
  let
berghofe@13467
    43
    val recTs = get_rec_types descr sorts;
berghofe@13467
    44
    val pnames = if length descr = 1 then ["P"]
berghofe@13467
    45
      else map (fn i => "P" ^ string_of_int i) (1 upto length descr);
berghofe@13467
    46
berghofe@13467
    47
    val rec_result_Ts = map (fn ((i, _), P) =>
berghofe@13467
    48
      if i mem is then TFree ("'" ^ P, HOLogic.typeS) else HOLogic.unitT)
berghofe@13467
    49
        (descr ~~ pnames);
berghofe@13467
    50
berghofe@13467
    51
    fun make_pred i T U r x =
berghofe@13467
    52
      if i mem is then
skalberg@15570
    53
        Free (List.nth (pnames, i), T --> U --> HOLogic.boolT) $ r $ x
skalberg@15570
    54
      else Free (List.nth (pnames, i), U --> HOLogic.boolT) $ x;
berghofe@13467
    55
berghofe@13467
    56
    fun mk_all i s T t =
berghofe@13467
    57
      if i mem is then list_all_free ([(s, T)], t) else t;
berghofe@13467
    58
haftmann@31458
    59
    val (prems, rec_fns) = split_list (flat (fst (fold_map
haftmann@31458
    60
      (fn ((i, (_, _, constrs)), T) => fold_map (fn (cname, cargs) => fn j =>
berghofe@13467
    61
        let
berghofe@13467
    62
          val Ts = map (typ_of_dtyp descr sorts) cargs;
wenzelm@20071
    63
          val tnames = Name.variant_list pnames (DatatypeProp.make_tnames Ts);
haftmann@31458
    64
          val recs = filter (is_rec_type o fst o fst) (cargs ~~ tnames ~~ Ts);
berghofe@13467
    65
          val frees = tnames ~~ Ts;
berghofe@13467
    66
berghofe@13467
    67
          fun mk_prems vs [] = 
berghofe@13467
    68
                let
haftmann@31458
    69
                  val rT = nth (rec_result_Ts) i;
berghofe@13467
    70
                  val vs' = filter_out is_unit vs;
berghofe@13467
    71
                  val f = mk_Free "f" (map fastype_of vs' ---> rT) j;
wenzelm@18929
    72
                  val f' = Envir.eta_contract (list_abs_free
berghofe@13467
    73
                    (map dest_Free vs, if i mem is then list_comb (f, vs')
berghofe@13467
    74
                      else HOLogic.unit));
berghofe@13467
    75
                in (HOLogic.mk_Trueprop (make_pred i rT T (list_comb (f, vs'))
berghofe@13467
    76
                  (list_comb (Const (cname, Ts ---> T), map Free frees))), f')
berghofe@13467
    77
                end
berghofe@13641
    78
            | mk_prems vs (((dt, s), T) :: ds) = 
berghofe@13467
    79
                let
berghofe@13641
    80
                  val k = body_index dt;
berghofe@13641
    81
                  val (Us, U) = strip_type T;
berghofe@13641
    82
                  val i = length Us;
haftmann@31458
    83
                  val rT = nth (rec_result_Ts) k;
berghofe@13641
    84
                  val r = Free ("r" ^ s, Us ---> rT);
berghofe@13467
    85
                  val (p, f) = mk_prems (vs @ [r]) ds
berghofe@13641
    86
                in (mk_all k ("r" ^ s) (Us ---> rT) (Logic.mk_implies
berghofe@13641
    87
                  (list_all (map (pair "x") Us, HOLogic.mk_Trueprop
berghofe@13641
    88
                    (make_pred k rT U (app_bnds r i)
berghofe@13641
    89
                      (app_bnds (Free (s, T)) i))), p)), f)
berghofe@13467
    90
                end
berghofe@13467
    91
haftmann@31458
    92
        in (apfst (curry list_all_free frees) (mk_prems (map Free frees) recs), j + 1) end)
haftmann@31458
    93
          constrs) (descr ~~ recTs) 1)));
berghofe@13467
    94
 
berghofe@13467
    95
    fun mk_proj j [] t = t
berghofe@13467
    96
      | mk_proj j (i :: is) t = if null is then t else
wenzelm@23577
    97
          if (j: int) = i then HOLogic.mk_fst t
berghofe@13467
    98
          else mk_proj j is (HOLogic.mk_snd t);
berghofe@13467
    99
berghofe@13467
   100
    val tnames = DatatypeProp.make_tnames recTs;
berghofe@13467
   101
    val fTs = map fastype_of rec_fns;
berghofe@13467
   102
    val ps = map (fn ((((i, _), T), U), s) => Abs ("x", T, make_pred i U T
berghofe@13467
   103
      (list_comb (Const (s, fTs ---> T --> U), rec_fns) $ Bound 0) (Bound 0)))
berghofe@13467
   104
        (descr ~~ recTs ~~ rec_result_Ts ~~ rec_names);
berghofe@13467
   105
    val r = if null is then Extraction.nullt else
skalberg@15570
   106
      foldr1 HOLogic.mk_prod (List.mapPartial (fn (((((i, _), T), U), s), tname) =>
skalberg@15531
   107
        if i mem is then SOME
berghofe@13467
   108
          (list_comb (Const (s, fTs ---> T --> U), rec_fns) $ Free (tname, T))
skalberg@15531
   109
        else NONE) (descr ~~ recTs ~~ rec_result_Ts ~~ rec_names ~~ tnames));
berghofe@13467
   110
    val concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@13467
   111
      (map (fn ((((i, _), T), U), tname) =>
berghofe@13467
   112
        make_pred i U T (mk_proj i is r) (Free (tname, T)))
berghofe@13467
   113
          (descr ~~ recTs ~~ rec_result_Ts ~~ tnames)));
wenzelm@22578
   114
    val cert = cterm_of thy;
berghofe@13467
   115
    val inst = map (pairself cert) (map head_of (HOLogic.dest_conj
berghofe@13467
   116
      (HOLogic.dest_Trueprop (concl_of induction))) ~~ ps);
berghofe@13467
   117
wenzelm@17959
   118
    val thm = OldGoals.simple_prove_goal_cterm (cert (Logic.list_implies (prems, concl)))
berghofe@13467
   119
      (fn prems =>
berghofe@13467
   120
         [rewrite_goals_tac (map mk_meta_eq [fst_conv, snd_conv]),
berghofe@13467
   121
          rtac (cterm_instantiate inst induction) 1,
wenzelm@23590
   122
          ALLGOALS ObjectLogic.atomize_prems_tac,
haftmann@26359
   123
          rewrite_goals_tac (@{thm o_def} :: map mk_meta_eq rec_rewrites),
berghofe@13467
   124
          REPEAT ((resolve_tac prems THEN_ALL_NEW (fn i =>
berghofe@13467
   125
            REPEAT (etac allE i) THEN atac i)) 1)]);
berghofe@13467
   126
wenzelm@21646
   127
    val ind_name = Thm.get_name induction;
skalberg@15570
   128
    val vs = map (fn i => List.nth (pnames, i)) is;
haftmann@18358
   129
    val (thm', thy') = thy
wenzelm@30435
   130
      |> Sign.root_path
wenzelm@30435
   131
      |> PureThy.store_thm
wenzelm@30435
   132
        (Binding.qualified_name (space_implode "_" (ind_name :: vs @ ["correctness"])), thm)
wenzelm@24712
   133
      ||> Sign.restore_naming thy;
berghofe@13467
   134
wenzelm@20286
   135
    val ivs = rev (Term.add_vars (Logic.varify (DatatypeProp.make_ind [descr] sorts)) []);
wenzelm@22691
   136
    val rvs = rev (Thm.fold_terms Term.add_vars thm' []);
berghofe@13725
   137
    val ivs1 = map Var (filter_out (fn (_, T) =>
berghofe@13725
   138
      tname_of (body_type T) mem ["set", "bool"]) ivs);
haftmann@17521
   139
    val ivs2 = map (fn (ixn, _) => Var (ixn, valOf (AList.lookup (op =) rvs ixn))) ivs;
berghofe@13467
   140
wenzelm@30190
   141
    val prf = List.foldr forall_intr_prf
wenzelm@30190
   142
     (List.foldr (fn ((f, p), prf) =>
berghofe@13467
   143
        (case head_of (strip_abs_body f) of
berghofe@13467
   144
           Free (s, T) =>
wenzelm@19806
   145
             let val T' = Logic.varifyT T
skalberg@15531
   146
             in Abst (s, SOME T', Proofterm.prf_abstract_over
skalberg@15531
   147
               (Var ((s, 0), T')) (AbsP ("H", SOME p, prf)))
berghofe@13467
   148
             end
skalberg@15531
   149
         | _ => AbsP ("H", SOME p, prf)))
skalberg@15574
   150
           (Proofterm.proof_combP
skalberg@15574
   151
             (prf_of thm', map PBound (length prems - 1 downto 0))) (rec_fns ~~ prems_of thm)) ivs2;
berghofe@13467
   152
wenzelm@30190
   153
    val r' = if null is then r else Logic.varify (List.foldr (uncurry lambda)
skalberg@15574
   154
      r (map Logic.unvarify ivs1 @ filter_out is_unit
skalberg@15574
   155
          (map (head_of o strip_abs_body) rec_fns)));
berghofe@13467
   156
berghofe@13467
   157
  in Extraction.add_realizers_i [(ind_name, (vs, r', prf))] thy' end;
berghofe@13467
   158
berghofe@13467
   159
haftmann@24699
   160
fun make_casedists sorts ({index, descr, case_name, case_rewrites, exhaustion, ...} : datatype_info) thy =
berghofe@13467
   161
  let
wenzelm@19806
   162
    val cert = cterm_of thy;
berghofe@13467
   163
    val rT = TFree ("'P", HOLogic.typeS);
berghofe@13467
   164
    val rT' = TVar (("'P", 0), HOLogic.typeS);
berghofe@13467
   165
berghofe@13467
   166
    fun make_casedist_prem T (cname, cargs) =
berghofe@13467
   167
      let
berghofe@13467
   168
        val Ts = map (typ_of_dtyp descr sorts) cargs;
wenzelm@20071
   169
        val frees = Name.variant_list ["P", "y"] (DatatypeProp.make_tnames Ts) ~~ Ts;
berghofe@13467
   170
        val free_ts = map Free frees;
wenzelm@30364
   171
        val r = Free ("r" ^ Long_Name.base_name cname, Ts ---> rT)
berghofe@13467
   172
      in (r, list_all_free (frees, Logic.mk_implies (HOLogic.mk_Trueprop
berghofe@13467
   173
        (HOLogic.mk_eq (Free ("y", T), list_comb (Const (cname, Ts ---> T), free_ts))),
berghofe@13467
   174
          HOLogic.mk_Trueprop (Free ("P", rT --> HOLogic.boolT) $
berghofe@13467
   175
            list_comb (r, free_ts)))))
berghofe@13467
   176
      end;
berghofe@13467
   177
haftmann@17521
   178
    val SOME (_, _, constrs) = AList.lookup (op =) descr index;
skalberg@15570
   179
    val T = List.nth (get_rec_types descr sorts, index);
berghofe@13467
   180
    val (rs, prems) = split_list (map (make_casedist_prem T) constrs);
berghofe@13467
   181
    val r = Const (case_name, map fastype_of rs ---> T --> rT);
berghofe@13467
   182
wenzelm@19806
   183
    val y = Var (("y", 0), Logic.legacy_varifyT T);
berghofe@13467
   184
    val y' = Free ("y", T);
berghofe@13467
   185
wenzelm@17959
   186
    val thm = OldGoals.prove_goalw_cterm [] (cert (Logic.list_implies (prems,
berghofe@13467
   187
      HOLogic.mk_Trueprop (Free ("P", rT --> HOLogic.boolT) $
berghofe@13467
   188
        list_comb (r, rs @ [y'])))))
berghofe@13467
   189
      (fn prems =>
berghofe@13467
   190
         [rtac (cterm_instantiate [(cert y, cert y')] exhaustion) 1,
berghofe@13467
   191
          ALLGOALS (EVERY'
berghofe@13467
   192
            [asm_simp_tac (HOL_basic_ss addsimps case_rewrites),
berghofe@13467
   193
             resolve_tac prems, asm_simp_tac HOL_basic_ss])]);
berghofe@13467
   194
wenzelm@21646
   195
    val exh_name = Thm.get_name exhaustion;
haftmann@18358
   196
    val (thm', thy') = thy
wenzelm@30435
   197
      |> Sign.root_path
wenzelm@30435
   198
      |> PureThy.store_thm (Binding.qualified_name (exh_name ^ "_P_correctness"), thm)
wenzelm@24712
   199
      ||> Sign.restore_naming thy;
berghofe@13467
   200
berghofe@13725
   201
    val P = Var (("P", 0), rT' --> HOLogic.boolT);
berghofe@13467
   202
    val prf = forall_intr_prf (y, forall_intr_prf (P,
wenzelm@30190
   203
      List.foldr (fn ((p, r), prf) =>
wenzelm@19806
   204
        forall_intr_prf (Logic.legacy_varify r, AbsP ("H", SOME (Logic.varify p),
skalberg@15574
   205
          prf))) (Proofterm.proof_combP (prf_of thm',
skalberg@15574
   206
            map PBound (length prems - 1 downto 0))) (prems ~~ rs)));
wenzelm@19806
   207
    val r' = Logic.legacy_varify (Abs ("y", Logic.legacy_varifyT T,
berghofe@13725
   208
      list_abs (map dest_Free rs, list_comb (r,
berghofe@13725
   209
        map Bound ((length rs - 1 downto 0) @ [length rs])))));
berghofe@13467
   210
berghofe@13467
   211
  in Extraction.add_realizers_i
berghofe@13467
   212
    [(exh_name, (["P"], r', prf)),
berghofe@13725
   213
     (exh_name, ([], Extraction.nullt, prf_of exhaustion))] thy'
berghofe@13467
   214
  end;
berghofe@13467
   215
haftmann@31668
   216
fun add_dt_realizers config names thy =
wenzelm@25223
   217
  if ! Proofterm.proofs < 2 then thy
haftmann@24699
   218
  else let
haftmann@31668
   219
    val _ = message config "Adding realizers for induction and case analysis ..."
haftmann@31723
   220
    val infos = map (Datatype.the_datatype thy) names;
haftmann@24699
   221
    val info :: _ = infos;
haftmann@24699
   222
  in
haftmann@24699
   223
    thy
haftmann@24699
   224
    |> fold_rev (make_ind (#sorts info) info) (subsets 0 (length (#descr info) - 1))
haftmann@24699
   225
    |> fold_rev (make_casedists (#sorts info)) infos
haftmann@24699
   226
  end;
berghofe@13467
   227
haftmann@31723
   228
val setup = Datatype.interpretation add_dt_realizers;
berghofe@13467
   229
berghofe@13467
   230
end;