author | wenzelm |
Sat, 17 Jun 2006 19:37:57 +0200 | |
changeset 19915 | b08e26fb247e |
parent 19900 | 21a99d88d925 |
child 19995 | 7f841a2b431c |
permissions | -rw-r--r-- |
5820 | 1 |
(* Title: Pure/Isar/proof.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
19000 | 5 |
The Isar/VM proof language interpreter: maintains a structured flow of |
6 |
context elements, goals, refinements, and facts. |
|
5820 | 7 |
*) |
8 |
||
9 |
signature PROOF = |
|
10 |
sig |
|
17756 | 11 |
type context (*= Context.proof*) |
12 |
type method (*= Method.method*) |
|
5820 | 13 |
type state |
17359 | 14 |
val init: context -> state |
15 |
val level: state -> int |
|
16 |
val assert_bottom: bool -> state -> state |
|
5820 | 17 |
val context_of: state -> context |
18 |
val theory_of: state -> theory |
|
16450 | 19 |
val sign_of: state -> theory (*obsolete*) |
13377 | 20 |
val map_context: (context -> context) -> state -> state |
17976 | 21 |
val add_binds_i: (indexname * term option) list -> state -> state |
19078 | 22 |
val put_thms: bool -> string * thm list option -> state -> state |
23 |
val put_thms_internal: string * thm list option -> state -> state |
|
6091 | 24 |
val the_facts: state -> thm list |
9469 | 25 |
val the_fact: state -> thm |
17450 | 26 |
val put_facts: thm list option -> state -> state |
6891 | 27 |
val assert_forward: state -> state |
17359 | 28 |
val assert_chain: state -> state |
9469 | 29 |
val assert_forward_or_chain: state -> state |
5820 | 30 |
val assert_backward: state -> state |
8206 | 31 |
val assert_no_chain: state -> state |
5820 | 32 |
val enter_forward: state -> state |
17359 | 33 |
val get_goal: state -> context * (thm list * thm) |
16539 | 34 |
val show_main_goal: bool ref |
6529 | 35 |
val verbose: bool ref |
12423 | 36 |
val pretty_state: int -> state -> Pretty.T list |
10360 | 37 |
val pretty_goals: bool -> state -> Pretty.T list |
17112 | 38 |
val refine: Method.text -> state -> state Seq.seq |
39 |
val refine_end: Method.text -> state -> state Seq.seq |
|
18908 | 40 |
val refine_insert: thm list -> state -> state |
17359 | 41 |
val refine_goals: (context -> thm -> unit) -> context -> thm list -> state -> state Seq.seq |
5936 | 42 |
val match_bind: (string list * string) list -> state -> state |
43 |
val match_bind_i: (term list * term) list -> state -> state |
|
8617
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
44 |
val let_bind: (string list * string) list -> state -> state |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
45 |
val let_bind_i: (term list * term) list -> state -> state |
19846 | 46 |
val fix: (string * string option * mixfix) list -> state -> state |
47 |
val fix_i: (string * typ option * mixfix) list -> state -> state |
|
18670 | 48 |
val assm: ProofContext.export -> |
19585 | 49 |
((string * Attrib.src list) * (string * string list) list) list -> state -> state |
18670 | 50 |
val assm_i: ProofContext.export -> |
19585 | 51 |
((string * attribute list) * (term * term list) list) list -> state -> state |
52 |
val assume: ((string * Attrib.src list) * (string * string list) list) list -> state -> state |
|
53 |
val assume_i: ((string * attribute list) * (term * term list) list) list -> state -> state |
|
54 |
val presume: ((string * Attrib.src list) * (string * string list) list) list -> state -> state |
|
55 |
val presume_i: ((string * attribute list) * (term * term list) list) list -> state -> state |
|
19846 | 56 |
val def: ((string * Attrib.src list) * |
57 |
((string * mixfix) * (string * string list))) list -> state -> state |
|
58 |
val def_i: ((string * attribute list) * |
|
59 |
((string * mixfix) * (term * term list))) list -> state -> state |
|
17359 | 60 |
val chain: state -> state |
61 |
val chain_facts: thm list -> state -> state |
|
62 |
val get_thmss: state -> (thmref * Attrib.src list) list -> thm list |
|
14564 | 63 |
val simple_note_thms: string -> thm list -> state -> state |
17359 | 64 |
val note_thmss: ((string * Attrib.src list) * |
17112 | 65 |
(thmref * Attrib.src list) list) list -> state -> state |
18728 | 66 |
val note_thmss_i: ((string * attribute list) * |
67 |
(thm list * attribute list) list) list -> state -> state |
|
17112 | 68 |
val from_thmss: ((thmref * Attrib.src list) list) list -> state -> state |
18728 | 69 |
val from_thmss_i: ((thm list * attribute list) list) list -> state -> state |
17112 | 70 |
val with_thmss: ((thmref * Attrib.src list) list) list -> state -> state |
18728 | 71 |
val with_thmss_i: ((thm list * attribute list) list) list -> state -> state |
18548 | 72 |
val using: ((thmref * Attrib.src list) list) list -> state -> state |
18728 | 73 |
val using_i: ((thm list * attribute list) list) list -> state -> state |
18548 | 74 |
val unfolding: ((thmref * Attrib.src list) list) list -> state -> state |
18728 | 75 |
val unfolding_i: ((thm list * attribute list) list) list -> state -> state |
17112 | 76 |
val invoke_case: string * string option list * Attrib.src list -> state -> state |
18728 | 77 |
val invoke_case_i: string * string option list * attribute list -> state -> state |
17359 | 78 |
val begin_block: state -> state |
79 |
val next_block: state -> state |
|
80 |
val end_block: state -> state Seq.seq |
|
17112 | 81 |
val proof: Method.text option -> state -> state Seq.seq |
82 |
val defer: int option -> state -> state Seq.seq |
|
83 |
val prefer: int -> state -> state Seq.seq |
|
84 |
val apply: Method.text -> state -> state Seq.seq |
|
85 |
val apply_end: Method.text -> state -> state Seq.seq |
|
17359 | 86 |
val goal_names: string option -> string -> string list -> string |
87 |
val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) -> |
|
18728 | 88 |
(theory -> 'a -> attribute) -> |
17359 | 89 |
(context * 'b list -> context * (term list list * (context -> context))) -> |
18124 | 90 |
string -> Method.text option -> (thm list list -> state -> state Seq.seq) -> |
17359 | 91 |
((string * 'a list) * 'b) list -> state -> state |
92 |
val local_qed: Method.text option * bool -> state -> state Seq.seq |
|
93 |
val global_goal: (context -> (string * string) * (string * thm list) list -> unit) -> |
|
18728 | 94 |
(theory -> 'a -> attribute) -> |
17450 | 95 |
(context * 'b list -> context * (term list list * (context -> context))) -> |
18124 | 96 |
string -> Method.text option -> (thm list list -> theory -> theory) -> |
17859 | 97 |
string option -> string * 'a list -> ((string * 'a list) * 'b) list -> context -> state |
18808 | 98 |
val global_qed: Method.text option * bool -> state -> context * theory |
17359 | 99 |
val local_terminal_proof: Method.text * Method.text option -> state -> state Seq.seq |
100 |
val local_default_proof: state -> state Seq.seq |
|
101 |
val local_immediate_proof: state -> state Seq.seq |
|
102 |
val local_done_proof: state -> state Seq.seq |
|
103 |
val local_skip_proof: bool -> state -> state Seq.seq |
|
18808 | 104 |
val global_terminal_proof: Method.text * Method.text option -> state -> context * theory |
105 |
val global_default_proof: state -> context * theory |
|
106 |
val global_immediate_proof: state -> context * theory |
|
107 |
val global_done_proof: state -> context * theory |
|
108 |
val global_skip_proof: bool -> state -> context * theory |
|
18124 | 109 |
val have: Method.text option -> (thm list list -> state -> state Seq.seq) -> |
19585 | 110 |
((string * Attrib.src list) * (string * string list) list) list -> bool -> state -> state |
18124 | 111 |
val have_i: Method.text option -> (thm list list -> state -> state Seq.seq) -> |
19585 | 112 |
((string * attribute list) * (term * term list) list) list -> bool -> state -> state |
18124 | 113 |
val show: Method.text option -> (thm list list -> state -> state Seq.seq) -> |
19585 | 114 |
((string * Attrib.src list) * (string * string list) list) list -> bool -> state -> state |
18124 | 115 |
val show_i: Method.text option -> (thm list list -> state -> state Seq.seq) -> |
19585 | 116 |
((string * attribute list) * (term * term list) list) list -> bool -> state -> state |
18124 | 117 |
val theorem: string -> Method.text option -> (thm list list -> theory -> theory) -> |
17359 | 118 |
string option -> string * Attrib.src list -> |
19585 | 119 |
((string * Attrib.src list) * (string * string list) list) list -> context -> state |
18124 | 120 |
val theorem_i: string -> Method.text option -> (thm list list -> theory -> theory) -> |
18728 | 121 |
string option -> string * attribute list -> |
19585 | 122 |
((string * attribute list) * (term * term list) list) list -> context -> state |
5820 | 123 |
end; |
124 |
||
13377 | 125 |
structure Proof: PROOF = |
5820 | 126 |
struct |
127 |
||
16813 | 128 |
type context = ProofContext.context; |
17112 | 129 |
type method = Method.method; |
16813 | 130 |
|
5820 | 131 |
|
132 |
(** proof state **) |
|
133 |
||
17359 | 134 |
(* datatype state *) |
5820 | 135 |
|
17112 | 136 |
datatype mode = Forward | Chain | Backward; |
5820 | 137 |
|
17359 | 138 |
datatype state = |
139 |
State of node Stack.T |
|
140 |
and node = |
|
7176 | 141 |
Node of |
142 |
{context: context, |
|
143 |
facts: thm list option, |
|
144 |
mode: mode, |
|
17359 | 145 |
goal: goal option} |
146 |
and goal = |
|
147 |
Goal of |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
148 |
{statement: string * term list list, (*goal kind and statement, starting with vars*) |
17359 | 149 |
using: thm list, (*goal facts*) |
150 |
goal: thm, (*subgoals ==> statement*) |
|
17859 | 151 |
before_qed: Method.text option, |
18124 | 152 |
after_qed: |
153 |
(thm list list -> state -> state Seq.seq) * |
|
154 |
(thm list list -> theory -> theory)}; |
|
17359 | 155 |
|
17859 | 156 |
fun make_goal (statement, using, goal, before_qed, after_qed) = |
157 |
Goal {statement = statement, using = using, goal = goal, |
|
158 |
before_qed = before_qed, after_qed = after_qed}; |
|
5820 | 159 |
|
7176 | 160 |
fun make_node (context, facts, mode, goal) = |
161 |
Node {context = context, facts = facts, mode = mode, goal = goal}; |
|
162 |
||
17359 | 163 |
fun map_node f (Node {context, facts, mode, goal}) = |
164 |
make_node (f (context, facts, mode, goal)); |
|
5820 | 165 |
|
17359 | 166 |
fun init ctxt = State (Stack.init (make_node (ctxt, NONE, Forward, NONE))); |
5820 | 167 |
|
17359 | 168 |
fun current (State st) = Stack.top st |> (fn Node node => node); |
169 |
fun map_current f (State st) = State (Stack.map (map_node f) st); |
|
12045 | 170 |
|
5820 | 171 |
|
172 |
||
173 |
(** basic proof state operations **) |
|
174 |
||
17359 | 175 |
(* block structure *) |
176 |
||
177 |
fun open_block (State st) = State (Stack.push st); |
|
178 |
||
18678 | 179 |
fun close_block (State st) = State (Stack.pop st) |
180 |
handle Empty => error "Unbalanced block parentheses"; |
|
17359 | 181 |
|
182 |
fun level (State st) = Stack.level st; |
|
183 |
||
184 |
fun assert_bottom b state = |
|
185 |
let val b' = (level state <= 2) in |
|
18678 | 186 |
if b andalso not b' then error "Not at bottom of proof!" |
187 |
else if not b andalso b' then error "Already at bottom of proof!" |
|
17359 | 188 |
else state |
189 |
end; |
|
190 |
||
191 |
||
5820 | 192 |
(* context *) |
193 |
||
17359 | 194 |
val context_of = #context o current; |
5820 | 195 |
val theory_of = ProofContext.theory_of o context_of; |
16450 | 196 |
val sign_of = theory_of; |
5820 | 197 |
|
17359 | 198 |
fun map_context f = |
199 |
map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); |
|
5820 | 200 |
|
17359 | 201 |
fun map_context_result f state = |
17859 | 202 |
f (context_of state) ||> (fn ctxt => map_context (K ctxt) state); |
5820 | 203 |
|
10809 | 204 |
val add_binds_i = map_context o ProofContext.add_binds_i; |
19078 | 205 |
val put_thms = map_context oo ProofContext.put_thms; |
206 |
val put_thms_internal = map_context o ProofContext.put_thms_internal; |
|
5820 | 207 |
|
208 |
||
209 |
(* facts *) |
|
210 |
||
17359 | 211 |
val get_facts = #facts o current; |
212 |
||
213 |
fun the_facts state = |
|
214 |
(case get_facts state of SOME facts => facts |
|
18678 | 215 |
| NONE => error "No current facts available"); |
5820 | 216 |
|
9469 | 217 |
fun the_fact state = |
17359 | 218 |
(case the_facts state of [thm] => thm |
18678 | 219 |
| _ => error "Single theorem expected"); |
7605 | 220 |
|
17359 | 221 |
fun put_facts facts = |
19078 | 222 |
map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #> |
223 |
put_thms_internal (AutoBind.thisN, facts); |
|
5820 | 224 |
|
17359 | 225 |
fun these_factss more_facts (named_factss, state) = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
226 |
(named_factss, state |> put_facts (SOME (maps snd named_factss @ more_facts))); |
5820 | 227 |
|
17359 | 228 |
fun export_facts inner outer = |
229 |
(case get_facts inner of |
|
230 |
NONE => Seq.single (put_facts NONE outer) |
|
231 |
| SOME thms => |
|
232 |
thms |
|
19915 | 233 |
|> ProofContext.exports (context_of inner) (context_of outer) |
17359 | 234 |
|> Seq.map (fn ths => put_facts (SOME ths) outer)); |
5820 | 235 |
|
236 |
||
237 |
(* mode *) |
|
238 |
||
17359 | 239 |
val get_mode = #mode o current; |
5820 | 240 |
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal)); |
241 |
||
17359 | 242 |
val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove"); |
5820 | 243 |
|
244 |
fun assert_mode pred state = |
|
245 |
let val mode = get_mode state in |
|
246 |
if pred mode then state |
|
18678 | 247 |
else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode") |
5820 | 248 |
end; |
249 |
||
19308 | 250 |
val assert_forward = assert_mode (fn mode => mode = Forward); |
251 |
val assert_chain = assert_mode (fn mode => mode = Chain); |
|
252 |
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain); |
|
253 |
val assert_backward = assert_mode (fn mode => mode = Backward); |
|
254 |
val assert_no_chain = assert_mode (fn mode => mode <> Chain); |
|
5820 | 255 |
|
17359 | 256 |
val enter_forward = put_mode Forward; |
257 |
val enter_chain = put_mode Chain; |
|
258 |
val enter_backward = put_mode Backward; |
|
5820 | 259 |
|
17359 | 260 |
|
261 |
(* current goal *) |
|
262 |
||
263 |
fun current_goal state = |
|
264 |
(case current state of |
|
265 |
{context, goal = SOME (Goal goal), ...} => (context, goal) |
|
18678 | 266 |
| _ => error "No current goal!"); |
5820 | 267 |
|
17359 | 268 |
fun assert_current_goal g state = |
269 |
let val g' = can current_goal state in |
|
18678 | 270 |
if g andalso not g' then error "No goal in this block!" |
271 |
else if not g andalso g' then error "Goal present in this block!" |
|
17359 | 272 |
else state |
273 |
end; |
|
6776 | 274 |
|
17359 | 275 |
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal)); |
276 |
||
17859 | 277 |
val before_qed = #before_qed o #2 o current_goal; |
278 |
||
17359 | 279 |
|
280 |
(* nested goal *) |
|
5820 | 281 |
|
17359 | 282 |
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) = |
283 |
let |
|
17859 | 284 |
val Goal {statement, using, goal, before_qed, after_qed} = goal; |
285 |
val goal' = make_goal (g (statement, using, goal, before_qed, after_qed)); |
|
17359 | 286 |
in State (make_node (f context, facts, mode, SOME goal'), nodes) end |
287 |
| map_goal f g (State (nd, node :: nodes)) = |
|
288 |
let val State (node', nodes') = map_goal f g (State (node, nodes)) |
|
289 |
in map_context f (State (nd, node' :: nodes')) end |
|
290 |
| map_goal _ _ state = state; |
|
5820 | 291 |
|
19188 | 292 |
fun set_goal goal = map_goal I (fn (statement, using, _, before_qed, after_qed) => |
293 |
(statement, using, goal, before_qed, after_qed)); |
|
294 |
||
17859 | 295 |
fun using_facts using = map_goal I (fn (statement, _, goal, before_qed, after_qed) => |
296 |
(statement, using, goal, before_qed, after_qed)); |
|
17359 | 297 |
|
298 |
local |
|
299 |
fun find i state = |
|
300 |
(case try current_goal state of |
|
301 |
SOME (ctxt, goal) => (ctxt, (i, goal)) |
|
18678 | 302 |
| NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present")); |
17359 | 303 |
in val find_goal = find 0 end; |
304 |
||
305 |
fun get_goal state = |
|
306 |
let val (ctxt, (_, {using, goal, ...})) = find_goal state |
|
307 |
in (ctxt, (using, goal)) end; |
|
5820 | 308 |
|
309 |
||
310 |
||
12423 | 311 |
(** pretty_state **) |
5820 | 312 |
|
13869 | 313 |
val show_main_goal = ref false; |
16539 | 314 |
val verbose = ProofContext.verbose; |
13698 | 315 |
|
14876 | 316 |
val pretty_goals_local = Display.pretty_goals_aux o ProofContext.pp; |
12085 | 317 |
|
15531 | 318 |
fun pretty_facts _ _ NONE = [] |
319 |
| pretty_facts s ctxt (SOME ths) = |
|
12055 | 320 |
[Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""]; |
6756 | 321 |
|
17359 | 322 |
fun pretty_state nr state = |
5820 | 323 |
let |
17359 | 324 |
val {context, facts, mode, goal = _} = current state; |
325 |
val ref (_, _, bg) = Display.current_goals_markers; |
|
5820 | 326 |
|
327 |
fun levels_up 0 = "" |
|
17359 | 328 |
| levels_up 1 = "1 level up" |
329 |
| levels_up i = string_of_int i ^ " levels up"; |
|
5820 | 330 |
|
11556 | 331 |
fun subgoals 0 = "" |
17359 | 332 |
| subgoals 1 = "1 subgoal" |
333 |
| subgoals n = string_of_int n ^ " subgoals"; |
|
334 |
||
335 |
fun description strs = |
|
336 |
(case filter_out (equal "") strs of [] => "" |
|
337 |
| strs' => enclose " (" ")" (commas strs')); |
|
12146 | 338 |
|
17859 | 339 |
fun prt_goal (SOME (ctxt, (i, {statement = (kind, _), using, goal, before_qed, after_qed}))) = |
17359 | 340 |
pretty_facts "using " ctxt |
341 |
(if mode <> Backward orelse null using then NONE else SOME using) @ |
|
342 |
[Pretty.str ("goal" ^ description [kind, levels_up (i div 2), |
|
343 |
subgoals (Thm.nprems_of goal)] ^ ":")] @ |
|
344 |
pretty_goals_local ctxt bg (true, ! show_main_goal) (! Display.goals_limit) goal |
|
345 |
| prt_goal NONE = []; |
|
6848 | 346 |
|
17359 | 347 |
val prt_ctxt = |
348 |
if ! verbose orelse mode = Forward then ProofContext.pretty_context context |
|
18670 | 349 |
else if mode = Backward then ProofContext.pretty_ctxt context |
7575 | 350 |
else []; |
17359 | 351 |
in |
352 |
[Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^ |
|
353 |
(if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")), |
|
354 |
Pretty.str ""] @ |
|
355 |
(if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @ |
|
356 |
(if ! verbose orelse mode = Forward then |
|
357 |
pretty_facts "" context facts @ prt_goal (try find_goal state) |
|
358 |
else if mode = Chain then pretty_facts "picking " context facts |
|
359 |
else prt_goal (try find_goal state)) |
|
360 |
end; |
|
5820 | 361 |
|
12085 | 362 |
fun pretty_goals main state = |
19188 | 363 |
let val (ctxt, (_, goal)) = get_goal state |
17359 | 364 |
in pretty_goals_local ctxt "" (false, main) (! Display.goals_limit) goal end; |
10320 | 365 |
|
5820 | 366 |
|
367 |
||
368 |
(** proof steps **) |
|
369 |
||
17359 | 370 |
(* refine via method *) |
5820 | 371 |
|
8234 | 372 |
local |
373 |
||
16146 | 374 |
fun goalN i = "goal" ^ string_of_int i; |
375 |
fun goals st = map goalN (1 upto Thm.nprems_of st); |
|
376 |
||
377 |
fun no_goal_cases st = map (rpair NONE) (goals st); |
|
378 |
||
379 |
fun goal_cases st = |
|
18607 | 380 |
RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st)); |
16146 | 381 |
|
16450 | 382 |
fun check_theory thy state = |
383 |
if subthy (thy, theory_of state) then state |
|
18678 | 384 |
else error ("Bad theory of method result: " ^ Context.str_of_thy thy); |
5820 | 385 |
|
17112 | 386 |
fun apply_method current_context meth_fun state = |
6848 | 387 |
let |
17859 | 388 |
val (goal_ctxt, (_, {statement, using, goal, before_qed, after_qed})) = find_goal state; |
17112 | 389 |
val meth = meth_fun (if current_context then context_of state else goal_ctxt); |
16146 | 390 |
in |
18228 | 391 |
Method.apply meth using goal |> Seq.map (fn (meth_cases, goal') => |
6848 | 392 |
state |
17359 | 393 |
|> check_theory (Thm.theory_of_thm goal') |
16146 | 394 |
|> map_goal |
18475 | 395 |
(ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #> |
396 |
ProofContext.add_cases true meth_cases) |
|
17859 | 397 |
(K (statement, using, goal', before_qed, after_qed))) |
16146 | 398 |
end; |
5820 | 399 |
|
19188 | 400 |
fun select_goals n meth state = |
19224 | 401 |
state |
402 |
|> (#2 o #2 o get_goal) |
|
403 |
|> ALLGOALS Tactic.conjunction_tac |
|
404 |
|> Seq.maps (fn goal => |
|
19188 | 405 |
state |
19224 | 406 |
|> Seq.lift set_goal (Goal.extract 1 n goal |> Seq.maps (Tactic.conjunction_tac 1)) |
19188 | 407 |
|> Seq.maps meth |
408 |
|> Seq.maps (fn state' => state' |
|
409 |
|> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal)) |
|
19224 | 410 |
|> Seq.maps (apply_method true (K Method.succeed))); |
19188 | 411 |
|
17112 | 412 |
fun apply_text cc text state = |
413 |
let |
|
414 |
val thy = theory_of state; |
|
415 |
||
416 |
fun eval (Method.Basic m) = apply_method cc m |
|
417 |
| eval (Method.Source src) = apply_method cc (Method.method thy src) |
|
418 |
| eval (Method.Then txts) = Seq.EVERY (map eval txts) |
|
419 |
| eval (Method.Orelse txts) = Seq.FIRST (map eval txts) |
|
420 |
| eval (Method.Try txt) = Seq.TRY (eval txt) |
|
19188 | 421 |
| eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt) |
422 |
| eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt); |
|
17112 | 423 |
in eval text state end; |
424 |
||
8234 | 425 |
in |
426 |
||
17112 | 427 |
val refine = apply_text true; |
428 |
val refine_end = apply_text false; |
|
8234 | 429 |
|
18908 | 430 |
fun refine_insert [] = I |
431 |
| refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths))); |
|
432 |
||
8234 | 433 |
end; |
434 |
||
5820 | 435 |
|
17359 | 436 |
(* refine via sub-proof *) |
437 |
||
438 |
local |
|
9469 | 439 |
|
11816 | 440 |
fun refine_tac rule = |
18186 | 441 |
Tactic.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW |
442 |
(Tactic.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) => |
|
443 |
if can Logic.unprotect (Logic.strip_assums_concl goal) then |
|
444 |
Tactic.etac Drule.protectI i |
|
445 |
else all_tac))); |
|
11816 | 446 |
|
17359 | 447 |
in |
12146 | 448 |
|
19915 | 449 |
fun refine_goals print_rule inner raw_rules state = |
450 |
let |
|
451 |
val (outer, (_, goal)) = get_goal state; |
|
452 |
fun refine rule st = (print_rule outer rule; FINDGOAL (refine_tac rule) st); |
|
453 |
in |
|
454 |
raw_rules |
|
455 |
|> ProofContext.goal_exports inner outer |
|
456 |
|> Seq.maps (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state) |
|
457 |
end; |
|
17359 | 458 |
|
459 |
end; |
|
6932 | 460 |
|
461 |
||
17359 | 462 |
(* conclude_goal *) |
6932 | 463 |
|
18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset
|
464 |
fun conclude_goal state goal propss = |
5820 | 465 |
let |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
466 |
val thy = theory_of state; |
5820 | 467 |
val ctxt = context_of state; |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
468 |
val string_of_term = ProofContext.string_of_term ctxt; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
469 |
val string_of_thm = ProofContext.string_of_thm ctxt; |
5820 | 470 |
|
17359 | 471 |
val ngoals = Thm.nprems_of goal; |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
472 |
val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks |
17359 | 473 |
(pretty_goals_local ctxt "" (true, ! show_main_goal) (! Display.goals_limit) goal @ |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
474 |
[Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")]))); |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
475 |
val _ = |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
476 |
(case subtract (op aconv) (ProofContext.assms_of ctxt) (#hyps (Thm.rep_thm goal)) of |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
477 |
[] => () |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
478 |
| hyps => error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term hyps))); |
5820 | 479 |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
480 |
val (results, th) = `(Conjunction.elim_precise (map length propss)) (Goal.conclude goal) |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
481 |
handle THM _ => error ("Lost goal structure:\n" ^ string_of_thm goal); |
19862 | 482 |
val _ = Unify.matches_list thy (flat propss) (map Thm.prop_of (flat results)) orelse |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
483 |
error ("Proved a different theorem:\n" ^ string_of_thm th); |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
484 |
in results end; |
5820 | 485 |
|
486 |
||
487 |
||
488 |
(*** structured proof commands ***) |
|
489 |
||
17112 | 490 |
(** context elements **) |
5820 | 491 |
|
17112 | 492 |
(* bindings *) |
5820 | 493 |
|
16813 | 494 |
local |
495 |
||
17359 | 496 |
fun gen_bind bind args state = |
5820 | 497 |
state |
498 |
|> assert_forward |
|
18308 | 499 |
|> map_context (bind args #> snd) |
17359 | 500 |
|> put_facts NONE; |
5820 | 501 |
|
16813 | 502 |
in |
503 |
||
8617
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
504 |
val match_bind = gen_bind (ProofContext.match_bind false); |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
505 |
val match_bind_i = gen_bind (ProofContext.match_bind_i false); |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
506 |
val let_bind = gen_bind (ProofContext.match_bind true); |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
507 |
val let_bind_i = gen_bind (ProofContext.match_bind_i true); |
5820 | 508 |
|
16813 | 509 |
end; |
510 |
||
5820 | 511 |
|
17359 | 512 |
(* fix *) |
9196 | 513 |
|
12714 | 514 |
local |
515 |
||
18670 | 516 |
fun gen_fix add_fixes args = |
17359 | 517 |
assert_forward |
19846 | 518 |
#> map_context (snd o add_fixes args) |
17359 | 519 |
#> put_facts NONE; |
5820 | 520 |
|
16813 | 521 |
in |
522 |
||
18670 | 523 |
val fix = gen_fix ProofContext.add_fixes; |
524 |
val fix_i = gen_fix ProofContext.add_fixes_i; |
|
5820 | 525 |
|
16813 | 526 |
end; |
527 |
||
5820 | 528 |
|
17359 | 529 |
(* assume etc. *) |
5820 | 530 |
|
16813 | 531 |
local |
532 |
||
17112 | 533 |
fun gen_assume asm prep_att exp args state = |
5820 | 534 |
state |
535 |
|> assert_forward |
|
17112 | 536 |
|> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args)) |
17359 | 537 |
|> these_factss [] |> #2; |
6932 | 538 |
|
16813 | 539 |
in |
540 |
||
18728 | 541 |
val assm = gen_assume ProofContext.add_assms Attrib.attribute; |
18670 | 542 |
val assm_i = gen_assume ProofContext.add_assms_i (K I); |
543 |
val assume = assm ProofContext.assume_export; |
|
544 |
val assume_i = assm_i ProofContext.assume_export; |
|
545 |
val presume = assm ProofContext.presume_export; |
|
546 |
val presume_i = assm_i ProofContext.presume_export; |
|
5820 | 547 |
|
16813 | 548 |
end; |
549 |
||
7271 | 550 |
|
17359 | 551 |
(* def *) |
11891 | 552 |
|
16813 | 553 |
local |
554 |
||
19846 | 555 |
fun gen_def gen_fix prep_att prep_binds args state = |
11891 | 556 |
let |
557 |
val _ = assert_forward state; |
|
17112 | 558 |
val thy = theory_of state; |
11891 | 559 |
|
19846 | 560 |
val ((raw_names, raw_atts), (vars, raw_rhss)) = |
561 |
args |> split_list |>> split_list ||> split_list; |
|
562 |
val xs = map #1 vars; |
|
18308 | 563 |
val names = map (fn ("", x) => Thm.def_name x | (name, _) => name) (raw_names ~~ xs); |
564 |
val atts = map (map (prep_att thy)) raw_atts; |
|
565 |
val (rhss, state') = state |> map_context_result (prep_binds false (map swap raw_rhss)); |
|
18826 | 566 |
val eqs = LocalDefs.mk_def (context_of state') (xs ~~ rhss); |
11891 | 567 |
in |
18308 | 568 |
state' |
19846 | 569 |
|> gen_fix (map (fn (x, mx) => (x, NONE, mx)) vars) |
19585 | 570 |
|> assm_i LocalDefs.def_export ((names ~~ atts) ~~ map (fn eq => [(eq, [])]) eqs) |
11891 | 571 |
end; |
572 |
||
16813 | 573 |
in |
574 |
||
18728 | 575 |
val def = gen_def fix Attrib.attribute ProofContext.match_bind; |
18308 | 576 |
val def_i = gen_def fix_i (K I) ProofContext.match_bind_i; |
11891 | 577 |
|
16813 | 578 |
end; |
579 |
||
11891 | 580 |
|
8374 | 581 |
|
17112 | 582 |
(** facts **) |
5820 | 583 |
|
17359 | 584 |
(* chain *) |
5820 | 585 |
|
17359 | 586 |
val chain = |
587 |
assert_forward |
|
588 |
#> tap the_facts |
|
589 |
#> enter_chain; |
|
5820 | 590 |
|
17359 | 591 |
fun chain_facts facts = |
592 |
put_facts (SOME facts) |
|
593 |
#> chain; |
|
5820 | 594 |
|
595 |
||
17359 | 596 |
(* note etc. *) |
17112 | 597 |
|
17166 | 598 |
fun no_binding args = map (pair ("", [])) args; |
17112 | 599 |
|
600 |
local |
|
601 |
||
17359 | 602 |
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state = |
17112 | 603 |
state |
604 |
|> assert_forward |
|
605 |
|> map_context_result (note_ctxt (Attrib.map_facts (prep_atts (theory_of state)) args)) |
|
606 |
|> these_factss (more_facts state) |
|
17359 | 607 |
||> opt_chain |
608 |
|> opt_result; |
|
17112 | 609 |
|
610 |
in |
|
611 |
||
18728 | 612 |
val note_thmss = gen_thmss ProofContext.note_thmss (K []) I #2 Attrib.attribute; |
17359 | 613 |
val note_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) I #2 (K I); |
17112 | 614 |
|
615 |
val from_thmss = |
|
18728 | 616 |
gen_thmss ProofContext.note_thmss (K []) chain #2 Attrib.attribute o no_binding; |
17359 | 617 |
val from_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) chain #2 (K I) o no_binding; |
17112 | 618 |
|
619 |
val with_thmss = |
|
18728 | 620 |
gen_thmss ProofContext.note_thmss the_facts chain #2 Attrib.attribute o no_binding; |
17359 | 621 |
val with_thmss_i = gen_thmss ProofContext.note_thmss_i the_facts chain #2 (K I) o no_binding; |
622 |
||
18808 | 623 |
val local_results = |
624 |
gen_thmss ProofContext.note_thmss_i (K []) I I (K I) o map (apsnd Thm.simple_fact); |
|
625 |
fun global_results kind = PureThy.note_thmss_i kind o map (apsnd Thm.simple_fact); |
|
17359 | 626 |
|
627 |
fun get_thmss state srcs = the_facts (note_thmss [(("", []), srcs)] state); |
|
628 |
fun simple_note_thms name thms = note_thmss_i [((name, []), [(thms, [])])]; |
|
17112 | 629 |
|
630 |
end; |
|
631 |
||
632 |
||
18548 | 633 |
(* using/unfolding *) |
17112 | 634 |
|
635 |
local |
|
636 |
||
18548 | 637 |
fun gen_using f g note prep_atts args state = |
17112 | 638 |
state |
639 |
|> assert_backward |
|
17166 | 640 |
|> map_context_result (note (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args))) |
18843 | 641 |
|> (fn (named_facts, state') => |
642 |
state' |> map_goal I (fn (statement, using, goal, before_qed, after_qed) => |
|
643 |
let |
|
644 |
val ctxt = context_of state'; |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
645 |
val ths = maps snd named_facts; |
18843 | 646 |
in (statement, f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end)); |
18548 | 647 |
|
18843 | 648 |
fun append_using _ ths using = using @ ths; |
18878 | 649 |
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths); |
650 |
val unfold_goals = LocalDefs.unfold_goals; |
|
17112 | 651 |
|
652 |
in |
|
653 |
||
18843 | 654 |
val using = gen_using append_using (K (K I)) ProofContext.note_thmss Attrib.attribute; |
655 |
val using_i = gen_using append_using (K (K I)) ProofContext.note_thmss_i (K I); |
|
18826 | 656 |
val unfolding = gen_using unfold_using unfold_goals ProofContext.note_thmss Attrib.attribute; |
657 |
val unfolding_i = gen_using unfold_using unfold_goals ProofContext.note_thmss_i (K I); |
|
17112 | 658 |
|
659 |
end; |
|
660 |
||
661 |
||
662 |
(* case *) |
|
663 |
||
664 |
local |
|
665 |
||
666 |
fun gen_invoke_case prep_att (name, xs, raw_atts) state = |
|
667 |
let |
|
668 |
val atts = map (prep_att (theory_of state)) raw_atts; |
|
19078 | 669 |
val (asms, state') = state |> map_context_result (fn ctxt => |
670 |
ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs)); |
|
19585 | 671 |
val assumptions = asms |> map (fn (a, ts) => ((a, atts), map (rpair []) ts)); |
17112 | 672 |
in |
673 |
state' |
|
17359 | 674 |
|> map_context (ProofContext.qualified_names #> ProofContext.no_base_names) |
17112 | 675 |
|> assume_i assumptions |
17976 | 676 |
|> add_binds_i AutoBind.no_facts |
17112 | 677 |
|> map_context (ProofContext.restore_naming (context_of state)) |
678 |
|> `the_facts |-> simple_note_thms name |
|
679 |
end; |
|
680 |
||
681 |
in |
|
682 |
||
18728 | 683 |
val invoke_case = gen_invoke_case Attrib.attribute; |
17112 | 684 |
val invoke_case_i = gen_invoke_case (K I); |
685 |
||
686 |
end; |
|
687 |
||
688 |
||
689 |
||
17359 | 690 |
(** proof structure **) |
691 |
||
692 |
(* blocks *) |
|
693 |
||
694 |
val begin_block = |
|
695 |
assert_forward |
|
696 |
#> open_block |
|
697 |
#> put_goal NONE |
|
698 |
#> open_block; |
|
699 |
||
700 |
val next_block = |
|
701 |
assert_forward |
|
702 |
#> close_block |
|
703 |
#> open_block |
|
704 |
#> put_goal NONE |
|
705 |
#> put_facts NONE; |
|
706 |
||
707 |
fun end_block state = |
|
708 |
state |
|
709 |
|> assert_forward |
|
710 |
|> close_block |
|
711 |
|> assert_current_goal false |
|
712 |
|> close_block |
|
713 |
|> export_facts state; |
|
714 |
||
715 |
||
716 |
(* sub-proofs *) |
|
717 |
||
718 |
fun proof opt_text = |
|
719 |
assert_backward |
|
17859 | 720 |
#> refine (the_default Method.default_text opt_text) |
17359 | 721 |
#> Seq.map (using_facts [] #> enter_forward); |
722 |
||
723 |
fun end_proof bot txt = |
|
724 |
assert_forward |
|
725 |
#> assert_bottom bot |
|
726 |
#> close_block |
|
727 |
#> assert_current_goal true |
|
728 |
#> using_facts [] |
|
17859 | 729 |
#> `before_qed #-> (refine o the_default Method.succeed_text) |
730 |
#> Seq.maps (refine (Method.finish_text txt)); |
|
17359 | 731 |
|
732 |
||
733 |
(* unstructured refinement *) |
|
734 |
||
735 |
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i))); |
|
736 |
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i))); |
|
737 |
||
738 |
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []); |
|
739 |
fun apply_end text = assert_forward #> refine_end text; |
|
740 |
||
741 |
||
742 |
||
17112 | 743 |
(** goals **) |
744 |
||
17359 | 745 |
(* goal names *) |
746 |
||
747 |
fun prep_names prep_att stmt = |
|
748 |
let |
|
749 |
val (names_attss, propp) = split_list (Attrib.map_specs prep_att stmt); |
|
750 |
val (names, attss) = split_list names_attss; |
|
751 |
in ((names, attss), propp) end; |
|
5820 | 752 |
|
17359 | 753 |
fun goal_names target name names = |
17450 | 754 |
(case target of NONE => "" | SOME "" => "" | SOME loc => " (in " ^ loc ^ ")") ^ |
17359 | 755 |
(if name = "" then "" else " " ^ name) ^ |
756 |
(case filter_out (equal "") names of [] => "" |
|
757 |
| nms => " " ^ enclose "(" ")" (space_implode " and " (Library.take (7, nms) @ |
|
758 |
(if length nms > 7 then ["..."] else [])))); |
|
759 |
||
16813 | 760 |
|
17359 | 761 |
(* generic goals *) |
762 |
||
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
763 |
local |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
764 |
|
19846 | 765 |
fun implicit_vars dest add props = |
766 |
let |
|
767 |
val (explicit_vars, props') = take_prefix (can dest) props |>> map dest; |
|
768 |
val vars = rev (subtract (op =) explicit_vars (fold add props [])); |
|
769 |
val _ = |
|
770 |
if null vars then () |
|
771 |
else warning ("Goal statement contains unbound schematic variable(s): " ^ |
|
772 |
commas_quote (map (Term.string_of_vname o fst) vars)); |
|
773 |
in (rev vars, props') end; |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
774 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
775 |
fun refine_terms n = |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
776 |
refine (Method.Basic (K (Method.RAW_METHOD |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
777 |
(K (HEADGOAL (PRECISE_CONJUNCTS n |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
778 |
(HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI)))))))))) |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
779 |
#> Seq.hd; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
780 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
781 |
in |
17359 | 782 |
|
17859 | 783 |
fun generic_goal prepp kind before_qed after_qed raw_propp state = |
5820 | 784 |
let |
17359 | 785 |
val thy = theory_of state; |
786 |
val chaining = can assert_chain state; |
|
787 |
||
788 |
val ((propss, after_ctxt), goal_state) = |
|
5936 | 789 |
state |
790 |
|> assert_forward_or_chain |
|
791 |
|> enter_forward |
|
17359 | 792 |
|> open_block |
17859 | 793 |
|> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp))); |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
794 |
val props = flat propss; |
15703 | 795 |
|
19846 | 796 |
val (_, props') = |
797 |
implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props; |
|
798 |
val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props'; |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
799 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
800 |
val propss' = map (Logic.mk_term o Var) vars :: propss; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
801 |
val goal = Goal.init (Thm.cterm_of thy (Logic.mk_conjunction_list2 propss')); |
18124 | 802 |
val after_qed' = after_qed |>> (fn after_local => |
803 |
fn results => map_context after_ctxt #> after_local results); |
|
5820 | 804 |
in |
17359 | 805 |
goal_state |
19900
21a99d88d925
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19862
diff
changeset
|
806 |
|> map_context (Variable.set_body true) |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
807 |
|> put_goal (SOME (make_goal ((kind, propss'), [], goal, before_qed, after_qed'))) |
18475 | 808 |
|> map_context (ProofContext.add_cases false (AutoBind.cases thy props)) |
17359 | 809 |
|> map_context (ProofContext.auto_bind_goal props) |
810 |
|> K chaining ? (`the_facts #-> using_facts) |
|
811 |
|> put_facts NONE |
|
812 |
|> open_block |
|
813 |
|> put_goal NONE |
|
5820 | 814 |
|> enter_backward |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
815 |
|> K (not (null vars)) ? refine_terms (length propss') |
17450 | 816 |
|> K (null props) ? (refine (Method.Basic Method.assumption) #> Seq.hd) |
5820 | 817 |
end; |
818 |
||
17359 | 819 |
fun generic_qed state = |
12503 | 820 |
let |
18548 | 821 |
val (goal_ctxt, {statement = (_, stmt), using = _, goal, before_qed = _, after_qed}) = |
17859 | 822 |
current_goal state; |
8617
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
823 |
val outer_state = state |> close_block; |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
824 |
val outer_ctxt = context_of outer_state; |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
825 |
|
18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset
|
826 |
val props = |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
827 |
flat (tl stmt) |
19915 | 828 |
|> Variable.exportT_terms goal_ctxt outer_ctxt; |
17359 | 829 |
val results = |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
830 |
tl (conclude_goal state goal stmt) |
19915 | 831 |
|> Seq.map_list (ProofContext.exports goal_ctxt outer_ctxt); |
17359 | 832 |
in |
833 |
outer_state |
|
834 |
|> map_context (ProofContext.auto_bind_facts props) |
|
18124 | 835 |
|> pair (after_qed, results) |
17359 | 836 |
end; |
837 |
||
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
838 |
end; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
839 |
|
9469 | 840 |
|
17359 | 841 |
(* local goals *) |
842 |
||
17859 | 843 |
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state = |
17359 | 844 |
let |
845 |
val ((names, attss), propp) = prep_names (prep_att (theory_of state)) stmt; |
|
846 |
||
18124 | 847 |
fun after_qed' results = |
18808 | 848 |
local_results ((names ~~ attss) ~~ results) |
17359 | 849 |
#-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit)) |
18124 | 850 |
#> after_qed results; |
5820 | 851 |
in |
17359 | 852 |
state |
18124 | 853 |
|> generic_goal prepp (kind ^ goal_names NONE "" names) before_qed (after_qed', K I) propp |
19900
21a99d88d925
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19862
diff
changeset
|
854 |
|> tap (Variable.warn_extra_tfrees (context_of state) o context_of) |
5820 | 855 |
end; |
856 |
||
17359 | 857 |
fun local_qed txt = |
858 |
end_proof false txt |
|
859 |
#> Seq.map generic_qed |
|
18124 | 860 |
#> Seq.maps (uncurry (fn ((after_qed, _), results) => Seq.lifts after_qed results)); |
5820 | 861 |
|
862 |
||
17359 | 863 |
(* global goals *) |
864 |
||
865 |
fun global_goal print_results prep_att prepp |
|
17859 | 866 |
kind before_qed after_qed target (name, raw_atts) stmt ctxt = |
17359 | 867 |
let |
868 |
val thy = ProofContext.theory_of ctxt; |
|
869 |
val thy_ctxt = ProofContext.init thy; |
|
870 |
||
871 |
val atts = map (prep_att thy) raw_atts; |
|
872 |
val ((names, attss), propp) = prep_names (prep_att thy) stmt; |
|
873 |
||
17450 | 874 |
fun store_results prfx res = |
875 |
K (prfx <> "") ? (Sign.add_path prfx #> Sign.no_base_names) |
|
876 |
#> global_results kind ((names ~~ attss) ~~ res) |
|
17359 | 877 |
#-> (fn res' => |
878 |
(print_results thy_ctxt ((kind, name), res') : unit; |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
879 |
#2 o global_results kind [((name, atts), maps #2 res')])) |
17450 | 880 |
#> Sign.restore_naming thy; |
17359 | 881 |
|
18124 | 882 |
fun after_qed' results = |
17450 | 883 |
(case target of NONE => I |
884 |
| SOME prfx => store_results (NameSpace.base prfx) |
|
19915 | 885 |
(map (ProofContext.export_standard ctxt thy_ctxt |
886 |
#> map Drule.strip_shyps_warning) results)) |
|
18124 | 887 |
#> after_qed results; |
17359 | 888 |
in |
889 |
init ctxt |
|
18670 | 890 |
|> generic_goal (prepp #> ProofContext.auto_fixes) (kind ^ goal_names target name names) |
18124 | 891 |
before_qed (K Seq.single, after_qed') propp |
17359 | 892 |
end; |
12065 | 893 |
|
18678 | 894 |
fun check_result msg sq = |
17112 | 895 |
(case Seq.pull sq of |
18678 | 896 |
NONE => error msg |
19475 | 897 |
| SOME (s', sq') => Seq.cons s' sq'); |
17112 | 898 |
|
17359 | 899 |
fun global_qeds txt = |
900 |
end_proof true txt |
|
901 |
#> Seq.map generic_qed |
|
18124 | 902 |
#> Seq.maps (fn (((_, after_qed), results), state) => |
903 |
Seq.lift after_qed results (theory_of state) |
|
19100 | 904 |
|> Seq.map (fn thy => (ProofContext.transfer thy (context_of state), thy))) |
17112 | 905 |
|> Seq.DETERM; (*backtracking may destroy theory!*) |
906 |
||
18678 | 907 |
fun global_qed txt = |
908 |
global_qeds txt |
|
909 |
#> check_result "Failed to finish proof" |
|
910 |
#> Seq.hd; |
|
12959 | 911 |
|
5820 | 912 |
|
17359 | 913 |
(* concluding steps *) |
17112 | 914 |
|
17359 | 915 |
fun local_terminal_proof (text, opt_text) = |
916 |
proof (SOME text) #> Seq.maps (local_qed (opt_text, true)); |
|
17112 | 917 |
|
918 |
val local_default_proof = local_terminal_proof (Method.default_text, NONE); |
|
919 |
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE); |
|
17359 | 920 |
val local_done_proof = proof (SOME Method.done_text) #> Seq.maps (local_qed (NONE, false)); |
921 |
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE); |
|
17112 | 922 |
|
18678 | 923 |
fun global_term_proof immed (text, opt_text) = |
924 |
proof (SOME text) |
|
925 |
#> check_result "Terminal proof method failed" |
|
926 |
#> Seq.maps (global_qeds (opt_text, immed)) |
|
927 |
#> check_result "Failed to finish proof (after successful terminal method)" |
|
928 |
#> Seq.hd; |
|
17112 | 929 |
|
930 |
val global_terminal_proof = global_term_proof true; |
|
931 |
val global_default_proof = global_terminal_proof (Method.default_text, NONE); |
|
932 |
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE); |
|
933 |
val global_done_proof = global_term_proof false (Method.done_text, NONE); |
|
17359 | 934 |
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); |
5820 | 935 |
|
6896 | 936 |
|
17359 | 937 |
(* common goal statements *) |
938 |
||
939 |
local |
|
940 |
||
17859 | 941 |
fun gen_have prep_att prepp before_qed after_qed stmt int = |
942 |
local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt; |
|
6896 | 943 |
|
17859 | 944 |
fun gen_show prep_att prepp before_qed after_qed stmt int state = |
17359 | 945 |
let |
946 |
val testing = ref false; |
|
947 |
val rule = ref (NONE: thm option); |
|
948 |
fun fail_msg ctxt = |
|
949 |
"Local statement will fail to solve any pending goal" :: |
|
950 |
(case ! rule of NONE => [] | SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th]) |
|
951 |
|> cat_lines; |
|
6896 | 952 |
|
17359 | 953 |
fun print_results ctxt res = |
954 |
if ! testing then () else ProofDisplay.print_results int ctxt res; |
|
955 |
fun print_rule ctxt th = |
|
956 |
if ! testing then rule := SOME th |
|
957 |
else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th) |
|
958 |
else (); |
|
959 |
val test_proof = |
|
960 |
(Seq.pull oo local_skip_proof) true |
|
961 |
|> setmp testing true |
|
962 |
|> setmp proofs 0 |
|
963 |
|> capture; |
|
6896 | 964 |
|
18124 | 965 |
fun after_qed' results = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
966 |
refine_goals print_rule (context_of state) (flat results) |
18124 | 967 |
#> Seq.maps (after_qed results); |
17359 | 968 |
in |
969 |
state |
|
17859 | 970 |
|> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt |
17359 | 971 |
|> K int ? (fn goal_state => |
972 |
(case test_proof goal_state of |
|
973 |
Result (SOME _) => goal_state |
|
18678 | 974 |
| Result NONE => error (fail_msg (context_of goal_state)) |
17359 | 975 |
| Exn Interrupt => raise Interrupt |
976 |
| Exn exn => raise EXCEPTION (exn, fail_msg (context_of goal_state)))) |
|
977 |
end; |
|
978 |
||
17859 | 979 |
fun gen_theorem prep_att prepp kind before_qed after_qed target a = |
980 |
global_goal ProofDisplay.present_results prep_att prepp kind before_qed after_qed target a; |
|
17359 | 981 |
|
982 |
in |
|
983 |
||
18728 | 984 |
val have = gen_have Attrib.attribute ProofContext.bind_propp; |
17359 | 985 |
val have_i = gen_have (K I) ProofContext.bind_propp_i; |
18728 | 986 |
val show = gen_show Attrib.attribute ProofContext.bind_propp; |
17359 | 987 |
val show_i = gen_show (K I) ProofContext.bind_propp_i; |
18728 | 988 |
val theorem = gen_theorem Attrib.attribute ProofContext.bind_propp_schematic; |
17359 | 989 |
val theorem_i = gen_theorem (K I) ProofContext.bind_propp_schematic_i; |
6896 | 990 |
|
5820 | 991 |
end; |
17359 | 992 |
|
993 |
end; |