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