author  wenzelm 
Mon, 27 Feb 2012 15:42:07 +0100  
changeset 46707  1427dcc7c9a6 
parent 46465  5ba52c337cd0 
child 47239  0b1829860149 
permissions  rwrr 
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset

1 
(* Title: Pure/raw_simplifier.ML 
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
28839
diff
changeset

2 
Author: Tobias Nipkow and Stefan Berghofer, TU Muenchen 
10413  3 

41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset

4 
Higherorder Simplification. 
10413  5 
*) 
6 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

7 
infix 4 
45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

8 
addsimps delsimps addsimprocs delsimprocs 
45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

9 
setloop' setloop addloop addloop' delloop 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

10 
setSSolver addSSolver setSolver addSolver; 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

11 

41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset

12 
signature BASIC_RAW_SIMPLIFIER = 
11672  13 
sig 
41227  14 
val simp_depth_limit: int Config.T 
15 
val simp_trace_depth_limit: int Config.T 

40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

16 
val simp_debug: bool Config.T 
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

17 
val simp_trace: bool Config.T 
15023  18 
type rrule 
16807  19 
val eq_rrule: rrule * rrule > bool 
15023  20 
type simpset 
21 
type proc 

17614  22 
type solver 
43596  23 
val mk_solver: string > (simpset > int > tactic) > solver 
15023  24 
val empty_ss: simpset 
25 
val merge_ss: simpset * simpset > simpset 

30356  26 
val dest_ss: simpset > 
27 
{simps: (string * thm) list, 

28 
procs: (string * cterm list) list, 

29 
congs: (string * thm) list, 

30 
weak_congs: string list, 

31 
loopers: string list, 

32 
unsafe_solvers: string list, 

33 
safe_solvers: string list} 

15023  34 
type simproc 
22234  35 
val eq_simproc: simproc * simproc > bool 
45290  36 
val transform_simproc: morphism > simproc > simproc 
22234  37 
val make_simproc: {name: string, lhss: cterm list, 
38 
proc: morphism > simpset > cterm > thm option, identifier: thm list} > simproc 

22008  39 
val mk_simproc: string > cterm list > (theory > simpset > term > thm option) > simproc 
15023  40 
val addsimps: simpset * thm list > simpset 
41 
val delsimps: simpset * thm list > simpset 

42 
val addsimprocs: simpset * simproc list > simpset 

43 
val delsimprocs: simpset * simproc list > simpset 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

44 
val setloop': simpset * (simpset > int > tactic) > simpset 
15023  45 
val setloop: simpset * (int > tactic) > simpset 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

46 
val addloop': simpset * (string * (simpset > int > tactic)) > simpset 
15023  47 
val addloop: simpset * (string * (int > tactic)) > simpset 
48 
val delloop: simpset * string > simpset 

49 
val setSSolver: simpset * solver > simpset 

50 
val addSSolver: simpset * solver > simpset 

51 
val setSolver: simpset * solver > simpset 

52 
val addSolver: simpset * solver > simpset 

21708  53 

54 
val rewrite_rule: thm list > thm > thm 

55 
val rewrite_goals_rule: thm list > thm > thm 

56 
val rewrite_goals_tac: thm list > tactic 

23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset

57 
val rewrite_goal_tac: thm list > int > tactic 
21708  58 
val prune_params_tac: tactic 
59 
val fold_rule: thm list > thm > thm 

60 
val fold_goals_tac: thm list > tactic 

30552
58db56278478
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents:
30356
diff
changeset

61 
val norm_hhf: thm > thm 
58db56278478
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents:
30356
diff
changeset

62 
val norm_hhf_protect: thm > thm 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

63 
end; 
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

64 

41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset

65 
signature RAW_SIMPLIFIER = 
10413  66 
sig 
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset

67 
include BASIC_RAW_SIMPLIFIER 
10413  68 
exception SIMPLIFIER of string * thm 
30336  69 
val internal_ss: simpset > 
70 
{rules: rrule Net.net, 

71 
prems: thm list, 

72 
bounds: int * ((string * typ) * string) list, 

32738  73 
depth: int * bool Unsynchronized.ref, 
30336  74 
context: Proof.context option} * 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

75 
{congs: (string * thm) list * string list, 
30336  76 
procs: proc Net.net, 
77 
mk_rews: 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

78 
{mk: simpset > thm > thm list, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

79 
mk_cong: simpset > thm > thm, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

80 
mk_sym: simpset > thm > thm option, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

81 
mk_eq_True: simpset > thm > thm option, 
30336  82 
reorient: theory > term list > term > term > bool}, 
83 
termless: term * term > bool, 

84 
subgoal_tac: simpset > int > tactic, 

85 
loop_tacs: (string * (simpset > int > tactic)) list, 

86 
solvers: solver list * solver list} 

43597  87 
val prems_of: simpset > thm list 
27558  88 
val add_simp: thm > simpset > simpset 
89 
val del_simp: thm > simpset > simpset 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

90 
val add_eqcong: thm > simpset > simpset 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

91 
val del_eqcong: thm > simpset > simpset 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

92 
val add_cong: thm > simpset > simpset 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

93 
val del_cong: thm > simpset > simpset 
45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

94 
val mksimps: simpset > thm > thm list 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

95 
val set_mksimps: (simpset > thm > thm list) > simpset > simpset 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

96 
val set_mkcong: (simpset > thm > thm) > simpset > simpset 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

97 
val set_mksym: (simpset > thm > thm option) > simpset > simpset 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

98 
val set_mkeqTrue: (simpset > thm > thm option) > simpset > simpset 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

99 
val set_termless: (term * term > bool) > simpset > simpset 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

100 
val set_subgoaler: (simpset > int > tactic) > simpset > simpset 
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

101 
val solver: simpset > solver > int > tactic 
39163
4d701c0388c3
more explicit indication of Config.raw options, which are only needed for bootstrapping Pure;
wenzelm
parents:
39116
diff
changeset

102 
val simp_depth_limit_raw: Config.raw 
15023  103 
val clear_ss: simpset > simpset 
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset

104 
val simproc_global_i: theory > string > term list 
16458  105 
> (theory > simpset > term > thm option) > simproc 
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset

106 
val simproc_global: theory > string > string list 
16458  107 
> (theory > simpset > term > thm option) > simproc 
41227  108 
val simp_trace_depth_limit_raw: Config.raw 
109 
val simp_trace_depth_limit_default: int Unsynchronized.ref 

110 
val simp_trace_default: bool Unsynchronized.ref 

111 
val simp_trace_raw: Config.raw 

112 
val simp_debug_raw: Config.raw 

41226  113 
val add_prems: thm list > simpset > simpset 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

114 
val inherit_context: simpset > simpset > simpset 
20289  115 
val the_context: simpset > Proof.context 
116 
val context: Proof.context > simpset > simpset 

42454  117 
val global_context: theory > simpset > simpset 
36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset

118 
val with_context: Proof.context > (simpset > simpset) > simpset > simpset 
32738  119 
val debug_bounds: bool Unsynchronized.ref 
18208  120 
val set_reorient: (theory > term list > term > term > bool) > simpset > simpset 
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

121 
val set_solvers: solver list > simpset > simpset 
23598  122 
val rewrite_cterm: bool * bool * bool > (simpset > thm > thm option) > simpset > conv 
16458  123 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  124 
val rewrite_thm: bool * bool * bool > 
125 
(simpset > thm > thm option) > simpset > thm > thm 

46465  126 
val generic_rewrite_goal_tac: bool * bool * bool > 
23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset

127 
(simpset > tactic) > simpset > int > tactic 
23598  128 
val rewrite: bool > thm list > conv 
21708  129 
val simplify: bool > thm list > thm > thm 
10413  130 
end; 
131 

41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset

132 
structure Raw_Simplifier: RAW_SIMPLIFIER = 
10413  133 
struct 
134 

15023  135 
(** datatype simpset **) 
136 

137 
(* rewrite rules *) 

10413  138 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

139 
type rrule = 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

