author  nipkow 
Tue, 16 Aug 2005 12:51:07 +0200  
changeset 17046  8da7f68d0893 
parent 16985  7df8abe926c3 
child 17203  29b2563f5c11 
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 
15023  11 
setloop 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 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

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

23 
val mk_solver: string > (thm list > int > tactic) > solver 
15023  24 
type simpset 
25 
type proc 

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, 

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

29 
bounds: int * (string * (string * typ)) list} * 
15023  30 
{congs: (string * cong) list * string list, 
31 
procs: proc Net.net, 

32 
mk_rews: 

33 
{mk: thm > thm list, 

34 
mk_cong: thm > thm, 

35 
mk_sym: thm > thm option, 

36 
mk_eq_True: thm > thm option}, 

37 
termless: term * term > bool, 

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

38 
subgoal_tac: simpset > int > tactic, 
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

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

41 
val print_ss: simpset > unit 
15023  42 
val empty_ss: simpset 
43 
val merge_ss: simpset * simpset > simpset 

44 
type simproc 

45 
val mk_simproc: string > cterm list > 

16458  46 
(theory > simpset > term > thm option) > simproc 
15023  47 
val add_prems: thm list > simpset > simpset 
48 
val prems_of_ss: simpset > thm list 

49 
val addsimps: simpset * thm list > simpset 

50 
val delsimps: simpset * thm list > simpset 

51 
val addeqcongs: simpset * thm list > simpset 

52 
val deleqcongs: simpset * thm list > simpset 

53 
val addcongs: simpset * thm list > simpset 

54 
val delcongs: simpset * thm list > simpset 

55 
val addsimprocs: simpset * simproc list > simpset 

56 
val delsimprocs: simpset * simproc list > simpset 

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

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

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

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

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

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

63 
val setloop: simpset * (int > tactic) > simpset 

64 
val addloop: simpset * (string * (int > tactic)) > simpset 

65 
val delloop: simpset * string > simpset 

66 
val setSSolver: simpset * solver > simpset 

67 
val addSSolver: simpset * solver > simpset 

68 
val setSolver: simpset * solver > simpset 

69 
val addSolver: simpset * solver > simpset 

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

70 
val generic_simp_tac: bool > bool * bool * bool > simpset > int > tactic 
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

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

72 

10413  73 
signature META_SIMPLIFIER = 
74 
sig 

11672  75 
include BASIC_META_SIMPLIFIER 
10413  76 
exception SIMPLIFIER of string * thm 
15023  77 
val clear_ss: simpset > simpset 
78 
exception SIMPROC_FAIL of string * exn 

16458  79 
val simproc_i: theory > string > term list 
80 
> (theory > simpset > term > thm option) > simproc 

81 
val simproc: theory > string > string list 

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

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

83 
val inherit_bounds: simpset > simpset > simpset 
11672  84 
val rewrite_cterm: bool * bool * bool > 
15023  85 
(simpset > thm > thm option) > simpset > cterm > thm 
86 
val rewrite_aux: (simpset > thm > thm option) > bool > thm list > cterm > thm 

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

16458  88 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  89 
val rewrite_thm: bool * bool * bool > 
90 
(simpset > thm > thm option) > simpset > thm > thm 

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

92 
val rewrite_goal_rule: bool * bool * bool > 

93 
(simpset > thm > thm option) > simpset > int > thm > thm 

94 
val asm_rewrite_goal_tac: bool * bool * bool > 

95 
(simpset > tactic) > simpset > int > tactic 

96 
val simp_thm: bool * bool * bool > simpset > thm > thm 

97 
val simp_cterm: bool * bool * bool > simpset > cterm > thm 

10413  98 
end; 
99 

15023  100 
structure MetaSimplifier: META_SIMPLIFIER = 
10413  101 
struct 
102 

15023  103 

104 
(** datatype simpset **) 

105 

106 
(* rewrite rules *) 

10413  107 

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

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

110 
(*thm: the rewrite rule; 

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

112 
lhs: the lefthand side; 

113 
elhs: the etaccontracted lhs; 

114 
fo: use firstorder matching; 

115 
perm: the rewrite rule is permutative; 

116 

12603  117 
Remarks: 
10413  118 
 elhs is used for matching, 
15023  119 
lhs only for preservation of bound variable names; 
10413  120 
 fo is set iff 
121 
either elhs is firstorder (no Var is applied), 

15023  122 
in which case fomatching is complete, 
10413  123 
or elhs is not a pattern, 
15023  124 
in which case there is nothing better to do;*) 
10413  125 

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

15023  127 
Drule.eq_thm_prop (thm1, thm2); 
128 

129 

130 
(* congruences *) 

131 

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

10413  133 

12603  134 
fun eq_cong ({thm = thm1, ...}: cong, {thm = thm2, ...}: cong) = 
15023  135 
Drule.eq_thm_prop (thm1, thm2); 
10413  136 

137 

15023  138 
(* solvers *) 
139 

140 
datatype solver = 

141 
Solver of 

142 
{name: string, 

143 
solver: thm list > int > tactic, 

144 
id: stamp}; 

145 

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

147 

15034  148 
fun solver_name (Solver {name, ...}) = name; 
15023  149 
fun solver ths (Solver {solver = tacf, ...}) = tacf ths; 
150 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 

151 
val merge_solvers = gen_merge_lists eq_solver; 

152 

153 

154 
(* simplification sets and procedures *) 

155 

156 
(*A simpset contains data required during conversion: 

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

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

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

164 
procs: discrimination net of simplification procedures 

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

15023  166 
mk_rews: 
167 
mk: turn simplification thms into rewrite rules; 

168 
mk_cong: prepare congruence rules; 

169 
mk_sym: turn == around; 

170 
mk_eq_True: turn P into P == True; 

171 
termless: relation for ordered rewriting;*) 

15011  172 

15023  173 
type mk_rews = 
174 
{mk: thm > thm list, 

175 
mk_cong: thm > thm, 

176 
mk_sym: thm > thm option, 

177 
mk_eq_True: thm > thm option}; 

178 

179 
datatype simpset = 

180 
Simpset of 

181 
{rules: rrule Net.net, 

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

183 
bounds: int * (string * (string * typ)) list} * 
15023  184 
{congs: (string * cong) list * string list, 
185 
procs: proc Net.net, 

186 
mk_rews: mk_rews, 

11504  187 
termless: term * term > bool, 
15011  188 
subgoal_tac: simpset > int > tactic, 
189 
loop_tacs: (string * (int > tactic)) list, 

15023  190 
solvers: solver list * solver list} 
191 
and proc = 

192 
Proc of 

193 
{name: string, 

194 
lhs: cterm, 

16458  195 
proc: theory > simpset > term > thm option, 
15023  196 
id: stamp}; 
197 

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

199 

200 
fun rep_ss (Simpset args) = args; 

10413  201 

16042  202 
fun make_ss1 (rules, prems, bounds) = 
203 
{rules = rules, prems = prems, bounds = bounds}; 

15023  204 

16042  205 
fun map_ss1 f {rules, prems, bounds} = 
206 
make_ss1 (f (rules, prems, bounds)); 

10413  207 

15023  208 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
209 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

210 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

211 

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

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

214 

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

10413  216 

16042  217 
fun map_simpset f (Simpset ({rules, prems, bounds}, 
15023  218 
{congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers})) = 
16042  219 
make_simpset (f ((rules, prems, bounds), 
15023  220 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers))); 
10413  221 

