author  wenzelm 
Tue, 06 Feb 2007 19:32:31 +0100  
changeset 22254  420625970f31 
parent 22234  52ba19aaa9c2 
child 22360  26ead7ed4f4b 
permissions  rwrr 
10413  1 
(* Title: Pure/meta_simplifier.ML 
2 
ID: $Id$ 

11672  3 
Author: Tobias Nipkow and Stefan Berghofer 
10413  4 

11672  5 
Metalevel Simplification. 
10413  6 
*) 
7 

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

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

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

12 

11672  13 
signature BASIC_META_SIMPLIFIER = 
14 
sig 

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

23 
type proc 

17614  24 
type solver 
25 
val mk_solver': string > (simpset > int > tactic) > solver 

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

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

27 
val rep_ss: simpset > 
15023  28 
{rules: rrule Net.net, 
29 
prems: thm list, 

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

30 
bounds: int * ((string * typ) * string) list, 
20289  31 
context: Proof.context option} * 
15023  32 
{congs: (string * cong) list * string list, 
33 
procs: proc Net.net, 

34 
mk_rews: 

35 
{mk: thm > thm list, 

36 
mk_cong: thm > thm, 

37 
mk_sym: thm > thm option, 

18208  38 
mk_eq_True: thm > thm option, 
39 
reorient: theory > term list > term > term > bool}, 

15023  40 
termless: term * term > bool, 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

41 
subgoal_tac: simpset > int > tactic, 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

42 
loop_tacs: (string * (simpset > int > tactic)) list, 
15023  43 
solvers: solver list * solver list} 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

44 
val print_ss: simpset > unit 
15023  45 
val empty_ss: simpset 
46 
val merge_ss: simpset * simpset > simpset 

47 
type simproc 

22234  48 
val eq_simproc: simproc * simproc > bool 
49 
val morph_simproc: morphism > simproc > simproc 

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

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

22008  52 
val mk_simproc: string > cterm list > (theory > simpset > term > thm option) > simproc 
15023  53 
val add_prems: thm list > simpset > simpset 
54 
val prems_of_ss: simpset > thm list 

55 
val addsimps: simpset * thm list > simpset 

56 
val delsimps: simpset * thm list > simpset 

57 
val addeqcongs: simpset * thm list > simpset 

58 
val deleqcongs: simpset * thm list > simpset 

59 
val addcongs: simpset * thm list > simpset 

60 
val delcongs: simpset * thm list > simpset 

61 
val addsimprocs: simpset * simproc list > simpset 

62 
val delsimprocs: simpset * simproc list > simpset 

63 
val setmksimps: simpset * (thm > thm list) > simpset 

64 
val setmkcong: simpset * (thm > thm) > simpset 

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

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

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

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

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

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

71 
val addloop': simpset * (string * (simpset > int > tactic)) > simpset 
15023  72 
val addloop: simpset * (string * (int > tactic)) > simpset 
73 
val delloop: simpset * string > simpset 

74 
val setSSolver: simpset * solver > simpset 

75 
val addSSolver: simpset * solver > simpset 

76 
val setSolver: simpset * solver > simpset 

77 
val addSolver: simpset * solver > simpset 

21708  78 

79 
val rewrite_rule: thm list > thm > thm 

80 
val rewrite_goals_rule: thm list > thm > thm 

81 
val rewrite_goals_tac: thm list > tactic 

82 
val rewrite_tac: thm list > tactic 

83 
val rewtac: thm > tactic 

84 
val prune_params_tac: tactic 

85 
val fold_rule: thm list > thm > thm 

86 
val fold_tac: thm list > tactic 

87 
val fold_goals_tac: thm list > tactic 

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

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

89 

10413  90 
signature META_SIMPLIFIER = 
91 
sig 

11672  92 
include BASIC_META_SIMPLIFIER 
10413  93 
exception SIMPLIFIER of string * thm 
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

94 
val solver: simpset > solver > int > tactic 
15023  95 
val clear_ss: simpset > simpset 
96 
exception SIMPROC_FAIL of string * exn 

16458  97 
val simproc_i: theory > string > term list 
98 
> (theory > simpset > term > thm option) > simproc 

99 
val simproc: theory > string > string list 

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

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

101 
val inherit_context: simpset > simpset > simpset 
20289  102 
val the_context: simpset > Proof.context 
103 
val context: Proof.context > simpset > simpset 

17897  104 
val theory_context: theory > simpset > simpset 
17723  105 
val debug_bounds: bool ref 
18208  106 
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

107 
val set_solvers: solver list > simpset > simpset 
11672  108 
val rewrite_cterm: bool * bool * bool > 
15023  109 
(simpset > thm > thm option) > simpset > cterm > thm 
16458  110 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  111 
val rewrite_thm: bool * bool * bool > 
112 
(simpset > thm > thm option) > simpset > thm > thm 

113 
val rewrite_goal_rule: bool * bool * bool > 

114 
(simpset > thm > thm option) > simpset > int > thm > thm 

21605  115 
val norm_hhf: thm > thm 
116 
val norm_hhf_protect: thm > thm 

21708  117 
val rewrite: bool > thm list > cterm > thm 
118 
val simplify: bool > thm list > thm > thm 

