author  wenzelm 
Sun, 08 Mar 2009 12:15:58 +0100  
changeset 30356  36d0e00af606 
parent 30336  efd1bec4630a 
child 30552  58db56278478 
permissions  rwrr 
10413  1 
(* Title: Pure/meta_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 

11672  4 
Metalevel Simplification. 
10413  5 
*) 
6 

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

7 
infix 4 
15023  8 
addsimps delsimps addeqcongs deleqcongs addcongs delcongs addsimprocs delsimprocs 
15199  9 
setmksimps setmkcong setmksym setmkeqTrue settermless setsubgoaler 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

11 

11672  12 
signature BASIC_META_SIMPLIFIER = 
13 
sig 

15023  14 
val debug_simp: bool ref 
11672  15 
val trace_simp: bool ref 
16042  16 
val trace_simp_depth_limit: int ref 
15023  17 
type rrule 
16807  18 
val eq_rrule: rrule * rrule > bool 
15023  19 
type cong 
20 
type simpset 

21 
type proc 

17614  22 
type solver 
23 
val mk_solver': string > (simpset > int > tactic) > solver 

24 
val mk_solver: string > (thm list > int > tactic) > solver 

15023  25 
val empty_ss: simpset 
26 
val merge_ss: simpset * simpset > simpset 

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

29 
procs: (string * cterm list) list, 

30 
congs: (string * thm) list, 

31 
weak_congs: string list, 

32 
loopers: string list, 

33 
unsafe_solvers: string list, 

34 
safe_solvers: string list} 

15023  35 
type simproc 
22234  36 
val eq_simproc: simproc * simproc > bool 
37 
val morph_simproc: morphism > simproc > simproc 

38 
val make_simproc: {name: string, lhss: cterm list, 

39 
proc: morphism > simpset > cterm > thm option, identifier: thm list} > simproc 

22008  40 
val mk_simproc: string > cterm list > (theory > simpset > term > thm option) > simproc 
15023  41 
val add_prems: thm list > simpset > simpset 
42 
val prems_of_ss: simpset > thm list 

43 
val addsimps: simpset * thm list > simpset 

44 
val delsimps: simpset * thm list > simpset 

45 
val addeqcongs: simpset * thm list > simpset 

46 
val deleqcongs: simpset * thm list > simpset 

47 
val addcongs: simpset * thm list > simpset 

48 
val delcongs: simpset * thm list > simpset 

49 
val addsimprocs: simpset * simproc list > simpset 

50 
val delsimprocs: simpset * simproc list > simpset 

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

51 
val mksimps: simpset > thm > thm list 
15023  52 
val setmksimps: simpset * (thm > thm list) > simpset 
53 
val setmkcong: simpset * (thm > thm) > simpset 

54 
val setmksym: simpset * (thm > thm option) > simpset 

55 
val setmkeqTrue: simpset * (thm > thm option) > simpset 

56 
val settermless: simpset * (term * term > bool) > simpset 

57 
val setsubgoaler: simpset * (simpset > int > tactic) > simpset 

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

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

60 
val addloop': simpset * (string * (simpset > int > tactic)) > simpset 
15023  61 
val addloop: simpset * (string * (int > tactic)) > simpset 
62 
val delloop: simpset * string > simpset 

63 
val setSSolver: simpset * solver > simpset 

64 
val addSSolver: simpset * solver > simpset 

65 
val setSolver: simpset * solver > simpset 

66 
val addSolver: simpset * solver > simpset 

21708  67 

68 
val rewrite_rule: thm list > thm > thm 

69 
val rewrite_goals_rule: thm list > thm > thm 

70 
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

71 
val rewrite_goal_tac: thm list > int > tactic 
21708  72 
val rewtac: thm > tactic 
73 
val prune_params_tac: tactic 

74 
val fold_rule: thm list > thm > thm 

75 
val fold_goals_tac: thm list > tactic 

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

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

77 

10413  78 
signature META_SIMPLIFIER = 
79 
sig 

11672  80 
include BASIC_META_SIMPLIFIER 
10413  81 
exception SIMPLIFIER of string * thm 
30336  82 
val internal_ss: simpset > 
83 
{rules: rrule Net.net, 

84 
prems: thm list, 

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

86 
depth: int * bool ref, 

87 
context: Proof.context option} * 

88 
{congs: (string * cong) list * string list, 

89 
procs: proc Net.net, 

90 
mk_rews: 

91 
{mk: thm > thm list, 

92 
mk_cong: thm > thm, 

93 
mk_sym: thm > thm option, 

94 
mk_eq_True: thm > thm option, 

95 
reorient: theory > term list > term > term > bool}, 

96 
termless: term * term > bool, 

97 
subgoal_tac: simpset > int > tactic, 

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

99 
solvers: solver list * solver list} 

27558  100 
val add_simp: thm > simpset > simpset 
101 
val del_simp: thm > simpset > simpset 

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

102 
val solver: simpset > solver > int > tactic 
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

103 
val simp_depth_limit_value: Config.value Config.T 
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

104 
val simp_depth_limit: int Config.T 
15023  105 
val clear_ss: simpset > simpset 
16458  106 
val simproc_i: theory > string > term list 
107 
> (theory > simpset > term > thm option) > simproc 

108 
val simproc: theory > string > string list 

109 
> (theory > simpset > term > thm option) > simproc 

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

110 
val inherit_context: simpset > simpset > simpset 
20289  111 
val the_context: simpset > Proof.context 
112 
val context: Proof.context > simpset > simpset 

17897  113 
val theory_context: theory > simpset > simpset 
17723  114 
val debug_bounds: bool ref 
18208  115 
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

116 
val set_solvers: solver list > simpset > simpset 
23598  117 
val rewrite_cterm: bool * bool * bool > (simpset > thm > thm option) > simpset > conv 
16458  118 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  119 
val rewrite_thm: bool * bool * bool > 
120 
(simpset > thm > thm option) > simpset > thm > thm 

