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