author  wenzelm 
Wed, 15 Feb 2006 21:35:02 +0100  
changeset 19052  113dbd65319e 
parent 18929  d81435108688 
child 19142  99a72b8c9974 
permissions  rwrr 
10413  1 
(* Title: Pure/meta_simplifier.ML 
2 
ID: $Id$ 

11672  3 
Author: Tobias Nipkow and Stefan Berghofer 
10413  4 

11672  5 
Metalevel Simplification. 
10413  6 
*) 
7 

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

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

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

12 

11672  13 
signature BASIC_META_SIMPLIFIER = 
14 
sig 

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

23 
type proc 

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

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

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

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

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

30 
bounds: int * ((string * typ) * string) list, 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

31 
context: Context.proof option} * 
15023  32 
{congs: (string * cong) list * string list, 
33 
procs: proc Net.net, 

34 
mk_rews: 

35 
{mk: thm > thm list, 

36 
mk_cong: thm > thm, 

37 
mk_sym: thm > thm option, 

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

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

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

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

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

47 
type simproc 

48 
val mk_simproc: string > cterm list > 

16458  49 
(theory > simpset > term > thm option) > simproc 
15023  50 
val add_prems: thm list > simpset > simpset 
51 
val prems_of_ss: simpset > thm list 

52 
val addsimps: simpset * thm list > simpset 

53 
val delsimps: simpset * thm list > simpset 

54 
val addeqcongs: simpset * thm list > simpset 

55 
val deleqcongs: simpset * thm list > simpset 

56 
val addcongs: simpset * thm list > simpset 

57 
val delcongs: simpset * thm list > simpset 

58 
val addsimprocs: simpset * simproc list > simpset 

59 
val delsimprocs: simpset * simproc list > simpset 

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

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

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

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

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

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

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

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

68 
val addloop': simpset * (string * (simpset > int > tactic)) > simpset 
15023  69 
val addloop: simpset * (string * (int > tactic)) > simpset 
70 
val delloop: simpset * string > simpset 

71 
val setSSolver: simpset * solver > simpset 

72 
val addSSolver: simpset * solver > simpset 

73 
val setSolver: simpset * solver > simpset 

74 
val addSolver: simpset * solver > simpset 

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

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

76 

10413  77 
signature META_SIMPLIFIER = 
78 
sig 

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

81 
val solver: simpset > solver > int > tactic 
15023  82 
val clear_ss: simpset > simpset 
83 
exception SIMPROC_FAIL of string * exn 

16458  84 
val simproc_i: theory > string > term list 
85 
> (theory > simpset > term > thm option) > simproc 

86 
val simproc: theory > string > string list 

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

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

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

89 
val the_context: simpset > Context.proof 
17897  90 
val context: Context.proof > simpset > simpset 
91 
val theory_context: theory > simpset > simpset 

17723  92 
val debug_bounds: bool ref 
18208  93 
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

94 
val set_solvers: solver list > simpset > simpset 
11672  95 
val rewrite_cterm: bool * bool * bool > 
15023  96 
(simpset > thm > thm option) > simpset > cterm > thm 
97 
val rewrite_aux: (simpset > thm > thm option) > bool > thm list > cterm > thm 

98 
val simplify_aux: (simpset > thm > thm option) > bool > thm list > thm > thm 

16458  99 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  100 
val rewrite_thm: bool * bool * bool > 
101 
(simpset > thm > thm option) > simpset > thm > thm 

102 
val rewrite_goals_rule_aux: (simpset > thm > thm option) > thm list > thm > thm 

103 
val rewrite_goal_rule: bool * bool * bool > 

104 
(simpset > thm > thm option) > simpset > int > thm > thm 

10413  105 
end; 
106 

15023  107 
structure MetaSimplifier: META_SIMPLIFIER = 
10413  108 
struct 
109 

15023  110 

111 
(** datatype simpset **) 

112 

113 
(* rewrite rules *) 

10413  114 

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

115 
type rrule = {thm: thm, name: string, lhs: term, elhs: cterm, fo: bool, perm: bool}; 
15023  116 

117 
(*thm: the rewrite rule; 

118 
name: name of theorem from which rewrite rule was extracted; 

119 
lhs: the lefthand side; 

120 
elhs: the etaccontracted lhs; 

121 
fo: use firstorder matching; 

122 
perm: the rewrite rule is permutative; 

123 

12603  124 
Remarks: 
10413  125 
 elhs is used for matching, 
15023  126 
lhs only for preservation of bound variable names; 
10413  127 
 fo is set iff 
128 
either elhs is firstorder (no Var is applied), 

15023  129 
in which case fomatching is complete, 
10413  130 
or elhs is not a pattern, 
15023  131 
in which case there is nothing better to do;*) 
10413  132 

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

15023  134 
Drule.eq_thm_prop (thm1, thm2); 
135 

136 

137 
(* congruences *) 

138 

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

10413  140 

12603  141 
fun eq_cong ({thm = thm1, ...}: cong, {thm = thm2, ...}: cong) = 
15023  142 
Drule.eq_thm_prop (thm1, thm2); 
10413  143 

144 

17614  145 
(* simplification sets, procedures, and solvers *) 
15023  146 

147 
(*A simpset contains data required during conversion: 

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

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

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

155 
procs: discrimination net of simplification procedures 

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

15023  157 
mk_rews: 
158 
mk: turn simplification thms into rewrite rules; 

159 
mk_cong: prepare congruence rules; 

160 
mk_sym: turn == around; 

161 
mk_eq_True: turn P into P == True; 

162 
termless: relation for ordered rewriting;*) 

15011  163 

15023  164 
type mk_rews = 
165 
{mk: thm > thm list, 

166 
mk_cong: thm > thm, 

167 
mk_sym: thm > thm option, 

18208  168 
mk_eq_True: thm > thm option, 
169 
reorient: theory > term list > term > term > bool}; 

15023  170 

171 
datatype simpset = 

172 
Simpset of 

173 
{rules: rrule Net.net, 

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

175 
bounds: int * ((string * typ) * string) list, 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

176 
context: Context.proof option} * 
15023  177 
{congs: (string * cong) list * string list, 
178 
procs: proc Net.net, 

179 
mk_rews: mk_rews, 

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

182 
loop_tacs: (string * (simpset > int > tactic)) list, 
15023  183 
solvers: solver list * solver list} 
184 
and proc = 

185 
Proc of 

186 
{name: string, 

187 
lhs: cterm, 

16458  188 
proc: theory > simpset > term > thm option, 
17614  189 
id: stamp} 
190 
and solver = 

191 
Solver of 

192 
{name: string, 

193 
solver: simpset > int > tactic, 

15023  194 
id: stamp}; 
195 

196 

197 
fun rep_ss (Simpset args) = args; 

10413  198 

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

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

200 
{rules = rules, prems = prems, bounds = bounds, context = context}; 
15023  201 

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

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

203 
make_ss1 (f (rules, prems, bounds, context)); 
10413  204 

15023  205 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
206 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

207 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

208 

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

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

211 

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

10413  213 

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

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

216 
make_simpset (f ((rules, prems, bounds, context), 
15023  217 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers))); 
10413  218 

15023  219 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
220 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

221 

17614  222 
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems; 
223 

224 

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

226 

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

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

229 

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

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

231 
fun solver ss (Solver {solver = tac, ...}) = tac ss; 
17614  232 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 
233 
val merge_solvers = gen_merge_lists eq_solver; 

234 

15023  235 

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

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

237 

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

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

239 

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

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

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

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

243 
val simp_depth_limit = ref 100; 
18573  244 
val trace_simp_depth_limit = ref 1; 
245 
val trace_simp_depth_limit_exceeded = ref false; 

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

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

247 

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

248 
fun println a = 
18573  249 
if ! simp_depth > ! trace_simp_depth_limit 
250 
then if !trace_simp_depth_limit_exceeded then () 

251 
else (tracing "trace_simp_depth_limit exceeded!"; 

252 
trace_simp_depth_limit_exceeded := true) 

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

254 
trace_simp_depth_limit_exceeded := false); 

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

