author | wenzelm |
Fri, 28 Mar 2008 22:39:43 +0100 | |
changeset 26472 | 9afdd61cf528 |
parent 26463 | 9283b4185fdf |
child 26762 | 78ed28528ca6 |
permissions | -rw-r--r-- |
5824 | 1 |
(* Title: Pure/Isar/method.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
17110 | 5 |
Isar proof methods. |
5824 | 6 |
*) |
7 |
||
8 |
signature BASIC_METHOD = |
|
9 |
sig |
|
17110 | 10 |
val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq |
11 |
val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq |
|
12 |
type method |
|
11731 | 13 |
val trace_rules: bool ref |
5824 | 14 |
val print_methods: theory -> unit |
15 |
end; |
|
16 |
||
17 |
signature METHOD = |
|
18 |
sig |
|
19 |
include BASIC_METHOD |
|
25957
2cfb703fa8d8
improved apply: handle thread position, apply to context here;
wenzelm
parents:
25699
diff
changeset
|
20 |
val apply: Position.T -> (Proof.context -> method) -> Proof.context -> thm list -> cases_tactic |
18227 | 21 |
val RAW_METHOD_CASES: (thm list -> cases_tactic) -> method |
17110 | 22 |
val RAW_METHOD: (thm list -> tactic) -> method |
18227 | 23 |
val METHOD_CASES: (thm list -> cases_tactic) -> method |
17110 | 24 |
val METHOD: (thm list -> tactic) -> method |
25 |
val fail: method |
|
26 |
val succeed: method |
|
27 |
val insert_tac: thm list -> int -> tactic |
|
28 |
val insert: thm list -> method |
|
29 |
val insert_facts: method |
|
30 |
val SIMPLE_METHOD: tactic -> method |
|
21592 | 31 |
val SIMPLE_METHOD': (int -> tactic) -> method |
32 |
val SIMPLE_METHOD'': ((int -> tactic) -> tactic) -> (int -> tactic) -> method |
|
17110 | 33 |
val defer: int option -> method |
34 |
val prefer: int -> method |
|
20289 | 35 |
val cheating: bool -> Proof.context -> method |
17110 | 36 |
val intro: thm list -> method |
37 |
val elim: thm list -> method |
|
20289 | 38 |
val unfold: thm list -> Proof.context -> method |
39 |
val fold: thm list -> Proof.context -> method |
|
17110 | 40 |
val atomize: bool -> method |
41 |
val this: method |
|
20289 | 42 |
val fact: thm list -> Proof.context -> method |
43 |
val assumption: Proof.context -> method |
|
44 |
val close: bool -> Proof.context -> method |
|
45 |
val trace: Proof.context -> thm list -> unit |
|
6091 | 46 |
val rule_tac: thm list -> thm list -> int -> tactic |
20289 | 47 |
val some_rule_tac: thm list -> Proof.context -> thm list -> int -> tactic |
25270 | 48 |
val intros_tac: thm list -> thm list -> tactic |
17110 | 49 |
val rule: thm list -> method |
50 |
val erule: int -> thm list -> method |
|
51 |
val drule: int -> thm list -> method |
|
52 |
val frule: int -> thm list -> method |
|
20289 | 53 |
val iprover_tac: Proof.context -> int option -> int -> tactic |
26472
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
54 |
val set_tactic: (Proof.context -> thm list -> tactic) -> Proof.context -> Proof.context |
26385
ae7564661e76
ML runtime compilation: pass position, tuned signature;
wenzelm
parents:
26291
diff
changeset
|
55 |
val tactic: string * Position.T -> Proof.context -> method |
17110 | 56 |
type src |
5824 | 57 |
datatype text = |
23349 | 58 |
Basic of (Proof.context -> method) * Position.T | |
15703 | 59 |
Source of src | |
20030 | 60 |
Source_i of src | |
5824 | 61 |
Then of text list | |
62 |
Orelse of text list | |
|
63 |
Try of text | |
|
19186 | 64 |
Repeat1 of text | |
65 |
SelectGoals of int * text |
|
17857 | 66 |
val primitive_text: (thm -> thm) -> text |
67 |
val succeed_text: text |
|
17110 | 68 |
val default_text: text |
69 |
val this_text: text |
|
70 |
val done_text: text |
|
17356
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
71 |
val sorry_text: bool -> text |
23349 | 72 |
val finish_text: text option * bool -> Position.T -> text |
20289 | 73 |
val method: theory -> src -> Proof.context -> method |
74 |
val method_i: theory -> src -> Proof.context -> method |
|
75 |
val add_methods: (bstring * (src -> Proof.context -> method) * string) list |
|
17110 | 76 |
-> theory -> theory |
20289 | 77 |
val add_method: bstring * (src -> Proof.context -> method) * string |
17110 | 78 |
-> theory -> theory |
26385
ae7564661e76
ML runtime compilation: pass position, tuned signature;
wenzelm
parents:
26291
diff
changeset
|
79 |
val method_setup: bstring -> string * Position.T -> string -> theory -> theory |
18999 | 80 |
val syntax: (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) |
21879 | 81 |
-> src -> Proof.context -> 'a * Proof.context |
17110 | 82 |
val simple_args: (Args.T list -> 'a * Args.T list) |
20289 | 83 |
-> ('a -> Proof.context -> method) -> src -> Proof.context -> method |
84 |
val ctxt_args: (Proof.context -> method) -> src -> Proof.context -> method |
|
85 |
val no_args: method -> src -> Proof.context -> method |
|
17110 | 86 |
type modifier |
18999 | 87 |
val sectioned_args: (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) -> |
17110 | 88 |
(Args.T list -> modifier * Args.T list) list -> |
20289 | 89 |
('a -> Proof.context -> 'b) -> src -> Proof.context -> 'b |
17110 | 90 |
val bang_sectioned_args: |
91 |
(Args.T list -> modifier * Args.T list) list -> |
|
20289 | 92 |
(thm list -> Proof.context -> 'a) -> src -> Proof.context -> 'a |
17110 | 93 |
val bang_sectioned_args': |
94 |
(Args.T list -> modifier * Args.T list) list -> |
|
18999 | 95 |
(Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) -> |
20289 | 96 |
('a -> thm list -> Proof.context -> 'b) -> src -> Proof.context -> 'b |
17110 | 97 |
val only_sectioned_args: |
98 |
(Args.T list -> modifier * Args.T list) list -> |
|
20289 | 99 |
(Proof.context -> 'a) -> src -> Proof.context -> 'a |
100 |
val thms_ctxt_args: (thm list -> Proof.context -> 'a) -> src -> |
|
101 |
Proof.context -> 'a |
|
102 |
val thms_args: (thm list -> 'a) -> src -> Proof.context -> 'a |
|
103 |
val thm_args: (thm -> 'a) -> src -> Proof.context -> 'a |
|
9539 | 104 |
val goal_args: (Args.T list -> 'a * Args.T list) -> ('a -> int -> tactic) |
20289 | 105 |
-> src -> Proof.context -> method |
18999 | 106 |
val goal_args': (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) |
20289 | 107 |
-> ('a -> int -> tactic) -> src -> Proof.context -> method |
17110 | 108 |
val goal_args_ctxt: (Args.T list -> 'a * Args.T list) -> |
20289 | 109 |
(Proof.context -> 'a -> int -> tactic) -> src -> Proof.context -> method |
18999 | 110 |
val goal_args_ctxt': (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) -> |
20289 | 111 |
(Proof.context -> 'a -> int -> tactic) -> src -> Proof.context -> method |
22118 | 112 |
val parse: OuterLex.token list -> text * OuterLex.token list |
5824 | 113 |
end; |
114 |
||
115 |
structure Method: METHOD = |
|
116 |
struct |
|
117 |
||
17110 | 118 |
(** generic tools **) |
119 |
||
120 |
(* goal addressing *) |
|
121 |
||
122 |
fun FINDGOAL tac st = |
|
123 |
let fun find i n = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1) n) |
|
124 |
in find 1 (Thm.nprems_of st) st end; |
|
125 |
||
126 |
fun HEADGOAL tac = tac 1; |
|
127 |
||
128 |
||
5824 | 129 |
|
12324
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
130 |
(** proof methods **) |
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
131 |
|
17110 | 132 |
(* datatype method *) |
11731 | 133 |
|
18227 | 134 |
datatype method = Meth of thm list -> cases_tactic; |
11731 | 135 |
|
25957
2cfb703fa8d8
improved apply: handle thread position, apply to context here;
wenzelm
parents:
25699
diff
changeset
|
136 |
fun apply pos meth_fun ctxt facts goal = Position.setmp_thread_data_seq pos |
2cfb703fa8d8
improved apply: handle thread position, apply to context here;
wenzelm
parents:
25699
diff
changeset
|
137 |
(fn () => let val Meth meth = meth_fun ctxt in meth facts goal end) (); |
11731 | 138 |
|
17756 | 139 |
val RAW_METHOD_CASES = Meth; |
11731 | 140 |
|
17110 | 141 |
fun RAW_METHOD tac = RAW_METHOD_CASES (NO_CASES o tac); |
12144 | 142 |
|
17110 | 143 |
fun METHOD_CASES tac = RAW_METHOD_CASES (fn facts => |
21687 | 144 |
Seq.THEN (ALLGOALS Goal.conjunction_tac, tac facts)); |
8372 | 145 |
|
21687 | 146 |
fun METHOD tac = RAW_METHOD (fn facts => ALLGOALS Goal.conjunction_tac THEN tac facts); |
5824 | 147 |
|
148 |
val fail = METHOD (K no_tac); |
|
149 |
val succeed = METHOD (K all_tac); |
|
150 |
||
151 |
||
17110 | 152 |
(* insert facts *) |
7419 | 153 |
|
154 |
local |
|
5824 | 155 |
|
21579 | 156 |
fun cut_rule_tac rule = |
157 |
Tactic.rtac (Drule.forall_intr_vars rule COMP_INCR revcut_rl); |
|
6981 | 158 |
|
7419 | 159 |
in |
5824 | 160 |
|
7419 | 161 |
fun insert_tac [] i = all_tac |
162 |
| insert_tac facts i = EVERY (map (fn th => cut_rule_tac th i) facts); |
|
6981 | 163 |
|
7555 | 164 |
val insert_facts = METHOD (ALLGOALS o insert_tac); |
7664 | 165 |
fun insert thms = METHOD (fn _ => ALLGOALS (insert_tac thms)); |
7419 | 166 |
|
9706 | 167 |
fun SIMPLE_METHOD tac = METHOD (fn facts => ALLGOALS (insert_tac facts) THEN tac); |
21592 | 168 |
fun SIMPLE_METHOD'' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac)); |
169 |
val SIMPLE_METHOD' = SIMPLE_METHOD'' HEADGOAL; |
|
9706 | 170 |
|
12324
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
171 |
end; |
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
172 |
|
9706 | 173 |
|
17110 | 174 |
(* shuffle subgoals *) |
175 |
||
176 |
fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1))); |
|
18939 | 177 |
fun defer opt_i = METHOD (K (Tactic.defer_tac (the_default 1 opt_i))); |
17110 | 178 |
|
179 |
||
17356
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
180 |
(* cheating *) |
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
181 |
|
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
182 |
fun cheating int ctxt = METHOD (K (setmp quick_and_dirty (int orelse ! quick_and_dirty) |
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
183 |
(SkipProof.cheat_tac (ProofContext.theory_of ctxt)))); |
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
184 |
|
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
185 |
|
17110 | 186 |
(* unfold intro/elim rules *) |
187 |
||
21592 | 188 |
fun intro ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.match_tac ths)); |
189 |
fun elim ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.ematch_tac ths)); |
|
17110 | 190 |
|
191 |
||
12384 | 192 |
(* unfold/fold definitions *) |
193 |
||
18877 | 194 |
fun unfold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.unfold_tac ctxt ths)); |
195 |
fun fold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.fold_tac ctxt ths)); |
|
6532 | 196 |
|
12384 | 197 |
|
12829 | 198 |
(* atomize rule statements *) |
199 |
||
23590
ad95084a5c63
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23577
diff
changeset
|
200 |
fun atomize false = SIMPLE_METHOD' (CHANGED_PROP o ObjectLogic.atomize_prems_tac) |
12829 | 201 |
| atomize true = RAW_METHOD (K (HEADGOAL (CHANGED_PROP o ObjectLogic.full_atomize_tac))); |
202 |
||
203 |
||
18039 | 204 |
(* this -- resolve facts directly *) |
12384 | 205 |
|
17110 | 206 |
val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac)); |
9484 | 207 |
|
208 |
||
18039 | 209 |
(* fact -- composition by facts from context *) |
210 |
||
21592 | 211 |
fun fact [] ctxt = SIMPLE_METHOD' (ProofContext.some_fact_tac ctxt) |
212 |
| fact rules _ = SIMPLE_METHOD' (ProofContext.fact_tac rules); |
|
18039 | 213 |
|
214 |
||
17110 | 215 |
(* assumption *) |
7419 | 216 |
|
217 |
local |
|
218 |
||
19778 | 219 |
fun cond_rtac cond rule = SUBGOAL (fn (prop, i) => |
220 |
if cond (Logic.strip_assums_concl prop) |
|
221 |
then Tactic.rtac rule i else no_tac); |
|
7419 | 222 |
|
25957
2cfb703fa8d8
improved apply: handle thread position, apply to context here;
wenzelm
parents:
25699
diff
changeset
|
223 |
fun legacy_tac st = |
2cfb703fa8d8
improved apply: handle thread position, apply to context here;
wenzelm
parents:
25699
diff
changeset
|
224 |
(legacy_feature |
26291 | 225 |
("Implicit use of prems in assumption proof" ^ Position.str_of (Position.thread_data ())); |
23395
15fb6637690e
method assumption: uniform treatment of prems as legacy feature;
wenzelm
parents:
23349
diff
changeset
|
226 |
all_tac st); |
15fb6637690e
method assumption: uniform treatment of prems as legacy feature;
wenzelm
parents:
23349
diff
changeset
|
227 |
|
15fb6637690e
method assumption: uniform treatment of prems as legacy feature;
wenzelm
parents:
23349
diff
changeset
|
228 |
fun assm_tac ctxt = |
17110 | 229 |
assume_tac APPEND' |
23349 | 230 |
Goal.assume_rule_tac ctxt APPEND' |
25957
2cfb703fa8d8
improved apply: handle thread position, apply to context here;
wenzelm
parents:
25699
diff
changeset
|
231 |
(CHANGED o solve_tac (Assumption.prems_of ctxt) THEN' K legacy_tac) APPEND' |
19778 | 232 |
cond_rtac (can Logic.dest_equals) Drule.reflexive_thm APPEND' |
233 |
cond_rtac (can Logic.dest_term) Drule.termI; |
|
17110 | 234 |
|
7419 | 235 |
in |
236 |
||
23349 | 237 |
fun assumption ctxt = METHOD (HEADGOAL o |
23395
15fb6637690e
method assumption: uniform treatment of prems as legacy feature;
wenzelm
parents:
23349
diff
changeset
|
238 |
(fn [] => assm_tac ctxt |
23349 | 239 |
| [fact] => solve_tac [fact] |
240 |
| _ => K no_tac)); |
|
241 |
||
17356
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
242 |
fun close immed ctxt = METHOD (K |
23349 | 243 |
(FILTER Thm.no_prems |
23395
15fb6637690e
method assumption: uniform treatment of prems as legacy feature;
wenzelm
parents:
23349
diff
changeset
|
244 |
((if immed then ALLGOALS (assm_tac ctxt) else all_tac) THEN flexflex_tac))); |
7419 | 245 |
|
246 |
end; |
|
247 |
||
248 |
||
17110 | 249 |
(* rule etc. -- single-step refinements *) |
12347 | 250 |
|
17110 | 251 |
val trace_rules = ref false; |
12347 | 252 |
|
17110 | 253 |
fun trace ctxt rules = |
21962 | 254 |
if ! trace_rules andalso not (null rules) then |
17110 | 255 |
Pretty.big_list "rules:" (map (ProofContext.pretty_thm ctxt) rules) |
21962 | 256 |
|> Pretty.string_of |> tracing |
257 |
else (); |
|
12347 | 258 |
|
259 |
local |
|
260 |
||
18841 | 261 |
fun gen_rule_tac tac rules facts = |
262 |
(fn i => fn st => |
|
263 |
if null facts then tac rules i st |
|
264 |
else Seq.maps (fn rule => (tac o single) rule i st) (Drule.multi_resolves facts rules)) |
|
21687 | 265 |
THEN_ALL_NEW Goal.norm_hhf_tac; |
7130 | 266 |
|
10744 | 267 |
fun gen_arule_tac tac j rules facts = |
268 |
EVERY' (gen_rule_tac tac rules facts :: replicate j Tactic.assume_tac); |
|
269 |
||
11785 | 270 |
fun gen_some_rule_tac tac arg_rules ctxt facts = SUBGOAL (fn (goal, i) => |
271 |
let |
|
272 |
val rules = |
|
273 |
if not (null arg_rules) then arg_rules |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19307
diff
changeset
|
274 |
else flat (ContextRules.find_rules false facts goal ctxt) |
12055 | 275 |
in trace ctxt rules; tac rules facts i end); |
10309 | 276 |
|
10744 | 277 |
fun meth tac x = METHOD (HEADGOAL o tac x); |
278 |
fun meth' tac x y = METHOD (HEADGOAL o tac x y); |
|
8220 | 279 |
|
7419 | 280 |
in |
281 |
||
10744 | 282 |
val rule_tac = gen_rule_tac Tactic.resolve_tac; |
283 |
val rule = meth rule_tac; |
|
284 |
val some_rule_tac = gen_some_rule_tac rule_tac; |
|
285 |
val some_rule = meth' some_rule_tac; |
|
286 |
||
287 |
val erule = meth' (gen_arule_tac Tactic.eresolve_tac); |
|
288 |
val drule = meth' (gen_arule_tac Tactic.dresolve_tac); |
|
289 |
val frule = meth' (gen_arule_tac Tactic.forward_tac); |
|
5824 | 290 |
|
7419 | 291 |
end; |
292 |
||
293 |
||
25270 | 294 |
(* intros_tac -- pervasive search spanned by intro rules *) |
295 |
||
296 |
fun intros_tac intros facts = |
|
297 |
ALLGOALS (insert_tac facts THEN' |
|
298 |
REPEAT_ALL_NEW (resolve_tac intros)) |
|
299 |
THEN Tactic.distinct_subgoals_tac; |
|
300 |
||
301 |
||
17587 | 302 |
(* iprover -- intuitionistic proof search *) |
17110 | 303 |
|
304 |
local |
|
305 |
||
306 |
val remdups_tac = SUBGOAL (fn (g, i) => |
|
307 |
let val prems = Logic.strip_assums_hyp g in |
|
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
18999
diff
changeset
|
308 |
REPEAT_DETERM_N (length prems - length (distinct op aconv prems)) |
17110 | 309 |
(Tactic.ematch_tac [Drule.remdups_rl] i THEN Tactic.eq_assume_tac i) |
310 |
end); |
|
311 |
||
312 |
fun REMDUPS tac = tac THEN_ALL_NEW remdups_tac; |
|
313 |
||
314 |
val bires_tac = Tactic.biresolution_from_nets_tac ContextRules.orderlist; |
|
315 |
||
316 |
fun safe_step_tac ctxt = |
|
317 |
ContextRules.Swrap ctxt |
|
318 |
(eq_assume_tac ORELSE' |
|
319 |
bires_tac true (ContextRules.netpair_bang ctxt)); |
|
8195 | 320 |
|
17110 | 321 |
fun unsafe_step_tac ctxt = |
322 |
ContextRules.wrap ctxt |
|
323 |
(assume_tac APPEND' |
|
324 |
bires_tac false (ContextRules.netpair_bang ctxt) APPEND' |
|
325 |
bires_tac false (ContextRules.netpair ctxt)); |
|
326 |
||
327 |
fun step_tac ctxt i = |
|
328 |
REPEAT_DETERM1 (REMDUPS (safe_step_tac ctxt) i) ORELSE |
|
329 |
REMDUPS (unsafe_step_tac ctxt) i; |
|
330 |
||
331 |
fun intprover_tac ctxt gs d lim = SUBGOAL (fn (g, i) => if d > lim then no_tac else |
|
332 |
let |
|
333 |
val ps = Logic.strip_assums_hyp g; |
|
334 |
val c = Logic.strip_assums_concl g; |
|
335 |
in |
|
18921 | 336 |
if member (fn ((ps1, c1), (ps2, c2)) => |
19307 | 337 |
c1 aconv c2 andalso |
338 |
length ps1 = length ps2 andalso |
|
339 |
gen_eq_set (op aconv) (ps1, ps2)) gs (ps, c) then no_tac |
|
17110 | 340 |
else (step_tac ctxt THEN_ALL_NEW intprover_tac ctxt ((ps, c) :: gs) (d + 1) lim) i |
341 |
end); |
|
342 |
||
343 |
in |
|
344 |
||
17587 | 345 |
fun iprover_tac ctxt opt_lim = |
18939 | 346 |
SELECT_GOAL (DEEPEN (2, the_default 20 opt_lim) (intprover_tac ctxt [] 0) 4 1); |
17110 | 347 |
|
348 |
end; |
|
8195 | 349 |
|
350 |
||
8351 | 351 |
(* ML tactics *) |
352 |
||
26472
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
353 |
structure TacticData = ProofDataFun |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
354 |
( |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
355 |
type T = Proof.context -> thm list -> tactic; |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
356 |
fun init _ = undefined; |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
357 |
); |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
358 |
|
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
359 |
val set_tactic = TacticData.put; |
8351 | 360 |
|
26472
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
361 |
fun ml_tactic (txt, pos) ctxt = |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
362 |
let |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
363 |
val ctxt' = ctxt |> Context.proof_map |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
364 |
(ML_Context.expression Position.none |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
365 |
"fun tactic (ctxt: Proof.context) (facts: thm list) : tactic" |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
366 |
"Context.map_proof (Method.set_tactic tactic)" txt); |
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
367 |
in Context.setmp_thread_data (SOME (Context.Proof ctxt)) (TacticData.get ctxt' ctxt) end; |
23425 | 368 |
|
369 |
fun tactic txt ctxt = METHOD (ml_tactic txt ctxt); |
|
370 |
fun raw_tactic txt ctxt = RAW_METHOD (ml_tactic txt ctxt); |
|
8351 | 371 |
|
372 |
||
5824 | 373 |
|
17110 | 374 |
(** method syntax **) |
375 |
||
376 |
(* method text *) |
|
377 |
||
378 |
type src = Args.src; |
|
5824 | 379 |
|
17110 | 380 |
datatype text = |
23349 | 381 |
Basic of (Proof.context -> method) * Position.T | |
17110 | 382 |
Source of src | |
20030 | 383 |
Source_i of src | |
17110 | 384 |
Then of text list | |
385 |
Orelse of text list | |
|
386 |
Try of text | |
|
19186 | 387 |
Repeat1 of text | |
388 |
SelectGoals of int * text; |
|
17110 | 389 |
|
23349 | 390 |
fun primitive_text r = Basic (K (SIMPLE_METHOD (PRIMITIVE r)), Position.none); |
391 |
val succeed_text = Basic (K succeed, Position.none); |
|
17110 | 392 |
val default_text = Source (Args.src (("default", []), Position.none)); |
23349 | 393 |
val this_text = Basic (K this, Position.none); |
394 |
val done_text = Basic (K (SIMPLE_METHOD all_tac), Position.none); |
|
395 |
fun sorry_text int = Basic (cheating int, Position.none); |
|
17110 | 396 |
|
23349 | 397 |
fun finish_text (NONE, immed) pos = Basic (close immed, pos) |
398 |
| finish_text (SOME txt, immed) pos = Then [txt, Basic (close immed, pos)]; |
|
17110 | 399 |
|
400 |
||
401 |
(* method definitions *) |
|
5824 | 402 |
|
24116 | 403 |
structure Methods = TheoryDataFun |
22846 | 404 |
( |
20289 | 405 |
type T = (((src -> Proof.context -> method) * string) * stamp) NameSpace.table; |
16347 | 406 |
val empty = NameSpace.empty_table; |
6546 | 407 |
val copy = I; |
16448 | 408 |
val extend = I; |
23655
d2d1138e0ddc
replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
wenzelm
parents:
23590
diff
changeset
|
409 |
fun merge _ tables : T = NameSpace.merge_tables (eq_snd (op =)) tables handle Symtab.DUP dup => |
d2d1138e0ddc
replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
wenzelm
parents:
23590
diff
changeset
|
410 |
error ("Attempt to merge different versions of method " ^ quote dup); |
22846 | 411 |
); |
5824 | 412 |
|
22846 | 413 |
fun print_methods thy = |
414 |
let |
|
24116 | 415 |
val meths = Methods.get thy; |
22846 | 416 |
fun prt_meth (name, ((_, comment), _)) = Pretty.block |
417 |
[Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment]; |
|
418 |
in |
|
419 |
[Pretty.big_list "methods:" (map prt_meth (NameSpace.extern_table meths))] |
|
420 |
|> Pretty.chunks |> Pretty.writeln |
|
421 |
end; |
|
7611 | 422 |
|
5824 | 423 |
|
424 |
(* get methods *) |
|
425 |
||
20030 | 426 |
fun method_i thy = |
5824 | 427 |
let |
24116 | 428 |
val meths = #2 (Methods.get thy); |
5884 | 429 |
fun meth src = |
20030 | 430 |
let val ((name, _), pos) = Args.dest_src src in |
17412 | 431 |
(case Symtab.lookup meths name of |
15531 | 432 |
NONE => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos) |
23937
66e1f24d655d
eliminated transform_failure (to avoid critical section for main transactions);
wenzelm
parents:
23922
diff
changeset
|
433 |
| SOME ((mth, _), _) => mth src) |
5824 | 434 |
end; |
435 |
in meth end; |
|
436 |
||
24116 | 437 |
fun method thy = method_i thy o Args.map_name (NameSpace.intern (#1 (Methods.get thy))); |
20030 | 438 |
|
5824 | 439 |
|
17110 | 440 |
(* add method *) |
5824 | 441 |
|
442 |
fun add_methods raw_meths thy = |
|
443 |
let |
|
16145 | 444 |
val new_meths = raw_meths |> map (fn (name, f, comment) => |
16347 | 445 |
(name, ((f, comment), stamp ()))); |
5824 | 446 |
|
23086 | 447 |
fun add meths = NameSpace.extend_table (Sign.naming_of thy) new_meths meths |
23655
d2d1138e0ddc
replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
wenzelm
parents:
23590
diff
changeset
|
448 |
handle Symtab.DUP dup => error ("Duplicate declaration of method " ^ quote dup); |
24116 | 449 |
in Methods.map add thy end; |
5824 | 450 |
|
9194 | 451 |
val add_method = add_methods o Library.single; |
452 |
||
5824 | 453 |
|
17356
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
454 |
(* method_setup *) |
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
455 |
|
26385
ae7564661e76
ML runtime compilation: pass position, tuned signature;
wenzelm
parents:
26291
diff
changeset
|
456 |
fun method_setup name (txt, pos) cmt = |
26472
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
457 |
Context.theory_map (ML_Context.expression pos |
22118 | 458 |
"val method: bstring * (Method.src -> Proof.context -> Proof.method) * string" |
22086 | 459 |
"Context.map_theory (Method.add_method method)" |
26472
9afdd61cf528
ml_tactic: non-critical version via proof data and thread data;
wenzelm
parents:
26463
diff
changeset
|
460 |
("(" ^ quote name ^ ", " ^ txt ^ ", " ^ quote cmt ^ ")")); |
17356
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
461 |
|
09afdf37cdb3
added cheating, sorry_text (from skip_proofs.ML);
wenzelm
parents:
17314
diff
changeset
|
462 |
|
5884 | 463 |
|
17110 | 464 |
(** concrete syntax **) |
5824 | 465 |
|
5884 | 466 |
(* basic *) |
467 |
||
18999 | 468 |
fun syntax scan = Args.context_syntax "method" scan; |
5824 | 469 |
|
17110 | 470 |
fun simple_args scan f src ctxt : method = |
21879 | 471 |
fst (syntax (Scan.lift (scan >> (fn x => f x ctxt))) src ctxt); |
8351 | 472 |
|
20289 | 473 |
fun ctxt_args (f: Proof.context -> method) src ctxt = |
21879 | 474 |
fst (syntax (Scan.succeed (f ctxt)) src ctxt); |
7555 | 475 |
|
476 |
fun no_args m = ctxt_args (K m); |
|
5884 | 477 |
|
478 |
||
479 |
(* sections *) |
|
5824 | 480 |
|
20289 | 481 |
type modifier = (Proof.context -> Proof.context) * attribute; |
7268 | 482 |
|
483 |
local |
|
484 |
||
24010
2ef318813e1a
method section scanners: added [[declaration]] syntax, ignore sid-effects of thms;
wenzelm
parents:
23937
diff
changeset
|
485 |
fun thms ss = Scan.repeat (Scan.unless (Scan.lift (Scan.first ss)) Attrib.multi_thm) >> flat; |
19186 | 486 |
fun app (f, att) (context, ths) = foldl_map att (Context.map_proof f context, ths); |
5824 | 487 |
|
24022 | 488 |
fun section ss = Scan.depend (fn context => (Scan.first ss -- Scan.pass context (thms ss)) :|-- |
489 |
(fn (m, ths) => Scan.succeed (app m (context, ths)))); |
|
5884 | 490 |
|
7601 | 491 |
fun sectioned args ss = args -- Scan.repeat (section ss); |
5884 | 492 |
|
7268 | 493 |
in |
5824 | 494 |
|
5884 | 495 |
fun sectioned_args args ss f src ctxt = |
21879 | 496 |
let val ((x, _), ctxt') = syntax (sectioned args ss) src ctxt |
5921 | 497 |
in f x ctxt' end; |
5884 | 498 |
|
7601 | 499 |
fun bang_sectioned_args ss f = sectioned_args Args.bang_facts ss f; |
9777 | 500 |
fun bang_sectioned_args' ss scan f = |
501 |
sectioned_args (Args.bang_facts -- scan >> swap) ss (uncurry f); |
|
7601 | 502 |
fun only_sectioned_args ss f = sectioned_args (Scan.succeed ()) ss (fn () => f); |
7268 | 503 |
|
18999 | 504 |
fun thms_ctxt_args f = sectioned_args (thms []) [] f; |
8093 | 505 |
fun thms_args f = thms_ctxt_args (K o f); |
9706 | 506 |
fun thm_args f = thms_args (fn [thm] => f thm | _ => error "Single theorem expected"); |
5824 | 507 |
|
7268 | 508 |
end; |
509 |
||
5824 | 510 |
|
17587 | 511 |
(* iprover syntax *) |
12347 | 512 |
|
513 |
local |
|
514 |
||
515 |
val introN = "intro"; |
|
516 |
val elimN = "elim"; |
|
517 |
val destN = "dest"; |
|
518 |
val ruleN = "rule"; |
|
519 |
||
520 |
fun modifier name kind kind' att = |
|
15531 | 521 |
Args.$$$ name |-- (kind >> K NONE || kind' |-- Args.nat --| Args.colon >> SOME) |
20289 | 522 |
>> (pair (I: Proof.context -> Proof.context) o att); |
12347 | 523 |
|
17587 | 524 |
val iprover_modifiers = |
18728 | 525 |
[modifier destN Args.bang_colon Args.bang ContextRules.dest_bang, |
526 |
modifier destN Args.colon (Scan.succeed ()) ContextRules.dest, |
|
527 |
modifier elimN Args.bang_colon Args.bang ContextRules.elim_bang, |
|
528 |
modifier elimN Args.colon (Scan.succeed ()) ContextRules.elim, |
|
529 |
modifier introN Args.bang_colon Args.bang ContextRules.intro_bang, |
|
530 |
modifier introN Args.colon (Scan.succeed ()) ContextRules.intro, |
|
531 |
Args.del -- Args.colon >> K (I, ContextRules.rule_del)]; |
|
12347 | 532 |
|
533 |
in |
|
534 |
||
18640 | 535 |
val iprover_meth = |
536 |
bang_sectioned_args' iprover_modifiers (Scan.lift (Scan.option Args.nat)) |
|
537 |
(fn n => fn prems => fn ctxt => METHOD (fn facts => |
|
538 |
HEADGOAL (insert_tac (prems @ facts) THEN' |
|
23590
ad95084a5c63
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23577
diff
changeset
|
539 |
ObjectLogic.atomize_prems_tac THEN' iprover_tac ctxt n))); |
12347 | 540 |
|
541 |
end; |
|
542 |
||
543 |
||
9539 | 544 |
(* tactic syntax *) |
8238 | 545 |
|
10744 | 546 |
fun nat_thms_args f = uncurry f oo |
21879 | 547 |
(fst oo syntax (Scan.lift (Scan.optional (Args.parens Args.nat) 0) -- Attrib.thms)); |
10744 | 548 |
|
21879 | 549 |
fun goal_args' args tac src ctxt = fst (syntax (Args.goal_spec HEADGOAL -- args >> |
21592 | 550 |
(fn (quant, s) => SIMPLE_METHOD'' quant (tac s))) src ctxt); |
8537 | 551 |
|
9539 | 552 |
fun goal_args args tac = goal_args' (Scan.lift args) tac; |
8238 | 553 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
554 |
fun goal_args_ctxt' args tac src ctxt = |
21879 | 555 |
fst (syntax (Args.goal_spec HEADGOAL -- args >> |
21592 | 556 |
(fn (quant, s) => SIMPLE_METHOD'' quant (tac ctxt s))) src ctxt); |
8238 | 557 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
558 |
fun goal_args_ctxt args tac = goal_args_ctxt' (Scan.lift args) tac; |
5824 | 559 |
|
14718 | 560 |
|
18708 | 561 |
(* theory setup *) |
5824 | 562 |
|
26463 | 563 |
val _ = Context.>> (Context.map_theory |
564 |
(add_methods |
|
565 |
[("fail", no_args fail, "force failure"), |
|
566 |
("succeed", no_args succeed, "succeed"), |
|
567 |
("-", no_args insert_facts, "do nothing (insert current facts only)"), |
|
568 |
("insert", thms_args insert, "insert theorems, ignoring facts (improper)"), |
|
569 |
("intro", thms_args intro, "repeatedly apply introduction rules"), |
|
570 |
("elim", thms_args elim, "repeatedly apply elimination rules"), |
|
571 |
("unfold", thms_ctxt_args unfold_meth, "unfold definitions"), |
|
572 |
("fold", thms_ctxt_args fold_meth, "fold definitions"), |
|
573 |
("atomize", (atomize o fst) oo syntax (Args.mode "full"), |
|
574 |
"present local premises as object-level statements"), |
|
575 |
("iprover", iprover_meth, "intuitionistic proof search"), |
|
576 |
("rule", thms_ctxt_args some_rule, "apply some intro/elim rule"), |
|
577 |
("erule", nat_thms_args erule, "apply rule in elimination manner (improper)"), |
|
578 |
("drule", nat_thms_args drule, "apply rule in destruct manner (improper)"), |
|
579 |
("frule", nat_thms_args frule, "apply rule in forward manner (improper)"), |
|
580 |
("this", no_args this, "apply current facts as rules"), |
|
581 |
("fact", thms_ctxt_args fact, "composition by facts from context"), |
|
582 |
("assumption", ctxt_args assumption, "proof by assumption, preferring facts"), |
|
583 |
("rename_tac", goal_args (Scan.repeat1 Args.name) Tactic.rename_params_tac, |
|
584 |
"rename parameters of goal"), |
|
585 |
("rotate_tac", goal_args (Scan.optional Args.int 1) Tactic.rotate_tac, |
|
586 |
"rotate assumptions of goal"), |
|
587 |
("tactic", simple_args (Args.position Args.name) tactic, "ML tactic as proof method"), |
|
588 |
("raw_tactic", simple_args (Args.position Args.name) raw_tactic, |
|
589 |
"ML tactic as raw proof method")])); |
|
5824 | 590 |
|
591 |
||
22118 | 592 |
(* outer parser *) |
593 |
||
594 |
local |
|
595 |
||
596 |
structure T = OuterLex; |
|
597 |
structure P = OuterParse; |
|
598 |
||
599 |
fun is_symid_meth s = |
|
600 |
s <> "|" andalso s <> "?" andalso s <> "+" andalso T.is_sid s; |
|
601 |
||
602 |
fun meth4 x = |
|
603 |
(P.position (P.xname >> rpair []) >> (Source o Args.src) || |
|
604 |
P.$$$ "(" |-- P.!!! (meth0 --| P.$$$ ")")) x |
|
605 |
and meth3 x = |
|
606 |
(meth4 --| P.$$$ "?" >> Try || |
|
607 |
meth4 --| P.$$$ "+" >> Repeat1 || |
|
608 |
meth4 -- (P.$$$ "[" |-- Scan.optional P.nat 1 --| P.$$$ "]") >> (SelectGoals o swap) || |
|
609 |
meth4) x |
|
610 |
and meth2 x = |
|
611 |
(P.position (P.xname -- P.args1 is_symid_meth false) >> (Source o Args.src) || |
|
612 |
meth3) x |
|
613 |
and meth1 x = (P.enum1 "," meth2 >> (fn [m] => m | ms => Then ms)) x |
|
614 |
and meth0 x = (P.enum1 "|" meth1 >> (fn [m] => m | ms => Orelse ms)) x; |
|
615 |
||
616 |
in val parse = meth3 end; |
|
617 |
||
618 |
||
16145 | 619 |
(*final declarations of this structure!*) |
620 |
val unfold = unfold_meth; |
|
621 |
val fold = fold_meth; |
|
622 |
||
5824 | 623 |
end; |
624 |
||
625 |
structure BasicMethod: BASIC_METHOD = Method; |
|
626 |
open BasicMethod; |