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