author  wenzelm 
Tue, 13 Jun 2006 23:41:41 +0200  
changeset 19877  705ba8232952 
parent 19257  4463aee061bc 
child 20956  00fe22000c6a 
permissions  rwrr 
9938  1 
(* Title: Provers/classical.ML 
0  2 
ID: $Id$ 
9938  3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 
0  4 
Copyright 1992 University of Cambridge 
5 

6 
Theorem prover for classical reasoning, including predicate calculus, set 

7 
theory, etc. 

8 

9563
216d053992a5
fixed classification of rules in atts and modifiers (final!?);
wenzelm
parents:
9513
diff
changeset

9 
Rules must be classified as intro, elim, safe, hazardous (unsafe). 
0  10 

11 
A rule is unsafe unless it can be applied blindly without harmful results. 

12 
For a rule to be safe, its premises and conclusion should be logically 

13 
equivalent. There should be no variables in the premises that are not in 

14 
the conclusion. 

15 
*) 

16 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

17 
(*higher precedence than := facilitates use of references*) 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

18 
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules 
4651  19 
addSWrapper delSWrapper addWrapper delWrapper 
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

20 
addSbefore addSafter addbefore addafter 
5523  21 
addD2 addE2 addSD2 addSE2; 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

22 

9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

23 

9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

24 
(*should be a type abbreviation in signature CLASSICAL*) 
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

25 
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net; 
4651  26 
type wrapper = (int > tactic) > (int > tactic); 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

27 

0  28 
signature CLASSICAL_DATA = 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

29 
sig 
9938  30 
val mp : thm (* [ P>Q; P ] ==> Q *) 
31 
val not_elim : thm (* [ ~P; P ] ==> R *) 

32 
val classical : thm (* (~P ==> P) ==> P *) 

33 
val sizef : thm > int (* size function for BEST_FIRST *) 

0  34 
val hyp_subst_tacs: (int > tactic) list 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

35 
end; 
0  36 

5841  37 
signature BASIC_CLASSICAL = 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

38 
sig 
0  39 
type claset 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

40 
val empty_cs: claset 
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

41 
val print_cs: claset > unit 
4380  42 
val print_claset: theory > unit 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

43 
val rep_cs: 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

44 
claset > {safeIs: thm list, safeEs: thm list, 
9938  45 
hazIs: thm list, hazEs: thm list, 
10736  46 
swrappers: (string * wrapper) list, 
9938  47 
uwrappers: (string * wrapper) list, 
48 
safe0_netpair: netpair, safep_netpair: netpair, 

12401  49 
haz_netpair: netpair, dup_netpair: netpair, 
50 
xtra_netpair: ContextRules.netpair} 

9938  51 
val merge_cs : claset * claset > claset 
52 
val addDs : claset * thm list > claset 

53 
val addEs : claset * thm list > claset 

54 
val addIs : claset * thm list > claset 

55 
val addSDs : claset * thm list > claset 

56 
val addSEs : claset * thm list > claset 

57 
val addSIs : claset * thm list > claset 

58 
val delrules : claset * thm list > claset 

59 
val addSWrapper : claset * (string * wrapper) > claset 

60 
val delSWrapper : claset * string > claset 

61 
val addWrapper : claset * (string * wrapper) > claset 

62 
val delWrapper : claset * string > claset 

63 
val addSbefore : claset * (string * (int > tactic)) > claset 

11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

64 
val addSafter : claset * (string * (int > tactic)) > claset 
9938  65 
val addbefore : claset * (string * (int > tactic)) > claset 
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

66 
val addafter : claset * (string * (int > tactic)) > claset 
5523  67 
val addD2 : claset * (string * thm) > claset 
68 
val addE2 : claset * (string * thm) > claset 

69 
val addSD2 : claset * (string * thm) > claset 

70 
val addSE2 : claset * (string * thm) > claset 

9938  71 
val appSWrappers : claset > wrapper 
72 
val appWrappers : claset > wrapper 

982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

73 

17880  74 
val change_claset_of: theory > (claset > claset) > unit 
75 
val change_claset: (claset > claset) > unit 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

76 
val claset_of: theory > claset 
17880  77 
val claset: unit > claset 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

78 
val CLASET: (claset > tactic) > tactic 
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

79 
val CLASET': (claset > 'a > tactic) > 'a > tactic 
15036  80 
val local_claset_of : Proof.context > claset 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

81 

9938  82 
val fast_tac : claset > int > tactic 
83 
val slow_tac : claset > int > tactic 

84 
val weight_ASTAR : int ref 

85 
val astar_tac : claset > int > tactic 

86 
val slow_astar_tac : claset > int > tactic 

87 
val best_tac : claset > int > tactic 

88 
val first_best_tac : claset > int > tactic 

89 
val slow_best_tac : claset > int > tactic 

90 
val depth_tac : claset > int > int > tactic 

91 
val deepen_tac : claset > int > int > tactic 

1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset

92 

9938  93 
val contr_tac : int > tactic 
94 
val dup_elim : thm > thm 

95 
val dup_intr : thm > thm 

96 
val dup_step_tac : claset > int > tactic 

97 
val eq_mp_tac : int > tactic 

98 
val haz_step_tac : claset > int > tactic 

99 
val joinrules : thm list * thm list > (bool * thm) list 

100 
val mp_tac : int > tactic 

101 
val safe_tac : claset > tactic 

102 
val safe_steps_tac : claset > int > tactic 

103 
val safe_step_tac : claset > int > tactic 

104 
val clarify_tac : claset > int > tactic 

105 
val clarify_step_tac : claset > int > tactic 

106 
val step_tac : claset > int > tactic 

107 
val slow_step_tac : claset > int > tactic 

108 
val swapify : thm list > thm list 

109 
val swap_res_tac : thm list > int > tactic 

110 
val inst_step_tac : claset > int > tactic 

111 
val inst0_step_tac : claset > int > tactic 

112 
val instp_step_tac : claset > int > tactic 

1724  113 

9938  114 
val AddDs : thm list > unit 
115 
val AddEs : thm list > unit 

116 
val AddIs : thm list > unit 

117 
val AddSDs : thm list > unit 

118 
val AddSEs : thm list > unit 

119 
val AddSIs : thm list > unit 

120 
val Delrules : thm list > unit 

121 
val Safe_tac : tactic 

122 
val Safe_step_tac : int > tactic 

123 
val Clarify_tac : int > tactic 

124 
val Clarify_step_tac : int > tactic 

125 
val Step_tac : int > tactic 

126 
val Fast_tac : int > tactic 

127 
val Best_tac : int > tactic 

128 
val Slow_tac : int > tactic 

2066  129 
val Slow_best_tac : int > tactic 
9938  130 
val Deepen_tac : int > int > tactic 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

131 
end; 
1724  132 

5841  133 
signature CLASSICAL = 
134 
sig 

135 
include BASIC_CLASSICAL 

18374  136 
val swap: thm (* ~P ==> (~Q ==> P) ==> Q *) 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

