src/FOLP/hypsubst.ML
author haftmann
Wed May 05 18:25:34 2010 +0200 (2010-05-05)
changeset 36692 54b64d4ad524
parent 35762 af3ff2ba4c54
child 37744 3daaf23b9ab4
permissions -rw-r--r--
farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
clasohm@1459
     1
(*  Title:      FOLP/hypsubst
clasohm@1459
     2
    Author:     Martin D Coen, Cambridge University Computer Laboratory
lcp@1022
     3
    Copyright   1995  University of Cambridge
lcp@1022
     4
lcp@1022
     5
Original version of Provers/hypsubst.  Cannot use new version because it
lcp@1022
     6
relies on the new simplifier!
lcp@1022
     7
lcp@1022
     8
Martin Coen's tactic for substitution in the hypotheses
lcp@1022
     9
*)
lcp@1022
    10
lcp@1022
    11
signature HYPSUBST_DATA =
lcp@1022
    12
  sig
clasohm@1459
    13
  val dest_eq   : term -> term*term
clasohm@1459
    14
  val imp_intr  : thm           (* (P ==> Q) ==> P-->Q *)
clasohm@1459
    15
  val rev_mp    : thm           (* [| P;  P-->Q |] ==> Q *)
clasohm@1459
    16
  val subst     : thm           (* [| a=b;  P(a) |] ==> P(b) *)
clasohm@1459
    17
  val sym       : thm           (* a=b ==> b=a *)
lcp@1022
    18
  end;
lcp@1022
    19
lcp@1022
    20
signature HYPSUBST =
lcp@1022
    21
  sig
lcp@1022
    22
  val bound_hyp_subst_tac : int -> tactic
lcp@1022
    23
  val hyp_subst_tac       : int -> tactic
lcp@1022
    24
    (*exported purely for debugging purposes*)
lcp@1022
    25
  val eq_var              : bool -> term -> int * thm
lcp@1022
    26
  val inspect_pair        : bool -> term * term -> thm
lcp@1022
    27
  end;
lcp@1022
    28
wenzelm@32449
    29
functor HypsubstFun(Data: HYPSUBST_DATA): HYPSUBST =
lcp@1022
    30
struct
lcp@1022
    31
lcp@1022
    32
local open Data in
lcp@1022
    33
lcp@1022
    34
exception EQ_VAR;
lcp@1022
    35
haftmann@36692
    36
fun loose (i, t) = member (op =) (add_loose_bnos (t, i, [])) 0;
lcp@1022
    37
lcp@1022
    38
(*It's not safe to substitute for a constant; consider 0=1.
lcp@1022
    39
  It's not safe to substitute for x=t[x] since x is not eliminated.
lcp@1022
    40
  It's not safe to substitute for a Var; what if it appears in other goals?
lcp@1022
    41
  It's not safe to substitute for a variable free in the premises,
lcp@1022
    42
    but how could we check for this?*)
lcp@1022
    43
fun inspect_pair bnd (t,u) =
berghofe@26830
    44
  case (Envir.eta_contract t, Envir.eta_contract u) of
wenzelm@32449
    45
       (Bound i, _) => if loose(i,u) then raise Match
clasohm@1459
    46
                       else sym         (*eliminates t*)
wenzelm@32449
    47
     | (_, Bound i) => if loose(i,t) then raise Match
clasohm@1459
    48
                       else asm_rl      (*eliminates u*)
wenzelm@32449
    49
     | (Free _, _) => if bnd orelse Logic.occs(t,u) then raise Match
clasohm@1459
    50
                      else sym          (*eliminates t*)
wenzelm@32449
    51
     | (_, Free _) => if bnd orelse Logic.occs(u,t) then raise Match
clasohm@1459
    52
                      else asm_rl       (*eliminates u*)
lcp@1022
    53
     | _ => raise Match;
lcp@1022
    54
lcp@1022
    55
(*Locates a substitutable variable on the left (resp. right) of an equality
lcp@1022
    56
   assumption.  Returns the number of intervening assumptions, paried with
lcp@1022
    57
   the rule asm_rl (resp. sym). *)
lcp@1022
    58
fun eq_var bnd =
lcp@1022
    59
  let fun eq_var_aux k (Const("all",_) $ Abs(_,_,t)) = eq_var_aux k t
wenzelm@32449
    60
        | eq_var_aux k (Const("==>",_) $ A $ B) =
clasohm@1459
    61
              ((k, inspect_pair bnd (dest_eq A))
clasohm@1459
    62
                      (*Exception Match comes from inspect_pair or dest_eq*)
clasohm@1459
    63
               handle Match => eq_var_aux (k+1) B)
clasohm@1459
    64
        | eq_var_aux k _ = raise EQ_VAR
lcp@1022
    65
  in  eq_var_aux 0  end;
lcp@1022
    66
lcp@1022
    67
(*Select a suitable equality assumption and substitute throughout the subgoal
lcp@1022
    68
  Replaces only Bound variables if bnd is true*)
paulson@3537
    69
fun gen_hyp_subst_tac bnd = SUBGOAL(fn (Bi,i) =>
paulson@3537
    70
      let val n = length(Logic.strip_assums_hyp Bi) - 1
clasohm@1459
    71
          val (k,symopt) = eq_var bnd Bi
wenzelm@32449
    72
      in
paulson@3537
    73
         DETERM
paulson@3537
    74
           (EVERY [REPEAT_DETERM_N k (etac rev_mp i),
wenzelm@32449
    75
                   etac revcut_rl i,
wenzelm@32449
    76
                   REPEAT_DETERM_N (n-k) (etac rev_mp i),
wenzelm@32449
    77
                   etac (symopt RS subst) i,
wenzelm@32449
    78
                   REPEAT_DETERM_N n (rtac imp_intr i)])
lcp@1022
    79
      end
paulson@3537
    80
      handle THM _ => no_tac | EQ_VAR => no_tac);
lcp@1022
    81
lcp@1022
    82
(*Substitutes for Free or Bound variables*)
lcp@1022
    83
val hyp_subst_tac = gen_hyp_subst_tac false;
lcp@1022
    84
lcp@1022
    85
(*Substitutes for Bound variables only -- this is always safe*)
lcp@1022
    86
val bound_hyp_subst_tac = gen_hyp_subst_tac true;
lcp@1022
    87
lcp@1022
    88
end
lcp@1022
    89
end;
lcp@1022
    90