author | wenzelm |
Thu, 23 Jul 2009 16:52:16 +0200 | |
changeset 32145 | 220c9e439d39 |
parent 32091 | 30e2ffbba718 |
child 32167 | d32817dda0e6 |
permissions | -rw-r--r-- |
5820 | 1 |
(* Title: Pure/Isar/proof.ML |
2 |
Author: Markus Wenzel, TU Muenchen |
|
3 |
||
19000 | 4 |
The Isar/VM proof language interpreter: maintains a structured flow of |
5 |
context elements, goals, refinements, and facts. |
|
5820 | 6 |
*) |
7 |
||
8 |
signature PROOF = |
|
9 |
sig |
|
23639 | 10 |
type context = Context.proof |
11 |
type method = Method.method |
|
5820 | 12 |
type state |
17359 | 13 |
val init: context -> state |
14 |
val level: state -> int |
|
15 |
val assert_bottom: bool -> state -> state |
|
5820 | 16 |
val context_of: state -> context |
17 |
val theory_of: state -> theory |
|
13377 | 18 |
val map_context: (context -> context) -> state -> state |
28278 | 19 |
val map_contexts: (context -> context) -> state -> state |
30757
2d2076300185
replaced add_binds(_i) by bind_terms -- internal version only;
wenzelm
parents:
30557
diff
changeset
|
20 |
val bind_terms: (indexname * term option) list -> state -> state |
26251
b8c6259d366b
put_facts: do_props, i.e. facts are indexed by proposition again;
wenzelm
parents:
25958
diff
changeset
|
21 |
val put_thms: bool -> string * thm list option -> state -> state |
6091 | 22 |
val the_facts: state -> thm list |
9469 | 23 |
val the_fact: state -> thm |
17450 | 24 |
val put_facts: thm list option -> state -> state |
6891 | 25 |
val assert_forward: state -> state |
17359 | 26 |
val assert_chain: state -> state |
9469 | 27 |
val assert_forward_or_chain: state -> state |
5820 | 28 |
val assert_backward: state -> state |
8206 | 29 |
val assert_no_chain: state -> state |
5820 | 30 |
val enter_forward: state -> state |
24543 | 31 |
val goal_message: (unit -> Pretty.T) -> state -> state |
17359 | 32 |
val get_goal: state -> context * (thm list * thm) |
16539 | 33 |
val show_main_goal: bool ref |
6529 | 34 |
val verbose: bool ref |
12423 | 35 |
val pretty_state: int -> state -> Pretty.T list |
10360 | 36 |
val pretty_goals: bool -> state -> Pretty.T list |
17112 | 37 |
val refine: Method.text -> state -> state Seq.seq |
38 |
val refine_end: Method.text -> state -> state Seq.seq |
|
18908 | 39 |
val refine_insert: thm list -> state -> state |
20208 | 40 |
val goal_tac: thm -> int -> tactic |
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 |
29581 | 46 |
val fix: (binding * string option * mixfix) list -> state -> state |
47 |
val fix_i: (binding * typ option * mixfix) list -> state -> state |
|
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
48 |
val assm: Assumption.export -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
49 |
(Attrib.binding * (string * string list) list) list -> state -> state |
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
50 |
val assm_i: Assumption.export -> |
30211 | 51 |
(Thm.binding * (term * term list) list) list -> state -> state |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
52 |
val assume: (Attrib.binding * (string * string list) list) list -> state -> state |
30211 | 53 |
val assume_i: (Thm.binding * (term * term list) list) list -> state -> state |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
54 |
val presume: (Attrib.binding * (string * string list) list) list -> state -> state |
30211 | 55 |
val presume_i: (Thm.binding * (term * term list) list) list -> state -> state |
56 |
val def: (Attrib.binding * ((binding * mixfix) * (string * string list))) list -> state -> state |
|
57 |
val def_i: (Thm.binding * ((binding * mixfix) * (term * term list))) list -> state -> state |
|
17359 | 58 |
val chain: state -> state |
59 |
val chain_facts: thm list -> state -> state |
|
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
60 |
val get_thmss: state -> (Facts.ref * Attrib.src list) list -> thm list |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
61 |
val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list -> state -> state |
30211 | 62 |
val note_thmss_i: (Thm.binding * (thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
63 |
val from_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 64 |
val from_thmss_i: ((thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
65 |
val with_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 66 |
val with_thmss_i: ((thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
67 |
val using: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 68 |
val using_i: ((thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
69 |
val unfolding: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 70 |
val unfolding_i: ((thm list * attribute list) list) list -> state -> state |
17112 | 71 |
val invoke_case: string * string option list * Attrib.src list -> state -> state |
18728 | 72 |
val invoke_case_i: string * string option list * attribute list -> state -> state |
17359 | 73 |
val begin_block: state -> state |
74 |
val next_block: state -> state |
|
20309 | 75 |
val end_block: state -> state |
17112 | 76 |
val proof: Method.text option -> state -> state Seq.seq |
77 |
val defer: int option -> state -> state Seq.seq |
|
78 |
val prefer: int -> state -> state Seq.seq |
|
79 |
val apply: Method.text -> state -> state Seq.seq |
|
80 |
val apply_end: Method.text -> state -> state Seq.seq |
|
17359 | 81 |
val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) -> |
18728 | 82 |
(theory -> 'a -> attribute) -> |
17359 | 83 |
(context * 'b list -> context * (term list list * (context -> context))) -> |
29383 | 84 |
string -> Method.text option -> (thm list list -> state -> state) -> |
29581 | 85 |
((binding * 'a list) * 'b) list -> state -> state |
29383 | 86 |
val local_qed: Method.text option * bool -> state -> state |
21442 | 87 |
val theorem: Method.text option -> (thm list list -> context -> context) -> |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
88 |
(string * string list) list list -> context -> state |
21442 | 89 |
val theorem_i: Method.text option -> (thm list list -> context -> context) -> |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
90 |
(term * term list) list list -> context -> state |
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
91 |
val global_qed: Method.text option * bool -> state -> context |
29383 | 92 |
val local_terminal_proof: Method.text * Method.text option -> state -> state |
93 |
val local_default_proof: state -> state |
|
94 |
val local_immediate_proof: state -> state |
|
95 |
val local_skip_proof: bool -> state -> state |
|
96 |
val local_done_proof: state -> state |
|
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
97 |
val global_terminal_proof: Method.text * Method.text option -> state -> context |
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
98 |
val global_default_proof: state -> context |
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
99 |
val global_immediate_proof: state -> context |
29383 | 100 |
val global_skip_proof: bool -> state -> context |
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
101 |
val global_done_proof: state -> context |
29383 | 102 |
val have: Method.text option -> (thm list list -> state -> state) -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
103 |
(Attrib.binding * (string * string list) list) list -> bool -> state -> state |
29383 | 104 |
val have_i: Method.text option -> (thm list list -> state -> state) -> |
30211 | 105 |
(Thm.binding * (term * term list) list) list -> bool -> state -> state |
29383 | 106 |
val show: Method.text option -> (thm list list -> state -> state) -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
107 |
(Attrib.binding * (string * string list) list) list -> bool -> state -> state |
29383 | 108 |
val show_i: Method.text option -> (thm list list -> state -> state) -> |
30211 | 109 |
(Thm.binding * (term * term list) list) list -> bool -> state -> state |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
110 |
val schematic_goal: state -> bool |
28452 | 111 |
val is_relevant: state -> bool |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
112 |
val local_future_proof: (state -> ('a * state) Future.future) -> |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
113 |
state -> 'a Future.future * state |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
114 |
val global_future_proof: (state -> ('a * Proof.context) Future.future) -> |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
115 |
state -> 'a Future.future * context |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
116 |
val local_future_terminal_proof: Method.text * Method.text option -> bool -> state -> state |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
117 |
val global_future_terminal_proof: Method.text * Method.text option -> bool -> state -> context |
5820 | 118 |
end; |
119 |
||
13377 | 120 |
structure Proof: PROOF = |
5820 | 121 |
struct |
122 |
||
20309 | 123 |
type context = Context.proof; |
17112 | 124 |
type method = Method.method; |
16813 | 125 |
|
5820 | 126 |
|
127 |
(** proof state **) |
|
128 |
||
17359 | 129 |
(* datatype state *) |
5820 | 130 |
|
17112 | 131 |
datatype mode = Forward | Chain | Backward; |
5820 | 132 |
|
17359 | 133 |
datatype state = |
134 |
State of node Stack.T |
|
135 |
and node = |
|
7176 | 136 |
Node of |
137 |
{context: context, |
|
138 |
facts: thm list option, |
|
139 |
mode: mode, |
|
17359 | 140 |
goal: goal option} |
141 |
and goal = |
|
142 |
Goal of |
|
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
143 |
{statement: (string * Position.T) * term list list * term, |
28410 | 144 |
(*goal kind and statement (starting with vars), initial proposition*) |
25958 | 145 |
messages: (unit -> Pretty.T) list, (*persistent messages (hints etc.)*) |
146 |
using: thm list, (*goal facts*) |
|
147 |
goal: thm, (*subgoals ==> statement*) |
|
17859 | 148 |
before_qed: Method.text option, |
18124 | 149 |
after_qed: |
29383 | 150 |
(thm list list -> state -> state) * |
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
151 |
(thm list list -> context -> context)}; |
17359 | 152 |
|
24543 | 153 |
fun make_goal (statement, messages, using, goal, before_qed, after_qed) = |
154 |
Goal {statement = statement, messages = messages, using = using, goal = goal, |
|
17859 | 155 |
before_qed = before_qed, after_qed = after_qed}; |
5820 | 156 |
|
7176 | 157 |
fun make_node (context, facts, mode, goal) = |
158 |
Node {context = context, facts = facts, mode = mode, goal = goal}; |
|
159 |
||
17359 | 160 |
fun map_node f (Node {context, facts, mode, goal}) = |
161 |
make_node (f (context, facts, mode, goal)); |
|
5820 | 162 |
|
21727 | 163 |
val init_context = |
164 |
ProofContext.set_stmt true #> ProofContext.reset_naming; |
|
165 |
||
21466
6ffb8f455b84
init: enter inner statement mode, which prevents local notes from being named internally;
wenzelm
parents:
21451
diff
changeset
|
166 |
fun init ctxt = |
21727 | 167 |
State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE))); |
5820 | 168 |
|
17359 | 169 |
fun current (State st) = Stack.top st |> (fn Node node => node); |
21274 | 170 |
fun map_current f (State st) = State (Stack.map_top (map_node f) st); |
28278 | 171 |
fun map_all f (State st) = State (Stack.map_all (map_node f) st); |
12045 | 172 |
|
5820 | 173 |
|
174 |
||
175 |
(** basic proof state operations **) |
|
176 |
||
17359 | 177 |
(* block structure *) |
178 |
||
179 |
fun open_block (State st) = State (Stack.push st); |
|
180 |
||
18678 | 181 |
fun close_block (State st) = State (Stack.pop st) |
182 |
handle Empty => error "Unbalanced block parentheses"; |
|
17359 | 183 |
|
184 |
fun level (State st) = Stack.level st; |
|
185 |
||
186 |
fun assert_bottom b state = |
|
187 |
let val b' = (level state <= 2) in |
|
18678 | 188 |
if b andalso not b' then error "Not at bottom of proof!" |
189 |
else if not b andalso b' then error "Already at bottom of proof!" |
|
17359 | 190 |
else state |
191 |
end; |
|
192 |
||
193 |
||
5820 | 194 |
(* context *) |
195 |
||
17359 | 196 |
val context_of = #context o current; |
5820 | 197 |
val theory_of = ProofContext.theory_of o context_of; |
198 |
||
17359 | 199 |
fun map_context f = |
200 |
map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); |
|
5820 | 201 |
|
17359 | 202 |
fun map_context_result f state = |
17859 | 203 |
f (context_of state) ||> (fn ctxt => map_context (K ctxt) state); |
5820 | 204 |
|
28278 | 205 |
fun map_contexts f = map_all (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); |
206 |
||
30757
2d2076300185
replaced add_binds(_i) by bind_terms -- internal version only;
wenzelm
parents:
30557
diff
changeset
|
207 |
val bind_terms = map_context o ProofContext.bind_terms; |
26251
b8c6259d366b
put_facts: do_props, i.e. facts are indexed by proposition again;
wenzelm
parents:
25958
diff
changeset
|
208 |
val put_thms = map_context oo ProofContext.put_thms; |
5820 | 209 |
|
210 |
||
211 |
(* facts *) |
|
212 |
||
17359 | 213 |
val get_facts = #facts o current; |
214 |
||
215 |
fun the_facts state = |
|
216 |
(case get_facts state of SOME facts => facts |
|
18678 | 217 |
| NONE => error "No current facts available"); |
5820 | 218 |
|
9469 | 219 |
fun the_fact state = |
17359 | 220 |
(case the_facts state of [thm] => thm |
18678 | 221 |
| _ => error "Single theorem expected"); |
7605 | 222 |
|
17359 | 223 |
fun put_facts facts = |
19078 | 224 |
map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #> |
26251
b8c6259d366b
put_facts: do_props, i.e. facts are indexed by proposition again;
wenzelm
parents:
25958
diff
changeset
|
225 |
put_thms true (AutoBind.thisN, facts); |
5820 | 226 |
|
17359 | 227 |
fun these_factss more_facts (named_factss, state) = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
228 |
(named_factss, state |> put_facts (SOME (maps snd named_factss @ more_facts))); |
5820 | 229 |
|
17359 | 230 |
fun export_facts inner outer = |
231 |
(case get_facts inner of |
|
20309 | 232 |
NONE => put_facts NONE outer |
17359 | 233 |
| SOME thms => |
234 |
thms |
|
20309 | 235 |
|> ProofContext.export (context_of inner) (context_of outer) |
236 |
|> (fn ths => put_facts (SOME ths) outer)); |
|
5820 | 237 |
|
238 |
||
239 |
(* mode *) |
|
240 |
||
17359 | 241 |
val get_mode = #mode o current; |
5820 | 242 |
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal)); |
243 |
||
17359 | 244 |
val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove"); |
5820 | 245 |
|
246 |
fun assert_mode pred state = |
|
247 |
let val mode = get_mode state in |
|
248 |
if pred mode then state |
|
18678 | 249 |
else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode") |
5820 | 250 |
end; |
251 |
||
19308 | 252 |
val assert_forward = assert_mode (fn mode => mode = Forward); |
253 |
val assert_chain = assert_mode (fn mode => mode = Chain); |
|
254 |
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain); |
|
255 |
val assert_backward = assert_mode (fn mode => mode = Backward); |
|
256 |
val assert_no_chain = assert_mode (fn mode => mode <> Chain); |
|
5820 | 257 |
|
17359 | 258 |
val enter_forward = put_mode Forward; |
259 |
val enter_chain = put_mode Chain; |
|
260 |
val enter_backward = put_mode Backward; |
|
5820 | 261 |
|
17359 | 262 |
|
263 |
(* current goal *) |
|
264 |
||
265 |
fun current_goal state = |
|
266 |
(case current state of |
|
267 |
{context, goal = SOME (Goal goal), ...} => (context, goal) |
|
18678 | 268 |
| _ => error "No current goal!"); |
5820 | 269 |
|
17359 | 270 |
fun assert_current_goal g state = |
271 |
let val g' = can current_goal state in |
|
18678 | 272 |
if g andalso not g' then error "No goal in this block!" |
273 |
else if not g andalso g' then error "Goal present in this block!" |
|
17359 | 274 |
else state |
275 |
end; |
|
6776 | 276 |
|
17359 | 277 |
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal)); |
278 |
||
17859 | 279 |
val before_qed = #before_qed o #2 o current_goal; |
280 |
||
17359 | 281 |
|
282 |
(* nested goal *) |
|
5820 | 283 |
|
17359 | 284 |
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) = |
285 |
let |
|
24543 | 286 |
val Goal {statement, messages, using, goal, before_qed, after_qed} = goal; |
287 |
val goal' = make_goal (g (statement, messages, using, goal, before_qed, after_qed)); |
|
17359 | 288 |
in State (make_node (f context, facts, mode, SOME goal'), nodes) end |
289 |
| map_goal f g (State (nd, node :: nodes)) = |
|
290 |
let val State (node', nodes') = map_goal f g (State (node, nodes)) |
|
291 |
in map_context f (State (nd, node' :: nodes')) end |
|
292 |
| map_goal _ _ state = state; |
|
5820 | 293 |
|
24556 | 294 |
fun set_goal goal = map_goal I (fn (statement, _, using, _, before_qed, after_qed) => |
295 |
(statement, [], using, goal, before_qed, after_qed)); |
|
19188 | 296 |
|
24543 | 297 |
fun goal_message msg = map_goal I (fn (statement, messages, using, goal, before_qed, after_qed) => |
298 |
(statement, msg :: messages, using, goal, before_qed, after_qed)); |
|
299 |
||
24556 | 300 |
fun using_facts using = map_goal I (fn (statement, _, _, goal, before_qed, after_qed) => |
301 |
(statement, [], using, goal, before_qed, after_qed)); |
|
17359 | 302 |
|
303 |
local |
|
304 |
fun find i state = |
|
305 |
(case try current_goal state of |
|
306 |
SOME (ctxt, goal) => (ctxt, (i, goal)) |
|
18678 | 307 |
| NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present")); |
17359 | 308 |
in val find_goal = find 0 end; |
309 |
||
310 |
fun get_goal state = |
|
311 |
let val (ctxt, (_, {using, goal, ...})) = find_goal state |
|
312 |
in (ctxt, (using, goal)) end; |
|
5820 | 313 |
|
314 |
||
315 |
||
12423 | 316 |
(** pretty_state **) |
5820 | 317 |
|
13869 | 318 |
val show_main_goal = ref false; |
16539 | 319 |
val verbose = ProofContext.verbose; |
13698 | 320 |
|
15531 | 321 |
fun pretty_facts _ _ NONE = [] |
322 |
| pretty_facts s ctxt (SOME ths) = |
|
32091
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32089
diff
changeset
|
323 |
[Pretty.big_list (s ^ "this:") (map (Display.pretty_thm ctxt) ths), Pretty.str ""]; |
6756 | 324 |
|
17359 | 325 |
fun pretty_state nr state = |
5820 | 326 |
let |
17359 | 327 |
val {context, facts, mode, goal = _} = current state; |
5820 | 328 |
|
329 |
fun levels_up 0 = "" |
|
17359 | 330 |
| levels_up 1 = "1 level up" |
331 |
| levels_up i = string_of_int i ^ " levels up"; |
|
5820 | 332 |
|
11556 | 333 |
fun subgoals 0 = "" |
17359 | 334 |
| subgoals 1 = "1 subgoal" |
335 |
| subgoals n = string_of_int n ^ " subgoals"; |
|
336 |
||
337 |
fun description strs = |
|
28375 | 338 |
(case filter_out (fn s => s = "") strs of [] => "" |
17359 | 339 |
| strs' => enclose " (" ")" (commas strs')); |
12146 | 340 |
|
29416 | 341 |
fun prt_goal (SOME (ctxt, (i, |
342 |
{statement = ((_, pos), _, _), messages, using, goal, before_qed = _, after_qed = _}))) = |
|
17359 | 343 |
pretty_facts "using " ctxt |
344 |
(if mode <> Backward orelse null using then NONE else SOME using) @ |
|
21442 | 345 |
[Pretty.str ("goal" ^ |
346 |
description [levels_up (i div 2), subgoals (Thm.nprems_of goal)] ^ ":")] @ |
|
32145
220c9e439d39
clarified pretty_goals, pretty_thm_aux: plain context;
wenzelm
parents:
32091
diff
changeset
|
347 |
Display_Goal.pretty_goals ctxt Markup.subgoal |
24543 | 348 |
(true, ! show_main_goal) (! Display.goals_limit) goal @ |
25958 | 349 |
(map (fn msg => Position.setmp_thread_data pos msg ()) (rev messages)) |
17359 | 350 |
| prt_goal NONE = []; |
6848 | 351 |
|
17359 | 352 |
val prt_ctxt = |
353 |
if ! verbose orelse mode = Forward then ProofContext.pretty_context context |
|
18670 | 354 |
else if mode = Backward then ProofContext.pretty_ctxt context |
7575 | 355 |
else []; |
17359 | 356 |
in |
357 |
[Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^ |
|
358 |
(if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")), |
|
359 |
Pretty.str ""] @ |
|
360 |
(if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @ |
|
361 |
(if ! verbose orelse mode = Forward then |
|
362 |
pretty_facts "" context facts @ prt_goal (try find_goal state) |
|
363 |
else if mode = Chain then pretty_facts "picking " context facts |
|
364 |
else prt_goal (try find_goal state)) |
|
365 |
end; |
|
5820 | 366 |
|
12085 | 367 |
fun pretty_goals main state = |
19188 | 368 |
let val (ctxt, (_, goal)) = get_goal state |
32145
220c9e439d39
clarified pretty_goals, pretty_thm_aux: plain context;
wenzelm
parents:
32091
diff
changeset
|
369 |
in Display_Goal.pretty_goals ctxt Markup.none (false, main) (! Display.goals_limit) goal end; |
10320 | 370 |
|
5820 | 371 |
|
372 |
||
373 |
(** proof steps **) |
|
374 |
||
17359 | 375 |
(* refine via method *) |
5820 | 376 |
|
8234 | 377 |
local |
378 |
||
16146 | 379 |
fun goalN i = "goal" ^ string_of_int i; |
380 |
fun goals st = map goalN (1 upto Thm.nprems_of st); |
|
381 |
||
382 |
fun no_goal_cases st = map (rpair NONE) (goals st); |
|
383 |
||
384 |
fun goal_cases st = |
|
18607 | 385 |
RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st)); |
16146 | 386 |
|
25958 | 387 |
fun apply_method current_context pos meth state = |
6848 | 388 |
let |
24556 | 389 |
val (goal_ctxt, (_, {statement, messages = _, using, goal, before_qed, after_qed})) = |
24543 | 390 |
find_goal state; |
25958 | 391 |
val ctxt = if current_context then context_of state else goal_ctxt; |
16146 | 392 |
in |
25958 | 393 |
Method.apply pos meth ctxt using goal |> Seq.map (fn (meth_cases, goal') => |
6848 | 394 |
state |
16146 | 395 |
|> map_goal |
18475 | 396 |
(ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #> |
397 |
ProofContext.add_cases true meth_cases) |
|
24556 | 398 |
(K (statement, [], using, goal', before_qed, after_qed))) |
16146 | 399 |
end; |
5820 | 400 |
|
19188 | 401 |
fun select_goals n meth state = |
19224 | 402 |
state |
403 |
|> (#2 o #2 o get_goal) |
|
21687 | 404 |
|> ALLGOALS Goal.conjunction_tac |
19224 | 405 |
|> Seq.maps (fn goal => |
19188 | 406 |
state |
21687 | 407 |
|> Seq.lift set_goal (Goal.extract 1 n goal |> Seq.maps (Goal.conjunction_tac 1)) |
19188 | 408 |
|> Seq.maps meth |
409 |
|> Seq.maps (fn state' => state' |
|
410 |
|> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal)) |
|
23360 | 411 |
|> Seq.maps (apply_method true Position.none (K Method.succeed))); |
19188 | 412 |
|
17112 | 413 |
fun apply_text cc text state = |
414 |
let |
|
415 |
val thy = theory_of state; |
|
23360 | 416 |
val pos_of = #2 o Args.dest_src; |
17112 | 417 |
|
23360 | 418 |
fun eval (Method.Basic (m, pos)) = apply_method cc pos m |
419 |
| eval (Method.Source src) = apply_method cc (pos_of src) (Method.method thy src) |
|
420 |
| eval (Method.Source_i src) = apply_method cc (pos_of src) (Method.method_i thy src) |
|
17112 | 421 |
| eval (Method.Then txts) = Seq.EVERY (map eval txts) |
422 |
| eval (Method.Orelse txts) = Seq.FIRST (map eval txts) |
|
423 |
| eval (Method.Try txt) = Seq.TRY (eval txt) |
|
19188 | 424 |
| eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt) |
425 |
| eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt); |
|
17112 | 426 |
in eval text state end; |
427 |
||
8234 | 428 |
in |
429 |
||
17112 | 430 |
val refine = apply_text true; |
431 |
val refine_end = apply_text false; |
|
8234 | 432 |
|
18908 | 433 |
fun refine_insert [] = I |
23360 | 434 |
| refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths), Position.none)); |
18908 | 435 |
|
8234 | 436 |
end; |
437 |
||
5820 | 438 |
|
17359 | 439 |
(* refine via sub-proof *) |
440 |
||
30557
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
441 |
fun finish_tac 0 = K all_tac |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
442 |
| finish_tac n = |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
443 |
Goal.norm_hhf_tac THEN' |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
444 |
SUBGOAL (fn (goal, i) => |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
445 |
if can Logic.unprotect (Logic.strip_assums_concl goal) then |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
446 |
Tactic.etac Drule.protectI i THEN finish_tac (n - 1) i |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
447 |
else finish_tac (n - 1) (i + 1)); |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
448 |
|
20208 | 449 |
fun goal_tac rule = |
30557
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
450 |
Goal.norm_hhf_tac THEN' |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
451 |
Tactic.rtac rule THEN' |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
452 |
finish_tac (Thm.nprems_of rule); |
11816 | 453 |
|
19915 | 454 |
fun refine_goals print_rule inner raw_rules state = |
455 |
let |
|
456 |
val (outer, (_, goal)) = get_goal state; |
|
20208 | 457 |
fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st); |
19915 | 458 |
in |
459 |
raw_rules |
|
20309 | 460 |
|> ProofContext.goal_export inner outer |
461 |
|> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state) |
|
19915 | 462 |
end; |
17359 | 463 |
|
6932 | 464 |
|
17359 | 465 |
(* conclude_goal *) |
6932 | 466 |
|
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
467 |
fun conclude_goal ctxt goal propss = |
5820 | 468 |
let |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
469 |
val thy = ProofContext.theory_of ctxt; |
24920 | 470 |
val string_of_term = Syntax.string_of_term ctxt; |
32091
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32089
diff
changeset
|
471 |
val string_of_thm = Display.string_of_thm ctxt; |
5820 | 472 |
|
17359 | 473 |
val ngoals = Thm.nprems_of goal; |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
474 |
val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks |
32145
220c9e439d39
clarified pretty_goals, pretty_thm_aux: plain context;
wenzelm
parents:
32091
diff
changeset
|
475 |
(Display_Goal.pretty_goals ctxt Markup.none |
220c9e439d39
clarified pretty_goals, pretty_thm_aux: plain context;
wenzelm
parents:
32091
diff
changeset
|
476 |
(true, ! show_main_goal) (! Display.goals_limit) goal @ |
23639 | 477 |
[Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")]))); |
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
478 |
|
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
479 |
val extra_hyps = Assumption.extra_hyps ctxt goal; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
480 |
val _ = null extra_hyps orelse |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
481 |
error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term extra_hyps)); |
5820 | 482 |
|
23418 | 483 |
fun lost_structure () = error ("Lost goal structure:\n" ^ string_of_thm goal); |
484 |
||
23782
4dd0ba632e40
Proof terms for meta-conjunctions are now normalized before
berghofe
parents:
23639
diff
changeset
|
485 |
val th = Goal.conclude |
23806 | 486 |
(if length (flat propss) > 1 then Thm.norm_proof goal else goal) |
23782
4dd0ba632e40
Proof terms for meta-conjunctions are now normalized before
berghofe
parents:
23639
diff
changeset
|
487 |
handle THM _ => lost_structure (); |
23418 | 488 |
val goal_propss = filter_out null propss; |
489 |
val results = |
|
490 |
Conjunction.elim_balanced (length goal_propss) th |
|
491 |
|> map2 Conjunction.elim_balanced (map length goal_propss) |
|
492 |
handle THM _ => lost_structure (); |
|
493 |
val _ = Unify.matches_list thy (flat goal_propss) (map Thm.prop_of (flat results)) orelse |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
494 |
error ("Proved a different theorem:\n" ^ string_of_thm th); |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
495 |
val _ = Thm.check_shyps (Variable.sorts_of ctxt) th; |
23418 | 496 |
|
497 |
fun recover_result ([] :: pss) thss = [] :: recover_result pss thss |
|
498 |
| recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss |
|
499 |
| recover_result [] [] = [] |
|
500 |
| recover_result _ _ = lost_structure (); |
|
501 |
in recover_result propss results end; |
|
5820 | 502 |
|
503 |
||
504 |
||
505 |
(*** structured proof commands ***) |
|
506 |
||
17112 | 507 |
(** context elements **) |
5820 | 508 |
|
17112 | 509 |
(* bindings *) |
5820 | 510 |
|
16813 | 511 |
local |
512 |
||
17359 | 513 |
fun gen_bind bind args state = |
5820 | 514 |
state |
515 |
|> assert_forward |
|
18308 | 516 |
|> map_context (bind args #> snd) |
17359 | 517 |
|> put_facts NONE; |
5820 | 518 |
|
16813 | 519 |
in |
520 |
||
8617
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
521 |
val match_bind = gen_bind (ProofContext.match_bind false); |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
522 |
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
|
523 |
val let_bind = gen_bind (ProofContext.match_bind true); |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
524 |
val let_bind_i = gen_bind (ProofContext.match_bind_i true); |
5820 | 525 |
|
16813 | 526 |
end; |
527 |
||
5820 | 528 |
|
17359 | 529 |
(* fix *) |
9196 | 530 |
|
12714 | 531 |
local |
532 |
||
30763
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
533 |
fun gen_fix prep_vars args = |
17359 | 534 |
assert_forward |
30763
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
535 |
#> map_context (fn ctxt => snd (ProofContext.add_fixes (prep_vars ctxt args) ctxt)) |
17359 | 536 |
#> put_facts NONE; |
5820 | 537 |
|
16813 | 538 |
in |
539 |
||
30763
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
540 |
val fix = gen_fix (fn ctxt => fn args => fst (ProofContext.read_vars args ctxt)); |
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
541 |
val fix_i = gen_fix (K I); |
5820 | 542 |
|
16813 | 543 |
end; |
544 |
||
5820 | 545 |
|
17359 | 546 |
(* assume etc. *) |
5820 | 547 |
|
16813 | 548 |
local |
549 |
||
17112 | 550 |
fun gen_assume asm prep_att exp args state = |
5820 | 551 |
state |
552 |
|> assert_forward |
|
17112 | 553 |
|> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args)) |
17359 | 554 |
|> these_factss [] |> #2; |
6932 | 555 |
|
16813 | 556 |
in |
557 |
||
18728 | 558 |
val assm = gen_assume ProofContext.add_assms Attrib.attribute; |
18670 | 559 |
val assm_i = gen_assume ProofContext.add_assms_i (K I); |
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
560 |
val assume = assm Assumption.assume_export; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
561 |
val assume_i = assm_i Assumption.assume_export; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
562 |
val presume = assm Assumption.presume_export; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
563 |
val presume_i = assm_i Assumption.presume_export; |
5820 | 564 |
|
16813 | 565 |
end; |
566 |
||
7271 | 567 |
|
17359 | 568 |
(* def *) |
11891 | 569 |
|
16813 | 570 |
local |
571 |
||
20913 | 572 |
fun gen_def prep_att prep_vars prep_binds args state = |
11891 | 573 |
let |
574 |
val _ = assert_forward state; |
|
17112 | 575 |
val thy = theory_of state; |
20913 | 576 |
val ctxt = context_of state; |
11891 | 577 |
|
20913 | 578 |
val (raw_name_atts, (raw_vars, raw_rhss)) = args |> split_list ||> split_list; |
579 |
val name_atts = map (apsnd (map (prep_att thy))) raw_name_atts; |
|
11891 | 580 |
in |
20913 | 581 |
state |
582 |
|> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars)) |
|
583 |
|>> map (fn (x, _, mx) => (x, mx)) |
|
584 |
|-> (fn vars => |
|
585 |
map_context_result (prep_binds false (map swap raw_rhss)) |
|
586 |
#-> (fn rhss => map_context_result (LocalDefs.add_defs (vars ~~ (name_atts ~~ rhss))))) |
|
587 |
|-> (put_facts o SOME o map (#2 o #2)) |
|
11891 | 588 |
end; |
589 |
||
16813 | 590 |
in |
591 |
||
20913 | 592 |
val def = gen_def Attrib.attribute ProofContext.read_vars ProofContext.match_bind; |
593 |
val def_i = gen_def (K I) ProofContext.cert_vars ProofContext.match_bind_i; |
|
11891 | 594 |
|
16813 | 595 |
end; |
596 |
||
11891 | 597 |
|
8374 | 598 |
|
17112 | 599 |
(** facts **) |
5820 | 600 |
|
17359 | 601 |
(* chain *) |
5820 | 602 |
|
24011 | 603 |
fun clean_facts ctxt = |
24050 | 604 |
put_facts (SOME (filter_out Thm.is_dummy (the_facts ctxt))) ctxt; |
24011 | 605 |
|
17359 | 606 |
val chain = |
607 |
assert_forward |
|
24011 | 608 |
#> clean_facts |
17359 | 609 |
#> enter_chain; |
5820 | 610 |
|
17359 | 611 |
fun chain_facts facts = |
612 |
put_facts (SOME facts) |
|
613 |
#> chain; |
|
5820 | 614 |
|
615 |
||
17359 | 616 |
(* note etc. *) |
17112 | 617 |
|
28965 | 618 |
fun no_binding args = map (pair (Binding.empty, [])) args; |
17112 | 619 |
|
620 |
local |
|
621 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
622 |
fun gen_thmss more_facts opt_chain opt_result prep_atts prep_fact args state = |
17112 | 623 |
state |
624 |
|> assert_forward |
|
30761
ac7570d80c3d
renamed ProofContext.note_thmss_i to ProofContext.note_thmss, eliminated obsolete external version;
wenzelm
parents:
30760
diff
changeset
|
625 |
|> map_context_result (ProofContext.note_thmss "" |
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
626 |
(Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state)) args)) |
17112 | 627 |
|> these_factss (more_facts state) |
17359 | 628 |
||> opt_chain |
629 |
|> opt_result; |
|
17112 | 630 |
|
631 |
in |
|
632 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
633 |
val note_thmss = gen_thmss (K []) I #2 Attrib.attribute ProofContext.get_fact; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
634 |
val note_thmss_i = gen_thmss (K []) I #2 (K I) (K I); |
17112 | 635 |
|
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
636 |
val from_thmss = gen_thmss (K []) chain #2 Attrib.attribute ProofContext.get_fact o no_binding; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
637 |
val from_thmss_i = gen_thmss (K []) chain #2 (K I) (K I) o no_binding; |
17359 | 638 |
|
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
639 |
val with_thmss = gen_thmss the_facts chain #2 Attrib.attribute ProofContext.get_fact o no_binding; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
640 |
val with_thmss_i = gen_thmss the_facts chain #2 (K I) (K I) o no_binding; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
641 |
|
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
642 |
val local_results = gen_thmss (K []) I I (K I) (K I) o map (apsnd Thm.simple_fact); |
17359 | 643 |
|
28965 | 644 |
fun get_thmss state srcs = the_facts (note_thmss [((Binding.empty, []), srcs)] state); |
17112 | 645 |
|
646 |
end; |
|
647 |
||
648 |
||
18548 | 649 |
(* using/unfolding *) |
17112 | 650 |
|
651 |
local |
|
652 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
653 |
fun gen_using f g prep_atts prep_fact args state = |
17112 | 654 |
state |
655 |
|> assert_backward |
|
21442 | 656 |
|> map_context_result |
30761
ac7570d80c3d
renamed ProofContext.note_thmss_i to ProofContext.note_thmss, eliminated obsolete external version;
wenzelm
parents:
30760
diff
changeset
|
657 |
(ProofContext.note_thmss "" |
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
658 |
(Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state)) |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
659 |
(no_binding args))) |
18843 | 660 |
|> (fn (named_facts, state') => |
24556 | 661 |
state' |> map_goal I (fn (statement, _, using, goal, before_qed, after_qed) => |
18843 | 662 |
let |
663 |
val ctxt = context_of state'; |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
664 |
val ths = maps snd named_facts; |
24556 | 665 |
in (statement, [], f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end)); |
18548 | 666 |
|
24050 | 667 |
fun append_using _ ths using = using @ filter_out Thm.is_dummy ths; |
18878 | 668 |
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths); |
669 |
val unfold_goals = LocalDefs.unfold_goals; |
|
17112 | 670 |
|
671 |
in |
|
672 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
673 |
val using = gen_using append_using (K (K I)) Attrib.attribute ProofContext.get_fact; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
674 |
val using_i = gen_using append_using (K (K I)) (K I) (K I); |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
675 |
val unfolding = gen_using unfold_using unfold_goals Attrib.attribute ProofContext.get_fact; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
676 |
val unfolding_i = gen_using unfold_using unfold_goals (K I) (K I); |
17112 | 677 |
|
678 |
end; |
|
679 |
||
680 |
||
681 |
(* case *) |
|
682 |
||
683 |
local |
|
684 |
||
30419
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
685 |
fun qualified_binding a = |
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
686 |
Binding.qualify true (Long_Name.qualifier a) (Binding.name (Long_Name.base_name a)); |
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
687 |
|
17112 | 688 |
fun gen_invoke_case prep_att (name, xs, raw_atts) state = |
689 |
let |
|
690 |
val atts = map (prep_att (theory_of state)) raw_atts; |
|
19078 | 691 |
val (asms, state') = state |> map_context_result (fn ctxt => |
692 |
ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs)); |
|
30419
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
693 |
val assumptions = asms |> map (fn (a, ts) => ((qualified_binding a, atts), map (rpair []) ts)); |
17112 | 694 |
in |
695 |
state' |
|
696 |
|> assume_i assumptions |
|
30757
2d2076300185
replaced add_binds(_i) by bind_terms -- internal version only;
wenzelm
parents:
30557
diff
changeset
|
697 |
|> bind_terms AutoBind.no_facts |
28965 | 698 |
|> `the_facts |-> (fn thms => note_thmss_i [((Binding.name name, []), [(thms, [])])]) |
17112 | 699 |
end; |
700 |
||
701 |
in |
|
702 |
||
18728 | 703 |
val invoke_case = gen_invoke_case Attrib.attribute; |
17112 | 704 |
val invoke_case_i = gen_invoke_case (K I); |
705 |
||
706 |
end; |
|
707 |
||
708 |
||
709 |
||
17359 | 710 |
(** proof structure **) |
711 |
||
712 |
(* blocks *) |
|
713 |
||
714 |
val begin_block = |
|
715 |
assert_forward |
|
716 |
#> open_block |
|
717 |
#> put_goal NONE |
|
718 |
#> open_block; |
|
719 |
||
720 |
val next_block = |
|
721 |
assert_forward |
|
722 |
#> close_block |
|
723 |
#> open_block |
|
724 |
#> put_goal NONE |
|
725 |
#> put_facts NONE; |
|
726 |
||
727 |
fun end_block state = |
|
728 |
state |
|
729 |
|> assert_forward |
|
730 |
|> close_block |
|
731 |
|> assert_current_goal false |
|
732 |
|> close_block |
|
733 |
|> export_facts state; |
|
734 |
||
735 |
||
736 |
(* sub-proofs *) |
|
737 |
||
738 |
fun proof opt_text = |
|
739 |
assert_backward |
|
17859 | 740 |
#> refine (the_default Method.default_text opt_text) |
17359 | 741 |
#> Seq.map (using_facts [] #> enter_forward); |
742 |
||
23360 | 743 |
fun end_proof bot txt state = |
744 |
state |
|
745 |
|> assert_forward |
|
746 |
|> assert_bottom bot |
|
747 |
|> close_block |
|
748 |
|> assert_current_goal true |
|
749 |
|> using_facts [] |
|
750 |
|> `before_qed |-> (refine o the_default Method.succeed_text) |
|
25958 | 751 |
|> Seq.maps (refine (Method.finish_text txt (Position.thread_data ()))); |
17359 | 752 |
|
29383 | 753 |
fun check_result msg sq = |
754 |
(case Seq.pull sq of |
|
755 |
NONE => error msg |
|
756 |
| SOME (s, _) => s); |
|
757 |
||
758 |
fun check_finish sq = check_result "Failed to finish proof" sq; |
|
759 |
||
17359 | 760 |
|
761 |
(* unstructured refinement *) |
|
762 |
||
23360 | 763 |
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i), Position.none)); |
764 |
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i), Position.none)); |
|
17359 | 765 |
|
766 |
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []); |
|
767 |
fun apply_end text = assert_forward #> refine_end text; |
|
768 |
||
769 |
||
770 |
||
17112 | 771 |
(** goals **) |
772 |
||
17359 | 773 |
(* generic goals *) |
774 |
||
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
775 |
local |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
776 |
|
19846 | 777 |
fun implicit_vars dest add props = |
778 |
let |
|
779 |
val (explicit_vars, props') = take_prefix (can dest) props |>> map dest; |
|
780 |
val vars = rev (subtract (op =) explicit_vars (fold add props [])); |
|
781 |
val _ = |
|
782 |
if null vars then () |
|
783 |
else warning ("Goal statement contains unbound schematic variable(s): " ^ |
|
784 |
commas_quote (map (Term.string_of_vname o fst) vars)); |
|
785 |
in (rev vars, props') end; |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
786 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
787 |
fun refine_terms n = |
30510
4120fc59dd85
unified type Proof.method and pervasive METHOD combinators;
wenzelm
parents:
30419
diff
changeset
|
788 |
refine (Method.Basic (K (RAW_METHOD |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
789 |
(K (HEADGOAL (PRECISE_CONJUNCTS n |
23360 | 790 |
(HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI)))))))), Position.none)) |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
791 |
#> Seq.hd; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
792 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
793 |
in |
17359 | 794 |
|
17859 | 795 |
fun generic_goal prepp kind before_qed after_qed raw_propp state = |
5820 | 796 |
let |
17359 | 797 |
val thy = theory_of state; |
23418 | 798 |
val cert = Thm.cterm_of thy; |
17359 | 799 |
val chaining = can assert_chain state; |
25958 | 800 |
val pos = Position.thread_data (); |
17359 | 801 |
|
802 |
val ((propss, after_ctxt), goal_state) = |
|
5936 | 803 |
state |
804 |
|> assert_forward_or_chain |
|
805 |
|> enter_forward |
|
17359 | 806 |
|> open_block |
17859 | 807 |
|> 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
|
808 |
val props = flat propss; |
15703 | 809 |
|
19846 | 810 |
val (_, props') = |
811 |
implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props; |
|
812 |
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
|
813 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
814 |
val propss' = map (Logic.mk_term o Var) vars :: propss; |
23418 | 815 |
val goal_propss = filter_out null propss'; |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
816 |
val goal = |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
817 |
cert (Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss)) |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
818 |
|> Thm.weaken_sorts (Variable.sorts_of (context_of goal_state)); |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
819 |
val statement = ((kind, pos), propss', Thm.term_of goal); |
18124 | 820 |
val after_qed' = after_qed |>> (fn after_local => |
821 |
fn results => map_context after_ctxt #> after_local results); |
|
5820 | 822 |
in |
17359 | 823 |
goal_state |
21727 | 824 |
|> map_context (init_context #> Variable.set_body true) |
28410 | 825 |
|> put_goal (SOME (make_goal (statement, [], [], Goal.init goal, before_qed, after_qed'))) |
17359 | 826 |
|> map_context (ProofContext.auto_bind_goal props) |
21565 | 827 |
|> chaining ? (`the_facts #-> using_facts) |
17359 | 828 |
|> put_facts NONE |
829 |
|> open_block |
|
830 |
|> put_goal NONE |
|
5820 | 831 |
|> enter_backward |
23418 | 832 |
|> not (null vars) ? refine_terms (length goal_propss) |
23360 | 833 |
|> null props ? (refine (Method.Basic (Method.assumption, Position.none)) #> Seq.hd) |
5820 | 834 |
end; |
835 |
||
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
836 |
fun generic_qed after_ctxt state = |
12503 | 837 |
let |
25958 | 838 |
val (goal_ctxt, {statement, goal, after_qed, ...}) = current_goal state; |
8617
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
839 |
val outer_state = state |> close_block; |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
840 |
val outer_ctxt = context_of outer_state; |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
841 |
|
28410 | 842 |
val ((_, pos), stmt, _) = statement; |
18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset
|
843 |
val props = |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
844 |
flat (tl stmt) |
19915 | 845 |
|> Variable.exportT_terms goal_ctxt outer_ctxt; |
17359 | 846 |
val results = |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
847 |
tl (conclude_goal goal_ctxt goal stmt) |
20309 | 848 |
|> burrow (ProofContext.export goal_ctxt outer_ctxt); |
25958 | 849 |
|
850 |
val (after_local, after_global) = after_qed; |
|
29383 | 851 |
fun after_local' x y = Position.setmp_thread_data pos (fn () => after_local x y) (); |
25958 | 852 |
fun after_global' x y = Position.setmp_thread_data pos (fn () => after_global x y) (); |
17359 | 853 |
in |
854 |
outer_state |
|
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
855 |
|> map_context (after_ctxt props) |
25958 | 856 |
|> pair ((after_local', after_global'), results) |
17359 | 857 |
end; |
858 |
||
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
859 |
end; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
860 |
|
9469 | 861 |
|
17359 | 862 |
(* local goals *) |
863 |
||
17859 | 864 |
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state = |
17359 | 865 |
let |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
866 |
val thy = theory_of state; |
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
867 |
val ((names, attss), propp) = |
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
868 |
Attrib.map_specs (prep_att thy) stmt |> split_list |>> split_list; |
17359 | 869 |
|
18124 | 870 |
fun after_qed' results = |
18808 | 871 |
local_results ((names ~~ attss) ~~ results) |
17359 | 872 |
#-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit)) |
18124 | 873 |
#> after_qed results; |
5820 | 874 |
in |
17359 | 875 |
state |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
876 |
|> generic_goal prepp kind before_qed (after_qed', K I) propp |
19900
21a99d88d925
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19862
diff
changeset
|
877 |
|> tap (Variable.warn_extra_tfrees (context_of state) o context_of) |
5820 | 878 |
end; |
879 |
||
29383 | 880 |
fun local_qeds txt = |
881 |
end_proof false txt |
|
882 |
#> Seq.map (generic_qed ProofContext.auto_bind_facts #-> |
|
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
883 |
(fn ((after_qed, _), results) => after_qed results)); |
5820 | 884 |
|
29383 | 885 |
fun local_qed txt = local_qeds txt #> check_finish; |
886 |
||
5820 | 887 |
|
17359 | 888 |
(* global goals *) |
889 |
||
21442 | 890 |
fun global_goal prepp before_qed after_qed propp ctxt = |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
891 |
init ctxt |
29383 | 892 |
|> generic_goal (prepp #> ProofContext.auto_fixes) "" before_qed (K I, after_qed) propp; |
17359 | 893 |
|
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
894 |
val theorem = global_goal ProofContext.bind_propp_schematic; |
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
895 |
val theorem_i = global_goal ProofContext.bind_propp_schematic_i; |
12065 | 896 |
|
17359 | 897 |
fun global_qeds txt = |
898 |
end_proof true txt |
|
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
899 |
#> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) => |
29383 | 900 |
after_qed results (context_of state))); |
17112 | 901 |
|
29383 | 902 |
fun global_qed txt = global_qeds txt #> check_finish; |
12959 | 903 |
|
5820 | 904 |
|
17359 | 905 |
(* concluding steps *) |
17112 | 906 |
|
29383 | 907 |
fun terminal_proof qed initial terminal = |
908 |
proof (SOME initial) #> Seq.maps (qed terminal) #> check_finish; |
|
17112 | 909 |
|
29383 | 910 |
fun local_terminal_proof (text, opt_text) = terminal_proof local_qeds text (opt_text, true); |
17112 | 911 |
val local_default_proof = local_terminal_proof (Method.default_text, NONE); |
912 |
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE); |
|
17359 | 913 |
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE); |
29383 | 914 |
val local_done_proof = terminal_proof local_qeds Method.done_text (NONE, false); |
17112 | 915 |
|
29383 | 916 |
fun global_terminal_proof (text, opt_text) = terminal_proof global_qeds text (opt_text, true); |
17112 | 917 |
val global_default_proof = global_terminal_proof (Method.default_text, NONE); |
918 |
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE); |
|
17359 | 919 |
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); |
29383 | 920 |
val global_done_proof = terminal_proof global_qeds Method.done_text (NONE, false); |
5820 | 921 |
|
6896 | 922 |
|
17359 | 923 |
(* common goal statements *) |
924 |
||
925 |
local |
|
926 |
||
17859 | 927 |
fun gen_have prep_att prepp before_qed after_qed stmt int = |
928 |
local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt; |
|
6896 | 929 |
|
17859 | 930 |
fun gen_show prep_att prepp before_qed after_qed stmt int state = |
17359 | 931 |
let |
932 |
val testing = ref false; |
|
933 |
val rule = ref (NONE: thm option); |
|
934 |
fun fail_msg ctxt = |
|
29383 | 935 |
"Local statement will fail to refine any pending goal" :: |
17359 | 936 |
(case ! rule of NONE => [] | SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th]) |
937 |
|> cat_lines; |
|
6896 | 938 |
|
17359 | 939 |
fun print_results ctxt res = |
940 |
if ! testing then () else ProofDisplay.print_results int ctxt res; |
|
941 |
fun print_rule ctxt th = |
|
942 |
if ! testing then rule := SOME th |
|
943 |
else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th) |
|
944 |
else (); |
|
945 |
val test_proof = |
|
29383 | 946 |
try (local_skip_proof true) |
28289 | 947 |
|> setmp_noncritical testing true |
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset
|
948 |
|> Exn.capture; |
6896 | 949 |
|
18124 | 950 |
fun after_qed' results = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
951 |
refine_goals print_rule (context_of state) (flat results) |
29383 | 952 |
#> check_result "Failed to refine any pending goal" |
953 |
#> after_qed results; |
|
17359 | 954 |
in |
955 |
state |
|
17859 | 956 |
|> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt |
21565 | 957 |
|> int ? (fn goal_state => |
17359 | 958 |
(case test_proof goal_state of |
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset
|
959 |
Exn.Result (SOME _) => goal_state |
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset
|
960 |
| Exn.Result NONE => error (fail_msg (context_of goal_state)) |
28443 | 961 |
| Exn.Exn Exn.Interrupt => raise Exn.Interrupt |
28458 | 962 |
| Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))]))) |
17359 | 963 |
end; |
964 |
||
965 |
in |
|
966 |
||
18728 | 967 |
val have = gen_have Attrib.attribute ProofContext.bind_propp; |
17359 | 968 |
val have_i = gen_have (K I) ProofContext.bind_propp_i; |
18728 | 969 |
val show = gen_show Attrib.attribute ProofContext.bind_propp; |
17359 | 970 |
val show_i = gen_show (K I) ProofContext.bind_propp_i; |
6896 | 971 |
|
5820 | 972 |
end; |
17359 | 973 |
|
28410 | 974 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
975 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
976 |
(** future proofs **) |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
977 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
978 |
(* relevant proof states *) |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
979 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
980 |
fun is_schematic t = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
981 |
Term.exists_subterm Term.is_Var t orelse |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
982 |
Term.exists_type (Term.exists_subtype Term.is_TVar) t; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
983 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
984 |
fun schematic_goal state = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
985 |
let val (_, (_, {statement = (_, _, prop), ...})) = find_goal state |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
986 |
in is_schematic prop end; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
987 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
988 |
fun is_relevant state = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
989 |
(case try find_goal state of |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
990 |
NONE => true |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
991 |
| SOME (_, (_, {statement = (_, _, prop), goal, ...})) => |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
992 |
is_schematic prop orelse not (Logic.protect prop aconv Thm.concl_of goal)); |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
993 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
994 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
995 |
(* full proofs *) |
28410 | 996 |
|
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
997 |
local |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
998 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
999 |
fun future_proof done get_context fork_proof state = |
28410 | 1000 |
let |
29381
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset
|
1001 |
val _ = assert_backward state; |
28410 | 1002 |
val (goal_ctxt, (_, goal)) = find_goal state; |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1003 |
val {statement as (kind, propss, prop), messages, using, goal, before_qed, after_qed} = goal; |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1004 |
val goal_txt = prop :: map Thm.term_of (Assumption.all_assms_of goal_ctxt); |
28410 | 1005 |
|
29383 | 1006 |
val _ = is_relevant state andalso error "Cannot fork relevant proof"; |
1007 |
||
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1008 |
val prop' = Logic.protect prop; |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1009 |
val statement' = (kind, [[], [prop']], prop'); |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1010 |
val goal' = Thm.adjust_maxidx_thm (Thm.maxidx_of goal) |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1011 |
(Drule.comp_no_flatten (goal, Thm.nprems_of goal) 1 Drule.protectI); |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1012 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1013 |
fun after_local' [[th]] = put_thms false (AutoBind.thisN, SOME [th]); |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1014 |
fun after_global' [[th]] = ProofContext.put_thms false (AutoBind.thisN, SOME [th]); |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1015 |
val after_qed' = (after_local', after_global'); |
30279 | 1016 |
val this_name = ProofContext.full_name goal_ctxt (Binding.name AutoBind.thisN); |
28410 | 1017 |
|
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1018 |
val result_ctxt = |
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1019 |
state |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1020 |
|> map_contexts (fold Variable.declare_term goal_txt) |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1021 |
|> map_goal I (K (statement', messages, using, goal', before_qed, after_qed')) |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1022 |
|> fork_proof; |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1023 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1024 |
val future_thm = result_ctxt |> Future.map (fn (_, x) => |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1025 |
ProofContext.get_fact_single (get_context x) (Facts.named this_name)); |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1026 |
val finished_goal = Goal.future_result goal_ctxt future_thm prop'; |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1027 |
val state' = |
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1028 |
state |
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1029 |
|> map_goal I (K (statement, messages, using, finished_goal, NONE, after_qed)) |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1030 |
|> done; |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1031 |
in (Future.map #1 result_ctxt, state') end; |
28410 | 1032 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1033 |
in |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1034 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1035 |
fun local_future_proof x = future_proof local_done_proof context_of x; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1036 |
fun global_future_proof x = future_proof global_done_proof I x; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1037 |
|
17359 | 1038 |
end; |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1039 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1040 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1041 |
(* terminal proofs *) |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1042 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1043 |
local |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1044 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1045 |
fun future_terminal_proof proof1 proof2 meths int state = |
32061
11f8ee55662d
parallel_proofs: more fine-grained control with optional parallel checking of nested Isar proofs;
wenzelm
parents:
32058
diff
changeset
|
1046 |
if int orelse is_relevant state orelse not (Goal.local_future_enabled ()) |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1047 |
then proof1 meths state |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1048 |
else snd (proof2 (fn state' => Future.fork_pri ~1 (fn () => ((), proof1 meths state'))) state); |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1049 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1050 |
in |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1051 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1052 |
fun local_future_terminal_proof x = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1053 |
future_terminal_proof local_terminal_proof local_future_proof x; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1054 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1055 |
fun global_future_terminal_proof x = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1056 |
future_terminal_proof global_terminal_proof global_future_proof x; |
29350 | 1057 |
|
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1058 |
end; |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1059 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1060 |
end; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1061 |