140 
{thm: thm, (*the rewrite rule*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

141 
name: string, (*name of theorem from which rewrite rule was extracted*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

142 
lhs: term, (*the lefthand side*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

143 
elhs: cterm, (*the etaccontracted lhs*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

144 
extra: bool, (*extra variables outside of elhs*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

145 
fo: bool, (*use firstorder matching*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

146 
perm: bool}; (*the rewrite rule is permutative*) 
15023  147 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

148 
(* 
12603  149 
Remarks: 
10413  150 
 elhs is used for matching, 
15023  151 
lhs only for preservation of bound variable names; 
10413  152 
 fo is set iff 
153 
either elhs is firstorder (no Var is applied), 

15023  154 
in which case fomatching is complete, 
10413  155 
or elhs is not a pattern, 
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

156 
in which case there is nothing better to do; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

157 
*) 
10413  158 

159 
fun eq_rrule ({thm = thm1, ...}: rrule, {thm = thm2, ...}: rrule) = 

22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22254
diff
changeset

160 
Thm.eq_thm_prop (thm1, thm2); 
15023  161 

162 

17614  163 
(* simplification sets, procedures, and solvers *) 
15023  164 

165 
(*A simpset contains data required during conversion: 

10413  166 
rules: discrimination net of rewrite rules; 
15023  167 
prems: current premises; 
15249
0da6b3075bfa
Replaced list of bound variables in simpset by maximal index of bound
berghofe
parents:
15199
diff
changeset

168 
bounds: maximal index of bound variables already used 
15023  169 
(for generating new names when rewriting under lambda abstractions); 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

170 
depth: simp_depth and exceeded flag; 
10413  171 
congs: association list of congruence rules and 
172 
a list of `weak' congruence constants. 

173 
A congruence is `weak' if it avoids normalization of some argument. 

174 
procs: discrimination net of simplification procedures 

175 
(functions that prove rewrite rules on the fly); 

15023  176 
mk_rews: 
177 
mk: turn simplification thms into rewrite rules; 

178 
mk_cong: prepare congruence rules; 

179 
mk_sym: turn == around; 

180 
mk_eq_True: turn P into P == True; 

181 
termless: relation for ordered rewriting;*) 

15011  182 

15023  183 
datatype simpset = 
184 
Simpset of 

185 
{rules: rrule Net.net, 

10413  186 
prems: thm list, 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

187 
bounds: int * ((string * typ) * string) list, 
32738  188 
depth: int * bool Unsynchronized.ref, 
20289  189 
context: Proof.context option} * 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

190 
{congs: (string * thm) list * string list, 
15023  191 
procs: proc Net.net, 
36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

192 
mk_rews: 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

193 
{mk: simpset > thm > thm list, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

194 
mk_cong: simpset > thm > thm, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

195 
mk_sym: simpset > thm > thm option, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

196 
mk_eq_True: simpset > thm > thm option, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

197 
reorient: theory > term list > term > term > bool}, 
11504  198 
termless: term * term > bool, 
15011  199 
subgoal_tac: simpset > int > tactic, 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

200 
loop_tacs: (string * (simpset > int > tactic)) list, 
15023  201 
solvers: solver list * solver list} 
202 
and proc = 

203 
Proc of 

204 
{name: string, 

205 
lhs: cterm, 

22008  206 
proc: simpset > cterm > thm option, 
22234  207 
id: stamp * thm list} 
17614  208 
and solver = 
209 
Solver of 

210 
{name: string, 

211 
solver: simpset > int > tactic, 

15023  212 
id: stamp}; 
213 

214 

30336  215 
fun internal_ss (Simpset args) = args; 
10413  216 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

217 
fun make_ss1 (rules, prems, bounds, depth, context) = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

218 
{rules = rules, prems = prems, bounds = bounds, depth = depth, context = context}; 
15023  219 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

220 
fun map_ss1 f {rules, prems, bounds, depth, context} = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

221 
make_ss1 (f (rules, prems, bounds, depth, context)); 
10413  222 

15023  223 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
224 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

225 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

226 

227 
fun map_ss2 f {congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers} = 

228 
make_ss2 (f (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); 

229 

230 
fun make_simpset (args1, args2) = Simpset (make_ss1 args1, make_ss2 args2); 

10413  231 

15023  232 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
233 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

234 

43597  235 
fun prems_of (Simpset ({prems, ...}, _)) = prems; 
17614  236 

22234  237 
fun eq_procid ((s1: stamp, ths1: thm list), (s2, ths2)) = 
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22254
diff
changeset

238 
s1 = s2 andalso eq_list Thm.eq_thm (ths1, ths2); 
22234  239 
fun eq_proc (Proc {id = id1, ...}, Proc {id = id2, ...}) = eq_procid (id1, id2); 
17614  240 

43596  241 
fun mk_solver name solver = Solver {name = name, solver = solver, id = stamp ()}; 
17614  242 

243 
fun solver_name (Solver {name, ...}) = name; 

17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

244 
fun solver ss (Solver {solver = tac, ...}) = tac ss; 
17614  245 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 
246 

15023  247 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

248 
(* simp depth *) 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

249 

39163
4d701c0388c3
more explicit indication of Config.raw options, which are only needed for bootstrapping Pure;
wenzelm
parents:
39116
diff
changeset

250 
val simp_depth_limit_raw = Config.declare "simp_depth_limit" (K (Config.Int 100)); 
4d701c0388c3
more explicit indication of Config.raw options, which are only needed for bootstrapping Pure;
wenzelm
parents:
39116
diff
changeset

251 
val simp_depth_limit = Config.int simp_depth_limit_raw; 
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

252 

41183
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

253 
val simp_trace_depth_limit_default = Unsynchronized.ref 1; 
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

254 
val simp_trace_depth_limit_raw = Config.declare "simp_trace_depth_limit" 
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

255 
(fn _ => Config.Int (! simp_trace_depth_limit_default)); 
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

256 
val simp_trace_depth_limit = Config.int simp_trace_depth_limit_raw; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

257 

41183
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

258 
fun simp_trace_depth_limit_of NONE = ! simp_trace_depth_limit_default 
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

259 
 simp_trace_depth_limit_of (SOME ctxt) = Config.get ctxt simp_trace_depth_limit; 
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

260 

e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

261 
fun trace_depth (Simpset ({depth = (depth, exceeded), context, ...}, _)) msg = 
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

262 
if depth > simp_trace_depth_limit_of context then 
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

263 
if ! exceeded then () else (tracing "simp_trace_depth_limit exceeded!"; exceeded := true) 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

264 
else 
23938  265 
(tracing (enclose "[" "]" (string_of_int depth) ^ msg); exceeded := false); 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

266 

c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

267 
val inc_simp_depth = map_simpset1 (fn (rules, prems, bounds, (depth, exceeded), context) => 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

268 
(rules, prems, bounds, 
32738  269 
(depth + 1, 
41183
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset

270 
if depth = simp_trace_depth_limit_of context then Unsynchronized.ref false else exceeded), context)); 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

271 

c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

272 
fun simp_depth (Simpset ({depth = (depth, _), ...}, _)) = depth; 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

273 

c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

274 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

275 
(* diagnostics *) 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

276 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

277 
exception SIMPLIFIER of string * thm; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

278 

40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

279 
val simp_debug_raw = Config.declare "simp_debug" (K (Config.Bool false)); 
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

280 
val simp_debug = Config.bool simp_debug_raw; 
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

281 

40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

282 
val simp_trace_default = Unsynchronized.ref false; 
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

283 
val simp_trace_raw = Config.declare "simp_trace" (fn _ => Config.Bool (! simp_trace_default)); 
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

284 
val simp_trace = Config.bool simp_trace_raw; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

285 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

286 
fun if_enabled (Simpset ({context, ...}, _)) flag f = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

287 
(case context of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

288 
SOME ctxt => if Config.get ctxt flag then f ctxt else () 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

289 
 NONE => ()) 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

290 

658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

291 
fun if_visible (Simpset ({context, ...}, _)) f x = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

292 
(case context of 
41469  293 
SOME ctxt => Context_Position.if_visible ctxt f x 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

294 
 NONE => ()); 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

295 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

296 
local 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

297 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

298 
fun prnt ss warn a = if warn then warning a else trace_depth ss a; 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

299 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

300 
fun show_bounds (Simpset ({bounds = (_, bs), ...}, _)) t = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

301 
let 
20146  302 
val names = Term.declare_term_names t Name.context; 
43326
47cf4bc789aa
simplified Name.variant  discontinued builtin fold_map;
wenzelm
parents:
42454
diff
changeset

303 
val xs = rev (#1 (fold_map Name.variant (rev (map #2 bs)) names)); 
42284  304 
fun subst (((b, T), _), x') = (Free (b, T), Syntax_Trans.mark_boundT (x', T)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

305 
in Term.subst_atomic (ListPair.map subst (bs, xs)) t end; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

306 

35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

307 
fun print_term ss warn a t ctxt = prnt ss warn (a () ^ "\n" ^ 
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

308 
Syntax.string_of_term ctxt 
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

309 
(if Config.get ctxt simp_debug then t else show_bounds ss t)); 
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

310 

17705  311 
in 
312 

35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

313 
fun print_term_global ss warn a thy t = 
42360  314 
print_term ss warn (K a) t (Proof_Context.init_global thy); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

315 

40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

316 
fun debug warn a ss = if_enabled ss simp_debug (fn _ => prnt ss warn (a ())); 
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

317 
fun trace warn a ss = if_enabled ss simp_trace (fn _ => prnt ss warn (a ())); 
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

318 

40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

319 
fun debug_term warn a ss t = if_enabled ss simp_debug (print_term ss warn a t); 
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

320 
fun trace_term warn a ss t = if_enabled ss simp_trace (print_term ss warn a t); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

321 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

322 
fun trace_cterm warn a ss ct = 
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

323 
if_enabled ss simp_trace (print_term ss warn a (Thm.term_of ct)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

324 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

325 
fun trace_thm a ss th = 
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

326 
if_enabled ss simp_trace (print_term ss false a (Thm.full_prop_of th)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

327 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

328 
fun trace_named_thm a ss (th, name) = 
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset

329 
if_enabled ss simp_trace (print_term ss false 
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

330 
(fn () => if name = "" then a () else a () ^ " " ^ quote name ^ ":") 
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

331 
(Thm.full_prop_of th)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

332 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

333 
fun warn_thm a ss th = 
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

334 
print_term_global ss true a (Thm.theory_of_thm th) (Thm.full_prop_of th); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

335 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

336 
fun cond_warn_thm a ss th = if_visible ss (fn () => warn_thm a ss th) (); 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

337 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

338 
end; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

339 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

340 

10413  341 

342 
(** simpset operations **) 

343 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

344 
(* context *) 
10413  345 

17614  346 
fun eq_bound (x: string, (y, _)) = x = y; 
347 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

348 
fun add_bound bound = map_simpset1 (fn (rules, prems, (count, bounds), depth, context) => 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

349 
(rules, prems, (count + 1, bound :: bounds), depth, context)); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

350 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

351 
fun add_prems ths = map_simpset1 (fn (rules, prems, bounds, depth, context) => 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

352 
(rules, ths @ prems, bounds, depth, context)); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

353 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

354 
fun inherit_context (Simpset ({bounds, depth, context, ...}, _)) = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

355 
map_simpset1 (fn (rules, prems, _, _, _) => (rules, prems, bounds, depth, context)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

356 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

357 
fun the_context (Simpset ({context = SOME ctxt, ...}, _)) = ctxt 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

358 
 the_context _ = raise Fail "Simplifier: no proof context in simpset"; 
10413  359 

17897  360 
fun context ctxt = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

361 
map_simpset1 (fn (rules, prems, bounds, depth, _) => (rules, prems, bounds, depth, SOME ctxt)); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

362 

42360  363 
val global_context = context o Proof_Context.init_global; 
17897  364 

27312
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

365 
fun activate_context thy ss = 
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

366 
let 
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

367 
val ctxt = the_context ss; 
36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset

368 
val ctxt' = ctxt 
42360  369 
> Context.raw_transfer (Theory.merge (thy, Proof_Context.theory_of ctxt)) 
36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset

370 
> Context_Position.set_visible false; 
27312
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

371 
in context ctxt' ss end; 
17897  372 

36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset

373 
fun with_context ctxt f ss = inherit_context ss (f (context ctxt ss)); 
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset

374 

17897  375 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

376 
(* maintain simp rules *) 
10413  377 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

378 
(* FIXME: it seems that the conditions on extra variables are too liberal if 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

379 
prems are nonempty: does solving the prems really guarantee instantiation of 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

380 
all its Vars? Better: a dynamic check each time a rule is applied. 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

381 
*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

382 
fun rewrite_rule_extra_vars prems elhs erhs = 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

383 
let 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

384 
val elhss = elhs :: prems; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

385 
val tvars = fold Term.add_tvars elhss []; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

386 
val vars = fold Term.add_vars elhss []; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

387 
in 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

388 
erhs > Term.exists_type (Term.exists_subtype 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

389 
(fn TVar v => not (member (op =) tvars v)  _ => false)) orelse 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

390 
erhs > Term.exists_subterm 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

391 
(fn Var v => not (member (op =) vars v)  _ => false) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

392 
end; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

393 

8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

394 
fun rrule_extra_vars elhs thm = 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

395 
rewrite_rule_extra_vars [] (term_of elhs) (Thm.full_prop_of thm); 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

396 

15023  397 
fun mk_rrule2 {thm, name, lhs, elhs, perm} = 
398 
let 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

399 
val t = term_of elhs; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

400 
val fo = Pattern.first_order t orelse not (Pattern.pattern t); 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

401 
val extra = rrule_extra_vars elhs thm; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

402 
in {thm = thm, name = name, lhs = lhs, elhs = elhs, extra = extra, fo = fo, perm = perm} end; 
10413  403 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

404 
fun del_rrule (rrule as {thm, elhs, ...}) ss = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

405 
ss > map_simpset1 (fn (rules, prems, bounds, depth, context) => 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

406 
(Net.delete_term eq_rrule (term_of elhs, rrule) rules, prems, bounds, depth, context)) 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

407 
handle Net.DELETE => (cond_warn_thm "Rewrite rule not in simpset:" ss thm; ss); 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

408 

32797  409 
fun insert_rrule (rrule as {thm, name, ...}) ss = 
22254  410 
(trace_named_thm (fn () => "Adding rewrite rule") ss (thm, name); 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

411 
ss > map_simpset1 (fn (rules, prems, bounds, depth, context) => 
15023  412 
let 
413 
val rrule2 as {elhs, ...} = mk_rrule2 rrule; 

16807  414 
val rules' = Net.insert_term eq_rrule (term_of elhs, rrule2) rules; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

415 
in (rules', prems, bounds, depth, context) end) 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

416 
handle Net.INSERT => (cond_warn_thm "Ignoring duplicate rewrite rule:" ss thm; ss)); 
10413  417 

418 
fun vperm (Var _, Var _) = true 

419 
 vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t) 

420 
 vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2) 

421 
 vperm (t, u) = (t = u); 

422 

423 
fun var_perm (t, u) = 

33038  424 
vperm (t, u) andalso eq_set (op =) (Term.add_vars t [], Term.add_vars u []); 
10413  425 

15023  426 
(*simple test for looping rewrite rules and stupid orientations*) 
18208  427 
fun default_reorient thy prems lhs rhs = 
15023  428 
rewrite_rule_extra_vars prems lhs rhs 
429 
orelse 

430 
is_Var (head_of lhs) 

431 
orelse 

16305  432 
(* turns t = x around, which causes a headache if x is a local variable  
433 
usually it is very useful :( 

434 
is_Free rhs andalso not(is_Free lhs) andalso not(Logic.occs(rhs,lhs)) 

435 
andalso not(exists_subterm is_Var lhs) 

436 
orelse 

437 
*) 

16842  438 
exists (fn t => Logic.occs (lhs, t)) (rhs :: prems) 
15023  439 
orelse 
17203  440 
null prems andalso Pattern.matches thy (lhs, rhs) 
10413  441 
(*the condition "null prems" is necessary because conditional rewrites 
442 
with extra variables in the conditions may terminate although 

15023  443 
the rhs is an instance of the lhs; example: ?m < ?n ==> f(?n) == f(?m)*) 
444 
orelse 

445 
is_Const lhs andalso not (is_Const rhs); 

10413  446 

447 
fun decomp_simp thm = 

15023  448 
let 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

449 
val thy = Thm.theory_of_thm thm; 
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

450 
val prop = Thm.prop_of thm; 
15023  451 
val prems = Logic.strip_imp_prems prop; 
452 
val concl = Drule.strip_imp_concl (Thm.cprop_of thm); 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

453 
val (lhs, rhs) = Thm.dest_equals concl handle TERM _ => 
15023  454 
raise SIMPLIFIER ("Rewrite rule not a metaequality", thm); 
20579  455 
val elhs = Thm.dest_arg (Thm.cprop_of (Thm.eta_conversion lhs)); 
18929  456 
val erhs = Envir.eta_contract (term_of rhs); 
15023  457 
val perm = 
458 
var_perm (term_of elhs, erhs) andalso 

459 
not (term_of elhs aconv erhs) andalso 

460 
not (is_Var (term_of elhs)); 

16458  461 
in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end; 
10413  462 

12783  463 
fun decomp_simp' thm = 
12979
4c76bce4ce39
decomp_simp': use lhs instead of elhs (preserves more bound variable names);
wenzelm
parents:
12783
diff
changeset

464 
let val (_, _, lhs, _, rhs, _) = decomp_simp thm in 
12783  465 
if Thm.nprems_of thm > 0 then raise SIMPLIFIER ("Bad conditional rewrite rule", thm) 
12979
4c76bce4ce39
decomp_simp': use lhs instead of elhs (preserves more bound variable names);
wenzelm
parents:
12783
diff
changeset

466 
else (lhs, rhs) 
12783  467 
end; 
468 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

469 
fun mk_eq_True (ss as Simpset (_, {mk_rews = {mk_eq_True, ...}, ...})) (thm, name) = 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

470 
(case mk_eq_True ss thm of 
15531  471 
NONE => [] 
472 
 SOME eq_True => 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

473 
let 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

474 
val (_, _, lhs, elhs, _, _) = decomp_simp eq_True; 
15023  475 
in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end); 
10413  476 

15023  477 
(*create the rewrite rule and possibly also the eq_True variant, 
478 
in case there are extra vars on the rhs*) 

479 
fun rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm2) = 

480 
let val rrule = {thm = thm, name = name, lhs = lhs, elhs = elhs, perm = false} in 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

481 
if rewrite_rule_extra_vars [] lhs rhs then 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

482 
mk_eq_True ss (thm2, name) @ [rrule] 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

483 
else [rrule] 
10413  484 
end; 
485 

15023  486 
fun mk_rrule ss (thm, name) = 
487 
let val (_, prems, lhs, elhs, rhs, perm) = decomp_simp thm in 

488 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 

489 
else 

490 
(*weak test for loops*) 

491 
if rewrite_rule_extra_vars prems lhs rhs orelse is_Var (term_of elhs) 

492 
then mk_eq_True ss (thm, name) 

493 
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) 

10413  494 
end; 
495 

15023  496 
fun orient_rrule ss (thm, name) = 
18208  497 
let 
498 
val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm; 

499 
val Simpset (_, {mk_rews = {reorient, mk_sym, ...}, ...}) = ss; 

500 
in 

15023  501 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 
16458  502 
else if reorient thy prems lhs rhs then 
503 
if reorient thy prems rhs lhs 

15023  504 
then mk_eq_True ss (thm, name) 
505 
else 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

506 
(case mk_sym ss thm of 
18208  507 
NONE => [] 
508 
 SOME thm' => 

509 
let val (_, _, lhs', elhs', rhs', _) = decomp_simp thm' 

510 
in rrule_eq_True (thm', name, lhs', elhs', rhs', ss, thm) end) 

15023  511 
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) 
10413  512 
end; 
513 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

514 
fun extract_rews (ss as Simpset (_, {mk_rews = {mk, ...}, ...}), thms) = 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

515 
maps (fn thm => map (rpair (Thm.get_name_hint thm)) (mk ss thm)) thms; 
10413  516 

15023  517 
fun extract_safe_rrules (ss, thm) = 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19303
diff
changeset

518 
maps (orient_rrule ss) (extract_rews (ss, [thm])); 
10413  519 

520 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

521 
(* add/del rules explicitly *) 
10413  522 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

523 
fun comb_simps comb mk_rrule (ss, thms) = 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

524 
let 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

525 
val rews = extract_rews (ss, thms); 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

526 
in fold (fold comb o mk_rrule) rews ss end; 
10413  527 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

528 
fun ss addsimps thms = 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

529 
comb_simps insert_rrule (mk_rrule ss) (ss, thms); 
10413  530 

15023  531 
fun ss delsimps thms = 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

532 
comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms); 
15023  533 

27558  534 
fun add_simp thm ss = ss addsimps [thm]; 
535 
fun del_simp thm ss = ss delsimps [thm]; 

15023  536 

30318
3d03190d2864
replaced archaic use of rep_ss by Simplifier.mksimps;
wenzelm
parents:
29269
diff
changeset

537 

15023  538 
(* congs *) 
10413  539 

15531  540 
fun cong_name (Const (a, _)) = SOME a 
541 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

542 
 cong_name _ = NONE; 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13828
diff
changeset

543 

15023  544 
local 
545 

546 
fun is_full_cong_prems [] [] = true 

547 
 is_full_cong_prems [] _ = false 

548 
 is_full_cong_prems (p :: prems) varpairs = 

549 
(case Logic.strip_assums_concl p of 

550 
Const ("==", _) $ lhs $ rhs => 

551 
let val (x, xs) = strip_comb lhs and (y, ys) = strip_comb rhs in 

552 
is_Var x andalso forall is_Bound xs andalso 

20972  553 
not (has_duplicates (op =) xs) andalso xs = ys andalso 
20671  554 
member (op =) varpairs (x, y) andalso 
19303  555 
is_full_cong_prems prems (remove (op =) (x, y) varpairs) 
15023  556 
end 
557 
 _ => false); 

558 

559 
fun is_full_cong thm = 

10413  560 
let 
43597  561 
val prems = Thm.prems_of thm and concl = Thm.concl_of thm; 
15023  562 
val (lhs, rhs) = Logic.dest_equals concl; 
563 
val (f, xs) = strip_comb lhs and (g, ys) = strip_comb rhs; 

10413  564 
in 
20972  565 
f = g andalso not (has_duplicates (op =) (xs @ ys)) andalso length xs = length ys andalso 
15023  566 
is_full_cong_prems prems (xs ~~ ys) 
10413  567 
end; 
568 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

569 
fun mk_cong (ss as Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f ss; 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

570 

f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

571 
in 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

572 

f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

573 
fun add_eqcong thm ss = ss > 
15023  574 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
575 
let 

45621  576 
val (lhs, _) = Logic.dest_equals (Thm.concl_of thm) 
15023  577 
handle TERM _ => raise SIMPLIFIER ("Congruence not a metaequality", thm); 
18929  578 
(*val lhs = Envir.eta_contract lhs;*) 
45621  579 
val a = the (cong_name (head_of lhs)) handle Option.Option => 
15023  580 
raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm); 
22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

581 
val (xs, weak) = congs; 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

582 
val _ = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

583 
if AList.defined (op =) xs a 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

584 
then if_visible ss warning ("Overwriting congruence rule for " ^ quote a) 
22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

585 
else (); 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

586 
val xs' = AList.update (op =) (a, thm) xs; 
22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

587 
val weak' = if is_full_cong thm then weak else a :: weak; 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

588 
in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 
10413  589 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

590 
fun del_eqcong thm ss = ss > 
15023  591 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
592 
let 

45621  593 
val (lhs, _) = Logic.dest_equals (Thm.concl_of thm) 
594 
handle TERM _ => raise SIMPLIFIER ("Congruence not a metaequality", thm); 

18929  595 
(*val lhs = Envir.eta_contract lhs;*) 
20057  596 
val a = the (cong_name (head_of lhs)) handle Option.Option => 
15023  597 
raise SIMPLIFIER ("Congruence must start with a constant", thm); 
22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

598 
val (xs, _) = congs; 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

599 
val xs' = filter_out (fn (x : string, _) => x = a) xs; 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

600 
val weak' = xs' > map_filter (fn (a, thm) => 
15531  601 
if is_full_cong thm then NONE else SOME a); 
22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

602 
in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 
10413  603 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

604 
fun add_cong thm ss = add_eqcong (mk_cong ss thm) ss; 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset

605 
fun del_cong thm ss = del_eqcong (mk_cong ss thm) ss; 
15023  606 

607 
end; 

10413  608 

609 

15023  610 
(* simprocs *) 
611 

22234  612 
datatype simproc = 
613 
Simproc of 

614 
{name: string, 

615 
lhss: cterm list, 

616 
proc: morphism > simpset > cterm > thm option, 

617 
id: stamp * thm list}; 

618 

619 
fun eq_simproc (Simproc {id = id1, ...}, Simproc {id = id2, ...}) = eq_procid (id1, id2); 

22008  620 

45290  621 
fun transform_simproc phi (Simproc {name, lhss, proc, id = (s, ths)}) = 
22234  622 
Simproc 
623 
{name = name, 

624 
lhss = map (Morphism.cterm phi) lhss, 

22669  625 
proc = Morphism.transform phi proc, 
22234  626 
id = (s, Morphism.fact phi ths)}; 
627 

628 
fun make_simproc {name, lhss, proc, identifier} = 

629 
Simproc {name = name, lhss = lhss, proc = proc, id = (stamp (), identifier)}; 

22008  630 

631 
fun mk_simproc name lhss proc = 

22234  632 
make_simproc {name = name, lhss = lhss, proc = fn _ => fn ss => fn ct => 
42360  633 
proc (Proof_Context.theory_of (the_context ss)) ss (Thm.term_of ct), identifier = []}; 
22008  634 

35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35408
diff
changeset

635 
(* FIXME avoid global thy and Logic.varify_global *) 
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset

636 
fun simproc_global_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify_global); 
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset

637 
fun simproc_global thy name = simproc_global_i thy name o map (Syntax.read_term_global thy); 
22008  638 

639 

15023  640 
local 
10413  641 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

642 
fun add_proc (proc as Proc {name, lhs, ...}) ss = 
22254  643 
(trace_cterm false (fn () => "Adding simplification procedure " ^ quote name ^ " for") ss lhs; 
15023  644 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  645 
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, 
15023  646 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
647 
handle Net.INSERT => 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

648 
(if_visible ss warning ("Ignoring duplicate simplification procedure " ^ quote name); ss)); 
10413  649 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

650 
fun del_proc (proc as Proc {name, lhs, ...}) ss = 
15023  651 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  652 
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, 
15023  653 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
654 
handle Net.DELETE => 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

655 
(if_visible ss warning ("Simplification procedure " ^ quote name ^ " not in simpset"); ss); 
10413  656 

22234  657 
fun prep_procs (Simproc {name, lhss, proc, id}) = 
22669  658 
lhss > map (fn lhs => Proc {name = name, lhs = lhs, proc = Morphism.form proc, id = id}); 
22234  659 

15023  660 
in 
10413  661 

22234  662 
fun ss addsimprocs ps = fold (fold add_proc o prep_procs) ps ss; 
663 
fun ss delsimprocs ps = fold (fold del_proc o prep_procs) ps ss; 

10413  664 

15023  665 
end; 
10413  666 

667 

668 
(* mk_rews *) 

669 

15023  670 
local 
671 

18208  672 
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True, reorient}, 
15023  673 
termless, subgoal_tac, loop_tacs, solvers) => 
18208  674 
let 
675 
val (mk', mk_cong', mk_sym', mk_eq_True', reorient') = 

676 
f (mk, mk_cong, mk_sym, mk_eq_True, reorient); 

677 
val mk_rews' = {mk = mk', mk_cong = mk_cong', mk_sym = mk_sym', mk_eq_True = mk_eq_True', 

678 
reorient = reorient'}; 

679 
in (congs, procs, mk_rews', termless, subgoal_tac, loop_tacs, solvers) end); 

15023  680 

681 
in 

10413  682 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

683 
fun mksimps (ss as Simpset (_, {mk_rews = {mk, ...}, ...})) = mk ss; 
30318
3d03190d2864
replaced archaic use of rep_ss by Simplifier.mksimps;
wenzelm
parents:
29269
diff
changeset

684 

45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

685 
fun set_mksimps mk = map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True, reorient) => 
18208  686 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 
15023  687 

45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

688 
fun set_mkcong mk_cong = map_mk_rews (fn (mk, _, mk_sym, mk_eq_True, reorient) => 
18208  689 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 
10413  690 

45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

691 
fun set_mksym mk_sym = map_mk_rews (fn (mk, mk_cong, _, mk_eq_True, reorient) => 
18208  692 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 
10413  693 

45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

694 
fun set_mkeqTrue mk_eq_True = map_mk_rews (fn (mk, mk_cong, mk_sym, _, reorient) => 
18208  695 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 
696 

697 
fun set_reorient reorient = map_mk_rews (fn (mk, mk_cong, mk_sym, mk_eq_True, _) => 

698 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

15023  699 

700 
end; 

701 

14242
ec70653a02bf
Added access to the mk_rews field (and friends).
skalberg
parents:
14040
diff
changeset

702 

10413  703 
(* termless *) 
704 

45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

705 
fun set_termless termless = 
15023  706 
map_simpset2 (fn (congs, procs, mk_rews, _, subgoal_tac, loop_tacs, solvers) => 
707 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

708 

107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

709 

15023  710 
(* tactics *) 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

711 

45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset

712 
fun set_subgoaler subgoal_tac = 
15023  713 
map_simpset2 (fn (congs, procs, mk_rews, termless, _, loop_tacs, solvers) => 
714 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

715 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

716 
fun ss setloop' tac = ss > 
15023  717 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, _, solvers) => 
718 
(congs, procs, mk_rews, termless, subgoal_tac, [("", tac)], solvers)); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

719 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

720 
fun ss setloop tac = ss setloop' (K tac); 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

721 

b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

722 
fun ss addloop' (name, tac) = ss > 
15023  723 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
724 
(congs, procs, mk_rews, termless, subgoal_tac, 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

725 
(if AList.defined (op =) loop_tacs name 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

726 
then if_visible ss warning ("Overwriting looper " ^ quote name) 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

727 
else (); AList.update (op =) (name, tac) loop_tacs), solvers)); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

728 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

729 
fun ss addloop (name, tac) = ss addloop' (name, K tac); 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

730 

15023  731 
fun ss delloop name = ss > 
732 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 

21286
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

733 
(congs, procs, mk_rews, termless, subgoal_tac, 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

734 
(if AList.defined (op =) loop_tacs name then () 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

735 
else if_visible ss warning ("No such looper in simpset: " ^ quote name); 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

736 
AList.delete (op =) name loop_tacs), solvers)); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

737 

15023  738 
fun ss setSSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
739 
subgoal_tac, loop_tacs, (unsafe_solvers, _)) => 

740 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, (unsafe_solvers, [solver]))); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

741 

15023  742 
fun ss addSSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
743 
subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless, 

22717  744 
subgoal_tac, loop_tacs, (unsafe_solvers, insert eq_solver solver solvers))); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

745 

15023  746 
fun ss setSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
747 
subgoal_tac, loop_tacs, (_, solvers)) => (congs, procs, mk_rews, termless, 

748 
subgoal_tac, loop_tacs, ([solver], solvers))); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

749 

15023  750 
fun ss addSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
751 
subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless, 

22717  752 
subgoal_tac, loop_tacs, (insert eq_solver solver unsafe_solvers, solvers))); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

753 

15023  754 
fun set_solvers solvers = map_simpset2 (fn (congs, procs, mk_rews, termless, 
755 
subgoal_tac, loop_tacs, _) => (congs, procs, mk_rews, termless, 

756 
subgoal_tac, loop_tacs, (solvers, solvers))); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

757 

107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

758 

18208  759 
(* empty *) 
760 

761 
fun init_ss mk_rews termless subgoal_tac solvers = 

32738  762 
make_simpset ((Net.empty, [], (0, []), (0, Unsynchronized.ref false), NONE), 
18208  763 
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); 
764 

765 
fun clear_ss (ss as Simpset (_, {mk_rews, termless, subgoal_tac, solvers, ...})) = 

766 
init_ss mk_rews termless subgoal_tac solvers 

767 
> inherit_context ss; 

768 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

769 
val empty_ss = 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

770 
init_ss 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

771 
{mk = fn _ => fn th => if can Logic.dest_equals (Thm.concl_of th) then [th] else [], 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

772 
mk_cong = K I, 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

773 
mk_sym = K (SOME o Drule.symmetric_fun), 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

774 
mk_eq_True = K (K NONE), 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

775 
reorient = default_reorient} 
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset

776 
Term_Ord.termless (K (K no_tac)) ([], []); 
18208  777 

778 

779 
(* merge *) (*NOTE: ignores some fields of 2nd simpset*) 

780 

781 
fun merge_ss (ss1, ss2) = 

24358  782 
if pointer_eq (ss1, ss2) then ss1 
783 
else 

784 
let 

785 
val Simpset ({rules = rules1, prems = prems1, bounds = bounds1, depth = depth1, context = _}, 

786 
{congs = (congs1, weak1), procs = procs1, mk_rews, termless, subgoal_tac, 

787 
loop_tacs = loop_tacs1, solvers = (unsafe_solvers1, solvers1)}) = ss1; 

788 
val Simpset ({rules = rules2, prems = prems2, bounds = bounds2, depth = depth2, context = _}, 

789 
{congs = (congs2, weak2), procs = procs2, mk_rews = _, termless = _, subgoal_tac = _, 

790 
loop_tacs = loop_tacs2, solvers = (unsafe_solvers2, solvers2)}) = ss2; 

30356  791 

24358  792 
val rules' = Net.merge eq_rrule (rules1, rules2); 
33520  793 
val prems' = Thm.merge_thms (prems1, prems2); 
24358  794 
val bounds' = if #1 bounds1 < #1 bounds2 then bounds2 else bounds1; 
795 
val depth' = if #1 depth1 < #1 depth2 then depth2 else depth1; 

31298  796 
val congs' = merge (Thm.eq_thm_prop o pairself #2) (congs1, congs2); 
24358  797 
val weak' = merge (op =) (weak1, weak2); 
798 
val procs' = Net.merge eq_proc (procs1, procs2); 

799 
val loop_tacs' = AList.merge (op =) (K true) (loop_tacs1, loop_tacs2); 

800 
val unsafe_solvers' = merge eq_solver (unsafe_solvers1, unsafe_solvers2); 

801 
val solvers' = merge eq_solver (solvers1, solvers2); 

802 
in 

803 
make_simpset ((rules', prems', bounds', depth', NONE), ((congs', weak'), procs', 

804 
mk_rews, termless, subgoal_tac, loop_tacs', (unsafe_solvers', solvers'))) 

805 
end; 

18208  806 

807 

30356  808 
(* dest_ss *) 
809 

810 
fun dest_ss (Simpset ({rules, ...}, {congs, procs, loop_tacs, solvers, ...})) = 

811 
{simps = Net.entries rules 

812 
> map (fn {name, thm, ...} => (name, thm)), 

813 
procs = Net.entries procs 

814 
> map (fn Proc {name, lhs, id, ...} => ((name, lhs), id)) 

815 
> partition_eq (eq_snd eq_procid) 

816 
> map (fn ps => (fst (fst (hd ps)), map (snd o fst) ps)), 

30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

817 
congs = #1 congs, 
30356  818 
weak_congs = #2 congs, 
819 
loopers = map fst loop_tacs, 

820 
unsafe_solvers = map solver_name (#1 solvers), 

821 
safe_solvers = map solver_name (#2 solvers)}; 

822 

823 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

824 

10413  825 
(** rewriting **) 
826 

827 
(* 

828 
Uses conversions, see: 

829 
L C Paulson, A higherorder implementation of rewriting, 

830 
Science of Computer Programming 3 (1983), pages 119149. 

831 
*) 

832 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

833 
fun check_conv msg ss thm thm' = 
10413  834 
let 
36944  835 
val thm'' = Thm.transitive thm thm' handle THM _ => 
836 
Thm.transitive thm (Thm.transitive 

837 
(Thm.symmetric (Drule.beta_eta_conversion (Thm.lhs_of thm'))) thm') 

22254  838 
in if msg then trace_thm (fn () => "SUCCEEDED") ss thm' else (); SOME thm'' end 
10413  839 
handle THM _ => 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

840 
let 
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

841 
val _ $ _ $ prop0 = Thm.prop_of thm; 
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

842 
in 
22254  843 
trace_thm (fn () => "Proved wrong thm (Check subgoaler?)") ss thm'; 
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

844 
trace_term false (fn () => "Should have proved:") ss prop0; 
15531  845 
NONE 
10413  846 
end; 
847 

848 

849 
(* mk_procrule *) 

850 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

851 
fun mk_procrule ss thm = 
15023  852 
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in 
853 
if rewrite_rule_extra_vars prems lhs rhs 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

854 
then (cond_warn_thm "Extra vars on rhs:" ss thm; []) 
15023  855 
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] 
10413  856 
end; 
857 

858 

15023  859 
(* rewritec: conversion to apply the meta simpset to a term *) 
10413  860 

15023  861 
(*Since the rewriting strategy is bottomup, we avoid renormalizing already 
862 
normalized terms by carrying around the rhs of the rewrite rule just 

863 
applied. This is called the `skeleton'. It is decomposed in parallel 

864 
with the term. Once a Var is encountered, the corresponding term is 

865 
already in normal form. 

866 
skel0 is a dummy skeleton that is to enforce complete normalization.*) 

867 

10413  868 
val skel0 = Bound 0; 
869 

15023  870 
(*Use rhs as skeleton only if the lhs does not contain unnormalized bits. 
871 
The latter may happen iff there are weak congruence rules for constants 

872 
in the lhs.*) 

10413  873 

15023  874 
fun uncond_skel ((_, weak), (lhs, rhs)) = 
875 
if null weak then rhs (*optimization*) 

20671  876 
else if exists_Const (member (op =) weak o #1) lhs then skel0 
15023  877 
else rhs; 
878 

879 
(*Behaves like unconditional rule if rhs does not contain vars not in the lhs. 

880 
Otherwise those vars may become instantiated with unnormalized terms 

881 
while the premises are solved.*) 

882 

32797  883 
fun cond_skel (args as (_, (lhs, rhs))) = 
33038  884 
if subset (op =) (Term.add_vars rhs [], Term.add_vars lhs []) then uncond_skel args 
10413  885 
else skel0; 
886 

887 
(* 

15023  888 
Rewriting  we try in order: 
10413  889 
(1) beta reduction 
890 
(2) unconditional rewrite rules 

891 
(3) conditional rewrite rules 

892 
(4) simplification procedures 

893 

894 
IMPORTANT: rewrite rules must not introduce new Vars or TVars! 

895 
*) 

896 

16458  897 
fun rewritec (prover, thyt, maxt) ss t = 
10413  898 
let 
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

899 
val ctxt = the_context ss; 
15023  900 
val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss; 
10413  901 
val eta_thm = Thm.eta_conversion t; 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

902 
val eta_t' = Thm.rhs_of eta_thm; 
10413  903 
val eta_t = term_of eta_t'; 
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

904 
fun rew {thm, name, lhs, elhs, extra, fo, perm} = 
10413  905 
let 
32797  906 
val prop = Thm.prop_of thm; 
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

907 
val (rthm, elhs') = 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

908 
if maxt = ~1 orelse not extra then (thm, elhs) 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

909 
else (Thm.incr_indexes (maxt + 1) thm, Thm.incr_indexes_cterm (maxt + 1) elhs); 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

910 
val insts = 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

911 
if fo then Thm.first_order_match (elhs', eta_t') 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

912 
else Thm.match (elhs', eta_t'); 
10413  913 
val thm' = Thm.instantiate insts (Thm.rename_boundvars lhs eta_t rthm); 
14643  914 
val prop' = Thm.prop_of thm'; 
21576  915 
val unconditional = (Logic.count_prems prop' = 0); 
10413  916 
val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop') 
917 
in 

11295  918 
if perm andalso not (termless (rhs', lhs')) 
22254  919 
then (trace_named_thm (fn () => "Cannot apply permutative rewrite rule") ss (thm, name); 
920 
trace_thm (fn () => "Term does not become smaller:") ss thm'; NONE) 

921 
else (trace_named_thm (fn () => "Applying instance of rewrite rule") ss (thm, name); 

10413  922 
if unconditional 
923 
then 

22254  924 
(trace_thm (fn () => "Rewriting:") ss thm'; 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

925 
let 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

926 
val lr = Logic.dest_equals prop; 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

927 
val SOME thm'' = check_conv false ss eta_thm thm'; 
15531  928 
in SOME (thm'', uncond_skel (congs, lr)) end) 
10413  929 
else 
22254  930 
(trace_thm (fn () => "Trying to rewrite:") ss thm'; 
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

931 
if simp_depth ss > Config.get ctxt simp_depth_limit 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

932 
then 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

933 
let 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

934 
val s = "simp_depth_limit exceeded  giving up"; 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

935 
val _ = trace false (fn () => s) ss; 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

936 
val _ = if_visible ss warning s; 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

937 
in NONE end 
16042  938 
else 
939 
case prover ss thm' of 

22254  940 
NONE => (trace_thm (fn () => "FAILED") ss thm'; NONE) 
15531  941 
 SOME thm2 => 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

942 
(case check_conv true ss eta_thm thm2 of 
15531  943 
NONE => NONE  
944 
SOME thm2' => 

10413  945 
let val concl = Logic.strip_imp_concl prop 
946 
val lr = Logic.dest_equals concl 

16042  947 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  948 
end 
949 

15531  950 
fun rews [] = NONE 
10413  951 
 rews (rrule :: rrules) = 
15531  952 
let val opt = rew rrule handle Pattern.MATCH => NONE 
953 
in case opt of NONE => rews rrules  some => some end; 

10413  954 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

955 
fun sort_rrules rrs = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

956 
let 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

957 
fun is_simple ({thm, ...}: rrule) = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

958 
(case Thm.prop_of thm of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

959 
Const ("==", _) $ _ $ _ => true 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

960 
 _ => false); 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

961 
fun sort [] (re1, re2) = re1 @ re2 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

962 
 sort (rr :: rrs) (re1, re2) = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

963 
if is_simple rr 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

964 
then sort rrs (rr :: re1, re2) 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

965 
else sort rrs (re1, rr :: re2); 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

966 
in sort rrs ([], []) end; 
10413  967 

15531  968 
fun proc_rews [] = NONE 
15023  969 
 proc_rews (Proc {name, proc, lhs, ...} :: ps) = 
17203  970 
if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then 
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset

971 
(debug_term false (fn () => "Trying procedure " ^ quote name ^ " on:") ss eta_t; 
23938  972 
case proc ss eta_t' of 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

973 
NONE => (debug false (fn () => "FAILED") ss; proc_rews ps) 
15531  974 
 SOME raw_thm => 
22254  975 
(trace_thm (fn () => "Procedure " ^ quote name ^ " produced rewrite rule:") 
976 
ss raw_thm; 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

977 
(case rews (mk_procrule ss raw_thm) of 
22254  978 
NONE => (trace_cterm true (fn () => "IGNORED result of simproc " ^ quote name ^ 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

979 
"  does not match") ss t; proc_rews ps) 
10413  980 
 some => some))) 
981 
else proc_rews ps; 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

982 
in 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

983 
(case eta_t of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

984 
Abs _ $ _ => SOME (Thm.transitive eta_thm (Thm.beta_conversion false eta_t'), skel0) 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

985 
 _ => 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

986 
(case rews (sort_rrules (Net.match_term rules eta_t)) of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

987 
NONE => proc_rews (Net.match_term procs eta_t) 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

988 
 some => some)) 
10413  989 
end; 
990 

991 

992 
(* conversion to apply a congruence rule to a term *) 

993 

30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

994 
fun congc prover ss maxt cong t = 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

995 
let val rthm = Thm.incr_indexes (maxt + 1) cong; 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

996 
val rlhs = fst (Thm.dest_equals (Drule.strip_imp_concl (cprop_of rthm))); 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

997 
val insts = Thm.match (rlhs, t) 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

998 
(* Thm.match can raise Pattern.MATCH; 
10413  999 
is handled when congc is called *) 
1000 
val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm); 

32797  1001 
val _ = trace_thm (fn () => "Applying congruence rule:") ss thm'; 
22254  1002 
fun err (msg, thm) = (trace_thm (fn () => msg) ss thm; NONE) 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1003 
in 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1004 
(case prover thm' of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1005 
NONE => err ("Congruence proof failed. Could not prove", thm') 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1006 
 SOME thm2 => 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1007 
(case check_conv true ss (Drule.beta_eta_conversion t) thm2 of 
15531  1008 
NONE => err ("Congruence proof failed. Should not have proved", thm2) 
1009 
 SOME thm2' => 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1010 
if op aconv (pairself term_of (Thm.dest_equals (cprop_of thm2'))) 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1011 
then NONE else SOME thm2')) 
10413  1012 
end; 
1013 

1014 
val (cA, (cB, cC)) = 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1015 
apsnd Thm.dest_equals (Thm.dest_implies (hd (cprems_of Drule.imp_cong))); 
10413  1016 

15531  1017 
fun transitive1 NONE NONE = NONE 
1018 
 transitive1 (SOME thm1) NONE = SOME thm1 

1019 
 transitive1 NONE (SOME thm2) = SOME thm2 

36944  1020 
 transitive1 (SOME thm1) (SOME thm2) = SOME (Thm.transitive thm1 thm2) 
10413  1021 

15531  1022 
fun transitive2 thm = transitive1 (SOME thm); 
1023 
fun transitive3 thm = transitive1 thm o SOME; 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1024 

16458  1025 
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = 
10413  1026 
let 
15023  1027 
fun botc skel ss t = 
15531  1028 
if is_Var skel then NONE 
10413  1029 
else 
15023  1030 
(case subc skel ss t of 
15531  1031 
some as SOME thm1 => 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1032 
(case rewritec (prover, thy, maxidx) ss (Thm.rhs_of thm1) of 
15531  1033 
SOME (thm2, skel2) => 
36944  1034 
transitive2 (Thm.transitive thm1 thm2) 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1035 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1036 
 NONE => some) 
1037 
 NONE => 

16458  1038 
(case rewritec (prover, thy, maxidx) ss t of 
15531  1039 
SOME (thm2, skel2) => transitive2 thm2 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1040 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1041 
 NONE => NONE)) 
10413  1042 

15023  1043 
and try_botc ss t = 
1044 
(case botc skel0 ss t of 

36944  1045 
SOME trec1 => trec1  NONE => (Thm.reflexive t)) 
10413  1046 

15023  1047 
and subc skel (ss as Simpset ({bounds, ...}, {congs, ...})) t0 = 
10413  1048 
(case term_of t0 of 
32797  1049 
Abs (a, T, _) => 
15023  1050 
let 
20079
ec5c8584487c
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20057
diff
changeset

1051 
val b = Name.bound (#1 bounds); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1052 
val (v, t') = Thm.dest_abs (SOME b) t0; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1053 
val b' = #1 (Term.dest_Free (Thm.term_of v)); 
21962  1054 
val _ = 
1055 
if b <> b' then 

35231  1056 
warning ("Simplifier: renamed bound variable " ^ 
1057 
quote b ^ " to " ^ quote b' ^ Position.str_of (Position.thread_data ())) 

21962  1058 
else (); 
17614  1059 
val ss' = add_bound ((b', T), a) ss; 
15023  1060 
val skel' = case skel of Abs (_, _, sk) => sk  _ => skel0; 
1061 
in case botc skel' ss' t' of 

36944  1062 
SOME thm => SOME (Thm.abstract_rule a v thm) 
15531  1063 
 NONE => NONE 
10413  1064 
end 
1065 
 t $ _ => (case t of 

15023  1066 
Const ("==>", _) $ _ => impc t0 ss 
10413  1067 
 Abs _ => 
36944  1068 
let val thm = Thm.beta_conversion false t0 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1069 
in case subc skel0 ss (Thm.rhs_of thm) of 
15531  1070 
NONE => SOME thm 
36944  1071 
 SOME thm' => SOME (Thm.transitive thm thm') 
10413  1072 
end 
1073 
 _ => 

1074 
let fun appc () = 

1075 
let 

1076 
val (tskel, uskel) = case skel of 

1077 
tskel $ uskel => (tskel, uskel) 

1078 
 _ => (skel0, skel0); 

10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset

1079 
val (ct, cu) = Thm.dest_comb t0 
10413  1080 
in 
15023  1081 
(case botc tskel ss ct of 
15531  1082 
SOME thm1 => 
15023  1083 
(case botc uskel ss cu of 
36944  1084 
SOME thm2 => SOME (Thm.combination thm1 thm2) 
1085 
 NONE => SOME (Thm.combination thm1 (Thm.reflexive cu))) 

15531  1086 
 NONE => 
15023  1087 
(case botc uskel ss cu of 
36944  1088 
SOME thm1 => SOME (Thm.combination (Thm.reflexive ct) thm1) 
15531  1089 
 NONE => NONE)) 
10413  1090 
end 
1091 
val (h, ts) = strip_comb t 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13828
diff
changeset

1092 
in case cong_name h of 
15531  1093 
SOME a => 
17232  1094 
(case AList.lookup (op =) (fst congs) a of 
15531  1095 
NONE => appc () 
1096 
 SOME cong => 

15023  1097 
(*post processing: some partial applications h t1 ... tj, j <= length ts, 
1098 
may be a redex. Example: map (%x. x) = (%xs. xs) wrt map_cong*) 

10413  1099 
(let 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1100 
val thm = congc (prover ss) ss maxidx cong t0; 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1101 
val t = the_default t0 (Option.map Thm.rhs_of thm); 
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset

1102 
val (cl, cr) = Thm.dest_comb t 
10413  1103 
val dVar = Var(("", 0), dummyT) 
1104 
val skel = 

1105 
list_comb (h, replicate (length ts) dVar) 

15023  1106 
in case botc skel ss cl of 
15531  1107 
NONE => thm 
1108 
 SOME thm' => transitive3 thm 

36944  1109 
(Thm.combination thm' (Thm.reflexive cr)) 
20057  1110 
end handle Pattern.MATCH => appc ())) 
10413  1111 
 _ => appc () 
1112 
end) 

15531  1113 
 _ => NONE) 
10413  1114 

15023  1115 
and impc ct ss = 
1116 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  1117 

15023  1118 
and rules_of_prem ss prem = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1119 
if maxidx_of_term (term_of prem) <> ~1 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1120 
then (trace_cterm true 
22254  1121 
(fn () => "Cannot add premise as rewrite rule because it contains (type) unknowns:") 
1122 
ss prem; ([], NONE)) 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1123 
else 
36944  1124 
let val asm = Thm.assume prem 
15531  1125 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1126 

15023  1127 
and add_rrules (rrss, asms) ss = 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

1128 
(fold o fold) insert_rrule rrss ss > add_prems (map_filter I asms) 
10413  1129 

23178  1130 
and disch r prem eq = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1131 
let 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1132 
val (lhs, rhs) = Thm.dest_equals (Thm.cprop_of eq); 
36944  1133 
val eq' = Thm.implies_elim (Thm.instantiate 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1134 
([], [(cA, prem), (cB, lhs), (cC, rhs)]) Drule.imp_cong) 
36944  1135 
(Thm.implies_intr prem eq) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1136 
in if not r then eq' else 
10413  1137 
let 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1138 
val (prem', concl) = Thm.dest_implies lhs; 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1139 
val (prem'', _) = Thm.dest_implies rhs 
36944  1140 
in Thm.transitive (Thm.transitive 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1141 
(Thm.instantiate ([], [(cA, prem'), (cB, prem), (cC, concl)]) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1142 
Drule.swap_prems_eq) eq') 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1143 
(Thm.instantiate ([], [(cA, prem), (cB, prem''), (cC, concl)]) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1144 
Drule.swap_prems_eq) 
10413  1145 
end 
1146 
end 

1147 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1148 
and rebuild [] _ _ _ _ eq = eq 
32797  1149 
 rebuild (prem :: prems) concl (_ :: rrss) (_ :: asms) ss eq = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1150 
let 
15023  1151 
val ss' = add_rrules (rev rrss, rev asms) ss; 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1152 
val concl' = 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1153 
Drule.mk_implies (prem, the_default concl (Option.map Thm.rhs_of eq)); 
23178  1154 
val dprem = Option.map (disch false prem) 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1155 
in 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1156 
(case rewritec (prover, thy, maxidx) ss' concl' of 
15531  1157 
NONE => rebuild prems concl' rrss asms ss (dprem eq) 
23178  1158 
 SOME (eq', _) => transitive2 (fold (disch false) 
1159 
prems (the (transitive3 (dprem eq) eq'))) 

38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1160 
(mut_impc0 (rev prems) (Thm.rhs_of eq') (rev rrss) (rev asms) ss)) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1161 
end 
15023  1162 

1163 
and mut_impc0 prems concl rrss asms ss = 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1164 
let 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1165 
val prems' = strip_imp_prems concl; 
15023  1166 
val (rrss', asms') = split_list (map (rules_of_prem ss) prems') 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1167 
in 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1168 
mut_impc (prems @ prems') (strip_imp_concl concl) (rrss @ rrss') 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1169 
(asms @ asms') [] [] [] [] ss ~1 ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1170 
end 
15023  1171 

1172 
and mut_impc [] concl [] [] prems' rrss' asms' eqns ss changed k = 

33245  1173 
transitive1 (fold (fn (eq1, prem) => fn eq2 => transitive1 eq1 
1174 
(Option.map (disch false prem) eq2)) (eqns ~~ prems') NONE) 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1175 
(if changed > 0 then 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1176 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1177 
[] [] [] [] ss ~1 changed 
1178 
else rebuild prems' concl rrss' asms' ss 

1179 
(botc skel0 (add_rrules (rev rrss', rev asms') ss) concl)) 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1180 

6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1181 
 mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) 
15023  1182 
prems' rrss' asms' eqns ss changed k = 
15531  1183 
case (if k = 0 then NONE else botc skel0 (add_rrules 
15023  1184 
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of 
15531  1185 
NONE => mut_impc prems concl rrss asms (prem :: prems') 
1186 
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1187 
(if k = 0 then 0 else k  1) 
15531  1188 
 SOME eqn => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1189 
let 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1190 
val prem' = Thm.rhs_of eqn; 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1191 
val tprems = map term_of prems; 
33029  1192 
val i = 1 + fold Integer.max (map (fn p => 
44058  1193 
find_index (fn q => q aconv p) tprems) (Thm.hyps_of eqn)) ~1; 
15023  1194 
val (rrs', asm') = rules_of_prem ss prem' 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1195 
in mut_impc prems concl rrss asms (prem' :: prems') 
23178  1196 
(rrs' :: rrss') (asm' :: asms') (SOME (fold_rev (disch true) 
33957  1197 
(take i prems) 
36944  1198 
(Drule.imp_cong_rule eqn (Thm.reflexive (Drule.list_implies 
33957  1199 
(drop i prems, concl))))) :: eqns) 
20671  1200 
ss (length prems') ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1201 
end 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1202 

15023  1203 
(*legacy code  only for backwards compatibility*) 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1204 
and nonmut_impc ct ss = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1205 
let 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1206 
val (prem, conc) = Thm.dest_implies ct; 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1207 
val thm1 = if simprem then botc skel0 ss prem else NONE; 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1208 
val prem1 = the_default prem (Option.map Thm.rhs_of thm1); 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1209 
val ss1 = 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1210 
if not useprem then ss 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1211 
else add_rrules (apsnd single (apfst single (rules_of_prem ss prem1))) ss 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1212 
in 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1213 
(case botc skel0 ss1 conc of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1214 
NONE => 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1215 
(case thm1 of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1216 
NONE => NONE 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1217 
 SOME thm1' => SOME (Drule.imp_cong_rule thm1' (Thm.reflexive conc))) 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1218 
 SOME thm2 => 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1219 
let val thm2' = disch false prem1 thm2 in 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1220 
(case thm1 of 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1221 
NONE => SOME thm2' 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1222 
 SOME thm1' => 
36944  1223 
SOME (Thm.transitive (Drule.imp_cong_rule thm1' (Thm.reflexive conc)) thm2')) 
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1224 
end) 
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset

1225 
end 
10413  1226 

15023  1227 
in try_botc end; 
10413  1228 

1229 

15023  1230 
(* Metarewriting: rewrites t to u and returns the theorem t==u *) 
10413  1231 

1232 
(* 

1233 
Parameters: 

1234 
mode = (simplify A, 

1235 
use A in simplifying B, 

1236 
use prems of B (if B is again a metaimpl.) to simplify A) 

1237 
when simplifying A ==> B 

1238 
prover: how to solve premises in conditional rewrites and congruences 

1239 
*) 

1240 

32738  1241 
val debug_bounds = Unsynchronized.ref false; 
17705  1242 

21962  1243 
fun check_bounds ss ct = 
1244 
if ! debug_bounds then 

1245 
let 