137 
val classical_rule: thm > thm 
15036  138 
val add_context_safe_wrapper: string * (Proof.context > wrapper) > theory > theory 
139 
val del_context_safe_wrapper: string > theory > theory 

140 
val add_context_unsafe_wrapper: string * (Proof.context > wrapper) > theory > theory 

141 
val del_context_unsafe_wrapper: string > theory > theory 

17880  142 
val get_claset: theory > claset 
5841  143 
val print_local_claset: Proof.context > unit 
144 
val get_local_claset: Proof.context > claset 

145 
val put_local_claset: claset > Proof.context > Proof.context 

18728  146 
val safe_dest: int option > attribute 
147 
val safe_elim: int option > attribute 

148 
val safe_intro: int option > attribute 

149 
val haz_dest: int option > attribute 

150 
val haz_elim: int option > attribute 

151 
val haz_intro: int option > attribute 

152 
val rule_del: attribute 

7272  153 
val cla_modifiers: (Args.T list > (Method.modifier * Args.T list)) list 
7559  154 
val cla_meth: (claset > tactic) > thm list > Proof.context > Proof.method 
155 
val cla_meth': (claset > int > tactic) > thm list > Proof.context > Proof.method 

15703  156 
val cla_method: (claset > tactic) > Method.src > Proof.context > Proof.method 
157 
val cla_method': (claset > int > tactic) > Method.src > Proof.context > Proof.method 

18708  158 
val setup: theory > theory 
5841  159 
end; 
160 

0  161 

5927  162 
functor ClassicalFun(Data: CLASSICAL_DATA): CLASSICAL = 
0  163 
struct 
164 

7354  165 
local open Data in 
0  166 

18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

167 
(** classical elimination rules **) 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

168 

6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

169 
(* 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

170 
Classical reasoning requires stronger elimination rules. For 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

171 
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

172 

6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

173 
[ 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

174 

6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

175 
Such rules can cause Fast_tac to fail and Blast_tac to report "PROOF 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

176 
FAILED"; classical_rule will strenthen this to 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

177 

6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

178 
[ 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

179 
*) 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

180 

6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

181 
fun classical_rule rule = 
19257  182 
if ObjectLogic.is_elim rule then 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

183 
let 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

184 
val rule' = rule RS classical; 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

185 
val concl' = Thm.concl_of rule'; 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

186 
fun redundant_hyp goal = 
19257  187 
concl' aconv Logic.strip_assums_concl goal orelse 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

188 
(case Logic.strip_assums_hyp goal of 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

189 
hyp :: hyps => exists (fn t => t aconv hyp) hyps 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

190 
 _ => false); 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

191 
val rule'' = 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

192 
rule' > ALLGOALS (SUBGOAL (fn (goal, i) => 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

193 
if i = 1 orelse redundant_hyp goal 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

194 
then Tactic.etac thin_rl i 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

195 
else all_tac)) 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

196 
> Seq.hd 
18571  197 
> Drule.zero_var_indexes 
18691  198 
> Thm.put_name_tags (Thm.get_name_tags rule); 
19877  199 
in if Drule.equiv_thm (rule, rule'') then rule else rule'' end 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

200 
else rule; 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

201 

6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

202 

6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

203 

1800  204 
(*** Useful tactics for classical reasoning ***) 
0  205 

1524  206 
val imp_elim = (*cannot use bind_thm within a structure!*) 
18586
588e80289658
store_thm: transfer to current context, i.e. the target theory;
wenzelm
parents:
18571
diff
changeset

207 
store_thm ("imp_elim", Thm.transfer (the_context ()) (classical_rule (Tactic.make_elim mp))); 
0  208 

10736  209 
(*Prove goal that assumes both P and ~P. 
4392  210 
No backtracking if it finds an equal assumption. Perhaps should call 
211 
ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*) 

10736  212 
val contr_tac = eresolve_tac [not_elim] THEN' 
4392  213 
(eq_assume_tac ORELSE' assume_tac); 
0  214 

681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

215 
(*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

216 
Could do the same thing for P<>Q and P... *) 
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

217 
fun mp_tac i = eresolve_tac [not_elim, imp_elim] i THEN assume_tac i; 
0  218 

219 
(*Like mp_tac but instantiates no variables*) 

681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

220 
fun eq_mp_tac i = ematch_tac [not_elim, imp_elim] i THEN eq_assume_tac i; 
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

221 

1524  222 
val swap = 
18586
588e80289658
store_thm: transfer to current context, i.e. the target theory;
wenzelm
parents:
18571
diff
changeset

223 
store_thm ("swap", Thm.transfer (the_context ()) 
588e80289658
store_thm: transfer to current context, i.e. the target theory;
wenzelm
parents:
18571
diff
changeset

224 
(rule_by_tactic (etac thin_rl 1) (not_elim RS classical))); 
0  225 

226 
(*Creates rules to eliminate ~A, from rules to introduce A*) 

227 
fun swapify intrs = intrs RLN (2, [swap]); 

12401  228 
fun swapped x = Attrib.no_args (fn (x, th) => (x, th RSN (2, swap))) x; 
0  229 

230 
(*Uses introduction rules in the normal way, or on negated assumptions, 

231 
trying rules in order. *) 

10736  232 
fun swap_res_tac rls = 
54  233 
let fun addrl (rl,brls) = (false, rl) :: (true, rl RSN (2,swap)) :: brls 
10736  234 
in assume_tac ORELSE' 
235 
contr_tac ORELSE' 

15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

236 
biresolve_tac (foldr addrl [] rls) 
0  237 
end; 
238 

681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

239 
(*Duplication of hazardous rules, for complete provers*) 
2689
6d3d893453de
dup_intr & dup_elim no longer call standard  this
paulson
parents:
2630
diff
changeset

240 
fun dup_intr th = zero_var_indexes (th RS classical); 
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

241 

6967  242 
fun dup_elim th = 
13525  243 
rule_by_tactic (TRYALL (etac revcut_rl)) 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

244 
((th RSN (2, revcut_rl)) > assumption 2 > Seq.hd); 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

245 

1800  246 
(**** Classical rule sets ****) 
0  247 

248 
datatype claset = 

12401  249 
CS of {safeIs : thm list, (*safe introduction rules*) 
250 
safeEs : thm list, (*safe elimination rules*) 

251 
hazIs : thm list, (*unsafe introduction rules*) 

252 
hazEs : thm list, (*unsafe elimination rules*) 

253 
swrappers : (string * wrapper) list, (*for transforming safe_step_tac*) 

9938  254 
uwrappers : (string * wrapper) list, (*for transforming step_tac*) 
12401  255 
safe0_netpair : netpair, (*nets for trivial cases*) 
256 
safep_netpair : netpair, (*nets for >0 subgoals*) 

257 
haz_netpair : netpair, (*nets for unsafe rules*) 

258 
dup_netpair : netpair, (*nets for duplication*) 

259 
xtra_netpair : ContextRules.netpair}; (*nets for extra rules*) 

0  260 

1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

261 
(*Desired invariants are 
9938  262 
safe0_netpair = build safe0_brls, 
263 
safep_netpair = build safep_brls, 

264 
haz_netpair = build (joinrules(hazIs, hazEs)), 

10736  265 
dup_netpair = build (joinrules(map dup_intr hazIs, 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

266 
map dup_elim hazEs)) 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

267 

10736  268 
where build = build_netpair(Net.empty,Net.empty), 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

269 
safe0_brls contains all brules that solve the subgoal, and 
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

270 
safep_brls contains all brules that generate 1 or more new subgoals. 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

271 
The theorem lists are largely comments, though they are used in merge_cs and print_cs. 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

272 
Nets must be built incrementally, to save space and time. 
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

273 
*) 
0  274 

6502  275 
val empty_netpair = (Net.empty, Net.empty); 
276 

10736  277 
val empty_cs = 
9938  278 
CS{safeIs = [], 
279 
safeEs = [], 

280 
hazIs = [], 

281 
hazEs = [], 

4651  282 
swrappers = [], 
283 
uwrappers = [], 

6502  284 
safe0_netpair = empty_netpair, 
285 
safep_netpair = empty_netpair, 

286 
haz_netpair = empty_netpair, 

6955  287 
dup_netpair = empty_netpair, 
288 
xtra_netpair = empty_netpair}; 

0  289 

15036  290 
fun print_cs (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...}) = 
3546  291 
let val pretty_thms = map Display.pretty_thm in 
9760  292 
[Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs), 
293 
Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs), 

