author | wenzelm |
Fri, 17 Apr 2015 22:15:35 +0200 | |
changeset 60125 | 2944cc4f4f56 |
parent 60097 | d20ca79d50e4 |
child 60618 | 4c79543cc376 |
permissions | -rw-r--r-- |
9938 | 1 |
(* Title: Provers/classical.ML |
2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
0 | 3 |
|
4 |
Theorem prover for classical reasoning, including predicate calculus, set |
|
5 |
theory, etc. |
|
6 |
||
9563
216d053992a5
fixed classification of rules in atts and modifiers (final!?);
wenzelm
parents:
9513
diff
changeset
|
7 |
Rules must be classified as intro, elim, safe, hazardous (unsafe). |
0 | 8 |
|
9 |
A rule is unsafe unless it can be applied blindly without harmful results. |
|
10 |
For a rule to be safe, its premises and conclusion should be logically |
|
11 |
equivalent. There should be no variables in the premises that are not in |
|
12 |
the conclusion. |
|
13 |
*) |
|
14 |
||
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
15 |
(*higher precedence than := facilitates use of references*) |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
16 |
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules |
4651 | 17 |
addSWrapper delSWrapper addWrapper delWrapper |
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset
|
18 |
addSbefore addSafter addbefore addafter |
5523 | 19 |
addD2 addE2 addSD2 addSE2; |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
20 |
|
0 | 21 |
signature CLASSICAL_DATA = |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
22 |
sig |
42790 | 23 |
val imp_elim: thm (* P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R *) |
24 |
val not_elim: thm (* ~P ==> P ==> R *) |
|
25 |
val swap: thm (* ~ P ==> (~ R ==> P) ==> R *) |
|
26 |
val classical: thm (* (~ P ==> P) ==> P *) |
|
50062 | 27 |
val sizef: thm -> int (* size function for BEST_FIRST, typically size_of_thm *) |
51798 | 28 |
val hyp_subst_tacs: (Proof.context -> int -> tactic) list (* optional tactics for |
29 |
substitution in the hypotheses; assumed to be safe! *) |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
30 |
end; |
0 | 31 |
|
5841 | 32 |
signature BASIC_CLASSICAL = |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
33 |
sig |
42812 | 34 |
type wrapper = (int -> tactic) -> int -> tactic |
0 | 35 |
type claset |
42793 | 36 |
val print_claset: Proof.context -> unit |
37 |
val addDs: Proof.context * thm list -> Proof.context |
|
38 |
val addEs: Proof.context * thm list -> Proof.context |
|
39 |
val addIs: Proof.context * thm list -> Proof.context |
|
40 |
val addSDs: Proof.context * thm list -> Proof.context |
|
41 |
val addSEs: Proof.context * thm list -> Proof.context |
|
42 |
val addSIs: Proof.context * thm list -> Proof.context |
|
43 |
val delrules: Proof.context * thm list -> Proof.context |
|
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
44 |
val addSWrapper: Proof.context * (string * (Proof.context -> wrapper)) -> Proof.context |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
45 |
val delSWrapper: Proof.context * string -> Proof.context |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
46 |
val addWrapper: Proof.context * (string * (Proof.context -> wrapper)) -> Proof.context |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
47 |
val delWrapper: Proof.context * string -> Proof.context |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
48 |
val addSbefore: Proof.context * (string * (Proof.context -> int -> tactic)) -> Proof.context |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
49 |
val addSafter: Proof.context * (string * (Proof.context -> int -> tactic)) -> Proof.context |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
50 |
val addbefore: Proof.context * (string * (Proof.context -> int -> tactic)) -> Proof.context |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
51 |
val addafter: Proof.context * (string * (Proof.context -> int -> tactic)) -> Proof.context |
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
52 |
val addD2: Proof.context * (string * thm) -> Proof.context |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
53 |
val addE2: Proof.context * (string * thm) -> Proof.context |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
54 |
val addSD2: Proof.context * (string * thm) -> Proof.context |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
55 |
val addSE2: Proof.context * (string * thm) -> Proof.context |
42793 | 56 |
val appSWrappers: Proof.context -> wrapper |
57 |
val appWrappers: Proof.context -> wrapper |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
58 |
|
42790 | 59 |
val claset_of: Proof.context -> claset |
42793 | 60 |
val put_claset: claset -> Proof.context -> Proof.context |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
61 |
|
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
62 |
val map_theory_claset: (Proof.context -> Proof.context) -> theory -> theory |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
63 |
|
42793 | 64 |
val fast_tac: Proof.context -> int -> tactic |
65 |
val slow_tac: Proof.context -> int -> tactic |
|
66 |
val astar_tac: Proof.context -> int -> tactic |
|
67 |
val slow_astar_tac: Proof.context -> int -> tactic |
|
68 |
val best_tac: Proof.context -> int -> tactic |
|
69 |
val first_best_tac: Proof.context -> int -> tactic |
|
70 |
val slow_best_tac: Proof.context -> int -> tactic |
|
71 |
val depth_tac: Proof.context -> int -> int -> tactic |
|
72 |
val deepen_tac: Proof.context -> int -> int -> tactic |
|
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
73 |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
74 |
val contr_tac: Proof.context -> int -> tactic |
59970 | 75 |
val dup_elim: Proof.context -> thm -> thm |
42790 | 76 |
val dup_intr: thm -> thm |
42793 | 77 |
val dup_step_tac: Proof.context -> int -> tactic |
58957 | 78 |
val eq_mp_tac: Proof.context -> int -> tactic |
42793 | 79 |
val haz_step_tac: Proof.context -> int -> tactic |
42790 | 80 |
val joinrules: thm list * thm list -> (bool * thm) list |
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
81 |
val mp_tac: Proof.context -> int -> tactic |
42793 | 82 |
val safe_tac: Proof.context -> tactic |
83 |
val safe_steps_tac: Proof.context -> int -> tactic |
|
84 |
val safe_step_tac: Proof.context -> int -> tactic |
|
85 |
val clarify_tac: Proof.context -> int -> tactic |
|
86 |
val clarify_step_tac: Proof.context -> int -> tactic |
|
87 |
val step_tac: Proof.context -> int -> tactic |
|
88 |
val slow_step_tac: Proof.context -> int -> tactic |
|
42790 | 89 |
val swapify: thm list -> thm list |
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
90 |
val swap_res_tac: Proof.context -> thm list -> int -> tactic |
42793 | 91 |
val inst_step_tac: Proof.context -> int -> tactic |
92 |
val inst0_step_tac: Proof.context -> int -> tactic |
|
93 |
val instp_step_tac: Proof.context -> int -> tactic |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
94 |
end; |
1724 | 95 |
|
5841 | 96 |
signature CLASSICAL = |
97 |
sig |
|
98 |
include BASIC_CLASSICAL |
|
59970 | 99 |
val classical_rule: Proof.context -> thm -> thm |
42812 | 100 |
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net |
101 |
val rep_cs: claset -> |
|
102 |
{safeIs: thm Item_Net.T, |
|
103 |
safeEs: thm Item_Net.T, |
|
104 |
hazIs: thm Item_Net.T, |
|
105 |
hazEs: thm Item_Net.T, |
|
106 |
swrappers: (string * (Proof.context -> wrapper)) list, |
|
107 |
uwrappers: (string * (Proof.context -> wrapper)) list, |
|
108 |
safe0_netpair: netpair, |
|
109 |
safep_netpair: netpair, |
|
110 |
haz_netpair: netpair, |
|
111 |
dup_netpair: netpair, |
|
112 |
xtra_netpair: Context_Rules.netpair} |
|
24021 | 113 |
val get_cs: Context.generic -> claset |
114 |
val map_cs: (claset -> claset) -> Context.generic -> Context.generic |
|
18728 | 115 |
val safe_dest: int option -> attribute |
116 |
val safe_elim: int option -> attribute |
|
117 |
val safe_intro: int option -> attribute |
|
118 |
val haz_dest: int option -> attribute |
|
119 |
val haz_elim: int option -> attribute |
|
120 |
val haz_intro: int option -> attribute |
|
121 |
val rule_del: attribute |
|
30513 | 122 |
val cla_modifiers: Method.modifier parser list |
42793 | 123 |
val cla_method: |
124 |
(Proof.context -> tactic) -> (Proof.context -> Proof.method) context_parser |
|
125 |
val cla_method': |
|
126 |
(Proof.context -> int -> tactic) -> (Proof.context -> Proof.method) context_parser |
|
5841 | 127 |
end; |
128 |
||
0 | 129 |
|
42799 | 130 |
functor Classical(Data: CLASSICAL_DATA): CLASSICAL = |
0 | 131 |
struct |
132 |
||
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
133 |
(** classical elimination rules **) |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
134 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
135 |
(* |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
136 |
Classical reasoning requires stronger elimination rules. For |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
137 |
instance, make_elim of Pure transforms the HOL rule injD into |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
138 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
139 |
[| inj f; f x = f y; x = y ==> PROP W |] ==> PROP W |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
140 |
|
26938 | 141 |
Such rules can cause fast_tac to fail and blast_tac to report "PROOF |
59119 | 142 |
FAILED"; classical_rule will strengthen this to |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
143 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
144 |
[| inj f; ~ W ==> f x = f y; x = y ==> W |] ==> W |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
145 |
*) |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
146 |
|
59970 | 147 |
fun classical_rule ctxt rule = |
148 |
if is_some (Object_Logic.elim_concl ctxt rule) then |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
149 |
let |
42792 | 150 |
val rule' = rule RS Data.classical; |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
151 |
val concl' = Thm.concl_of rule'; |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
152 |
fun redundant_hyp goal = |
19257 | 153 |
concl' aconv Logic.strip_assums_concl goal orelse |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
154 |
(case Logic.strip_assums_hyp goal of |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
155 |
hyp :: hyps => exists (fn t => t aconv hyp) hyps |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
156 |
| _ => false); |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
157 |
val rule'' = |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
158 |
rule' |> ALLGOALS (SUBGOAL (fn (goal, i) => |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
159 |
if i = 1 orelse redundant_hyp goal |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
160 |
then eresolve0_tac [thin_rl] i |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
161 |
else all_tac)) |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
162 |
|> Seq.hd |
21963 | 163 |
|> Drule.zero_var_indexes; |
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22095
diff
changeset
|
164 |
in if Thm.equiv_thm (rule, rule'') then rule else rule'' end |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
165 |
else rule; |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
166 |
|
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
167 |
(*flatten nested meta connectives in prems*) |
59970 | 168 |
fun flat_rule ctxt = |
169 |
Conv.fconv_rule (Conv.prems_conv ~1 (Object_Logic.atomize_prems ctxt)); |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
170 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
171 |
|
1800 | 172 |
(*** Useful tactics for classical reasoning ***) |
0 | 173 |
|
10736 | 174 |
(*Prove goal that assumes both P and ~P. |
4392 | 175 |
No backtracking if it finds an equal assumption. Perhaps should call |
176 |
ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
177 |
fun contr_tac ctxt = |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
178 |
eresolve_tac ctxt [Data.not_elim] THEN' (eq_assume_tac ORELSE' assume_tac ctxt); |
0 | 179 |
|
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
180 |
(*Finds P-->Q and P in the assumptions, replaces implication by Q. |
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
181 |
Could do the same thing for P<->Q and P... *) |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
182 |
fun mp_tac ctxt i = |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
183 |
eresolve_tac ctxt [Data.not_elim, Data.imp_elim] i THEN assume_tac ctxt i; |
0 | 184 |
|
185 |
(*Like mp_tac but instantiates no variables*) |
|
58957 | 186 |
fun eq_mp_tac ctxt i = ematch_tac ctxt [Data.not_elim, Data.imp_elim] i THEN eq_assume_tac i; |
0 | 187 |
|
188 |
(*Creates rules to eliminate ~A, from rules to introduce A*) |
|
26412
0918f5c0bbca
pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents:
24867
diff
changeset
|
189 |
fun swapify intrs = intrs RLN (2, [Data.swap]); |
30528 | 190 |
val swapped = Thm.rule_attribute (fn _ => fn th => th RSN (2, Data.swap)); |
0 | 191 |
|
192 |
(*Uses introduction rules in the normal way, or on negated assumptions, |
|
193 |
trying rules in order. *) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
194 |
fun swap_res_tac ctxt rls = |
42792 | 195 |
let fun addrl rl brls = (false, rl) :: (true, rl RSN (2, Data.swap)) :: brls in |
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
196 |
assume_tac ctxt ORELSE' |
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
197 |
contr_tac ctxt ORELSE' |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
198 |
biresolve_tac ctxt (fold_rev addrl rls []) |
42792 | 199 |
end; |
0 | 200 |
|
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
201 |
(*Duplication of hazardous rules, for complete provers*) |
42792 | 202 |
fun dup_intr th = zero_var_indexes (th RS Data.classical); |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
203 |
|
59970 | 204 |
fun dup_elim ctxt th = |
205 |
let val rl = (th RSN (2, revcut_rl)) |> Thm.assumption (SOME ctxt) 2 |> Seq.hd; |
|
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
206 |
in rule_by_tactic ctxt (TRYALL (eresolve_tac ctxt [revcut_rl])) rl end; |
36546 | 207 |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
208 |
|
1800 | 209 |
(**** Classical rule sets ****) |
0 | 210 |
|
42812 | 211 |
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net; |
212 |
type wrapper = (int -> tactic) -> int -> tactic; |
|
213 |
||
0 | 214 |
datatype claset = |
42793 | 215 |
CS of |
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
216 |
{safeIs : thm Item_Net.T, (*safe introduction rules*) |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
217 |
safeEs : thm Item_Net.T, (*safe elimination rules*) |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
218 |
hazIs : thm Item_Net.T, (*unsafe introduction rules*) |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
219 |
hazEs : thm Item_Net.T, (*unsafe elimination rules*) |
42793 | 220 |
swrappers : (string * (Proof.context -> wrapper)) list, (*for transforming safe_step_tac*) |
221 |
uwrappers : (string * (Proof.context -> wrapper)) list, (*for transforming step_tac*) |
|
222 |
safe0_netpair : netpair, (*nets for trivial cases*) |
|
223 |
safep_netpair : netpair, (*nets for >0 subgoals*) |
|
224 |
haz_netpair : netpair, (*nets for unsafe rules*) |
|
225 |
dup_netpair : netpair, (*nets for duplication*) |
|
226 |
xtra_netpair : Context_Rules.netpair}; (*nets for extra rules*) |
|
0 | 227 |
|
6502 | 228 |
val empty_netpair = (Net.empty, Net.empty); |
229 |
||
10736 | 230 |
val empty_cs = |
42793 | 231 |
CS |
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
232 |
{safeIs = Thm.full_rules, |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
233 |
safeEs = Thm.full_rules, |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
234 |
hazIs = Thm.full_rules, |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
235 |
hazEs = Thm.full_rules, |
42793 | 236 |
swrappers = [], |
237 |
uwrappers = [], |
|
238 |
safe0_netpair = empty_netpair, |
|
239 |
safep_netpair = empty_netpair, |
|
240 |
haz_netpair = empty_netpair, |
|
241 |
dup_netpair = empty_netpair, |
|
242 |
xtra_netpair = empty_netpair}; |
|
0 | 243 |
|
4653 | 244 |
fun rep_cs (CS args) = args; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
245 |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
246 |
|
1800 | 247 |
(*** Adding (un)safe introduction or elimination rules. |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
248 |
|
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
249 |
In case of overlap, new rules are tried BEFORE old ones!! |
1800 | 250 |
***) |
0 | 251 |
|
59970 | 252 |
fun default_context (SOME context) _ = Context.proof_of context |
253 |
| default_context NONE th = Proof_Context.init_global (Thm.theory_of_thm th); |
|
254 |
||
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
255 |
(*For use with biresolve_tac. Combines intro rules with swap to handle negated |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
256 |
assumptions. Pairs elim rules with true. *) |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
257 |
fun joinrules (intrs, elims) = |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
258 |
(map (pair true) (elims @ swapify intrs)) @ map (pair false) intrs; |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
259 |
|
12401 | 260 |
fun joinrules' (intrs, elims) = |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
261 |
map (pair true) elims @ map (pair false) intrs; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
262 |
|
10736 | 263 |
(*Priority: prefer rules with fewest subgoals, |
1231 | 264 |
then rules added most recently (preferring the head of the list).*) |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
265 |
fun tag_brls k [] = [] |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
266 |
| tag_brls k (brl::brls) = |
10736 | 267 |
(1000000*subgoals_of_brl brl + k, brl) :: |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
268 |
tag_brls (k+1) brls; |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
269 |
|
12401 | 270 |
fun tag_brls' _ _ [] = [] |
271 |
| tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls; |
|
10736 | 272 |
|
23178 | 273 |
fun insert_tagged_list rls = fold_rev Tactic.insert_tagged_brl rls; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
274 |
|
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
275 |
(*Insert into netpair that already has nI intr rules and nE elim rules. |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
276 |
Count the intr rules double (to account for swapify). Negate to give the |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
277 |
new insertions the lowest priority.*) |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
278 |
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules; |
12401 | 279 |
fun insert' w (nI, nE) = insert_tagged_list o tag_brls' w (~(nI + nE)) o joinrules'; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
280 |
|
23178 | 281 |
fun delete_tagged_list rls = fold_rev Tactic.delete_tagged_brl rls; |
12362 | 282 |
fun delete x = delete_tagged_list (joinrules x); |
12401 | 283 |
fun delete' x = delete_tagged_list (joinrules' x); |
1800 | 284 |
|
42793 | 285 |
fun string_of_thm NONE = Display.string_of_thm_without_context |
42817 | 286 |
| string_of_thm (SOME context) = Display.string_of_thm (Context.proof_of context); |
42793 | 287 |
|
288 |
fun make_elim context th = |
|
289 |
if has_fewer_prems 1 th then |
|
290 |
error ("Ill-formed destruction rule\n" ^ string_of_thm context th) |
|
291 |
else Tactic.make_elim th; |
|
42790 | 292 |
|
52699 | 293 |
fun warn_thm (SOME (Context.Proof ctxt)) msg th = |
57859
29e728588163
more careful treatment of context visibility for rule declarations (see also 39d9c7f175e0, e639d91d9073) -- avoid duplicate warnings;
wenzelm
parents:
56334
diff
changeset
|
294 |
if Context_Position.is_really_visible ctxt |
52699 | 295 |
then warning (msg ^ Display.string_of_thm ctxt th) else () |
296 |
| warn_thm _ _ _ = (); |
|
42793 | 297 |
|
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
298 |
fun warn_rules context msg rules th = |
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
299 |
Item_Net.member rules th andalso (warn_thm context msg th; true); |
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
300 |
|
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
301 |
fun warn_claset context th (CS {safeIs, safeEs, hazIs, hazEs, ...}) = |
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
302 |
warn_rules context "Rule already declared as safe introduction (intro!)\n" safeIs th orelse |
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
303 |
warn_rules context "Rule already declared as safe elimination (elim!)\n" safeEs th orelse |
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
304 |
warn_rules context "Rule already declared as introduction (intro)\n" hazIs th orelse |
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
305 |
warn_rules context "Rule already declared as elimination (elim)\n" hazEs th; |
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
306 |
|
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
307 |
|
1800 | 308 |
(*** Safe rules ***) |
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
309 |
|
42793 | 310 |
fun addSI w context th |
42790 | 311 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
312 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
313 |
if warn_rules context "Ignoring duplicate safe introduction (intro!)\n" safeIs th then cs |
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
314 |
else |
42790 | 315 |
let |
59970 | 316 |
val ctxt = default_context context th; |
317 |
val th' = flat_rule ctxt th; |
|
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
318 |
val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) |
42790 | 319 |
List.partition Thm.no_prems [th']; |
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
320 |
val nI = Item_Net.length safeIs + 1; |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
321 |
val nE = Item_Net.length safeEs; |
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
322 |
val _ = warn_claset context th cs; |
42790 | 323 |
in |
324 |
CS |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
325 |
{safeIs = Item_Net.update th safeIs, |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
326 |
safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair, |
9938 | 327 |
safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair, |
42790 | 328 |
safeEs = safeEs, |
329 |
hazIs = hazIs, |
|
330 |
hazEs = hazEs, |
|
331 |
swrappers = swrappers, |
|
332 |
uwrappers = uwrappers, |
|
333 |
haz_netpair = haz_netpair, |
|
334 |
dup_netpair = dup_netpair, |
|
18691 | 335 |
xtra_netpair = insert' (the_default 0 w) (nI,nE) ([th], []) xtra_netpair} |
42790 | 336 |
end; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
337 |
|
42793 | 338 |
fun addSE w context th |
42790 | 339 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
340 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
341 |
if warn_rules context "Ignoring duplicate safe elimination (elim!)\n" safeEs th then cs |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
342 |
else if has_fewer_prems 1 th then |
42793 | 343 |
error ("Ill-formed elimination rule\n" ^ string_of_thm context th) |
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
344 |
else |
42790 | 345 |
let |
59970 | 346 |
val ctxt = default_context context th; |
347 |
val th' = classical_rule ctxt (flat_rule ctxt th); |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
348 |
val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) |
59582 | 349 |
List.partition (fn rl => Thm.nprems_of rl=1) [th']; |
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
350 |
val nI = Item_Net.length safeIs; |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
351 |
val nE = Item_Net.length safeEs + 1; |
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
352 |
val _ = warn_claset context th cs; |
42790 | 353 |
in |
354 |
CS |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
355 |
{safeEs = Item_Net.update th safeEs, |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
356 |
safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair, |
9938 | 357 |
safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair, |
42790 | 358 |
safeIs = safeIs, |
359 |
hazIs = hazIs, |
|
360 |
hazEs = hazEs, |
|
361 |
swrappers = swrappers, |
|
362 |
uwrappers = uwrappers, |
|
363 |
haz_netpair = haz_netpair, |
|
364 |
dup_netpair = dup_netpair, |
|
18691 | 365 |
xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair} |
42790 | 366 |
end; |
0 | 367 |
|
42793 | 368 |
fun addSD w context th = addSE w context (make_elim context th); |
369 |
||
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
370 |
|
1800 | 371 |
(*** Hazardous (unsafe) rules ***) |
0 | 372 |
|
42793 | 373 |
fun addI w context th |
42790 | 374 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
375 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
376 |
if warn_rules context "Ignoring duplicate introduction (intro)\n" hazIs th then cs |
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
377 |
else |
42790 | 378 |
let |
59970 | 379 |
val ctxt = default_context context th; |
380 |
val th' = flat_rule ctxt th; |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
381 |
val nI = Item_Net.length hazIs + 1; |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
382 |
val nE = Item_Net.length hazEs; |
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
383 |
val _ = warn_claset context th cs; |
42790 | 384 |
in |
385 |
CS |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
386 |
{hazIs = Item_Net.update th hazIs, |
42790 | 387 |
haz_netpair = insert (nI, nE) ([th'], []) haz_netpair, |
388 |
dup_netpair = insert (nI, nE) ([dup_intr th'], []) dup_netpair, |
|
389 |
safeIs = safeIs, |
|
390 |
safeEs = safeEs, |
|
391 |
hazEs = hazEs, |
|
392 |
swrappers = swrappers, |
|
393 |
uwrappers = uwrappers, |
|
9938 | 394 |
safe0_netpair = safe0_netpair, |
395 |
safep_netpair = safep_netpair, |
|
42790 | 396 |
xtra_netpair = insert' (the_default 1 w) (nI, nE) ([th], []) xtra_netpair} |
397 |
end |
|
398 |
handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*) (* FIXME !? *) |
|
42793 | 399 |
error ("Ill-formed introduction rule\n" ^ string_of_thm context th); |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
400 |
|
42793 | 401 |
fun addE w context th |
42790 | 402 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
403 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
404 |
if warn_rules context "Ignoring duplicate elimination (elim)\n" hazEs th then cs |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
405 |
else if has_fewer_prems 1 th then |
42793 | 406 |
error ("Ill-formed elimination rule\n" ^ string_of_thm context th) |
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
407 |
else |
42790 | 408 |
let |
59970 | 409 |
val ctxt = default_context context th; |
410 |
val th' = classical_rule ctxt (flat_rule ctxt th); |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
411 |
val nI = Item_Net.length hazIs; |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
412 |
val nE = Item_Net.length hazEs + 1; |
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
413 |
val _ = warn_claset context th cs; |
42790 | 414 |
in |
415 |
CS |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
416 |
{hazEs = Item_Net.update th hazEs, |
42790 | 417 |
haz_netpair = insert (nI, nE) ([], [th']) haz_netpair, |
59970 | 418 |
dup_netpair = insert (nI, nE) ([], [dup_elim ctxt th']) dup_netpair, |
42790 | 419 |
safeIs = safeIs, |
420 |
safeEs = safeEs, |
|
421 |
hazIs = hazIs, |
|
422 |
swrappers = swrappers, |
|
423 |
uwrappers = uwrappers, |
|
9938 | 424 |
safe0_netpair = safe0_netpair, |
425 |
safep_netpair = safep_netpair, |
|
42790 | 426 |
xtra_netpair = insert' (the_default 1 w) (nI, nE) ([], [th]) xtra_netpair} |
427 |
end; |
|
0 | 428 |
|
42793 | 429 |
fun addD w context th = addE w context (make_elim context th); |
430 |
||
0 | 431 |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
432 |
|
10736 | 433 |
(*** Deletion of rules |
1800 | 434 |
Working out what to delete, requires repeating much of the code used |
9938 | 435 |
to insert. |
1800 | 436 |
***) |
437 |
||
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
438 |
fun delSI context th |
42790 | 439 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
440 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
441 |
if Item_Net.member safeIs th then |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
442 |
let |
59970 | 443 |
val ctxt = default_context context th; |
444 |
val th' = flat_rule ctxt th; |
|
42790 | 445 |
val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th']; |
446 |
in |
|
447 |
CS |
|
448 |
{safe0_netpair = delete (safe0_rls, []) safe0_netpair, |
|
449 |
safep_netpair = delete (safep_rls, []) safep_netpair, |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
450 |
safeIs = Item_Net.remove th safeIs, |
42790 | 451 |
safeEs = safeEs, |
452 |
hazIs = hazIs, |
|
453 |
hazEs = hazEs, |
|
454 |
swrappers = swrappers, |
|
455 |
uwrappers = uwrappers, |
|
456 |
haz_netpair = haz_netpair, |
|
457 |
dup_netpair = dup_netpair, |
|
458 |
xtra_netpair = delete' ([th], []) xtra_netpair} |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
459 |
end |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
460 |
else cs; |
1800 | 461 |
|
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
462 |
fun delSE context th |
42790 | 463 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
464 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
465 |
if Item_Net.member safeEs th then |
42790 | 466 |
let |
59970 | 467 |
val ctxt = default_context context th; |
468 |
val th' = classical_rule ctxt (flat_rule ctxt th); |
|
59582 | 469 |
val (safe0_rls, safep_rls) = List.partition (fn rl => Thm.nprems_of rl = 1) [th']; |
42790 | 470 |
in |
471 |
CS |
|
472 |
{safe0_netpair = delete ([], safe0_rls) safe0_netpair, |
|
473 |
safep_netpair = delete ([], safep_rls) safep_netpair, |
|
474 |
safeIs = safeIs, |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
475 |
safeEs = Item_Net.remove th safeEs, |
42790 | 476 |
hazIs = hazIs, |
477 |
hazEs = hazEs, |
|
478 |
swrappers = swrappers, |
|
479 |
uwrappers = uwrappers, |
|
480 |
haz_netpair = haz_netpair, |
|
481 |
dup_netpair = dup_netpair, |
|
482 |
xtra_netpair = delete' ([], [th]) xtra_netpair} |
|
483 |
end |
|
484 |
else cs; |
|
1800 | 485 |
|
42793 | 486 |
fun delI context th |
42790 | 487 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
488 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
489 |
if Item_Net.member hazIs th then |
59970 | 490 |
let |
491 |
val ctxt = default_context context th; |
|
492 |
val th' = flat_rule ctxt th; |
|
493 |
in |
|
42790 | 494 |
CS |
495 |
{haz_netpair = delete ([th'], []) haz_netpair, |
|
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
496 |
dup_netpair = delete ([dup_intr th'], []) dup_netpair, |
42790 | 497 |
safeIs = safeIs, |
498 |
safeEs = safeEs, |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
499 |
hazIs = Item_Net.remove th hazIs, |
42790 | 500 |
hazEs = hazEs, |
501 |
swrappers = swrappers, |
|
502 |
uwrappers = uwrappers, |
|
9938 | 503 |
safe0_netpair = safe0_netpair, |
504 |
safep_netpair = safep_netpair, |
|
12401 | 505 |
xtra_netpair = delete' ([th], []) xtra_netpair} |
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
506 |
end |
42790 | 507 |
else cs |
508 |
handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*) (* FIXME !? *) |
|
42793 | 509 |
error ("Ill-formed introduction rule\n" ^ string_of_thm context th); |
1800 | 510 |
|
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
511 |
fun delE context th |
42790 | 512 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
513 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
514 |
if Item_Net.member hazEs th then |
59970 | 515 |
let |
516 |
val ctxt = default_context context th; |
|
517 |
val th' = classical_rule ctxt (flat_rule ctxt th); |
|
518 |
in |
|
42790 | 519 |
CS |
520 |
{haz_netpair = delete ([], [th']) haz_netpair, |
|
59970 | 521 |
dup_netpair = delete ([], [dup_elim ctxt th']) dup_netpair, |
42790 | 522 |
safeIs = safeIs, |
523 |
safeEs = safeEs, |
|
524 |
hazIs = hazIs, |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
525 |
hazEs = Item_Net.remove th hazEs, |
42790 | 526 |
swrappers = swrappers, |
527 |
uwrappers = uwrappers, |
|
9938 | 528 |
safe0_netpair = safe0_netpair, |
529 |
safep_netpair = safep_netpair, |
|
12401 | 530 |
xtra_netpair = delete' ([], [th]) xtra_netpair} |
42790 | 531 |
end |
532 |
else cs; |
|
1800 | 533 |
|
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset
|
534 |
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*) |
42793 | 535 |
fun delrule context th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) = |
536 |
let val th' = Tactic.make_elim th in |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
537 |
if Item_Net.member safeIs th orelse Item_Net.member safeEs th orelse |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
538 |
Item_Net.member hazIs th orelse Item_Net.member hazEs th orelse |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
539 |
Item_Net.member safeEs th' orelse Item_Net.member hazEs th' |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
540 |
then |
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
541 |
delSI context th |
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
542 |
(delSE context th |
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
543 |
(delI context th |
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
544 |
(delE context th (delSE context th' (delE context th' cs))))) |
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset
|
545 |
else (warn_thm context "Undeclared classical rule\n" th; cs) |
9938 | 546 |
end; |
1800 | 547 |
|
548 |
||
42793 | 549 |
|
550 |
(** claset data **) |
|
42790 | 551 |
|
42793 | 552 |
(* wrappers *) |
42790 | 553 |
|
22674 | 554 |
fun map_swrappers f |
555 |
(CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
|
556 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
557 |
CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, |
|
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
558 |
swrappers = f swrappers, uwrappers = uwrappers, |
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
559 |
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, |
6955 | 560 |
haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair}; |
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
561 |
|
22674 | 562 |
fun map_uwrappers f |
42793 | 563 |
(CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
22674 | 564 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
565 |
CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, |
|
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
566 |
swrappers = swrappers, uwrappers = f uwrappers, |
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
567 |
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, |
6955 | 568 |
haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair}; |
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
569 |
|
22674 | 570 |
|
42793 | 571 |
(* merge_cs *) |
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
572 |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
573 |
(*Merge works by adding all new rules of the 2nd claset into the 1st claset, |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
574 |
in order to preserve priorities reliably.*) |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
575 |
|
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
576 |
fun merge_thms add thms1 thms2 = |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
577 |
fold_rev (fn thm => if Item_Net.member thms1 thm then I else add thm) (Item_Net.content thms2); |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
578 |
|
22674 | 579 |
fun merge_cs (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}, |
24358 | 580 |
cs' as CS {safeIs = safeIs2, safeEs = safeEs2, hazIs = hazIs2, hazEs = hazEs2, |
22674 | 581 |
swrappers, uwrappers, ...}) = |
24358 | 582 |
if pointer_eq (cs, cs') then cs |
583 |
else |
|
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
584 |
cs |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
585 |
|> merge_thms (addSI NONE NONE) safeIs safeIs2 |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
586 |
|> merge_thms (addSE NONE NONE) safeEs safeEs2 |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
587 |
|> merge_thms (addI NONE NONE) hazIs hazIs2 |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
588 |
|> merge_thms (addE NONE NONE) hazEs hazEs2 |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
589 |
|> map_swrappers (fn ws => AList.merge (op =) (K true) (ws, swrappers)) |
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset
|
590 |
|> map_uwrappers (fn ws => AList.merge (op =) (K true) (ws, uwrappers)); |
42793 | 591 |
|
592 |
||
593 |
(* data *) |
|
594 |
||
595 |
structure Claset = Generic_Data |
|
596 |
( |
|
597 |
type T = claset; |
|
598 |
val empty = empty_cs; |
|
599 |
val extend = I; |
|
600 |
val merge = merge_cs; |
|
601 |
); |
|
602 |
||
603 |
val claset_of = Claset.get o Context.Proof; |
|
604 |
val rep_claset_of = rep_cs o claset_of; |
|
605 |
||
606 |
val get_cs = Claset.get; |
|
607 |
val map_cs = Claset.map; |
|
608 |
||
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
609 |
fun map_theory_claset f thy = |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
610 |
let |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
611 |
val ctxt' = f (Proof_Context.init_global thy); |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
612 |
val thy' = Proof_Context.theory_of ctxt'; |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
613 |
in Context.theory_map (Claset.map (K (claset_of ctxt'))) thy' end; |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
614 |
|
42793 | 615 |
fun map_claset f = Context.proof_map (map_cs f); |
616 |
fun put_claset cs = map_claset (K cs); |
|
617 |
||
618 |
fun print_claset ctxt = |
|
619 |
let |
|
620 |
val {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...} = rep_claset_of ctxt; |
|
51584 | 621 |
val pretty_thms = map (Display.pretty_thm_item ctxt) o Item_Net.content; |
42793 | 622 |
in |
623 |
[Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs), |
|
624 |
Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs), |
|
625 |
Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs), |
|
626 |
Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs), |
|
627 |
Pretty.strs ("safe wrappers:" :: map #1 swrappers), |
|
628 |
Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)] |
|
56334
6b3739fee456
some shortcuts for chunks, which sometimes avoid bulky string output;
wenzelm
parents:
54742
diff
changeset
|
629 |
|> Pretty.writeln_chunks |
42793 | 630 |
end; |
631 |
||
632 |
||
633 |
(* old-style declarations *) |
|
634 |
||
635 |
fun decl f (ctxt, ths) = map_claset (fold_rev (f (SOME (Context.Proof ctxt))) ths) ctxt; |
|
636 |
||
637 |
val op addSIs = decl (addSI NONE); |
|
638 |
val op addSEs = decl (addSE NONE); |
|
639 |
val op addSDs = decl (addSD NONE); |
|
640 |
val op addIs = decl (addI NONE); |
|
641 |
val op addEs = decl (addE NONE); |
|
642 |
val op addDs = decl (addD NONE); |
|
643 |
val op delrules = decl delrule; |
|
644 |
||
645 |
||
646 |
||
647 |
(*** Modifying the wrapper tacticals ***) |
|
648 |
||
649 |
fun appSWrappers ctxt = fold (fn (_, w) => w ctxt) (#swrappers (rep_claset_of ctxt)); |
|
650 |
fun appWrappers ctxt = fold (fn (_, w) => w ctxt) (#uwrappers (rep_claset_of ctxt)); |
|
651 |
||
652 |
fun update_warn msg (p as (key : string, _)) xs = |
|
653 |
(if AList.defined (op =) xs key then warning msg else (); AList.update (op =) p xs); |
|
654 |
||
655 |
fun delete_warn msg (key : string) xs = |
|
656 |
if AList.defined (op =) xs key then AList.delete (op =) key xs |
|
657 |
else (warning msg; xs); |
|
658 |
||
659 |
(*Add/replace a safe wrapper*) |
|
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
660 |
fun ctxt addSWrapper new_swrapper = ctxt |> map_claset |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
661 |
(map_swrappers (update_warn ("Overwriting safe wrapper " ^ fst new_swrapper) new_swrapper)); |
42793 | 662 |
|
663 |
(*Add/replace an unsafe wrapper*) |
|
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
664 |
fun ctxt addWrapper new_uwrapper = ctxt |> map_claset |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
665 |
(map_uwrappers (update_warn ("Overwriting unsafe wrapper " ^ fst new_uwrapper) new_uwrapper)); |
42793 | 666 |
|
667 |
(*Remove a safe wrapper*) |
|
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
668 |
fun ctxt delSWrapper name = ctxt |> map_claset |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
669 |
(map_swrappers (delete_warn ("No such safe wrapper in claset: " ^ name) name)); |
42793 | 670 |
|
671 |
(*Remove an unsafe wrapper*) |
|
51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
672 |
fun ctxt delWrapper name = ctxt |> map_claset |
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset
|
673 |
(map_uwrappers (delete_warn ("No such unsafe wrapper in claset: " ^ name) name)); |
42793 | 674 |
|
675 |
(* compose a safe tactic alternatively before/after safe_step_tac *) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
676 |
fun ctxt addSbefore (name, tac1) = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
677 |
ctxt addSWrapper (name, fn ctxt => fn tac2 => tac1 ctxt ORELSE' tac2); |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
678 |
fun ctxt addSafter (name, tac2) = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
679 |
ctxt addSWrapper (name, fn ctxt => fn tac1 => tac1 ORELSE' tac2 ctxt); |
42793 | 680 |
|
681 |
(*compose a tactic alternatively before/after the step tactic *) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
682 |
fun ctxt addbefore (name, tac1) = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
683 |
ctxt addWrapper (name, fn ctxt => fn tac2 => tac1 ctxt APPEND' tac2); |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
684 |
fun ctxt addafter (name, tac2) = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
685 |
ctxt addWrapper (name, fn ctxt => fn tac1 => tac1 APPEND' tac2 ctxt); |
42793 | 686 |
|
58957 | 687 |
fun ctxt addD2 (name, thm) = |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
688 |
ctxt addafter (name, fn ctxt' => dresolve_tac ctxt' [thm] THEN' assume_tac ctxt'); |
58957 | 689 |
fun ctxt addE2 (name, thm) = |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
690 |
ctxt addafter (name, fn ctxt' => eresolve_tac ctxt' [thm] THEN' assume_tac ctxt'); |
58957 | 691 |
fun ctxt addSD2 (name, thm) = |
692 |
ctxt addSafter (name, fn ctxt' => dmatch_tac ctxt' [thm] THEN' eq_assume_tac); |
|
693 |
fun ctxt addSE2 (name, thm) = |
|
694 |
ctxt addSafter (name, fn ctxt' => ematch_tac ctxt' [thm] THEN' eq_assume_tac); |
|
42793 | 695 |
|
1711 | 696 |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
697 |
|
1800 | 698 |
(**** Simple tactics for theorem proving ****) |
0 | 699 |
|
700 |
(*Attack subgoals using safe inferences -- matching, not resolution*) |
|
42793 | 701 |
fun safe_step_tac ctxt = |
702 |
let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in |
|
703 |
appSWrappers ctxt |
|
704 |
(FIRST' |
|
705 |
[eq_assume_tac, |
|
58957 | 706 |
eq_mp_tac ctxt, |
59164 | 707 |
bimatch_from_nets_tac ctxt safe0_netpair, |
51798 | 708 |
FIRST' (map (fn tac => tac ctxt) Data.hyp_subst_tacs), |
59164 | 709 |
bimatch_from_nets_tac ctxt safep_netpair]) |
42793 | 710 |
end; |
0 | 711 |
|
5757 | 712 |
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*) |
42793 | 713 |
fun safe_steps_tac ctxt = |
714 |
REPEAT_DETERM1 o (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac ctxt i)); |
|
5757 | 715 |
|
0 | 716 |
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*) |
42793 | 717 |
fun safe_tac ctxt = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac ctxt)); |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
718 |
|
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
719 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
720 |
(*** Clarify_tac: do safe steps without causing branching ***) |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
721 |
|
42790 | 722 |
fun nsubgoalsP n (k, brl) = (subgoals_of_brl brl = n); |
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
723 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
724 |
(*version of bimatch_from_nets_tac that only applies rules that |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
725 |
create precisely n subgoals.*) |
59164 | 726 |
fun n_bimatch_from_nets_tac ctxt n = |
727 |
biresolution_from_nets_tac ctxt (order_list o filter (nsubgoalsP n)) true; |
|
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
728 |
|
58957 | 729 |
fun eq_contr_tac ctxt i = ematch_tac ctxt [Data.not_elim] i THEN eq_assume_tac i; |
730 |
fun eq_assume_contr_tac ctxt = eq_assume_tac ORELSE' eq_contr_tac ctxt; |
|
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
731 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
732 |
(*Two-way branching is allowed only if one of the branches immediately closes*) |
58957 | 733 |
fun bimatch2_tac ctxt netpair i = |
59164 | 734 |
n_bimatch_from_nets_tac ctxt 2 netpair i THEN |
58957 | 735 |
(eq_assume_contr_tac ctxt i ORELSE eq_assume_contr_tac ctxt (i + 1)); |
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
736 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
737 |
(*Attack subgoals using safe inferences -- matching, not resolution*) |
42793 | 738 |
fun clarify_step_tac ctxt = |
739 |
let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in |
|
740 |
appSWrappers ctxt |
|
741 |
(FIRST' |
|
58957 | 742 |
[eq_assume_contr_tac ctxt, |
59164 | 743 |
bimatch_from_nets_tac ctxt safe0_netpair, |
51798 | 744 |
FIRST' (map (fn tac => tac ctxt) Data.hyp_subst_tacs), |
59164 | 745 |
n_bimatch_from_nets_tac ctxt 1 safep_netpair, |
58957 | 746 |
bimatch2_tac ctxt safep_netpair]) |
42793 | 747 |
end; |
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
748 |
|
42793 | 749 |
fun clarify_tac ctxt = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac ctxt 1)); |
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
750 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
751 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
752 |
(*** Unsafe steps instantiate variables or lose information ***) |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
753 |
|
4066 | 754 |
(*Backtracking is allowed among the various these unsafe ways of |
755 |
proving a subgoal. *) |
|
42793 | 756 |
fun inst0_step_tac ctxt = |
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
757 |
assume_tac ctxt APPEND' |
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58958
diff
changeset
|
758 |
contr_tac ctxt APPEND' |
59164 | 759 |
biresolve_from_nets_tac ctxt (#safe0_netpair (rep_claset_of ctxt)); |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
760 |
|
4066 | 761 |
(*These unsafe steps could generate more subgoals.*) |
42793 | 762 |
fun instp_step_tac ctxt = |
59164 | 763 |
biresolve_from_nets_tac ctxt (#safep_netpair (rep_claset_of ctxt)); |
0 | 764 |
|
765 |
(*These steps could instantiate variables and are therefore unsafe.*) |
|
42793 | 766 |
fun inst_step_tac ctxt = inst0_step_tac ctxt APPEND' instp_step_tac ctxt; |
0 | 767 |
|
42793 | 768 |
fun haz_step_tac ctxt = |
59164 | 769 |
biresolve_from_nets_tac ctxt (#haz_netpair (rep_claset_of ctxt)); |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
770 |
|
0 | 771 |
(*Single step for the prover. FAILS unless it makes progress. *) |
42793 | 772 |
fun step_tac ctxt i = |
773 |
safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt ORELSE' haz_step_tac ctxt) i; |
|
0 | 774 |
|
775 |
(*Using a "safe" rule to instantiate variables is unsafe. This tactic |
|
776 |
allows backtracking from "safe" rules to "unsafe" rules here.*) |
|
42793 | 777 |
fun slow_step_tac ctxt i = |
778 |
safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt APPEND' haz_step_tac ctxt) i; |
|
0 | 779 |
|
42791
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
780 |
|
1800 | 781 |
(**** The following tactics all fail unless they solve one goal ****) |
0 | 782 |
|
783 |
(*Dumb but fast*) |
|
42793 | 784 |
fun fast_tac ctxt = |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
785 |
Object_Logic.atomize_prems_tac ctxt THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac ctxt 1)); |
0 | 786 |
|
787 |
(*Slower but smarter than fast_tac*) |
|
42793 | 788 |
fun best_tac ctxt = |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
789 |
Object_Logic.atomize_prems_tac ctxt THEN' |
42793 | 790 |
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (step_tac ctxt 1)); |
0 | 791 |
|
9402 | 792 |
(*even a bit smarter than best_tac*) |
42793 | 793 |
fun first_best_tac ctxt = |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
794 |
Object_Logic.atomize_prems_tac ctxt THEN' |
42793 | 795 |
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (FIRSTGOAL (step_tac ctxt))); |
9402 | 796 |
|
42793 | 797 |
fun slow_tac ctxt = |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
798 |
Object_Logic.atomize_prems_tac ctxt THEN' |
42793 | 799 |
SELECT_GOAL (DEPTH_SOLVE (slow_step_tac ctxt 1)); |
0 | 800 |
|
42793 | 801 |
fun slow_best_tac ctxt = |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
802 |
Object_Logic.atomize_prems_tac ctxt THEN' |
42793 | 803 |
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (slow_step_tac ctxt 1)); |
0 | 804 |
|
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
805 |
|
10736 | 806 |
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*) |
42791
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
807 |
|
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
808 |
val weight_ASTAR = 5; |
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
809 |
|
42793 | 810 |
fun astar_tac ctxt = |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
811 |
Object_Logic.atomize_prems_tac ctxt THEN' |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
812 |
SELECT_GOAL |
52462
a241826ed003
actually use Data.sizef, not hardwired size_of_thm;
wenzelm
parents:
51798
diff
changeset
|
813 |
(ASTAR (has_fewer_prems 1, fn lev => fn thm => Data.sizef thm + weight_ASTAR * lev) |
42793 | 814 |
(step_tac ctxt 1)); |
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
815 |
|
42793 | 816 |
fun slow_astar_tac ctxt = |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
817 |
Object_Logic.atomize_prems_tac ctxt THEN' |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
818 |
SELECT_GOAL |
52462
a241826ed003
actually use Data.sizef, not hardwired size_of_thm;
wenzelm
parents:
51798
diff
changeset
|
819 |
(ASTAR (has_fewer_prems 1, fn lev => fn thm => Data.sizef thm + weight_ASTAR * lev) |
42793 | 820 |
(slow_step_tac ctxt 1)); |
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
821 |
|
42790 | 822 |
|
1800 | 823 |
(**** Complete tactic, loosely based upon LeanTaP. This tactic is the outcome |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
824 |
of much experimentation! Changing APPEND to ORELSE below would prove |
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
825 |
easy theorems faster, but loses completeness -- and many of the harder |
1800 | 826 |
theorems such as 43. ****) |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
827 |
|
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
828 |
(*Non-deterministic! Could always expand the first unsafe connective. |
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
829 |
That's hard to implement and did not perform better in experiments, due to |
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
830 |
greater search depth required.*) |
42793 | 831 |
fun dup_step_tac ctxt = |
59164 | 832 |
biresolve_from_nets_tac ctxt (#dup_netpair (rep_claset_of ctxt)); |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
833 |
|
5523 | 834 |
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*) |
5757 | 835 |
local |
42793 | 836 |
fun slow_step_tac' ctxt = appWrappers ctxt (instp_step_tac ctxt APPEND' dup_step_tac ctxt); |
42790 | 837 |
in |
42793 | 838 |
fun depth_tac ctxt m i state = SELECT_GOAL |
839 |
(safe_steps_tac ctxt 1 THEN_ELSE |
|
840 |
(DEPTH_SOLVE (depth_tac ctxt m 1), |
|
841 |
inst0_step_tac ctxt 1 APPEND COND (K (m = 0)) no_tac |
|
842 |
(slow_step_tac' ctxt 1 THEN DEPTH_SOLVE (depth_tac ctxt (m - 1) 1)))) i state; |
|
5757 | 843 |
end; |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
844 |
|
10736 | 845 |
(*Search, with depth bound m. |
2173 | 846 |
This is the "entry point", which does safe inferences first.*) |
42793 | 847 |
fun safe_depth_tac ctxt m = SUBGOAL (fn (prem, i) => |
848 |
let |
|
849 |
val deti = (*No Vars in the goal? No need to backtrack between goals.*) |
|
850 |
if exists_subterm (fn Var _ => true | _ => false) prem then DETERM else I; |
|
42790 | 851 |
in |
42793 | 852 |
SELECT_GOAL (TRY (safe_tac ctxt) THEN DEPTH_SOLVE (deti (depth_tac ctxt m 1))) i |
42790 | 853 |
end); |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
854 |
|
42793 | 855 |
fun deepen_tac ctxt = DEEPEN (2, 10) (safe_depth_tac ctxt); |
24021 | 856 |
|
857 |
||
5885 | 858 |
(* attributes *) |
859 |
||
42793 | 860 |
fun attrib f = |
861 |
Thm.declaration_attribute (fn th => fn context => map_cs (f (SOME context) th) context); |
|
5885 | 862 |
|
18691 | 863 |
val safe_elim = attrib o addSE; |
864 |
val safe_intro = attrib o addSI; |
|
42793 | 865 |
val safe_dest = attrib o addSD; |
18691 | 866 |
val haz_elim = attrib o addE; |
867 |
val haz_intro = attrib o addI; |
|
42793 | 868 |
val haz_dest = attrib o addD; |
45375
7fe19930dfc9
more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents:
42817
diff
changeset
|
869 |
|
7fe19930dfc9
more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents:
42817
diff
changeset
|
870 |
val rule_del = |
7fe19930dfc9
more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents:
42817
diff
changeset
|
871 |
Thm.declaration_attribute (fn th => fn context => |
7fe19930dfc9
more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents:
42817
diff
changeset
|
872 |
context |> map_cs (delrule (SOME context) th) |> |
7fe19930dfc9
more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents:
42817
diff
changeset
|
873 |
Thm.attribute_declaration Context_Rules.rule_del th); |
5885 | 874 |
|
875 |
||
5841 | 876 |
|
5885 | 877 |
(** concrete syntax of attributes **) |
5841 | 878 |
|
879 |
val introN = "intro"; |
|
880 |
val elimN = "elim"; |
|
881 |
val destN = "dest"; |
|
882 |
||
58826 | 883 |
val _ = |
884 |
Theory.setup |
|
885 |
(Attrib.setup @{binding swapped} (Scan.succeed swapped) |
|
886 |
"classical swap of introduction rule" #> |
|
887 |
Attrib.setup @{binding dest} (Context_Rules.add safe_dest haz_dest Context_Rules.dest_query) |
|
888 |
"declaration of Classical destruction rule" #> |
|
889 |
Attrib.setup @{binding elim} (Context_Rules.add safe_elim haz_elim Context_Rules.elim_query) |
|
890 |
"declaration of Classical elimination rule" #> |
|
891 |
Attrib.setup @{binding intro} (Context_Rules.add safe_intro haz_intro Context_Rules.intro_query) |
|
892 |
"declaration of Classical introduction rule" #> |
|
893 |
Attrib.setup @{binding rule} (Scan.lift Args.del >> K rule_del) |
|
894 |
"remove declaration of intro/elim/dest rule"); |
|
5841 | 895 |
|
896 |
||
897 |
||
7230 | 898 |
(** proof methods **) |
899 |
||
900 |
local |
|
901 |
||
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
902 |
fun some_rule_tac ctxt facts = SUBGOAL (fn (goal, i) => |
5841 | 903 |
let |
33369 | 904 |
val [rules1, rules2, rules4] = Context_Rules.find_rules false facts goal ctxt; |
42793 | 905 |
val {xtra_netpair, ...} = rep_claset_of ctxt; |
33369 | 906 |
val rules3 = Context_Rules.find_rules_netpair true facts goal xtra_netpair; |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
907 |
val rules = rules1 @ rules2 @ rules3 @ rules4; |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58893
diff
changeset
|
908 |
val ruleq = Drule.multi_resolves (SOME ctxt) facts rules; |
52732 | 909 |
val _ = Method.trace ctxt rules; |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
910 |
in |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
911 |
fn st => Seq.maps (fn rule => resolve_tac ctxt [rule] i st) ruleq |
18834 | 912 |
end) |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
913 |
THEN_ALL_NEW Goal.norm_hhf_tac ctxt; |
5841 | 914 |
|
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
915 |
in |
7281 | 916 |
|
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
917 |
fun rule_tac ctxt [] facts = some_rule_tac ctxt facts |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset
|
918 |
| rule_tac ctxt rules facts = Method.rule_tac ctxt rules facts; |
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
919 |
|
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
920 |
fun default_tac ctxt rules facts = |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
921 |
HEADGOAL (rule_tac ctxt rules facts) ORELSE |
26470 | 922 |
Class.default_intro_tac ctxt facts; |
10309 | 923 |
|
7230 | 924 |
end; |
5841 | 925 |
|
926 |
||
6502 | 927 |
(* automatic methods *) |
5841 | 928 |
|
5927 | 929 |
val cla_modifiers = |
58048
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
57859
diff
changeset
|
930 |
[Args.$$$ destN -- Args.bang_colon >> K (Method.modifier (safe_dest NONE) @{here}), |
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
57859
diff
changeset
|
931 |
Args.$$$ destN -- Args.colon >> K (Method.modifier (haz_dest NONE) @{here}), |
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
57859
diff
changeset
|
932 |
Args.$$$ elimN -- Args.bang_colon >> K (Method.modifier (safe_elim NONE) @{here}), |
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
57859
diff
changeset
|
933 |
Args.$$$ elimN -- Args.colon >> K (Method.modifier (haz_elim NONE) @{here}), |
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
57859
diff
changeset
|
934 |
Args.$$$ introN -- Args.bang_colon >> K (Method.modifier (safe_intro NONE) @{here}), |
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
57859
diff
changeset
|
935 |
Args.$$$ introN -- Args.colon >> K (Method.modifier (haz_intro NONE) @{here}), |
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
57859
diff
changeset
|
936 |
Args.del -- Args.colon >> K (Method.modifier rule_del @{here})]; |
5927 | 937 |
|
42793 | 938 |
fun cla_method tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD o tac); |
939 |
fun cla_method' tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD' o tac); |
|
5841 | 940 |
|
941 |
||
942 |
||
58826 | 943 |
(** method setup **) |
5841 | 944 |
|
58826 | 945 |
val _ = |
946 |
Theory.setup |
|
947 |
(Method.setup @{binding default} |
|
948 |
(Attrib.thms >> (fn rules => fn ctxt => METHOD (default_tac ctxt rules))) |
|
949 |
"apply some intro/elim rule (potentially classical)" #> |
|
950 |
Method.setup @{binding rule} |
|
951 |
(Attrib.thms >> (fn rules => fn ctxt => METHOD (HEADGOAL o rule_tac ctxt rules))) |
|
952 |
"apply some intro/elim rule (potentially classical)" #> |
|
953 |
Method.setup @{binding contradiction} |
|
954 |
(Scan.succeed (fn ctxt => Method.rule ctxt [Data.not_elim, Drule.rotate_prems 1 Data.not_elim])) |
|
955 |
"proof by contradiction" #> |
|
956 |
Method.setup @{binding clarify} (cla_method' (CHANGED_PROP oo clarify_tac)) |
|
957 |
"repeatedly apply safe steps" #> |
|
958 |
Method.setup @{binding fast} (cla_method' fast_tac) "classical prover (depth-first)" #> |
|
959 |
Method.setup @{binding slow} (cla_method' slow_tac) "classical prover (slow depth-first)" #> |
|
960 |
Method.setup @{binding best} (cla_method' best_tac) "classical prover (best-first)" #> |
|
961 |
Method.setup @{binding deepen} |
|
962 |
(Scan.lift (Scan.optional Parse.nat 4) --| Method.sections cla_modifiers |
|
963 |
>> (fn n => fn ctxt => SIMPLE_METHOD' (deepen_tac ctxt n))) |
|
964 |
"classical prover (iterative deepening)" #> |
|
965 |
Method.setup @{binding safe} (cla_method (CHANGED_PROP o safe_tac)) |
|
966 |
"classical prover (apply safe rules)" #> |
|
967 |
Method.setup @{binding safe_step} (cla_method' safe_step_tac) |
|
968 |
"single classical step (safe rules)" #> |
|
969 |
Method.setup @{binding inst_step} (cla_method' inst_step_tac) |
|
970 |
"single classical step (safe rules, allow instantiations)" #> |
|
971 |
Method.setup @{binding step} (cla_method' step_tac) |
|
972 |
"single classical step (safe and unsafe rules)" #> |
|
973 |
Method.setup @{binding slow_step} (cla_method' slow_step_tac) |
|
974 |
"single classical step (safe and unsafe rules, allow backtracking)" #> |
|
975 |
Method.setup @{binding clarify_step} (cla_method' clarify_step_tac) |
|
976 |
"single classical step (safe rules, without splitting)"); |
|
5841 | 977 |
|
8667 | 978 |
|
979 |
(** outer syntax **) |
|
980 |
||
24867 | 981 |
val _ = |
59936
b8ffc3dc9e24
@{command_spec} is superseded by @{command_keyword};
wenzelm
parents:
59582
diff
changeset
|
982 |
Outer_Syntax.command @{command_keyword print_claset} "print context of Classical Reasoner" |
60097
d20ca79d50e4
discontinued pointless warnings: commands are only defined inside a theory context;
wenzelm
parents:
59970
diff
changeset
|
983 |
(Scan.succeed (Toplevel.keep (print_claset o Toplevel.context_of))); |
8667 | 984 |
|
5841 | 985 |
end; |