wenzelm@5824
|
1 |
(* Title: Pure/Isar/method.ML
|
wenzelm@5824
|
2 |
ID: $Id$
|
wenzelm@5824
|
3 |
Author: Markus Wenzel, TU Muenchen
|
wenzelm@8807
|
4 |
License: GPL (GNU GENERAL PUBLIC LICENSE)
|
wenzelm@5824
|
5 |
|
wenzelm@5824
|
6 |
Proof methods.
|
wenzelm@5824
|
7 |
*)
|
wenzelm@5824
|
8 |
|
wenzelm@5824
|
9 |
signature BASIC_METHOD =
|
wenzelm@5824
|
10 |
sig
|
wenzelm@5824
|
11 |
val print_methods: theory -> unit
|
wenzelm@5824
|
12 |
val Method: bstring -> (Args.src -> Proof.context -> Proof.method) -> string -> unit
|
wenzelm@5824
|
13 |
end;
|
wenzelm@5824
|
14 |
|
wenzelm@5824
|
15 |
signature METHOD =
|
wenzelm@5824
|
16 |
sig
|
wenzelm@5824
|
17 |
include BASIC_METHOD
|
wenzelm@8153
|
18 |
val print_global_rules: theory -> unit
|
wenzelm@8153
|
19 |
val print_local_rules: Proof.context -> unit
|
wenzelm@8153
|
20 |
val dest_global: theory attribute
|
wenzelm@8153
|
21 |
val elim_global: theory attribute
|
wenzelm@8153
|
22 |
val intro_global: theory attribute
|
wenzelm@9938
|
23 |
val rule_del_global: theory attribute
|
wenzelm@8153
|
24 |
val dest_local: Proof.context attribute
|
wenzelm@8153
|
25 |
val elim_local: Proof.context attribute
|
wenzelm@8153
|
26 |
val intro_local: Proof.context attribute
|
wenzelm@9938
|
27 |
val rule_del_local: Proof.context attribute
|
wenzelm@6091
|
28 |
val METHOD: (thm list -> tactic) -> Proof.method
|
wenzelm@8372
|
29 |
val METHOD_CASES:
|
wenzelm@8372
|
30 |
(thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq) -> Proof.method
|
wenzelm@9706
|
31 |
val SIMPLE_METHOD: tactic -> Proof.method
|
wenzelm@9706
|
32 |
val SIMPLE_METHOD': ((int -> tactic) -> tactic) -> (int -> tactic) -> Proof.method
|
wenzelm@5824
|
33 |
val fail: Proof.method
|
wenzelm@5824
|
34 |
val succeed: Proof.method
|
wenzelm@8167
|
35 |
val defer: int option -> Proof.method
|
wenzelm@8167
|
36 |
val prefer: int -> Proof.method
|
wenzelm@7419
|
37 |
val insert_tac: thm list -> int -> tactic
|
wenzelm@7574
|
38 |
val insert: thm list -> Proof.method
|
wenzelm@7555
|
39 |
val insert_facts: Proof.method
|
wenzelm@7601
|
40 |
val unfold: thm list -> Proof.method
|
wenzelm@7419
|
41 |
val fold: thm list -> Proof.method
|
wenzelm@9484
|
42 |
val atomize_tac: thm list -> int -> tactic
|
wenzelm@9485
|
43 |
val atomize_goal: thm list -> int -> thm -> thm
|
wenzelm@7419
|
44 |
val multi_resolve: thm list -> thm -> thm Seq.seq
|
wenzelm@7419
|
45 |
val multi_resolves: thm list -> thm list -> thm Seq.seq
|
wenzelm@6091
|
46 |
val rule_tac: thm list -> thm list -> int -> tactic
|
wenzelm@10309
|
47 |
val some_rule_tac: thm list -> Proof.context -> thm list -> int -> tactic
|
wenzelm@6091
|
48 |
val rule: thm list -> Proof.method
|
wenzelm@10744
|
49 |
val erule: int -> thm list -> Proof.method
|
wenzelm@10744
|
50 |
val drule: int -> thm list -> Proof.method
|
wenzelm@10744
|
51 |
val frule: int -> thm list -> Proof.method
|
wenzelm@8195
|
52 |
val this: Proof.method
|
wenzelm@7555
|
53 |
val assumption: Proof.context -> Proof.method
|
wenzelm@8351
|
54 |
val set_tactic: (Proof.context -> thm list -> tactic) -> unit
|
wenzelm@8351
|
55 |
val tactic: string -> Proof.context -> Proof.method
|
wenzelm@5916
|
56 |
exception METHOD_FAIL of (string * Position.T) * exn
|
wenzelm@5824
|
57 |
val method: theory -> Args.src -> Proof.context -> Proof.method
|
wenzelm@9539
|
58 |
val add_method: bstring * (Args.src -> Proof.context -> Proof.method) * string
|
wenzelm@9539
|
59 |
-> theory -> theory
|
wenzelm@5824
|
60 |
val add_methods: (bstring * (Args.src -> Proof.context -> Proof.method) * string) list
|
wenzelm@5824
|
61 |
-> theory -> theory
|
wenzelm@5884
|
62 |
val syntax: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
|
wenzelm@8282
|
63 |
Args.src -> Proof.context -> Proof.context * 'a
|
wenzelm@8351
|
64 |
val simple_args: (Args.T list -> 'a * Args.T list)
|
wenzelm@8351
|
65 |
-> ('a -> Proof.context -> Proof.method) -> Args.src -> Proof.context -> Proof.method
|
wenzelm@7555
|
66 |
val ctxt_args: (Proof.context -> Proof.method) -> Args.src -> Proof.context -> Proof.method
|
wenzelm@5884
|
67 |
val no_args: Proof.method -> Args.src -> Proof.context -> Proof.method
|
wenzelm@7268
|
68 |
type modifier
|
wenzelm@7601
|
69 |
val sectioned_args: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
|
wenzelm@7268
|
70 |
(Args.T list -> modifier * Args.T list) list ->
|
wenzelm@9864
|
71 |
('a -> Proof.context -> 'b) -> Args.src -> Proof.context -> 'b
|
wenzelm@7601
|
72 |
val bang_sectioned_args:
|
wenzelm@7601
|
73 |
(Args.T list -> modifier * Args.T list) list ->
|
wenzelm@9864
|
74 |
(thm list -> Proof.context -> 'a) -> Args.src -> Proof.context -> 'a
|
wenzelm@9777
|
75 |
val bang_sectioned_args':
|
wenzelm@9777
|
76 |
(Args.T list -> modifier * Args.T list) list ->
|
wenzelm@9777
|
77 |
(Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
|
wenzelm@9864
|
78 |
('a -> thm list -> Proof.context -> 'b) -> Args.src -> Proof.context -> 'b
|
wenzelm@7601
|
79 |
val only_sectioned_args:
|
wenzelm@7601
|
80 |
(Args.T list -> modifier * Args.T list) list ->
|
wenzelm@9864
|
81 |
(Proof.context -> 'a) -> Args.src -> Proof.context -> 'a
|
wenzelm@9864
|
82 |
val thms_ctxt_args: (thm list -> Proof.context -> 'a) -> Args.src -> Proof.context -> 'a
|
wenzelm@9864
|
83 |
val thms_args: (thm list -> 'a) -> Args.src -> Proof.context -> 'a
|
wenzelm@9864
|
84 |
val thm_args: (thm -> 'a) -> Args.src -> Proof.context -> 'a
|
wenzelm@5824
|
85 |
datatype text =
|
wenzelm@5824
|
86 |
Basic of (Proof.context -> Proof.method) |
|
wenzelm@5824
|
87 |
Source of Args.src |
|
wenzelm@5824
|
88 |
Then of text list |
|
wenzelm@5824
|
89 |
Orelse of text list |
|
wenzelm@5824
|
90 |
Try of text |
|
wenzelm@5824
|
91 |
Repeat1 of text
|
wenzelm@5824
|
92 |
val refine: text -> Proof.state -> Proof.state Seq.seq
|
wenzelm@8238
|
93 |
val refine_end: text -> Proof.state -> Proof.state Seq.seq
|
wenzelm@5824
|
94 |
val proof: text option -> Proof.state -> Proof.state Seq.seq
|
wenzelm@8966
|
95 |
val local_qed: bool -> text option
|
wenzelm@6981
|
96 |
-> ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
|
wenzelm@6736
|
97 |
-> Proof.state -> Proof.state Seq.seq
|
wenzelm@6981
|
98 |
val local_terminal_proof: text * text option
|
wenzelm@6981
|
99 |
-> ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
|
wenzelm@6736
|
100 |
-> Proof.state -> Proof.state Seq.seq
|
wenzelm@8966
|
101 |
val local_default_proof: ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
|
wenzelm@8966
|
102 |
-> Proof.state -> Proof.state Seq.seq
|
wenzelm@6981
|
103 |
val local_immediate_proof: ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
|
wenzelm@6736
|
104 |
-> Proof.state -> Proof.state Seq.seq
|
wenzelm@8966
|
105 |
val local_done_proof: ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
|
wenzelm@6736
|
106 |
-> Proof.state -> Proof.state Seq.seq
|
wenzelm@8966
|
107 |
val global_qed: bool -> text option
|
wenzelm@8966
|
108 |
-> Proof.state -> theory * {kind: string, name: string, thm: thm}
|
wenzelm@6934
|
109 |
val global_terminal_proof: text * text option
|
wenzelm@6934
|
110 |
-> Proof.state -> theory * {kind: string, name: string, thm: thm}
|
wenzelm@8966
|
111 |
val global_default_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
|
wenzelm@6532
|
112 |
val global_immediate_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
|
wenzelm@8966
|
113 |
val global_done_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
|
wenzelm@9539
|
114 |
val goal_args: (Args.T list -> 'a * Args.T list) -> ('a -> int -> tactic)
|
wenzelm@9539
|
115 |
-> Args.src -> Proof.context -> Proof.method
|
wenzelm@9539
|
116 |
val goal_args': (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list))
|
wenzelm@9539
|
117 |
-> ('a -> int -> tactic) -> Args.src -> Proof.context -> Proof.method
|
wenzelm@5824
|
118 |
val setup: (theory -> theory) list
|
wenzelm@5824
|
119 |
end;
|
wenzelm@5824
|
120 |
|
wenzelm@5824
|
121 |
structure Method: METHOD =
|
wenzelm@5824
|
122 |
struct
|
wenzelm@5824
|
123 |
|
wenzelm@5824
|
124 |
|
wenzelm@8153
|
125 |
(** global and local rule data **)
|
wenzelm@8153
|
126 |
|
wenzelm@10008
|
127 |
local
|
wenzelm@10008
|
128 |
fun prt_rules kind sg ths =
|
wenzelm@10008
|
129 |
Pretty.writeln (Pretty.big_list ("standard " ^ kind ^ " rules:")
|
wenzelm@10008
|
130 |
(map (Display.pretty_thm_sg sg) ths));
|
wenzelm@10008
|
131 |
in
|
wenzelm@10008
|
132 |
fun print_rules sg (intro, elim) =
|
wenzelm@10008
|
133 |
(prt_rules "introduction" sg intro; prt_rules "elimination" sg elim);
|
wenzelm@10008
|
134 |
end;
|
wenzelm@8153
|
135 |
|
wenzelm@8153
|
136 |
|
wenzelm@8153
|
137 |
(* theory data kind 'Isar/rules' *)
|
wenzelm@8153
|
138 |
|
wenzelm@8153
|
139 |
structure GlobalRulesArgs =
|
wenzelm@8153
|
140 |
struct
|
wenzelm@8153
|
141 |
val name = "Isar/rules";
|
wenzelm@8153
|
142 |
type T = thm list * thm list;
|
wenzelm@8153
|
143 |
|
wenzelm@8153
|
144 |
val empty = ([], []);
|
wenzelm@8153
|
145 |
val copy = I;
|
wenzelm@8153
|
146 |
val prep_ext = I;
|
wenzelm@8153
|
147 |
fun merge ((intro1, elim1), (intro2, elim2)) =
|
wenzelm@9418
|
148 |
(Drule.merge_rules (intro1, intro2), Drule.merge_rules (elim1, elim2));
|
wenzelm@10008
|
149 |
val print = print_rules;
|
wenzelm@8153
|
150 |
end;
|
wenzelm@8153
|
151 |
|
wenzelm@8153
|
152 |
structure GlobalRules = TheoryDataFun(GlobalRulesArgs);
|
wenzelm@8153
|
153 |
val print_global_rules = GlobalRules.print;
|
wenzelm@8153
|
154 |
|
wenzelm@8153
|
155 |
|
wenzelm@8153
|
156 |
(* proof data kind 'Isar/rules' *)
|
wenzelm@8153
|
157 |
|
wenzelm@8153
|
158 |
structure LocalRulesArgs =
|
wenzelm@8153
|
159 |
struct
|
wenzelm@8153
|
160 |
val name = "Isar/rules";
|
wenzelm@8153
|
161 |
type T = thm list * thm list;
|
wenzelm@8153
|
162 |
|
wenzelm@8153
|
163 |
val init = GlobalRules.get;
|
wenzelm@10008
|
164 |
val print = print_rules o ProofContext.sign_of;
|
wenzelm@8153
|
165 |
end;
|
wenzelm@8153
|
166 |
|
wenzelm@8153
|
167 |
structure LocalRules = ProofDataFun(LocalRulesArgs);
|
wenzelm@8153
|
168 |
val print_local_rules = LocalRules.print;
|
wenzelm@8153
|
169 |
|
wenzelm@8153
|
170 |
|
wenzelm@8153
|
171 |
|
wenzelm@8153
|
172 |
(** attributes **)
|
wenzelm@8153
|
173 |
|
wenzelm@8153
|
174 |
(* add rules *)
|
wenzelm@8153
|
175 |
|
wenzelm@8153
|
176 |
local
|
wenzelm@8153
|
177 |
|
wenzelm@9938
|
178 |
fun add_dest th (intro, elim) = (intro, Drule.add_rules [Tactic.make_elim th] elim);
|
wenzelm@9938
|
179 |
fun add_elim th (intro, elim) = (intro, Drule.add_rules [th] elim);
|
wenzelm@9938
|
180 |
fun add_intro th (intro, elim) = (Drule.add_rules [th] intro, elim);
|
wenzelm@8153
|
181 |
|
wenzelm@9938
|
182 |
fun del_rule th (intro, elim) =
|
wenzelm@9938
|
183 |
let
|
wenzelm@9938
|
184 |
val th' = Tactic.make_elim th;
|
wenzelm@9938
|
185 |
val del = Drule.del_rules [th'] o Drule.del_rules [th];
|
wenzelm@9938
|
186 |
in (del intro, del elim) end;
|
wenzelm@8153
|
187 |
|
wenzelm@9938
|
188 |
fun mk_att f g (x, th) = (f (g th) x, th);
|
wenzelm@8153
|
189 |
|
wenzelm@8153
|
190 |
in
|
wenzelm@8153
|
191 |
|
wenzelm@8153
|
192 |
val dest_global = mk_att GlobalRules.map add_dest;
|
wenzelm@8153
|
193 |
val elim_global = mk_att GlobalRules.map add_elim;
|
wenzelm@8153
|
194 |
val intro_global = mk_att GlobalRules.map add_intro;
|
wenzelm@9938
|
195 |
val rule_del_global = mk_att GlobalRules.map del_rule;
|
wenzelm@8153
|
196 |
|
wenzelm@8153
|
197 |
val dest_local = mk_att LocalRules.map add_dest;
|
wenzelm@8153
|
198 |
val elim_local = mk_att LocalRules.map add_elim;
|
wenzelm@8153
|
199 |
val intro_local = mk_att LocalRules.map add_intro;
|
wenzelm@9938
|
200 |
val rule_del_local = mk_att LocalRules.map del_rule;
|
wenzelm@9938
|
201 |
|
wenzelm@10034
|
202 |
fun del_args att = Attrib.syntax (Scan.lift Args.del >> K att);
|
wenzelm@8153
|
203 |
|
wenzelm@8153
|
204 |
end;
|
wenzelm@8153
|
205 |
|
wenzelm@8153
|
206 |
|
wenzelm@8153
|
207 |
(* concrete syntax *)
|
wenzelm@8153
|
208 |
|
wenzelm@8153
|
209 |
val rule_atts =
|
wenzelm@9900
|
210 |
[("dest", (Attrib.no_args dest_global, Attrib.no_args dest_local),
|
wenzelm@9900
|
211 |
"declaration of destruction rule"),
|
wenzelm@9900
|
212 |
("elim", (Attrib.no_args elim_global, Attrib.no_args elim_local),
|
wenzelm@9900
|
213 |
"declaration of elimination rule"),
|
wenzelm@9900
|
214 |
("intro", (Attrib.no_args intro_global, Attrib.no_args intro_local),
|
wenzelm@9900
|
215 |
"declaration of introduction rule"),
|
wenzelm@9938
|
216 |
("rule", (del_args rule_del_global, del_args rule_del_local),
|
wenzelm@9900
|
217 |
"remove declaration of elim/intro rule")];
|
wenzelm@8153
|
218 |
|
wenzelm@8153
|
219 |
|
wenzelm@8153
|
220 |
|
wenzelm@5824
|
221 |
(** proof methods **)
|
wenzelm@5824
|
222 |
|
wenzelm@8372
|
223 |
(* make methods *)
|
wenzelm@5824
|
224 |
|
wenzelm@6849
|
225 |
val METHOD = Proof.method;
|
wenzelm@8372
|
226 |
val METHOD_CASES = Proof.method_cases;
|
wenzelm@8372
|
227 |
|
wenzelm@5824
|
228 |
|
wenzelm@5824
|
229 |
(* primitive *)
|
wenzelm@5824
|
230 |
|
wenzelm@5824
|
231 |
val fail = METHOD (K no_tac);
|
wenzelm@5824
|
232 |
val succeed = METHOD (K all_tac);
|
wenzelm@5824
|
233 |
|
wenzelm@5824
|
234 |
|
wenzelm@8167
|
235 |
(* shuffle *)
|
wenzelm@8167
|
236 |
|
wenzelm@8240
|
237 |
fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1)));
|
wenzelm@8167
|
238 |
fun defer opt_i = METHOD (K (Tactic.defer_tac (if_none opt_i 1)));
|
wenzelm@8167
|
239 |
|
wenzelm@8167
|
240 |
|
wenzelm@7419
|
241 |
(* insert *)
|
wenzelm@7419
|
242 |
|
wenzelm@7419
|
243 |
local
|
wenzelm@5824
|
244 |
|
wenzelm@6981
|
245 |
fun cut_rule_tac raw_rule =
|
wenzelm@6981
|
246 |
let
|
wenzelm@6981
|
247 |
val rule = Drule.forall_intr_vars raw_rule;
|
wenzelm@6981
|
248 |
val revcut_rl = Drule.incr_indexes_wrt [] [] [] [rule] Drule.revcut_rl;
|
wenzelm@7555
|
249 |
in Tactic.rtac (rule COMP revcut_rl) end;
|
wenzelm@6981
|
250 |
|
wenzelm@7419
|
251 |
in
|
wenzelm@5824
|
252 |
|
wenzelm@7419
|
253 |
fun insert_tac [] i = all_tac
|
wenzelm@7419
|
254 |
| insert_tac facts i = EVERY (map (fn th => cut_rule_tac th i) facts);
|
wenzelm@5824
|
255 |
|
wenzelm@7555
|
256 |
val insert_facts = METHOD (ALLGOALS o insert_tac);
|
wenzelm@7664
|
257 |
fun insert thms = METHOD (fn _ => ALLGOALS (insert_tac thms));
|
wenzelm@6981
|
258 |
|
wenzelm@7419
|
259 |
end;
|
wenzelm@5824
|
260 |
|
wenzelm@5824
|
261 |
|
wenzelm@9706
|
262 |
(* simple methods *)
|
wenzelm@9706
|
263 |
|
wenzelm@9706
|
264 |
fun SIMPLE_METHOD tac = METHOD (fn facts => ALLGOALS (insert_tac facts) THEN tac);
|
wenzelm@9706
|
265 |
fun SIMPLE_METHOD' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac));
|
wenzelm@9706
|
266 |
|
wenzelm@9706
|
267 |
|
wenzelm@7601
|
268 |
(* unfold / fold definitions *)
|
wenzelm@6532
|
269 |
|
wenzelm@9706
|
270 |
fun unfold thms = SIMPLE_METHOD (CHANGED (rewrite_goals_tac thms));
|
wenzelm@9706
|
271 |
fun fold thms = SIMPLE_METHOD (CHANGED (fold_goals_tac thms));
|
wenzelm@9484
|
272 |
|
wenzelm@9484
|
273 |
|
wenzelm@9484
|
274 |
(* atomize meta-connectives *)
|
wenzelm@9484
|
275 |
|
wenzelm@10405
|
276 |
fun atomize_tac rews =
|
wenzelm@10405
|
277 |
let val rew_tac = rewrite_goal_tac rews in
|
wenzelm@10405
|
278 |
fn i => fn thm =>
|
wenzelm@10405
|
279 |
if Logic.has_meta_prems (#prop (Thm.rep_thm thm)) i then rew_tac i thm
|
wenzelm@10405
|
280 |
else all_tac thm
|
wenzelm@10405
|
281 |
end;
|
wenzelm@10405
|
282 |
|
wenzelm@10405
|
283 |
fun atomize_goal rews =
|
wenzelm@10405
|
284 |
let val tac = atomize_tac rews
|
wenzelm@10405
|
285 |
in fn i => fn thm => (case Seq.pull (tac i thm) of None => thm | Some (thm', _) => thm') end;
|
wenzelm@6532
|
286 |
|
wenzelm@6532
|
287 |
|
wenzelm@7419
|
288 |
(* multi_resolve *)
|
wenzelm@7419
|
289 |
|
wenzelm@7419
|
290 |
local
|
wenzelm@7419
|
291 |
|
wenzelm@7419
|
292 |
fun res th i rule =
|
wenzelm@7419
|
293 |
Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty;
|
wenzelm@7419
|
294 |
|
wenzelm@7419
|
295 |
fun multi_res _ [] rule = Seq.single rule
|
wenzelm@7419
|
296 |
| multi_res i (th :: ths) rule = Seq.flat (Seq.map (res th i) (multi_res (i + 1) ths rule));
|
wenzelm@7419
|
297 |
|
wenzelm@7419
|
298 |
in
|
wenzelm@7419
|
299 |
|
wenzelm@7419
|
300 |
val multi_resolve = multi_res 1;
|
wenzelm@8372
|
301 |
fun multi_resolves facts rules = Seq.flat (Seq.map (multi_resolve facts) (Seq.of_list rules));
|
wenzelm@7419
|
302 |
|
wenzelm@7419
|
303 |
end;
|
wenzelm@7419
|
304 |
|
wenzelm@7419
|
305 |
|
wenzelm@10744
|
306 |
(* basic rules *)
|
wenzelm@8335
|
307 |
|
wenzelm@7419
|
308 |
local
|
wenzelm@5824
|
309 |
|
wenzelm@10541
|
310 |
fun gen_rule_tac tac rules [] i st = tac rules i st
|
wenzelm@10541
|
311 |
| gen_rule_tac tac erules facts i st =
|
wenzelm@10541
|
312 |
Seq.flat (Seq.map (fn rule => (tac o single) rule i st) (multi_resolves facts erules));
|
wenzelm@7130
|
313 |
|
wenzelm@10744
|
314 |
fun gen_arule_tac tac j rules facts =
|
wenzelm@10744
|
315 |
EVERY' (gen_rule_tac tac rules facts :: replicate j Tactic.assume_tac);
|
wenzelm@10744
|
316 |
|
wenzelm@10309
|
317 |
fun gen_some_rule_tac tac arg_rules ctxt facts =
|
wenzelm@8153
|
318 |
let val rules =
|
wenzelm@8153
|
319 |
if not (null arg_rules) then arg_rules
|
wenzelm@8153
|
320 |
else if null facts then #1 (LocalRules.get ctxt)
|
wenzelm@8153
|
321 |
else op @ (LocalRules.get ctxt);
|
wenzelm@10309
|
322 |
in tac rules facts end;
|
wenzelm@10309
|
323 |
|
wenzelm@10744
|
324 |
fun meth tac x = METHOD (HEADGOAL o tac x);
|
wenzelm@10744
|
325 |
fun meth' tac x y = METHOD (HEADGOAL o tac x y);
|
wenzelm@8220
|
326 |
|
wenzelm@7419
|
327 |
in
|
wenzelm@7419
|
328 |
|
wenzelm@10744
|
329 |
val rule_tac = gen_rule_tac Tactic.resolve_tac;
|
wenzelm@10744
|
330 |
val rule = meth rule_tac;
|
wenzelm@10744
|
331 |
val some_rule_tac = gen_some_rule_tac rule_tac;
|
wenzelm@10744
|
332 |
val some_rule = meth' some_rule_tac;
|
wenzelm@10744
|
333 |
|
wenzelm@10744
|
334 |
val erule = meth' (gen_arule_tac Tactic.eresolve_tac);
|
wenzelm@10744
|
335 |
val drule = meth' (gen_arule_tac Tactic.dresolve_tac);
|
wenzelm@10744
|
336 |
val frule = meth' (gen_arule_tac Tactic.forward_tac);
|
wenzelm@5824
|
337 |
|
wenzelm@7419
|
338 |
end;
|
wenzelm@7419
|
339 |
|
wenzelm@7419
|
340 |
|
wenzelm@8195
|
341 |
(* this *)
|
wenzelm@8195
|
342 |
|
wenzelm@8671
|
343 |
val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac));
|
wenzelm@8195
|
344 |
|
wenzelm@8195
|
345 |
|
wenzelm@8195
|
346 |
(* assumption *)
|
wenzelm@7419
|
347 |
|
wenzelm@10378
|
348 |
fun asm_tac ths =
|
wenzelm@10378
|
349 |
foldr (op APPEND') (map (fn th => Tactic.rtac th THEN_ALL_NEW assume_tac) ths, K no_tac);
|
wenzelm@10378
|
350 |
|
wenzelm@10405
|
351 |
fun assm_tac ctxt =
|
wenzelm@10405
|
352 |
assume_tac APPEND'
|
wenzelm@10405
|
353 |
asm_tac (ProofContext.prems_of ctxt) APPEND'
|
wenzelm@10405
|
354 |
Tactic.rtac Drule.reflexive_thm;
|
wenzelm@7419
|
355 |
|
wenzelm@7555
|
356 |
fun assumption_tac ctxt [] = assm_tac ctxt
|
wenzelm@10378
|
357 |
| assumption_tac _ [fact] = asm_tac [fact]
|
wenzelm@7555
|
358 |
| assumption_tac _ _ = K no_tac;
|
wenzelm@7555
|
359 |
|
wenzelm@8671
|
360 |
fun assumption ctxt = METHOD (HEADGOAL o assumption_tac ctxt);
|
wenzelm@7419
|
361 |
|
wenzelm@7419
|
362 |
|
wenzelm@9539
|
363 |
(* res_inst_tac etc. *)
|
wenzelm@8238
|
364 |
|
wenzelm@9539
|
365 |
(*Note: insts refer to the implicit (!!) goal context; use at your own risk*)
|
wenzelm@9565
|
366 |
fun gen_res_inst _ tac (quant, ([], thms)) =
|
wenzelm@9565
|
367 |
METHOD (fn facts => (quant (insert_tac facts THEN' tac thms)))
|
wenzelm@9565
|
368 |
| gen_res_inst tac _ (quant, (insts, [thm])) =
|
wenzelm@9565
|
369 |
METHOD (fn facts => (quant (insert_tac facts THEN' tac insts thm)))
|
wenzelm@9565
|
370 |
| gen_res_inst _ _ _ = error "Cannot have instantiations with multiple rules";
|
wenzelm@8238
|
371 |
|
wenzelm@9565
|
372 |
val res_inst = gen_res_inst Tactic.res_inst_tac Tactic.resolve_tac;
|
wenzelm@9565
|
373 |
val eres_inst = gen_res_inst Tactic.eres_inst_tac Tactic.eresolve_tac;
|
wenzelm@9565
|
374 |
val dres_inst = gen_res_inst Tactic.dres_inst_tac Tactic.dresolve_tac;
|
wenzelm@9565
|
375 |
val forw_inst = gen_res_inst Tactic.forw_inst_tac Tactic.forward_tac;
|
wenzelm@9565
|
376 |
val cut_inst = gen_res_inst Tactic.cut_inst_tac Tactic.cut_facts_tac;
|
wenzelm@8238
|
377 |
|
wenzelm@8238
|
378 |
|
wenzelm@8329
|
379 |
(* simple Prolog interpreter *)
|
wenzelm@8329
|
380 |
|
wenzelm@8329
|
381 |
fun prolog_tac rules facts =
|
wenzelm@8329
|
382 |
DEPTH_SOLVE_1 (HEADGOAL (Tactic.assume_tac APPEND' Tactic.resolve_tac (facts @ rules)));
|
wenzelm@8329
|
383 |
|
wenzelm@8329
|
384 |
val prolog = METHOD o prolog_tac;
|
wenzelm@8329
|
385 |
|
wenzelm@8329
|
386 |
|
wenzelm@8351
|
387 |
(* ML tactics *)
|
wenzelm@8351
|
388 |
|
wenzelm@8351
|
389 |
val tactic_ref = ref ((fn _ => raise Match): Proof.context -> thm list -> tactic);
|
wenzelm@8351
|
390 |
fun set_tactic f = tactic_ref := f;
|
wenzelm@8351
|
391 |
|
wenzelm@8351
|
392 |
fun tactic txt ctxt = METHOD (fn facts =>
|
wenzelm@9631
|
393 |
(Context.use_mltext
|
wenzelm@9631
|
394 |
("let fun tactic (ctxt: PureIsar.Proof.context) (facts: thm list) : tactic = \
|
wenzelm@9631
|
395 |
\let val thm = PureIsar.ProofContext.get_thm_closure ctxt\n\
|
wenzelm@9631
|
396 |
\ and thms = PureIsar.ProofContext.get_thms_closure ctxt in\n"
|
wenzelm@9631
|
397 |
^ txt ^
|
wenzelm@9631
|
398 |
"\nend in PureIsar.Method.set_tactic tactic end")
|
wenzelm@9631
|
399 |
false None;
|
wenzelm@9631
|
400 |
Context.setmp (Some (ProofContext.theory_of ctxt)) (! tactic_ref ctxt) facts));
|
wenzelm@8351
|
401 |
|
wenzelm@8351
|
402 |
|
wenzelm@5824
|
403 |
|
wenzelm@5824
|
404 |
(** methods theory data **)
|
wenzelm@5824
|
405 |
|
wenzelm@5824
|
406 |
(* data kind 'Isar/methods' *)
|
wenzelm@5824
|
407 |
|
wenzelm@5824
|
408 |
structure MethodsDataArgs =
|
wenzelm@5824
|
409 |
struct
|
wenzelm@5824
|
410 |
val name = "Isar/methods";
|
wenzelm@5824
|
411 |
type T =
|
wenzelm@5824
|
412 |
{space: NameSpace.T,
|
wenzelm@5824
|
413 |
meths: (((Args.src -> Proof.context -> Proof.method) * string) * stamp) Symtab.table};
|
wenzelm@5824
|
414 |
|
wenzelm@5824
|
415 |
val empty = {space = NameSpace.empty, meths = Symtab.empty};
|
wenzelm@6546
|
416 |
val copy = I;
|
wenzelm@5824
|
417 |
val prep_ext = I;
|
wenzelm@5824
|
418 |
fun merge ({space = space1, meths = meths1}, {space = space2, meths = meths2}) =
|
wenzelm@5824
|
419 |
{space = NameSpace.merge (space1, space2),
|
wenzelm@5824
|
420 |
meths = Symtab.merge eq_snd (meths1, meths2) handle Symtab.DUPS dups =>
|
wenzelm@5824
|
421 |
error ("Attempt to merge different versions of methods " ^ commas_quote dups)};
|
wenzelm@5824
|
422 |
|
wenzelm@9222
|
423 |
fun print _ {space, meths} =
|
wenzelm@5824
|
424 |
let
|
wenzelm@5824
|
425 |
fun prt_meth (name, ((_, comment), _)) = Pretty.block
|
wenzelm@6849
|
426 |
[Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
|
wenzelm@5824
|
427 |
in
|
wenzelm@8720
|
428 |
[Pretty.big_list "methods:" (map prt_meth (NameSpace.cond_extern_table space meths))]
|
wenzelm@9222
|
429 |
|> Pretty.chunks |> Pretty.writeln
|
wenzelm@5824
|
430 |
end;
|
wenzelm@5824
|
431 |
end;
|
wenzelm@5824
|
432 |
|
wenzelm@5824
|
433 |
structure MethodsData = TheoryDataFun(MethodsDataArgs);
|
wenzelm@5824
|
434 |
val print_methods = MethodsData.print;
|
wenzelm@7611
|
435 |
|
wenzelm@5824
|
436 |
|
wenzelm@5824
|
437 |
(* get methods *)
|
wenzelm@5824
|
438 |
|
wenzelm@5916
|
439 |
exception METHOD_FAIL of (string * Position.T) * exn;
|
wenzelm@5916
|
440 |
|
wenzelm@5824
|
441 |
fun method thy =
|
wenzelm@5824
|
442 |
let
|
wenzelm@5824
|
443 |
val {space, meths} = MethodsData.get thy;
|
wenzelm@5824
|
444 |
|
wenzelm@5884
|
445 |
fun meth src =
|
wenzelm@5884
|
446 |
let
|
wenzelm@5884
|
447 |
val ((raw_name, _), pos) = Args.dest_src src;
|
wenzelm@5884
|
448 |
val name = NameSpace.intern space raw_name;
|
wenzelm@5884
|
449 |
in
|
wenzelm@5824
|
450 |
(case Symtab.lookup (meths, name) of
|
wenzelm@5824
|
451 |
None => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos)
|
wenzelm@5916
|
452 |
| Some ((mth, _), _) => transform_failure (curry METHOD_FAIL (name, pos)) (mth src))
|
wenzelm@5824
|
453 |
end;
|
wenzelm@5824
|
454 |
in meth end;
|
wenzelm@5824
|
455 |
|
wenzelm@5824
|
456 |
|
wenzelm@9194
|
457 |
(* add_method(s) *)
|
wenzelm@5824
|
458 |
|
wenzelm@5824
|
459 |
fun add_methods raw_meths thy =
|
wenzelm@5824
|
460 |
let
|
wenzelm@5824
|
461 |
val full = Sign.full_name (Theory.sign_of thy);
|
wenzelm@5824
|
462 |
val new_meths =
|
wenzelm@5824
|
463 |
map (fn (name, f, comment) => (full name, ((f, comment), stamp ()))) raw_meths;
|
wenzelm@5824
|
464 |
|
wenzelm@5824
|
465 |
val {space, meths} = MethodsData.get thy;
|
wenzelm@5824
|
466 |
val space' = NameSpace.extend (space, map fst new_meths);
|
wenzelm@5824
|
467 |
val meths' = Symtab.extend (meths, new_meths) handle Symtab.DUPS dups =>
|
wenzelm@5824
|
468 |
error ("Duplicate declaration of method(s) " ^ commas_quote dups);
|
wenzelm@5824
|
469 |
in
|
wenzelm@5824
|
470 |
thy |> MethodsData.put {space = space', meths = meths'}
|
wenzelm@5824
|
471 |
end;
|
wenzelm@5824
|
472 |
|
wenzelm@9194
|
473 |
val add_method = add_methods o Library.single;
|
wenzelm@9194
|
474 |
|
wenzelm@5824
|
475 |
(*implicit version*)
|
wenzelm@5824
|
476 |
fun Method name meth cmt = Context.>> (add_methods [(name, meth, cmt)]);
|
wenzelm@5824
|
477 |
|
wenzelm@5824
|
478 |
|
wenzelm@5824
|
479 |
|
wenzelm@5884
|
480 |
(** method syntax **)
|
wenzelm@5824
|
481 |
|
wenzelm@5884
|
482 |
(* basic *)
|
wenzelm@5824
|
483 |
|
wenzelm@5884
|
484 |
fun syntax (scan: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list))) =
|
wenzelm@5884
|
485 |
Args.syntax "method" scan;
|
wenzelm@5824
|
486 |
|
wenzelm@8351
|
487 |
fun simple_args scan f src ctxt : Proof.method =
|
wenzelm@8351
|
488 |
#2 (syntax (Scan.lift (scan >> (fn x => f x ctxt))) src ctxt);
|
wenzelm@8351
|
489 |
|
wenzelm@7555
|
490 |
fun ctxt_args (f: Proof.context -> Proof.method) src ctxt =
|
wenzelm@8282
|
491 |
#2 (syntax (Scan.succeed (f ctxt)) src ctxt);
|
wenzelm@7555
|
492 |
|
wenzelm@7555
|
493 |
fun no_args m = ctxt_args (K m);
|
wenzelm@5824
|
494 |
|
wenzelm@5884
|
495 |
|
wenzelm@8351
|
496 |
|
wenzelm@5884
|
497 |
(* sections *)
|
wenzelm@5884
|
498 |
|
wenzelm@7268
|
499 |
type modifier = (Proof.context -> Proof.context) * Proof.context attribute;
|
wenzelm@7268
|
500 |
|
wenzelm@7268
|
501 |
local
|
wenzelm@7268
|
502 |
|
wenzelm@8381
|
503 |
fun sect ss = Scan.first (map Scan.lift ss);
|
wenzelm@5884
|
504 |
fun thms ss = Scan.unless (sect ss) Attrib.local_thms;
|
wenzelm@5884
|
505 |
fun thmss ss = Scan.repeat (thms ss) >> flat;
|
wenzelm@5884
|
506 |
|
wenzelm@7268
|
507 |
fun apply (f, att) (ctxt, ths) = Thm.applys_attributes ((f ctxt, ths), [att]);
|
wenzelm@5884
|
508 |
|
wenzelm@7268
|
509 |
fun section ss = (sect ss -- thmss ss) :-- (fn (m, ths) => Scan.depend (fn ctxt =>
|
wenzelm@7268
|
510 |
Scan.succeed (apply m (ctxt, ths)))) >> #2;
|
wenzelm@5884
|
511 |
|
wenzelm@7601
|
512 |
fun sectioned args ss = args -- Scan.repeat (section ss);
|
wenzelm@5884
|
513 |
|
wenzelm@7268
|
514 |
in
|
wenzelm@5884
|
515 |
|
wenzelm@5884
|
516 |
fun sectioned_args args ss f src ctxt =
|
wenzelm@8282
|
517 |
let val (ctxt', (x, _)) = syntax (sectioned args ss) src ctxt
|
wenzelm@5921
|
518 |
in f x ctxt' end;
|
wenzelm@5884
|
519 |
|
wenzelm@7601
|
520 |
fun bang_sectioned_args ss f = sectioned_args Args.bang_facts ss f;
|
wenzelm@9777
|
521 |
fun bang_sectioned_args' ss scan f =
|
wenzelm@9777
|
522 |
sectioned_args (Args.bang_facts -- scan >> swap) ss (uncurry f);
|
wenzelm@7601
|
523 |
fun only_sectioned_args ss f = sectioned_args (Scan.succeed ()) ss (fn () => f);
|
wenzelm@7268
|
524 |
|
wenzelm@8093
|
525 |
fun thms_ctxt_args f = sectioned_args (thmss []) [] f;
|
wenzelm@8093
|
526 |
fun thms_args f = thms_ctxt_args (K o f);
|
wenzelm@9706
|
527 |
fun thm_args f = thms_args (fn [thm] => f thm | _ => error "Single theorem expected");
|
wenzelm@5824
|
528 |
|
wenzelm@7268
|
529 |
end;
|
wenzelm@7268
|
530 |
|
wenzelm@5824
|
531 |
|
wenzelm@9539
|
532 |
(* tactic syntax *)
|
wenzelm@8238
|
533 |
|
wenzelm@10744
|
534 |
fun nat_thms_args f = uncurry f oo
|
wenzelm@10744
|
535 |
(#2 oo syntax (Scan.lift (Scan.optional (Args.parens Args.nat) 0) -- Attrib.local_thmss));
|
wenzelm@10744
|
536 |
|
wenzelm@8238
|
537 |
val insts =
|
wenzelm@9539
|
538 |
Scan.optional
|
wenzelm@9565
|
539 |
(Args.enum1 "and" (Scan.lift (Args.name -- (Args.$$$ "=" |-- Args.!!! Args.name))) --|
|
wenzelm@9565
|
540 |
Scan.lift (Args.$$$ "in")) [] -- Attrib.local_thmss;
|
wenzelm@8238
|
541 |
|
wenzelm@8537
|
542 |
fun inst_args f = f oo (#2 oo syntax (Args.goal_spec HEADGOAL -- insts));
|
wenzelm@8537
|
543 |
|
wenzelm@8537
|
544 |
|
wenzelm@9539
|
545 |
fun goal_args' args tac = #2 oo syntax (Args.goal_spec HEADGOAL -- args >>
|
wenzelm@9706
|
546 |
(fn (quant, s) => SIMPLE_METHOD' quant (tac s)));
|
wenzelm@8537
|
547 |
|
wenzelm@9539
|
548 |
fun goal_args args tac = goal_args' (Scan.lift args) tac;
|
wenzelm@8238
|
549 |
|
wenzelm@8238
|
550 |
|
wenzelm@5824
|
551 |
|
wenzelm@5824
|
552 |
(** method text **)
|
wenzelm@5824
|
553 |
|
wenzelm@5824
|
554 |
(* datatype text *)
|
wenzelm@5824
|
555 |
|
wenzelm@5824
|
556 |
datatype text =
|
wenzelm@5824
|
557 |
Basic of (Proof.context -> Proof.method) |
|
wenzelm@5824
|
558 |
Source of Args.src |
|
wenzelm@5824
|
559 |
Then of text list |
|
wenzelm@5824
|
560 |
Orelse of text list |
|
wenzelm@5824
|
561 |
Try of text |
|
wenzelm@5824
|
562 |
Repeat1 of text;
|
wenzelm@5824
|
563 |
|
wenzelm@5824
|
564 |
|
wenzelm@5824
|
565 |
(* refine *)
|
wenzelm@5824
|
566 |
|
wenzelm@8238
|
567 |
fun gen_refine f text state =
|
wenzelm@5824
|
568 |
let
|
wenzelm@5824
|
569 |
val thy = Proof.theory_of state;
|
wenzelm@5824
|
570 |
|
wenzelm@8238
|
571 |
fun eval (Basic mth) = f mth
|
wenzelm@8238
|
572 |
| eval (Source src) = f (method thy src)
|
wenzelm@5824
|
573 |
| eval (Then txts) = Seq.EVERY (map eval txts)
|
wenzelm@5824
|
574 |
| eval (Orelse txts) = Seq.FIRST (map eval txts)
|
wenzelm@5824
|
575 |
| eval (Try txt) = Seq.TRY (eval txt)
|
wenzelm@5824
|
576 |
| eval (Repeat1 txt) = Seq.REPEAT1 (eval txt);
|
wenzelm@5824
|
577 |
in eval text state end;
|
wenzelm@5824
|
578 |
|
wenzelm@8238
|
579 |
val refine = gen_refine Proof.refine;
|
wenzelm@8238
|
580 |
val refine_end = gen_refine Proof.refine_end;
|
wenzelm@6404
|
581 |
|
wenzelm@5824
|
582 |
|
wenzelm@6404
|
583 |
(* structured proof steps *)
|
wenzelm@5824
|
584 |
|
wenzelm@7506
|
585 |
val default_text = Source (Args.src (("default", []), Position.none));
|
wenzelm@8195
|
586 |
val this_text = Basic (K this);
|
wenzelm@9706
|
587 |
val done_text = Basic (K (SIMPLE_METHOD all_tac));
|
wenzelm@8195
|
588 |
|
wenzelm@8966
|
589 |
fun close_text asm = Basic (fn ctxt => METHOD (K
|
wenzelm@8966
|
590 |
(FILTER Thm.no_prems ((if asm then ALLGOALS (assm_tac ctxt) else all_tac) THEN flexflex_tac))));
|
wenzelm@7555
|
591 |
|
wenzelm@8966
|
592 |
fun finish_text asm None = close_text asm
|
wenzelm@8966
|
593 |
| finish_text asm (Some txt) = Then [txt, close_text asm];
|
wenzelm@6872
|
594 |
|
wenzelm@5824
|
595 |
fun proof opt_text state =
|
wenzelm@5824
|
596 |
state
|
wenzelm@5824
|
597 |
|> Proof.assert_backward
|
wenzelm@6404
|
598 |
|> refine (if_none opt_text default_text)
|
wenzelm@8242
|
599 |
|> Seq.map (Proof.goal_facts (K []))
|
wenzelm@5824
|
600 |
|> Seq.map Proof.enter_forward;
|
wenzelm@5824
|
601 |
|
wenzelm@8966
|
602 |
fun local_qed asm opt_text = Proof.local_qed (refine (finish_text asm opt_text));
|
wenzelm@8966
|
603 |
fun local_terminal_proof (text, opt_text) pr =
|
wenzelm@8966
|
604 |
Seq.THEN (proof (Some text), local_qed true opt_text pr);
|
wenzelm@8966
|
605 |
val local_default_proof = local_terminal_proof (default_text, None);
|
wenzelm@8195
|
606 |
val local_immediate_proof = local_terminal_proof (this_text, None);
|
wenzelm@8966
|
607 |
fun local_done_proof pr = Seq.THEN (proof (Some done_text), local_qed false None pr);
|
wenzelm@5824
|
608 |
|
wenzelm@6872
|
609 |
|
wenzelm@8966
|
610 |
fun global_qeds asm opt_text = Proof.global_qed (refine (finish_text asm opt_text));
|
wenzelm@5824
|
611 |
|
wenzelm@8966
|
612 |
fun global_qed asm opt_text state =
|
wenzelm@6872
|
613 |
state
|
wenzelm@8966
|
614 |
|> global_qeds asm opt_text
|
wenzelm@6872
|
615 |
|> Proof.check_result "Failed to finish proof" state
|
wenzelm@6872
|
616 |
|> Seq.hd;
|
wenzelm@6872
|
617 |
|
wenzelm@8966
|
618 |
fun global_term_proof asm (text, opt_text) state =
|
wenzelm@6872
|
619 |
state
|
wenzelm@6872
|
620 |
|> proof (Some text)
|
wenzelm@6872
|
621 |
|> Proof.check_result "Terminal proof method failed" state
|
wenzelm@8966
|
622 |
|> (Seq.flat o Seq.map (global_qeds asm opt_text))
|
wenzelm@6872
|
623 |
|> Proof.check_result "Failed to finish proof (after successful terminal method)" state
|
wenzelm@6872
|
624 |
|> Seq.hd;
|
wenzelm@6872
|
625 |
|
wenzelm@8966
|
626 |
val global_terminal_proof = global_term_proof true;
|
wenzelm@8966
|
627 |
val global_default_proof = global_terminal_proof (default_text, None);
|
wenzelm@8195
|
628 |
val global_immediate_proof = global_terminal_proof (this_text, None);
|
wenzelm@8966
|
629 |
val global_done_proof = global_term_proof false (done_text, None);
|
wenzelm@5824
|
630 |
|
wenzelm@5824
|
631 |
|
wenzelm@5824
|
632 |
(** theory setup **)
|
wenzelm@5824
|
633 |
|
wenzelm@9539
|
634 |
(* misc tactic emulations *)
|
wenzelm@9539
|
635 |
|
wenzelm@9539
|
636 |
val subgoal_meth = goal_args (Scan.repeat1 Args.name) Tactic.subgoals_tac;
|
wenzelm@9539
|
637 |
val thin_meth = goal_args Args.name Tactic.thin_tac;
|
wenzelm@9539
|
638 |
val rename_meth = goal_args (Scan.repeat1 Args.name) Tactic.rename_params_tac;
|
wenzelm@9631
|
639 |
val rotate_meth = goal_args (Scan.optional Args.int 1) Tactic.rotate_tac;
|
wenzelm@9539
|
640 |
|
wenzelm@9539
|
641 |
|
wenzelm@5824
|
642 |
(* pure_methods *)
|
wenzelm@5824
|
643 |
|
wenzelm@5824
|
644 |
val pure_methods =
|
wenzelm@5824
|
645 |
[("fail", no_args fail, "force failure"),
|
wenzelm@5824
|
646 |
("succeed", no_args succeed, "succeed"),
|
wenzelm@9587
|
647 |
("-", no_args insert_facts, "do nothing (insert current facts only)"),
|
wenzelm@9539
|
648 |
("insert", thms_args insert, "insert theorems, ignoring facts (improper)"),
|
wenzelm@7601
|
649 |
("unfold", thms_args unfold, "unfold definitions"),
|
wenzelm@7601
|
650 |
("fold", thms_args fold, "fold definitions"),
|
wenzelm@8153
|
651 |
("rule", thms_ctxt_args some_rule, "apply some rule"),
|
wenzelm@10744
|
652 |
("erule", nat_thms_args erule, "apply rule in elimination manner (improper)"),
|
wenzelm@10744
|
653 |
("drule", nat_thms_args drule, "apply rule in destruct manner (improper)"),
|
wenzelm@10744
|
654 |
("frule", nat_thms_args frule, "apply rule in forward manner (improper)"),
|
wenzelm@8195
|
655 |
("this", no_args this, "apply current facts as rules"),
|
wenzelm@8238
|
656 |
("assumption", ctxt_args assumption, "proof by assumption, preferring facts"),
|
wenzelm@9539
|
657 |
("rule_tac", inst_args res_inst, "apply rule (dynamic instantiation!)"),
|
wenzelm@9539
|
658 |
("erule_tac", inst_args eres_inst, "apply rule in elimination manner (dynamic instantiation!)"),
|
wenzelm@9539
|
659 |
("drule_tac", inst_args dres_inst, "apply rule in destruct manner (dynamic instantiation!)"),
|
wenzelm@9539
|
660 |
("frule_tac", inst_args forw_inst, "apply rule in forward manner (dynamic instantiation!)"),
|
wenzelm@9539
|
661 |
("cut_tac", inst_args cut_inst, "cut rule (dynamic instantiation!)"),
|
wenzelm@9565
|
662 |
("subgoal_tac", subgoal_meth, "insert subgoal (dynamic instantiation!)"),
|
wenzelm@9565
|
663 |
("thin_tac", thin_meth, "remove premise (dynamic instantiation!)"),
|
wenzelm@9631
|
664 |
("rename_tac", rename_meth, "rename parameters of goal (dynamic instantiation!)"),
|
wenzelm@9631
|
665 |
("rotate_tac", rotate_meth, "rotate assumptions of goal"),
|
wenzelm@8351
|
666 |
("prolog", thms_args prolog, "simple prolog interpreter"),
|
wenzelm@8351
|
667 |
("tactic", simple_args Args.name tactic, "ML tactic as proof method")];
|
wenzelm@5824
|
668 |
|
wenzelm@5824
|
669 |
|
wenzelm@5824
|
670 |
(* setup *)
|
wenzelm@5824
|
671 |
|
wenzelm@8153
|
672 |
val setup =
|
wenzelm@8153
|
673 |
[GlobalRules.init, LocalRules.init, Attrib.add_attributes rule_atts,
|
wenzelm@8153
|
674 |
MethodsData.init, add_methods pure_methods];
|
wenzelm@5824
|
675 |
|
wenzelm@5824
|
676 |
|
wenzelm@5824
|
677 |
end;
|
wenzelm@5824
|
678 |
|
wenzelm@5824
|
679 |
|
wenzelm@5824
|
680 |
structure BasicMethod: BASIC_METHOD = Method;
|
wenzelm@5824
|
681 |
open BasicMethod;
|