294 
Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs), 

15036  295 
Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs), 
296 
Pretty.strs ("safe wrappers:" :: map #1 swrappers), 

297 
Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)] 

8727  298 
> Pretty.chunks > Pretty.writeln 
3546  299 
end; 
0  300 

4653  301 
fun rep_cs (CS args) = args; 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

302 

10736  303 
local 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

304 
fun wrap l tac = foldr (fn ((name,tacf),w) => tacf w) tac l; 
10736  305 
in 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

306 
fun appSWrappers (CS{swrappers,...}) = wrap swrappers; 
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

307 
fun appWrappers (CS{uwrappers,...}) = wrap uwrappers; 
4651  308 
end; 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

309 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

310 

1800  311 
(*** Adding (un)safe introduction or elimination rules. 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

312 

b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

313 
In case of overlap, new rules are tried BEFORE old ones!! 
1800  314 
***) 
0  315 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

316 
(*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

317 
assumptions. Pairs elim rules with true. *) 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

318 
fun joinrules (intrs, elims) = 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

319 
(map (pair true) (elims @ swapify intrs)) @ map (pair false) intrs; 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

320 

12401  321 
fun joinrules' (intrs, elims) = 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

322 
map (pair true) elims @ map (pair false) intrs; 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

323 

10736  324 
(*Priority: prefer rules with fewest subgoals, 
1231  325 
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

326 
fun tag_brls k [] = [] 
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

327 
 tag_brls k (brl::brls) = 
10736  328 
(1000000*subgoals_of_brl brl + k, brl) :: 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

329 
tag_brls (k+1) brls; 
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

330 

12401  331 
fun tag_brls' _ _ [] = [] 
332 
 tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls; 

10736  333 

15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

334 
fun insert_tagged_list kbrls netpr = foldr Tactic.insert_tagged_brl netpr kbrls; 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

335 

b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

336 
(*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

337 
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

338 
new insertions the lowest priority.*) 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

339 
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules; 
12401  340 
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

341 

15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

342 
fun delete_tagged_list brls netpr = foldr Tactic.delete_tagged_brl netpr brls; 
12362  343 
fun delete x = delete_tagged_list (joinrules x); 
12401  344 
fun delete' x = delete_tagged_list (joinrules' x); 
1800  345 

18691  346 
val mem_thm = member Drule.eq_thm_prop 
347 
and rem_thm = remove Drule.eq_thm_prop; 

2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

348 

1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

349 
(*Warn if the rule is already present ELSEWHERE in the claset. The addition 
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

350 
is still allowed.*) 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

351 
fun warn_dup th (CS{safeIs, safeEs, hazIs, hazEs, ...}) = 
18691  352 
if mem_thm safeIs th then 
9938  353 
warning ("Rule already declared as safe introduction (intro!)\n" ^ string_of_thm th) 
18691  354 
else if mem_thm safeEs th then 
9408  355 
warning ("Rule already declared as safe elimination (elim!)\n" ^ string_of_thm th) 
18691  356 
else if mem_thm hazIs th then 
9760  357 
warning ("Rule already declared as introduction (intro)\n" ^ string_of_thm th) 
18691  358 
else if mem_thm hazEs th then 
9760  359 
warning ("Rule already declared as elimination (elim)\n" ^ string_of_thm th) 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

360 
else (); 
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

361 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

362 

1800  363 
(*** Safe rules ***) 
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

364 

18691  365 
fun addSI w th 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

366 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

367 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18691  368 
if mem_thm safeIs th then 
9938  369 
(warning ("Ignoring duplicate safe introduction (intro!)\n" ^ string_of_thm th); 
370 
cs) 

1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

371 
else 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

372 
let val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) 
15570  373 
List.partition Thm.no_prems [th] 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

374 
val nI = length safeIs + 1 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

375 
and nE = length safeEs 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

