author  wenzelm 
Tue, 18 Nov 2008 18:25:42 +0100  
changeset 28839  32d498cf7595 
parent 28620  9846d772b306 
child 29269  5c25a2012975 
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 
16042  17 
val trace_simp_depth_limit: int ref 
15023  18 
type rrule 
16807  19 
val eq_rrule: rrule * rrule > bool 
15023  20 
type cong 
21 
type simpset 

22 
type proc 

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

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

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

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

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

29 
bounds: int * ((string * typ) * string) list, 
23938  30 
depth: int * bool ref, 
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} 
44 
val empty_ss: simpset 

45 
val merge_ss: simpset * simpset > simpset 

27558  46 
val pretty_ss: simpset > Pretty.T 
15023  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 

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

82 
val rewrite_goal_tac: thm list > int > tactic 
21708  83 
val rewtac: thm > tactic 
84 
val prune_params_tac: tactic 

85 
val fold_rule: thm list > thm > thm 

86 
val fold_goals_tac: thm list > tactic 

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

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

88 

10413  89 
signature META_SIMPLIFIER = 
90 
sig 

11672  91 
include BASIC_META_SIMPLIFIER 
10413  92 
exception SIMPLIFIER of string * thm 
27558  93 
val add_simp: thm > simpset > simpset 
94 
val del_simp: thm > simpset > simpset 

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

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

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

97 
val simp_depth_limit: int Config.T 
15023  98 
val clear_ss: simpset > simpset 
16458  99 
val simproc_i: theory > string > term list 
100 
> (theory > simpset > term > thm option) > simproc 

101 
val simproc: theory > string > string list 

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

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

103 
val inherit_context: simpset > simpset > simpset 
20289  104 
val the_context: simpset > Proof.context 
105 
val context: Proof.context > simpset > simpset 

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

109 
val set_solvers: solver list > simpset > simpset 
23598  110 
val rewrite_cterm: bool * bool * bool > (simpset > thm > thm option) > simpset > conv 
16458  111 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  112 
val rewrite_thm: bool * bool * bool > 
113 
(simpset > thm > thm option) > simpset > thm > thm 

114 
val rewrite_goal_rule: bool * bool * bool > 

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

116 
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

117 
(simpset > tactic) > simpset > int > tactic 
21605  118 
val norm_hhf: thm > thm 
119 
val norm_hhf_protect: thm > thm 

23598  120 
val rewrite: bool > thm list > conv 
21708  121 
val simplify: bool > thm list > thm > thm 
10413  122 
end; 
123 

15023  124 
structure MetaSimplifier: META_SIMPLIFIER = 
10413  125 
struct 
126 

15023  127 
(** datatype simpset **) 
128 

129 
(* rewrite rules *) 

10413  130 

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

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

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

133 
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

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

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

136 
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

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

138 
perm: bool}; (*the rewrite rule is permutative*) 
15023  139 

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

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

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

148 
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

149 
*) 
10413  150 

151 
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

152 
Thm.eq_thm_prop (thm1, thm2); 
15023  153 

154 

155 
(* congruences *) 

156 

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

10413  158 

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

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

162 

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

165 
(*A simpset contains data required during conversion: 

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

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

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

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

174 
procs: discrimination net of simplification procedures 

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

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

178 
mk_cong: prepare congruence rules; 

179 
mk_sym: turn == around; 

180 
mk_eq_True: turn P into P == True; 

181 
termless: relation for ordered rewriting;*) 

15011  182 

15023  183 
type mk_rews = 
184 
{mk: thm > thm list, 

185 
mk_cong: thm > thm, 

186 
mk_sym: thm > thm option, 

18208  187 
mk_eq_True: thm > thm option, 
188 
reorient: theory > term list > term > term > bool}; 

15023  189 

190 
datatype simpset = 

191 
Simpset of 