255 

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

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

257 

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

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

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

260 
val used = Term.add_term_names (t, []); 
17614  261 
val xs = rev (Term.variantlist (rev (map #2 bs), used)); 
262 
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

263 
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

264 

17705  265 
in 
266 

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

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

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

269 

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

270 
fun debug warn a = if ! debug_simp then prnt warn a else (); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

272 

17705  273 
fun debug_term warn a ss thy t = if ! debug_simp then print_term warn a ss thy t else (); 
274 
fun trace_term warn a ss thy t = if ! trace_simp then print_term warn a ss thy t else (); 

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

275 

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

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

278 

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

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

281 

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

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

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

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

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

287 

17705  288 
fun warn_thm a ss th = print_term true a ss (Thm.theory_of_thm th) (Thm.full_prop_of th); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

289 

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

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

291 

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

292 

15023  293 
(* print simpsets *) 
10413  294 

15023  295 
fun print_ss ss = 
296 
let 

15034  297 
val pretty_thms = map Display.pretty_thm; 
15023  298 

15034  299 
fun pretty_cong (name, th) = 
300 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, Display.pretty_thm th]; 

15023  301 
fun pretty_proc (name, lhss) = 
302 
Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss); 

15034  303 

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

16807  305 
val smps = map #thm (Net.entries rules); 
15034  306 
val cngs = map (fn (name, {thm, ...}) => (name, thm)) (#1 congs); 
16807  307 
val prcs = Net.entries procs > 
308 
map (fn Proc {name, lhs, id, ...} => ((name, lhs), id)) 

17496  309 
> partition_eq (eq_snd (op =)) 
17756  310 
> map (fn ps => (fst (fst (hd ps)), map (snd o fst) ps)) 
311 
> Library.sort_wrt fst; 

15023  312 
in 
15034  313 
[Pretty.big_list "simplification rules:" (pretty_thms smps), 
314 
Pretty.big_list "simplification procedures:" (map pretty_proc prcs), 

315 
Pretty.big_list "congruences:" (map pretty_cong cngs), 

15088  316 
Pretty.strs ("loopers:" :: map (quote o #1) loop_tacs), 
317 
Pretty.strs ("unsafe solvers:" :: map (quote o solver_name) (#1 solvers)), 

318 
Pretty.strs ("safe solvers:" :: map (quote o solver_name) (#2 solvers))] 

15023  319 
> Pretty.chunks > Pretty.writeln 
13828  320 
end; 
10413  321 

15023  322 

323 
(* simprocs *) 

324 

325 
exception SIMPROC_FAIL of string * exn; 

326 

327 
datatype simproc = Simproc of proc list; 

328 

329 
fun mk_simproc name lhss proc = 

330 
let val id = stamp () in 

331 
Simproc (lhss > map (fn lhs => 

332 
Proc {name = name, lhs = lhs, proc = proc, id = id})) 

333 
end; 

334 

16458  335 
fun simproc_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify); 
16807  336 
fun simproc thy name = simproc_i thy name o map (Sign.read_term thy); 
15023  337 

15011  338 

10413  339 

340 
(** simpset operations **) 

341 

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

342 
(* context *) 
10413  343 

17614  344 
fun eq_bound (x: string, (y, _)) = x = y; 
345 

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

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

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

348 

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

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

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

351 

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

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

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

354 

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

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

356 
 the_context _ = raise Fail "Simplifier: no proof context in simpset"; 
10413  357 

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

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

360 

17897  361 
val theory_context = context o Context.init_proof; 
362 

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

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

364 
 fallback_context thy ss = 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

365 
(warning "Simplifier: no proof context in simpset  fallback to theory context!"; 
17897  366 
theory_context thy ss); 
367 

368 

15023  369 
(* addsimps *) 
10413  370 

15023  371 
fun mk_rrule2 {thm, name, lhs, elhs, perm} = 
372 
let 

373 
val fo = Pattern.first_order (term_of elhs) orelse not (Pattern.pattern (term_of elhs)) 

374 
in {thm = thm, name = name, lhs = lhs, elhs = elhs, fo = fo, perm = perm} end; 

10413  375 

15023  376 
fun insert_rrule quiet (ss, rrule as {thm, name, lhs, elhs, perm}) = 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

377 
(trace_named_thm "Adding rewrite rule" ss (thm, name); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

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

382 
in (rules', prems, bounds, context) end) 
15023  383 
handle Net.INSERT => 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

384 
(if quiet then () else warn_thm "Ignoring duplicate rewrite rule:" ss thm; ss)); 
10413  385 

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

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

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

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

390 

391 
fun var_perm (t, u) = 

392 
vperm (t, u) andalso eq_set (term_varnames t, term_varnames u); 

393 

394 
(* FIXME: it seems that the conditions on extra variables are too liberal if 

395 
prems are nonempty: does solving the prems really guarantee instantiation of 

396 
all its Vars? Better: a dynamic check each time a rule is applied. 

397 
*) 

398 
fun rewrite_rule_extra_vars prems elhs erhs = 

16861  399 
not (term_varnames erhs subset fold add_term_varnames prems (term_varnames elhs)) 
10413  400 
orelse 
15023  401 
not (term_tvars erhs subset (term_tvars elhs union List.concat (map term_tvars prems))); 
10413  402 

15023  403 
(*simple test for looping rewrite rules and stupid orientations*) 
18208  404 
fun default_reorient thy prems lhs rhs = 
15023  405 
rewrite_rule_extra_vars prems lhs rhs 
406 
orelse 

407 
is_Var (head_of lhs) 

408 
orelse 

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

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

412 
andalso not(exists_subterm is_Var lhs) 

413 
orelse 

414 
*) 

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

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

422 
is_Const lhs andalso not (is_Const rhs); 

10413  423 

424 
fun decomp_simp thm = 

15023  425 
let 
16458  426 
val {thy, prop, ...} = Thm.rep_thm thm; 
15023  427 
val prems = Logic.strip_imp_prems prop; 
428 
val concl = Drule.strip_imp_concl (Thm.cprop_of thm); 

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

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

431 
val (_, elhs) = Drule.dest_equals (Thm.cprop_of (Thm.eta_conversion lhs)); 

16665  432 
val elhs = if term_of elhs aconv term_of lhs then lhs else elhs; (*share identical copies*) 
18929  433 
val erhs = Envir.eta_contract (term_of rhs); 
15023  434 
val perm = 
435 
var_perm (term_of elhs, erhs) andalso 

436 
not (term_of elhs aconv erhs) andalso 

437 
not (is_Var (term_of elhs)); 

16458  438 
in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end; 
10413  439 

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

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

443 
else (lhs, rhs) 
12783  444 
end; 
445 

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

15531  448 
NONE => [] 
449 
 SOME eq_True => 

15023  450 
let val (_, _, lhs, elhs, _, _) = decomp_simp eq_True 
451 
in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end); 

10413  452 

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

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

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

457 
if term_varnames rhs subset term_varnames lhs andalso 

458 
term_tvars rhs subset term_tvars lhs then [rrule] 

459 
else mk_eq_True ss (thm2, name) @ [rrule] 

10413  460 
end; 
461 

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

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

465 
else 

466 
(*weak test for loops*) 

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

468 
then mk_eq_True ss (thm, name) 

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

10413  470 
end; 
471 

15023  472 
fun orient_rrule ss (thm, name) = 
18208  473 
let 
474 
val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm; 

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

476 
in 

15023  477 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 
16458  478 
else if reorient thy prems lhs rhs then 
479 
if reorient thy prems rhs lhs 

15023  480 
then mk_eq_True ss (thm, name) 
481 
else 

18208  482 
(case mk_sym thm of 
483 
NONE => [] 

484 
 SOME thm' => 

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

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

15023  487 
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) 
10413  488 
end; 
489 

15199  490 
fun extract_rews (Simpset (_, {mk_rews = {mk, ...}, ...}), thms) = 
15570  491 
List.concat (map (fn thm => map (rpair (Thm.name_of_thm thm)) (mk thm)) thms); 
10413  492 

15023  493 
fun orient_comb_simps comb mk_rrule (ss, thms) = 
494 
let 

495 
val rews = extract_rews (ss, thms); 

15570  496 
val rrules = List.concat (map mk_rrule rews); 
497 
in Library.foldl comb (ss, rrules) end; 

10413  498 

15023  499 
fun extract_safe_rrules (ss, thm) = 
15570  500 
List.concat (map (orient_rrule ss) (extract_rews (ss, [thm]))); 
10413  501 

15023  502 
(*add rewrite rules explicitly; do not reorient!*) 
503 
fun ss addsimps thms = 

504 
orient_comb_simps (insert_rrule false) (mk_rrule ss) (ss, thms); 

10413  505 

506 

15023  507 
(* delsimps *) 
10413  508 

15023  509 
fun del_rrule (ss, rrule as {thm, elhs, ...}) = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

511 
(Net.delete_term eq_rrule (term_of elhs, rrule) rules, prems, bounds, context)) 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

512 
handle Net.DELETE => (warn_thm "Rewrite rule not in simpset:" ss thm; ss); 
10413  513 

15023  514 
fun ss delsimps thms = 
515 
orient_comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms); 

516 

517 

518 
(* congs *) 

10413  519 

15531  520 
fun cong_name (Const (a, _)) = SOME a 
521 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

522 
 cong_name _ = NONE; 

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

523 

15023  524 
local 
525 

526 
fun is_full_cong_prems [] [] = true 

527 
 is_full_cong_prems [] _ = false 

528 
 is_full_cong_prems (p :: prems) varpairs = 

529 
(case Logic.strip_assums_concl p of 

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

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

532 
is_Var x andalso forall is_Bound xs andalso 

533 
null (findrep xs) andalso xs = ys andalso 

534 
(x, y) mem varpairs andalso 

535 
is_full_cong_prems prems (varpairs \ (x, y)) 

536 
end 

537 
 _ => false); 

538 

539 
fun is_full_cong thm = 

10413  540 
let 
15023  541 
val prems = prems_of thm and concl = concl_of thm; 
542 
val (lhs, rhs) = Logic.dest_equals concl; 

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

10413  544 
in 
15023  545 
f = g andalso null (findrep (xs @ ys)) andalso length xs = length ys andalso 
546 
is_full_cong_prems prems (xs ~~ ys) 

10413  547 
end; 
548 

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

551 
let 

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

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

18929  554 
(*val lhs = Envir.eta_contract lhs;*) 
15570  555 
val a = valOf (cong_name (head_of (term_of lhs))) handle Option => 
15023  556 
raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm); 
557 
val (alist, weak) = congs; 

558 
val alist2 = overwrite_warn (alist, (a, {lhs = lhs, thm = thm})) 

559 
("Overwriting congruence rule for " ^ quote a); 

560 
val weak2 = if is_full_cong thm then weak else a :: weak; 

561 
in ((alist2, weak2), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 

10413  562 

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

565 
let 

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

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

18929  568 
(*val lhs = Envir.eta_contract lhs;*) 
15570  569 
val a = valOf (cong_name (head_of lhs)) handle Option => 
15023  570 
raise SIMPLIFIER ("Congruence must start with a constant", thm); 
571 
val (alist, _) = congs; 

15570  572 
val alist2 = List.filter (fn (x, _) => x <> a) alist; 
17756  573 
val weak2 = alist2 > List.mapPartial (fn (a, {thm, ...}: cong) => 
15531  574 
if is_full_cong thm then NONE else SOME a); 
15023  575 
in ((alist2, weak2), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 
10413  576 

15023  577 
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f; 
578 

579 
in 

580 

15570  581 
val (op addeqcongs) = Library.foldl add_cong; 
582 
val (op deleqcongs) = Library.foldl del_cong; 

15023  583 

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

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

586 

587 
end; 

10413  588 

589 

15023  590 
(* simprocs *) 
591 

592 
local 

10413  593 

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

594 
fun add_proc (proc as Proc {name, lhs, ...}) ss = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

595 
(trace_cterm false ("Adding simplification procedure " ^ quote name ^ " for") ss lhs; 
15023  596 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  597 
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, 
15023  598 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
599 
handle Net.INSERT => 

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

10413  601 

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

602 
fun del_proc (proc as Proc {name, lhs, ...}) ss = 
15023  603 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  604 
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, 
15023  605 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
606 
handle Net.DELETE => 

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

10413  608 

15023  609 
in 
10413  610 

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

611 
fun ss addsimprocs ps = fold (fn Simproc procs => fold add_proc procs) ps ss; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

612 
fun ss delsimprocs ps = fold (fn Simproc procs => fold del_proc procs) ps ss; 
10413  613 

15023  614 
end; 
10413  615 

616 

617 
(* mk_rews *) 

618 

15023  619 
local 
620 

18208  621 
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True, reorient}, 
15023  622 
termless, subgoal_tac, loop_tacs, solvers) => 
18208  623 
let 
624 
val (mk', mk_cong', mk_sym', mk_eq_True', reorient') = 

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

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

627 
reorient = reorient'}; 

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

15023  629 

630 
in 

10413  631 

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

15023  634 

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

10413  637 

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

10413  640 

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

643 

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

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

15023  646 

647 
end; 

648 

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

649 

10413  650 
(* termless *) 
651 

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

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

655 

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

656 

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

658 

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

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

662 

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

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

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

666 

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

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

668 

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

669 
fun ss addloop' (name, tac) = ss > 
15023  670 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
671 
(congs, procs, mk_rews, termless, subgoal_tac, 

672 
overwrite_warn (loop_tacs, (name, tac)) ("Overwriting looper " ^ quote name), 

673 
solvers)); 

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

674 

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

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

676 

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

17756  679 
let val loop_tacs' = filter_out (equal name o fst) loop_tacs in 
15034  680 
if length loop_tacs <> length loop_tacs' then () 
681 
else warning ("No such looper in simpset: " ^ quote name); 

682 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs', solvers) 

15023  683 
end); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

684 

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

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

688 

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

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

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

692 

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

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

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

696 

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

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

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

700 

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

703 
subgoal_tac, loop_tacs, (solvers, solvers))); 

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

704 

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

705 

18208  706 
(* empty *) 
707 

708 
fun init_ss mk_rews termless subgoal_tac solvers = 

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

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

711 

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

713 
init_ss mk_rews termless subgoal_tac solvers 

714 
> inherit_context ss; 

715 

716 
val basic_mk_rews: mk_rews = 

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

718 
mk_cong = I, 

719 
mk_sym = SOME o Drule.symmetric_fun, 

720 
mk_eq_True = K NONE, 

721 
reorient = default_reorient}; 

722 

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

724 

725 

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

727 

728 
fun merge_ss (ss1, ss2) = 

729 
let 

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

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

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

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

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

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

736 

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

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

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

740 
val congs' = gen_merge_lists (eq_cong o pairself #2) congs1 congs2; 

741 
val weak' = merge_lists weak1 weak2; 

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

743 
val loop_tacs' = merge_alists loop_tacs1 loop_tacs2; 

744 
val unsafe_solvers' = merge_solvers unsafe_solvers1 unsafe_solvers2; 

745 
val solvers' = merge_solvers solvers1 solvers2; 

746 
in 

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

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

749 
end; 

750 

751 

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

752 

10413  753 
(** rewriting **) 
754 

755 
(* 

756 
Uses conversions, see: 

757 
L C Paulson, A higherorder implementation of rewriting, 

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

759 
*) 

760 

15023  761 
val dest_eq = Drule.dest_equals o Thm.cprop_of; 
762 
val lhs_of = #1 o dest_eq; 

763 
val rhs_of = #2 o dest_eq; 

10413  764 

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

765 
fun check_conv msg ss thm thm' = 
10413  766 
let 
767 
val thm'' = transitive thm (transitive 

15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14981
diff
changeset

768 
(symmetric (Drule.beta_eta_conversion (lhs_of thm'))) thm') 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

769 
in if msg then trace_thm "SUCCEEDED" ss thm' else (); SOME thm'' end 
10413  770 
handle THM _ => 
16458  771 
let val {thy, prop = _ $ _ $ prop0, ...} = Thm.rep_thm thm in 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

772 
trace_thm "Proved wrong thm (Check subgoaler?)" ss thm'; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

773 
trace_term false "Should have proved:" ss thy prop0; 
15531  774 
NONE 
10413  775 
end; 
776 

777 

778 
(* mk_procrule *) 

779 

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

780 
fun mk_procrule ss thm = 
15023  781 
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in 
782 
if rewrite_rule_extra_vars prems lhs rhs 

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

783 
then (warn_thm "Extra vars on rhs:" ss thm; []) 
15023  784 
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] 
10413  785 
end; 
786 

787 

15023  788 
(* rewritec: conversion to apply the meta simpset to a term *) 
10413  789 

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

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

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

794 
already in normal form. 

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

796 

10413  797 
val skel0 = Bound 0; 
798 

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

801 
in the lhs.*) 

10413  802 

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

805 
else if exists_Const (fn (c, _) => c mem weak) lhs then skel0 

806 
else rhs; 

807 

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

809 
Otherwise those vars may become instantiated with unnormalized terms 

810 
while the premises are solved.*) 

811 

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

813 
if term_varnames rhs subset term_varnames lhs then uncond_skel args 

10413  814 
else skel0; 
815 

816 
(* 

15023  817 
Rewriting  we try in order: 
10413  818 
(1) beta reduction 
819 
(2) unconditional rewrite rules 

820 
(3) conditional rewrite rules 

821 
(4) simplification procedures 

822 

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

824 
*) 

825 

16458  826 
fun rewritec (prover, thyt, maxt) ss t = 
10413  827 
let 
15023  828 
val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss; 
10413  829 
val eta_thm = Thm.eta_conversion t; 
830 
val eta_t' = rhs_of eta_thm; 

831 
val eta_t = term_of eta_t'; 

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

832 
fun rew {thm, name, lhs, elhs, fo, perm} = 
10413  833 
let 
16458  834 
val {thy, prop, maxidx, ...} = rep_thm thm; 
10413  835 
val (rthm, elhs') = if maxt = ~1 then (thm, elhs) 
836 
else (Thm.incr_indexes (maxt+1) thm, Thm.cterm_incr_indexes (maxt+1) elhs); 

837 
val insts = if fo then Thm.cterm_first_order_match (elhs', eta_t') 

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

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

14643  840 
val prop' = Thm.prop_of thm'; 
10413  841 
val unconditional = (Logic.count_prems (prop',0) = 0); 
842 
val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop') 

843 
in 

11295  844 
if perm andalso not (termless (rhs', lhs')) 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

845 
then (trace_named_thm "Cannot apply permutative rewrite rule" ss (thm, name); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

846 
trace_thm "Term does not become smaller:" ss thm'; NONE) 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

847 
else (trace_named_thm "Applying instance of rewrite rule" ss (thm, name); 
10413  848 
if unconditional 
849 
then 

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

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

852 
val SOME thm'' = check_conv false ss eta_thm thm' 
15531  853 
in SOME (thm'', uncond_skel (congs, lr)) end) 
10413  854 
else 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

855 
(trace_thm "Trying to rewrite:" ss thm'; 
16042  856 
if !simp_depth > !simp_depth_limit 
857 
then let val s = "simp_depth_limit exceeded  giving up" 

858 
in trace false s; warning s; NONE end 

859 
else 

860 
case prover ss thm' of 

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

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

863 
(case check_conv true ss eta_thm thm2 of 
15531  864 
NONE => NONE  
865 
SOME thm2' => 

10413  866 
let val concl = Logic.strip_imp_concl prop 
867 
val lr = Logic.dest_equals concl 

16042  868 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  869 
end 
870 

15531  871 
fun rews [] = NONE 
10413  872 
 rews (rrule :: rrules) = 
15531  873 
let val opt = rew rrule handle Pattern.MATCH => NONE 
874 
in case opt of NONE => rews rrules  some => some end; 

10413  875 

876 
fun sort_rrules rrs = let 

14643  877 
fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of 
10413  878 
Const("==",_) $ _ $ _ => true 
12603  879 
 _ => false 
10413  880 
fun sort [] (re1,re2) = re1 @ re2 
12603  881 
 sort (rr::rrs) (re1,re2) = if is_simple rr 
10413  882 
then sort rrs (rr::re1,re2) 
883 
else sort rrs (re1,rr::re2) 

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

885 

15531  886 
fun proc_rews [] = NONE 
15023  887 
 proc_rews (Proc {name, proc, lhs, ...} :: ps) = 
17203  888 
if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

889 
(debug_term false ("Trying procedure " ^ quote name ^ " on:") ss thyt eta_t; 
13486
54464ea94d6f
exception SIMPROC_FAIL: solid error reporting of simprocs;
wenzelm
parents:
13458
diff
changeset

890 
case transform_failure (curry SIMPROC_FAIL name) 
16458  891 
(fn () => proc thyt ss eta_t) () of 
15531  892 
NONE => (debug false "FAILED"; proc_rews ps) 
893 
 SOME raw_thm => 

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

894 
(trace_thm ("Procedure " ^ quote name ^ " produced rewrite rule:") ss raw_thm; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

897 
"  does not match") ss t; proc_rews ps) 
10413  898 
 some => some))) 
899 
else proc_rews ps; 

900 
in case eta_t of 

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

902 
(beta_conversion false eta_t'), skel0) 
10413  903 
 _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of 
15531  904 
NONE => proc_rews (Net.match_term procs eta_t) 
10413  905 
 some => some) 
906 
end; 

907 

908 

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

910 

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

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

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

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

916 
is handled when congc is called *) 

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

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

918 
val unit = trace_thm "Applying congruence rule:" ss thm'; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

919 
fun err (msg, thm) = (trace_thm msg ss thm; NONE) 
10413  920 
in case prover thm' of 
15531  921 
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

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

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

925 
if op aconv (pairself term_of (dest_equals (cprop_of thm2'))) 
15531  926 
then NONE else SOME thm2') 
10413  927 
end; 
928 

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

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

931 

15531  932 
fun transitive1 NONE NONE = NONE 
933 
 transitive1 (SOME thm1) NONE = SOME thm1 

934 
 transitive1 NONE (SOME thm2) = SOME thm2 

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

10413  936 

15531  937 
fun transitive2 thm = transitive1 (SOME thm); 
938 
fun transitive3 thm = transitive1 thm o SOME; 

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

939 

16458  940 
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = 
10413  941 
let 
15023  942 
fun botc skel ss t = 
15531  943 
if is_Var skel then NONE 
10413  944 
else 
15023  945 
(case subc skel ss t of 
15531  946 
some as SOME thm1 => 
16458  947 
(case rewritec (prover, thy, maxidx) ss (rhs_of thm1) of 
15531  948 
SOME (thm2, skel2) => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

949 
transitive2 (transitive thm1 thm2) 
15023  950 
(botc skel2 ss (rhs_of thm2)) 
15531  951 
 NONE => some) 
952 
 NONE => 

16458  953 
(case rewritec (prover, thy, maxidx) ss t of 
15531  954 
SOME (thm2, skel2) => transitive2 thm2 
15023  955 
(botc skel2 ss (rhs_of thm2)) 
15531  956 
 NONE => NONE)) 
10413  957 

15023  958 
and try_botc ss t = 
959 
(case botc skel0 ss t of 

15531  960 
SOME trec1 => trec1  NONE => (reflexive t)) 
10413  961 

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

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

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

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

968 
val b' = #1 (Term.dest_Free (Thm.term_of v)); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

969 
val _ = conditional (b <> b') (fn () => 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

970 
warning ("Simplifier: renamed bound variable " ^ quote b ^ " to " ^ quote b')); 
17614  971 
val ss' = add_bound ((b', T), a) ss; 
15023  972 
val skel' = case skel of Abs (_, _, sk) => sk  _ => skel0; 
973 
in case botc skel' ss' t' of 

15531  974 
SOME thm => SOME (abstract_rule a v thm) 
975 
 NONE => NONE 

10413  976 
end 
977 
 t $ _ => (case t of 

15023  978 
Const ("==>", _) $ _ => impc t0 ss 
10413  979 
 Abs _ => 
980 
let val thm = beta_conversion false t0 

15023  981 
in case subc skel0 ss (rhs_of thm) of 
15531  982 
NONE => SOME thm 
983 
 SOME thm' => SOME (transitive thm thm') 

10413  984 
end 
985 
 _ => 

986 
let fun appc () = 

987 
let 

988 
val (tskel, uskel) = case skel of 

989 
tskel $ uskel => (tskel, uskel) 

990 
 _ => (skel0, skel0); 

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

991 
val (ct, cu) = Thm.dest_comb t0 
10413  992 
in 
15023  993 
(case botc tskel ss ct of 
15531  994 
SOME thm1 => 
15023  995 
(case botc uskel ss cu of 
15531  996 
SOME thm2 => SOME (combination thm1 thm2) 
997 
 NONE => SOME (combination thm1 (reflexive cu))) 

998 
 NONE => 

15023  999 
(case botc uskel ss cu of 
15531  1000 
SOME thm1 => SOME (combination (reflexive ct) thm1) 
1001 
 NONE => NONE)) 

10413  1002 
end 
1003 
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

1004 
in case cong_name h of 
15531  1005 
SOME a => 
17232  1006 
(case AList.lookup (op =) (fst congs) a of 
15531  1007 
NONE => appc () 
1008 
 SOME cong => 

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

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

1012 
val thm = congc (prover ss) ss maxidx cong t0; 
15570  1013 
val t = getOpt (Option.map rhs_of thm, t0); 
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset

1014 
val (cl, cr) = Thm.dest_comb t 
10413  1015 
val dVar = Var(("", 0), dummyT) 
1016 
val skel = 

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

15023  1018 
in case botc skel ss cl of 
15531  1019 
NONE => thm 
1020 
 SOME thm' => transitive3 thm 

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

1021 
(combination thm' (reflexive cr)) 
10413  1022 
end handle TERM _ => error "congc result" 
1023 
 Pattern.MATCH => appc ())) 

1024 
 _ => appc () 

1025 
end) 

15531  1026 
 _ => NONE) 
10413  1027 

15023  1028 
and impc ct ss = 
1029 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  1030 

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

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

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

1034 
"Cannot add premise as rewrite rule because it contains (type) unknowns:" ss prem; ([], NONE)) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1036 
let val asm = assume prem 
15531  1037 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1038 

15023  1039 
and add_rrules (rrss, asms) ss = 
15570  1040 
Library.foldl (insert_rrule true) (ss, List.concat rrss) > add_prems (List.mapPartial I asms) 
10413  1041 

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

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

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

1044 
val (lhs, rhs) = dest_eq eq; 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

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

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

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

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

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

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

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

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

1056 
Drule.swap_prems_eq) 
10413  1057 
end 
1058 
end 

1059 

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

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

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

1064 
val concl' = 
15570  1065 
Drule.mk_implies (prem, getOpt (Option.map rhs_of eq, concl)); 
1066 
val dprem = Option.map (curry (disch false) prem) 

16458  1067 
in case rewritec (prover, thy, maxidx) ss' concl' of 
15531  1068 
NONE => rebuild prems concl' rrss asms ss (dprem eq) 
15570  1069 
 SOME (eq', _) => transitive2 (Library.foldl (disch false o swap) 
1070 
(valOf (transitive3 (dprem eq) eq'), prems)) 

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

1072 
end 
15023  1073 

1074 
and mut_impc0 prems concl rrss asms ss = 

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

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

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

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

1080 
end 
15023  1081 

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

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

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

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

1086 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1087 
[] [] [] [] ss ~1 changed 
1088 
else rebuild prems' concl rrss' asms' ss 

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

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

1090 

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

1091 
 mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) 
15023  1092 
prems' rrss' asms' eqns ss changed k = 
15531  1093 
case (if k = 0 then NONE else botc skel0 (add_rrules 
15023  1094 
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of 
15531  1095 
NONE => mut_impc prems concl rrss asms (prem :: prems') 
1096 
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed 

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

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

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

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

1101 
val tprems = map term_of prems; 
15570  1102 
val i = 1 + Library.foldl Int.max (~1, map (fn p => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1103 
find_index_eq p tprems) (#hyps (rep_thm eqn))); 
15023  1104 
val (rrs', asm') = rules_of_prem ss prem' 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1106 
(rrs' :: rrss') (asm' :: asms') (SOME (foldr (disch true) 
18470  1107 
(Drule.imp_cong_rule eqn (reflexive (Drule.list_implies 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

1108 
(Library.drop (i, prems), concl)))) (Library.take (i, prems))) :: eqns) ss (length prems') ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1110 

15023  1111 
(*legacy code  only for backwards compatibility*) 
1112 
and nonmut_impc ct ss = 

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

1113 
let val (prem, conc) = dest_implies ct; 
15531  1114 
val thm1 = if simprem then botc skel0 ss prem else NONE; 
15570  1115 
val prem1 = getOpt (Option.map rhs_of thm1, prem); 
15023  1116 
val ss1 = if not useprem then ss else add_rrules 
1117 
(apsnd single (apfst single (rules_of_prem ss prem1))) ss 

1118 
in (case botc skel0 ss1 conc of 

15531  1119 
NONE => (case thm1 of 
1120 
NONE => NONE 

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

1123 
let val thm2' = disch false (prem1, thm2) 
10413  1124 
in (case thm1 of 
15531  1125 
NONE => SOME thm2' 
1126 
 SOME thm1' => 

18470  1127 
SOME (transitive (Drule.imp_cong_rule thm1' (reflexive conc)) thm2')) 
10413  1128 
end) 
1129 
end 

1130 

15023  1131 
in try_botc end; 
10413  1132 

1133 

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

1136 
(* 

1137 
Parameters: 

1138 
mode = (simplify A, 

1139 
use A in simplifying B, 

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

1141 
when simplifying A ==> B 

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

1143 
*) 

1144 

17705  1145 
val debug_bounds = ref false; 
1146 

1147 
fun check_bounds ss ct = conditional (! debug_bounds) (fn () => 

17614  1148 
let 
1149 
val Simpset ({bounds = (_, bounds), ...}, _) = ss; 

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

1151 
if Term.is_bound x andalso not (AList.defined eq_bound bounds x) 

1152 
then insert (op =) x else I 

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

17705  1154 
in 
1155 
if null bs then () 

17723  1156 
else print_term true ("Simplifier: term contains loose bounds: " ^ commas_quote bs) ss 
17705  1157 
(Thm.theory_of_cterm ct) (Thm.term_of ct) 
1158 
end); 

17614  1159 

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

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

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

1162 
val ct = Thm.adjust_maxidx raw_ct; 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1163 
val {thy, t, maxidx, ...} = Thm.rep_cterm ct; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1164 
val ss = fallback_context thy raw_ss; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1165 
val _ = inc simp_depth; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1166 
val _ = conditional (!simp_depth mod 20 = 0) (fn () => 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1167 
warning ("Simplification depth " ^ string_of_int (! simp_depth))); 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1168 
val _ = trace_cterm false "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:" ss ct; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

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

1171 
in dec simp_depth; res end 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1172 
handle exn => (dec simp_depth; raise exn); 
10413  1173 

11760  1174 
(*Rewrite a cterm*) 
17897  1175 
fun rewrite_aux _ _ [] ct = Thm.reflexive ct 
1176 
 rewrite_aux prover full thms ct = 

1177 
rewrite_cterm (full, false, false) prover 

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

11672  1179 

10413  1180 
(*Rewrite a theorem*) 
17897  1181 
fun simplify_aux _ _ [] th = th 
1182 
 simplify_aux prover full thms th = 

1183 
Drule.fconv_rule (rewrite_cterm (full, false, false) prover 

1184 
(theory_context (Thm.theory_of_thm th) empty_ss addsimps thms)) th; 

10413  1185 

15023  1186 
(*simple term rewriting  no proof*) 
16458  1187 
fun rewrite_term thy rules procs = 
17203  1188 
Pattern.rewrite_term thy (map decomp_simp' rules) procs; 
15023  1189 

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

10413  1191 

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

1193 
fun rewrite_goals_rule_aux _ [] th = th 

1194 
 rewrite_goals_rule_aux prover thms th = 

15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14981
diff
changeset

1195 
Drule.fconv_rule (Drule.goals_conv (K true) (rewrite_cterm (true, true, false) prover 
17897  1196 
(theory_context (Thm.theory_of_thm th) empty_ss addsimps thms))) th; 
10413  1197 

15023  1198 
(*Rewrite the subgoal of a proof state (represented by a theorem)*) 
15011  1199 
fun rewrite_goal_rule mode prover ss i thm = 
10413  1200 
if 0 < i andalso i <= nprems_of thm 
15011  1201 
then Drule.fconv_rule (Drule.goals_conv (fn j => j=i) (rewrite_cterm mode prover ss)) thm 
10413  1202 
else raise THM("rewrite_goal_rule",i,[thm]); 
1203 

1204 
end; 

1205 

11672  1206 
structure BasicMetaSimplifier: BASIC_META_SIMPLIFIER = MetaSimplifier; 
1207 
open BasicMetaSimplifier; 