author | wenzelm |
Sun, 11 Jul 2004 20:33:22 +0200 | |
changeset 15032 | 02aed07e01bf |
parent 15021 | 6012f983a79f |
child 15442 | 3b75e1b22ff1 |
permissions | -rw-r--r-- |
10805 | 1 |
(* Title: Pure/tactic.ML |
0 | 2 |
ID: $Id$ |
10805 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
0 | 4 |
Copyright 1991 University of Cambridge |
5 |
||
10805 | 6 |
Tactics. |
0 | 7 |
*) |
8 |
||
11774 | 9 |
signature BASIC_TACTIC = |
10 |
sig |
|
10805 | 11 |
val ares_tac : thm list -> int -> tactic |
12 |
val assume_tac : int -> tactic |
|
13 |
val atac : int ->tactic |
|
10817 | 14 |
val bimatch_from_nets_tac: |
1501 | 15 |
(int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net -> int -> tactic |
10805 | 16 |
val bimatch_tac : (bool*thm)list -> int -> tactic |
10817 | 17 |
val biresolution_from_nets_tac: |
10805 | 18 |
('a list -> (bool * thm) list) -> |
19 |
bool -> 'a Net.net * 'a Net.net -> int -> tactic |
|
10817 | 20 |
val biresolve_from_nets_tac: |
1501 | 21 |
(int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net -> int -> tactic |
10805 | 22 |
val biresolve_tac : (bool*thm)list -> int -> tactic |
23 |
val build_net : thm list -> (int*thm) Net.net |
|
1501 | 24 |
val build_netpair: (int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net -> |
25 |
(bool*thm)list -> (int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net |
|
10817 | 26 |
val compose_inst_tac : (string*string)list -> (bool*thm*int) -> |
3409
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
27 |
int -> tactic |
10817 | 28 |
val compose_tac : (bool * thm * int) -> int -> tactic |
10805 | 29 |
val cut_facts_tac : thm list -> int -> tactic |
13650
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
30 |
val cut_rules_tac : thm list -> int -> tactic |
10817 | 31 |
val cut_inst_tac : (string*string)list -> thm -> int -> tactic |
7491 | 32 |
val datac : thm -> int -> int -> tactic |
10805 | 33 |
val defer_tac : int -> tactic |
34 |
val distinct_subgoals_tac : tactic |
|
35 |
val dmatch_tac : thm list -> int -> tactic |
|
36 |
val dresolve_tac : thm list -> int -> tactic |
|
10817 | 37 |
val dres_inst_tac : (string*string)list -> thm -> int -> tactic |
10805 | 38 |
val dtac : thm -> int ->tactic |
7491 | 39 |
val eatac : thm -> int -> int -> tactic |
10805 | 40 |
val etac : thm -> int ->tactic |
10817 | 41 |
val eq_assume_tac : int -> tactic |
10805 | 42 |
val ematch_tac : thm list -> int -> tactic |
43 |
val eresolve_tac : thm list -> int -> tactic |
|
44 |
val eres_inst_tac : (string*string)list -> thm -> int -> tactic |
|
7491 | 45 |
val fatac : thm -> int -> int -> tactic |
10817 | 46 |
val filter_prems_tac : (term -> bool) -> int -> tactic |
10805 | 47 |
val filter_thms : (term*term->bool) -> int*term*thm list -> thm list |
48 |
val filt_resolve_tac : thm list -> int -> int -> tactic |
|
49 |
val flexflex_tac : tactic |
|
50 |
val fold_goals_tac : thm list -> tactic |
|
51 |
val fold_rule : thm list -> thm -> thm |
|
52 |
val fold_tac : thm list -> tactic |
|
10817 | 53 |
val forward_tac : thm list -> int -> tactic |
10805 | 54 |
val forw_inst_tac : (string*string)list -> thm -> int -> tactic |
55 |
val ftac : thm -> int ->tactic |
|
12320 | 56 |
val insert_tagged_brl : ('a * (bool * thm)) * |
57 |
(('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net) -> |
|
58 |
('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net |
|
59 |
val delete_tagged_brl : (bool * thm) * |
|
60 |
(('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net) -> |
|
61 |
('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net |
|
10805 | 62 |
val is_fact : thm -> bool |
63 |
val lessb : (bool * thm) * (bool * thm) -> bool |
|
64 |
val lift_inst_rule : thm * int * (string*string)list * thm -> thm |
|
65 |
val make_elim : thm -> thm |
|
66 |
val match_from_net_tac : (int*thm) Net.net -> int -> tactic |
|
67 |
val match_tac : thm list -> int -> tactic |
|
68 |
val metacut_tac : thm -> int -> tactic |
|
69 |
val net_bimatch_tac : (bool*thm) list -> int -> tactic |
|
70 |
val net_biresolve_tac : (bool*thm) list -> int -> tactic |
|
71 |
val net_match_tac : thm list -> int -> tactic |
|
72 |
val net_resolve_tac : thm list -> int -> tactic |
|
12801 | 73 |
val norm_hhf_rule : thm -> thm |
10805 | 74 |
val norm_hhf_tac : int -> tactic |
75 |
val prune_params_tac : tactic |
|
76 |
val rename_params_tac : string list -> int -> tactic |
|
77 |
val rename_tac : string -> int -> tactic |
|
78 |
val rename_last_tac : string -> string list -> int -> tactic |
|
79 |
val resolve_from_net_tac : (int*thm) Net.net -> int -> tactic |
|
80 |
val resolve_tac : thm list -> int -> tactic |
|
10817 | 81 |
val res_inst_tac : (string*string)list -> thm -> int -> tactic |
10444 | 82 |
val rewrite_goal_tac : thm list -> int -> tactic |
3575
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3554
diff
changeset
|
83 |
val rewrite_goals_rule: thm list -> thm -> thm |
10805 | 84 |
val rewrite_rule : thm list -> thm -> thm |
85 |
val rewrite_goals_tac : thm list -> tactic |
|
86 |
val rewrite_tac : thm list -> tactic |
|
87 |
val rewtac : thm -> tactic |
|
88 |
val rotate_tac : int -> int -> tactic |
|
89 |
val rtac : thm -> int -> tactic |
|
90 |
val rule_by_tactic : tactic -> thm -> thm |
|
91 |
val solve_tac : thm list -> int -> tactic |
|
92 |
val subgoal_tac : string -> int -> tactic |
|
93 |
val subgoals_tac : string list -> int -> tactic |
|
94 |
val subgoals_of_brl : bool * thm -> int |
|
95 |
val term_lift_inst_rule : |
|
1975
eec67972b1bf
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
nipkow
parents:
1966
diff
changeset
|
96 |
thm * int * (indexname*typ)list * ((indexname*typ)*term)list * thm |
eec67972b1bf
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
nipkow
parents:
1966
diff
changeset
|
97 |
-> thm |
10347 | 98 |
val instantiate_tac : (string * string) list -> tactic |
10805 | 99 |
val thin_tac : string -> int -> tactic |
100 |
val trace_goalno_tac : (int -> tactic) -> int -> tactic |
|
11774 | 101 |
end; |
0 | 102 |
|
11774 | 103 |
signature TACTIC = |
104 |
sig |
|
105 |
include BASIC_TACTIC |
|
11929 | 106 |
val innermost_params: int -> thm -> (string * typ) list |
11774 | 107 |
val untaglist: (int * 'a) list -> 'a list |
108 |
val orderlist: (int * 'a) list -> 'a list |
|
109 |
val rewrite: bool -> thm list -> cterm -> thm |
|
110 |
val simplify: bool -> thm list -> thm -> thm |
|
12139 | 111 |
val conjunction_tac: tactic |
11970 | 112 |
val prove: Sign.sg -> string list -> term list -> term -> (thm list -> tactic) -> thm |
113 |
val prove_standard: Sign.sg -> string list -> term list -> term -> (thm list -> tactic) -> thm |
|
11774 | 114 |
end; |
0 | 115 |
|
11774 | 116 |
structure Tactic: TACTIC = |
0 | 117 |
struct |
118 |
||
1501 | 119 |
(*Discover which goal is chosen: SOMEGOAL(trace_goalno_tac tac) *) |
10817 | 120 |
fun trace_goalno_tac tac i st = |
4270 | 121 |
case Seq.pull(tac i st) of |
10805 | 122 |
None => Seq.empty |
12262 | 123 |
| seqcell => (tracing ("Subgoal " ^ string_of_int i ^ " selected"); |
10805 | 124 |
Seq.make(fn()=> seqcell)); |
0 | 125 |
|
126 |
(*Makes a rule by applying a tactic to an existing rule*) |
|
1501 | 127 |
fun rule_by_tactic tac rl = |
2688 | 128 |
let val (st, thaw) = freeze_thaw (zero_var_indexes rl) |
4270 | 129 |
in case Seq.pull (tac st) of |
10805 | 130 |
None => raise THM("rule_by_tactic", 0, [rl]) |
2688 | 131 |
| Some(st',_) => Thm.varifyT (thaw st') |
132 |
end; |
|
10817 | 133 |
|
0 | 134 |
(*** Basic tactics ***) |
135 |
||
136 |
(*** The following fail if the goal number is out of range: |
|
137 |
thus (REPEAT (resolve_tac rules i)) stops once subgoal i disappears. *) |
|
138 |
||
139 |
(*Solve subgoal i by assumption*) |
|
140 |
fun assume_tac i = PRIMSEQ (assumption i); |
|
141 |
||
142 |
(*Solve subgoal i by assumption, using no unification*) |
|
143 |
fun eq_assume_tac i = PRIMITIVE (eq_assumption i); |
|
144 |
||
145 |
(** Resolution/matching tactics **) |
|
146 |
||
147 |
(*The composition rule/state: no lifting or var renaming. |
|
148 |
The arg = (bires_flg, orule, m) ; see bicompose for explanation.*) |
|
149 |
fun compose_tac arg i = PRIMSEQ (bicompose false arg i); |
|
150 |
||
151 |
(*Converts a "destruct" rule like P&Q==>P to an "elimination" rule |
|
152 |
like [| P&Q; P==>R |] ==> R *) |
|
153 |
fun make_elim rl = zero_var_indexes (rl RS revcut_rl); |
|
154 |
||
155 |
(*Attack subgoal i by resolution, using flags to indicate elimination rules*) |
|
156 |
fun biresolve_tac brules i = PRIMSEQ (biresolution false brules i); |
|
157 |
||
158 |
(*Resolution: the simple case, works for introduction rules*) |
|
159 |
fun resolve_tac rules = biresolve_tac (map (pair false) rules); |
|
160 |
||
161 |
(*Resolution with elimination rules only*) |
|
162 |
fun eresolve_tac rules = biresolve_tac (map (pair true) rules); |
|
163 |
||
164 |
(*Forward reasoning using destruction rules.*) |
|
165 |
fun forward_tac rls = resolve_tac (map make_elim rls) THEN' assume_tac; |
|
166 |
||
167 |
(*Like forward_tac, but deletes the assumption after use.*) |
|
168 |
fun dresolve_tac rls = eresolve_tac (map make_elim rls); |
|
169 |
||
170 |
(*Shorthand versions: for resolution with a single theorem*) |
|
7491 | 171 |
val atac = assume_tac; |
172 |
fun rtac rl = resolve_tac [rl]; |
|
173 |
fun dtac rl = dresolve_tac [rl]; |
|
1460 | 174 |
fun etac rl = eresolve_tac [rl]; |
7491 | 175 |
fun ftac rl = forward_tac [rl]; |
176 |
fun datac thm j = EVERY' (dtac thm::replicate j atac); |
|
177 |
fun eatac thm j = EVERY' (etac thm::replicate j atac); |
|
178 |
fun fatac thm j = EVERY' (ftac thm::replicate j atac); |
|
0 | 179 |
|
180 |
(*Use an assumption or some rules ... A popular combination!*) |
|
181 |
fun ares_tac rules = assume_tac ORELSE' resolve_tac rules; |
|
182 |
||
5263 | 183 |
fun solve_tac rules = resolve_tac rules THEN_ALL_NEW assume_tac; |
184 |
||
0 | 185 |
(*Matching tactics -- as above, but forbid updating of state*) |
186 |
fun bimatch_tac brules i = PRIMSEQ (biresolution true brules i); |
|
187 |
fun match_tac rules = bimatch_tac (map (pair false) rules); |
|
188 |
fun ematch_tac rules = bimatch_tac (map (pair true) rules); |
|
189 |
fun dmatch_tac rls = ematch_tac (map make_elim rls); |
|
190 |
||
191 |
(*Smash all flex-flex disagreement pairs in the proof state.*) |
|
192 |
val flexflex_tac = PRIMSEQ flexflex_rule; |
|
193 |
||
3409
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
194 |
|
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
195 |
(*Remove duplicate subgoals. By Mark Staples*) |
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
196 |
local |
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
197 |
fun cterm_aconv (a,b) = #t (rep_cterm a) aconv #t (rep_cterm b); |
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
198 |
in |
10817 | 199 |
fun distinct_subgoals_tac state = |
3409
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
200 |
let val (frozth,thawfn) = freeze_thaw state |
10805 | 201 |
val froz_prems = cprems_of frozth |
202 |
val assumed = implies_elim_list frozth (map assume froz_prems) |
|
203 |
val implied = implies_intr_list (gen_distinct cterm_aconv froz_prems) |
|
204 |
assumed; |
|
4270 | 205 |
in Seq.single (thawfn implied) end |
10817 | 206 |
end; |
3409
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
207 |
|
c0466958df5d
Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents:
2814
diff
changeset
|
208 |
|
11929 | 209 |
(*Determine print names of goal parameters (reversed)*) |
210 |
fun innermost_params i st = |
|
211 |
let val (_, _, Bi, _) = dest_state (st, i) |
|
212 |
in rename_wrt_term Bi (Logic.strip_params Bi) end; |
|
213 |
||
0 | 214 |
(*Lift and instantiate a rule wrt the given state and subgoal number *) |
1501 | 215 |
fun lift_inst_rule (st, i, sinsts, rule) = |
216 |
let val {maxidx,sign,...} = rep_thm st |
|
217 |
val (_, _, Bi, _) = dest_state(st,i) |
|
10805 | 218 |
val params = Logic.strip_params Bi (*params of subgoal i*) |
0 | 219 |
val params = rev(rename_wrt_term Bi params) (*as they are printed*) |
220 |
val paramTs = map #2 params |
|
221 |
and inc = maxidx+1 |
|
222 |
fun liftvar (Var ((a,j), T)) = Var((a, j+inc), paramTs---> incr_tvar inc T) |
|
223 |
| liftvar t = raise TERM("Variable expected", [t]); |
|
10817 | 224 |
fun liftterm t = list_abs_free (params, |
10805 | 225 |
Logic.incr_indexes(paramTs,inc) t) |
0 | 226 |
(*Lifts instantiation pair over params*) |
230 | 227 |
fun liftpair (cv,ct) = (cterm_fun liftvar cv, cterm_fun liftterm ct) |
0 | 228 |
fun lifttvar((a,i),ctyp) = |
10805 | 229 |
let val {T,sign} = rep_ctyp ctyp |
230 |
in ((a,i+inc), ctyp_of sign (incr_tvar inc T)) end |
|
1501 | 231 |
val rts = types_sorts rule and (types,sorts) = types_sorts st |
0 | 232 |
fun types'(a,~1) = (case assoc(params,a) of None => types(a,~1) | sm => sm) |
233 |
| types'(ixn) = types ixn; |
|
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
947
diff
changeset
|
234 |
val used = add_term_tvarnames |
12801 | 235 |
(prop_of st $ prop_of rule,[]) |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
947
diff
changeset
|
236 |
val (Tinsts,insts) = read_insts sign rts (types',sorts) used sinsts |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
7596
diff
changeset
|
237 |
in Drule.instantiate (map lifttvar Tinsts, map liftpair insts) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
7596
diff
changeset
|
238 |
(lift_rule (st,i) rule) |
0 | 239 |
end; |
240 |
||
3984 | 241 |
(* |
242 |
Like lift_inst_rule but takes terms, not strings, where the terms may contain |
|
243 |
Bounds referring to parameters of the subgoal. |
|
244 |
||
245 |
insts: [...,(vj,tj),...] |
|
246 |
||
247 |
The tj may contain references to parameters of subgoal i of the state st |
|
248 |
in the form of Bound k, i.e. the tj may be subterms of the subgoal. |
|
249 |
To saturate the lose bound vars, the tj are enclosed in abstractions |
|
250 |
corresponding to the parameters of subgoal i, thus turning them into |
|
251 |
functions. At the same time, the types of the vj are lifted. |
|
252 |
||
253 |
NB: the types in insts must be correctly instantiated already, |
|
254 |
i.e. Tinsts is not applied to insts. |
|
255 |
*) |
|
1975
eec67972b1bf
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
nipkow
parents:
1966
diff
changeset
|
256 |
fun term_lift_inst_rule (st, i, Tinsts, insts, rule) = |
1966 | 257 |
let val {maxidx,sign,...} = rep_thm st |
258 |
val (_, _, Bi, _) = dest_state(st,i) |
|
259 |
val params = Logic.strip_params Bi (*params of subgoal i*) |
|
260 |
val paramTs = map #2 params |
|
261 |
and inc = maxidx+1 |
|
1975
eec67972b1bf
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
nipkow
parents:
1966
diff
changeset
|
262 |
fun liftvar ((a,j), T) = Var((a, j+inc), paramTs---> incr_tvar inc T) |
eec67972b1bf
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
nipkow
parents:
1966
diff
changeset
|
263 |
(*lift only Var, not term, which must be lifted already*) |
eec67972b1bf
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
nipkow
parents:
1966
diff
changeset
|
264 |
fun liftpair (v,t) = (cterm_of sign (liftvar v), cterm_of sign t) |
eec67972b1bf
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
nipkow
parents:
1966
diff
changeset
|
265 |
fun liftTpair((a,i),T) = ((a,i+inc), ctyp_of sign (incr_tvar inc T)) |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
7596
diff
changeset
|
266 |
in Drule.instantiate (map liftTpair Tinsts, map liftpair insts) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
7596
diff
changeset
|
267 |
(lift_rule (st,i) rule) |
1966 | 268 |
end; |
0 | 269 |
|
270 |
(*** Resolve after lifting and instantation; may refer to parameters of the |
|
271 |
subgoal. Fails if "i" is out of range. ***) |
|
272 |
||
273 |
(*compose version: arguments are as for bicompose.*) |
|
10817 | 274 |
fun compose_inst_tac sinsts (bires_flg, rule, nsubgoal) i st = |
8977
dd8bc754a072
res_inst_tac, etc., no longer print the "dest_state" message when the selected
paulson
parents:
8129
diff
changeset
|
275 |
if i > nprems_of st then no_tac st |
dd8bc754a072
res_inst_tac, etc., no longer print the "dest_state" message when the selected
paulson
parents:
8129
diff
changeset
|
276 |
else st |> |
dd8bc754a072
res_inst_tac, etc., no longer print the "dest_state" message when the selected
paulson
parents:
8129
diff
changeset
|
277 |
(compose_tac (bires_flg, lift_inst_rule (st, i, sinsts, rule), nsubgoal) i |
12262 | 278 |
handle TERM (msg,_) => (warning msg; no_tac) |
279 |
| THM (msg,_,_) => (warning msg; no_tac)); |
|
0 | 280 |
|
761 | 281 |
(*"Resolve" version. Note: res_inst_tac cannot behave sensibly if the |
282 |
terms that are substituted contain (term or type) unknowns from the |
|
283 |
goal, because it is unable to instantiate goal unknowns at the same time. |
|
284 |
||
2029 | 285 |
The type checker is instructed not to freeze flexible type vars that |
952
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
286 |
were introduced during type inference and still remain in the term at the |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
287 |
end. This increases flexibility but can introduce schematic type vars in |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
288 |
goals. |
761 | 289 |
*) |
0 | 290 |
fun res_inst_tac sinsts rule i = |
291 |
compose_inst_tac sinsts (false, rule, nprems_of rule) i; |
|
292 |
||
1501 | 293 |
(*eresolve elimination version*) |
0 | 294 |
fun eres_inst_tac sinsts rule i = |
295 |
compose_inst_tac sinsts (true, rule, nprems_of rule) i; |
|
296 |
||
270
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
297 |
(*For forw_inst_tac and dres_inst_tac. Preserve Var indexes of rl; |
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
298 |
increment revcut_rl instead.*) |
10817 | 299 |
fun make_elim_preserve rl = |
270
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
300 |
let val {maxidx,...} = rep_thm rl |
6390 | 301 |
fun cvar ixn = cterm_of (Theory.sign_of ProtoPure.thy) (Var(ixn,propT)); |
10817 | 302 |
val revcut_rl' = |
10805 | 303 |
instantiate ([], [(cvar("V",0), cvar("V",maxidx+1)), |
304 |
(cvar("W",0), cvar("W",maxidx+1))]) revcut_rl |
|
0 | 305 |
val arg = (false, rl, nprems_of rl) |
4270 | 306 |
val [th] = Seq.list_of (bicompose false arg 1 revcut_rl') |
0 | 307 |
in th end |
308 |
handle Bind => raise THM("make_elim_preserve", 1, [rl]); |
|
309 |
||
270
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
310 |
(*instantiate and cut -- for a FACT, anyway...*) |
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
311 |
fun cut_inst_tac sinsts rule = res_inst_tac sinsts (make_elim_preserve rule); |
0 | 312 |
|
270
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
313 |
(*forward tactic applies a RULE to an assumption without deleting it*) |
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
314 |
fun forw_inst_tac sinsts rule = cut_inst_tac sinsts rule THEN' assume_tac; |
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
315 |
|
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
316 |
(*dresolve tactic applies a RULE to replace an assumption*) |
0 | 317 |
fun dres_inst_tac sinsts rule = eres_inst_tac sinsts (make_elim_preserve rule); |
318 |
||
10347 | 319 |
(*instantiate variables in the whole state*) |
320 |
val instantiate_tac = PRIMITIVE o read_instantiate; |
|
321 |
||
1951 | 322 |
(*Deletion of an assumption*) |
323 |
fun thin_tac s = eres_inst_tac [("V",s)] thin_rl; |
|
324 |
||
270
d506ea00c825
tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents:
230
diff
changeset
|
325 |
(*** Applications of cut_rl ***) |
0 | 326 |
|
327 |
(*Used by metacut_tac*) |
|
328 |
fun bires_cut_tac arg i = |
|
1460 | 329 |
resolve_tac [cut_rl] i THEN biresolve_tac arg (i+1) ; |
0 | 330 |
|
331 |
(*The conclusion of the rule gets assumed in subgoal i, |
|
332 |
while subgoal i+1,... are the premises of the rule.*) |
|
333 |
fun metacut_tac rule = bires_cut_tac [(false,rule)]; |
|
334 |
||
335 |
(*Recognizes theorems that are not rules, but simple propositions*) |
|
336 |
fun is_fact rl = |
|
337 |
case prems_of rl of |
|
10805 | 338 |
[] => true | _::_ => false; |
0 | 339 |
|
13650
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
340 |
(*"Cut" a list of rules into the goal. Their premises will become new |
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
341 |
subgoals.*) |
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
342 |
fun cut_rules_tac ths i = EVERY (map (fn th => metacut_tac th i) ths); |
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
343 |
|
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
344 |
(*As above, but inserts only facts (unconditional theorems); |
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
345 |
generates no additional subgoals. *) |
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13559
diff
changeset
|
346 |
fun cut_facts_tac ths = cut_rules_tac (filter is_fact ths); |
0 | 347 |
|
348 |
(*Introduce the given proposition as a lemma and subgoal*) |
|
12847
afa356dbcb15
fixed subgoal_tac; fails on non-existent subgoal;
wenzelm
parents:
12801
diff
changeset
|
349 |
fun subgoal_tac sprop = |
afa356dbcb15
fixed subgoal_tac; fails on non-existent subgoal;
wenzelm
parents:
12801
diff
changeset
|
350 |
DETERM o res_inst_tac [("psi", sprop)] cut_rl THEN' SUBGOAL (fn (prop, _) => |
afa356dbcb15
fixed subgoal_tac; fails on non-existent subgoal;
wenzelm
parents:
12801
diff
changeset
|
351 |
let val concl' = Logic.strip_assums_concl prop in |
4178
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
3991
diff
changeset
|
352 |
if null (term_tvars concl') then () |
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
3991
diff
changeset
|
353 |
else warning"Type variables in new subgoal: add a type constraint?"; |
12847
afa356dbcb15
fixed subgoal_tac; fails on non-existent subgoal;
wenzelm
parents:
12801
diff
changeset
|
354 |
all_tac |
afa356dbcb15
fixed subgoal_tac; fails on non-existent subgoal;
wenzelm
parents:
12801
diff
changeset
|
355 |
end); |
0 | 356 |
|
439 | 357 |
(*Introduce a list of lemmas and subgoals*) |
358 |
fun subgoals_tac sprops = EVERY' (map subgoal_tac sprops); |
|
359 |
||
0 | 360 |
|
361 |
(**** Indexing and filtering of theorems ****) |
|
362 |
||
363 |
(*Returns the list of potentially resolvable theorems for the goal "prem", |
|
10805 | 364 |
using the predicate could(subgoal,concl). |
0 | 365 |
Resulting list is no longer than "limit"*) |
366 |
fun filter_thms could (limit, prem, ths) = |
|
367 |
let val pb = Logic.strip_assums_concl prem; (*delete assumptions*) |
|
368 |
fun filtr (limit, []) = [] |
|
10805 | 369 |
| filtr (limit, th::ths) = |
370 |
if limit=0 then [] |
|
371 |
else if could(pb, concl_of th) then th :: filtr(limit-1, ths) |
|
372 |
else filtr(limit,ths) |
|
0 | 373 |
in filtr(limit,ths) end; |
374 |
||
375 |
||
376 |
(*** biresolution and resolution using nets ***) |
|
377 |
||
378 |
(** To preserve the order of the rules, tag them with increasing integers **) |
|
379 |
||
380 |
(*insert tags*) |
|
381 |
fun taglist k [] = [] |
|
382 |
| taglist k (x::xs) = (k,x) :: taglist (k+1) xs; |
|
383 |
||
384 |
(*remove tags and suppress duplicates -- list is assumed sorted!*) |
|
385 |
fun untaglist [] = [] |
|
386 |
| untaglist [(k:int,x)] = [x] |
|
387 |
| untaglist ((k,x) :: (rest as (k',x')::_)) = |
|
388 |
if k=k' then untaglist rest |
|
389 |
else x :: untaglist rest; |
|
390 |
||
391 |
(*return list elements in original order*) |
|
10817 | 392 |
fun orderlist kbrls = untaglist (sort (int_ord o pairself fst) kbrls); |
0 | 393 |
|
394 |
(*insert one tagged brl into the pair of nets*) |
|
12320 | 395 |
fun insert_tagged_brl (kbrl as (k, (eres, th)), (inet, enet)) = |
396 |
if eres then |
|
397 |
(case try Thm.major_prem_of th of |
|
398 |
Some prem => (inet, Net.insert_term ((prem, kbrl), enet, K false)) |
|
399 |
| None => error "insert_tagged_brl: elimination rule with no premises") |
|
400 |
else (Net.insert_term ((concl_of th, kbrl), inet, K false), enet); |
|
0 | 401 |
|
402 |
(*build a pair of nets for biresolution*) |
|
10817 | 403 |
fun build_netpair netpair brls = |
1077
c2df11ae8b55
Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents:
952
diff
changeset
|
404 |
foldr insert_tagged_brl (taglist 1 brls, netpair); |
0 | 405 |
|
12320 | 406 |
(*delete one kbrl from the pair of nets*) |
1801 | 407 |
local |
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12847
diff
changeset
|
408 |
fun eq_kbrl ((_, (_, th)), (_, (_, th'))) = Drule.eq_thm_prop (th, th') |
1801 | 409 |
in |
12320 | 410 |
fun delete_tagged_brl (brl as (eres, th), (inet, enet)) = |
13925 | 411 |
(if eres then |
12320 | 412 |
(case try Thm.major_prem_of th of |
413 |
Some prem => (inet, Net.delete_term ((prem, ((), brl)), enet, eq_kbrl)) |
|
414 |
| None => (inet, enet)) (*no major premise: ignore*) |
|
13925 | 415 |
else (Net.delete_term ((Thm.concl_of th, ((), brl)), inet, eq_kbrl), enet)) |
416 |
handle Net.DELETE => (inet,enet); |
|
1801 | 417 |
end; |
418 |
||
419 |
||
10817 | 420 |
(*biresolution using a pair of nets rather than rules. |
3706
e57b5902822f
Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents:
3575
diff
changeset
|
421 |
function "order" must sort and possibly filter the list of brls. |
e57b5902822f
Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents:
3575
diff
changeset
|
422 |
boolean "match" indicates matching or unification.*) |
e57b5902822f
Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents:
3575
diff
changeset
|
423 |
fun biresolution_from_nets_tac order match (inet,enet) = |
0 | 424 |
SUBGOAL |
425 |
(fn (prem,i) => |
|
426 |
let val hyps = Logic.strip_assums_hyp prem |
|
10817 | 427 |
and concl = Logic.strip_assums_concl prem |
0 | 428 |
val kbrls = Net.unify_term inet concl @ |
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2580
diff
changeset
|
429 |
List.concat (map (Net.unify_term enet) hyps) |
3706
e57b5902822f
Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents:
3575
diff
changeset
|
430 |
in PRIMSEQ (biresolution match (order kbrls) i) end); |
0 | 431 |
|
3706
e57b5902822f
Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents:
3575
diff
changeset
|
432 |
(*versions taking pre-built nets. No filtering of brls*) |
e57b5902822f
Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents:
3575
diff
changeset
|
433 |
val biresolve_from_nets_tac = biresolution_from_nets_tac orderlist false; |
e57b5902822f
Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents:
3575
diff
changeset
|
434 |
val bimatch_from_nets_tac = biresolution_from_nets_tac orderlist true; |
0 | 435 |
|
436 |
(*fast versions using nets internally*) |
|
670 | 437 |
val net_biresolve_tac = |
438 |
biresolve_from_nets_tac o build_netpair(Net.empty,Net.empty); |
|
439 |
||
440 |
val net_bimatch_tac = |
|
441 |
bimatch_from_nets_tac o build_netpair(Net.empty,Net.empty); |
|
0 | 442 |
|
443 |
(*** Simpler version for resolve_tac -- only one net, and no hyps ***) |
|
444 |
||
445 |
(*insert one tagged rl into the net*) |
|
446 |
fun insert_krl (krl as (k,th), net) = |
|
447 |
Net.insert_term ((concl_of th, krl), net, K false); |
|
448 |
||
449 |
(*build a net of rules for resolution*) |
|
10817 | 450 |
fun build_net rls = |
0 | 451 |
foldr insert_krl (taglist 1 rls, Net.empty); |
452 |
||
453 |
(*resolution using a net rather than rules; pred supports filt_resolve_tac*) |
|
454 |
fun filt_resolution_from_net_tac match pred net = |
|
455 |
SUBGOAL |
|
456 |
(fn (prem,i) => |
|
457 |
let val krls = Net.unify_term net (Logic.strip_assums_concl prem) |
|
10817 | 458 |
in |
459 |
if pred krls |
|
0 | 460 |
then PRIMSEQ |
10805 | 461 |
(biresolution match (map (pair false) (orderlist krls)) i) |
0 | 462 |
else no_tac |
463 |
end); |
|
464 |
||
465 |
(*Resolve the subgoal using the rules (making a net) unless too flexible, |
|
466 |
which means more than maxr rules are unifiable. *) |
|
10817 | 467 |
fun filt_resolve_tac rules maxr = |
0 | 468 |
let fun pred krls = length krls <= maxr |
469 |
in filt_resolution_from_net_tac false pred (build_net rules) end; |
|
470 |
||
471 |
(*versions taking pre-built nets*) |
|
472 |
val resolve_from_net_tac = filt_resolution_from_net_tac false (K true); |
|
473 |
val match_from_net_tac = filt_resolution_from_net_tac true (K true); |
|
474 |
||
475 |
(*fast versions using nets internally*) |
|
476 |
val net_resolve_tac = resolve_from_net_tac o build_net; |
|
477 |
val net_match_tac = match_from_net_tac o build_net; |
|
478 |
||
479 |
||
480 |
(*** For Natural Deduction using (bires_flg, rule) pairs ***) |
|
481 |
||
482 |
(*The number of new subgoals produced by the brule*) |
|
1077
c2df11ae8b55
Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents:
952
diff
changeset
|
483 |
fun subgoals_of_brl (true,rule) = nprems_of rule - 1 |
c2df11ae8b55
Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents:
952
diff
changeset
|
484 |
| subgoals_of_brl (false,rule) = nprems_of rule; |
0 | 485 |
|
486 |
(*Less-than test: for sorting to minimize number of new subgoals*) |
|
487 |
fun lessb (brl1,brl2) = subgoals_of_brl brl1 < subgoals_of_brl brl2; |
|
488 |
||
489 |
||
490 |
(*** Meta-Rewriting Tactics ***) |
|
491 |
||
3575
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3554
diff
changeset
|
492 |
val simple_prover = |
15021 | 493 |
SINGLE o (fn ss => ALLGOALS (resolve_tac (MetaSimplifier.prems_of_ss ss))); |
3575
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3554
diff
changeset
|
494 |
|
11768
48bc55f43774
unified rewrite/rewrite_cterm/simplify interface;
wenzelm
parents:
11762
diff
changeset
|
495 |
val rewrite = MetaSimplifier.rewrite_aux simple_prover; |
48bc55f43774
unified rewrite/rewrite_cterm/simplify interface;
wenzelm
parents:
11762
diff
changeset
|
496 |
val simplify = MetaSimplifier.simplify_aux simple_prover; |
48bc55f43774
unified rewrite/rewrite_cterm/simplify interface;
wenzelm
parents:
11762
diff
changeset
|
497 |
val rewrite_rule = simplify true; |
10415
e6d7b77a0574
moved rewriting functions from Drule to MetaSimplifier
berghofe
parents:
10347
diff
changeset
|
498 |
val rewrite_goals_rule = MetaSimplifier.rewrite_goals_rule_aux simple_prover; |
3575
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3554
diff
changeset
|
499 |
|
10444 | 500 |
fun rewrite_goal_tac rews = |
15021 | 501 |
MetaSimplifier.asm_rewrite_goal_tac (true, false, false) (K no_tac) |
502 |
(MetaSimplifier.empty_ss addsimps rews); |
|
10444 | 503 |
|
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
504 |
(*Rewrite throughout proof state. *) |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
505 |
fun rewrite_tac defs = PRIMITIVE(rewrite_rule defs); |
0 | 506 |
|
507 |
(*Rewrite subgoals only, not main goal. *) |
|
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
508 |
fun rewrite_goals_tac defs = PRIMITIVE (rewrite_goals_rule defs); |
1460 | 509 |
fun rewtac def = rewrite_goals_tac [def]; |
0 | 510 |
|
12801 | 511 |
fun norm_hhf_rule th = |
512 |
(if Drule.is_norm_hhf (prop_of th) then th |
|
513 |
else rewrite_rule [Drule.norm_hhf_eq] th) |> Drule.gen_all; |
|
10817 | 514 |
|
12782 | 515 |
val norm_hhf_tac = |
516 |
rtac Drule.asm_rl (*cheap approximation -- thanks to builtin Logic.flatten_params*) |
|
517 |
THEN' SUBGOAL (fn (t, i) => |
|
12801 | 518 |
if Drule.is_norm_hhf t then all_tac |
12782 | 519 |
else rewrite_goal_tac [Drule.norm_hhf_eq] i); |
10805 | 520 |
|
0 | 521 |
|
1501 | 522 |
(*** for folding definitions, handling critical pairs ***) |
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
523 |
|
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
524 |
(*The depth of nesting in a term*) |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
525 |
fun term_depth (Abs(a,T,t)) = 1 + term_depth t |
2145 | 526 |
| term_depth (f$t) = 1 + Int.max(term_depth f, term_depth t) |
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
527 |
| term_depth _ = 0; |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
528 |
|
12801 | 529 |
val lhs_of_thm = #1 o Logic.dest_equals o prop_of; |
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
530 |
|
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
531 |
(*folding should handle critical pairs! E.g. K == Inl(0), S == Inr(Inl(0)) |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
532 |
Returns longest lhs first to avoid folding its subexpressions.*) |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
533 |
fun sort_lhs_depths defs = |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
534 |
let val keylist = make_keylist (term_depth o lhs_of_thm) defs |
4438 | 535 |
val keys = distinct (sort (rev_order o int_ord) (map #2 keylist)) |
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
536 |
in map (keyfilter keylist) keys end; |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
537 |
|
7596 | 538 |
val rev_defs = sort_lhs_depths o map symmetric; |
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
539 |
|
7596 | 540 |
fun fold_rule defs thm = foldl (fn (th, ds) => rewrite_rule ds th) (thm, rev_defs defs); |
541 |
fun fold_tac defs = EVERY (map rewrite_tac (rev_defs defs)); |
|
542 |
fun fold_goals_tac defs = EVERY (map rewrite_goals_tac (rev_defs defs)); |
|
69
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
543 |
|
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
544 |
|
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
545 |
(*** Renaming of parameters in a subgoal |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
546 |
Names may contain letters, digits or primes and must be |
e7588b53d6b0
tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents:
0
diff
changeset
|
547 |
separated by blanks ***) |
0 | 548 |
|
549 |
(*Calling this will generate the warning "Same as previous level" since |
|
550 |
it affects nothing but the names of bound variables!*) |
|
9535 | 551 |
fun rename_params_tac xs i = |
14673 | 552 |
case Library.find_first (not o Syntax.is_identifier) xs of |
13559
51c3ac47d127
added checking so that (rename_tac "x y") is rejected, since
paulson
parents:
13105
diff
changeset
|
553 |
Some x => error ("Not an identifier: " ^ x) |
51c3ac47d127
added checking so that (rename_tac "x y") is rejected, since
paulson
parents:
13105
diff
changeset
|
554 |
| None => |
51c3ac47d127
added checking so that (rename_tac "x y") is rejected, since
paulson
parents:
13105
diff
changeset
|
555 |
(if !Logic.auto_rename |
51c3ac47d127
added checking so that (rename_tac "x y") is rejected, since
paulson
parents:
13105
diff
changeset
|
556 |
then (warning "Resetting Logic.auto_rename"; |
51c3ac47d127
added checking so that (rename_tac "x y") is rejected, since
paulson
parents:
13105
diff
changeset
|
557 |
Logic.auto_rename := false) |
51c3ac47d127
added checking so that (rename_tac "x y") is rejected, since
paulson
parents:
13105
diff
changeset
|
558 |
else (); PRIMITIVE (rename_params_rule (xs, i))); |
9535 | 559 |
|
10817 | 560 |
fun rename_tac str i = |
561 |
let val cs = Symbol.explode str in |
|
4693 | 562 |
case #2 (take_prefix (Symbol.is_letdig orf Symbol.is_blank) cs) of |
9535 | 563 |
[] => rename_params_tac (scanwords Symbol.is_letdig cs) i |
0 | 564 |
| c::_ => error ("Illegal character: " ^ c) |
565 |
end; |
|
566 |
||
1501 | 567 |
(*Rename recent parameters using names generated from a and the suffixes, |
568 |
provided the string a, which represents a term, is an identifier. *) |
|
10817 | 569 |
fun rename_last_tac a sufs i = |
0 | 570 |
let val names = map (curry op^ a) sufs |
571 |
in if Syntax.is_identifier a |
|
572 |
then PRIMITIVE (rename_params_rule (names,i)) |
|
573 |
else all_tac |
|
574 |
end; |
|
575 |
||
2043 | 576 |
(*Prunes all redundant parameters from the proof state by rewriting. |
577 |
DOES NOT rewrite main goal, where quantification over an unused bound |
|
578 |
variable is sometimes done to avoid the need for cut_facts_tac.*) |
|
579 |
val prune_params_tac = rewrite_goals_tac [triv_forall_equality]; |
|
0 | 580 |
|
1501 | 581 |
(*rotate_tac n i: rotate the assumptions of subgoal i by n positions, from |
582 |
right to left if n is positive, and from left to right if n is negative.*) |
|
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2580
diff
changeset
|
583 |
fun rotate_tac 0 i = all_tac |
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2580
diff
changeset
|
584 |
| rotate_tac k i = PRIMITIVE (rotate_rule k i); |
1209 | 585 |
|
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6979
diff
changeset
|
586 |
(*Rotates the given subgoal to be the last.*) |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6979
diff
changeset
|
587 |
fun defer_tac i = PRIMITIVE (permute_prems (i-1) 1); |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6979
diff
changeset
|
588 |
|
5974 | 589 |
(* remove premises that do not satisfy p; fails if all prems satisfy p *) |
590 |
fun filter_prems_tac p = |
|
591 |
let fun Then None tac = Some tac |
|
592 |
| Then (Some tac) tac' = Some(tac THEN' tac'); |
|
593 |
fun thins ((tac,n),H) = |
|
594 |
if p H then (tac,n+1) |
|
595 |
else (Then tac (rotate_tac n THEN' etac thin_rl),0); |
|
596 |
in SUBGOAL(fn (subg,n) => |
|
597 |
let val Hs = Logic.strip_assums_hyp subg |
|
598 |
in case fst(foldl thins ((None,0),Hs)) of |
|
599 |
None => no_tac | Some tac => tac n |
|
600 |
end) |
|
601 |
end; |
|
602 |
||
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
603 |
|
12139 | 604 |
(*meta-level conjunction*) |
605 |
val conj_tac = SUBGOAL (fn (Const ("all", _) $ Abs (_, _, Const ("==>", _) $ |
|
606 |
(Const ("==>", _) $ _ $ (Const ("==>", _) $ _ $ Bound 0)) $ Bound 0), i) => |
|
607 |
(fn st => |
|
608 |
compose_tac (false, Drule.incr_indexes_wrt [] [] [] [st] Drule.conj_intr_thm, 2) i st) |
|
609 |
| _ => no_tac); |
|
610 |
||
611 |
val conjunction_tac = ALLGOALS (REPEAT_ALL_NEW conj_tac); |
|
612 |
||
613 |
||
614 |
||
11970 | 615 |
(** minimal goal interface for internal use *) |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
616 |
|
11970 | 617 |
fun prove sign xs asms prop tac = |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
618 |
let |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
619 |
val statement = Logic.list_implies (asms, prop); |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
620 |
val frees = map Term.dest_Free (Term.term_frees statement); |
11970 | 621 |
val fixed_frees = filter_out (fn (x, _) => x mem_string xs) frees; |
622 |
val fixed_tfrees = foldr Term.add_typ_tfree_names (map #2 fixed_frees, []); |
|
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
623 |
val params = mapfilter (fn x => apsome (pair x) (assoc_string (frees, x))) xs; |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
624 |
|
12212 | 625 |
fun err msg = raise ERROR_MESSAGE |
626 |
(msg ^ "\nThe error(s) above occurred for the goal statement:\n" ^ |
|
627 |
Sign.string_of_term sign (Term.list_all_free (params, statement))); |
|
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
628 |
|
12170 | 629 |
fun cert_safe t = Thm.cterm_of sign (Envir.beta_norm t) |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
630 |
handle TERM (msg, _) => err msg | TYPE (msg, _, _) => err msg; |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
631 |
|
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
632 |
val _ = cert_safe statement; |
11974 | 633 |
val _ = Term.no_dummy_patterns statement handle TERM (msg, _) => err msg; |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
634 |
|
11974 | 635 |
val cparams = map (cert_safe o Free) params; |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
636 |
val casms = map cert_safe asms; |
12801 | 637 |
val prems = map (norm_hhf_rule o Thm.assume) casms; |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
638 |
val goal = Drule.mk_triv_goal (cert_safe prop); |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
639 |
|
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
640 |
val goal' = |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
641 |
(case Seq.pull (tac prems goal) of Some (goal', _) => goal' | _ => err "Tactic failed."); |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
642 |
val ngoals = Thm.nprems_of goal'; |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
643 |
val raw_result = goal' RS Drule.rev_triv_goal; |
12801 | 644 |
val prop' = prop_of raw_result; |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
645 |
in |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
646 |
if ngoals <> 0 then |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
647 |
err ("Proof failed.\n" ^ Pretty.string_of (Pretty.chunks (Display.pretty_goals ngoals goal')) |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
648 |
^ ("\n" ^ string_of_int ngoals ^ " unsolved goal(s)!")) |
11970 | 649 |
else if not (Pattern.matches (Sign.tsig_of sign) (prop, prop')) then |
650 |
err ("Proved a different theorem: " ^ Sign.string_of_term sign prop') |
|
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
651 |
else |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
652 |
raw_result |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
653 |
|> Drule.implies_intr_list casms |
11974 | 654 |
|> Drule.forall_intr_list cparams |
12801 | 655 |
|> norm_hhf_rule |
12498 | 656 |
|> (#1 o Thm.varifyT' fixed_tfrees) |
11970 | 657 |
|> Drule.zero_var_indexes |
11961
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
658 |
end; |
e5911a25d094
prove: primitive goal interface for internal use;
wenzelm
parents:
11929
diff
changeset
|
659 |
|
11970 | 660 |
fun prove_standard sign xs asms prop tac = Drule.standard (prove sign xs asms prop tac); |
661 |
||
0 | 662 |
end; |
1501 | 663 |
|
11774 | 664 |
structure BasicTactic: BASIC_TACTIC = Tactic; |
665 |
open BasicTactic; |