author  wenzelm 
Thu, 06 Mar 2014 19:55:08 +0100  
changeset 55960  beef468837b1 
parent 54742  7a86358a3c0b 
child 56334  6b3739fee456 
permissions  rwrr 
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 

42790  74 
val contr_tac: int > tactic 
75 
val dup_elim: thm > thm 

76 
val dup_intr: thm > thm 

42793  77 
val dup_step_tac: Proof.context > int > tactic 
42790  78 
val eq_mp_tac: int > tactic 
42793  79 
val haz_step_tac: Proof.context > int > tactic 
42790  80 
val joinrules: thm list * thm list > (bool * thm) list 
81 
val mp_tac: 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 
90 
val swap_res_tac: 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 

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

99 
val classical_rule: 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 

18708  127 
val setup: theory > theory 
5841  128 
end; 
129 

0  130 

42799  131 
functor Classical(Data: CLASSICAL_DATA): CLASSICAL = 
0  132 
struct 
133 

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

134 
(** classical elimination rules **) 
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 
(* 
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

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

138 
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

139 

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

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

141 

26938  142 
Such rules can cause fast_tac to fail and blast_tac to report "PROOF 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

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

144 

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

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

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

147 

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

148 
fun classical_rule rule = 
41581
72a02e3dec7e
clarified pretty_statement: more robust treatment of fixes and conclusion of elimination (e.g. for classical rule);
wenzelm
parents:
36960
diff
changeset

149 
if is_some (Object_Logic.elim_concl rule) then 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

150 
let 
42792  151 
val rule' = rule RS Data.classical; 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

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

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

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

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

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

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

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

160 
if i = 1 orelse redundant_hyp goal 
52732  161 
then etac thin_rl i 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

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

163 
> Seq.hd 
21963  164 
> Drule.zero_var_indexes; 
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22095
diff
changeset

165 
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

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

167 

23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset

168 
(*flatten nested meta connectives in prems*) 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

169 
fun flat_rule opt_context th = 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

170 
let 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

171 
val ctxt = 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

172 
(case opt_context of 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

173 
NONE => Proof_Context.init_global (Thm.theory_of_thm th) 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

174 
 SOME context => Context.proof_of context); 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

175 
in Conv.fconv_rule (Conv.prems_conv ~1 (Object_Logic.atomize_prems ctxt)) th end; 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

176 

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

177 

1800  178 
(*** Useful tactics for classical reasoning ***) 
0  179 

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

42792  183 
val contr_tac = 
184 
eresolve_tac [Data.not_elim] THEN' (eq_assume_tac ORELSE' assume_tac); 

0  185 

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

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

187 
Could do the same thing for P<>Q and P... *) 
42792  188 
fun mp_tac i = eresolve_tac [Data.not_elim, Data.imp_elim] i THEN assume_tac i; 
0  189 

190 
(*Like mp_tac but instantiates no variables*) 

42792  191 
fun eq_mp_tac i = ematch_tac [Data.not_elim, Data.imp_elim] i THEN eq_assume_tac i; 
0  192 

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

194 
fun swapify intrs = intrs RLN (2, [Data.swap]); 
30528  195 
val swapped = Thm.rule_attribute (fn _ => fn th => th RSN (2, Data.swap)); 
0  196 

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

198 
trying rules in order. *) 

10736  199 
fun swap_res_tac rls = 
42792  200 
let fun addrl rl brls = (false, rl) :: (true, rl RSN (2, Data.swap)) :: brls in 
201 
assume_tac ORELSE' 

202 
contr_tac ORELSE' 

203 
biresolve_tac (fold_rev addrl rls []) 

204 
end; 

0  205 

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

206 
(*Duplication of hazardous rules, for complete provers*) 
42792  207 
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

208 

42793  209 
fun dup_elim th = (* FIXME proper context!? *) 
36546  210 
let 
211 
val rl = (th RSN (2, revcut_rl)) > Thm.assumption 2 > Seq.hd; 

42361  212 
val ctxt = Proof_Context.init_global (Thm.theory_of_thm rl); 
36546  213 
in rule_by_tactic ctxt (TRYALL (etac revcut_rl)) rl end; 
214 

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

215 

1800  216 
(**** Classical rule sets ****) 
0  217 

42812  218 
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net; 
219 
type wrapper = (int > tactic) > int > tactic; 

220 

