author | wenzelm |
Tue, 13 Sep 2005 22:19:23 +0200 | |
changeset 17339 | ab97ccef124a |
parent 17314 | 04e21a27c0ad |
child 17356 | 09afdf37cdb3 |
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 |
17110 | 15 |
val Method: bstring -> (Args.src -> ProofContext.context -> method) -> string -> unit |
5824 | 16 |
end; |
17 |
||
18 |
signature METHOD = |
|
19 |
sig |
|
20 |
include BASIC_METHOD |
|
7419 | 21 |
val multi_resolve: thm list -> thm -> thm Seq.seq |
22 |
val multi_resolves: thm list -> thm list -> thm Seq.seq |
|
17110 | 23 |
val apply: method -> thm list -> RuleCases.tactic; |
24 |
val RAW_METHOD_CASES: (thm list -> RuleCases.tactic) -> method |
|
25 |
val RAW_METHOD: (thm list -> tactic) -> method |
|
26 |
val METHOD_CASES: (thm list -> RuleCases.tactic) -> method |
|
27 |
val METHOD: (thm list -> tactic) -> method |
|
28 |
val fail: method |
|
29 |
val succeed: method |
|
30 |
val insert_tac: thm list -> int -> tactic |
|
31 |
val insert: thm list -> method |
|
32 |
val insert_facts: method |
|
33 |
val SIMPLE_METHOD: tactic -> method |
|
34 |
val SIMPLE_METHOD': ((int -> tactic) -> tactic) -> (int -> tactic) -> method |
|
35 |
val defer: int option -> method |
|
36 |
val prefer: int -> method |
|
37 |
val intro: thm list -> method |
|
38 |
val elim: thm list -> method |
|
39 |
val unfold: thm list -> method |
|
40 |
val fold: thm list -> method |
|
41 |
val atomize: bool -> method |
|
42 |
val this: method |
|
43 |
val assumption: ProofContext.context -> method |
|
44 |
val close: bool -> ProofContext.context -> method |
|
45 |
val trace: ProofContext.context -> thm list -> unit |
|
6091 | 46 |
val rule_tac: thm list -> thm list -> int -> tactic |
17110 | 47 |
val some_rule_tac: thm list -> ProofContext.context -> thm list -> int -> tactic |
48 |
val rule: thm list -> method |
|
49 |
val erule: int -> thm list -> method |
|
50 |
val drule: int -> thm list -> method |
|
51 |
val frule: int -> thm list -> method |
|
52 |
val rules_tac: ProofContext.context -> int option -> int -> tactic |
|
53 |
val bires_inst_tac: bool -> ProofContext.context -> (indexname * string) list -> |
|
54 |
thm -> int -> tactic |
|
55 |
val set_tactic: (ProofContext.context -> thm list -> tactic) -> unit |
|
56 |
val tactic: string -> ProofContext.context -> method |
|
57 |
type src |
|
5824 | 58 |
datatype text = |
17110 | 59 |
Basic of (ProofContext.context -> method) | |
15703 | 60 |
Source of src | |
5824 | 61 |
Then of text list | |
62 |
Orelse of text list | |
|
63 |
Try of text | |
|
64 |
Repeat1 of text |
|
17110 | 65 |
val default_text: text |
66 |
val this_text: text |
|
67 |
val done_text: text |
|
68 |
val finish_text: bool -> text option -> text |
|
69 |
exception METHOD_FAIL of (string * Position.T) * exn |
|
70 |
val method: theory -> src -> ProofContext.context -> method |
|
71 |
val add_methods: (bstring * (src -> ProofContext.context -> method) * string) list |
|
72 |
-> theory -> theory |
|
73 |
val add_method: bstring * (src -> ProofContext.context -> method) * string |
|
74 |
-> theory -> theory |
|
75 |
val syntax: (ProofContext.context * Args.T list -> 'a * (ProofContext.context * Args.T list)) |
|
76 |
-> src -> ProofContext.context -> ProofContext.context * 'a |
|
77 |
val simple_args: (Args.T list -> 'a * Args.T list) |
|
78 |
-> ('a -> ProofContext.context -> method) -> src -> ProofContext.context -> method |
|
79 |
val ctxt_args: (ProofContext.context -> method) -> src -> ProofContext.context -> method |
|
80 |
val no_args: method -> src -> ProofContext.context -> method |
|
81 |
type modifier |
|
82 |
val sectioned_args: (ProofContext.context * Args.T list -> |
|
83 |
'a * (ProofContext.context * Args.T list)) -> |
|
84 |
(Args.T list -> modifier * Args.T list) list -> |
|
85 |
('a -> ProofContext.context -> 'b) -> src -> ProofContext.context -> 'b |
|
86 |
val bang_sectioned_args: |
|
87 |
(Args.T list -> modifier * Args.T list) list -> |
|
88 |
(thm list -> ProofContext.context -> 'a) -> src -> ProofContext.context -> 'a |
|
89 |
val bang_sectioned_args': |
|
90 |
(Args.T list -> modifier * Args.T list) list -> |
|
91 |
(ProofContext.context * Args.T list -> 'a * (ProofContext.context * Args.T list)) -> |
|
92 |
('a -> thm list -> ProofContext.context -> 'b) -> src -> ProofContext.context -> 'b |
|
93 |
val only_sectioned_args: |
|
94 |
(Args.T list -> modifier * Args.T list) list -> |
|
95 |
(ProofContext.context -> 'a) -> src -> ProofContext.context -> 'a |
|
96 |
val thms_ctxt_args: (thm list -> ProofContext.context -> 'a) -> src -> |
|
97 |
ProofContext.context -> 'a |
|
98 |
val thms_args: (thm list -> 'a) -> src -> ProofContext.context -> 'a |
|
99 |
val thm_args: (thm -> 'a) -> src -> ProofContext.context -> 'a |
|
9539 | 100 |
val goal_args: (Args.T list -> 'a * Args.T list) -> ('a -> int -> tactic) |
17110 | 101 |
-> src -> ProofContext.context -> method |
102 |
val goal_args': (ProofContext.context * Args.T list -> |
|
103 |
'a * (ProofContext.context * Args.T list)) |
|
104 |
-> ('a -> int -> tactic) -> src -> ProofContext.context -> method |
|
105 |
val goal_args_ctxt: (Args.T list -> 'a * Args.T list) -> |
|
106 |
(ProofContext.context -> 'a -> int -> tactic) -> src -> ProofContext.context -> method |
|
107 |
val goal_args_ctxt': (ProofContext.context * Args.T list -> |
|
108 |
'a * (ProofContext.context * Args.T list)) -> |
|
109 |
(ProofContext.context -> 'a -> int -> tactic) -> src -> ProofContext.context -> method |
|
5824 | 110 |
end; |
111 |
||
112 |
structure Method: METHOD = |
|
113 |
struct |
|
114 |
||
17110 | 115 |
(** generic tools **) |
116 |
||
117 |
(* goal addressing *) |
|
118 |
||
119 |
fun FINDGOAL tac st = |
|
120 |
let fun find i n = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1) n) |
|
121 |
in find 1 (Thm.nprems_of st) st end; |
|
122 |
||
123 |
fun HEADGOAL tac = tac 1; |
|
124 |
||
125 |
||
126 |
(* multi_resolve *) |
|
127 |
||
128 |
local |
|
129 |
||
130 |
fun res th i rule = |
|
131 |
Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty; |
|
132 |
||
133 |
fun multi_res _ [] rule = Seq.single rule |
|
134 |
| multi_res i (th :: ths) rule = Seq.flat (Seq.map (res th i) (multi_res (i + 1) ths rule)); |
|
135 |
||
136 |
in |
|
137 |
||
138 |
val multi_resolve = multi_res 1; |
|
139 |
fun multi_resolves facts rules = Seq.flat (Seq.map (multi_resolve facts) (Seq.of_list rules)); |
|
140 |
||
141 |
end; |
|
142 |
||
15703 | 143 |
|
5824 | 144 |
|
12324
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
145 |
(** proof methods **) |
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
146 |
|
17110 | 147 |
(* datatype method *) |
11731 | 148 |
|
17110 | 149 |
datatype method = Method of thm list -> RuleCases.tactic; |
11731 | 150 |
|
17110 | 151 |
fun apply (Method m) = m; |
11731 | 152 |
|
17110 | 153 |
val RAW_METHOD_CASES = Method; |
11731 | 154 |
|
17110 | 155 |
fun RAW_METHOD tac = RAW_METHOD_CASES (NO_CASES o tac); |
12144 | 156 |
|
17110 | 157 |
fun METHOD_CASES tac = RAW_METHOD_CASES (fn facts => |
158 |
Seq.THEN (TRY Tactic.conjunction_tac, tac facts)); |
|
8372 | 159 |
|
17110 | 160 |
fun METHOD tac = RAW_METHOD (fn facts => |
161 |
TRY Tactic.conjunction_tac THEN tac facts); |
|
5824 | 162 |
|
163 |
val fail = METHOD (K no_tac); |
|
164 |
val succeed = METHOD (K all_tac); |
|
165 |
||
166 |
||
17110 | 167 |
(* insert facts *) |
7419 | 168 |
|
169 |
local |
|
5824 | 170 |
|
6981 | 171 |
fun cut_rule_tac raw_rule = |
172 |
let |
|
173 |
val rule = Drule.forall_intr_vars raw_rule; |
|
174 |
val revcut_rl = Drule.incr_indexes_wrt [] [] [] [rule] Drule.revcut_rl; |
|
7555 | 175 |
in Tactic.rtac (rule COMP revcut_rl) end; |
6981 | 176 |
|
7419 | 177 |
in |
5824 | 178 |
|
7419 | 179 |
fun insert_tac [] i = all_tac |
180 |
| insert_tac facts i = EVERY (map (fn th => cut_rule_tac th i) facts); |
|
6981 | 181 |
|
7555 | 182 |
val insert_facts = METHOD (ALLGOALS o insert_tac); |
7664 | 183 |
fun insert thms = METHOD (fn _ => ALLGOALS (insert_tac thms)); |
7419 | 184 |
|
9706 | 185 |
fun SIMPLE_METHOD tac = METHOD (fn facts => ALLGOALS (insert_tac facts) THEN tac); |
186 |
fun SIMPLE_METHOD' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac)); |
|
187 |
||
12324
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
188 |
end; |
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
189 |
|
9706 | 190 |
|
17110 | 191 |
(* shuffle subgoals *) |
192 |
||
193 |
fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1))); |
|
194 |
fun defer opt_i = METHOD (K (Tactic.defer_tac (if_none opt_i 1))); |
|
195 |
||
196 |
||
197 |
(* unfold intro/elim rules *) |
|
198 |
||
199 |
fun intro ths = SIMPLE_METHOD' HEADGOAL (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.match_tac ths)); |
|
200 |
fun elim ths = SIMPLE_METHOD' HEADGOAL (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.ematch_tac ths)); |
|
201 |
||
202 |
||
12384 | 203 |
(* unfold/fold definitions *) |
204 |
||
16145 | 205 |
fun unfold_meth ths = SIMPLE_METHOD (CHANGED_PROP (rewrite_goals_tac ths)); |
206 |
fun fold_meth ths = SIMPLE_METHOD (CHANGED_PROP (fold_goals_tac ths)); |
|
6532 | 207 |
|
12384 | 208 |
|
12829 | 209 |
(* atomize rule statements *) |
210 |
||
211 |
fun atomize false = SIMPLE_METHOD' HEADGOAL (CHANGED_PROP o ObjectLogic.atomize_tac) |
|
212 |
| atomize true = RAW_METHOD (K (HEADGOAL (CHANGED_PROP o ObjectLogic.full_atomize_tac))); |
|
213 |
||
214 |
||
17110 | 215 |
(* this -- apply facts directly *) |
12384 | 216 |
|
17110 | 217 |
val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac)); |
9484 | 218 |
|
219 |
||
17110 | 220 |
(* assumption *) |
7419 | 221 |
|
222 |
local |
|
223 |
||
17110 | 224 |
fun asm_tac ths = |
225 |
foldr (op APPEND') (K no_tac) (map (fn th => Tactic.rtac th THEN_ALL_NEW assume_tac) ths); |
|
226 |
||
227 |
val refl_tac = SUBGOAL (fn (prop, i) => |
|
228 |
if can Logic.dest_equals (Logic.strip_assums_concl prop) |
|
229 |
then Tactic.rtac Drule.reflexive_thm i else no_tac); |
|
7419 | 230 |
|
17110 | 231 |
fun assm_tac ctxt = |
232 |
assume_tac APPEND' |
|
233 |
asm_tac (ProofContext.prems_of ctxt) APPEND' |
|
234 |
refl_tac; |
|
235 |
||
236 |
fun assumption_tac ctxt [] = assm_tac ctxt |
|
237 |
| assumption_tac _ [fact] = asm_tac [fact] |
|
238 |
| assumption_tac _ _ = K no_tac; |
|
7419 | 239 |
|
240 |
in |
|
241 |
||
17110 | 242 |
fun assumption ctxt = METHOD (HEADGOAL o assumption_tac ctxt); |
243 |
fun close asm ctxt = METHOD (K |
|
244 |
(FILTER Thm.no_prems ((if asm 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 = |
254 |
conditional (! trace_rules andalso not (null rules)) (fn () => |
|
255 |
Pretty.big_list "rules:" (map (ProofContext.pretty_thm ctxt) rules) |
|
256 |
|> Pretty.string_of |> tracing); |
|
12347 | 257 |
|
258 |
local |
|
259 |
||
10541
fdec07d4f047
resolveq(_cases)_tac moved to HOL/Tools/induct_method.ML;
wenzelm
parents:
10529
diff
changeset
|
260 |
fun gen_rule_tac tac rules [] i st = tac rules i st |
12324
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
261 |
| gen_rule_tac tac rules facts i st = |
5db4b4596d1a
rule context and attributes moved to rule_context.ML;
wenzelm
parents:
12311
diff
changeset
|
262 |
Seq.flat (Seq.map (fn rule => (tac o single) rule i st) (multi_resolves facts rules)); |
7130 | 263 |
|
10744 | 264 |
fun gen_arule_tac tac j rules facts = |
265 |
EVERY' (gen_rule_tac tac rules facts :: replicate j Tactic.assume_tac); |
|
266 |
||
11785 | 267 |
fun gen_some_rule_tac tac arg_rules ctxt facts = SUBGOAL (fn (goal, i) => |
268 |
let |
|
269 |
val rules = |
|
270 |
if not (null arg_rules) then arg_rules |
|
15570 | 271 |
else List.concat (ContextRules.find_rules false facts goal ctxt) |
12055 | 272 |
in trace ctxt rules; tac rules facts i end); |
10309 | 273 |
|
10744 | 274 |
fun meth tac x = METHOD (HEADGOAL o tac x); |
275 |
fun meth' tac x y = METHOD (HEADGOAL o tac x y); |
|
8220 | 276 |
|
7419 | 277 |
in |
278 |
||
10744 | 279 |
val rule_tac = gen_rule_tac Tactic.resolve_tac; |
280 |
val rule = meth rule_tac; |
|
281 |
val some_rule_tac = gen_some_rule_tac rule_tac; |
|
282 |
val some_rule = meth' some_rule_tac; |
|
283 |
||
284 |
val erule = meth' (gen_arule_tac Tactic.eresolve_tac); |
|
285 |
val drule = meth' (gen_arule_tac Tactic.dresolve_tac); |
|
286 |
val frule = meth' (gen_arule_tac Tactic.forward_tac); |
|
5824 | 287 |
|
7419 | 288 |
end; |
289 |
||
290 |
||
17110 | 291 |
(* rules -- intuitionistic proof search *) |
292 |
||
293 |
local |
|
294 |
||
295 |
val remdups_tac = SUBGOAL (fn (g, i) => |
|
296 |
let val prems = Logic.strip_assums_hyp g in |
|
297 |
REPEAT_DETERM_N (length prems - length (gen_distinct op aconv prems)) |
|
298 |
(Tactic.ematch_tac [Drule.remdups_rl] i THEN Tactic.eq_assume_tac i) |
|
299 |
end); |
|
300 |
||
301 |
fun REMDUPS tac = tac THEN_ALL_NEW remdups_tac; |
|
302 |
||
303 |
fun gen_eq_set e s1 s2 = |
|
304 |
length s1 = length s2 andalso |
|
305 |
gen_subset e (s1, s2) andalso gen_subset e (s2, s1); |
|
306 |
||
307 |
val bires_tac = Tactic.biresolution_from_nets_tac ContextRules.orderlist; |
|
308 |
||
309 |
fun safe_step_tac ctxt = |
|
310 |
ContextRules.Swrap ctxt |
|
311 |
(eq_assume_tac ORELSE' |
|
312 |
bires_tac true (ContextRules.netpair_bang ctxt)); |
|
8195 | 313 |
|
17110 | 314 |
fun unsafe_step_tac ctxt = |
315 |
ContextRules.wrap ctxt |
|
316 |
(assume_tac APPEND' |
|
317 |
bires_tac false (ContextRules.netpair_bang ctxt) APPEND' |
|
318 |
bires_tac false (ContextRules.netpair ctxt)); |
|
319 |
||
320 |
fun step_tac ctxt i = |
|
321 |
REPEAT_DETERM1 (REMDUPS (safe_step_tac ctxt) i) ORELSE |
|
322 |
REMDUPS (unsafe_step_tac ctxt) i; |
|
323 |
||
324 |
fun intprover_tac ctxt gs d lim = SUBGOAL (fn (g, i) => if d > lim then no_tac else |
|
325 |
let |
|
326 |
val ps = Logic.strip_assums_hyp g; |
|
327 |
val c = Logic.strip_assums_concl g; |
|
328 |
in |
|
329 |
if gen_mem (fn ((ps1, c1), (ps2, c2)) => |
|
330 |
c1 aconv c2 andalso gen_eq_set op aconv ps1 ps2) ((ps, c), gs) then no_tac |
|
331 |
else (step_tac ctxt THEN_ALL_NEW intprover_tac ctxt ((ps, c) :: gs) (d + 1) lim) i |
|
332 |
end); |
|
333 |
||
334 |
in |
|
335 |
||
336 |
fun rules_tac ctxt opt_lim = |
|
337 |
SELECT_GOAL (DEEPEN (2, if_none opt_lim 20) (intprover_tac ctxt [] 0) 4 1); |
|
338 |
||
339 |
end; |
|
8195 | 340 |
|
341 |
||
17110 | 342 |
(* rule_tac etc. -- refer to dynamic goal state!! *) |
12119 | 343 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
344 |
fun bires_inst_tac bires_flag ctxt insts thm = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
345 |
let |
17110 | 346 |
val thy = ProofContext.theory_of ctxt; |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
347 |
(* Separate type and term insts *) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
348 |
fun has_type_var ((x, _), _) = (case Symbol.explode x of |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
349 |
"'"::cs => true | cs => false); |
15570 | 350 |
val Tinsts = List.filter has_type_var insts; |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
351 |
val tinsts = filter_out has_type_var insts; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
352 |
(* Tactic *) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
353 |
fun tac i st = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
354 |
let |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
355 |
(* Preprocess state: extract environment information: |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
356 |
- variables and their types |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
357 |
- type variables and their sorts |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
358 |
- parameters and their types *) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
359 |
val (types, sorts) = types_sorts st; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
360 |
(* Process type insts: Tinsts_env *) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
361 |
fun absent xi = error |
14718 | 362 |
("No such variable in theorem: " ^ Syntax.string_of_vname xi); |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
363 |
val (rtypes, rsorts) = types_sorts thm; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
364 |
fun readT (xi, s) = |
15531 | 365 |
let val S = case rsorts xi of SOME S => S | NONE => absent xi; |
17110 | 366 |
val T = Sign.read_typ (thy, sorts) s; |
15798
016f3be5a5ec
Adapted to new interface of instantiation and unification / matching functions.
berghofe
parents:
15713
diff
changeset
|
367 |
val U = TVar (xi, S); |
17110 | 368 |
in if Sign.typ_instance thy (T, U) then (U, T) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
369 |
else error |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
370 |
("Instantiation of " ^ Syntax.string_of_vname xi ^ " fails") |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
371 |
end; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
372 |
val Tinsts_env = map readT Tinsts; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
373 |
(* Preprocess rule: extract vars and their types, apply Tinsts *) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
374 |
fun get_typ xi = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
375 |
(case rtypes xi of |
15798
016f3be5a5ec
Adapted to new interface of instantiation and unification / matching functions.
berghofe
parents:
15713
diff
changeset
|
376 |
SOME T => typ_subst_atomic Tinsts_env T |
15531 | 377 |
| NONE => absent xi); |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
378 |
val (xis, ss) = Library.split_list tinsts; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
379 |
val Ts = map get_typ xis; |
14718 | 380 |
val (_, _, Bi, _) = dest_state(st,i) |
381 |
val params = Logic.strip_params Bi |
|
382 |
(* params of subgoal i as string typ pairs *) |
|
383 |
val params = rev(Term.rename_wrt_term Bi params) |
|
384 |
(* as they are printed: bound variables with *) |
|
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14215
diff
changeset
|
385 |
(* the same name are renamed during printing *) |
17314 | 386 |
fun types' (a, ~1) = (case AList.lookup (op =) params a of |
15531 | 387 |
NONE => types (a, ~1) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
388 |
| some => some) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
389 |
| types' xi = types xi; |
15973 | 390 |
fun internal x = is_some (types' (x, ~1)); |
15703 | 391 |
val used = Drule.add_used thm (Drule.add_used st []); |
14718 | 392 |
val (ts, envT) = |
393 |
ProofContext.read_termTs_schematic ctxt internal types' sorts used (ss ~~ Ts); |
|
15798
016f3be5a5ec
Adapted to new interface of instantiation and unification / matching functions.
berghofe
parents:
15713
diff
changeset
|
394 |
val envT' = map (fn (ixn, T) => |
15973 | 395 |
(TVar (ixn, the (rsorts ixn)), T)) envT @ Tinsts_env; |
14718 | 396 |
val cenv = |
397 |
map |
|
398 |
(fn (xi, t) => |
|
17110 | 399 |
pairself (Thm.cterm_of thy) (Var (xi, fastype_of t), t)) |
14718 | 400 |
(gen_distinct |
401 |
(fn ((x1, t1), (x2, t2)) => x1 = x2 andalso t1 aconv t2) |
|
402 |
(xis ~~ ts)); |
|
403 |
(* Lift and instantiate rule *) |
|
404 |
val {maxidx, ...} = rep_thm st; |
|
405 |
val paramTs = map #2 params |
|
406 |
and inc = maxidx+1 |
|
407 |
fun liftvar (Var ((a,j), T)) = |
|
16876 | 408 |
Var((a, j+inc), paramTs ---> Logic.incr_tvar inc T) |
14718 | 409 |
| liftvar t = raise TERM("Variable expected", [t]); |
410 |
fun liftterm t = list_abs_free |
|
411 |
(params, Logic.incr_indexes(paramTs,inc) t) |
|
412 |
fun liftpair (cv,ct) = |
|
413 |
(cterm_fun liftvar cv, cterm_fun liftterm ct) |
|
17110 | 414 |
val lifttvar = pairself (ctyp_of thy o Logic.incr_tvar inc); |
14718 | 415 |
val rule = Drule.instantiate |
15798
016f3be5a5ec
Adapted to new interface of instantiation and unification / matching functions.
berghofe
parents:
15713
diff
changeset
|
416 |
(map lifttvar envT', map liftpair cenv) |
14718 | 417 |
(lift_rule (st, i) thm) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
418 |
in |
14718 | 419 |
if i > nprems_of st then no_tac st |
420 |
else st |> |
|
421 |
compose_tac (bires_flag, rule, nprems_of thm) i |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
422 |
end |
14718 | 423 |
handle TERM (msg,_) => (warning msg; no_tac st) |
424 |
| THM (msg,_,_) => (warning msg; no_tac st); |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
425 |
in |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
426 |
tac |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
427 |
end; |
8238 | 428 |
|
17110 | 429 |
local |
430 |
||
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
431 |
fun gen_inst _ tac _ (quant, ([], thms)) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
432 |
METHOD (fn facts => quant (insert_tac facts THEN' tac thms)) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
433 |
| gen_inst inst_tac _ ctxt (quant, (insts, [thm])) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
434 |
METHOD (fn facts => |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
435 |
quant (insert_tac facts THEN' inst_tac ctxt insts thm)) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
436 |
| gen_inst _ _ _ _ = error "Cannot have instantiations with multiple rules"; |
14718 | 437 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
438 |
(* Preserve Var indexes of rl; increment revcut_rl instead. |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
439 |
Copied from tactic.ML *) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
440 |
fun make_elim_preserve rl = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
441 |
let val {maxidx,...} = rep_thm rl |
17110 | 442 |
fun cvar xi = cterm_of ProtoPure.thy (Var(xi,propT)); |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
443 |
val revcut_rl' = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
444 |
instantiate ([], [(cvar("V",0), cvar("V",maxidx+1)), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
445 |
(cvar("W",0), cvar("W",maxidx+1))]) revcut_rl |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
446 |
val arg = (false, rl, nprems_of rl) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
447 |
val [th] = Seq.list_of (bicompose false arg 1 revcut_rl') |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
448 |
in th end |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
449 |
handle Bind => raise THM("make_elim_preserve", 1, [rl]); |
8238 | 450 |
|
17110 | 451 |
in |
452 |
||
453 |
val res_inst_meth = gen_inst (bires_inst_tac false) Tactic.resolve_tac; |
|
454 |
||
455 |
val eres_inst_meth = gen_inst (bires_inst_tac true) Tactic.eresolve_tac; |
|
456 |
||
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
457 |
val cut_inst_meth = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
458 |
gen_inst |
17110 | 459 |
(fn ctxt => fn insts => bires_inst_tac false ctxt insts o make_elim_preserve) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
460 |
Tactic.cut_rules_tac; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
461 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
462 |
val dres_inst_meth = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
463 |
gen_inst |
17110 | 464 |
(fn ctxt => fn insts => bires_inst_tac true ctxt insts o make_elim_preserve) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
465 |
Tactic.dresolve_tac; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
466 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
467 |
val forw_inst_meth = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
468 |
gen_inst |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
469 |
(fn ctxt => fn insts => fn rule => |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
470 |
bires_inst_tac false ctxt insts (make_elim_preserve rule) THEN' |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
471 |
assume_tac) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
472 |
Tactic.forward_tac; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
473 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
474 |
fun subgoal_tac ctxt sprop = |
17110 | 475 |
DETERM o bires_inst_tac false ctxt [(("psi", 0), sprop)] cut_rl; |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
476 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
477 |
fun subgoals_tac ctxt sprops = EVERY' (map (subgoal_tac ctxt) sprops); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
478 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
479 |
fun thin_tac ctxt s = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
480 |
bires_inst_tac true ctxt [(("V", 0), s)] thin_rl; |
8238 | 481 |
|
17110 | 482 |
end; |
8329 | 483 |
|
484 |
||
8351 | 485 |
(* ML tactics *) |
486 |
||
17110 | 487 |
val tactic_ref = ref ((fn _ => raise Match): ProofContext.context -> thm list -> tactic); |
8351 | 488 |
fun set_tactic f = tactic_ref := f; |
489 |
||
490 |
fun tactic txt ctxt = METHOD (fn facts => |
|
9631 | 491 |
(Context.use_mltext |
17110 | 492 |
("let fun tactic (ctxt: ProofContext.context) (facts: thm list) : tactic = \ |
16500
09d43301b195
refl_tac: avoid failure of unification, i.e. confusing trace msg;
wenzelm
parents:
16448
diff
changeset
|
493 |
\let val thm = ProofContext.get_thm_closure ctxt o PureThy.Name\n\ |
09d43301b195
refl_tac: avoid failure of unification, i.e. confusing trace msg;
wenzelm
parents:
16448
diff
changeset
|
494 |
\ and thms = ProofContext.get_thms_closure ctxt o PureThy.Name in\n" |
09d43301b195
refl_tac: avoid failure of unification, i.e. confusing trace msg;
wenzelm
parents:
16448
diff
changeset
|
495 |
^ txt ^ |
09d43301b195
refl_tac: avoid failure of unification, i.e. confusing trace msg;
wenzelm
parents:
16448
diff
changeset
|
496 |
"\nend in Method.set_tactic tactic end") |
15531 | 497 |
false NONE; |
498 |
Context.setmp (SOME (ProofContext.theory_of ctxt)) (! tactic_ref ctxt) facts)); |
|
8351 | 499 |
|
500 |
||
5824 | 501 |
|
17110 | 502 |
(** method syntax **) |
503 |
||
504 |
(* method text *) |
|
505 |
||
506 |
type src = Args.src; |
|
5824 | 507 |
|
17110 | 508 |
datatype text = |
509 |
Basic of (ProofContext.context -> method) | |
|
510 |
Source of src | |
|
511 |
Then of text list | |
|
512 |
Orelse of text list | |
|
513 |
Try of text | |
|
514 |
Repeat1 of text; |
|
515 |
||
516 |
val default_text = Source (Args.src (("default", []), Position.none)); |
|
517 |
val this_text = Basic (K this); |
|
518 |
val done_text = Basic (K (SIMPLE_METHOD all_tac)); |
|
519 |
||
520 |
fun finish_text asm NONE = Basic (close asm) |
|
521 |
| finish_text asm (SOME txt) = Then [txt, Basic (close asm)]; |
|
522 |
||
523 |
||
524 |
(* method definitions *) |
|
5824 | 525 |
|
16448 | 526 |
structure MethodsData = TheoryDataFun |
527 |
(struct |
|
5824 | 528 |
val name = "Isar/methods"; |
17110 | 529 |
type T = (((src -> ProofContext.context -> method) * string) * stamp) NameSpace.table; |
5824 | 530 |
|
16347 | 531 |
val empty = NameSpace.empty_table; |
6546 | 532 |
val copy = I; |
16448 | 533 |
val extend = I; |
534 |
fun merge _ tables = NameSpace.merge_tables eq_snd tables handle Symtab.DUPS dups => |
|
16347 | 535 |
error ("Attempt to merge different versions of method(s) " ^ commas_quote dups); |
5824 | 536 |
|
16347 | 537 |
fun print _ meths = |
5824 | 538 |
let |
539 |
fun prt_meth (name, ((_, comment), _)) = Pretty.block |
|
6849 | 540 |
[Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment]; |
5824 | 541 |
in |
16347 | 542 |
[Pretty.big_list "methods:" (map prt_meth (NameSpace.extern_table meths))] |
9222 | 543 |
|> Pretty.chunks |> Pretty.writeln |
5824 | 544 |
end; |
16448 | 545 |
end); |
5824 | 546 |
|
15801 | 547 |
val _ = Context.add_setup [MethodsData.init]; |
5824 | 548 |
val print_methods = MethodsData.print; |
7611 | 549 |
|
5824 | 550 |
|
551 |
(* get methods *) |
|
552 |
||
5916 | 553 |
exception METHOD_FAIL of (string * Position.T) * exn; |
554 |
||
5824 | 555 |
fun method thy = |
556 |
let |
|
16347 | 557 |
val (space, meths) = MethodsData.get thy; |
5884 | 558 |
fun meth src = |
559 |
let |
|
560 |
val ((raw_name, _), pos) = Args.dest_src src; |
|
561 |
val name = NameSpace.intern space raw_name; |
|
562 |
in |
|
17221 | 563 |
(case Symtab.curried_lookup meths name of |
15531 | 564 |
NONE => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos) |
565 |
| SOME ((mth, _), _) => transform_failure (curry METHOD_FAIL (name, pos)) (mth src)) |
|
5824 | 566 |
end; |
567 |
in meth end; |
|
568 |
||
569 |
||
17110 | 570 |
(* add method *) |
5824 | 571 |
|
572 |
fun add_methods raw_meths thy = |
|
573 |
let |
|
16145 | 574 |
val new_meths = raw_meths |> map (fn (name, f, comment) => |
16347 | 575 |
(name, ((f, comment), stamp ()))); |
5824 | 576 |
|
17110 | 577 |
fun add meths = NameSpace.extend_table (Sign.naming_of thy) (meths, new_meths) |
16347 | 578 |
handle Symtab.DUPS dups => |
579 |
error ("Duplicate declaration of method(s) " ^ commas_quote dups); |
|
580 |
in MethodsData.map add thy end; |
|
5824 | 581 |
|
9194 | 582 |
val add_method = add_methods o Library.single; |
583 |
||
5824 | 584 |
fun Method name meth cmt = Context.>> (add_methods [(name, meth, cmt)]); |
585 |
||
586 |
||
5884 | 587 |
|
17110 | 588 |
(** concrete syntax **) |
5824 | 589 |
|
5884 | 590 |
(* basic *) |
591 |
||
17110 | 592 |
fun syntax (scan: |
593 |
(ProofContext.context * Args.T list -> 'a * (ProofContext.context * Args.T list))) = |
|
5884 | 594 |
Args.syntax "method" scan; |
5824 | 595 |
|
17110 | 596 |
fun simple_args scan f src ctxt : method = |
8351 | 597 |
#2 (syntax (Scan.lift (scan >> (fn x => f x ctxt))) src ctxt); |
598 |
||
17110 | 599 |
fun ctxt_args (f: ProofContext.context -> method) src ctxt = |
8282 | 600 |
#2 (syntax (Scan.succeed (f ctxt)) src ctxt); |
7555 | 601 |
|
602 |
fun no_args m = ctxt_args (K m); |
|
5884 | 603 |
|
604 |
||
605 |
(* sections *) |
|
5824 | 606 |
|
17110 | 607 |
type modifier = (ProofContext.context -> ProofContext.context) * ProofContext.context attribute; |
7268 | 608 |
|
609 |
local |
|
610 |
||
8381 | 611 |
fun sect ss = Scan.first (map Scan.lift ss); |
5884 | 612 |
fun thms ss = Scan.unless (sect ss) Attrib.local_thms; |
15570 | 613 |
fun thmss ss = Scan.repeat (thms ss) >> List.concat; |
5884 | 614 |
|
7268 | 615 |
fun apply (f, att) (ctxt, ths) = Thm.applys_attributes ((f ctxt, ths), [att]); |
5824 | 616 |
|
7268 | 617 |
fun section ss = (sect ss -- thmss ss) :-- (fn (m, ths) => Scan.depend (fn ctxt => |
618 |
Scan.succeed (apply m (ctxt, ths)))) >> #2; |
|
5884 | 619 |
|
7601 | 620 |
fun sectioned args ss = args -- Scan.repeat (section ss); |
5884 | 621 |
|
7268 | 622 |
in |
5824 | 623 |
|
5884 | 624 |
fun sectioned_args args ss f src ctxt = |
8282 | 625 |
let val (ctxt', (x, _)) = syntax (sectioned args ss) src ctxt |
5921 | 626 |
in f x ctxt' end; |
5884 | 627 |
|
7601 | 628 |
fun bang_sectioned_args ss f = sectioned_args Args.bang_facts ss f; |
9777 | 629 |
fun bang_sectioned_args' ss scan f = |
630 |
sectioned_args (Args.bang_facts -- scan >> swap) ss (uncurry f); |
|
7601 | 631 |
fun only_sectioned_args ss f = sectioned_args (Scan.succeed ()) ss (fn () => f); |
7268 | 632 |
|
8093 | 633 |
fun thms_ctxt_args f = sectioned_args (thmss []) [] f; |
634 |
fun thms_args f = thms_ctxt_args (K o f); |
|
9706 | 635 |
fun thm_args f = thms_args (fn [thm] => f thm | _ => error "Single theorem expected"); |
5824 | 636 |
|
7268 | 637 |
end; |
638 |
||
5824 | 639 |
|
12347 | 640 |
(* rules syntax *) |
641 |
||
642 |
local |
|
643 |
||
644 |
val introN = "intro"; |
|
645 |
val elimN = "elim"; |
|
646 |
val destN = "dest"; |
|
647 |
val ruleN = "rule"; |
|
648 |
||
649 |
fun modifier name kind kind' att = |
|
15531 | 650 |
Args.$$$ name |-- (kind >> K NONE || kind' |-- Args.nat --| Args.colon >> SOME) |
17110 | 651 |
>> (pair (I: ProofContext.context -> ProofContext.context) o att); |
12347 | 652 |
|
653 |
val rules_modifiers = |
|
12384 | 654 |
[modifier destN Args.bang_colon Args.bang ContextRules.dest_bang_local, |
12350 | 655 |
modifier destN Args.colon (Scan.succeed ()) ContextRules.dest_local, |
656 |
modifier elimN Args.bang_colon Args.bang ContextRules.elim_bang_local, |
|
657 |
modifier elimN Args.colon (Scan.succeed ()) ContextRules.elim_local, |
|
658 |
modifier introN Args.bang_colon Args.bang ContextRules.intro_bang_local, |
|
659 |
modifier introN Args.colon (Scan.succeed ()) ContextRules.intro_local, |
|
660 |
Args.del -- Args.colon >> K (I, ContextRules.rule_del_local)]; |
|
12347 | 661 |
|
662 |
in |
|
663 |
||
664 |
fun rules_args m = bang_sectioned_args' rules_modifiers (Scan.lift (Scan.option Args.nat)) m; |
|
665 |
||
666 |
fun rules_meth n prems ctxt = METHOD (fn facts => |
|
12350 | 667 |
HEADGOAL (insert_tac (prems @ facts) THEN' ObjectLogic.atomize_tac THEN' rules_tac ctxt n)); |
12347 | 668 |
|
669 |
end; |
|
670 |
||
671 |
||
9539 | 672 |
(* tactic syntax *) |
8238 | 673 |
|
10744 | 674 |
fun nat_thms_args f = uncurry f oo |
675 |
(#2 oo syntax (Scan.lift (Scan.optional (Args.parens Args.nat) 0) -- Attrib.local_thmss)); |
|
676 |
||
8238 | 677 |
val insts = |
9539 | 678 |
Scan.optional |
9565
3eb2ea15cc69
res_inst: include non-inst versions with multiple thms;
wenzelm
parents:
9539
diff
changeset
|
679 |
(Args.enum1 "and" (Scan.lift (Args.name -- (Args.$$$ "=" |-- Args.!!! Args.name))) --| |
3eb2ea15cc69
res_inst: include non-inst versions with multiple thms;
wenzelm
parents:
9539
diff
changeset
|
680 |
Scan.lift (Args.$$$ "in")) [] -- Attrib.local_thmss; |
8238 | 681 |
|
12119 | 682 |
fun inst_args f src ctxt = f ctxt (#2 (syntax (Args.goal_spec HEADGOAL -- insts) src ctxt)); |
8537 | 683 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
684 |
val insts_var = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
685 |
Scan.optional |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
686 |
(Args.enum1 "and" (Scan.lift (Args.var -- (Args.$$$ "=" |-- Args.!!! Args.name))) --| |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
687 |
Scan.lift (Args.$$$ "in")) [] -- Attrib.local_thmss; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
688 |
|
17110 | 689 |
fun inst_args_var f src ctxt = |
690 |
f ctxt (#2 (syntax (Args.goal_spec HEADGOAL -- insts_var) src ctxt)); |
|
8537 | 691 |
|
12119 | 692 |
fun goal_args' args tac src ctxt = #2 (syntax (Args.goal_spec HEADGOAL -- args >> |
14215
ebf291f3b449
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14174
diff
changeset
|
693 |
(fn (quant, s) => SIMPLE_METHOD' quant (tac s))) src ctxt); |
8537 | 694 |
|
9539 | 695 |
fun goal_args args tac = goal_args' (Scan.lift args) tac; |
8238 | 696 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
697 |
fun goal_args_ctxt' args tac src ctxt = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
698 |
#2 (syntax (Args.goal_spec HEADGOAL -- args >> |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
699 |
(fn (quant, s) => SIMPLE_METHOD' quant (tac ctxt s))) src ctxt); |
8238 | 700 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
701 |
fun goal_args_ctxt args tac = goal_args_ctxt' (Scan.lift args) tac; |
5824 | 702 |
|
14718 | 703 |
|
9539 | 704 |
(* misc tactic emulations *) |
705 |
||
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
706 |
val subgoal_meth = goal_args_ctxt (Scan.repeat1 Args.name) subgoals_tac; |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
707 |
val thin_meth = goal_args_ctxt Args.name thin_tac; |
9539 | 708 |
val rename_meth = goal_args (Scan.repeat1 Args.name) Tactic.rename_params_tac; |
9631 | 709 |
val rotate_meth = goal_args (Scan.optional Args.int 1) Tactic.rotate_tac; |
9539 | 710 |
|
711 |
||
5824 | 712 |
(* pure_methods *) |
713 |
||
714 |
val pure_methods = |
|
715 |
[("fail", no_args fail, "force failure"), |
|
716 |
("succeed", no_args succeed, "succeed"), |
|
9587 | 717 |
("-", no_args insert_facts, "do nothing (insert current facts only)"), |
9539 | 718 |
("insert", thms_args insert, "insert theorems, ignoring facts (improper)"), |
16145 | 719 |
("unfold", thms_args unfold_meth, "unfold definitions"), |
12384 | 720 |
("intro", thms_args intro, "repeatedly apply introduction rules"), |
721 |
("elim", thms_args elim, "repeatedly apply elimination rules"), |
|
16145 | 722 |
("fold", thms_args fold_meth, "fold definitions"), |
12829 | 723 |
("atomize", (atomize o #2) oo syntax (Args.mode "full"), |
11962 | 724 |
"present local premises as object-level statements"), |
12347 | 725 |
("rules", rules_args rules_meth, "apply many rules, including proof search"), |
12384 | 726 |
("rule", thms_ctxt_args some_rule, "apply some intro/elim rule"), |
10744 | 727 |
("erule", nat_thms_args erule, "apply rule in elimination manner (improper)"), |
728 |
("drule", nat_thms_args drule, "apply rule in destruct manner (improper)"), |
|
729 |
("frule", nat_thms_args frule, "apply rule in forward manner (improper)"), |
|
8195 | 730 |
("this", no_args this, "apply current facts as rules"), |
8238 | 731 |
("assumption", ctxt_args assumption, "proof by assumption, preferring facts"), |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
732 |
("rule_tac", inst_args_var res_inst_meth, "apply rule (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
733 |
("erule_tac", inst_args_var eres_inst_meth, "apply rule in elimination manner (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
734 |
("drule_tac", inst_args_var dres_inst_meth, "apply rule in destruct manner (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
735 |
("frule_tac", inst_args_var forw_inst_meth, "apply rule in forward manner (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
736 |
("cut_tac", inst_args_var cut_inst_meth, "cut rule (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
737 |
("subgoal_tac", subgoal_meth, "insert subgoal (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
738 |
("thin_tac", thin_meth, "remove premise (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13650
diff
changeset
|
739 |
("rename_tac", rename_meth, "rename parameters of goal (dynamic instantiation)"), |
9631 | 740 |
("rotate_tac", rotate_meth, "rotate assumptions of goal"), |
8351 | 741 |
("tactic", simple_args Args.name tactic, "ML tactic as proof method")]; |
5824 | 742 |
|
15801 | 743 |
val _ = Context.add_setup [add_methods pure_methods]; |
5824 | 744 |
|
745 |
||
16145 | 746 |
(*final declarations of this structure!*) |
747 |
val unfold = unfold_meth; |
|
748 |
val fold = fold_meth; |
|
749 |
||
5824 | 750 |
end; |
751 |
||
752 |
structure BasicMethod: BASIC_METHOD = Method; |
|
753 |
open BasicMethod; |