192 
{rules: rrule Net.net, 

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

194 
bounds: int * ((string * typ) * string) list, 
23938  195 
depth: int * bool ref, 
20289  196 
context: Proof.context option} * 
15023  197 
{congs: (string * cong) list * string list, 
198 
procs: proc Net.net, 

199 
mk_rews: mk_rews, 

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

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

205 
Proc of 

206 
{name: string, 

207 
lhs: cterm, 

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

212 
{name: string, 

213 
solver: simpset > int > tactic, 

15023  214 
id: stamp}; 
215 

216 

217 
fun rep_ss (Simpset args) = args; 

10413  218 

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

219 
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

220 
{rules = rules, prems = prems, bounds = bounds, depth = depth, context = context}; 
15023  221 

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

222 
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

223 
make_ss1 (f (rules, prems, bounds, depth, context)); 
10413  224 

15023  225 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
226 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

227 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

228 

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

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

231 

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

10413  233 

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

234 
fun map_simpset f (Simpset ({rules, prems, bounds, depth, context}, 
15023  235 
{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

236 
make_simpset (f ((rules, prems, bounds, depth, context), 
15023  237 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers))); 
10413  238 

15023  239 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
240 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

241 

17614  242 
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems; 
243 

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

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

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

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

250 

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

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

252 
fun solver ss (Solver {solver = tac, ...}) = tac ss; 
17614  253 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 
254 

15023  255 

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

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

257 

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

258 
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

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

260 

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

261 
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

262 

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

263 
fun trace_depth (Simpset ({depth = (depth, exceeded), ...}, _)) msg = 
23938  264 
if depth > ! trace_simp_depth_limit then 
265 
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

266 
else 
23938  267 
(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

268 

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

269 
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

270 
(rules, prems, bounds, 
23938  271 
(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

272 

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

273 
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

274 

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

275 

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

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

277 

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

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

279 

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

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

281 
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

282 

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

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

284 

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

285 
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

286 

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

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

288 
let 
20146  289 
val names = Term.declare_term_names t Name.context; 
290 
val xs = rev (#1 (Name.variants (rev (map #2 bs)) names)); 

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

292 
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

293 

17705  294 
in 
295 

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

296 
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

297 
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

298 

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

299 
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

300 
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

301 

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

302 
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

303 
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

304 

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

305 
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

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

308 

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

309 
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

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

312 

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

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

314 
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

315 
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

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

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

318 

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

319 
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

320 
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

321 

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

322 
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

323 
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

324 

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

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

326 

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

327 

15023  328 
(* print simpsets *) 
10413  329 

27558  330 
fun pretty_ss ss = 
15023  331 
let 
15034  332 
val pretty_thms = map Display.pretty_thm; 
15023  333 

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

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

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

15034  338 

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

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

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

22234  343 
> partition_eq (eq_snd eq_procid) 
17756  344 
> map (fn ps => (fst (fst (hd ps)), map (snd o fst) ps)) 
345 
> Library.sort_wrt fst; 

15023  346 
in 
15034  347 
[Pretty.big_list "simplification rules:" (pretty_thms smps), 
348 
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

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

350 
Pretty.strs ("loopers:" :: map (quote o fst) loop_tacs), 
15088  351 
Pretty.strs ("unsafe solvers:" :: map (quote o solver_name) (#1 solvers)), 
352 
Pretty.strs ("safe solvers:" :: map (quote o solver_name) (#2 solvers))] 

27558  353 
> Pretty.chunks 
13828  354 
end; 
10413  355 

15023  356 

10413  357 

358 
(** simpset operations **) 

359 

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

360 
(* context *) 
10413  361 

17614  362 
fun eq_bound (x: string, (y, _)) = x = y; 
363 

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

364 
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

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

366 

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

367 
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

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

369 

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

370 
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

371 
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

372 

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

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

374 
 the_context _ = raise Fail "Simplifier: no proof context in simpset"; 
10413  375 

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

377 
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

378 

21516  379 
val theory_context = context o ProofContext.init; 
17897  380 

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

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

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

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

384 
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

385 
in context ctxt' ss end; 
17897  386 

387 

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

388 
(* maintain simp rules *) 
10413  389 

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

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

391 
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

392 
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

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

394 
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

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

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

397 
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

398 
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

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

400 
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

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

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

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

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

405 

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

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

407 
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

408 

15023  409 
fun mk_rrule2 {thm, name, lhs, elhs, perm} = 
410 
let 

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

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

412 
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

413 
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

414 
in {thm = thm, name = name, lhs = lhs, elhs = elhs, extra = extra, fo = fo, perm = perm} end; 
10413  415 

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

416 
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

417 
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

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

419 
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

420 

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

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

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

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

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

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

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

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

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

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

434 

435 
fun var_perm (t, u) = 

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

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

15023  438 
(*simple test for looping rewrite rules and stupid orientations*) 
18208  439 
fun default_reorient thy prems lhs rhs = 
15023  440 
rewrite_rule_extra_vars prems lhs rhs 
441 
orelse 

442 
is_Var (head_of lhs) 

443 
orelse 

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

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

447 
andalso not(exists_subterm is_Var lhs) 

448 
orelse 

449 
*) 

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

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

457 
is_Const lhs andalso not (is_Const rhs); 

10413  458 

459 
fun decomp_simp thm = 

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

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

462 
val prop = Thm.prop_of thm; 
15023  463 
val prems = Logic.strip_imp_prems prop; 
464 
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

465 
val (lhs, rhs) = Thm.dest_equals concl handle TERM _ => 
15023  466 
raise SIMPLIFIER ("Rewrite rule not a metaequality", thm); 
20579  467 
val elhs = Thm.dest_arg (Thm.cprop_of (Thm.eta_conversion lhs)); 
16665  468 
val elhs = if term_of elhs aconv term_of lhs then lhs else elhs; (*share identical copies*) 
18929  469 
val erhs = Envir.eta_contract (term_of rhs); 
15023  470 
val perm = 
471 
var_perm (term_of elhs, erhs) andalso 

472 
not (term_of elhs aconv erhs) andalso 

473 
not (is_Var (term_of elhs)); 

16458  474 
in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end; 
10413  475 

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

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

479 
else (lhs, rhs) 
12783  480 
end; 
481 

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

15531  484 
NONE => [] 
485 
 SOME eq_True => 

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

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

487 
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

488 
val extra = rrule_extra_vars elhs eq_True; 
15023  489 
in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end); 
10413  490 

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

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

494 
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

495 
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

496 
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

497 
else [rrule] 
10413  498 
end; 
499 

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

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

503 
else 

504 
(*weak test for loops*) 

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

506 
then mk_eq_True ss (thm, name) 

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

10413  508 
end; 
509 

15023  510 
fun orient_rrule ss (thm, name) = 
18208  511 
let 
512 
val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm; 

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

514 
in 

15023  515 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 
16458  516 
else if reorient thy prems lhs rhs then 
517 
if reorient thy prems rhs lhs 

15023  518 
then mk_eq_True ss (thm, name) 
519 
else 

18208  520 
(case mk_sym thm of 
521 
NONE => [] 

522 
 SOME thm' => 

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

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

15023  525 
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) 
10413  526 
end; 
527 

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

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

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

532 
maps (orient_rrule ss) (extract_rews (ss, [thm])); 
10413  533 

534 

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

535 
(* add/del rules explicitly *) 
10413  536 

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

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

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

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

540 
in fold (fold comb o mk_rrule) rews ss end; 
10413  541 

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

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

543 
comb_simps insert_rrule (mk_rrule ss) (ss, thms); 
10413  544 

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

546 
comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms); 
15023  547 

27558  548 
fun add_simp thm ss = ss addsimps [thm]; 
549 
fun del_simp thm ss = ss delsimps [thm]; 

15023  550 

551 
(* congs *) 

10413  552 

15531  553 
fun cong_name (Const (a, _)) = SOME a 
554 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

555 
 cong_name _ = NONE; 

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

556 

15023  557 
local 
558 

559 
fun is_full_cong_prems [] [] = true 

560 
 is_full_cong_prems [] _ = false 

561 
 is_full_cong_prems (p :: prems) varpairs = 

562 
(case Logic.strip_assums_concl p of 

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

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

565 
is_Var x andalso forall is_Bound xs andalso 

20972  566 
not (has_duplicates (op =) xs) andalso xs = ys andalso 
20671  567 
member (op =) varpairs (x, y) andalso 
19303  568 
is_full_cong_prems prems (remove (op =) (x, y) varpairs) 
15023  569 
end 
570 
 _ => false); 

571 

572 
fun is_full_cong thm = 

10413  573 
let 
15023  574 
val prems = prems_of thm and concl = concl_of thm; 
575 
val (lhs, rhs) = Logic.dest_equals concl; 

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

10413  577 
in 
20972  578 
f = g andalso not (has_duplicates (op =) (xs @ ys)) andalso length xs = length ys andalso 
15023  579 
is_full_cong_prems prems (xs ~~ ys) 
10413  580 
end; 
581 

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

584 
let 

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

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

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

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

592 
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

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

594 
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

595 
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

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

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

600 
let 

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

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

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

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

607 
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

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

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

15023  612 
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f; 
613 

614 
in 

615 

15570  616 
val (op addeqcongs) = Library.foldl add_cong; 
617 
val (op deleqcongs) = Library.foldl del_cong; 

15023  618 

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

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

621 

622 
end; 

10413  623 

624 

15023  625 
(* simprocs *) 
626 

22234  627 
datatype simproc = 
628 
Simproc of 

629 
{name: string, 

630 
lhss: cterm list, 

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

632 
id: stamp * thm list}; 

633 

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

22008  635 

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

638 
{name = name, 

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

22669  640 
proc = Morphism.transform phi proc, 
22234  641 
id = (s, Morphism.fact phi ths)}; 
642 

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

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

22008  645 

646 
fun mk_simproc name lhss proc = 

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

22008  649 

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

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

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

654 

15023  655 
local 
10413  656 

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

657 
fun add_proc (proc as Proc {name, lhs, ...}) ss = 
22254  658 
(trace_cterm false (fn () => "Adding simplification procedure " ^ quote name ^ " for") ss lhs; 
15023  659 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  660 
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, 
15023  661 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
662 
handle Net.INSERT => 

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

10413  664 

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

665 
fun del_proc (proc as Proc {name, lhs, ...}) ss = 
15023  666 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  667 
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, 
15023  668 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
669 
handle Net.DELETE => 

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

10413  671 

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

15023  675 
in 
10413  676 

22234  677 
fun ss addsimprocs ps = fold (fold add_proc o prep_procs) ps ss; 
678 
fun ss delsimprocs ps = fold (fold del_proc o prep_procs) ps ss; 

10413  679 

15023  680 
end; 
10413  681 

682 

683 
(* mk_rews *) 

684 

15023  685 
local 
686 

18208  687 
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True, reorient}, 
15023  688 
termless, subgoal_tac, loop_tacs, solvers) => 
18208  689 
let 
690 
val (mk', mk_cong', mk_sym', mk_eq_True', reorient') = 

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

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

693 
reorient = reorient'}; 

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

15023  695 

696 
in 

10413  697 

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

15023  700 

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

10413  703 

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

10413  706 

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

709 

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

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

15023  712 

713 
end; 

714 

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

715 

10413  716 
(* termless *) 
717 

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

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

721 

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

722 

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

724 

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

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

728 

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

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

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

732 

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

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

734 

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

735 
fun ss addloop' (name, tac) = ss > 
15023  736 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
737 
(congs, procs, mk_rews, termless, subgoal_tac, 

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

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

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

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

742 

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

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

744 

15023  745 
fun ss delloop name = ss > 
746 
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

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

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

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

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

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

752 

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

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

756 

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

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

760 

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

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

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

764 

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

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

768 

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

771 
subgoal_tac, loop_tacs, (solvers, solvers))); 

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

772 

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

773 

18208  774 
(* empty *) 
775 

776 
fun init_ss mk_rews termless subgoal_tac solvers = 

23938  777 
make_simpset ((Net.empty, [], (0, []), (0, ref false), NONE), 
18208  778 
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); 
779 

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

781 
init_ss mk_rews termless subgoal_tac solvers 

782 
> inherit_context ss; 

783 

784 
val basic_mk_rews: mk_rews = 

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

786 
mk_cong = I, 

787 
mk_sym = SOME o Drule.symmetric_fun, 

788 
mk_eq_True = K NONE, 

789 
reorient = default_reorient}; 

790 

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

792 

793 

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

795 

796 
fun merge_ss (ss1, ss2) = 

24358  797 
if pointer_eq (ss1, ss2) then ss1 
798 
else 

799 
let 

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

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

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

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

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

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

806 

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

808 
val prems' = merge Thm.eq_thm_prop (prems1, prems2); 

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

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

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

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

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

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

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

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

817 
in 

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

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

820 
end; 

18208  821 

822 

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

823 

10413  824 
(** rewriting **) 
825 

826 
(* 

827 
Uses conversions, see: 

828 
L C Paulson, A higherorder implementation of rewriting, 

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

830 
*) 

831 

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

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

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

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

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

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

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

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

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

15531  845 
NONE 
10413  846 
end; 
847 

848 

849 
(* mk_procrule *) 

850 

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

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

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

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

858 

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

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

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

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

865 
already in normal form. 

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

867 

10413  868 
val skel0 = Bound 0; 
869 

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

872 
in the lhs.*) 

10413  873 

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

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

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

880 
Otherwise those vars may become instantiated with unnormalized terms 

881 
while the premises are solved.*) 

882 

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

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

884 
if Term.add_vars rhs [] subset Term.add_vars lhs [] then uncond_skel args 
10413  885 
else skel0; 
886 

887 
(* 

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

891 
(3) conditional rewrite rules 

892 
(4) simplification procedures 

893 

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

895 
*) 

896 

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

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

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

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

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

907 
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

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

909 
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

910 
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

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

912 
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

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

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

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

10413  923 
if unconditional 
924 
then 

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

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

931 
if simp_depth ss > Config.get ctxt simp_depth_limit 
16042  932 
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

933 
in trace false (fn () => s) ss; warning s; NONE end 
16042  934 
else 
935 
case prover ss thm' of 

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

938 
(case check_conv true ss eta_thm thm2 of 
15531  939 
NONE => NONE  
940 
SOME thm2' => 

10413  941 
let val concl = Logic.strip_imp_concl prop 
942 
val lr = Logic.dest_equals concl 

16042  943 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  944 
end 
945 

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

10413  950 

951 
fun sort_rrules rrs = let 

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

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

960 

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

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

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

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

972 
"  does not match") ss t; proc_rews ps) 
10413  973 
 some => some))) 
974 
else proc_rews ps; 

975 
in case eta_t of 

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

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

982 

983 

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

985 

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

986 
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

987 
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

988 
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

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

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

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

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

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

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

1000 
if op aconv (pairself term_of (Thm.dest_equals (cprop_of thm2'))) 
15531  1001 
then NONE else SOME thm2') 
10413  1002 
end; 
1003 

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

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

1005 
apsnd Thm.dest_equals (Thm.dest_implies (hd (cprems_of Drule.imp_cong))); 
10413  1006 

15531  1007 
fun transitive1 NONE NONE = NONE 
1008 
 transitive1 (SOME thm1) NONE = SOME thm1 

1009 
 transitive1 NONE (SOME thm2) = SOME thm2 

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

10413  1011 

15531  1012 
fun transitive2 thm = transitive1 (SOME thm); 
1013 
fun transitive3 thm = transitive1 thm o SOME; 

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

1014 

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

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

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

1025 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1026 
 NONE => some) 
1027 
 NONE => 

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

1030 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1031 
 NONE => NONE)) 
10413  1032 

15023  1033 
and try_botc ss t = 
1034 
(case botc skel0 ss t of 

15531  1035 
SOME trec1 => trec1  NONE => (reflexive t)) 
10413  1036 

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

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

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

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

1043 
val b' = #1 (Term.dest_Free (Thm.term_of v)); 
21962  1044 
val _ = 
1045 
if b <> b' then 

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

1047 
else (); 

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

15531  1051 
SOME thm => SOME (abstract_rule a v thm) 
1052 
 NONE => NONE 

10413  1053 
end 
1054 
 t $ _ => (case t of 

15023  1055 
Const ("==>", _) $ _ => impc t0 ss 
10413  1056 
 Abs _ => 
1057 
let val thm = beta_conversion false t0 

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

1058 
in case subc skel0 ss (Thm.rhs_of thm) of 
15531  1059 
NONE => SOME thm 
1060 
 SOME thm' => SOME (transitive thm thm') 

10413  1061 
end 
1062 
 _ => 

1063 
let fun appc () = 

1064 
let 

1065 
val (tskel, uskel) = case skel of 

1066 
tskel $ uskel => (tskel, uskel) 

1067 
 _ => (skel0, skel0); 

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

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

1075 
 NONE => 

15023  1076 
(case botc uskel ss cu of 
15531  1077 
SOME thm1 => SOME (combination (reflexive ct) thm1) 
1078 
 NONE => NONE)) 

10413  1079 
end 
1080 
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

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

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

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

1089 
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

1090 
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

1091 
val (cl, cr) = Thm.dest_comb t 
10413  1092 
val dVar = Var(("", 0), dummyT) 
1093 
val skel = 

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

15023  1095 
in case botc skel ss cl of 
15531  1096 
NONE => thm 
1097 
 SOME thm' => transitive3 thm 

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

1098 
(combination thm' (reflexive cr)) 
20057  1099 
end handle Pattern.MATCH => appc ())) 
10413  1100 
 _ => appc () 