0  221 
datatype claset = 
42793  222 
CS of 
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

223 
{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

224 
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

225 
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

226 
hazEs : thm Item_Net.T, (*unsafe elimination rules*) 
42793  227 
swrappers : (string * (Proof.context > wrapper)) list, (*for transforming safe_step_tac*) 
228 
uwrappers : (string * (Proof.context > wrapper)) list, (*for transforming step_tac*) 

229 
safe0_netpair : netpair, (*nets for trivial cases*) 

230 
safep_netpair : netpair, (*nets for >0 subgoals*) 

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

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

233 
xtra_netpair : Context_Rules.netpair}; (*nets for extra rules*) 

0  234 

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

235 
(*Desired invariants are 
9938  236 
safe0_netpair = build safe0_brls, 
237 
safep_netpair = build safep_brls, 

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

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

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

241 

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

243 
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

244 
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

245 
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

246 
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

247 
*) 
0  248 

6502  249 
val empty_netpair = (Net.empty, Net.empty); 
250 

10736  251 
val empty_cs = 
42793  252 
CS 
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

253 
{safeIs = Thm.full_rules, 
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

254 
safeEs = Thm.full_rules, 
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

255 
hazIs = Thm.full_rules, 
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

256 
hazEs = Thm.full_rules, 
42793  257 
swrappers = [], 
258 
uwrappers = [], 

259 
safe0_netpair = empty_netpair, 

260 
safep_netpair = empty_netpair, 

261 
haz_netpair = empty_netpair, 

262 
dup_netpair = empty_netpair, 

263 
xtra_netpair = empty_netpair}; 

0  264 

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

266 

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

267 

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

269 

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

270 
In case of overlap, new rules are tried BEFORE old ones!! 
1800  271 
***) 
0  272 

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

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

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

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

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

277 

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

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

280 

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

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

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

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

287 

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

10736  290 

23178  291 
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

292 

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

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

294 
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

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

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

298 

23178  299 
fun delete_tagged_list rls = fold_rev Tactic.delete_tagged_brl rls; 
12362  300 
fun delete x = delete_tagged_list (joinrules x); 
12401  301 
fun delete' x = delete_tagged_list (joinrules' x); 
1800  302 

42793  303 
fun string_of_thm NONE = Display.string_of_thm_without_context 
42817  304 
 string_of_thm (SOME context) = Display.string_of_thm (Context.proof_of context); 
42793  305 

306 
fun make_elim context th = 

307 
if has_fewer_prems 1 th then 

308 
error ("Illformed destruction rule\n" ^ string_of_thm context th) 

309 
else Tactic.make_elim th; 

42790  310 

52699  311 
fun warn_thm (SOME (Context.Proof ctxt)) msg th = 
312 
if Context_Position.is_visible ctxt 

313 
then warning (msg ^ Display.string_of_thm ctxt th) else () 

314 
 warn_thm _ _ _ = (); 

42793  315 

42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

316 
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

317 
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

318 

e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

319 
fun warn_claset context th (CS {safeIs, safeEs, hazIs, hazEs, ...}) = 
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

320 
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

321 
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

322 
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

323 
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

324 

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

325 

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

327 

42793  328 
fun addSI w context th 
42790  329 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
330 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 

42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

331 
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

332 
else 
42790  333 
let 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

334 
val th' = flat_rule context th; 
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset

335 
val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) 
42790  336 
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

337 
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

338 
val nE = Item_Net.length safeEs; 
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

339 
val _ = warn_claset context th cs; 
42790  340 
in 
341 
CS 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