376 
in warn_dup th cs; 
9938  377 
CS{safeIs = th::safeIs, 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

378 
safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair, 
9938  379 
safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair, 
380 
safeEs = safeEs, 

381 
hazIs = hazIs, 

382 
hazEs = hazEs, 

383 
swrappers = swrappers, 

384 
uwrappers = uwrappers, 

385 
haz_netpair = haz_netpair, 

386 
dup_netpair = dup_netpair, 

18691  387 
xtra_netpair = insert' (the_default 0 w) (nI,nE) ([th], []) xtra_netpair} 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

388 
end; 
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

389 

18691  390 
fun addSE w th 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

391 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

392 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18691  393 
if mem_thm safeEs th then 
9938  394 
(warning ("Ignoring duplicate safe elimination (elim!)\n" ^ string_of_thm th); 
395 
cs) 

18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

396 
else if has_fewer_prems 1 th then 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

397 
error("Illformed elimination rule\n" ^ string_of_thm th) 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

398 
else 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

399 
let 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

400 
val th' = classical_rule th 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

401 
val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

402 
List.partition (fn rl => nprems_of rl=1) [th'] 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

403 
val nI = length safeIs 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

404 
and nE = length safeEs + 1 
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

405 
in warn_dup th cs; 
9938  406 
CS{safeEs = th::safeEs, 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

407 
safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair, 
9938  408 
safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair, 
409 
safeIs = safeIs, 

410 
hazIs = hazIs, 

411 
hazEs = hazEs, 

412 
swrappers = swrappers, 

413 
uwrappers = uwrappers, 

414 
haz_netpair = haz_netpair, 

415 
dup_netpair = dup_netpair, 

18691  416 
xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair} 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

417 
end; 
0  418 

18691  419 
fun cs addSIs ths = fold_rev (addSI NONE) ths cs; 
420 
fun cs addSEs ths = fold_rev (addSE NONE) ths cs; 

1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

421 

17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset

422 
(*Give new theorem a name, if it has one already.*) 
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset

423 
fun name_make_elim th = 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

424 
if has_fewer_prems 1 th then 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

425 
error("Illformed destruction rule\n" ^ string_of_thm th) 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

426 
else 
17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset

427 
case Thm.name_of_thm th of 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

428 
"" => Tactic.make_elim th 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

429 
 a => Thm.name_thm (a ^ "_dest", Tactic.make_elim th); 
17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset

430 

fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset

431 
fun cs addSDs ths = cs addSEs (map name_make_elim ths); 
0  432 

1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

433 

1800  434 
(*** Hazardous (unsafe) rules ***) 
0  435 

18691  436 
fun addI w th 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

437 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

438 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18691  439 
if mem_thm hazIs th then 
9938  440 
(warning ("Ignoring duplicate introduction (intro)\n" ^ string_of_thm th); 
441 
cs) 

1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

442 
else 
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

443 
let val nI = length hazIs + 1 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

444 
and nE = length hazEs 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

445 
in warn_dup th cs; 
9938  446 
CS{hazIs = th::hazIs, 
447 
haz_netpair = insert (nI,nE) ([th], []) haz_netpair, 

448 
dup_netpair = insert (nI,nE) (map dup_intr [th], []) dup_netpair, 

10736  449 
safeIs = safeIs, 
9938  450 
safeEs = safeEs, 
451 
hazEs = hazEs, 

452 
swrappers = swrappers, 

453 
uwrappers = uwrappers, 

454 
safe0_netpair = safe0_netpair, 

455 
safep_netpair = safep_netpair, 

18691  456 
xtra_netpair = insert' (the_default 1 w) (nI,nE) ([th], []) xtra_netpair} 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

457 
end 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

458 
handle THM("RSN: no unifiers",_,_) => (*from dup_intr*) 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

459 
error ("Illformed introduction rule\n" ^ string_of_thm th); 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

460 

18691  461 
fun addE w th 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

462 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

463 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18691  464 
if mem_thm hazEs th then 
9938  465 
(warning ("Ignoring duplicate elimination (elim)\n" ^ string_of_thm th); 
466 
cs) 

18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

467 
else if has_fewer_prems 1 th then 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

468 
error("Illformed elimination rule\n" ^ string_of_thm th) 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

469 
else 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

470 
let 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

471 
val th' = classical_rule th 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

472 
val nI = length hazIs 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

473 
and nE = length hazEs + 1 
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

474 
in warn_dup th cs; 
9938  475 
CS{hazEs = th::hazEs, 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

476 
haz_netpair = insert (nI,nE) ([], [th']) haz_netpair, 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

477 
dup_netpair = insert (nI,nE) ([], map dup_elim [th']) dup_netpair, 
10736  478 
safeIs = safeIs, 
9938  479 
safeEs = safeEs, 
480 
hazIs = hazIs, 

481 
swrappers = swrappers, 

482 
uwrappers = uwrappers, 

483 
safe0_netpair = safe0_netpair, 

484 
safep_netpair = safep_netpair, 

18691  485 
xtra_netpair = insert' (the_default 1 w) (nI,nE) ([], [th]) xtra_netpair} 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

486 
end; 
0  487 

18691  488 
fun cs addIs ths = fold_rev (addI NONE) ths cs; 
489 
fun cs addEs ths = fold_rev (addE NONE) ths cs; 

1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

490 

17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset

491 
fun cs addDs ths = cs addEs (map name_make_elim ths); 
0  492 

1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

493 

10736  494 
(*** Deletion of rules 
1800  495 
Working out what to delete, requires repeating much of the code used 
9938  496 
to insert. 
1800  497 
***) 
498 

10736  499 
fun delSI th 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

500 
(cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
9938  501 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18691  502 
if mem_thm safeIs th then 
15570  503 
let val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th] 
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

504 
in CS{safe0_netpair = delete (safe0_rls, []) safe0_netpair, 
9938  505 
safep_netpair = delete (safep_rls, []) safep_netpair, 
18691  506 
safeIs = rem_thm th safeIs, 
9938  507 
safeEs = safeEs, 
508 
hazIs = hazIs, 

509 
hazEs = hazEs, 

510 
swrappers = swrappers, 

511 
uwrappers = uwrappers, 

512 
haz_netpair = haz_netpair, 

513 
dup_netpair = dup_netpair, 

12401  514 
xtra_netpair = delete' ([th], []) xtra_netpair} 
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

515 
end 
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

516 
else cs; 
1800  517 

2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

518 
fun delSE th 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

519 
(cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
9938  520 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18691  521 
if mem_thm safeEs th then 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

522 
let 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

523 
val th' = classical_rule th 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

524 
val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl=1) [th'] 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

525 
in CS{safe0_netpair = delete ([], safe0_rls) safe0_netpair, 
9938  526 
safep_netpair = delete ([], safep_rls) safep_netpair, 
527 
safeIs = safeIs, 

18691  528 
safeEs = rem_thm th safeEs, 
9938  529 
hazIs = hazIs, 
530 
hazEs = hazEs, 

531 
swrappers = swrappers, 

532 
uwrappers = uwrappers, 

533 
haz_netpair = haz_netpair, 

534 
dup_netpair = dup_netpair, 

12401  535 
xtra_netpair = delete' ([], [th]) xtra_netpair} 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

536 
end 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

537 
else cs; 
1800  538 

539 

2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

540 
fun delI th 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

541 
(cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
9938  542 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18691  543 
if mem_thm hazIs th then 
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

544 
CS{haz_netpair = delete ([th], []) haz_netpair, 
9938  545 
dup_netpair = delete ([dup_intr th], []) dup_netpair, 
10736  546 
safeIs = safeIs, 
9938  547 
safeEs = safeEs, 
18691  548 
hazIs = rem_thm th hazIs, 
9938  549 
hazEs = hazEs, 
550 
swrappers = swrappers, 

551 
uwrappers = uwrappers, 

552 
safe0_netpair = safe0_netpair, 

553 
safep_netpair = safep_netpair, 

12401  554 
xtra_netpair = delete' ([th], []) xtra_netpair} 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

555 
else cs 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

556 
handle THM("RSN: no unifiers",_,_) => (*from dup_intr*) 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

557 
error ("Illformed introduction rule\n" ^ string_of_thm th); 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset

558 

1800  559 

2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

560 
fun delE th 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

561 
(cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
9938  562 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

563 
let val th' = classical_rule th in 
18691  564 
if mem_thm hazEs th then 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

565 
CS{haz_netpair = delete ([], [th']) haz_netpair, 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

566 
dup_netpair = delete ([], [dup_elim th']) dup_netpair, 
10736  567 
safeIs = safeIs, 
9938  568 
safeEs = safeEs, 
569 
hazIs = hazIs, 

18691  570 
hazEs = rem_thm th hazEs, 
9938  571 
swrappers = swrappers, 
572 
uwrappers = uwrappers, 

573 
safe0_netpair = safe0_netpair, 

574 
safep_netpair = safep_netpair, 

12401  575 
xtra_netpair = delete' ([], [th]) xtra_netpair} 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

576 
else cs 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

577 
end; 
6955  578 

1800  579 

2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset

580 
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*) 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

581 
fun delrule th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) = 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

582 
let val th' = Tactic.make_elim th in 
18691  583 
if mem_thm safeIs th orelse mem_thm safeEs th orelse 
584 
mem_thm hazIs th orelse mem_thm hazEs th orelse 

585 
mem_thm safeEs th' orelse mem_thm hazEs th' 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

586 
then delSI th (delSE th (delI th (delE th (delSE th' (delE th' cs))))) 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

587 
else (warning ("Undeclared classical rule\n" ^ string_of_thm th); cs) 
9938  588 
end; 
1800  589 

18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

590 
fun cs delrules ths = fold delrule ths cs; 
1800  591 

592 

4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

593 
(*** Modifying the wrapper tacticals ***) 
10736  594 
fun update_swrappers 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

595 
(CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
6955  596 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) f = 
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

597 
CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, 
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

598 
swrappers = f swrappers, uwrappers = uwrappers, 
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

599 
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, 
6955  600 
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

601 

10736  602 
fun update_uwrappers 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

603 
(CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
6955  604 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) f = 
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

605 
CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, 
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

606 
swrappers = swrappers, uwrappers = f uwrappers, 
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

607 
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, 
6955  608 
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

609 

982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

610 

4651  611 
(*Add/replace a safe wrapper*) 
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

612 
fun cs addSWrapper new_swrapper = update_swrappers cs (fn swrappers => 
9721  613 
overwrite_warn (swrappers, new_swrapper) 
614 
("Overwriting safe wrapper " ^ fst new_swrapper)); 

4651  615 

616 
(*Add/replace an unsafe wrapper*) 

4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

617 
fun cs addWrapper new_uwrapper = update_uwrappers cs (fn uwrappers => 
9721  618 
overwrite_warn (uwrappers, new_uwrapper) 
9938  619 
("Overwriting unsafe wrapper "^fst new_uwrapper)); 
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

620 

4651  621 
(*Remove a safe wrapper*) 
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

622 
fun cs delSWrapper name = update_swrappers cs (fn swrappers => 
17795  623 
let val swrappers' = filter_out (equal name o fst) swrappers in 
15036  624 
if length swrappers <> length swrappers' then swrappers' 
625 
else (warning ("No such safe wrapper in claset: "^ name); swrappers) 

626 
end); 

982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

627 

4651  628 
(*Remove an unsafe wrapper*) 
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

629 
fun cs delWrapper name = update_uwrappers cs (fn uwrappers => 
17795  630 
let val uwrappers' = filter_out (equal name o fst) uwrappers in 
15036  631 
if length uwrappers <> length uwrappers' then uwrappers' 
632 
else (warning ("No such unsafe wrapper in claset: " ^ name); uwrappers) 

633 
end); 

982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

634 

11168  635 
(* compose a safe tactic alternatively before/after safe_step_tac *) 
10736  636 
fun cs addSbefore (name, tac1) = 
5523  637 
cs addSWrapper (name, fn tac2 => tac1 ORELSE' tac2); 
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

638 
fun cs addSafter (name, tac2) = 
5523  639 
cs addSWrapper (name, fn tac1 => tac1 ORELSE' tac2); 
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

640 

11168  641 
(*compose a tactic alternatively before/after the step tactic *) 
10736  642 
fun cs addbefore (name, tac1) = 
5523  643 
cs addWrapper (name, fn tac2 => tac1 APPEND' tac2); 
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

644 
fun cs addafter (name, tac2) = 
5523  645 
cs addWrapper (name, fn tac1 => tac1 APPEND' tac2); 
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

646 

10736  647 
fun cs addD2 (name, thm) = 
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

648 
cs addafter (name, datac thm 1); 
10736  649 
fun cs addE2 (name, thm) = 
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

650 
cs addafter (name, eatac thm 1); 
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

651 
fun cs addSD2 (name, thm) = 
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

652 
cs addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac); 
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

653 
fun cs addSE2 (name, thm) = 
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset

654 
cs addSafter (name, ematch_tac [thm] THEN' eq_assume_tac); 
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

655 

1711  656 
(*Merge works by adding all new rules of the 2nd claset into the 1st claset. 
657 
Merging the term nets may look more efficient, but the rather delicate 

658 
treatment of priority might get muddled up.*) 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

659 
fun merge_cs (cs as CS{safeIs, safeEs, hazIs, hazEs, ...}, 
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

660 
CS{safeIs=safeIs2, safeEs=safeEs2, hazIs=hazIs2, hazEs=hazEs2, swrappers, uwrappers, ...}) = 
18989  661 
let val safeIs' = fold rem_thm safeIs safeIs2 
662 
val safeEs' = fold rem_thm safeEs safeEs2 

663 
val hazIs' = fold rem_thm hazIs hazIs2 

664 
val hazEs' = fold rem_thm hazEs hazEs2 

4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

665 
val cs1 = cs addSIs safeIs' 
9938  666 
addSEs safeEs' 
667 
addIs hazIs' 

668 
addEs hazEs' 

4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

669 
val cs2 = update_swrappers cs1 (fn ws => merge_alists ws swrappers); 
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset

670 
val cs3 = update_uwrappers cs2 (fn ws => merge_alists ws uwrappers); 
10736  671 
in cs3 
1711  672 
end; 
673 

982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

674 

1800  675 
(**** Simple tactics for theorem proving ****) 
0  676 

677 
(*Attack subgoals using safe inferences  matching, not resolution*) 

10736  678 
fun safe_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) = 
4651  679 
appSWrappers cs (FIRST' [ 
9938  680 
eq_assume_tac, 
681 
eq_mp_tac, 

682 
bimatch_from_nets_tac safe0_netpair, 

683 
FIRST' hyp_subst_tacs, 

684 
bimatch_from_nets_tac safep_netpair]); 

0  685 

5757  686 
(*Repeatedly attack a subgoal using safe inferences  it's deterministic!*) 
10736  687 
fun safe_steps_tac cs = REPEAT_DETERM1 o 
9938  688 
(fn i => COND (has_fewer_prems i) no_tac (safe_step_tac cs i)); 
5757  689 

0  690 
(*Repeatedly attack subgoals using safe inferences  it's deterministic!*) 
5757  691 
fun safe_tac cs = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac cs)); 
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

692 

3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

693 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

694 
(*** 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

695 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

696 
fun nsubgoalsP n (k,brl) = (subgoals_of_brl brl = n); 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

697 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

698 
(*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

699 
create precisely n subgoals.*) 
10736  700 
fun n_bimatch_from_nets_tac n = 
15570  701 
biresolution_from_nets_tac (Tactic.orderlist o List.filter (nsubgoalsP n)) true; 
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

702 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

703 
fun eq_contr_tac i = ematch_tac [not_elim] i THEN eq_assume_tac i; 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

704 
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac; 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

705 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

706 
(*Twoway branching is allowed only if one of the branches immediately closes*) 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

707 
fun bimatch2_tac netpair i = 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

708 
n_bimatch_from_nets_tac 2 netpair i THEN 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

709 
(eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i+1)); 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

710 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

711 
(*Attack subgoals using safe inferences  matching, not resolution*) 
10736  712 
fun clarify_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) = 
4651  713 
appSWrappers cs (FIRST' [ 
9938  714 
eq_assume_contr_tac, 
715 
bimatch_from_nets_tac safe0_netpair, 

716 
FIRST' hyp_subst_tacs, 

717 
n_bimatch_from_nets_tac 1 safep_netpair, 

3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

718 
bimatch2_tac safep_netpair]); 
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 
fun clarify_tac cs = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac cs 1)); 
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

721 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

722 

76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset

723 
(*** 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

724 

4066  725 
(*Backtracking is allowed among the various these unsafe ways of 
726 
proving a subgoal. *) 

747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

727 
fun inst0_step_tac (CS{safe0_netpair,safep_netpair,...}) = 
10736  728 
assume_tac APPEND' 
729 
contr_tac APPEND' 

747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

730 
biresolve_from_nets_tac safe0_netpair; 
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

731 

4066  732 
(*These unsafe steps could generate more subgoals.*) 
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

733 
fun instp_step_tac (CS{safep_netpair,...}) = 
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

734 
biresolve_from_nets_tac safep_netpair; 
0  735 

736 
(*These steps could instantiate variables and are therefore unsafe.*) 

747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

737 
fun inst_step_tac cs = inst0_step_tac cs APPEND' instp_step_tac cs; 
0  738 

10736  739 
fun haz_step_tac (CS{haz_netpair,...}) = 
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

740 
biresolve_from_nets_tac haz_netpair; 
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

741 

0  742 
(*Single step for the prover. FAILS unless it makes progress. *) 
10736  743 
fun step_tac cs i = safe_tac cs ORELSE appWrappers cs 
9938  744 
(inst_step_tac cs ORELSE' haz_step_tac cs) i; 
0  745 

746 
(*Using a "safe" rule to instantiate variables is unsafe. This tactic 

747 
allows backtracking from "safe" rules to "unsafe" rules here.*) 

10736  748 
fun slow_step_tac cs i = safe_tac cs ORELSE appWrappers cs 
9938  749 
(inst_step_tac cs APPEND' haz_step_tac cs) i; 
0  750 

1800  751 
(**** The following tactics all fail unless they solve one goal ****) 
0  752 

753 
(*Dumb but fast*) 

10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

754 
fun fast_tac cs = 
11754  755 
ObjectLogic.atomize_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac cs 1)); 
0  756 

757 
(*Slower but smarter than fast_tac*) 

10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

758 
fun best_tac cs = 
11754  759 
ObjectLogic.atomize_tac THEN' 
0  760 
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (step_tac cs 1)); 
761 

9402  762 
(*even a bit smarter than best_tac*) 
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

763 
fun first_best_tac cs = 
11754  764 
ObjectLogic.atomize_tac THEN' 
9402  765 
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (FIRSTGOAL (step_tac cs))); 
766 

10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

767 
fun slow_tac cs = 
11754  768 
ObjectLogic.atomize_tac THEN' 
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

769 
SELECT_GOAL (DEPTH_SOLVE (slow_step_tac cs 1)); 
0  770 

10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

771 
fun slow_best_tac cs = 
11754  772 
ObjectLogic.atomize_tac THEN' 
0  773 
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (slow_step_tac cs 1)); 
774 

681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

775 

10736  776 
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*) 
777 
val weight_ASTAR = ref 5; 

1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset

778 

10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

779 
fun astar_tac cs = 
11754  780 
ObjectLogic.atomize_tac THEN' 
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

781 
SELECT_GOAL 
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

782 
(ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev) 
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

783 
(step_tac cs 1)); 
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset

784 

10736  785 
fun slow_astar_tac cs = 
11754  786 
ObjectLogic.atomize_tac THEN' 
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

787 
SELECT_GOAL 
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

788 
(ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev) 
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

789 
(slow_step_tac cs 1)); 
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset

790 

1800  791 
(**** 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

792 
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

793 
easy theorems faster, but loses completeness  and many of the harder 
1800  794 
theorems such as 43. ****) 
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

795 

747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

796 
(*Nondeterministic! Could always expand the first unsafe connective. 
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

797 
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

798 
greater search depth required.*) 
10736  799 
fun dup_step_tac (cs as (CS{dup_netpair,...})) = 
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

800 
biresolve_from_nets_tac dup_netpair; 
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

801 

5523  802 
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*) 
5757  803 
local 
10736  804 
fun slow_step_tac' cs = appWrappers cs 
9938  805 
(instp_step_tac cs APPEND' dup_step_tac cs); 
10736  806 
in fun depth_tac cs m i state = SELECT_GOAL 
807 
(safe_steps_tac cs 1 THEN_ELSE 

9938  808 
(DEPTH_SOLVE (depth_tac cs m 1), 
809 
inst0_step_tac cs 1 APPEND COND (K (m=0)) no_tac 

810 
(slow_step_tac' cs 1 THEN DEPTH_SOLVE (depth_tac cs (m1) 1)) 

5757  811 
)) i state; 
812 
end; 

747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

813 

10736  814 
(*Search, with depth bound m. 
2173  815 
This is the "entry point", which does safe inferences first.*) 
10736  816 
fun safe_depth_tac cs m = 
817 
SUBGOAL 

681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

818 
(fn (prem,i) => 
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

819 
let val deti = 
9938  820 
(*No Vars in the goal? No need to backtrack between goals.*) 
821 
case term_vars prem of 

10736  822 
[] => DETERM 
9938  823 
 _::_ => I 
10736  824 
in SELECT_GOAL (TRY (safe_tac cs) THEN 
9938  825 
DEPTH_SOLVE (deti (depth_tac cs m 1))) i 
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

826 
end); 
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

827 

2868
17a23a62f82a
New DEEPEN allows giving an upper bound for deepen_tac
paulson
parents:
2813
diff
changeset

828 
fun deepen_tac cs = DEEPEN (2,10) (safe_depth_tac cs); 
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

829 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

830 

1724  831 

15036  832 
(** context dependent claset components **) 
833 

834 
datatype context_cs = ContextCS of 

835 
{swrappers: (string * (Proof.context > wrapper)) list, 

836 
uwrappers: (string * (Proof.context > wrapper)) list}; 

837 

838 
fun context_cs ctxt cs (ContextCS {swrappers, uwrappers}) = 

839 
let 

840 
fun add_wrapper add (name, f) claset = add (claset, (name, f ctxt)); 

841 
in 

842 
cs > fold_rev (add_wrapper (op addSWrapper)) swrappers 

843 
> fold_rev (add_wrapper (op addWrapper)) uwrappers 

844 
end; 

845 

846 
fun make_context_cs (swrappers, uwrappers) = 

847 
ContextCS {swrappers = swrappers, uwrappers = uwrappers}; 

848 

849 
val empty_context_cs = make_context_cs ([], []); 

850 

851 
fun merge_context_cs (ctxt_cs1, ctxt_cs2) = 

852 
let 

853 
val ContextCS {swrappers = swrappers1, uwrappers = uwrappers1} = ctxt_cs1; 

854 
val ContextCS {swrappers = swrappers2, uwrappers = uwrappers2} = ctxt_cs2; 

855 

856 
val swrappers' = merge_alists swrappers1 swrappers2; 

857 
val uwrappers' = merge_alists uwrappers1 uwrappers2; 

858 
in make_context_cs (swrappers', uwrappers') end; 

859 

860 

861 

17880  862 
(** claset data **) 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

863 

18691  864 
(* global claset *) 
1724  865 

16424  866 
structure GlobalClaset = TheoryDataFun 
867 
(struct 

7354  868 
val name = "Provers/claset"; 
15036  869 
type T = claset ref * context_cs; 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

870 

15036  871 
val empty = (ref empty_cs, empty_context_cs); 
16424  872 
fun copy (ref cs, ctxt_cs) = (ref cs, ctxt_cs): T; 
873 
val extend = copy; 

874 
fun merge _ ((ref cs1, ctxt_cs1), (ref cs2, ctxt_cs2)) = 

15036  875 
(ref (merge_cs (cs1, cs2)), merge_context_cs (ctxt_cs1, ctxt_cs2)); 
876 
fun print _ (ref cs, _) = print_cs cs; 

16424  877 
end); 
1724  878 

7354  879 
val print_claset = GlobalClaset.print; 
17880  880 
val get_claset = ! o #1 o GlobalClaset.get; 
881 

15036  882 
val get_context_cs = #2 o GlobalClaset.get o ProofContext.theory_of; 
883 
fun map_context_cs f = GlobalClaset.map (apsnd 

884 
(fn ContextCS {swrappers, uwrappers} => make_context_cs (f (swrappers, uwrappers)))); 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

885 

17880  886 
val change_claset_of = change o #1 o GlobalClaset.get; 
887 
fun change_claset f = change_claset_of (Context.the_context ()) f; 

1800  888 

18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

889 
fun claset_of thy = 
17880  890 
let val (cs_ref, ctxt_cs) = GlobalClaset.get thy 
891 
in context_cs (Context.init_proof thy) (! cs_ref) (ctxt_cs) end; 

5028  892 
val claset = claset_of o Context.the_context; 
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

893 

17880  894 
fun CLASET tacf st = tacf (claset_of (Thm.theory_of_thm st)) st; 
895 
fun CLASET' tacf i st = tacf (claset_of (Thm.theory_of_thm st)) i st; 

1724  896 

17880  897 
fun AddDs args = change_claset (fn cs => cs addDs args); 
898 
fun AddEs args = change_claset (fn cs => cs addEs args); 

899 
fun AddIs args = change_claset (fn cs => cs addIs args); 

900 
fun AddSDs args = change_claset (fn cs => cs addSDs args); 

901 
fun AddSEs args = change_claset (fn cs => cs addSEs args); 

902 
fun AddSIs args = change_claset (fn cs => cs addSIs args); 

903 
fun Delrules args = change_claset (fn cs => cs delrules args); 

3727
ed63c05d7992
Added Safe_tac; all other default claset tactics now dereference "claset"
paulson
parents:
3705
diff
changeset

904 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

905 

15036  906 
(* context dependent components *) 
907 

908 
fun add_context_safe_wrapper wrapper = map_context_cs (apfst (merge_alists [wrapper])); 

909 
fun del_context_safe_wrapper name = map_context_cs (apfst (filter_out (equal name o #1))); 

910 

911 
fun add_context_unsafe_wrapper wrapper = map_context_cs (apsnd (merge_alists [wrapper])); 

912 
fun del_context_unsafe_wrapper name = map_context_cs (apsnd (filter_out (equal name o #1))); 

913 

914 

18691  915 
(* local claset *) 
5841  916 

16424  917 
structure LocalClaset = ProofDataFun 
918 
(struct 

5841  919 
val name = "Provers/claset"; 
920 
type T = claset; 

17880  921 
val init = get_claset; 
15036  922 
fun print ctxt cs = print_cs (context_cs ctxt cs (get_context_cs ctxt)); 
16424  923 
end); 
5841  924 

925 
val print_local_claset = LocalClaset.print; 

926 
val get_local_claset = LocalClaset.get; 

927 
val put_local_claset = LocalClaset.put; 

928 

15036  929 
fun local_claset_of ctxt = 
930 
context_cs ctxt (get_local_claset ctxt) (get_context_cs ctxt); 

931 

5841  932 

5885  933 
(* attributes *) 
934 

18728  935 
fun attrib f = Thm.declaration_attribute (fn th => 
18691  936 
fn Context.Theory thy => (change_claset_of thy (f th); Context.Theory thy) 
937 
 Context.Proof ctxt => Context.Proof (LocalClaset.map (f th) ctxt)); 

5885  938 

18691  939 
fun safe_dest w = attrib (addSE w o name_make_elim); 
940 
val safe_elim = attrib o addSE; 

941 
val safe_intro = attrib o addSI; 

942 
fun haz_dest w = attrib (addE w o name_make_elim); 

943 
val haz_elim = attrib o addE; 

944 
val haz_intro = attrib o addI; 

945 
val rule_del = attrib delrule o ContextRules.rule_del; 

5885  946 

947 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

948 
(* tactics referring to the implicit claset *) 
1800  949 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

950 
(*the abstraction over the proof state delays the dereferencing*) 
9938  951 
fun Safe_tac st = safe_tac (claset()) st; 
952 
fun Safe_step_tac i st = safe_step_tac (claset()) i st; 

4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset

953 
fun Clarify_step_tac i st = clarify_step_tac (claset()) i st; 
9938  954 
fun Clarify_tac i st = clarify_tac (claset()) i st; 
955 
fun Step_tac i st = step_tac (claset()) i st; 

956 
fun Fast_tac i st = fast_tac (claset()) i st; 

957 
fun Best_tac i st = best_tac (claset()) i st; 

958 
fun Slow_tac i st = slow_tac (claset()) i st; 

959 
fun Slow_best_tac i st = slow_best_tac (claset()) i st; 

960 
fun Deepen_tac m = deepen_tac (claset()) m; 

2066  961 

1800  962 

10736  963 
end; 
5841  964 

965 

966 

5885  967 
(** concrete syntax of attributes **) 
5841  968 

969 
val introN = "intro"; 

970 
val elimN = "elim"; 

971 
val destN = "dest"; 

9938  972 
val ruleN = "rule"; 
5841  973 

974 
val setup_attrs = Attrib.add_attributes 

18728  975 
[("swapped", swapped, "classical swap of introduction rule"), 
976 
(destN, ContextRules.add_args safe_dest haz_dest ContextRules.dest_query, 

18688  977 
"declaration of Classical destruction rule"), 
18728  978 
(elimN, ContextRules.add_args safe_elim haz_elim ContextRules.elim_query, 
18688  979 
"declaration of Classical elimination rule"), 
18728  980 
(introN, ContextRules.add_args safe_intro haz_intro ContextRules.intro_query, 
18688  981 
"declaration of Classical introduction rule"), 
18728  982 
(ruleN, Attrib.syntax (Scan.lift Args.del >> K rule_del), 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

983 
"remove declaration of intro/elim/dest rule")]; 
5841  984 

985 

986 

7230  987 
(** proof methods **) 
988 

14605
9de4d64eee3b
'instance' and intro_classes now handle general sorts;
wenzelm
parents:
13525
diff
changeset

989 
fun METHOD_CLASET tac ctxt = 
15036  990 
Method.METHOD (tac ctxt (local_claset_of ctxt)); 
5841  991 

8098  992 
fun METHOD_CLASET' tac ctxt = 
15036  993 
Method.METHOD (HEADGOAL o tac ctxt (local_claset_of ctxt)); 
7230  994 

995 

996 
local 

997 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

998 
fun some_rule_tac ctxt (CS {xtra_netpair, ...}) facts = SUBGOAL (fn (goal, i) => 
5841  999 
let 
12401  1000 
val [rules1, rules2, rules4] = ContextRules.find_rules false facts goal ctxt; 
1001 
val rules3 = ContextRules.find_rules_netpair true facts goal xtra_netpair; 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

1002 
val rules = rules1 @ rules2 @ rules3 @ rules4; 
18223  1003 
val ruleq = Drule.multi_resolves facts rules; 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

1004 
in 
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

1005 
Method.trace ctxt rules; 
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

1006 
fn st => Seq.flat (Seq.map (fn rule => Tactic.rtac rule i st) ruleq) 
18834  1007 
end) 
1008 
THEN_ALL_NEW Tactic.norm_hhf_tac; 

5841  1009 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

1010 
fun rule_tac [] ctxt cs facts = some_rule_tac ctxt cs facts 
10394  1011 
 rule_tac rules _ _ facts = Method.rule_tac rules facts; 
7281  1012 

10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

1013 
fun default_tac rules ctxt cs facts = 
14605
9de4d64eee3b
'instance' and intro_classes now handle general sorts;
wenzelm
parents:
13525
diff
changeset

1014 
HEADGOAL (rule_tac rules ctxt cs facts) ORELSE 
19110
4bda27adcd2e
moved intro_classes from AxClass to ClassPackage
haftmann
parents:
18989
diff
changeset

1015 
ClassPackage.default_intro_classes_tac facts; 
10309  1016 

7230  1017 
in 
7281  1018 
val rule = METHOD_CLASET' o rule_tac; 
14605
9de4d64eee3b
'instance' and intro_classes now handle general sorts;
wenzelm
parents:
13525
diff
changeset

1019 
val default = METHOD_CLASET o default_tac; 
7230  1020 
end; 
5841  1021 

1022 

7230  1023 
(* contradiction method *) 
6502  1024 

7425  1025 
val contradiction = Method.rule [Data.not_elim, Data.not_elim COMP Drule.swap_prems_rl]; 
6502  1026 

1027 

1028 
(* automatic methods *) 

5841  1029 

5927  1030 
val cla_modifiers = 
18728  1031 
[Args.$$$ destN  Args.bang_colon >> K ((I, safe_dest NONE): Method.modifier), 
1032 
Args.$$$ destN  Args.colon >> K (I, haz_dest NONE), 

1033 
Args.$$$ elimN  Args.bang_colon >> K (I, safe_elim NONE), 

1034 
Args.$$$ elimN  Args.colon >> K (I, haz_elim NONE), 

1035 
Args.$$$ introN  Args.bang_colon >> K (I, safe_intro NONE), 

1036 
Args.$$$ introN  Args.colon >> K (I, haz_intro NONE), 

1037 
Args.del  Args.colon >> K (I, rule_del)]; 

5927  1038 

7559  1039 
fun cla_meth tac prems ctxt = Method.METHOD (fn facts => 
15036  1040 
ALLGOALS (Method.insert_tac (prems @ facts)) THEN tac (local_claset_of ctxt)); 
7132  1041 

7559  1042 
fun cla_meth' tac prems ctxt = Method.METHOD (fn facts => 
15036  1043 
HEADGOAL (Method.insert_tac (prems @ facts) THEN' tac (local_claset_of ctxt))); 
5841  1044 

7559  1045 
val cla_method = Method.bang_sectioned_args cla_modifiers o cla_meth; 
1046 
val cla_method' = Method.bang_sectioned_args cla_modifiers o cla_meth'; 

5841  1047 

1048 

1049 

1050 
(** setup_methods **) 

1051 

1052 
val setup_methods = Method.add_methods 

12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

1053 
[("default", Method.thms_ctxt_args default, "apply some intro/elim rule (potentially classical)"), 
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

1054 
("rule", Method.thms_ctxt_args rule, "apply some intro/elim rule (potentially classical)"), 
6502  1055 
("contradiction", Method.no_args contradiction, "proof by contradiction"), 
10821  1056 
("clarify", cla_method' (CHANGED_PROP oo clarify_tac), "repeatedly apply safe steps"), 
7004  1057 
("fast", cla_method' fast_tac, "classical prover (depthfirst)"), 
9806  1058 
("slow", cla_method' slow_tac, "classical prover (slow depthfirst)"), 
9773  1059 
("best", cla_method' best_tac, "classical prover (bestfirst)"), 
18015  1060 
("deepen", cla_method' (fn cs => deepen_tac cs 4), "classical prover (iterative deepening)"), 
10821  1061 
("safe", cla_method (CHANGED_PROP o safe_tac), "classical prover (apply safe rules)")]; 
5841  1062 

1063 

1064 

1065 
(** theory setup **) 

1066 

18708  1067 
val setup = GlobalClaset.init #> LocalClaset.init #> setup_attrs #> setup_methods; 
5841  1068 

1069 

8667  1070 

1071 
(** outer syntax **) 

1072 

1073 
val print_clasetP = 

1074 
OuterSyntax.improper_command "print_claset" "print context of Classical Reasoner" 

17057  1075 
OuterKeyword.diag 
9513  1076 
(Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o (Toplevel.keep 
9010  1077 
(Toplevel.node_case print_claset (print_local_claset o Proof.context_of))))); 
8667  1078 

1079 
val _ = OuterSyntax.add_parsers [print_clasetP]; 

1080 

1081 

5841  1082 
end; 