1101 
end) 

15531  1102 
 _ => NONE) 
10413  1103 

15023  1104 
and impc ct ss = 
1105 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  1106 

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

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

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

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

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

1113 
let val asm = assume prem 
15531  1114 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1115 

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

1117 
(fold o fold) insert_rrule rrss ss > add_prems (map_filter I asms) 
10413  1118 

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

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

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

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

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

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

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

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

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

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

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

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

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

1133 
Drule.swap_prems_eq) 
10413  1134 
end 
1135 
end 

1136 

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

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

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

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

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

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

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

1149 
end 
15023  1150 

1151 
and mut_impc0 prems concl rrss asms ss = 

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

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

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

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

1157 
end 
15023  1158 

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

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

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

1163 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1164 
[] [] [] [] ss ~1 changed 
1165 
else rebuild prems' concl rrss' asms' ss 

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

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

1167 

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

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

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

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

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

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

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

1182 
in mut_impc prems concl rrss asms (prem' :: prems') 
23178  1183 
(rrs' :: rrss') (asm' :: asms') (SOME (fold_rev (disch true) 
1184 
(Library.take (i, prems)) 

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

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

1189 

15023  1190 
(*legacy code  only for backwards compatibility*) 
1191 
and nonmut_impc ct ss = 

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

1192 
let val (prem, conc) = Thm.dest_implies ct; 
15531  1193 
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

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

1197 
in (case botc skel0 ss1 conc of 

15531  1198 
NONE => (case thm1 of 
1199 
NONE => NONE 

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

18470  1206 
SOME (transitive (Drule.imp_cong_rule thm1' (reflexive conc)) thm2')) 
10413  1207 
end) 
1208 
end 

1209 

15023  1210 
in try_botc end; 
10413  1211 

1212 

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

1215 
(* 

1216 
Parameters: 

1217 
mode = (simplify A, 

1218 
use A in simplifying B, 

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

1220 
when simplifying A ==> B 

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

1222 
*) 

1223 

17705  1224 
val debug_bounds = ref false; 
1225 

21962  1226 
fun check_bounds ss ct = 
1227 
if ! debug_bounds then 

1228 
let 

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

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

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

1232 
then insert (op =) x else I 

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

1234 
in 

1235 
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

1236 
else print_term ss true ("Simplifier: term contains loose bounds: " ^ commas_quote bs) 
21962  1237 
(Thm.theory_of_cterm ct) (Thm.term_of ct) 
1238 
end 

1239 
else (); 

17614  1240 

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

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

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

1243 
val thy = Thm.theory_of_cterm raw_ct; 
20260  1244 
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

1245 
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

1246 
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

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

1249 
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

1250 
warning ("Simplification depth " ^ string_of_int depth) 
21962  1251 
else (); 
22254  1252 
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

1253 
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

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