15023  222 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
223 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

224 

225 

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

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

227 

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

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

229 

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

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

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

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

233 
val simp_depth_limit = ref 100; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

234 
val trace_simp_depth_limit = ref 100; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

235 

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

236 
local 
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 
fun println a = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

239 
if ! simp_depth > ! trace_simp_depth_limit then () 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

240 
else tracing (enclose "[" "]" (string_of_int (! simp_depth)) ^ a); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

241 

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

242 
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

243 

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

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

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

246 
val used = Term.add_term_names (t, []); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

247 
val xs = rev (Term.variantlist (rev (map #1 bs), used)); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

249 
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

250 

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

251 
fun prtm warn a ss thy t = prnt warn (a ^ "\n" ^ 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

252 
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

253 

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

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

257 
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

258 

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

259 
fun debug_term warn a ss thy t = if ! debug_simp then prtm warn a ss thy t else (); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

261 

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

262 
fun trace_cterm warn a ss ct = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

264 

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

265 
fun trace_thm a ss th = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

267 

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

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

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

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

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

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

273 

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

274 
fun warn_thm a ss th = prtm true a ss (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

275 

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

276 
end; 
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 

15023  279 
(* print simpsets *) 
10413  280 

15023  281 
fun print_ss ss = 
282 
let 

15034  283 
val pretty_thms = map Display.pretty_thm; 
15023  284 

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

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

15034  289 

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

16807  291 
val smps = map #thm (Net.entries rules); 
15034  292 
val cngs = map (fn (name, {thm, ...}) => (name, thm)) (#1 congs); 
16807  293 
val prcs = Net.entries procs > 
294 
map (fn Proc {name, lhs, id, ...} => ((name, lhs), id)) 

15034  295 
> partition_eq eq_snd 
296 
> map (fn ps => (#1 (#1 (hd ps)), map (#2 o #1) ps)) 

297 
> Library.sort_wrt #1; 

15023  298 
in 
15034  299 
[Pretty.big_list "simplification rules:" (pretty_thms smps), 
300 
Pretty.big_list "simplification procedures:" (map pretty_proc prcs), 

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

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

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

15023  305 
> Pretty.chunks > Pretty.writeln 
13828  306 
end; 
10413  307 

15023  308 

309 
(* empty simpsets *) 

310 

311 
local 

312 

313 
fun init_ss mk_rews termless subgoal_tac solvers = 

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

314 
make_simpset ((Net.empty, [], (0, [])), 
15023  315 
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); 
316 

317 
val basic_mk_rews: mk_rews = 

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

319 
mk_cong = I, 

15531  320 
mk_sym = SOME o Drule.symmetric_fun, 
321 
mk_eq_True = K NONE}; 

15023  322 

323 
in 

324 

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

326 

327 
fun clear_ss (Simpset (_, {mk_rews, termless, subgoal_tac, solvers, ...})) = 

328 
init_ss mk_rews termless subgoal_tac solvers; 

329 

330 
end; 

331 

332 

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

15011  334 

15023  335 
fun merge_ss (ss1, ss2) = 
336 
let 

16042  337 
val Simpset ({rules = rules1, prems = prems1, bounds = bounds1}, 
15023  338 
{congs = (congs1, weak1), procs = procs1, mk_rews, termless, subgoal_tac, 
339 
loop_tacs = loop_tacs1, solvers = (unsafe_solvers1, solvers1)}) = ss1; 

16042  340 
val Simpset ({rules = rules2, prems = prems2, bounds = bounds2}, 
15023  341 
{congs = (congs2, weak2), procs = procs2, mk_rews = _, termless = _, subgoal_tac = _, 
342 
loop_tacs = loop_tacs2, solvers = (unsafe_solvers2, solvers2)}) = ss2; 

15011  343 

16807  344 
val rules' = Net.merge eq_rrule (rules1, rules2); 
15023  345 
val prems' = gen_merge_lists Drule.eq_thm_prop prems1 prems2; 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

346 
val bounds' = if #1 bounds1 < #1 bounds2 then bounds2 else bounds1; 
15023  347 
val congs' = gen_merge_lists (eq_cong o pairself #2) congs1 congs2; 
348 
val weak' = merge_lists weak1 weak2; 

16807  349 
val procs' = Net.merge eq_proc (procs1, procs2); 
15023  350 
val loop_tacs' = merge_alists loop_tacs1 loop_tacs2; 
351 
val unsafe_solvers' = merge_solvers unsafe_solvers1 unsafe_solvers2; 

352 
val solvers' = merge_solvers solvers1 solvers2; 

353 
in 

16042  354 
make_simpset ((rules', prems', bounds'), ((congs', weak'), procs', 
15023  355 
mk_rews, termless, subgoal_tac, loop_tacs', (unsafe_solvers', solvers'))) 
356 
end; 

357 

358 

359 
(* simprocs *) 

360 

361 
exception SIMPROC_FAIL of string * exn; 

362 

363 
datatype simproc = Simproc of proc list; 

364 

365 
fun mk_simproc name lhss proc = 

366 
let val id = stamp () in 

367 
Simproc (lhss > map (fn lhs => 

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

369 
end; 

370 

16458  371 
fun simproc_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify); 
16807  372 
fun simproc thy name = simproc_i thy name o map (Sign.read_term thy); 
15023  373 

15011  374 

10413  375 

376 
(** simpset operations **) 

377 

15023  378 
(* bounds and prems *) 
10413  379 

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

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

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

382 

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

383 
fun add_bound bound = map_simpset1 (fn (rules, prems, (count, bounds)) => 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

384 
(rules, prems, (count + 1, bound :: bounds))); 
10413  385 

16042  386 
fun add_prems ths = map_simpset1 (fn (rules, prems, bounds) => 
387 
(rules, ths @ prems, bounds)); 

15023  388 

389 
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems; 

10413  390 

391 

15023  392 
(* addsimps *) 
10413  393 

15023  394 
fun mk_rrule2 {thm, name, lhs, elhs, perm} = 
395 
let 

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

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

10413  398 

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

400 
(trace_named_thm "Adding rewrite rule" ss (thm, name); 
16042  401 
ss > map_simpset1 (fn (rules, prems, bounds) => 
15023  402 
let 
403 
val rrule2 as {elhs, ...} = mk_rrule2 rrule; 

16807  404 
val rules' = Net.insert_term eq_rrule (term_of elhs, rrule2) rules; 
16042  405 
in (rules', prems, bounds) end) 
15023  406 
handle Net.INSERT => 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

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

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

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

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

413 

414 
fun var_perm (t, u) = 

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

416 

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

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

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

420 
*) 

421 
fun rewrite_rule_extra_vars prems elhs erhs = 

16861  422 
not (term_varnames erhs subset fold add_term_varnames prems (term_varnames elhs)) 
10413  423 
orelse 
15023  424 
not (term_tvars erhs subset (term_tvars elhs union List.concat (map term_tvars prems))); 
10413  425 

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

430 
is_Var (head_of lhs) 

431 
orelse 

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

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

435 
andalso not(exists_subterm is_Var lhs) 

436 
orelse 

437 
*) 

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

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

445 
is_Const lhs andalso not (is_Const rhs); 

10413  446 

447 
fun decomp_simp thm = 

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

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

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

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

16665  455 
val elhs = if term_of elhs aconv term_of lhs then lhs else elhs; (*share identical copies*) 
15023  456 
val erhs = Pattern.eta_contract (term_of rhs); 
457 
val perm = 

458 
var_perm (term_of elhs, erhs) andalso 

459 
not (term_of elhs aconv erhs) andalso 

460 
not (is_Var (term_of elhs)); 

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

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

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

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

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

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

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

10413  475 

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

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

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

480 
if term_varnames rhs subset term_varnames lhs andalso 

481 
term_tvars rhs subset term_tvars lhs then [rrule] 

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

10413  483 
end; 
484 

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

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

488 
else 

489 
(*weak test for loops*) 

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

491 
then mk_eq_True ss (thm, name) 

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

10413  493 
end; 
494 

15023  495 
fun orient_rrule ss (thm, name) = 
16458  496 
let val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm in 
15023  497 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 
16458  498 
else if reorient thy prems lhs rhs then 
499 
if reorient thy prems rhs lhs 

15023  500 
then mk_eq_True ss (thm, name) 
501 
else 

502 
let val Simpset (_, {mk_rews = {mk_sym, ...}, ...}) = ss in 

503 
(case mk_sym thm of 

15531  504 
NONE => [] 
505 
 SOME thm' => 

15023  506 
let val (_, _, lhs', elhs', rhs', _) = decomp_simp thm' 
507 
in rrule_eq_True (thm', name, lhs', elhs', rhs', ss, thm) end) 

508 
end 

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

10413  510 
end; 
511 

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

15023  515 
fun orient_comb_simps comb mk_rrule (ss, thms) = 
516 
let 

517 
val rews = extract_rews (ss, thms); 

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

10413  520 

15023  521 
fun extract_safe_rrules (ss, thm) = 
15570  522 
List.concat (map (orient_rrule ss) (extract_rews (ss, [thm]))); 
10413  523 

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

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

10413  527 

528 

15023  529 
(* delsimps *) 
10413  530 

15023  531 
fun del_rrule (ss, rrule as {thm, elhs, ...}) = 
16042  532 
ss > map_simpset1 (fn (rules, prems, bounds) => 
16807  533 
(Net.delete_term eq_rrule (term_of elhs, rrule) rules, prems, bounds)) 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

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

538 

539 

540 
(* congs *) 

10413  541 

15531  542 
fun cong_name (Const (a, _)) = SOME a 
543 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

544 
 cong_name _ = NONE; 

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

545 

15023  546 
local 
547 

548 
fun is_full_cong_prems [] [] = true 

549 
 is_full_cong_prems [] _ = false 

550 
 is_full_cong_prems (p :: prems) varpairs = 

551 
(case Logic.strip_assums_concl p of 

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

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

554 
is_Var x andalso forall is_Bound xs andalso 

555 
null (findrep xs) andalso xs = ys andalso 

556 
(x, y) mem varpairs andalso 

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

558 
end 

559 
 _ => false); 

560 

561 
fun is_full_cong thm = 

10413  562 
let 
15023  563 
val prems = prems_of thm and concl = concl_of thm; 
564 
val (lhs, rhs) = Logic.dest_equals concl; 

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

10413  566 
in 
15023  567 
f = g andalso null (findrep (xs @ ys)) andalso length xs = length ys andalso 
568 
is_full_cong_prems prems (xs ~~ ys) 

10413  569 
end; 
570 

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

573 
let 

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

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

576 
(*val lhs = Pattern.eta_contract lhs;*) 

15570  577 
val a = valOf (cong_name (head_of (term_of lhs))) handle Option => 
15023  578 
raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm); 
579 
val (alist, weak) = congs; 

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

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

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

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

10413  584 

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

587 
let 

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

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

590 
(*val lhs = Pattern.eta_contract lhs;*) 

15570  591 
val a = valOf (cong_name (head_of lhs)) handle Option => 
15023  592 
raise SIMPLIFIER ("Congruence must start with a constant", thm); 
593 
val (alist, _) = congs; 

15570  594 
val alist2 = List.filter (fn (x, _) => x <> a) alist; 
595 
val weak2 = alist2 > List.mapPartial (fn (a, {thm, ...}) => 

15531  596 
if is_full_cong thm then NONE else SOME a); 
15023  597 
in ((alist2, weak2), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 
10413  598 

15023  599 
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f; 
600 

601 
in 

602 

15570  603 
val (op addeqcongs) = Library.foldl add_cong; 
604 
val (op deleqcongs) = Library.foldl del_cong; 

15023  605 

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

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

608 

609 
end; 

10413  610 

611 

15023  612 
(* simprocs *) 
613 

614 
local 

10413  615 

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

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

617 
(trace_cterm false ("Adding simplification procedure " ^ quote name ^ " for") ss lhs; 
15023  618 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  619 
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, 
15023  620 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
621 
handle Net.INSERT => 

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

10413  623 

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

624 
fun del_proc (proc as Proc {name, lhs, ...}) ss = 
15023  625 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  626 
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, 
15023  627 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
628 
handle Net.DELETE => 

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

10413  630 

15023  631 
in 
10413  632 

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

633 
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

634 
fun ss delsimprocs ps = fold (fn Simproc procs => fold del_proc procs) ps ss; 
10413  635 

15023  636 
end; 
10413  637 

638 

639 
(* mk_rews *) 

640 

15023  641 
local 
642 

15199  643 
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True}, 
15023  644 
termless, subgoal_tac, loop_tacs, solvers) => 
15199  645 
let val (mk', mk_cong', mk_sym', mk_eq_True') = f (mk, mk_cong, mk_sym, mk_eq_True) in 
646 
(congs, procs, {mk = mk', mk_cong = mk_cong', mk_sym = mk_sym', mk_eq_True = mk_eq_True'}, 

15023  647 
termless, subgoal_tac, loop_tacs, solvers) 
648 
end); 

649 

650 
in 

10413  651 

15199  652 
fun ss setmksimps mk = ss > map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True) => 
653 
(mk, mk_cong, mk_sym, mk_eq_True)); 

15023  654 

15199  655 
fun ss setmkcong mk_cong = ss > map_mk_rews (fn (mk, _, mk_sym, mk_eq_True) => 
656 
(mk, mk_cong, mk_sym, mk_eq_True)); 

10413  657 

15199  658 
fun ss setmksym mk_sym = ss > map_mk_rews (fn (mk, mk_cong, _, mk_eq_True) => 
659 
(mk, mk_cong, mk_sym, mk_eq_True)); 

10413  660 

15199  661 
fun ss setmkeqTrue mk_eq_True = ss > map_mk_rews (fn (mk, mk_cong, mk_sym, _) => 
662 
(mk, mk_cong, mk_sym, mk_eq_True)); 

15023  663 

664 
end; 

665 

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

666 

10413  667 
(* termless *) 
668 

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

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

672 

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

673 

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

675 

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

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

679 

15023  680 
fun ss setloop tac = ss > 
681 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, _, solvers) => 

682 
(congs, procs, mk_rews, termless, subgoal_tac, [("", tac)], solvers)); 

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

683 

15023  684 
fun ss addloop (name, tac) = ss > 
685 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 

686 
(congs, procs, mk_rews, termless, subgoal_tac, 

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

688 
solvers)); 

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

689 

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

15034  692 
let val loop_tacs' = filter_out (equal name o #1) loop_tacs in 
693 
if length loop_tacs <> length loop_tacs' then () 

694 
else warning ("No such looper in simpset: " ^ quote name); 

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

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

697 

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

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

701 

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

704 
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

705 

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

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

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

709 

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

712 
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

713 

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

716 
subgoal_tac, loop_tacs, (solvers, solvers))); 

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

717 

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

718 

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

719 

10413  720 
(** rewriting **) 
721 

722 
(* 

723 
Uses conversions, see: 

724 
L C Paulson, A higherorder implementation of rewriting, 

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

726 
*) 

727 

15023  728 
val dest_eq = Drule.dest_equals o Thm.cprop_of; 
729 
val lhs_of = #1 o dest_eq; 

730 
val rhs_of = #2 o dest_eq; 

10413  731 

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

732 
fun check_conv msg ss thm thm' = 
10413  733 
let 
734 
val thm'' = transitive thm (transitive 

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

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

736 
in if msg then trace_thm "SUCCEEDED" ss thm' else (); SOME thm'' end 
10413  737 
handle THM _ => 
16458  738 
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

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

740 
trace_term false "Should have proved:" ss thy prop0; 
15531  741 
NONE 
10413  742 
end; 
743 

744 

745 
(* mk_procrule *) 

746 

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

747 
fun mk_procrule ss thm = 
15023  748 
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in 
749 
if rewrite_rule_extra_vars prems lhs rhs 

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

750 
then (warn_thm "Extra vars on rhs:" ss thm; []) 
15023  751 
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] 
10413  752 
end; 
753 

754 

15023  755 
(* rewritec: conversion to apply the meta simpset to a term *) 
10413  756 

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

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

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

761 
already in normal form. 

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

763 

10413  764 
val skel0 = Bound 0; 
765 

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

768 
in the lhs.*) 

10413  769 

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

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

773 
else rhs; 

774 

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

776 
Otherwise those vars may become instantiated with unnormalized terms 

777 
while the premises are solved.*) 

778 

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

780 
if term_varnames rhs subset term_varnames lhs then uncond_skel args 

10413  781 
else skel0; 
782 

783 
(* 

15023  784 
Rewriting  we try in order: 
10413  785 
(1) beta reduction 
786 
(2) unconditional rewrite rules 

787 
(3) conditional rewrite rules 

788 
(4) simplification procedures 

789 

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

791 
*) 

792 

16458  793 
fun rewritec (prover, thyt, maxt) ss t = 
10413  794 
let 
15023  795 
val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss; 
10413  796 
val eta_thm = Thm.eta_conversion t; 
797 
val eta_t' = rhs_of eta_thm; 

798 
val eta_t = term_of eta_t'; 

16458  799 
val tsigt = Sign.tsig_of thyt; 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

800 
fun rew {thm, name, lhs, elhs, fo, perm} = 
10413  801 
let 
16458  802 
val {thy, prop, maxidx, ...} = rep_thm thm; 
10413  803 
val (rthm, elhs') = if maxt = ~1 then (thm, elhs) 
804 
else (Thm.incr_indexes (maxt+1) thm, Thm.cterm_incr_indexes (maxt+1) elhs); 

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

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

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

14643  808 
val prop' = Thm.prop_of thm'; 
10413  809 
val unconditional = (Logic.count_prems (prop',0) = 0); 
810 
val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop') 

811 
in 

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

813 
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

814 
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

815 
else (trace_named_thm "Applying instance of rewrite rule" ss (thm, name); 
10413  816 
if unconditional 
817 
then 

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

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

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

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

826 
in trace false s; warning s; NONE end 

827 
else 

828 
case prover ss thm' of 

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

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

831 
(case check_conv true ss eta_thm thm2 of 
15531  832 
NONE => NONE  
833 
SOME thm2' => 

10413  834 
let val concl = Logic.strip_imp_concl prop 
835 
val lr = Logic.dest_equals concl 

16042  836 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  837 
end 
838 

15531  839 
fun rews [] = NONE 
10413  840 
 rews (rrule :: rrules) = 
15531  841 
let val opt = rew rrule handle Pattern.MATCH => NONE 
842 
in case opt of NONE => rews rrules  some => some end; 

10413  843 

844 
fun sort_rrules rrs = let 

14643  845 
fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of 
10413  846 
Const("==",_) $ _ $ _ => true 
12603  847 
 _ => false 
10413  848 
fun sort [] (re1,re2) = re1 @ re2 
12603  849 
 sort (rr::rrs) (re1,re2) = if is_simple rr 
10413  850 
then sort rrs (rr::re1,re2) 
851 
else sort rrs (re1,rr::re2) 

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

853 

15531  854 
fun proc_rews [] = NONE 
15023  855 
 proc_rews (Proc {name, proc, lhs, ...} :: ps) = 
856 
if Pattern.matches tsigt (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

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

858 
case transform_failure (curry SIMPROC_FAIL name) 
16458  859 
(fn () => proc thyt ss eta_t) () of 
15531  860 
NONE => (debug false "FAILED"; proc_rews ps) 
861 
 SOME raw_thm => 

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

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

863 
(case rews (mk_procrule ss raw_thm) of 
15531  864 
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

865 
"  does not match") ss t; proc_rews ps) 
10413  866 
 some => some))) 
867 
else proc_rews ps; 

868 
in case eta_t of 

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

870 
(beta_conversion false eta_t'), skel0) 
10413  871 
 _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of 
15531  872 
NONE => proc_rews (Net.match_term procs eta_t) 
10413  873 
 some => some) 
874 
end; 

875 

876 

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

878 

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

879 
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

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

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

884 
is handled when congc is called *) 

885 
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

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

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

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

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

893 
if op aconv (pairself term_of (dest_equals (cprop_of thm2'))) 
15531  894 
then NONE else SOME thm2') 
10413  895 
end; 
896 

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

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

899 

15531  900 
fun transitive1 NONE NONE = NONE 
901 
 transitive1 (SOME thm1) NONE = SOME thm1 

902 
 transitive1 NONE (SOME thm2) = SOME thm2 

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

10413  904 

15531  905 
fun transitive2 thm = transitive1 (SOME thm); 
906 
fun transitive3 thm = transitive1 thm o SOME; 

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

907 

16458  908 
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = 
10413  909 
let 
15023  910 
fun botc skel ss t = 
15531  911 
if is_Var skel then NONE 
10413  912 
else 
15023  913 
(case subc skel ss t of 
15531  914 
some as SOME thm1 => 
16458  915 
(case rewritec (prover, thy, maxidx) ss (rhs_of thm1) of 
15531  916 
SOME (thm2, skel2) => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

917 
transitive2 (transitive thm1 thm2) 
15023  918 
(botc skel2 ss (rhs_of thm2)) 
15531  919 
 NONE => some) 
920 
 NONE => 

16458  921 
(case rewritec (prover, thy, maxidx) ss t of 
15531  922 
SOME (thm2, skel2) => transitive2 thm2 
15023  923 
(botc skel2 ss (rhs_of thm2)) 
15531  924 
 NONE => NONE)) 
10413  925 

15023  926 
and try_botc ss t = 
927 
(case botc skel0 ss t of 

15531  928 
SOME trec1 => trec1  NONE => (reflexive t)) 
10413  929 

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

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

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

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

936 
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

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

938 
warning ("Simplifier: renamed bound variable " ^ quote b ^ " to " ^ quote b')); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

939 
val ss' = add_bound (a, (b', T)) ss; 
15023  940 
val skel' = case skel of Abs (_, _, sk) => sk  _ => skel0; 
941 
in case botc skel' ss' t' of 

15531  942 
SOME thm => SOME (abstract_rule a v thm) 
943 
 NONE => NONE 

10413  944 
end 
945 
 t $ _ => (case t of 

15023  946 
Const ("==>", _) $ _ => impc t0 ss 
10413  947 
 Abs _ => 
948 
let val thm = beta_conversion false t0 

15023  949 
in case subc skel0 ss (rhs_of thm) of 
15531  950 
NONE => SOME thm 
951 
 SOME thm' => SOME (transitive thm thm') 

10413  952 
end 
953 
 _ => 

954 
let fun appc () = 

955 
let 

956 
val (tskel, uskel) = case skel of 

957 
tskel $ uskel => (tskel, uskel) 

958 
 _ => (skel0, skel0); 

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

959 
val (ct, cu) = Thm.dest_comb t0 
10413  960 
in 
15023  961 
(case botc tskel ss ct of 
15531  962 
SOME thm1 => 
15023  963 
(case botc uskel ss cu of 
15531  964 
SOME thm2 => SOME (combination thm1 thm2) 
965 
 NONE => SOME (combination thm1 (reflexive cu))) 

966 
 NONE => 

15023  967 
(case botc uskel ss cu of 
15531  968 
SOME thm1 => SOME (combination (reflexive ct) thm1) 
969 
 NONE => NONE)) 

10413  970 
end 
971 
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

972 
in case cong_name h of 
15531  973 
SOME a => 
10413  974 
(case assoc_string (fst congs, a) of 
15531  975 
NONE => appc () 
976 
 SOME cong => 

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

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

980 
val thm = congc (prover ss) ss maxidx cong t0; 
15570  981 
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

982 
val (cl, cr) = Thm.dest_comb t 
10413  983 
val dVar = Var(("", 0), dummyT) 
984 
val skel = 

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

15023  986 
in case botc skel ss cl of 
15531  987 
NONE => thm 
988 
 SOME thm' => transitive3 thm 

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

989 
(combination thm' (reflexive cr)) 
10413  990 
end handle TERM _ => error "congc result" 
991 
 Pattern.MATCH => appc ())) 

992 
 _ => appc () 

993 
end) 

15531  994 
 _ => NONE) 
10413  995 

15023  996 
and impc ct ss = 
997 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  998 

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

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

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

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

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

1004 
let val asm = assume prem 
15531  1005 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1006 

15023  1007 
and add_rrules (rrss, asms) ss = 
15570  1008 
Library.foldl (insert_rrule true) (ss, List.concat rrss) > add_prems (List.mapPartial I asms) 
10413  1009 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1024 
Drule.swap_prems_eq) 
10413  1025 
end 
1026 
end 

1027 

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

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

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

1032 
val concl' = 
15570  1033 
Drule.mk_implies (prem, getOpt (Option.map rhs_of eq, concl)); 
1034 
val dprem = Option.map (curry (disch false) prem) 

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

15023  1039 
(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

1040 
end 
15023  1041 

1042 
and mut_impc0 prems concl rrss asms ss = 

13607
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 prems' = strip_imp_prems concl; 
15023  1045 
val (rrss', asms') = split_list (map (rules_of_prem ss) prems') 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1048 
end 
15023  1049 

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

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

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

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

1054 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1055 
[] [] [] [] ss ~1 changed 
1056 
else rebuild prems' concl rrss' asms' ss 

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

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

1058 

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

1059 
 mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) 
15023  1060 
prems' rrss' asms' eqns ss changed k = 
15531  1061 
case (if k = 0 then NONE else botc skel0 (add_rrules 
15023  1062 
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of 
15531  1063 
NONE => mut_impc prems concl rrss asms (prem :: prems') 
1064 
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed 

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

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

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

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

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

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

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

1074 
(rrs' :: rrss') (asm' :: asms') (SOME (foldr (disch true) 
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

1075 
(Drule.imp_cong' eqn (reflexive (Drule.list_implies 
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

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

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

1078 

15023  1079 
(*legacy code  only for backwards compatibility*) 
1080 
and nonmut_impc ct ss = 

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

1081 
let val (prem, conc) = dest_implies ct; 
15531  1082 
val thm1 = if simprem then botc skel0 ss prem else NONE; 
15570  1083 
val prem1 = getOpt (Option.map rhs_of thm1, prem); 
15023  1084 
val ss1 = if not useprem then ss else add_rrules 
1085 
(apsnd single (apfst single (rules_of_prem ss prem1))) ss 

1086 
in (case botc skel0 ss1 conc of 

15531  1087 
NONE => (case thm1 of 
1088 
NONE => NONE 

1089 
 SOME thm1' => SOME (Drule.imp_cong' thm1' (reflexive conc))) 

1090 
 SOME thm2 => 

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

1091 
let val thm2' = disch false (prem1, thm2) 
10413  1092 
in (case thm1 of 
15531  1093 
NONE => SOME thm2' 
1094 
 SOME thm1' => 

1095 
SOME (transitive (Drule.imp_cong' thm1' (reflexive conc)) thm2')) 

10413  1096 
end) 
1097 
end 

1098 

15023  1099 
in try_botc end; 
10413  1100 

1101 

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

1104 
(* 

1105 
Parameters: 

1106 
mode = (simplify A, 

1107 
use A in simplifying B, 

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

1109 
when simplifying A ==> B 

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

1111 
*) 

1112 

15023  1113 
fun rewrite_cterm mode prover ss ct = 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1114 
(inc simp_depth; 
17046
8da7f68d0893
simp_depth warning now mod 20, not mod 10 (too often)
nipkow
parents:
16985
diff
changeset

1115 
if !simp_depth mod 20 = 0 
16042  1116 
then warning ("Simplification depth " ^ string_of_int (!simp_depth)) 
1117 
else (); 

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

1118 
trace_cterm false "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:" ss ct; 
16458  1119 
let val {thy, t, maxidx, ...} = Thm.rep_cterm ct 
1120 
val res = bottomc (mode, prover, thy, maxidx) ss ct 

16042  1121 
handle THM (s, _, thms) => 
1122 
error ("Exception THM was raised in simplifier:\n" ^ s ^ "\n" ^ 

1123 
Pretty.string_of (Display.pretty_thms thms)) 

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

1124 
in dec simp_depth; res end 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1125 
) handle exn => (dec simp_depth; raise exn); 
10413  1126 

11760  1127 
(*Rewrite a cterm*) 
11767  1128 
fun rewrite_aux _ _ [] = (fn ct => Thm.reflexive ct) 
15023  1129 
 rewrite_aux prover full thms = 
1130 
rewrite_cterm (full, false, false) prover (empty_ss addsimps thms); 

11672  1131 

10413  1132 
(*Rewrite a theorem*) 
11767  1133 
fun simplify_aux _ _ [] = (fn th => th) 
1134 
 simplify_aux prover full thms = 

15023  1135 
Drule.fconv_rule (rewrite_cterm (full, false, false) prover (empty_ss addsimps thms)); 
10413  1136 

15023  1137 
(*simple term rewriting  no proof*) 
16458  1138 
fun rewrite_term thy rules procs = 
1139 
Pattern.rewrite_term (Sign.tsig_of thy) (map decomp_simp' rules) procs; 

15023  1140 

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

10413  1142 

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

1144 
fun rewrite_goals_rule_aux _ [] th = th 

1145 
 rewrite_goals_rule_aux prover thms th = 

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

1146 
Drule.fconv_rule (Drule.goals_conv (K true) (rewrite_cterm (true, true, false) prover 
15023  1147 
(empty_ss addsimps thms))) th; 
10413  1148 

15023  1149 
(*Rewrite the subgoal of a proof state (represented by a theorem)*) 
15011  1150 
fun rewrite_goal_rule mode prover ss i thm = 
10413  1151 
if 0 < i andalso i <= nprems_of thm 
15011  1152 
then Drule.fconv_rule (Drule.goals_conv (fn j => j=i) (rewrite_cterm mode prover ss)) thm 
10413  1153 
else raise THM("rewrite_goal_rule",i,[thm]); 
1154 

15023  1155 
(*Rewrite subgoal i only. SELECT_GOAL avoids inefficiencies in goals_conv.*) 
1156 
fun asm_rewrite_goal_tac mode prover_tac ss = 

1157 
SELECT_GOAL 

1158 
(PRIMITIVE (rewrite_goal_rule mode (SINGLE o prover_tac) ss 1)); 

12783  1159 

15023  1160 

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

1161 

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

1163 

15023  1164 
fun solve_all_tac solvers ss = 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

1165 
let 
15023  1166 
val Simpset (_, {subgoal_tac, ...}) = ss; 
1167 
val solve_tac = subgoal_tac (set_solvers solvers ss) THEN_ALL_NEW (K no_tac); 

1168 
in DEPTH_SOLVE (solve_tac 1) end; 

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

1169 

15023  1170 
(*NOTE: may instantiate unknowns that appear also in other subgoals*) 
1171 
fun generic_simp_tac safe mode ss = 

1172 
let 

1173 
val Simpset ({prems, ...}, {loop_tacs, solvers = (unsafe_solvers, solvers), ...}) = ss; 

1174 
val loop_tac = FIRST' (map #2 loop_tacs); 

1175 
val solve_tac = FIRST' (map (solver prems) (if safe then solvers else unsafe_solvers)); 

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

1176 

15023  1177 
fun simp_loop_tac i = 
1178 
asm_rewrite_goal_tac mode (solve_all_tac unsafe_solvers) ss i THEN 

1179 
(solve_tac i ORELSE TRY ((loop_tac THEN_ALL_NEW simp_loop_tac) i)); 

1180 
in simp_loop_tac end; 

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

1181 

15023  1182 
fun simp rew mode ss thm = 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

1183 
let 
15023  1184 
val Simpset (_, {solvers = (unsafe_solvers, _), ...}) = ss; 
1185 
val tacf = solve_all_tac unsafe_solvers; 

15570  1186 
fun prover s th = Option.map #1 (Seq.pull (tacf s th)); 
15011  1187 
in rew mode prover ss thm end; 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

1188 

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

1189 
val simp_thm = simp rewrite_thm; 
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

1190 
val simp_cterm = simp rewrite_cterm; 
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

1191 

10413  1192 
end; 
1193 

11672  1194 
structure BasicMetaSimplifier: BASIC_META_SIMPLIFIER = MetaSimplifier; 
1195 
open BasicMetaSimplifier; 