121 
val rewrite_goal_rule: bool * bool * bool > 

122 
(simpset > thm > thm option) > simpset > int > thm > thm 

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

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

124 
(simpset > tactic) > simpset > int > tactic 
21605  125 
val norm_hhf: thm > thm 
126 
val norm_hhf_protect: thm > thm 

23598  127 
val rewrite: bool > thm list > conv 
21708  128 
val simplify: bool > thm list > thm > thm 
10413  129 
end; 
130 

15023  131 
structure MetaSimplifier: META_SIMPLIFIER = 
10413  132 
struct 
133 

15023  134 
(** datatype simpset **) 
135 

136 
(* rewrite rules *) 

10413  137 

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

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

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

140 
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

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

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

143 
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

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

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

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

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

15023  153 
in which case fomatching is complete, 
10413  154 
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

155 
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

156 
*) 
10413  157 

158 
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

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

161 

162 
(* congruences *) 

163 

164 
type cong = {thm: thm, lhs: cterm}; 

10413  165 

12603  166 
fun eq_cong ({thm = thm1, ...}: cong, {thm = thm2, ...}: cong) = 
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22254
diff
changeset

167 
Thm.eq_thm_prop (thm1, thm2); 
10413  168 

169 

17614  170 
(* simplification sets, procedures, and solvers *) 
15023  171 