342 
{safeIs = Item_Net.update th safeIs, 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

343 
safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair, 
9938  344 
safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair, 
42790  345 
safeEs = safeEs, 
346 
hazIs = hazIs, 

347 
hazEs = hazEs, 

348 
swrappers = swrappers, 

349 
uwrappers = uwrappers, 

350 
haz_netpair = haz_netpair, 

351 
dup_netpair = dup_netpair, 

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

354 

42793  355 
fun addSE w context th 
42790  356 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
357 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 

42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

358 
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

359 
else if has_fewer_prems 1 th then 
42793  360 
error ("Illformed elimination rule\n" ^ string_of_thm context th) 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

361 
else 
42790  362 
let 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

363 
val th' = classical_rule (flat_rule context th); 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

364 
val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) 
42790  365 
List.partition (fn rl => 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

366 
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

367 
val nE = Item_Net.length safeEs + 1; 
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

368 
val _ = warn_claset context th cs; 
42790  369 
in 
370 
CS 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

371 
{safeEs = Item_Net.update th safeEs, 
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset

372 
safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair, 
9938  373 
safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair, 
42790  374 
safeIs = safeIs, 
375 
hazIs = hazIs, 

376 
hazEs = hazEs, 

377 
swrappers = swrappers, 

378 
uwrappers = uwrappers, 

379 
haz_netpair = haz_netpair, 

380 
dup_netpair = dup_netpair, 

18691  381 
xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair} 
42790  382 
end; 
0  383 

42793  384 
fun addSD w context th = addSE w context (make_elim context th); 
385 

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

386 

1800  387 
(*** Hazardous (unsafe) rules ***) 
0  388 

42793  389 
fun addI w context th 
42790  390 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
391 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 

42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

392 
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

393 
else 
42790  394 
let 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

395 
val th' = flat_rule context th; 
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

396 
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

397 
val nE = Item_Net.length hazEs; 
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

398 
val _ = warn_claset context th cs; 
42790  399 
in 
400 
CS 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

401 
{hazIs = Item_Net.update th hazIs, 
42790  402 
haz_netpair = insert (nI, nE) ([th'], []) haz_netpair, 
403 
dup_netpair = insert (nI, nE) ([dup_intr th'], []) dup_netpair, 

404 
safeIs = safeIs, 

405 
safeEs = safeEs, 

406 
hazEs = hazEs, 

407 
swrappers = swrappers, 

408 
uwrappers = uwrappers, 

9938  409 
safe0_netpair = safe0_netpair, 
410 
safep_netpair = safep_netpair, 

42790  411 
xtra_netpair = insert' (the_default 1 w) (nI, nE) ([th], []) xtra_netpair} 
412 
end 

413 
handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*) (* FIXME !? *) 

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

415 

42793  416 
fun addE w context th 
42790  417 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
418 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 

42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

419 
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

420 
else if has_fewer_prems 1 th then 
42793  421 
error ("Illformed elimination rule\n" ^ string_of_thm context th) 
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset

422 
else 
42790  423 
let 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

424 
val th' = classical_rule (flat_rule context th); 
42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

425 
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

426 
val nE = Item_Net.length hazEs + 1; 
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

427 
val _ = warn_claset context th cs; 
42790  428 
in 
429 
CS 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

430 
{hazEs = Item_Net.update th hazEs, 
42790  431 
haz_netpair = insert (nI, nE) ([], [th']) haz_netpair, 
432 
dup_netpair = insert (nI, nE) ([], [dup_elim th']) dup_netpair, 

433 
safeIs = safeIs, 

434 
safeEs = safeEs, 

435 
hazIs = hazIs, 

436 
swrappers = swrappers, 

437 
uwrappers = uwrappers, 

9938  438 
safe0_netpair = safe0_netpair, 
439 
safep_netpair = safep_netpair, 

42790  440 
xtra_netpair = insert' (the_default 1 w) (nI, nE) ([], [th]) xtra_netpair} 
441 
end; 

0  442 

42793  443 
fun addD w context th = addE w context (make_elim context th); 
444 

0  445 

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

446 

10736  447 
(*** Deletion of rules 
1800  448 
Working out what to delete, requires repeating much of the code used 
9938  449 
to insert. 
1800  450 
***) 
451 

54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

452 
fun delSI context th 
42790  453 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
454 
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

455 
if Item_Net.member safeIs th then 
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset

456 
let 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

457 
val th' = flat_rule context th; 
42790  458 
val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th']; 
459 
in 

460 
CS 

461 
{safe0_netpair = delete (safe0_rls, []) safe0_netpair, 

462 
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

463 
safeIs = Item_Net.remove th safeIs, 
42790  464 
safeEs = safeEs, 
465 
hazIs = hazIs, 

466 
hazEs = hazEs, 

467 
swrappers = swrappers, 

468 
uwrappers = uwrappers, 

469 
haz_netpair = haz_netpair, 

470 
dup_netpair = dup_netpair, 

471 
xtra_netpair = delete' ([th], []) xtra_netpair} 

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

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

473 
else cs; 
1800  474 

54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

475 
fun delSE context th 
42790  476 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
477 
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

478 
if Item_Net.member safeEs th then 
42790  479 
let 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

480 
val th' = classical_rule (flat_rule context th); 
42790  481 
val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl = 1) [th']; 
482 
in 

483 
CS 

484 
{safe0_netpair = delete ([], safe0_rls) safe0_netpair, 

485 
safep_netpair = delete ([], safep_rls) safep_netpair, 

486 
safeIs = safeIs, 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

487 
safeEs = Item_Net.remove th safeEs, 
42790  488 
hazIs = hazIs, 
489 
hazEs = hazEs, 

490 
swrappers = swrappers, 

491 
uwrappers = uwrappers, 

492 
haz_netpair = haz_netpair, 

493 
dup_netpair = dup_netpair, 

494 
xtra_netpair = delete' ([], [th]) xtra_netpair} 

495 
end 

496 
else cs; 

1800  497 

42793  498 
fun delI context th 
42790  499 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
500 
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

501 
if Item_Net.member hazIs th then 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

502 
let val th' = flat_rule context th in 
42790  503 
CS 
504 
{haz_netpair = delete ([th'], []) haz_netpair, 

23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset

505 
dup_netpair = delete ([dup_intr th'], []) dup_netpair, 
42790  506 
safeIs = safeIs, 
507 
safeEs = safeEs, 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

508 
hazIs = Item_Net.remove th hazIs, 
42790  509 
hazEs = hazEs, 
510 
swrappers = swrappers, 

511 
uwrappers = uwrappers, 

9938  512 
safe0_netpair = safe0_netpair, 
513 
safep_netpair = safep_netpair, 

12401  514 
xtra_netpair = delete' ([th], []) xtra_netpair} 
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset

515 
end 
42790  516 
else cs 
517 
handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*) (* FIXME !? *) 

42793  518 
error ("Illformed introduction rule\n" ^ string_of_thm context th); 
1800  519 

54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

520 
fun delE context th 
42790  521 
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
522 
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

523 
if Item_Net.member hazEs th then 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

524 
let val th' = classical_rule (flat_rule context th) in 
42790  525 
CS 
526 
{haz_netpair = delete ([], [th']) haz_netpair, 

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

527 
dup_netpair = delete ([], [dup_elim th']) dup_netpair, 
42790  528 
safeIs = safeIs, 
529 
safeEs = safeEs, 

530 
hazIs = hazIs, 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

531 
hazEs = Item_Net.remove th hazEs, 
42790  532 
swrappers = swrappers, 
533 
uwrappers = uwrappers, 

9938  534 
safe0_netpair = safe0_netpair, 
535 
safep_netpair = safep_netpair, 

12401  536 
xtra_netpair = delete' ([], [th]) xtra_netpair} 
42790  537 
end 
538 
else cs; 

1800  539 

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

540 
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*) 
42793  541 
fun delrule context th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) = 
542 
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

543 
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

544 
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

545 
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

546 
then 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

547 
delSI context th 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

548 
(delSE context th 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

549 
(delI context th 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

550 
(delE context th (delSE context th' (delE context th' cs))))) 
42807
e639d91d9073
more precise warnings: observe context visibility;
wenzelm
parents:
42799
diff
changeset

551 
else (warn_thm context "Undeclared classical rule\n" th; cs) 
9938  552 
end; 
1800  553 

554 

42793  555 

556 
(** claset data **) 

42790  557 

42793  558 
(* wrappers *) 
42790  559 

22674  560 
fun map_swrappers f 
561 
(CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 

562 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 

563 
CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, 

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

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

565 
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, 
6955  566 
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

567 

22674  568 
fun map_uwrappers f 
42793  569 
(CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
22674  570 
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = 
571 
CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, 

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

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

573 
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, 
6955  574 
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

575 

22674  576 

42793  577 
(* merge_cs *) 
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset

578 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

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

580 
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

581 

2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

582 
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

583 
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

584 

22674  585 
fun merge_cs (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}, 
24358  586 
cs' as CS {safeIs = safeIs2, safeEs = safeEs2, hazIs = hazIs2, hazEs = hazEs2, 
22674  587 
swrappers, uwrappers, ...}) = 
24358  588 
if pointer_eq (cs, cs') then cs 
589 
else 

42810
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

590 
cs 
2425068fe13a
slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents:
42807
diff
changeset

591 
> 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

592 
> 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

593 
> 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

594 
> 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

595 
> 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

596 
> map_uwrappers (fn ws => AList.merge (op =) (K true) (ws, uwrappers)); 
42793  597 

598 

599 
(* data *) 

600 

601 
structure Claset = Generic_Data 

602 
( 

603 
type T = claset; 

604 
val empty = empty_cs; 

605 
val extend = I; 

606 
val merge = merge_cs; 

607 
); 

608 

609 
val claset_of = Claset.get o Context.Proof; 

610 
val rep_claset_of = rep_cs o claset_of; 

611 

612 
val get_cs = Claset.get; 

613 
val map_cs = Claset.map; 

614 

51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

615 
fun map_theory_claset f thy = 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

616 
let 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

617 
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

618 
val thy' = Proof_Context.theory_of ctxt'; 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

619 
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

620 

42793  621 
fun map_claset f = Context.proof_map (map_cs f); 
622 
fun put_claset cs = map_claset (K cs); 

623 

624 
fun print_claset ctxt = 

625 
let 

626 
val {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...} = rep_claset_of ctxt; 

51584  627 
val pretty_thms = map (Display.pretty_thm_item ctxt) o Item_Net.content; 
42793  628 
in 
629 
[Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs), 

630 
Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs), 

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

632 
Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs), 

633 
Pretty.strs ("safe wrappers:" :: map #1 swrappers), 

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

635 
> Pretty.chunks > Pretty.writeln 

636 
end; 

637 

638 

639 
(* oldstyle declarations *) 

640 

641 
fun decl f (ctxt, ths) = map_claset (fold_rev (f (SOME (Context.Proof ctxt))) ths) ctxt; 

642 

643 
val op addSIs = decl (addSI NONE); 

644 
val op addSEs = decl (addSE NONE); 

645 
val op addSDs = decl (addSD NONE); 

646 
val op addIs = decl (addI NONE); 

647 
val op addEs = decl (addE NONE); 

648 
val op addDs = decl (addD NONE); 

649 
val op delrules = decl delrule; 

650 

651 

652 

653 
(*** Modifying the wrapper tacticals ***) 

654 

655 
fun appSWrappers ctxt = fold (fn (_, w) => w ctxt) (#swrappers (rep_claset_of ctxt)); 

656 
fun appWrappers ctxt = fold (fn (_, w) => w ctxt) (#uwrappers (rep_claset_of ctxt)); 

657 

658 
fun update_warn msg (p as (key : string, _)) xs = 

659 
(if AList.defined (op =) xs key then warning msg else (); AList.update (op =) p xs); 

660 

661 
fun delete_warn msg (key : string) xs = 

662 
if AList.defined (op =) xs key then AList.delete (op =) key xs 

663 
else (warning msg; xs); 

664 

665 
(*Add/replace a safe wrapper*) 

51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

666 
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

667 
(map_swrappers (update_warn ("Overwriting safe wrapper " ^ fst new_swrapper) new_swrapper)); 
42793  668 

669 
(*Add/replace an unsafe wrapper*) 

51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

670 
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

671 
(map_uwrappers (update_warn ("Overwriting unsafe wrapper " ^ fst new_uwrapper) new_uwrapper)); 
42793  672 

673 
(*Remove a safe wrapper*) 

51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

674 
fun ctxt delSWrapper name = ctxt > map_claset 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

675 
(map_swrappers (delete_warn ("No such safe wrapper in claset: " ^ name) name)); 
42793  676 

677 
(*Remove an unsafe wrapper*) 

51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

678 
fun ctxt delWrapper name = ctxt > map_claset 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51688
diff
changeset

679 
(map_uwrappers (delete_warn ("No such unsafe wrapper in claset: " ^ name) name)); 
42793  680 

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

682 
fun ctxt addSbefore (name, tac1) = 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

683 
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

684 
fun ctxt addSafter (name, tac2) = 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

685 
ctxt addSWrapper (name, fn ctxt => fn tac1 => tac1 ORELSE' tac2 ctxt); 
42793  686 

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

688 
fun ctxt addbefore (name, tac1) = 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

689 
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

690 
fun ctxt addafter (name, tac2) = 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

691 
ctxt addWrapper (name, fn ctxt => fn tac1 => tac1 APPEND' tac2 ctxt); 
42793  692 

51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

693 
fun ctxt addD2 (name, thm) = ctxt addafter (name, fn _ => dtac thm THEN' assume_tac); 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

694 
fun ctxt addE2 (name, thm) = ctxt addafter (name, fn _ => etac thm THEN' assume_tac); 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

695 
fun ctxt addSD2 (name, thm) = ctxt addSafter (name, fn _ => dmatch_tac [thm] THEN' eq_assume_tac); 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

696 
fun ctxt addSE2 (name, thm) = ctxt addSafter (name, fn _ => ematch_tac [thm] THEN' eq_assume_tac); 
42793  697 

1711  698 

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

699 

1800  700 
(**** Simple tactics for theorem proving ****) 
0  701 

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

42793  703 
fun safe_step_tac ctxt = 
704 
let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in 

705 
appSWrappers ctxt 

706 
(FIRST' 

707 
[eq_assume_tac, 

9938  708 
eq_mp_tac, 
709 
bimatch_from_nets_tac safe0_netpair, 

51798  710 
FIRST' (map (fn tac => tac ctxt) Data.hyp_subst_tacs), 
42793  711 
bimatch_from_nets_tac safep_netpair]) 
712 
end; 

0  713 

5757  714 
(*Repeatedly attack a subgoal using safe inferences  it's deterministic!*) 
42793  715 
fun safe_steps_tac ctxt = 
716 
REPEAT_DETERM1 o (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac ctxt i)); 

5757  717 

0  718 
(*Repeatedly attack subgoals using safe inferences  it's deterministic!*) 
42793  719 
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

720 

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

723 

42790  724 
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

725 

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

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

727 
create precisely n subgoals.*) 
10736  728 
fun n_bimatch_from_nets_tac n = 
42790  729 
biresolution_from_nets_tac (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

730 

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

732 
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

733 

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

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

735 
fun bimatch2_tac netpair i = 
42790  736 
n_bimatch_from_nets_tac 2 netpair i THEN 
737 
(eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i + 1)); 

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

738 

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

739 
(*Attack subgoals using safe inferences  matching, not resolution*) 
42793  740 
fun clarify_step_tac ctxt = 
741 
let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in 

742 
appSWrappers ctxt 

743 
(FIRST' 

744 
[eq_assume_contr_tac, 

9938  745 
bimatch_from_nets_tac safe0_netpair, 
51798  746 
FIRST' (map (fn tac => tac ctxt) Data.hyp_subst_tacs), 
9938  747 
n_bimatch_from_nets_tac 1 safep_netpair, 
42793  748 
bimatch2_tac safep_netpair]) 
749 
end; 

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

750 

42793  751 
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

752 

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

753 

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

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

755 

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

42793  758 
fun inst0_step_tac ctxt = 
32862  759 
assume_tac APPEND' 
760 
contr_tac APPEND' 

42793  761 
biresolve_from_nets_tac (#safe0_netpair (rep_claset_of ctxt)); 
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset

762 

4066  763 
(*These unsafe steps could generate more subgoals.*) 
42793  764 
fun instp_step_tac ctxt = 
765 
biresolve_from_nets_tac (#safep_netpair (rep_claset_of ctxt)); 

0  766 

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

42793  768 
fun inst_step_tac ctxt = inst0_step_tac ctxt APPEND' instp_step_tac ctxt; 
0  769 

42793  770 
fun haz_step_tac ctxt = 
771 
biresolve_from_nets_tac (#haz_netpair (rep_claset_of ctxt)); 

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

772 

0  773 
(*Single step for the prover. FAILS unless it makes progress. *) 
42793  774 
fun step_tac ctxt i = 
775 
safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt ORELSE' haz_step_tac ctxt) i; 

0  776 

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

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

42793  779 
fun slow_step_tac ctxt i = 
780 
safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt APPEND' haz_step_tac ctxt) i; 

0  781 

42791
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset

782 

1800  783 
(**** The following tactics all fail unless they solve one goal ****) 
0  784 

785 
(*Dumb but fast*) 

42793  786 
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

787 
Object_Logic.atomize_prems_tac ctxt THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac ctxt 1)); 
0  788 

789 
(*Slower but smarter than fast_tac*) 

42793  790 
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

791 
Object_Logic.atomize_prems_tac ctxt THEN' 
42793  792 
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (step_tac ctxt 1)); 
0  793 

9402  794 
(*even a bit smarter than best_tac*) 
42793  795 
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

796 
Object_Logic.atomize_prems_tac ctxt THEN' 
42793  797 
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (FIRSTGOAL (step_tac ctxt))); 
9402  798 

42793  799 
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

800 
Object_Logic.atomize_prems_tac ctxt THEN' 
42793  801 
SELECT_GOAL (DEPTH_SOLVE (slow_step_tac ctxt 1)); 
0  802 

42793  803 
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

804 
Object_Logic.atomize_prems_tac ctxt THEN' 
42793  805 
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (slow_step_tac ctxt 1)); 
0  806 

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

807 

10736  808 
(***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

809 

36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset

810 
val weight_ASTAR = 5; 
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset

811 

42793  812 
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

813 
Object_Logic.atomize_prems_tac ctxt THEN' 
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

814 
SELECT_GOAL 
52462
a241826ed003
actually use Data.sizef, not hardwired size_of_thm;
wenzelm
parents:
51798
diff
changeset

815 
(ASTAR (has_fewer_prems 1, fn lev => fn thm => Data.sizef thm + weight_ASTAR * lev) 
42793  816 
(step_tac ctxt 1)); 
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset

817 

42793  818 
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

819 
Object_Logic.atomize_prems_tac ctxt THEN' 
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset

820 
SELECT_GOAL 
52462
a241826ed003
actually use Data.sizef, not hardwired size_of_thm;
wenzelm
parents:
51798
diff
changeset

821 
(ASTAR (has_fewer_prems 1, fn lev => fn thm => Data.sizef thm + weight_ASTAR * lev) 
42793  822 
(slow_step_tac ctxt 1)); 
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset

823 

42790  824 

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

826 
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

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

829 

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

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

831 
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

832 
greater search depth required.*) 
42793  833 
fun dup_step_tac ctxt = 
834 
biresolve_from_nets_tac (#dup_netpair (rep_claset_of ctxt)); 

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

835 

5523  836 
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*) 
5757  837 
local 
42793  838 
fun slow_step_tac' ctxt = appWrappers ctxt (instp_step_tac ctxt APPEND' dup_step_tac ctxt); 
42790  839 
in 
42793  840 
fun depth_tac ctxt m i state = SELECT_GOAL 
841 
(safe_steps_tac ctxt 1 THEN_ELSE 

842 
(DEPTH_SOLVE (depth_tac ctxt m 1), 

843 
inst0_step_tac ctxt 1 APPEND COND (K (m = 0)) no_tac 

844 
(slow_step_tac' ctxt 1 THEN DEPTH_SOLVE (depth_tac ctxt (m  1) 1)))) i state; 

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

846 

10736  847 
(*Search, with depth bound m. 
2173  848 
This is the "entry point", which does safe inferences first.*) 
42793  849 
fun safe_depth_tac ctxt m = SUBGOAL (fn (prem, i) => 
850 
let 

851 
val deti = (*No Vars in the goal? No need to backtrack between goals.*) 

852 
if exists_subterm (fn Var _ => true  _ => false) prem then DETERM else I; 

42790  853 
in 
42793  854 
SELECT_GOAL (TRY (safe_tac ctxt) THEN DEPTH_SOLVE (deti (depth_tac ctxt m 1))) i 
42790  855 
end); 
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset

856 

42793  857 
fun deepen_tac ctxt = DEEPEN (2, 10) (safe_depth_tac ctxt); 
24021  858 

859 

5885  860 
(* attributes *) 
861 

42793  862 
fun attrib f = 
863 
Thm.declaration_attribute (fn th => fn context => map_cs (f (SOME context) th) context); 

5885  864 

18691  865 
val safe_elim = attrib o addSE; 
866 
val safe_intro = attrib o addSI; 

42793  867 
val safe_dest = attrib o addSD; 
18691  868 
val haz_elim = attrib o addE; 
869 
val haz_intro = attrib o addI; 

42793  870 
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

871 

7fe19930dfc9
more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents:
42817
diff
changeset

872 
val rule_del = 
7fe19930dfc9
more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents:
42817
diff
changeset

873 
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

874 
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

875 
Thm.attribute_declaration Context_Rules.rule_del th); 
5885  876 

877 

5841  878 

5885  879 
(** concrete syntax of attributes **) 
5841  880 

881 
val introN = "intro"; 

882 
val elimN = "elim"; 

883 
val destN = "dest"; 

884 

30528  885 
val setup_attrs = 
886 
Attrib.setup @{binding swapped} (Scan.succeed swapped) 

887 
"classical swap of introduction rule" #> 

33369  888 
Attrib.setup @{binding dest} (Context_Rules.add safe_dest haz_dest Context_Rules.dest_query) 
30528  889 
"declaration of Classical destruction rule" #> 
33369  890 
Attrib.setup @{binding elim} (Context_Rules.add safe_elim haz_elim Context_Rules.elim_query) 
30528  891 
"declaration of Classical elimination rule" #> 
33369  892 
Attrib.setup @{binding intro} (Context_Rules.add safe_intro haz_intro Context_Rules.intro_query) 
30528  893 
"declaration of Classical introduction rule" #> 
894 
Attrib.setup @{binding rule} (Scan.lift Args.del >> K rule_del) 

895 
"remove declaration of intro/elim/dest rule"; 

5841  896 

897 

898 

7230  899 
(** proof methods **) 
900 

901 
local 

902 

30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

903 
fun some_rule_tac ctxt facts = SUBGOAL (fn (goal, i) => 
5841  904 
let 
33369  905 
val [rules1, rules2, rules4] = Context_Rules.find_rules false facts goal ctxt; 
42793  906 
val {xtra_netpair, ...} = rep_claset_of ctxt; 
33369  907 
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

908 
val rules = rules1 @ rules2 @ rules3 @ rules4; 
18223  909 
val ruleq = Drule.multi_resolves facts rules; 
52732  910 
val _ = Method.trace ctxt rules; 
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset

911 
in 
52732  912 
fn st => Seq.maps (fn rule => rtac rule i st) ruleq 
18834  913 
end) 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

914 
THEN_ALL_NEW Goal.norm_hhf_tac ctxt; 
5841  915 

30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

916 
in 
7281  917 

30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

918 
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

919 
 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

920 

983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

921 
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

922 
HEADGOAL (rule_tac ctxt rules facts) ORELSE 
26470  923 
Class.default_intro_tac ctxt facts; 
10309  924 

7230  925 
end; 
5841  926 

927 

6502  928 
(* automatic methods *) 
5841  929 

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

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

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

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

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

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

5927  938 

42793  939 
fun cla_method tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD o tac); 
940 
fun cla_method' tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD' o tac); 

5841  941 

942 

943 

944 
(** setup_methods **) 

945 

30541  946 
val setup_methods = 
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

947 
Method.setup @{binding default} 
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

948 
(Attrib.thms >> (fn rules => fn ctxt => METHOD (default_tac ctxt rules))) 
30541  949 
"apply some intro/elim rule (potentially classical)" #> 
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

950 
Method.setup @{binding rule} 
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset

951 
(Attrib.thms >> (fn rules => fn ctxt => METHOD (HEADGOAL o rule_tac ctxt rules))) 
30541  952 
"apply some intro/elim rule (potentially classical)" #> 
50112
11cd86c5af3a
tuned  eliminate pointless ML method definition;
wenzelm
parents:
50108
diff
changeset

953 
Method.setup @{binding contradiction} 
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52732
diff
changeset

954 
(Scan.succeed (fn ctxt => Method.rule ctxt [Data.not_elim, Drule.rotate_prems 1 Data.not_elim])) 
30541  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 (depthfirst)" #> 

959 
Method.setup @{binding slow} (cla_method' slow_tac) "classical prover (slow depthfirst)" #> 

960 
Method.setup @{binding best} (cla_method' best_tac) "classical prover (bestfirst)" #> 

42798  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))) 

30541  964 
"classical prover (iterative deepening)" #> 
965 
Method.setup @{binding safe} (cla_method (CHANGED_PROP o safe_tac)) 

50108  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 

978 

979 

980 
(** theory setup **) 

981 

26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset

982 
val setup = setup_attrs #> setup_methods; 
5841  983 

984 

8667  985 

986 
(** outer syntax **) 

987 

24867  988 
val _ = 
46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46874
diff
changeset

989 
Outer_Syntax.improper_command @{command_spec "print_claset"} "print context of Classical Reasoner" 
51658
21c10672633b
discontinued Toplevel.no_timing complication  also recovers timing of diagnostic commands, e.g. 'find_theorems';
wenzelm
parents:
51584
diff
changeset

990 
(Scan.succeed (Toplevel.unknown_context o Toplevel.keep (print_claset o Toplevel.context_of))); 
8667  991 

5841  992 
end; 