wenzelm@5824
|
1 |
(* Title: Pure/Isar/method.ML
|
wenzelm@5824
|
2 |
Author: Markus Wenzel, TU Muenchen
|
wenzelm@5824
|
3 |
|
wenzelm@17110
|
4 |
Isar proof methods.
|
wenzelm@5824
|
5 |
*)
|
wenzelm@5824
|
6 |
|
wenzelm@5824
|
7 |
signature BASIC_METHOD =
|
wenzelm@5824
|
8 |
sig
|
wenzelm@17110
|
9 |
val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
|
wenzelm@17110
|
10 |
val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
|
wenzelm@11731
|
11 |
val trace_rules: bool ref
|
wenzelm@5824
|
12 |
end;
|
wenzelm@5824
|
13 |
|
wenzelm@5824
|
14 |
signature METHOD =
|
wenzelm@5824
|
15 |
sig
|
wenzelm@5824
|
16 |
include BASIC_METHOD
|
wenzelm@30513
|
17 |
type method
|
wenzelm@25957
|
18 |
val apply: Position.T -> (Proof.context -> method) -> Proof.context -> thm list -> cases_tactic
|
wenzelm@18227
|
19 |
val RAW_METHOD_CASES: (thm list -> cases_tactic) -> method
|
wenzelm@17110
|
20 |
val RAW_METHOD: (thm list -> tactic) -> method
|
wenzelm@18227
|
21 |
val METHOD_CASES: (thm list -> cases_tactic) -> method
|
wenzelm@17110
|
22 |
val METHOD: (thm list -> tactic) -> method
|
wenzelm@17110
|
23 |
val fail: method
|
wenzelm@17110
|
24 |
val succeed: method
|
wenzelm@17110
|
25 |
val insert_tac: thm list -> int -> tactic
|
wenzelm@17110
|
26 |
val insert: thm list -> method
|
wenzelm@17110
|
27 |
val insert_facts: method
|
wenzelm@17110
|
28 |
val SIMPLE_METHOD: tactic -> method
|
wenzelm@21592
|
29 |
val SIMPLE_METHOD': (int -> tactic) -> method
|
wenzelm@21592
|
30 |
val SIMPLE_METHOD'': ((int -> tactic) -> tactic) -> (int -> tactic) -> method
|
wenzelm@17110
|
31 |
val defer: int option -> method
|
wenzelm@17110
|
32 |
val prefer: int -> method
|
wenzelm@20289
|
33 |
val cheating: bool -> Proof.context -> method
|
wenzelm@17110
|
34 |
val intro: thm list -> method
|
wenzelm@17110
|
35 |
val elim: thm list -> method
|
wenzelm@20289
|
36 |
val unfold: thm list -> Proof.context -> method
|
wenzelm@20289
|
37 |
val fold: thm list -> Proof.context -> method
|
wenzelm@17110
|
38 |
val atomize: bool -> method
|
wenzelm@17110
|
39 |
val this: method
|
wenzelm@20289
|
40 |
val fact: thm list -> Proof.context -> method
|
wenzelm@30234
|
41 |
val assm_tac: Proof.context -> int -> tactic
|
wenzelm@30567
|
42 |
val all_assm_tac: Proof.context -> tactic
|
wenzelm@20289
|
43 |
val assumption: Proof.context -> method
|
wenzelm@20289
|
44 |
val close: bool -> Proof.context -> method
|
wenzelm@20289
|
45 |
val trace: Proof.context -> thm list -> unit
|
wenzelm@6091
|
46 |
val rule_tac: thm list -> thm list -> int -> tactic
|
wenzelm@20289
|
47 |
val some_rule_tac: thm list -> Proof.context -> thm list -> int -> tactic
|
haftmann@25270
|
48 |
val intros_tac: thm list -> thm list -> tactic
|
wenzelm@17110
|
49 |
val rule: thm list -> method
|
wenzelm@17110
|
50 |
val erule: int -> thm list -> method
|
wenzelm@17110
|
51 |
val drule: int -> thm list -> method
|
wenzelm@17110
|
52 |
val frule: int -> thm list -> method
|
wenzelm@27235
|
53 |
val set_tactic: (thm list -> tactic) -> Proof.context -> Proof.context
|
wenzelm@26385
|
54 |
val tactic: string * Position.T -> Proof.context -> method
|
wenzelm@27235
|
55 |
val raw_tactic: string * Position.T -> Proof.context -> method
|
wenzelm@27729
|
56 |
type src = Args.src
|
wenzelm@5824
|
57 |
datatype text =
|
wenzelm@23349
|
58 |
Basic of (Proof.context -> method) * Position.T |
|
wenzelm@15703
|
59 |
Source of src |
|
wenzelm@20030
|
60 |
Source_i of src |
|
wenzelm@5824
|
61 |
Then of text list |
|
wenzelm@5824
|
62 |
Orelse of text list |
|
wenzelm@5824
|
63 |
Try of text |
|
wenzelm@19186
|
64 |
Repeat1 of text |
|
wenzelm@19186
|
65 |
SelectGoals of int * text
|
wenzelm@17857
|
66 |
val primitive_text: (thm -> thm) -> text
|
wenzelm@17857
|
67 |
val succeed_text: text
|
wenzelm@17110
|
68 |
val default_text: text
|
wenzelm@17110
|
69 |
val this_text: text
|
wenzelm@17110
|
70 |
val done_text: text
|
wenzelm@17356
|
71 |
val sorry_text: bool -> text
|
wenzelm@23349
|
72 |
val finish_text: text option * bool -> Position.T -> text
|
wenzelm@27729
|
73 |
val print_methods: theory -> unit
|
wenzelm@26892
|
74 |
val intern: theory -> xstring -> string
|
wenzelm@26892
|
75 |
val defined: theory -> string -> bool
|
wenzelm@20289
|
76 |
val method: theory -> src -> Proof.context -> method
|
wenzelm@20289
|
77 |
val method_i: theory -> src -> Proof.context -> method
|
wenzelm@30517
|
78 |
val syntax: 'a context_parser -> src -> Proof.context -> 'a * Proof.context
|
wenzelm@30517
|
79 |
val setup: binding -> (Proof.context -> method) context_parser -> string -> theory -> theory
|
wenzelm@30578
|
80 |
val method_setup: bstring * Position.T -> Symbol_Pos.text * Position.T -> string ->
|
wenzelm@30578
|
81 |
theory -> theory
|
wenzelm@30540
|
82 |
type modifier = (Proof.context -> Proof.context) * attribute
|
wenzelm@30540
|
83 |
val section: modifier parser list -> thm list context_parser
|
wenzelm@30540
|
84 |
val sections: modifier parser list -> thm list list context_parser
|
wenzelm@30517
|
85 |
val parse: text parser
|
wenzelm@5824
|
86 |
end;
|
wenzelm@5824
|
87 |
|
wenzelm@5824
|
88 |
structure Method: METHOD =
|
wenzelm@5824
|
89 |
struct
|
wenzelm@5824
|
90 |
|
wenzelm@17110
|
91 |
(** generic tools **)
|
wenzelm@17110
|
92 |
|
wenzelm@17110
|
93 |
(* goal addressing *)
|
wenzelm@17110
|
94 |
|
wenzelm@17110
|
95 |
fun FINDGOAL tac st =
|
wenzelm@17110
|
96 |
let fun find i n = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1) n)
|
wenzelm@17110
|
97 |
in find 1 (Thm.nprems_of st) st end;
|
wenzelm@17110
|
98 |
|
wenzelm@17110
|
99 |
fun HEADGOAL tac = tac 1;
|
wenzelm@17110
|
100 |
|
wenzelm@17110
|
101 |
|
wenzelm@5824
|
102 |
|
wenzelm@12324
|
103 |
(** proof methods **)
|
wenzelm@12324
|
104 |
|
wenzelm@17110
|
105 |
(* datatype method *)
|
wenzelm@11731
|
106 |
|
wenzelm@18227
|
107 |
datatype method = Meth of thm list -> cases_tactic;
|
wenzelm@11731
|
108 |
|
wenzelm@25957
|
109 |
fun apply pos meth_fun ctxt facts goal = Position.setmp_thread_data_seq pos
|
wenzelm@25957
|
110 |
(fn () => let val Meth meth = meth_fun ctxt in meth facts goal end) ();
|
wenzelm@11731
|
111 |
|
wenzelm@17756
|
112 |
val RAW_METHOD_CASES = Meth;
|
wenzelm@11731
|
113 |
|
wenzelm@17110
|
114 |
fun RAW_METHOD tac = RAW_METHOD_CASES (NO_CASES o tac);
|
wenzelm@5824
|
115 |
|
wenzelm@17110
|
116 |
fun METHOD_CASES tac = RAW_METHOD_CASES (fn facts =>
|
wenzelm@21687
|
117 |
Seq.THEN (ALLGOALS Goal.conjunction_tac, tac facts));
|
wenzelm@12144
|
118 |
|
wenzelm@21687
|
119 |
fun METHOD tac = RAW_METHOD (fn facts => ALLGOALS Goal.conjunction_tac THEN tac facts);
|
wenzelm@5824
|
120 |
|
wenzelm@5824
|
121 |
val fail = METHOD (K no_tac);
|
wenzelm@5824
|
122 |
val succeed = METHOD (K all_tac);
|
wenzelm@5824
|
123 |
|
wenzelm@5824
|
124 |
|
wenzelm@17110
|
125 |
(* insert facts *)
|
wenzelm@7419
|
126 |
|
wenzelm@7419
|
127 |
local
|
wenzelm@5824
|
128 |
|
wenzelm@21579
|
129 |
fun cut_rule_tac rule =
|
wenzelm@21579
|
130 |
Tactic.rtac (Drule.forall_intr_vars rule COMP_INCR revcut_rl);
|
wenzelm@6981
|
131 |
|
wenzelm@7419
|
132 |
in
|
wenzelm@5824
|
133 |
|
wenzelm@7419
|
134 |
fun insert_tac [] i = all_tac
|
wenzelm@7419
|
135 |
| insert_tac facts i = EVERY (map (fn th => cut_rule_tac th i) facts);
|
wenzelm@5824
|
136 |
|
wenzelm@7555
|
137 |
val insert_facts = METHOD (ALLGOALS o insert_tac);
|
wenzelm@7664
|
138 |
fun insert thms = METHOD (fn _ => ALLGOALS (insert_tac thms));
|
wenzelm@6981
|
139 |
|
wenzelm@9706
|
140 |
fun SIMPLE_METHOD tac = METHOD (fn facts => ALLGOALS (insert_tac facts) THEN tac);
|
wenzelm@21592
|
141 |
fun SIMPLE_METHOD'' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac));
|
wenzelm@21592
|
142 |
val SIMPLE_METHOD' = SIMPLE_METHOD'' HEADGOAL;
|
wenzelm@9706
|
143 |
|
wenzelm@12324
|
144 |
end;
|
wenzelm@12324
|
145 |
|
wenzelm@9706
|
146 |
|
wenzelm@17110
|
147 |
(* shuffle subgoals *)
|
wenzelm@17110
|
148 |
|
wenzelm@17110
|
149 |
fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1)));
|
wenzelm@18939
|
150 |
fun defer opt_i = METHOD (K (Tactic.defer_tac (the_default 1 opt_i)));
|
wenzelm@17110
|
151 |
|
wenzelm@17110
|
152 |
|
wenzelm@17356
|
153 |
(* cheating *)
|
wenzelm@17356
|
154 |
|
wenzelm@17356
|
155 |
fun cheating int ctxt = METHOD (K (setmp quick_and_dirty (int orelse ! quick_and_dirty)
|
wenzelm@17356
|
156 |
(SkipProof.cheat_tac (ProofContext.theory_of ctxt))));
|
wenzelm@17356
|
157 |
|
wenzelm@17356
|
158 |
|
wenzelm@17110
|
159 |
(* unfold intro/elim rules *)
|
wenzelm@17110
|
160 |
|
wenzelm@21592
|
161 |
fun intro ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.match_tac ths));
|
wenzelm@21592
|
162 |
fun elim ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.ematch_tac ths));
|
wenzelm@17110
|
163 |
|
wenzelm@17110
|
164 |
|
wenzelm@12384
|
165 |
(* unfold/fold definitions *)
|
wenzelm@6532
|
166 |
|
wenzelm@18877
|
167 |
fun unfold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.unfold_tac ctxt ths));
|
wenzelm@18877
|
168 |
fun fold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.fold_tac ctxt ths));
|
wenzelm@12384
|
169 |
|
wenzelm@12384
|
170 |
|
wenzelm@12829
|
171 |
(* atomize rule statements *)
|
wenzelm@12829
|
172 |
|
wenzelm@23590
|
173 |
fun atomize false = SIMPLE_METHOD' (CHANGED_PROP o ObjectLogic.atomize_prems_tac)
|
wenzelm@12829
|
174 |
| atomize true = RAW_METHOD (K (HEADGOAL (CHANGED_PROP o ObjectLogic.full_atomize_tac)));
|
wenzelm@12829
|
175 |
|
wenzelm@12829
|
176 |
|
wenzelm@18039
|
177 |
(* this -- resolve facts directly *)
|
wenzelm@12384
|
178 |
|
wenzelm@17110
|
179 |
val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac));
|
wenzelm@9484
|
180 |
|
wenzelm@9484
|
181 |
|
wenzelm@18039
|
182 |
(* fact -- composition by facts from context *)
|
wenzelm@18039
|
183 |
|
wenzelm@21592
|
184 |
fun fact [] ctxt = SIMPLE_METHOD' (ProofContext.some_fact_tac ctxt)
|
wenzelm@21592
|
185 |
| fact rules _ = SIMPLE_METHOD' (ProofContext.fact_tac rules);
|
wenzelm@18039
|
186 |
|
wenzelm@18039
|
187 |
|
wenzelm@17110
|
188 |
(* assumption *)
|
wenzelm@7419
|
189 |
|
wenzelm@7419
|
190 |
local
|
wenzelm@7419
|
191 |
|
wenzelm@19778
|
192 |
fun cond_rtac cond rule = SUBGOAL (fn (prop, i) =>
|
wenzelm@19778
|
193 |
if cond (Logic.strip_assums_concl prop)
|
wenzelm@19778
|
194 |
then Tactic.rtac rule i else no_tac);
|
wenzelm@17110
|
195 |
|
kleing@29794
|
196 |
in
|
kleing@29794
|
197 |
|
wenzelm@30234
|
198 |
fun assm_tac ctxt =
|
wenzelm@17110
|
199 |
assume_tac APPEND'
|
wenzelm@23349
|
200 |
Goal.assume_rule_tac ctxt APPEND'
|
wenzelm@19778
|
201 |
cond_rtac (can Logic.dest_equals) Drule.reflexive_thm APPEND'
|
wenzelm@19778
|
202 |
cond_rtac (can Logic.dest_term) Drule.termI;
|
wenzelm@17110
|
203 |
|
wenzelm@30567
|
204 |
fun all_assm_tac ctxt st = EVERY1 (replicate (Thm.nprems_of st) (assm_tac ctxt)) st;
|
wenzelm@30567
|
205 |
|
wenzelm@23349
|
206 |
fun assumption ctxt = METHOD (HEADGOAL o
|
wenzelm@30234
|
207 |
(fn [] => assm_tac ctxt
|
wenzelm@23349
|
208 |
| [fact] => solve_tac [fact]
|
wenzelm@23349
|
209 |
| _ => K no_tac));
|
wenzelm@23349
|
210 |
|
wenzelm@17356
|
211 |
fun close immed ctxt = METHOD (K
|
wenzelm@30567
|
212 |
(FILTER Thm.no_prems ((if immed then all_assm_tac ctxt else all_tac) THEN flexflex_tac)));
|
wenzelm@7419
|
213 |
|
wenzelm@7419
|
214 |
end;
|
wenzelm@7419
|
215 |
|
wenzelm@7419
|
216 |
|
wenzelm@17110
|
217 |
(* rule etc. -- single-step refinements *)
|
wenzelm@8335
|
218 |
|
wenzelm@17110
|
219 |
val trace_rules = ref false;
|
wenzelm@5824
|
220 |
|
wenzelm@17110
|
221 |
fun trace ctxt rules =
|
wenzelm@21962
|
222 |
if ! trace_rules andalso not (null rules) then
|
wenzelm@17110
|
223 |
Pretty.big_list "rules:" (map (ProofContext.pretty_thm ctxt) rules)
|
wenzelm@21962
|
224 |
|> Pretty.string_of |> tracing
|
wenzelm@21962
|
225 |
else ();
|
wenzelm@12347
|
226 |
|
wenzelm@12347
|
227 |
local
|
wenzelm@12347
|
228 |
|
wenzelm@18841
|
229 |
fun gen_rule_tac tac rules facts =
|
wenzelm@18841
|
230 |
(fn i => fn st =>
|
wenzelm@18841
|
231 |
if null facts then tac rules i st
|
wenzelm@18841
|
232 |
else Seq.maps (fn rule => (tac o single) rule i st) (Drule.multi_resolves facts rules))
|
wenzelm@21687
|
233 |
THEN_ALL_NEW Goal.norm_hhf_tac;
|
wenzelm@7130
|
234 |
|
wenzelm@10744
|
235 |
fun gen_arule_tac tac j rules facts =
|
wenzelm@10744
|
236 |
EVERY' (gen_rule_tac tac rules facts :: replicate j Tactic.assume_tac);
|
wenzelm@10744
|
237 |
|
wenzelm@11785
|
238 |
fun gen_some_rule_tac tac arg_rules ctxt facts = SUBGOAL (fn (goal, i) =>
|
wenzelm@11785
|
239 |
let
|
wenzelm@11785
|
240 |
val rules =
|
wenzelm@11785
|
241 |
if not (null arg_rules) then arg_rules
|
wenzelm@19482
|
242 |
else flat (ContextRules.find_rules false facts goal ctxt)
|
wenzelm@12055
|
243 |
in trace ctxt rules; tac rules facts i end);
|
wenzelm@10309
|
244 |
|
wenzelm@10744
|
245 |
fun meth tac x = METHOD (HEADGOAL o tac x);
|
wenzelm@10744
|
246 |
fun meth' tac x y = METHOD (HEADGOAL o tac x y);
|
wenzelm@8220
|
247 |
|
wenzelm@7419
|
248 |
in
|
wenzelm@7419
|
249 |
|
wenzelm@10744
|
250 |
val rule_tac = gen_rule_tac Tactic.resolve_tac;
|
wenzelm@10744
|
251 |
val rule = meth rule_tac;
|
wenzelm@10744
|
252 |
val some_rule_tac = gen_some_rule_tac rule_tac;
|
wenzelm@10744
|
253 |
val some_rule = meth' some_rule_tac;
|
wenzelm@10744
|
254 |
|
wenzelm@10744
|
255 |
val erule = meth' (gen_arule_tac Tactic.eresolve_tac);
|
wenzelm@10744
|
256 |
val drule = meth' (gen_arule_tac Tactic.dresolve_tac);
|
wenzelm@10744
|
257 |
val frule = meth' (gen_arule_tac Tactic.forward_tac);
|
wenzelm@5824
|
258 |
|
wenzelm@7419
|
259 |
end;
|
wenzelm@7419
|
260 |
|
wenzelm@7419
|
261 |
|
haftmann@25270
|
262 |
(* intros_tac -- pervasive search spanned by intro rules *)
|
haftmann@25270
|
263 |
|
haftmann@25270
|
264 |
fun intros_tac intros facts =
|
haftmann@25270
|
265 |
ALLGOALS (insert_tac facts THEN'
|
haftmann@25270
|
266 |
REPEAT_ALL_NEW (resolve_tac intros))
|
haftmann@25270
|
267 |
THEN Tactic.distinct_subgoals_tac;
|
haftmann@25270
|
268 |
|
haftmann@25270
|
269 |
|
wenzelm@8351
|
270 |
(* ML tactics *)
|
wenzelm@8351
|
271 |
|
wenzelm@26472
|
272 |
structure TacticData = ProofDataFun
|
wenzelm@26472
|
273 |
(
|
wenzelm@27235
|
274 |
type T = thm list -> tactic;
|
wenzelm@26472
|
275 |
fun init _ = undefined;
|
wenzelm@26472
|
276 |
);
|
wenzelm@8351
|
277 |
|
wenzelm@26472
|
278 |
val set_tactic = TacticData.put;
|
wenzelm@26472
|
279 |
|
wenzelm@26472
|
280 |
fun ml_tactic (txt, pos) ctxt =
|
wenzelm@26472
|
281 |
let
|
wenzelm@26472
|
282 |
val ctxt' = ctxt |> Context.proof_map
|
wenzelm@27235
|
283 |
(ML_Context.expression pos
|
wenzelm@27235
|
284 |
"fun tactic (facts: thm list) : tactic"
|
wenzelm@26472
|
285 |
"Context.map_proof (Method.set_tactic tactic)" txt);
|
wenzelm@27235
|
286 |
in Context.setmp_thread_data (SOME (Context.Proof ctxt)) (TacticData.get ctxt') end;
|
wenzelm@23425
|
287 |
|
wenzelm@23425
|
288 |
fun tactic txt ctxt = METHOD (ml_tactic txt ctxt);
|
wenzelm@23425
|
289 |
fun raw_tactic txt ctxt = RAW_METHOD (ml_tactic txt ctxt);
|
wenzelm@8351
|
290 |
|
wenzelm@8351
|
291 |
|
wenzelm@5824
|
292 |
|
wenzelm@17110
|
293 |
(** method syntax **)
|
wenzelm@5824
|
294 |
|
wenzelm@17110
|
295 |
(* method text *)
|
wenzelm@17110
|
296 |
|
wenzelm@17110
|
297 |
type src = Args.src;
|
wenzelm@17110
|
298 |
|
wenzelm@17110
|
299 |
datatype text =
|
wenzelm@23349
|
300 |
Basic of (Proof.context -> method) * Position.T |
|
wenzelm@17110
|
301 |
Source of src |
|
wenzelm@20030
|
302 |
Source_i of src |
|
wenzelm@17110
|
303 |
Then of text list |
|
wenzelm@17110
|
304 |
Orelse of text list |
|
wenzelm@17110
|
305 |
Try of text |
|
wenzelm@19186
|
306 |
Repeat1 of text |
|
wenzelm@19186
|
307 |
SelectGoals of int * text;
|
wenzelm@17110
|
308 |
|
wenzelm@23349
|
309 |
fun primitive_text r = Basic (K (SIMPLE_METHOD (PRIMITIVE r)), Position.none);
|
wenzelm@23349
|
310 |
val succeed_text = Basic (K succeed, Position.none);
|
wenzelm@17110
|
311 |
val default_text = Source (Args.src (("default", []), Position.none));
|
wenzelm@23349
|
312 |
val this_text = Basic (K this, Position.none);
|
wenzelm@23349
|
313 |
val done_text = Basic (K (SIMPLE_METHOD all_tac), Position.none);
|
wenzelm@23349
|
314 |
fun sorry_text int = Basic (cheating int, Position.none);
|
wenzelm@17110
|
315 |
|
wenzelm@23349
|
316 |
fun finish_text (NONE, immed) pos = Basic (close immed, pos)
|
wenzelm@23349
|
317 |
| finish_text (SOME txt, immed) pos = Then [txt, Basic (close immed, pos)];
|
wenzelm@17110
|
318 |
|
wenzelm@17110
|
319 |
|
wenzelm@17110
|
320 |
(* method definitions *)
|
wenzelm@5824
|
321 |
|
wenzelm@24116
|
322 |
structure Methods = TheoryDataFun
|
wenzelm@22846
|
323 |
(
|
wenzelm@20289
|
324 |
type T = (((src -> Proof.context -> method) * string) * stamp) NameSpace.table;
|
wenzelm@16347
|
325 |
val empty = NameSpace.empty_table;
|
wenzelm@6546
|
326 |
val copy = I;
|
wenzelm@16448
|
327 |
val extend = I;
|
wenzelm@23655
|
328 |
fun merge _ tables : T = NameSpace.merge_tables (eq_snd (op =)) tables handle Symtab.DUP dup =>
|
wenzelm@23655
|
329 |
error ("Attempt to merge different versions of method " ^ quote dup);
|
wenzelm@22846
|
330 |
);
|
wenzelm@5824
|
331 |
|
wenzelm@22846
|
332 |
fun print_methods thy =
|
wenzelm@22846
|
333 |
let
|
wenzelm@24116
|
334 |
val meths = Methods.get thy;
|
wenzelm@22846
|
335 |
fun prt_meth (name, ((_, comment), _)) = Pretty.block
|
wenzelm@22846
|
336 |
[Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
|
wenzelm@22846
|
337 |
in
|
wenzelm@22846
|
338 |
[Pretty.big_list "methods:" (map prt_meth (NameSpace.extern_table meths))]
|
wenzelm@22846
|
339 |
|> Pretty.chunks |> Pretty.writeln
|
wenzelm@22846
|
340 |
end;
|
wenzelm@7611
|
341 |
|
wenzelm@31304
|
342 |
fun add_method name meth comment thy = thy |> Methods.map (fn meths =>
|
wenzelm@31304
|
343 |
#2 (NameSpace.define (Sign.naming_of thy) (name, ((meth, comment), stamp ())) meths)
|
wenzelm@31304
|
344 |
handle Symtab.DUP dup => error ("Duplicate declaration of method " ^ quote dup));
|
wenzelm@31304
|
345 |
|
wenzelm@5824
|
346 |
|
wenzelm@5824
|
347 |
(* get methods *)
|
wenzelm@5824
|
348 |
|
wenzelm@26892
|
349 |
val intern = NameSpace.intern o #1 o Methods.get;
|
wenzelm@26892
|
350 |
val defined = Symtab.defined o #2 o Methods.get;
|
wenzelm@26892
|
351 |
|
wenzelm@20030
|
352 |
fun method_i thy =
|
wenzelm@5824
|
353 |
let
|
wenzelm@24116
|
354 |
val meths = #2 (Methods.get thy);
|
wenzelm@5884
|
355 |
fun meth src =
|
wenzelm@20030
|
356 |
let val ((name, _), pos) = Args.dest_src src in
|
wenzelm@17412
|
357 |
(case Symtab.lookup meths name of
|
skalberg@15531
|
358 |
NONE => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos)
|
wenzelm@27751
|
359 |
| SOME ((mth, _), _) => (Position.report (Markup.method name) pos; mth src))
|
wenzelm@5824
|
360 |
end;
|
wenzelm@5824
|
361 |
in meth end;
|
wenzelm@5824
|
362 |
|
wenzelm@24116
|
363 |
fun method thy = method_i thy o Args.map_name (NameSpace.intern (#1 (Methods.get thy)));
|
wenzelm@20030
|
364 |
|
wenzelm@5824
|
365 |
|
wenzelm@30517
|
366 |
(* method setup *)
|
wenzelm@30517
|
367 |
|
wenzelm@30517
|
368 |
fun syntax scan = Args.context_syntax "method" scan;
|
wenzelm@30517
|
369 |
|
wenzelm@31304
|
370 |
fun setup name scan =
|
wenzelm@31304
|
371 |
add_method name
|
wenzelm@31304
|
372 |
(fn src => fn ctxt => let val (m, ctxt') = syntax scan src ctxt in m ctxt' end);
|
wenzelm@17356
|
373 |
|
wenzelm@26385
|
374 |
fun method_setup name (txt, pos) cmt =
|
wenzelm@26472
|
375 |
Context.theory_map (ML_Context.expression pos
|
wenzelm@30544
|
376 |
"val (name, scan, comment): binding * (Proof.context -> Proof.method) context_parser * string"
|
wenzelm@30544
|
377 |
"Context.map_theory (Method.setup name scan comment)"
|
wenzelm@30544
|
378 |
("(" ^ ML_Syntax.make_binding name ^ ", " ^ txt ^ ", " ^ ML_Syntax.print_string cmt ^ ")"));
|
wenzelm@17356
|
379 |
|
wenzelm@17356
|
380 |
|
wenzelm@5824
|
381 |
|
wenzelm@17110
|
382 |
(** concrete syntax **)
|
wenzelm@5824
|
383 |
|
wenzelm@27813
|
384 |
structure P = OuterParse;
|
wenzelm@27813
|
385 |
|
wenzelm@27813
|
386 |
|
wenzelm@5884
|
387 |
(* sections *)
|
wenzelm@5884
|
388 |
|
wenzelm@20289
|
389 |
type modifier = (Proof.context -> Proof.context) * attribute;
|
wenzelm@7268
|
390 |
|
wenzelm@7268
|
391 |
local
|
wenzelm@7268
|
392 |
|
wenzelm@24010
|
393 |
fun thms ss = Scan.repeat (Scan.unless (Scan.lift (Scan.first ss)) Attrib.multi_thm) >> flat;
|
wenzelm@30193
|
394 |
fun app (f, att) (context, ths) = Library.foldl_map att (Context.map_proof f context, ths);
|
wenzelm@5884
|
395 |
|
wenzelm@30540
|
396 |
in
|
wenzelm@30540
|
397 |
|
wenzelm@24022
|
398 |
fun section ss = Scan.depend (fn context => (Scan.first ss -- Scan.pass context (thms ss)) :|--
|
wenzelm@24022
|
399 |
(fn (m, ths) => Scan.succeed (app m (context, ths))));
|
wenzelm@5884
|
400 |
|
wenzelm@30540
|
401 |
fun sections ss = Scan.repeat (section ss);
|
wenzelm@5884
|
402 |
|
wenzelm@7268
|
403 |
end;
|
wenzelm@7268
|
404 |
|
wenzelm@5824
|
405 |
|
wenzelm@30520
|
406 |
(* extra rule methods *)
|
wenzelm@30520
|
407 |
|
wenzelm@30520
|
408 |
fun xrule_meth m =
|
wenzelm@30520
|
409 |
Scan.lift (Scan.optional (Args.parens OuterParse.nat) 0) -- Attrib.thms >>
|
wenzelm@30520
|
410 |
(fn (n, ths) => K (m n ths));
|
wenzelm@30520
|
411 |
|
wenzelm@30520
|
412 |
|
wenzelm@27813
|
413 |
(* outer parser *)
|
wenzelm@27813
|
414 |
|
wenzelm@27813
|
415 |
fun is_symid_meth s =
|
wenzelm@27813
|
416 |
s <> "|" andalso s <> "?" andalso s <> "+" andalso OuterLex.ident_or_symbolic s;
|
wenzelm@27813
|
417 |
|
wenzelm@27813
|
418 |
local
|
wenzelm@27813
|
419 |
|
wenzelm@27813
|
420 |
fun meth4 x =
|
wenzelm@27813
|
421 |
(P.position (P.xname >> rpair []) >> (Source o Args.src) ||
|
wenzelm@27813
|
422 |
P.$$$ "(" |-- P.!!! (meth0 --| P.$$$ ")")) x
|
wenzelm@27813
|
423 |
and meth3 x =
|
wenzelm@27813
|
424 |
(meth4 --| P.$$$ "?" >> Try ||
|
wenzelm@27813
|
425 |
meth4 --| P.$$$ "+" >> Repeat1 ||
|
wenzelm@27813
|
426 |
meth4 -- (P.$$$ "[" |-- Scan.optional P.nat 1 --| P.$$$ "]") >> (SelectGoals o swap) ||
|
wenzelm@27813
|
427 |
meth4) x
|
wenzelm@27813
|
428 |
and meth2 x =
|
wenzelm@27813
|
429 |
(P.position (P.xname -- Args.parse1 is_symid_meth) >> (Source o Args.src) ||
|
wenzelm@27813
|
430 |
meth3) x
|
wenzelm@27813
|
431 |
and meth1 x = (P.enum1 "," meth2 >> (fn [m] => m | ms => Then ms)) x
|
wenzelm@27813
|
432 |
and meth0 x = (P.enum1 "|" meth1 >> (fn [m] => m | ms => Orelse ms)) x;
|
wenzelm@27813
|
433 |
|
wenzelm@27813
|
434 |
in val parse = meth3 end;
|
wenzelm@27813
|
435 |
|
wenzelm@27813
|
436 |
|
wenzelm@18708
|
437 |
(* theory setup *)
|
wenzelm@5824
|
438 |
|
wenzelm@26463
|
439 |
val _ = Context.>> (Context.map_theory
|
wenzelm@30520
|
440 |
(setup (Binding.name "fail") (Scan.succeed (K fail)) "force failure" #>
|
wenzelm@30520
|
441 |
setup (Binding.name "succeed") (Scan.succeed (K succeed)) "succeed" #>
|
wenzelm@30520
|
442 |
setup (Binding.name "-") (Scan.succeed (K insert_facts))
|
wenzelm@30520
|
443 |
"do nothing (insert current facts only)" #>
|
wenzelm@30520
|
444 |
setup (Binding.name "insert") (Attrib.thms >> (K o insert))
|
wenzelm@30520
|
445 |
"insert theorems, ignoring facts (improper)" #>
|
wenzelm@30520
|
446 |
setup (Binding.name "intro") (Attrib.thms >> (K o intro))
|
wenzelm@30520
|
447 |
"repeatedly apply introduction rules" #>
|
wenzelm@30520
|
448 |
setup (Binding.name "elim") (Attrib.thms >> (K o elim))
|
wenzelm@30520
|
449 |
"repeatedly apply elimination rules" #>
|
wenzelm@30520
|
450 |
setup (Binding.name "unfold") (Attrib.thms >> unfold_meth) "unfold definitions" #>
|
wenzelm@30520
|
451 |
setup (Binding.name "fold") (Attrib.thms >> fold_meth) "fold definitions" #>
|
wenzelm@30520
|
452 |
setup (Binding.name "atomize") (Args.mode "full" >> (K o atomize))
|
wenzelm@30520
|
453 |
"present local premises as object-level statements" #>
|
wenzelm@30520
|
454 |
setup (Binding.name "rule") (Attrib.thms >> some_rule) "apply some intro/elim rule" #>
|
wenzelm@30520
|
455 |
setup (Binding.name "erule") (xrule_meth erule) "apply rule in elimination manner (improper)" #>
|
wenzelm@30520
|
456 |
setup (Binding.name "drule") (xrule_meth drule) "apply rule in destruct manner (improper)" #>
|
wenzelm@30520
|
457 |
setup (Binding.name "frule") (xrule_meth frule) "apply rule in forward manner (improper)" #>
|
wenzelm@30520
|
458 |
setup (Binding.name "this") (Scan.succeed (K this)) "apply current facts as rules" #>
|
wenzelm@30520
|
459 |
setup (Binding.name "fact") (Attrib.thms >> fact) "composition by facts from context" #>
|
wenzelm@30520
|
460 |
setup (Binding.name "assumption") (Scan.succeed assumption)
|
wenzelm@30520
|
461 |
"proof by assumption, preferring facts" #>
|
wenzelm@30520
|
462 |
setup (Binding.name "rename_tac") (Args.goal_spec -- Scan.lift (Scan.repeat1 Args.name) >>
|
wenzelm@30520
|
463 |
(fn (quant, xs) => K (SIMPLE_METHOD'' quant (Tactic.rename_tac xs))))
|
wenzelm@30520
|
464 |
"rename parameters of goal" #>
|
wenzelm@30520
|
465 |
setup (Binding.name "rotate_tac") (Args.goal_spec -- Scan.lift (Scan.optional P.int 1) >>
|
wenzelm@30520
|
466 |
(fn (quant, i) => K (SIMPLE_METHOD'' quant (Tactic.rotate_tac i))))
|
wenzelm@30520
|
467 |
"rotate assumptions of goal" #>
|
wenzelm@30520
|
468 |
setup (Binding.name "tactic") (Scan.lift (P.position Args.name) >> tactic)
|
wenzelm@30520
|
469 |
"ML tactic as proof method" #>
|
wenzelm@30520
|
470 |
setup (Binding.name "raw_tactic") (Scan.lift (P.position Args.name) >> raw_tactic)
|
wenzelm@30520
|
471 |
"ML tactic as raw proof method"));
|
wenzelm@5824
|
472 |
|
wenzelm@5824
|
473 |
|
wenzelm@16145
|
474 |
(*final declarations of this structure!*)
|
wenzelm@16145
|
475 |
val unfold = unfold_meth;
|
wenzelm@16145
|
476 |
val fold = fold_meth;
|
wenzelm@16145
|
477 |
|
wenzelm@5824
|
478 |
end;
|
wenzelm@5824
|
479 |
|
wenzelm@5824
|
480 |
structure BasicMethod: BASIC_METHOD = Method;
|
wenzelm@5824
|
481 |
open BasicMethod;
|
wenzelm@30513
|
482 |
|
wenzelm@30513
|
483 |
val RAW_METHOD_CASES = Method.RAW_METHOD_CASES;
|
wenzelm@30513
|
484 |
val RAW_METHOD = Method.RAW_METHOD;
|
wenzelm@30513
|
485 |
val METHOD_CASES = Method.METHOD_CASES;
|
wenzelm@30513
|
486 |
val METHOD = Method.METHOD;
|
wenzelm@30513
|
487 |
val SIMPLE_METHOD = Method.SIMPLE_METHOD;
|
wenzelm@30513
|
488 |
val SIMPLE_METHOD' = Method.SIMPLE_METHOD';
|
wenzelm@30513
|
489 |
val SIMPLE_METHOD'' = Method.SIMPLE_METHOD'';
|
wenzelm@30513
|
490 |
|