172 
(*A simpset contains data required during conversion: 

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

175 
bounds: maximal index of bound variables already used 
15023  176 
(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

177 
depth: simp_depth and exceeded flag; 
10413  178 
congs: association list of congruence rules and 
179 
a list of `weak' congruence constants. 

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

181 
procs: discrimination net of simplification procedures 

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

15023  183 
mk_rews: 
184 
mk: turn simplification thms into rewrite rules; 

185 
mk_cong: prepare congruence rules; 

186 
mk_sym: turn == around; 

187 
mk_eq_True: turn P into P == True; 

188 
termless: relation for ordered rewriting;*) 

15011  189 

15023  190 
type mk_rews = 
191 
{mk: thm > thm list, 

192 
mk_cong: thm > thm, 

193 
mk_sym: thm > thm option, 

18208  194 
mk_eq_True: thm > thm option, 
195 
reorient: theory > term list > term > term > bool}; 

15023  196 

197 
datatype simpset = 

198 
Simpset of 

199 
{rules: rrule Net.net, 

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

201 
bounds: int * ((string * typ) * string) list, 
23938  202 
depth: int * bool ref, 
20289  203 
context: Proof.context option} * 
15023  204 
{congs: (string * cong) list * string list, 
205 
procs: proc Net.net, 

206 
mk_rews: mk_rews, 

11504  207 
termless: term * term > bool, 
15011  208 
subgoal_tac: simpset > int > tactic, 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

209 
loop_tacs: (string * (simpset > int > tactic)) list, 
15023  210 
solvers: solver list * solver list} 
211 
and proc = 

212 
Proc of 

213 
{name: string, 

214 
lhs: cterm, 

22008  215 
proc: simpset > cterm > thm option, 
22234  216 
id: stamp * thm list} 
17614  217 
and solver = 
218 
Solver of 

219 
{name: string, 

220 
solver: simpset > int > tactic, 

15023  221 
id: stamp}; 
222 

223 

30336  224 
fun internal_ss (Simpset args) = args; 
10413  225 

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

226 
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

227 
{rules = rules, prems = prems, bounds = bounds, depth = depth, context = context}; 
15023  228 

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

229 
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

230 
make_ss1 (f (rules, prems, bounds, depth, context)); 
10413  231 

15023  232 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
233 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

234 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

235 

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

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

238 

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

10413  240 

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

241 
fun map_simpset f (Simpset ({rules, prems, bounds, depth, context}, 
15023  242 
{congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers})) = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

243 
make_simpset (f ((rules, prems, bounds, depth, context), 
15023  244 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers))); 
10413  245 

15023  246 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
247 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

248 

17614  249 
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems; 
250 

22234  251 
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

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

255 
fun mk_solver' name solver = Solver {name = name, solver = solver, id = stamp ()}; 

256 
fun mk_solver name solver = mk_solver' name (solver o prems_of_ss); 

257 

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

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

259 
fun solver ss (Solver {solver = tac, ...}) = tac ss; 
17614  260 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 
261 

15023  262 

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

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

264 

24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

265 
val simp_depth_limit_value = Config.declare false "simp_depth_limit" (Config.Int 100); 
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

266 
val simp_depth_limit = Config.int simp_depth_limit_value; 
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

267 

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

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

269 

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

270 
fun trace_depth (Simpset ({depth = (depth, exceeded), ...}, _)) msg = 
23938  271 
if depth > ! trace_simp_depth_limit then 
272 
if ! exceeded then () else (tracing "trace_simp_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

273 
else 
23938  274 
(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

275 

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

276 
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

277 
(rules, prems, bounds, 
23938  278 
(depth + 1, if depth = ! trace_simp_depth_limit then 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

279 

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

280 
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

281 

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

282 

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

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

284 

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

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

286 

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

287 
val debug_simp = ref false; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

289 

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

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

291 

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

292 
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

293 

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

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

295 
let 
20146  296 
val names = Term.declare_term_names t Name.context; 
297 
val xs = rev (#1 (Name.variants (rev (map #2 bs)) names)); 

17614  298 
fun subst (((b, T), _), x') = (Free (b, T), Syntax.mark_boundT (x', T)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

299 
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

300 

17705  301 
in 
302 

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

303 
fun print_term ss warn a thy t = prnt ss warn (a ^ "\n" ^ 
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26626
diff
changeset

304 
Syntax.string_of_term_global thy (if ! debug_simp then t else show_bounds ss t)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

305 

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

306 
fun debug warn a ss = if ! debug_simp then prnt ss warn (a ()) else (); 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

307 
fun trace warn a ss = if ! trace_simp then prnt ss warn (a ()) else (); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

308 

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

309 
fun debug_term warn a ss thy t = if ! debug_simp then print_term ss warn (a ()) thy t else (); 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

310 
fun trace_term warn a ss thy t = if ! trace_simp then print_term ss warn (a ()) thy t else (); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

311 

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

312 
fun trace_cterm warn a ss ct = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

313 
if ! trace_simp then print_term ss warn (a ()) (Thm.theory_of_cterm ct) (Thm.term_of ct) 
22254  314 
else (); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

315 

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

316 
fun trace_thm a ss th = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

317 
if ! trace_simp then print_term ss false (a ()) (Thm.theory_of_thm th) (Thm.full_prop_of th) 
22254  318 
else (); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

319 

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

320 
fun trace_named_thm a ss (th, name) = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

322 
print_term ss false (if name = "" then a () else a () ^ " " ^ quote name ^ ":") 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

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

325 

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

326 
fun warn_thm a ss th = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

327 
print_term 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

328 

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

329 
fun cond_warn_thm a (ss as Simpset ({context, ...}, _)) th = 
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

330 
if is_some context then () else warn_thm a ss th; 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

331 

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

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

333 

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

334 

10413  335 

336 
(** simpset operations **) 

337 

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

338 
(* context *) 
10413  339 

17614  340 
fun eq_bound (x: string, (y, _)) = x = y; 
341 

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

342 
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

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

344 

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

345 
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

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

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

349 
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

350 

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

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

352 
 the_context _ = raise Fail "Simplifier: no proof context in simpset"; 
10413  353 

17897  354 
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

355 
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

356 

21516  357 
val theory_context = context o ProofContext.init; 
17897  358 

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

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

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

361 
val ctxt = the_context ss; 
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

362 
val ctxt' = Context.transfer_proof (Theory.merge (thy, ProofContext.theory_of ctxt)) ctxt; 
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

363 
in context ctxt' ss end; 
17897  364 

365 

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

366 
(* maintain simp rules *) 
10413  367 

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

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

369 
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

370 
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

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

372 
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

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

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

375 
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

376 
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

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

378 
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

379 
(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

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

381 
(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

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

383 

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

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

385 
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

386 

15023  387 
fun mk_rrule2 {thm, name, lhs, elhs, perm} = 
388 
let 

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

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

390 
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

391 
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

392 
in {thm = thm, name = name, lhs = lhs, elhs = elhs, extra = extra, fo = fo, perm = perm} end; 
10413  393 

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

394 
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

395 
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

396 
(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

397 
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

398 

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

399 
fun insert_rrule (rrule as {thm, name, elhs, ...}) ss = 
22254  400 
(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

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

16807  404 
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

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

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

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

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

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

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

412 

413 
fun var_perm (t, u) = 

20197
ffc64d90fc1f
use Term.add_vars instead of obsolete term_varnames;
wenzelm
parents:
20146
diff
changeset

414 
vperm (t, u) andalso gen_eq_set (op =) (Term.add_vars t [], Term.add_vars u []); 
10413  415 

15023  416 
(*simple test for looping rewrite rules and stupid orientations*) 
18208  417 
fun default_reorient thy prems lhs rhs = 
15023  418 
rewrite_rule_extra_vars prems lhs rhs 
419 
orelse 

420 
is_Var (head_of lhs) 

421 
orelse 

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

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

425 
andalso not(exists_subterm is_Var lhs) 

426 
orelse 

427 
*) 

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

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

435 
is_Const lhs andalso not (is_Const rhs); 

10413  436 

437 
fun decomp_simp thm = 

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

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

440 
val prop = Thm.prop_of thm; 
15023  441 
val prems = Logic.strip_imp_prems prop; 
442 
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

443 
val (lhs, rhs) = Thm.dest_equals concl handle TERM _ => 
15023  444 
raise SIMPLIFIER ("Rewrite rule not a metaequality", thm); 
20579  445 
val elhs = Thm.dest_arg (Thm.cprop_of (Thm.eta_conversion lhs)); 
16665  446 
val elhs = if term_of elhs aconv term_of lhs then lhs else elhs; (*share identical copies*) 
18929  447 
val erhs = Envir.eta_contract (term_of rhs); 
15023  448 
val perm = 
449 
var_perm (term_of elhs, erhs) andalso 

450 
not (term_of elhs aconv erhs) andalso 

451 
not (is_Var (term_of elhs)); 

16458  452 
in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end; 
10413  453 

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

455 
let val (_, _, lhs, _, rhs, _) = decomp_simp thm in 
12783  456 
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

457 
else (lhs, rhs) 
12783  458 
end; 
459 

15023  460 
fun mk_eq_True (Simpset (_, {mk_rews = {mk_eq_True, ...}, ...})) (thm, name) = 
461 
(case mk_eq_True thm of 

15531  462 
NONE => [] 
463 
 SOME eq_True => 

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

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

465 
val (_, _, lhs, elhs, _, _) = decomp_simp eq_True; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

466 
val extra = rrule_extra_vars elhs eq_True; 
15023  467 
in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end); 
10413  468 

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

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

472 
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

473 
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

474 
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

475 
else [rrule] 
10413  476 
end; 
477 

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

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

481 
else 

482 
(*weak test for loops*) 

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

484 
then mk_eq_True ss (thm, name) 

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

10413  486 
end; 
487 

15023  488 
fun orient_rrule ss (thm, name) = 
18208  489 
let 
490 
val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm; 

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

492 
in 

15023  493 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 
16458  494 
else if reorient thy prems lhs rhs then 
495 
if reorient thy prems rhs lhs 

15023  496 
then mk_eq_True ss (thm, name) 
497 
else 

18208  498 
(case mk_sym thm of 
499 
NONE => [] 

500 
 SOME thm' => 

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

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

15023  503 
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) 
10413  504 
end; 
505 

15199  506 
fun extract_rews (Simpset (_, {mk_rews = {mk, ...}, ...}), thms) = 
27865
27a8ad9612a3
moved basic thm operations from structure PureThy to Thm (cf. more_thm.ML);
wenzelm
parents:
27582
diff
changeset

507 
maps (fn thm => map (rpair (Thm.get_name_hint thm)) (mk thm)) thms; 
10413  508 

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

510 
maps (orient_rrule ss) (extract_rews (ss, [thm])); 
10413  511 

512 

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

513 
(* add/del rules explicitly *) 
10413  514 

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

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

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

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

518 
in fold (fold comb o mk_rrule) rews ss end; 
10413  519 

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

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

521 
comb_simps insert_rrule (mk_rrule ss) (ss, thms); 
10413  522 

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

524 
comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms); 
15023  525 

27558  526 
fun add_simp thm ss = ss addsimps [thm]; 
527 
fun del_simp thm ss = ss delsimps [thm]; 

15023  528 

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

529 

15023  530 
(* congs *) 
10413  531 

15531  532 
fun cong_name (Const (a, _)) = SOME a 
533 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

534 
 cong_name _ = NONE; 

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

535 

15023  536 
local 
537 

538 
fun is_full_cong_prems [] [] = true 

539 
 is_full_cong_prems [] _ = false 

540 
 is_full_cong_prems (p :: prems) varpairs = 

541 
(case Logic.strip_assums_concl p of 

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

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

544 
is_Var x andalso forall is_Bound xs andalso 

20972  545 
not (has_duplicates (op =) xs) andalso xs = ys andalso 
20671  546 
member (op =) varpairs (x, y) andalso 
19303  547 
is_full_cong_prems prems (remove (op =) (x, y) varpairs) 
15023  548 
end 
549 
 _ => false); 

550 

551 
fun is_full_cong thm = 

10413  552 
let 
15023  553 
val prems = prems_of thm and concl = concl_of thm; 
554 
val (lhs, rhs) = Logic.dest_equals concl; 

555 
val (f, xs) = strip_comb lhs and (g, ys) = strip_comb rhs; 

10413  556 
in 
20972  557 
f = g andalso not (has_duplicates (op =) (xs @ ys)) andalso length xs = length ys andalso 
15023  558 
is_full_cong_prems prems (xs ~~ ys) 
10413  559 
end; 
560 

15023  561 
fun add_cong (ss, thm) = ss > 
562 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 

563 
let 

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

564 
val (lhs, _) = Thm.dest_equals (Drule.strip_imp_concl (Thm.cprop_of thm)) 
15023  565 
handle TERM _ => raise SIMPLIFIER ("Congruence not a metaequality", thm); 
18929  566 
(*val lhs = Envir.eta_contract lhs;*) 
20057  567 
val a = the (cong_name (head_of (term_of lhs))) handle Option.Option => 
15023  568 
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

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

570 
val _ = if AList.defined (op =) xs a 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

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

572 
else (); 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

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

574 
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

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

15023  577 
fun del_cong (ss, thm) = ss > 
578 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 

579 
let 

580 
val (lhs, _) = Logic.dest_equals (Thm.concl_of thm) handle TERM _ => 

581 
raise SIMPLIFIER ("Congruence not a metaequality", thm); 

18929  582 
(*val lhs = Envir.eta_contract lhs;*) 
20057  583 
val a = the (cong_name (head_of lhs)) handle Option.Option => 
15023  584 
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

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

586 
val xs' = filter_out (fn (x : string, _) => x = a) xs; 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

587 
val weak' = xs' > map_filter (fn (a, {thm, ...}: cong) => 
15531  588 
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

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

15023  591 
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f; 
592 

593 
in 

594 

15570  595 
val (op addeqcongs) = Library.foldl add_cong; 
596 
val (op deleqcongs) = Library.foldl del_cong; 

15023  597 

598 
fun ss addcongs congs = ss addeqcongs map (mk_cong ss) congs; 

599 
fun ss delcongs congs = ss deleqcongs map (mk_cong ss) congs; 

600 

601 
end; 

10413  602 

603 

15023  604 
(* simprocs *) 
605 

22234  606 
datatype simproc = 
607 
Simproc of 

608 
{name: string, 

609 
lhss: cterm list, 

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

611 
id: stamp * thm list}; 

612 

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

22008  614 

22234  615 
fun morph_simproc phi (Simproc {name, lhss, proc, id = (s, ths)}) = 
616 
Simproc 

617 
{name = name, 

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

22669  619 
proc = Morphism.transform phi proc, 
22234  620 
id = (s, Morphism.fact phi ths)}; 
621 

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

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

22008  624 

625 
fun mk_simproc name lhss proc = 

22234  626 
make_simproc {name = name, lhss = lhss, proc = fn _ => fn ss => fn ct => 
627 
proc (ProofContext.theory_of (the_context ss)) ss (Thm.term_of ct), identifier = []}; 

22008  628 

629 
(* FIXME avoid global thy and Logic.varify *) 

630 
fun simproc_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify); 

24707  631 
fun simproc thy name = simproc_i thy name o map (Syntax.read_term_global thy); 
22008  632 

633 

15023  634 
local 
10413  635 

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

636 
fun add_proc (proc as Proc {name, lhs, ...}) ss = 
22254  637 
(trace_cterm false (fn () => "Adding simplification procedure " ^ quote name ^ " for") ss lhs; 
15023  638 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  639 
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, 
15023  640 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
641 
handle Net.INSERT => 

642 
(warning ("Ignoring duplicate simplification procedure " ^ quote name); ss)); 

10413  643 

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

644 
fun del_proc (proc as Proc {name, lhs, ...}) ss = 
15023  645 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  646 
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, 
15023  647 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
648 
handle Net.DELETE => 

649 
(warning ("Simplification procedure " ^ quote name ^ " not in simpset"); ss); 

10413  650 

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

15023  654 
in 
10413  655 

22234  656 
fun ss addsimprocs ps = fold (fold add_proc o prep_procs) ps ss; 
657 
fun ss delsimprocs ps = fold (fold del_proc o prep_procs) ps ss; 

10413  658 

15023  659 
end; 
10413  660 

661 

662 
(* mk_rews *) 

663 

15023  664 
local 
665 

18208  666 
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True, reorient}, 
15023  667 
termless, subgoal_tac, loop_tacs, solvers) => 
18208  668 
let 
669 
val (mk', mk_cong', mk_sym', mk_eq_True', reorient') = 

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

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

672 
reorient = reorient'}; 

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

15023  674 

675 
in 

10413  676 

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

678 

18208  679 
fun ss setmksimps mk = ss > map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True, reorient) => 
680 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

15023  681 

18208  682 
fun ss setmkcong mk_cong = ss > map_mk_rews (fn (mk, _, mk_sym, mk_eq_True, reorient) => 
683 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

10413  684 

18208  685 
fun ss setmksym mk_sym = ss > map_mk_rews (fn (mk, mk_cong, _, mk_eq_True, reorient) => 
686 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

10413  687 

18208  688 
fun ss setmkeqTrue mk_eq_True = ss > map_mk_rews (fn (mk, mk_cong, mk_sym, _, reorient) => 
689 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

690 

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

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

15023  693 

694 
end; 

695 

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

696 

10413  697 
(* termless *) 
698 

15023  699 
fun ss settermless termless = ss > 
700 
map_simpset2 (fn (congs, procs, mk_rews, _, subgoal_tac, loop_tacs, solvers) => 

701 
(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

702 

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

703 

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

705 

15023  706 
fun ss setsubgoaler subgoal_tac = ss > 
707 
map_simpset2 (fn (congs, procs, mk_rews, termless, _, loop_tacs, solvers) => 

708 
(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

709 

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

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

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

713 

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

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

715 

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

716 
fun ss addloop' (name, tac) = ss > 
15023  717 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
718 
(congs, procs, mk_rews, termless, subgoal_tac, 

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

719 
(if AList.defined (op =) loop_tacs name 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

720 
then warning ("Overwriting looper " ^ quote name) 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

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

723 

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

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

725 

15023  726 
fun ss delloop name = ss > 
727 
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

728 
(congs, procs, mk_rews, termless, subgoal_tac, 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

729 
(if AList.defined (op =) loop_tacs name 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

730 
then () 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

731 
else warning ("No such looper in simpset: " ^ quote name); 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

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

733 

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

736 
(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

737 

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

22717  740 
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

741 

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

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

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

745 

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

22717  748 
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

749 

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

752 
subgoal_tac, loop_tacs, (solvers, solvers))); 

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

753 

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

754 

18208  755 
(* empty *) 
756 

757 
fun init_ss mk_rews termless subgoal_tac solvers = 

23938  758 
make_simpset ((Net.empty, [], (0, []), (0, ref false), NONE), 
18208  759 
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); 
760 

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

762 
init_ss mk_rews termless subgoal_tac solvers 

763 
> inherit_context ss; 

764 

765 
val basic_mk_rews: mk_rews = 

766 
{mk = fn th => if can Logic.dest_equals (Thm.concl_of th) then [th] else [], 

767 
mk_cong = I, 

768 
mk_sym = SOME o Drule.symmetric_fun, 

769 
mk_eq_True = K NONE, 

770 
reorient = default_reorient}; 

771 

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

772 
val empty_ss = init_ss basic_mk_rews TermOrd.termless (K (K no_tac)) ([], []); 
18208  773 

774 

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

776 

777 
fun merge_ss (ss1, ss2) = 

24358  778 
if pointer_eq (ss1, ss2) then ss1 
779 
else 

780 
let 

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

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

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

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

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

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

30356  787 

24358  788 
val rules' = Net.merge eq_rrule (rules1, rules2); 
789 
val prems' = merge Thm.eq_thm_prop (prems1, prems2); 

790 
val bounds' = if #1 bounds1 < #1 bounds2 then bounds2 else bounds1; 

791 
val depth' = if #1 depth1 < #1 depth2 then depth2 else depth1; 

792 
val congs' = merge (eq_cong o pairself #2) (congs1, congs2); 

793 
val weak' = merge (op =) (weak1, weak2); 

794 
val procs' = Net.merge eq_proc (procs1, procs2); 

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

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

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

798 
in 

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

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

801 
end; 

18208  802 

803 

30356  804 
(* dest_ss *) 
805 

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

807 
{simps = Net.entries rules 

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

809 
procs = Net.entries procs 

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

811 
> partition_eq (eq_snd eq_procid) 

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

813 
congs = map (fn (name, {thm, ...}) => (name, thm)) (#1 congs), 

814 
weak_congs = #2 congs, 

815 
loopers = map fst loop_tacs, 

816 
unsafe_solvers = map solver_name (#1 solvers), 

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

818 

819 

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

820 

10413  821 
(** rewriting **) 
822 

823 
(* 

824 
Uses conversions, see: 

825 
L C Paulson, A higherorder implementation of rewriting, 

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

827 
*) 

828 

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

829 
fun check_conv msg ss thm thm' = 
10413  830 
let 
25472
3276a14d06a6
check_conv now only performs betaetanormalization when equations
berghofe
parents:
25203
diff
changeset

831 
val thm'' = transitive thm thm' handle THM _ => 
3276a14d06a6
check_conv now only performs betaetanormalization when equations
berghofe
parents:
25203
diff
changeset

832 
transitive thm (transitive 
3276a14d06a6
check_conv now only performs betaetanormalization when equations
berghofe
parents:
25203
diff
changeset

833 
(symmetric (Drule.beta_eta_conversion (Thm.lhs_of thm'))) thm') 
22254  834 
in if msg then trace_thm (fn () => "SUCCEEDED") ss thm' else (); SOME thm'' end 
10413  835 
handle THM _ => 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

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

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

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

839 
in 
22254  840 
trace_thm (fn () => "Proved wrong thm (Check subgoaler?)") ss thm'; 
841 
trace_term false (fn () => "Should have proved:") ss thy prop0; 

15531  842 
NONE 
10413  843 
end; 
844 

845 

846 
(* mk_procrule *) 

847 

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

848 
fun mk_procrule ss thm = 
15023  849 
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in 
850 
if rewrite_rule_extra_vars prems lhs rhs 

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

851 
then (warn_thm "Extra vars on rhs:" ss thm; []) 
15023  852 
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] 
10413  853 
end; 
854 

855 

15023  856 
(* rewritec: conversion to apply the meta simpset to a term *) 
10413  857 

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

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

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

862 
already in normal form. 

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

864 

10413  865 
val skel0 = Bound 0; 
866 

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

869 
in the lhs.*) 

10413  870 

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

20671  873 
else if exists_Const (member (op =) weak o #1) lhs then skel0 
15023  874 
else rhs; 
875 

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

877 
Otherwise those vars may become instantiated with unnormalized terms 

878 
while the premises are solved.*) 

879 

880 
fun cond_skel (args as (congs, (lhs, rhs))) = 

20197
ffc64d90fc1f
use Term.add_vars instead of obsolete term_varnames;
wenzelm
parents:
20146
diff
changeset

881 
if Term.add_vars rhs [] subset Term.add_vars lhs [] then uncond_skel args 
10413  882 
else skel0; 
883 

884 
(* 

15023  885 
Rewriting  we try in order: 
10413  886 
(1) beta reduction 
887 
(2) unconditional rewrite rules 

888 
(3) conditional rewrite rules 

889 
(4) simplification procedures 

890 

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

892 
*) 

893 

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

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

899 
val eta_t' = Thm.rhs_of eta_thm; 
10413  900 
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

901 
fun rew {thm, name, lhs, elhs, extra, fo, perm} = 
10413  902 
let 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

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

904 
val {prop, maxidx, ...} = rep_thm thm; 
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

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

906 
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

907 
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

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

909 
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

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

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

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

10413  920 
if unconditional 
921 
then 

22254  922 
(trace_thm (fn () => "Rewriting:") ss thm'; 
10413  923 
let val lr = Logic.dest_equals prop; 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

928 
if simp_depth ss > Config.get ctxt simp_depth_limit 
16042  929 
then let val s = "simp_depth_limit exceeded  giving up" 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

930 
in trace false (fn () => s) ss; warning s; NONE end 
16042  931 
else 
932 
case prover ss thm' of 

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

935 
(case check_conv true ss eta_thm thm2 of 
15531  936 
NONE => NONE  
937 
SOME thm2' => 

10413  938 
let val concl = Logic.strip_imp_concl prop 
939 
val lr = Logic.dest_equals concl 

16042  940 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  941 
end 
942 

15531  943 
fun rews [] = NONE 
10413  944 
 rews (rrule :: rrules) = 
15531  945 
let val opt = rew rrule handle Pattern.MATCH => NONE 
946 
in case opt of NONE => rews rrules  some => some end; 

10413  947 

948 
fun sort_rrules rrs = let 

14643  949 
fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of 
10413  950 
Const("==",_) $ _ $ _ => true 
12603  951 
 _ => false 
10413  952 
fun sort [] (re1,re2) = re1 @ re2 
12603  953 
 sort (rr::rrs) (re1,re2) = if is_simple rr 
10413  954 
then sort rrs (rr::re1,re2) 
955 
else sort rrs (re1,rr::re2) 

956 
in sort rrs ([],[]) end 

957 

15531  958 
fun proc_rews [] = NONE 
15023  959 
 proc_rews (Proc {name, proc, lhs, ...} :: ps) = 
17203  960 
if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then 
22254  961 
(debug_term false (fn () => "Trying procedure " ^ quote name ^ " on:") ss thyt eta_t; 
23938  962 
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

963 
NONE => (debug false (fn () => "FAILED") ss; proc_rews ps) 
15531  964 
 SOME raw_thm => 
22254  965 
(trace_thm (fn () => "Procedure " ^ quote name ^ " produced rewrite rule:") 
966 
ss raw_thm; 

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

967 
(case rews (mk_procrule ss raw_thm) of 
22254  968 
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

969 
"  does not match") ss t; proc_rews ps) 
10413  970 
 some => some))) 
971 
else proc_rews ps; 

972 
in case eta_t of 

15531  973 
Abs _ $ _ => SOME (transitive eta_thm 
12155
13c5469b4bb3
congc now returns None if congruence rule has no effect.
berghofe
parents:
11886
diff
changeset

974 
(beta_conversion false eta_t'), skel0) 
10413  975 
 _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of 
15531  976 
NONE => proc_rews (Net.match_term procs eta_t) 
10413  977 
 some => some) 
978 
end; 

979 

980 

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

982 

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

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

984 
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

985 
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

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

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

22254  990 
val unit = trace_thm (fn () => "Applying congruence rule:") ss thm'; 
991 
fun err (msg, thm) = (trace_thm (fn () => msg) ss thm; NONE) 

10413  992 
in case prover thm' of 
15531  993 
NONE => err ("Congruence proof failed. Could not prove", thm') 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

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

997 
if op aconv (pairself term_of (Thm.dest_equals (cprop_of thm2'))) 
15531  998 
then NONE else SOME thm2') 
10413  999 
end; 
1000 

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

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

1002 
apsnd Thm.dest_equals (Thm.dest_implies (hd (cprems_of Drule.imp_cong))); 
10413  1003 

15531  1004 
fun transitive1 NONE NONE = NONE 
1005 
 transitive1 (SOME thm1) NONE = SOME thm1 

1006 
 transitive1 NONE (SOME thm2) = SOME thm2 

1007 
 transitive1 (SOME thm1) (SOME thm2) = SOME (transitive thm1 thm2) 

10413  1008 

15531  1009 
fun transitive2 thm = transitive1 (SOME thm); 
1010 
fun transitive3 thm = transitive1 thm o SOME; 

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

1011 

16458  1012 
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = 
10413  1013 
let 
15023  1014 
fun botc skel ss t = 
15531  1015 
if is_Var skel then NONE 
10413  1016 
else 
15023  1017 
(case subc skel ss t of 
15531  1018 
some as SOME thm1 => 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1019 
(case rewritec (prover, thy, maxidx) ss (Thm.rhs_of thm1) of 
15531  1020 
SOME (thm2, skel2) => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1022 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1023 
 NONE => some) 
1024 
 NONE => 

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

1027 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1028 
 NONE => NONE)) 
10413  1029 

15023  1030 
and try_botc ss t = 
1031 
(case botc skel0 ss t of 

15531  1032 
SOME trec1 => trec1  NONE => (reflexive t)) 
10413  1033 

15023  1034 
and subc skel (ss as Simpset ({bounds, ...}, {congs, ...})) t0 = 
10413  1035 
(case term_of t0 of 
1036 
Abs (a, T, t) => 

15023  1037 
let 
20079
ec5c8584487c
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20057
diff
changeset

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

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

1040 
val b' = #1 (Term.dest_Free (Thm.term_of v)); 
21962  1041 
val _ = 
1042 
if b <> b' then 

1043 
warning ("Simplifier: renamed bound variable " ^ quote b ^ " to " ^ quote b') 

1044 
else (); 

17614  1045 
val ss' = add_bound ((b', T), a) ss; 
15023  1046 
val skel' = case skel of Abs (_, _, sk) => sk  _ => skel0; 
1047 
in case botc skel' ss' t' of 

15531  1048 
SOME thm => SOME (abstract_rule a v thm) 
1049 
 NONE => NONE 

10413  1050 
end 
1051 
 t $ _ => (case t of 

15023  1052 
Const ("==>", _) $ _ => impc t0 ss 
10413  1053 
 Abs _ => 
1054 
let val thm = beta_conversion false t0 

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

1055 
in case subc skel0 ss (Thm.rhs_of thm) of 
15531  1056 
NONE => SOME thm 
1057 
 SOME thm' => SOME (transitive thm thm') 

10413  1058 
end 
1059 
 _ => 

1060 
let fun appc () = 

1061 
let 

1062 
val (tskel, uskel) = case skel of 

1063 
tskel $ uskel => (tskel, uskel) 

1064 
 _ => (skel0, skel0); 

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

1065 
val (ct, cu) = Thm.dest_comb t0 
10413  1066 
in 
15023  1067 
(case botc tskel ss ct of 
15531  1068 
SOME thm1 => 
15023  1069 
(case botc uskel ss cu of 
15531  1070 
SOME thm2 => SOME (combination thm1 thm2) 
1071 
 NONE => SOME (combination thm1 (reflexive cu))) 

1072 
 NONE => 

15023  1073 
(case botc uskel ss cu of 
15531  1074 
SOME thm1 => SOME (combination (reflexive ct) thm1) 
1075 
 NONE => NONE)) 

10413  1076 
end 
1077 
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

1078 
in case cong_name h of 
15531  1079 
SOME a => 
17232  1080 
(case AList.lookup (op =) (fst congs) a of 
15531  1081 
NONE => appc () 
1082 
 SOME cong => 

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

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

1086 
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

1087 
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

1088 
val (cl, cr) = Thm.dest_comb t 
10413  1089 
val dVar = Var(("", 0), dummyT) 
1090 
val skel = 

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

15023  1092 
in case botc skel ss cl of 
15531  1093 
NONE => thm 
1094 
 SOME thm' => transitive3 thm 

12155
13c5469b4bb3
congc now returns None if congruence rule has no effect.
berghofe
parents:
11886
diff
changeset

1095 
(combination thm' (reflexive cr)) 
20057  1096 
end handle Pattern.MATCH => appc ())) 
10413  1097 
 _ => appc () 
1098 
end) 

15531  1099 
 _ => NONE) 
10413  1100 

15023  1101 
and impc ct ss = 
1102 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  1103 

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

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

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

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

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

1110 
let val asm = assume prem 
15531  1111 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1112 

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

1114 
(fold o fold) insert_rrule rrss ss > add_prems (map_filter I asms) 
10413  1115 

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

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

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

1119 
val eq' = implies_elim (Thm.instantiate 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1120 
([], [(cA, prem), (cB, lhs), (cC, rhs)]) Drule.imp_cong) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1121 
(implies_intr prem eq) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

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

1126 
in transitive (transitive 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

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

1130 
Drule.swap_prems_eq) 
10413  1131 
end 
1132 
end 

1133 

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

1134 
and rebuild [] _ _ _ _ eq = eq 
15023  1135 
 rebuild (prem :: prems) concl (rrs :: rrss) (asm :: asms) ss eq = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

1139 
Drule.mk_implies (prem, the_default concl (Option.map Thm.rhs_of eq)); 
23178  1140 
val dprem = Option.map (disch false prem) 
16458  1141 
in case rewritec (prover, thy, maxidx) ss' concl' of 
15531  1142 
NONE => rebuild prems concl' rrss asms ss (dprem eq) 
23178  1143 
 SOME (eq', _) => transitive2 (fold (disch false) 
1144 
prems (the (transitive3 (dprem eq) eq'))) 

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

1145 
(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

1146 
end 
15023  1147 

1148 
and mut_impc0 prems concl rrss asms ss = 

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

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

1150 
val prems' = strip_imp_prems concl; 
15023  1151 
val (rrss', asms') = split_list (map (rules_of_prem ss) prems') 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1152 
in mut_impc (prems @ prems') (strip_imp_concl concl) (rrss @ rrss') 
15023  1153 
(asms @ asms') [] [] [] [] ss ~1 ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1154 
end 
15023  1155 

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

15570  1157 
transitive1 (Library.foldl (fn (eq2, (eq1, prem)) => transitive1 eq1 
23178  1158 
(Option.map (disch false prem) eq2)) (NONE, eqns ~~ prems')) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1160 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1161 
[] [] [] [] ss ~1 changed 
1162 
else rebuild prems' concl rrss' asms' ss 

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

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

1164 

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

1165 
 mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) 
15023  1166 
prems' rrss' asms' eqns ss changed k = 
15531  1167 
case (if k = 0 then NONE else botc skel0 (add_rrules 
15023  1168 
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of 
15531  1169 
NONE => mut_impc prems concl rrss asms (prem :: prems') 
1170 
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed 

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

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

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

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

1175 
val tprems = map term_of prems; 
15570  1176 
val i = 1 + Library.foldl Int.max (~1, map (fn p => 
19618  1177 
find_index (fn q => q aconv p) tprems) (#hyps (rep_thm eqn))); 
15023  1178 
val (rrs', asm') = rules_of_prem ss prem' 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1179 
in mut_impc prems concl rrss asms (prem' :: prems') 
23178  1180 
(rrs' :: rrss') (asm' :: asms') (SOME (fold_rev (disch true) 
1181 
(Library.take (i, prems)) 

18470  1182 
(Drule.imp_cong_rule eqn (reflexive (Drule.list_implies 
23178  1183 
(Library.drop (i, prems), concl))))) :: eqns) 
20671  1184 
ss (length prems') ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1186 

15023  1187 
(*legacy code  only for backwards compatibility*) 
1188 
and nonmut_impc ct ss = 

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

1189 
let val (prem, conc) = Thm.dest_implies ct; 
15531  1190 
val thm1 = if simprem then botc skel0 ss prem else NONE; 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1191 
val prem1 = the_default prem (Option.map Thm.rhs_of thm1); 
15023  1192 
val ss1 = if not useprem then ss else add_rrules 
1193 
(apsnd single (apfst single (rules_of_prem ss prem1))) ss 

1194 
in (case botc skel0 ss1 conc of 

15531  1195 
NONE => (case thm1 of 
1196 
NONE => NONE 

18470  1197 
 SOME thm1' => SOME (Drule.imp_cong_rule thm1' (reflexive conc))) 
15531  1198 
 SOME thm2 => 
23178  1199 
let val thm2' = disch false prem1 thm2 
10413  1200 
in (case thm1 of 
15531  1201 
NONE => SOME thm2' 
1202 
 SOME thm1' => 

18470  1203 
SOME (transitive (Drule.imp_cong_rule thm1' (reflexive conc)) thm2')) 
10413  1204 
end) 
1205 
end 

1206 

15023  1207 
in try_botc end; 
10413  1208 

1209 

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

1212 
(* 

1213 
Parameters: 

1214 
mode = (simplify A, 

1215 
use A in simplifying B, 

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

1217 
when simplifying A ==> B 

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

1219 
*) 

1220 

17705  1221 
val debug_bounds = ref false; 
1222 

21962  1223 
fun check_bounds ss ct = 
1224 
if ! debug_bounds then 

1225 
let 

1226 
val Simpset ({bounds = (_, bounds), ...}, _) = ss; 

1227 
val bs = fold_aterms (fn Free (x, _) => 

1228 
if Name.is_bound x andalso not (AList.defined eq_bound bounds x) 

1229 
then insert (op =) x else I 

1230 
 _ => I) (term_of ct) []; 

1231 
in 

1232 
if null bs then () 

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

1233 
else print_term ss true ("Simplifier: term contains loose bounds: " ^ commas_quote bs) 
21962  1234 
(Thm.theory_of_cterm ct) (Thm.term_of ct) 
1235 
end 

1236 
else (); 

17614  1237 

19052
113dbd65319e
rewrite_cterm: Thm.adjust_maxidx prevents unnecessary increments on rules;
wenzelm
parents:
18929
diff
changeset

1238 
fun rewrite_cterm mode prover raw_ss raw_ct = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

1240 
val thy = Thm.theory_of_cterm raw_ct; 
20260  1241 
val ct = Thm.adjust_maxidx_cterm ~1 raw_ct; 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

1242 
val {t, maxidx, ...} = Thm.rep_cterm ct; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1243 
val ss = inc_simp_depth (activate_context thy raw_ss); 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1244 
val depth = simp_depth ss; 
21962  1245 
val _ = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1246 
if depth mod 20 = 0 then 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1247 
warning ("Simplification depth " ^ string_of_int depth) 
21962  1248 
else (); 
22254  1249 
val _ = trace_cterm false (fn () => "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:") ss ct; 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1250 
val _ = check_bounds ss ct; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1251 
in bottomc (mode, Option.map Drule.flexflex_unique oo prover, thy, maxidx) ss ct end; 
10413  1252 

21708  1253 
val simple_prover = 
1254 
SINGLE o (fn ss => ALLGOALS (resolve_tac (prems_of_ss ss))); 

1255 

1256 
fun rewrite _ [] ct = Thm.reflexive ct 

27582  1257 
 rewrite full thms ct = rewrite_cterm (full, false, false) simple_prover 