src/HOL/Library/reflection.ML
author wenzelm
Fri Apr 08 13:31:16 2011 +0200 (2011-04-08)
changeset 42284 326f57825e1a
parent 38864 4abe644fcea5
child 42361 23f352990944
permissions -rw-r--r--
explicit structure Syntax_Trans;
discontinued old-style constrainAbsC;
haftmann@29650
     1
(*  Title:      HOL/Library/reflection.ML
haftmann@29650
     2
    Author:     Amine Chaieb, TU Muenchen
wenzelm@20319
     3
wenzelm@20319
     4
A trial for automatical reification.
wenzelm@20319
     5
*)
wenzelm@20319
     6
wenzelm@29269
     7
signature REFLECTION =
wenzelm@29269
     8
sig
wenzelm@20319
     9
  val genreify_tac: Proof.context -> thm list -> term option -> int -> tactic
chaieb@23648
    10
  val reflection_tac: Proof.context -> thm list -> thm list -> term option -> int -> tactic
haftmann@21878
    11
  val gen_reflection_tac: Proof.context -> (cterm -> thm)
chaieb@23648
    12
    -> thm list -> thm list -> term option -> int -> tactic
hoelzl@31810
    13
  val genreif : Proof.context -> thm list -> term -> thm
wenzelm@20319
    14
end;
wenzelm@20319
    15
wenzelm@29269
    16
structure Reflection : REFLECTION =
wenzelm@29269
    17
struct
wenzelm@20319
    18
haftmann@29650
    19
val ext2 = @{thm ext2};
haftmann@29650
    20
val nth_Cons_0 = @{thm nth_Cons_0};
haftmann@29650
    21
val nth_Cons_Suc = @{thm nth_Cons_Suc};
wenzelm@21669
    22
chaieb@20374
    23
  (* Make a congruence rule out of a defining equation for the interpretation *)
chaieb@20374
    24
  (* th is one defining equation of f, i.e.
chaieb@20374
    25
     th is "f (Cp ?t1 ... ?tn) = P(f ?t1, .., f ?tn)" *)
chaieb@20374
    26
  (* Cp is a constructor pattern and P is a pattern *)
chaieb@20374
    27
chaieb@20374
    28
  (* The result is:
chaieb@20374
    29
      [|?A1 = f ?t1 ; .. ; ?An= f ?tn |] ==> P (?A1, .., ?An) = f (Cp ?t1 .. ?tn) *)
chaieb@20374
    30
  (*  + the a list of names of the A1 .. An, Those are fresh in the ctxt*)
chaieb@20374
    31
hoelzl@31386
    32
fun mk_congeq ctxt fs th =
hoelzl@31386
    33
  let
hoelzl@31386
    34
   val (f as Const(fN,fT)) = th |> prop_of |> HOLogic.dest_Trueprop |> HOLogic.dest_eq
haftmann@29650
    35
     |> fst |> strip_comb |> fst
chaieb@20374
    36
   val thy = ProofContext.theory_of ctxt
chaieb@20374
    37
   val cert = Thm.cterm_of thy