10413  119 
end; 
120 

15023  121 
structure MetaSimplifier: META_SIMPLIFIER = 
10413  122 
struct 
123 

15023  124 

125 
(** datatype simpset **) 

126 

127 
(* rewrite rules *) 

10413  128 

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

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

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

131 
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

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

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

134 
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

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

136 
perm: bool}; (*the rewrite rule is permutative*) 
15023  137 

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

138 
(* 
12603  139 
Remarks: 
10413  140 
 elhs is used for matching, 
15023  141 
lhs only for preservation of bound variable names; 
10413  142 
 fo is set iff 
143 
either elhs is firstorder (no Var is applied), 

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

146 
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

147 
*) 
10413  148 

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

15023  150 
Drule.eq_thm_prop (thm1, thm2); 
151 

152 

153 
(* congruences *) 

154 

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

10413  156 

12603  157 
fun eq_cong ({thm = thm1, ...}: cong, {thm = thm2, ...}: cong) = 
15023  158 
Drule.eq_thm_prop (thm1, thm2); 
10413  159 

160 

17614  161 
(* simplification sets, procedures, and solvers *) 
15023  162 

163 
(*A simpset contains data required during conversion: 

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

166 
bounds: maximal index of bound variables already used 
15023  167 
(for generating new names when rewriting under lambda abstractions); 
10413  168 
congs: association list of congruence rules and 
169 
a list of `weak' congruence constants. 

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

171 
procs: discrimination net of simplification procedures 

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

15023  173 
mk_rews: 
174 
mk: turn simplification thms into rewrite rules; 

175 
mk_cong: prepare congruence rules; 

176 
mk_sym: turn == around; 

177 
mk_eq_True: turn P into P == True; 

178 
termless: relation for ordered rewriting;*) 

15011  179 

15023  180 
type mk_rews = 
181 
{mk: thm > thm list, 

182 
mk_cong: thm > thm, 

183 
mk_sym: thm > thm option, 

18208  184 
mk_eq_True: thm > thm option, 
185 
reorient: theory > term list > term > term > bool}; 

15023  186 

187 
datatype simpset = 

188 
Simpset of 

189 
{rules: rrule Net.net, 

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

191 
bounds: int * ((string * typ) * string) list, 
20289  192 
context: Proof.context option} * 
15023  193 
{congs: (string * cong) list * string list, 
194 
procs: proc Net.net, 

195 
mk_rews: mk_rews, 

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

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

201 
Proc of 

202 
{name: string, 

203 
lhs: cterm, 

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

208 
{name: string, 

209 
solver: simpset > int > tactic, 

15023  210 
id: stamp}; 
211 

212 

213 
fun rep_ss (Simpset args) = args; 

10413  214 

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

215 
fun make_ss1 (rules, prems, bounds, context) = 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

216 
{rules = rules, prems = prems, bounds = bounds, context = context}; 
15023  217 

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

218 
fun map_ss1 f {rules, prems, bounds, context} = 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

219 
make_ss1 (f (rules, prems, bounds, context)); 
10413  220 

15023  221 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
222 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

223 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

224 

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

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

227 

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

10413  229 

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

230 
fun map_simpset f (Simpset ({rules, prems, bounds, context}, 
15023  231 
{congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers})) = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

232 
make_simpset (f ((rules, prems, bounds, context), 
15023  233 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers))); 
10413  234 

15023  235 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
236 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

237 

17614  238 
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems; 
239 

22234  240 
fun eq_procid ((s1: stamp, ths1: thm list), (s2, ths2)) = 
241 
s1 = s2 andalso eq_list eq_thm (ths1, ths2); 

242 
fun eq_proc (Proc {id = id1, ...}, Proc {id = id2, ...}) = eq_procid (id1, id2); 

17614  243 

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

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

246 

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

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

248 
fun solver ss (Solver {solver = tac, ...}) = tac ss; 
17614  249 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 
250 
val merge_solvers = gen_merge_lists eq_solver; 

251 

15023  252 

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

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

254 

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

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

256 

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

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

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

259 
val simp_depth = ref 0; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

260 
val simp_depth_limit = ref 100; 
18573  261 
val trace_simp_depth_limit = ref 1; 
262 
val trace_simp_depth_limit_exceeded = ref false; 

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

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

264 

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

265 
fun println a = 
18573  266 
if ! simp_depth > ! trace_simp_depth_limit 
267 
then if !trace_simp_depth_limit_exceeded then () 

268 
else (tracing "trace_simp_depth_limit exceeded!"; 

269 
trace_simp_depth_limit_exceeded := true) 

270 
else (tracing (enclose "[" "]" (string_of_int (! simp_depth)) ^ a); 

271 
trace_simp_depth_limit_exceeded := false); 

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

272 

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

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

274 

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

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

276 
let 
20146  277 
val names = Term.declare_term_names t Name.context; 
278 
val xs = rev (#1 (Name.variants (rev (map #2 bs)) names)); 

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

280 
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

281 

17705  282 
in 
283 

284 
fun print_term warn a ss thy t = prnt warn (a ^ "\n" ^ 

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

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

286 

22254  287 
fun debug warn a = if ! debug_simp then prnt warn (a ()) else (); 
288 
fun trace warn a = if ! trace_simp then prnt warn (a ()) else (); 

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

289 

22254  290 
fun debug_term warn a ss thy t = if ! debug_simp then print_term warn (a ()) ss thy t else (); 
291 
fun trace_term warn a ss thy t = if ! trace_simp then print_term warn (a ()) ss thy t else (); 

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

292 

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

293 
fun trace_cterm warn a ss ct = 
22254  294 
if ! trace_simp then print_term warn (a ()) ss (Thm.theory_of_cterm ct) (Thm.term_of ct) 
295 
else (); 

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

296 

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

297 
fun trace_thm a ss th = 
22254  298 
if ! trace_simp then print_term false (a ()) ss (Thm.theory_of_thm th) (Thm.full_prop_of th) 
299 
else (); 

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

300 

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

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

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

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

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

306 

17705  307 
fun warn_thm a ss th = print_term true a ss (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

308 

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

309 
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

310 
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

311 

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

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

313 

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

314 

15023  315 
(* print simpsets *) 
10413  316 

15023  317 
fun print_ss ss = 
318 
let 

15034  319 
val pretty_thms = map Display.pretty_thm; 
15023  320 

22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

321 
fun pretty_cong (name, {thm, lhs}) = 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

322 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, Display.pretty_thm thm]; 
15023  323 
fun pretty_proc (name, lhss) = 
324 
Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss); 

15034  325 

326 
val Simpset ({rules, ...}, {congs, procs, loop_tacs, solvers, ...}) = ss; 

16807  327 
val smps = map #thm (Net.entries rules); 
328 
val prcs = Net.entries procs > 

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

22234  330 
> partition_eq (eq_snd eq_procid) 
17756  331 
> map (fn ps => (fst (fst (hd ps)), map (snd o fst) ps)) 
332 
> Library.sort_wrt fst; 

15023  333 
in 
15034  334 
[Pretty.big_list "simplification rules:" (pretty_thms smps), 
335 
Pretty.big_list "simplification procedures:" (map pretty_proc prcs), 

22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

336 
Pretty.big_list "congruences:" (map pretty_cong (fst congs)), 
21286
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

337 
Pretty.strs ("loopers:" :: map (quote o fst) loop_tacs), 
15088  338 
Pretty.strs ("unsafe solvers:" :: map (quote o solver_name) (#1 solvers)), 
339 
Pretty.strs ("safe solvers:" :: map (quote o solver_name) (#2 solvers))] 

15023  340 
> Pretty.chunks > Pretty.writeln 
13828  341 
end; 
10413  342 

15023  343 

10413  344 

345 
(** simpset operations **) 

346 

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

347 
(* context *) 
10413  348 

17614  349 
fun eq_bound (x: string, (y, _)) = x = y; 
350 

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

351 
fun add_bound bound = map_simpset1 (fn (rules, prems, (count, bounds), context) => 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

353 

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

354 
fun add_prems ths = map_simpset1 (fn (rules, prems, bounds, context) => 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

356 

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

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

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

359 

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

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

361 
 the_context _ = raise Fail "Simplifier: no proof context in simpset"; 
10413  362 

17897  363 
fun context ctxt = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

365 

21516  366 
val theory_context = context o ProofContext.init; 
17897  367 

22008  368 
fun activate_context thy (ss as Simpset ({context = SOME ctxt, ...}, _)) = 
369 
context (Context.transfer_proof (Theory.merge (thy, ProofContext.theory_of ctxt)) ctxt) ss 

370 
 activate_context thy ss = 

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

371 
(warning "Simplifier: no proof context in simpset  fallback to theory context!"; 
17897  372 
theory_context thy ss); 
373 

374 

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

375 
(* maintain simp rules *) 
10413  376 

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

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

378 
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

379 
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

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

381 
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

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

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

384 
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

385 
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

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

387 
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

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

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

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

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

392 

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

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

394 
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

395 

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

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

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

399 
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

400 
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

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

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

403 
fun del_rrule (rrule as {thm, elhs, ...}) ss = 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

404 
ss > map_simpset1 (fn (rules, prems, bounds, context) => 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

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

406 
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

407 

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

408 
fun insert_rrule (rrule as {thm, name, elhs, ...}) ss = 
22254  409 
(trace_named_thm (fn () => "Adding rewrite rule") ss (thm, name); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

16807  413 
val rules' = Net.insert_term eq_rrule (term_of elhs, rrule2) rules; 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

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

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

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

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

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

421 

422 
fun var_perm (t, u) = 

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

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

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

429 
is_Var (head_of lhs) 

430 
orelse 

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

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

434 
andalso not(exists_subterm is_Var lhs) 

435 
orelse 

436 
*) 

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

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

444 
is_Const lhs andalso not (is_Const rhs); 

10413  445 

446 
fun decomp_simp thm = 

15023  447 
let 
16458  448 
val {thy, prop, ...} = Thm.rep_thm thm; 
15023  449 
val prems = Logic.strip_imp_prems prop; 
450 
val concl = Drule.strip_imp_concl (Thm.cprop_of thm); 

451 
val (lhs, rhs) = Drule.dest_equals concl handle TERM _ => 

452 
raise SIMPLIFIER ("Rewrite rule not a metaequality", thm); 

20579  453 
val elhs = Thm.dest_arg (Thm.cprop_of (Thm.eta_conversion lhs)); 
16665  454 
val elhs = if term_of elhs aconv term_of lhs then lhs else elhs; (*share identical copies*) 
18929  455 
val erhs = Envir.eta_contract (term_of rhs); 
15023  456 
val perm = 
457 
var_perm (term_of elhs, erhs) andalso 

458 
not (term_of elhs aconv erhs) andalso 

459 
not (is_Var (term_of elhs)); 

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

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

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

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

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

15531  470 
NONE => [] 
471 
 SOME eq_True => 

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

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

473 
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

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

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

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

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

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

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

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

483 
else [rrule] 
10413  484 
end; 
485 

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

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

489 
else 

490 
(*weak test for loops*) 

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

492 
then mk_eq_True ss (thm, name) 

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

10413  494 
end; 
495 

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

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

500 
in 

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

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

18208  506 
(case mk_sym thm of 
507 
NONE => [] 

508 
 SOME thm' => 

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

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

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

15199  514 
fun extract_rews (Simpset (_, {mk_rews = {mk, ...}, ...}), thms) = 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21605
diff
changeset

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

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

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

520 

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

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

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

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

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

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

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

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

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

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

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

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

534 

535 
(* congs *) 

10413  536 

15531  537 
fun cong_name (Const (a, _)) = SOME a 
538 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

539 
 cong_name _ = NONE; 

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

540 

15023  541 
local 
542 

543 
fun is_full_cong_prems [] [] = true 

544 
 is_full_cong_prems [] _ = false 

545 
 is_full_cong_prems (p :: prems) varpairs = 

546 
(case Logic.strip_assums_concl p of 

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

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

549 
is_Var x andalso forall is_Bound xs andalso 

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

555 

556 
fun is_full_cong thm = 

10413  557 
let 
15023  558 
val prems = prems_of thm and concl = concl_of thm; 
559 
val (lhs, rhs) = Logic.dest_equals concl; 

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

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

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

568 
let 

569 
val (lhs, _) = Drule.dest_equals (Drule.strip_imp_concl (Thm.cprop_of thm)) 

570 
handle TERM _ => raise SIMPLIFIER ("Congruence not a metaequality", thm); 

18929  571 
(*val lhs = Envir.eta_contract lhs;*) 
20057  572 
val a = the (cong_name (head_of (term_of lhs))) handle Option.Option => 
15023  573 
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

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

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

576 
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

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

578 
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

579 
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

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

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

584 
let 

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

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

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

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

591 
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

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

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

15023  596 
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f; 
597 

598 
in 

599 

15570  600 
val (op addeqcongs) = Library.foldl add_cong; 
601 
val (op deleqcongs) = Library.foldl del_cong; 

15023  602 

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

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

605 

606 
end; 

10413  607 

608 

15023  609 
(* simprocs *) 
610 

22008  611 
exception SIMPROC_FAIL of string * exn; 
612 

22234  613 
datatype simproc = 
614 
Simproc of 

615 
{name: string, 

616 
lhss: cterm list, 

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

618 
id: stamp * thm list}; 

619 

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

22008  621 

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

624 
{name = name, 

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

626 
proc = fn psi => proc (phi $> psi), 

627 
id = (s, Morphism.fact phi ths)}; 

628 

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

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

22008  631 

632 
fun mk_simproc name lhss proc = 

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

22008  635 

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

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

638 
fun simproc thy name = simproc_i thy name o map (Sign.read_term thy); 

639 

640 

15023  641 
local 
10413  642 

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

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

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

10413  650 

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

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

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

10413  657 

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

660 

15023  661 
in 
10413  662 

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

10413  665 

15023  666 
end; 
10413  667 

668 

669 
(* mk_rews *) 

670 

15023  671 
local 
672 

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

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

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

679 
reorient = reorient'}; 

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

15023  681 

682 
in 

10413  683 

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

15023  686 

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

10413  689 

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

10413  692 

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

695 

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

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

15023  698 

699 
end; 

700 

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

701 

10413  702 
(* termless *) 
703 

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

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

707 

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

708 

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

710 

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

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

714 

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

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

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

718 

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

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

720 

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

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

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

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

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

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

728 

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

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

730 

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

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

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

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

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

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

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

738 

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

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

742 

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

745 
subgoal_tac, loop_tacs, (unsafe_solvers, merge_solvers solvers [solver]))); 

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

746 

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

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

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

750 

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

753 
subgoal_tac, loop_tacs, (merge_solvers unsafe_solvers [solver], solvers))); 

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

754 

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

757 
subgoal_tac, loop_tacs, (solvers, solvers))); 

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

758 

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

759 

18208  760 
(* empty *) 
761 

762 
fun init_ss mk_rews termless subgoal_tac solvers = 

763 
make_simpset ((Net.empty, [], (0, []), NONE), 

764 
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); 

765 

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

767 
init_ss mk_rews termless subgoal_tac solvers 

768 
> inherit_context ss; 

769 

770 
val basic_mk_rews: mk_rews = 

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

772 
mk_cong = I, 

773 
mk_sym = SOME o Drule.symmetric_fun, 

774 
mk_eq_True = K NONE, 

775 
reorient = default_reorient}; 

776 

777 
val empty_ss = init_ss basic_mk_rews Term.termless (K (K no_tac)) ([], []); 

778 

779 

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

781 

782 
fun merge_ss (ss1, ss2) = 

783 
let 

784 
val Simpset ({rules = rules1, prems = prems1, bounds = bounds1, context = _}, 

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

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

787 
val Simpset ({rules = rules2, prems = prems2, bounds = bounds2, context = _}, 

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

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

790 

791 
val rules' = Net.merge eq_rrule (rules1, rules2); 

792 
val prems' = gen_merge_lists Drule.eq_thm_prop prems1 prems2; 

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

22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

794 
val congs' = merge (eq_cong o pairself #2) (congs1, congs2); 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

795 
val weak' = merge (op =) (weak1, weak2); 
18208  796 
val procs' = Net.merge eq_proc (procs1, procs2); 
21286
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

797 
val loop_tacs' = AList.merge (op =) (K true) (loop_tacs1, loop_tacs2); 
18208  798 
val unsafe_solvers' = merge_solvers unsafe_solvers1 unsafe_solvers2; 
799 
val solvers' = merge_solvers solvers1 solvers2; 

800 
in 

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

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

803 
end; 

804 

805 

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

806 

10413  807 
(** rewriting **) 
808 

809 
(* 

810 
Uses conversions, see: 

811 
L C Paulson, A higherorder implementation of rewriting, 

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

813 
*) 

814 

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

815 
fun check_conv msg ss thm thm' = 
10413  816 
let 
817 
val thm'' = transitive thm (transitive 

20905  818 
(symmetric (Drule.beta_eta_conversion (Drule.lhs_of thm'))) thm') 
22254  819 
in if msg then trace_thm (fn () => "SUCCEEDED") ss thm' else (); SOME thm'' end 
10413  820 
handle THM _ => 
16458  821 
let val {thy, prop = _ $ _ $ prop0, ...} = Thm.rep_thm thm in 
22254  822 
trace_thm (fn () => "Proved wrong thm (Check subgoaler?)") ss thm'; 
823 
trace_term false (fn () => "Should have proved:") ss thy prop0; 

15531  824 
NONE 
10413  825 
end; 
826 

827 

828 
(* mk_procrule *) 

829 

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

830 
fun mk_procrule ss thm = 
15023  831 
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in 
832 
if rewrite_rule_extra_vars prems lhs rhs 

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

833 
then (warn_thm "Extra vars on rhs:" ss thm; []) 
15023  834 
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] 
10413  835 
end; 
836 

837 

15023  838 
(* rewritec: conversion to apply the meta simpset to a term *) 
10413  839 

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

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

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

844 
already in normal form. 

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

846 

10413  847 
val skel0 = Bound 0; 
848 

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

851 
in the lhs.*) 

10413  852 

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

20671  855 
else if exists_Const (member (op =) weak o #1) lhs then skel0 
15023  856 
else rhs; 
857 

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

859 
Otherwise those vars may become instantiated with unnormalized terms 

860 
while the premises are solved.*) 

861 

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

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

863 
if Term.add_vars rhs [] subset Term.add_vars lhs [] then uncond_skel args 
10413  864 
else skel0; 
865 

866 
(* 

15023  867 
Rewriting  we try in order: 
10413  868 
(1) beta reduction 
869 
(2) unconditional rewrite rules 

870 
(3) conditional rewrite rules 

871 
(4) simplification procedures 

872 

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

874 
*) 

875 

16458  876 
fun rewritec (prover, thyt, maxt) ss t = 
10413  877 
let 
15023  878 
val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss; 
10413  879 
val eta_thm = Thm.eta_conversion t; 
20905  880 
val eta_t' = Drule.rhs_of eta_thm; 
10413  881 
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

882 
fun rew {thm, name, lhs, elhs, extra, fo, perm} = 
10413  883 
let 
16458  884 
val {thy, prop, maxidx, ...} = rep_thm thm; 
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

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

886 
if maxt = ~1 orelse not extra then (thm, elhs) 
10413  887 
else (Thm.incr_indexes (maxt+1) thm, Thm.cterm_incr_indexes (maxt+1) elhs); 
888 
val insts = if fo then Thm.cterm_first_order_match (elhs', eta_t') 

889 
else Thm.cterm_match (elhs', eta_t'); 

890 
val thm' = Thm.instantiate insts (Thm.rename_boundvars lhs eta_t rthm); 

14643  891 
val prop' = Thm.prop_of thm'; 
21576  892 
val unconditional = (Logic.count_prems prop' = 0); 
10413  893 
val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop') 
894 
in 

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

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

10413  899 
if unconditional 
900 
then 

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

903 
val SOME thm'' = check_conv false ss eta_thm thm' 
15531  904 
in SOME (thm'', uncond_skel (congs, lr)) end) 
10413  905 
else 
22254  906 
(trace_thm (fn () => "Trying to rewrite:") ss thm'; 
16042  907 
if !simp_depth > !simp_depth_limit 
908 
then let val s = "simp_depth_limit exceeded  giving up" 

22254  909 
in trace false (fn () => s); warning s; NONE end 
16042  910 
else 
911 
case prover ss thm' of 

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

914 
(case check_conv true ss eta_thm thm2 of 
15531  915 
NONE => NONE  
916 
SOME thm2' => 

10413  917 
let val concl = Logic.strip_imp_concl prop 
918 
val lr = Logic.dest_equals concl 

16042  919 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  920 
end 
921 

15531  922 
fun rews [] = NONE 
10413  923 
 rews (rrule :: rrules) = 
15531  924 
let val opt = rew rrule handle Pattern.MATCH => NONE 
925 
in case opt of NONE => rews rrules  some => some end; 

10413  926 

927 
fun sort_rrules rrs = let 

14643  928 
fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of 
10413  929 
Const("==",_) $ _ $ _ => true 
12603  930 
 _ => false 
10413  931 
fun sort [] (re1,re2) = re1 @ re2 
12603  932 
 sort (rr::rrs) (re1,re2) = if is_simple rr 
10413  933 
then sort rrs (rr::re1,re2) 
934 
else sort rrs (re1,rr::re2) 

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

936 

15531  937 
fun proc_rews [] = NONE 
15023  938 
 proc_rews (Proc {name, proc, lhs, ...} :: ps) = 
17203  939 
if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then 
22254  940 
(debug_term false (fn () => "Trying procedure " ^ quote name ^ " on:") ss thyt eta_t; 
13486
54464ea94d6f
exception SIMPROC_FAIL: solid error reporting of simprocs;
wenzelm
parents:
13458
diff
changeset

941 
case transform_failure (curry SIMPROC_FAIL name) 
22008  942 
(fn () => proc ss eta_t') () of 
22254  943 
NONE => (debug false (fn () => "FAILED"); proc_rews ps) 
15531  944 
 SOME raw_thm => 
22254  945 
(trace_thm (fn () => "Procedure " ^ quote name ^ " produced rewrite rule:") 
946 
ss raw_thm; 

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

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

949 
"  does not match") ss t; proc_rews ps) 
10413  950 
 some => some))) 
951 
else proc_rews ps; 

952 
in case eta_t of 

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

954 
(beta_conversion false eta_t'), skel0) 
10413  955 
 _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of 
15531  956 
NONE => proc_rews (Net.match_term procs eta_t) 
10413  957 
 some => some) 
958 
end; 

959 

960 

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

962 

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

963 
fun congc prover ss maxt {thm=cong,lhs=lhs} t = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

964 
let val rthm = Thm.incr_indexes (maxt+1) cong; 
10413  965 
val rlhs = fst (Drule.dest_equals (Drule.strip_imp_concl (cprop_of rthm))); 
966 
val insts = Thm.cterm_match (rlhs, t) 

967 
(* Pattern.match can raise Pattern.MATCH; 

968 
is handled when congc is called *) 

969 
val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm); 

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

10413  972 
in case prover thm' of 
15531  973 
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

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

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

977 
if op aconv (pairself term_of (dest_equals (cprop_of thm2'))) 
15531  978 
then NONE else SOME thm2') 
10413  979 
end; 
980 

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

982 
apsnd dest_equals (dest_implies (hd (cprems_of Drule.imp_cong))); 

983 

15531  984 
fun transitive1 NONE NONE = NONE 
985 
 transitive1 (SOME thm1) NONE = SOME thm1 

986 
 transitive1 NONE (SOME thm2) = SOME thm2 

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

10413  988 

15531  989 
fun transitive2 thm = transitive1 (SOME thm); 
990 
fun transitive3 thm = transitive1 thm o SOME; 

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

991 

16458  992 
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = 
10413  993 
let 
15023  994 
fun botc skel ss t = 
15531  995 
if is_Var skel then NONE 
10413  996 
else 
15023  997 
(case subc skel ss t of 
15531  998 
some as SOME thm1 => 
20905  999 
(case rewritec (prover, thy, maxidx) ss (Drule.rhs_of thm1) of 
15531  1000 
SOME (thm2, skel2) => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1001 
transitive2 (transitive thm1 thm2) 
20905  1002 
(botc skel2 ss (Drule.rhs_of thm2)) 
15531  1003 
 NONE => some) 
1004 
 NONE => 

16458  1005 
(case rewritec (prover, thy, maxidx) ss t of 
15531  1006 
SOME (thm2, skel2) => transitive2 thm2 
20905  1007 
(botc skel2 ss (Drule.rhs_of thm2)) 
15531  1008 
 NONE => NONE)) 
10413  1009 

15023  1010 
and try_botc ss t = 
1011 
(case botc skel0 ss t of 

15531  1012 
SOME trec1 => trec1  NONE => (reflexive t)) 
10413  1013 

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

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

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

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

1020 
val b' = #1 (Term.dest_Free (Thm.term_of v)); 
21962  1021 
val _ = 
1022 
if b <> b' then 

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

1024 
else (); 

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

15531  1028 
SOME thm => SOME (abstract_rule a v thm) 
1029 
 NONE => NONE 

10413  1030 
end 
1031 
 t $ _ => (case t of 

15023  1032 
Const ("==>", _) $ _ => impc t0 ss 
10413  1033 
 Abs _ => 
1034 
let val thm = beta_conversion false t0 

20905  1035 
in case subc skel0 ss (Drule.rhs_of thm) of 
15531  1036 
NONE => SOME thm 
1037 
 SOME thm' => SOME (transitive thm thm') 

10413  1038 
end 
1039 
 _ => 

1040 
let fun appc () = 

1041 
let 

1042 
val (tskel, uskel) = case skel of 

1043 
tskel $ uskel => (tskel, uskel) 

1044 
 _ => (skel0, skel0); 

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

1045 
val (ct, cu) = Thm.dest_comb t0 
10413  1046 
in 
15023  1047 
(case botc tskel ss ct of 
15531  1048 
SOME thm1 => 
15023  1049 
(case botc uskel ss cu of 
15531  1050 
SOME thm2 => SOME (combination thm1 thm2) 
1051 
 NONE => SOME (combination thm1 (reflexive cu))) 

1052 
 NONE => 

15023  1053 
(case botc uskel ss cu of 
15531  1054 
SOME thm1 => SOME (combination (reflexive ct) thm1) 
1055 
 NONE => NONE)) 

10413  1056 
end 
1057 
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

1058 
in case cong_name h of 
15531  1059 
SOME a => 
17232  1060 
(case AList.lookup (op =) (fst congs) a of 
15531  1061 
NONE => appc () 
1062 
 SOME cong => 

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

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

1066 
val thm = congc (prover ss) ss maxidx cong t0; 
20905  1067 
val t = the_default t0 (Option.map Drule.rhs_of thm); 
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset

1068 
val (cl, cr) = Thm.dest_comb t 
10413  1069 
val dVar = Var(("", 0), dummyT) 
1070 
val skel = 

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

15023  1072 
in case botc skel ss cl of 
15531  1073 
NONE => thm 
1074 
 SOME thm' => transitive3 thm 

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

1075 
(combination thm' (reflexive cr)) 
20057  1076 
end handle Pattern.MATCH => appc ())) 
10413  1077 
 _ => appc () 
1078 
end) 

15531  1079 
 _ => NONE) 
10413  1080 

15023  1081 
and impc ct ss = 
1082 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  1083 

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

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

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

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

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

1090 
let val asm = assume prem 
15531  1091 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1092 

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

1094 
(fold o fold) insert_rrule rrss ss > add_prems (map_filter I asms) 
10413  1095 

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

1096 
and disch r (prem, eq) = 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

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

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

1102 
in if not r then eq' else 
10413  1103 
let 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1104 
val (prem', concl) = dest_implies lhs; 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

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

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

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

1110 
Drule.swap_prems_eq) 
10413  1111 
end 
1112 
end 

1113 

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

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

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

1118 
val concl' = 
20905  1119 
Drule.mk_implies (prem, the_default concl (Option.map Drule.rhs_of eq)); 
15570  1120 
val dprem = Option.map (curry (disch false) prem) 
16458  1121 
in case rewritec (prover, thy, maxidx) ss' concl' of 
15531  1122 
NONE => rebuild prems concl' rrss asms ss (dprem eq) 
15570  1123 
 SOME (eq', _) => transitive2 (Library.foldl (disch false o swap) 
19502  1124 
(the (transitive3 (dprem eq) eq'), prems)) 
20905  1125 
(mut_impc0 (rev prems) (Drule.rhs_of eq') (rev rrss) (rev asms) ss) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1126 
end 
15023  1127 

1128 
and mut_impc0 prems concl rrss asms ss = 

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

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

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

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

1134 
end 
15023  1135 

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

15570  1137 
transitive1 (Library.foldl (fn (eq2, (eq1, prem)) => transitive1 eq1 
1138 
(Option.map (curry (disch false) prem) eq2)) (NONE, eqns ~~ prems')) 

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

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

1140 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1141 
[] [] [] [] ss ~1 changed 
1142 
else rebuild prems' concl rrss' asms' ss 

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

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

1144 

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

1145 
 mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) 
15023  1146 
prems' rrss' asms' eqns ss changed k = 
15531  1147 
case (if k = 0 then NONE else botc skel0 (add_rrules 
15023  1148 
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of 
15531  1149 
NONE => mut_impc prems concl rrss asms (prem :: prems') 
1150 
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed 

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

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

1153 
let 
20905  1154 
val prem' = Drule.rhs_of eqn; 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1159 
in mut_impc prems concl rrss asms (prem' :: prems') 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

1160 
(rrs' :: rrss') (asm' :: asms') (SOME (foldr (disch true) 
18470  1161 
(Drule.imp_cong_rule eqn (reflexive (Drule.list_implies 
20671  1162 
(Library.drop (i, prems), concl)))) (Library.take (i, prems))) :: eqns) 
1163 
ss (length prems') ~1 

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

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

1165 

15023  1166 
(*legacy code  only for backwards compatibility*) 
1167 
and nonmut_impc ct ss = 

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

1168 
let val (prem, conc) = dest_implies ct; 
15531  1169 
val thm1 = if simprem then botc skel0 ss prem else NONE; 
20905  1170 
val prem1 = the_default prem (Option.map Drule.rhs_of thm1); 
15023  1171 
val ss1 = if not useprem then ss else add_rrules 
1172 
(apsnd single (apfst single (rules_of_prem ss prem1))) ss 

1173 
in (case botc skel0 ss1 conc of 

15531  1174 
NONE => (case thm1 of 
1175 
NONE => NONE 

18470  1176 
 SOME thm1' => SOME (Drule.imp_cong_rule thm1' (reflexive conc))) 
15531  1177 
 SOME thm2 => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1178 
let val thm2' = disch false (prem1, thm2) 
10413  1179 
in (case thm1 of 
15531  1180 
NONE => SOME thm2' 
1181 
 SOME thm1' => 

18470  1182 
SOME (transitive (Drule.imp_cong_rule thm1' (reflexive conc)) thm2')) 
10413  1183 
end) 
1184 
end 

1185 

15023  1186 
in try_botc end; 
10413  1187 

1188 

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

1191 
(* 

1192 
Parameters: 

1193 
mode = (simplify A, 

1194 
use A in simplifying B, 

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

1196 
when simplifying A ==> B 

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

1198 
*) 

1199 

17705  1200 
val debug_bounds = ref false; 
1201 

21962  1202 
fun check_bounds ss ct = 
1203 
if ! debug_bounds then 

1204 
let 

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

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

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

1208 
then insert (op =) x else I 

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

1210 
in 

1211 
if null bs then () 

1212 
else print_term true ("Simplifier: term contains loose bounds: " ^ commas_quote bs) ss 

1213 
(Thm.theory_of_cterm ct) (Thm.term_of ct) 

1214 
end 

1215 
else (); 

17614  1216 

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

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

1218 
let 
20260  1219 
val ct = Thm.adjust_maxidx_cterm ~1 raw_ct; 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1220 
val {thy, t, maxidx, ...} = Thm.rep_cterm ct; 
22008  1221 
val ss = activate_context thy raw_ss; 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1222 
val _ = inc simp_depth; 
21962  1223 
val _ = 
1224 
if ! simp_depth mod 20 = 0 then 

1225 
warning ("Simplification depth " ^ string_of_int (! simp_depth)) 

1226 
else (); 

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

1228 
val _ = check_bounds ss ct; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1229 
val res = bottomc (mode, Option.map Drule.flexflex_unique oo prover, thy, maxidx) ss ct 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1230 
in dec simp_depth; res end 
20057  1231 
handle exn => (dec simp_depth; raise exn); (* FIXME avoid handling of generic exceptions *) 
10413  1232 

21708  1233 
val simple_prover = 
1234 
SINGLE o (fn ss => ALLGOALS (resolve_tac (prems_of_ss ss))); 

1235 

11760  1236 
(*Rewrite a cterm*) 
21708  1237 
fun rewrite _ [] ct = Thm.reflexive ct 
1238 
 rewrite full thms ct = 

1239 
rewrite_cterm (full, false, false) simple_prover 

1240 
(theory_context (Thm.theory_of_cterm ct) empty_ss addsimps thms) ct; 

11672  1241 

10413  1242 
(*Rewrite a theorem*) 
21708  1243 
fun simplify _ [] th = th 
1244 
 simplify full thms th = 

1245 
Drule.fconv_rule (rewrite_cterm (full, false, false) simple_prover 

17897  1246 
(theory_context (Thm.theory_of_thm th) empty_ss addsimps thms)) th; 
10413  1247 

21708  1248 
val rewrite_rule = simplify true; 
1249 

15023  1250 
(*simple term rewriting  no proof*) 
16458  1251 
fun rewrite_term thy rules procs = 
17203  1252 
Pattern.rewrite_term thy (map decomp_simp' rules) procs; 
15023  1253 

1254 
fun rewrite_thm mode prover ss = Drule.fconv_rule (rewrite_cterm mode prover ss); 

10413  1255 

1256 
(*Rewrite the subgoals of a proof state (represented by a theorem) *) 

21708  1257 
fun rewrite_goals_rule thms th = 
1258 
Drule.fconv_rule (Drule.goals_conv (K true) (rewrite_cterm (true, true, true) simple_prover 

19142
99a72b8c9974
rewrite_goals_rule_aux: actually use prems if present;
wenzelm
parents:
19052
diff
changeset

1259 
(theory_context (Thm.theory_of_thm th) empty_ss addsimps thms))) th; 
10413  1260 

15023  1261 
(*Rewrite the subgoal of a proof state (represented by a theorem)*) 
15011  1262 
fun rewrite_goal_rule mode prover ss i thm = 
10413  1263 
if 0 < i andalso i <= nprems_of thm 
15011  1264 
then Drule.fconv_rule (Drule.goals_conv (fn j => j=i) (rewrite_cterm mode prover ss)) thm 
22234  1265 
else raise THM("rewrite_goal_rule", i, [thm]); 
10413