wenzelm@31794
    38
   val (((_,_),[th']), ctxt') = Variable.import true [th] ctxt
chaieb@20374
    39
   val (lhs, rhs) = HOLogic.dest_eq (HOLogic.dest_Trueprop (Thm.prop_of th'))
hoelzl@31386
    40
   fun add_fterms (t as t1 $ t2) =
wenzelm@29269
    41
       if exists (fn f => Term.could_unify (t |> strip_comb |> fst, f)) fs then insert (op aconv) t
chaieb@20564
    42
       else add_fterms t1 #> add_fterms t2
hoelzl@31386
    43
     | add_fterms (t as Abs(xn,xT,t')) =
wenzelm@29273
    44
       if exists_Const (fn (c, _) => c = fN) t then (fn _ => [t]) else (fn _ => [])
chaieb@20374
    45
     | add_fterms _ = I
chaieb@20374
    46
   val fterms = add_fterms rhs []
wenzelm@20797
    47
   val (xs, ctxt'') = Variable.variant_fixes (replicate (length fterms) "x") ctxt'
chaieb@20374
    48
   val tys = map fastype_of fterms
chaieb@20374
    49
   val vs = map Free (xs ~~ tys)
chaieb@20374
    50
   val env = fterms ~~ vs
wenzelm@32960
    51
                    (* FIXME!!!!*)
chaieb@20564
    52
   fun replace_fterms (t as t1 $ t2) =
chaieb@20374
    53
       (case AList.lookup (op aconv) env t of
wenzelm@32960
    54
            SOME v => v
wenzelm@32960
    55
          | NONE => replace_fterms t1 $ replace_fterms t2)
chaieb@20374
    56
     | replace_fterms t = (case AList.lookup (op aconv) env t of
wenzelm@32960
    57
                               SOME v => v
wenzelm@32960
    58
                             | NONE => t)
hoelzl@31386
    59
chaieb@20374
    60
   fun mk_def (Abs(x,xT,t),v) = HOLogic.mk_Trueprop ((HOLogic.all_const xT)$ Abs(x,xT,HOLogic.mk_eq(v$(Bound 0), t)))
chaieb@20374
    61
     | mk_def (t, v) = HOLogic.mk_Trueprop (HOLogic.mk_eq (v, t))
chaieb@23605
    62
   fun tryext x = (x RS ext2 handle THM _ =>  x)
chaieb@20374
    63
   val cong = (Goal.prove ctxt'' [] (map mk_def env)
wenzelm@32960
    64
                          (HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, replace_fterms rhs)))
wenzelm@35624
    65
                          (fn x => Local_Defs.unfold_tac (#context x) (map tryext (#prems x))
wenzelm@32960
    66
                                                        THEN rtac th' 1)) RS sym
hoelzl@31386
    67
hoelzl@31386
    68
   val (cong' :: vars') =
chaieb@20374
    69
       Variable.export ctxt'' ctxt (cong :: map (Drule.mk_term o cert) vs)
chaieb@20374
    70
   val vs' = map (fst o fst o Term.dest_Var o Thm.term_of o Drule.dest_term) vars'
hoelzl@31386
    71
hoelzl@31386
    72
  in  (vs', cong') end;
wenzelm@20319
    73
 (* congs is a list of pairs (P,th) where th is a theorem for *)
wenzelm@20319
    74
        (* [| f p1 = A1; ...; f pn = An|] ==> f (C p1 .. pn) = P *)
wenzelm@20319
    75
val FWD = curry (op OF);
wenzelm@20319
    76
wenzelm@20319
    77
chaieb@20374
    78
exception REIF of string;
chaieb@20374
    79
hoelzl@31412
    80
fun dest_listT (Type (@{type_name "list"}, [T])) = T;
hoelzl@29834
    81
hoelzl@31386
    82
fun rearrange congs =
hoelzl@31386
    83
  let
hoelzl@31386
    84
    fun P (_, th) =
haftmann@38864
    85
      let val @{term "Trueprop"}$(Const (@{const_name HOL.eq},_) $l$_) = concl_of th
hoelzl@31386
    86
      in can dest_Var l end
hoelzl@31386
    87
    val (yes,no) = List.partition P congs
hoelzl@31386
    88
  in no @ yes end
hoelzl@29834
    89
hoelzl@29834
    90
fun genreif ctxt raw_eqs t =
hoelzl@31386
    91
  let
hoelzl@31412
    92
    fun index_of t bds =
hoelzl@31386
    93
      let
hoelzl@31386
    94
        val tt = HOLogic.listT (fastype_of t)
hoelzl@31386
    95
      in
hoelzl@31387
    96
       (case AList.lookup Type.could_unify bds tt of
hoelzl@31386
    97
          NONE => error "index_of : type not found in environements!"
hoelzl@31386
    98
        | SOME (tbs,tats) =>
hoelzl@31386
    99
          let
haftmann@31986
   100
            val i = find_index (fn t' => t' = t) tats
haftmann@31986
   101
            val j = find_index (fn t' => t' = t) tbs
hoelzl@31387
   102
          in (if j = ~1 then
hoelzl@31387
   103
              if i = ~1
hoelzl@31412
   104
              then (length tbs + length tats,
hoelzl@31412
   105
                    AList.update Type.could_unify (tt,(tbs,tats@[t])) bds)
hoelzl@31412
   106
              else (i, bds) else (j, bds))
hoelzl@31386
   107
          end)
hoelzl@31386
   108
      end;
hoelzl@31386
   109
hoelzl@31386
   110
    (* Generic decomp for reification : matches the actual term with the
hoelzl@31386
   111
       rhs of one cong rule. The result of the matching guides the
hoelzl@31386
   112
       proof synthesis: The matches of the introduced Variables A1 .. An are
hoelzl@31386
   113
       processed recursively
hoelzl@31386
   114
       The rest is instantiated in the cong rule,i.e. no reification is needed *)
chaieb@20564
   115
hoelzl@31386
   116
    (* da is the decomposition for atoms, ie. it returns ([],g) where g
hoelzl@31386
   117
       returns the right instance f (AtC n) = t , where AtC is the Atoms
hoelzl@31386
   118
       constructor and n is the number of the atom corresponding to t *)
hoelzl@31412
   119
    fun decomp_genreif da cgns (t,ctxt) bds =
hoelzl@31386
   120
      let
hoelzl@31386
   121
        val thy = ProofContext.theory_of ctxt
chaieb@20374
   122
        val cert = cterm_of thy
hoelzl@31412
   123
        fun tryabsdecomp (s,ctxt) bds =
hoelzl@31386
   124
          (case s of
hoelzl@31386
   125
             Abs(xn,xT,ta) => (
hoelzl@31386
   126
               let
hoelzl@31386
   127
                 val ([xn],ctxt') = Variable.variant_fixes ["x"] ctxt
wenzelm@42284
   128
                 val (xn,ta) = Syntax_Trans.variant_abs (xn,xT,ta)  (* FIXME !? *)
hoelzl@31386
   129
                 val x = Free(xn,xT)
hoelzl@31387
   130
                 val bds = (case AList.lookup Type.could_unify bds (HOLogic.listT xT)
wenzelm@32960
   131
                          of NONE => error "tryabsdecomp: Type not found in the Environement"
hoelzl@31386
   132
                           | SOME (bsT,atsT) =>
hoelzl@31387
   133
                             (AList.update Type.could_unify (HOLogic.listT xT, ((x::bsT), atsT)) bds))
hoelzl@31412
   134
               in (([(ta, ctxt')],
hoelzl@31412
   135
                    fn ([th], bds) =>
wenzelm@36945
   136
                      (hd (Variable.export ctxt' ctxt [(Thm.forall_intr (cert x) th) COMP allI]),
hoelzl@31412
   137
                       let val (bsT,asT) = the(AList.lookup Type.could_unify bds (HOLogic.listT xT))
wenzelm@32960
   138
                       in AList.update Type.could_unify (HOLogic.listT xT,(tl bsT,asT)) bds
wenzelm@32960
   139
                       end)),
hoelzl@31412
   140
                   bds)
hoelzl@31386
   141
               end)
hoelzl@31412
   142
           | _ => da (s,ctxt) bds)
wenzelm@37117
   143
      in
wenzelm@37117
   144
        (case cgns of
hoelzl@31412
   145
          [] => tryabsdecomp (t,ctxt) bds
wenzelm@37117
   146
        | ((vns,cong)::congs) =>
wenzelm@37117
   147
            (let
wenzelm@37117
   148
              val cert = cterm_of thy
wenzelm@37117
   149
              val certy = ctyp_of thy
wenzelm@37117
   150
              val (tyenv, tmenv) =
wenzelm@37117
   151
                Pattern.match thy
wenzelm@37117
   152
                  ((fst o HOLogic.dest_eq o HOLogic.dest_Trueprop) (concl_of cong), t)
wenzelm@37117
   153
                  (Vartab.empty, Vartab.empty)
wenzelm@37117
   154
              val (fnvs,invs) = List.partition (fn ((vn,_),_) => member (op =) vns vn) (Vartab.dest tmenv)
wenzelm@37117
   155
              val (fts,its) =
wenzelm@37117
   156
                (map (snd o snd) fnvs,
wenzelm@37117
   157
                 map (fn ((vn,vi),(tT,t)) => (cert(Var ((vn,vi),tT)), cert t)) invs)
wenzelm@37117
   158
              val ctyenv = map (fn ((vn,vi),(s,ty)) => (certy (TVar((vn,vi),s)), certy ty)) (Vartab.dest tyenv)
wenzelm@37117
   159
            in ((fts ~~ (replicate (length fts) ctxt),
wenzelm@37117
   160
                 Library.apfst (FWD (instantiate (ctyenv, its) cong))), bds)
wenzelm@37117
   161
            end handle Pattern.MATCH => decomp_genreif da congs (t,ctxt) bds))
hoelzl@31386
   162
      end;
chaieb@23648
   163
chaieb@23648
   164
 (* looks for the atoms equation and instantiates it with the right number *)
hoelzl@31412
   165
    fun mk_decompatom eqs (t,ctxt) bds = (([], fn (_, bds) =>
hoelzl@31386
   166
      let
hoelzl@31386
   167
        val tT = fastype_of t
hoelzl@31386
   168
        fun isat eq =
hoelzl@31386
   169
          let
hoelzl@31386
   170
            val rhs = eq |> prop_of |> HOLogic.dest_Trueprop |> HOLogic.dest_eq |> snd
hoelzl@31386
   171
          in exists_Const
wenzelm@32960
   172
            (fn (n,ty) => n = @{const_name "List.nth"}
hoelzl@31386
   173
                          andalso
wenzelm@32960
   174
                          AList.defined Type.could_unify bds (domain_type ty)) rhs
hoelzl@31386
   175
            andalso Type.could_unify (fastype_of rhs, tT)
hoelzl@31386
   176
          end
hoelzl@31386
   177
hoelzl@31386
   178
        fun get_nths t acc =
hoelzl@31386
   179
          case t of
hoelzl@31412
   180
            Const(@{const_name "List.nth"},_)$vs$n => insert (fn ((a,_),(b,_)) => a aconv b) (t,(vs,n)) acc
hoelzl@31386
   181
          | t1$t2 => get_nths t1 (get_nths t2 acc)
hoelzl@31386
   182
          | Abs(_,_,t') => get_nths t'  acc
hoelzl@31386
   183
          | _ => acc
chaieb@23548
   184
hoelzl@31386
   185
        fun
hoelzl@31412
   186
           tryeqs [] bds = error "Can not find the atoms equation"
hoelzl@31412
   187
         | tryeqs (eq::eqs) bds = ((
hoelzl@31386
   188
          let
hoelzl@31386
   189
            val rhs = eq |> prop_of |> HOLogic.dest_Trueprop  |> HOLogic.dest_eq |> snd
hoelzl@31386
   190
            val nths = get_nths rhs []
hoelzl@31386
   191
            val (vss,ns) = fold_rev (fn (_,(vs,n)) => fn (vss,ns) =>
hoelzl@31386
   192
                                      (insert (op aconv) vs vss, insert (op aconv) n ns)) nths ([],[])
hoelzl@31386
   193
            val (vsns, ctxt') = Variable.variant_fixes (replicate (length vss) "vs") ctxt
hoelzl@31386
   194
            val (xns, ctxt'') = Variable.variant_fixes (replicate (length nths) "x") ctxt'
hoelzl@31386
   195
            val thy = ProofContext.theory_of ctxt''
hoelzl@31386
   196
            val cert = cterm_of thy
hoelzl@31386
   197
            val certT = ctyp_of thy
hoelzl@31386
   198
            val vsns_map = vss ~~ vsns
hoelzl@31386
   199
            val xns_map = (fst (split_list nths)) ~~ xns
hoelzl@31386
   200
            val subst = map (fn (nt, xn) => (nt, Var ((xn,0), fastype_of nt))) xns_map
hoelzl@31386
   201
            val rhs_P = subst_free subst rhs
wenzelm@32032
   202
            val (tyenv, tmenv) = Pattern.match thy (rhs_P, t) (Vartab.empty, Vartab.empty)
wenzelm@32035
   203
            val sbst = Envir.subst_term (tyenv, tmenv)
wenzelm@32035
   204
            val sbsT = Envir.subst_type tyenv
hoelzl@31386
   205
            val subst_ty = map (fn (n,(s,t)) => (certT (TVar (n, s)), certT t))
hoelzl@31386
   206
                               (Vartab.dest tyenv)
hoelzl@31386
   207
            val tml = Vartab.dest tmenv
hoelzl@31412
   208
            val t's = map (fn xn => snd (the (AList.lookup (op =) tml (xn,0)))) xns (* FIXME : Express with sbst*)
hoelzl@31412
   209
            val (subst_ns, bds) = fold_map
hoelzl@31412
   210
                (fn (Const _ $ vs $ n, Var (xn0,T)) => fn bds =>
hoelzl@31387
   211
                  let
hoelzl@31412
   212
                    val name = snd (the (AList.lookup (op =) tml xn0))
hoelzl@31412
   213
                    val (idx, bds) = index_of name bds
hoelzl@31412
   214
                  in ((cert n, idx |> (HOLogic.mk_nat #> cert)), bds) end) subst bds
hoelzl@31386
   215
            val subst_vs =
hoelzl@31386
   216
              let
hoelzl@31386
   217
                fun ty (Const _ $ (vs as Var (vsn,lT)) $ n, Var (xn0,T)) = (certT T, certT (sbsT T))
hoelzl@31386
   218
                fun h (Const _ $ (vs as Var (vsn,lT)) $ n, Var (xn0,T)) =
hoelzl@31386
   219
                  let
hoelzl@31412
   220
                    val cns = sbst (Const(@{const_name "List.Cons"}, T --> lT --> lT))
hoelzl@31386
   221
                    val lT' = sbsT lT
hoelzl@31387
   222
                    val (bsT,asT) = the (AList.lookup Type.could_unify bds lT)
hoelzl@31412
   223
                    val vsn = the (AList.lookup (op =) vsns_map vs)
hoelzl@31386
   224
                    val cvs = cert (fold_rev (fn x => fn xs => cns$x$xs) bsT (Free (vsn, lT')))
hoelzl@31386
   225
                  in (cert vs, cvs) end
hoelzl@31386
   226
              in map h subst end
hoelzl@31386
   227
            val cts = map (fn ((vn,vi),(tT,t)) => (cert(Var ((vn,vi),tT)), cert t))
hoelzl@31386
   228
                          (fold (AList.delete (fn (((a: string),_),(b,_)) => a = b))
hoelzl@31386
   229
                                (map (fn n => (n,0)) xns) tml)
hoelzl@31386
   230
            val substt =
hoelzl@31386
   231
              let val ih = Drule.cterm_rule (Thm.instantiate (subst_ty,[]))
hoelzl@31386
   232
              in map (fn (v,t) => (ih v, ih t)) (subst_ns@subst_vs@cts)  end
hoelzl@31386
   233
            val th = (instantiate (subst_ty, substt)  eq) RS sym
hoelzl@31412
   234
          in (hd (Variable.export ctxt'' ctxt [th]), bds) end)
wenzelm@37117
   235
          handle Pattern.MATCH => tryeqs eqs bds)
hoelzl@31412
   236
      in tryeqs (filter isat eqs) bds end), bds);
chaieb@20374
   237
wenzelm@20319
   238
  (* Generic reification procedure: *)
wenzelm@20319
   239
  (* creates all needed cong rules and then just uses the theorem synthesis *)
chaieb@20564
   240
hoelzl@31386
   241
    fun mk_congs ctxt raw_eqs =
hoelzl@31386
   242
      let
hoelzl@31386
   243
        val fs = fold_rev (fn eq =>
hoelzl@31386
   244
                           insert (op =) (eq |> prop_of |> HOLogic.dest_Trueprop
hoelzl@31386
   245
                           |> HOLogic.dest_eq |> fst |> strip_comb
hoelzl@31386
   246
                           |> fst)) raw_eqs []
hoelzl@31386
   247
        val tys = fold_rev (fn f => fold (insert (op =)) (f |> fastype_of |> binder_types |> tl)
hoelzl@31386
   248
                            ) fs []
hoelzl@31386
   249
        val (vs, ctxt') = Variable.variant_fixes (replicate (length tys) "vs") ctxt
hoelzl@31386
   250
        val thy = ProofContext.theory_of ctxt'
hoelzl@31386
   251
        val cert = cterm_of thy
hoelzl@31386
   252
        val vstys = map (fn (t,v) => (t,SOME (cert (Free(v,t)))))
hoelzl@31386
   253
                    (tys ~~ vs)
hoelzl@31386
   254
        val is_Var = can dest_Var
hoelzl@31386
   255
        fun insteq eq vs =
hoelzl@31386
   256
          let
hoelzl@31412
   257
            val subst = map (fn (v as Var(n,t)) => (cert v, (the o the) (AList.lookup (op =) vstys t)))
hoelzl@31386
   258
                        (filter is_Var vs)
hoelzl@31386
   259
          in Thm.instantiate ([],subst) eq
hoelzl@31386
   260
          end
chaieb@20564
   261
hoelzl@31387
   262
        val bds = AList.make (fn _ => ([],[])) tys
hoelzl@31386
   263
        val eqs = map (fn eq => eq |> prop_of |> HOLogic.dest_Trueprop
wenzelm@32960
   264
                                   |> HOLogic.dest_eq |> fst |> strip_comb |> snd |> tl
hoelzl@31386
   265
                                   |> (insteq eq)) raw_eqs
hoelzl@31386
   266
        val (ps,congs) = split_list (map (mk_congeq ctxt' fs) eqs)
hoelzl@31412
   267
      in (ps ~~ (Variable.export ctxt' ctxt congs), bds)
hoelzl@31386
   268
      end
hoelzl@31386
   269
hoelzl@31412
   270
    val (congs, bds) = mk_congs ctxt raw_eqs
hoelzl@31387
   271
    val congs = rearrange congs
hoelzl@31412
   272
    val (th, bds) = divide_and_conquer' (decomp_genreif (mk_decompatom raw_eqs) congs) (t,ctxt) bds
hoelzl@31386
   273
    fun is_listVar (Var (_,t)) = can dest_listT t
hoelzl@31386
   274
         | is_listVar _ = false
hoelzl@31386
   275
    val vars = th |> prop_of |> HOLogic.dest_Trueprop |> HOLogic.dest_eq |> snd
wenzelm@32960
   276
                  |> strip_comb |> snd |> filter is_listVar
hoelzl@31386
   277
    val cert = cterm_of (ProofContext.theory_of ctxt)
hoelzl@31386
   278
    val cvs = map (fn (v as Var(n,t)) => (cert v,
hoelzl@31387
   279
                  the (AList.lookup Type.could_unify bds t) |> snd |> HOLogic.mk_list (dest_listT t) |> cert)) vars
hoelzl@31386
   280
    val th' = instantiate ([], cvs) th
hoelzl@31386
   281
    val t' = (fst o HOLogic.dest_eq o HOLogic.dest_Trueprop o prop_of) th'
hoelzl@31386
   282
    val th'' = Goal.prove ctxt [] [] (HOLogic.mk_Trueprop (HOLogic.mk_eq (t, t')))
wenzelm@32960
   283
               (fn _ => simp_tac (simpset_of ctxt) 1)
hoelzl@31386
   284
  in FWD trans [th'',th']
hoelzl@31386
   285
  end
wenzelm@20319
   286
chaieb@23648
   287
chaieb@23648
   288
fun genreflect ctxt conv corr_thms raw_eqs t =
hoelzl@31386
   289
  let
hoelzl@31386
   290
    val reifth = genreif ctxt raw_eqs t
hoelzl@31386
   291
    fun trytrans [] = error "No suitable correctness theorem found"
hoelzl@31386
   292
      | trytrans (th::ths) =
hoelzl@31386
   293
           (FWD trans [reifth, th RS sym] handle THM _ => trytrans ths)
hoelzl@31386
   294
    val th = trytrans corr_thms
hoelzl@31386
   295
    val ft = (Thm.dest_arg1 o Thm.dest_arg o Thm.dest_arg o cprop_of) th
hoelzl@31386
   296
    val rth = conv ft
hoelzl@31386
   297
  in simplify (HOL_basic_ss addsimps raw_eqs addsimps [nth_Cons_0, nth_Cons_Suc])
hoelzl@31386
   298
             (simplify (HOL_basic_ss addsimps [rth]) th)
hoelzl@31386
   299
  end
wenzelm@20319
   300
wenzelm@20319
   301
fun genreify_tac ctxt eqs to i = (fn st =>
wenzelm@20319
   302
  let
hoelzl@31412
   303
    fun P () = HOLogic.dest_Trueprop (nth (prems_of st) (i - 1))
hoelzl@29805
   304
    val t = (case to of NONE => P () | SOME x => x)
wenzelm@20319
   305
    val th = (genreif ctxt eqs t) RS ssubst
wenzelm@20319
   306
  in rtac th i st
wenzelm@20319
   307
  end);
wenzelm@20319
   308
wenzelm@20319
   309
    (* Reflection calls reification and uses the correctness *)
wenzelm@20319
   310
        (* theorem assumed to be the dead of the list *)
chaieb@23648
   311
fun gen_reflection_tac ctxt conv corr_thms raw_eqs to i = (fn st =>
haftmann@21878
   312
  let
haftmann@21878
   313
    val P = HOLogic.dest_Trueprop (nth (prems_of st) (i - 1));
haftmann@21878
   314
    val t = the_default P to;
chaieb@23648
   315
    val th = genreflect ctxt conv corr_thms raw_eqs t
haftmann@21878
   316
      RS ssubst;
nipkow@23791
   317
  in (rtac th i THEN TRY(rtac TrueI i)) st end);
haftmann@21878
   318
nipkow@23791
   319
fun reflection_tac ctxt = gen_reflection_tac ctxt Codegen.evaluation_conv;
haftmann@30969
   320
  (*FIXME why Codegen.evaluation_conv?  very specific...*)
haftmann@29650
   321
wenzelm@20797
   322
end