author  wenzelm 
Thu, 08 Jan 2009 13:18:34 +0100  
changeset 29416  438c39fc93c8 
parent 29396  bc41c9cbbfc2 
child 29435  a5f84ac14609 
permissions  rwrr 
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 
17976  20 
val add_binds_i: (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 HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

44 
val let_bind: (string list * string) list > state > state 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

45 
val let_bind_i: (term list * term) list > state > state 
28965  46 
val fix: (Binding.T * string option * mixfix) list > state > state 
47 
val fix_i: (Binding.T * 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 > 
28965  51 
((Binding.T * attribute list) * (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 
28965  53 
val assume_i: ((Binding.T * attribute list) * (term * term list) list) list > 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

54 
state > state 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

55 
val presume: (Attrib.binding * (string * string list) list) list > state > state 
28965  56 
val presume_i: ((Binding.T * attribute list) * (term * term list) list) list > 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

57 
state > state 
28965  58 
val def: (Attrib.binding * ((Binding.T * mixfix) * (string * string list))) list > 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

59 
state > state 
28965  60 
val def_i: ((Binding.T * attribute list) * 
61 
((Binding.T * mixfix) * (term * term list))) list > state > state 

17359  62 
val chain: state > state 
63 
val chain_facts: thm list > state > state 

26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset

64 
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

65 
val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list > state > state 
28965  66 
val note_thmss_i: ((Binding.T * attribute list) * 
18728  67 
(thm list * attribute list) list) list > state > state 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset

68 
val from_thmss: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  69 
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

70 
val with_thmss: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  71 
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

72 
val using: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  73 
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

74 
val unfolding: ((Facts.ref * 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 

20309  80 
val end_block: state > state 
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 local_goal: (context > ((string * string) * (string * thm list) list) > unit) > 
18728  87 
(theory > 'a > attribute) > 
17359  88 
(context * 'b list > context * (term list list * (context > context))) > 
29383  89 
string > Method.text option > (thm list list > state > state) > 
28965  90 
((Binding.T * 'a list) * 'b) list > state > state 
29383  91 
val local_qed: Method.text option * bool > state > state 
21442  92 
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

93 
(string * string list) list list > context > state 
21442  94 
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

95 
(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

96 
val global_qed: Method.text option * bool > state > context 
29383  97 
val local_terminal_proof: Method.text * Method.text option > state > state 
98 
val local_default_proof: state > state 

99 
val local_immediate_proof: state > state 

100 
val local_skip_proof: bool > state > state 

101 
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

102 
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

103 
val global_default_proof: state > context 
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

104 
val global_immediate_proof: state > context 
29383  105 
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

106 
val global_done_proof: state > context 
29383  107 
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

108 
(Attrib.binding * (string * string list) list) list > bool > state > state 
29383  109 
val have_i: Method.text option > (thm list list > state > state) > 
28965  110 
((Binding.T * attribute list) * (term * term list) list) list > bool > state > state 
29383  111 
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

112 
(Attrib.binding * (string * string list) list) list > bool > state > state 
29383  113 
val show_i: Method.text option > (thm list list > state > state) > 
28965  114 
((Binding.T * attribute list) * (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

115 
val schematic_goal: state > bool 
28452  116 
val is_relevant: state > bool 
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

117 
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

118 
state > 'a Future.future * state 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

119 
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

120 
state > 'a Future.future * context 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

121 
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

122 
val global_future_terminal_proof: Method.text * Method.text option > bool > state > context 
5820  123 
end; 
124 

13377  125 
structure Proof: PROOF = 
5820  126 
struct 
127 

20309  128 
type context = Context.proof; 
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 

29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

148 
{statement: (string * Position.T) * term list list * term, 
28410  149 
(*goal kind and statement (starting with vars), initial proposition*) 
25958  150 
messages: (unit > Pretty.T) list, (*persistent messages (hints etc.)*) 
151 
using: thm list, (*goal facts*) 

152 
goal: thm, (*subgoals ==> statement*) 

17859  153 
before_qed: Method.text option, 
18124  154 
after_qed: 
29383  155 
(thm list list > state > state) * 
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

156 
(thm list list > context > context)}; 
17359  157 

24543  158 
fun make_goal (statement, messages, using, goal, before_qed, after_qed) = 
159 
Goal {statement = statement, messages = messages, using = using, goal = goal, 

17859  160 
before_qed = before_qed, after_qed = after_qed}; 
5820  161 

7176  162 
fun make_node (context, facts, mode, goal) = 
163 
Node {context = context, facts = facts, mode = mode, goal = goal}; 

164 

17359  165 
fun map_node f (Node {context, facts, mode, goal}) = 
166 
make_node (f (context, facts, mode, goal)); 

5820  167 

21727  168 
val init_context = 
169 
ProofContext.set_stmt true #> ProofContext.reset_naming; 

170 

21466
6ffb8f455b84
init: enter inner statement mode, which prevents local notes from being named internally;
wenzelm
parents:
21451
diff
changeset

171 
fun init ctxt = 
21727  172 
State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE))); 
5820  173 

17359  174 
fun current (State st) = Stack.top st > (fn Node node => node); 
21274  175 
fun map_current f (State st) = State (Stack.map_top (map_node f) st); 
28278  176 
fun map_all f (State st) = State (Stack.map_all (map_node f) st); 
12045  177 

5820  178 

179 

180 
(** basic proof state operations **) 

181 

17359  182 
(* block structure *) 
183 

184 
fun open_block (State st) = State (Stack.push st); 

185 

18678  186 
fun close_block (State st) = State (Stack.pop st) 
187 
handle Empty => error "Unbalanced block parentheses"; 

17359  188 

189 
fun level (State st) = Stack.level st; 

190 

191 
fun assert_bottom b state = 

192 
let val b' = (level state <= 2) in 

18678  193 
if b andalso not b' then error "Not at bottom of proof!" 
194 
else if not b andalso b' then error "Already at bottom of proof!" 

17359  195 
else state 
196 
end; 

197 

198 

5820  199 
(* context *) 
200 

17359  201 
val context_of = #context o current; 
5820  202 
val theory_of = ProofContext.theory_of o context_of; 
203 

17359  204 
fun map_context f = 
205 
map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); 

5820  206 

17359  207 
fun map_context_result f state = 
17859  208 
f (context_of state) > (fn ctxt => map_context (K ctxt) state); 
5820  209 

28278  210 
fun map_contexts f = map_all (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); 
211 

10809  212 
val add_binds_i = map_context o ProofContext.add_binds_i; 
26251
b8c6259d366b
put_facts: do_props, i.e. facts are indexed by proposition again;
wenzelm
parents:
25958
diff
changeset

213 
val put_thms = map_context oo ProofContext.put_thms; 
5820  214 

215 

216 
(* facts *) 

217 

17359  218 
val get_facts = #facts o current; 
219 

220 
fun the_facts state = 

221 
(case get_facts state of SOME facts => facts 

18678  222 
 NONE => error "No current facts available"); 
5820  223 

9469  224 
fun the_fact state = 
17359  225 
(case the_facts state of [thm] => thm 
18678  226 
 _ => error "Single theorem expected"); 
7605  227 

17359  228 
fun put_facts facts = 
19078  229 
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

230 
put_thms true (AutoBind.thisN, facts); 
5820  231 

17359  232 
fun these_factss more_facts (named_factss, state) = 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset

233 
(named_factss, state > put_facts (SOME (maps snd named_factss @ more_facts))); 
5820  234 

17359  235 
fun export_facts inner outer = 
236 
(case get_facts inner of 

20309  237 
NONE => put_facts NONE outer 
17359  238 
 SOME thms => 
239 
thms 

20309  240 
> ProofContext.export (context_of inner) (context_of outer) 
241 
> (fn ths => put_facts (SOME ths) outer)); 

5820  242 

243 

244 
(* mode *) 

245 

17359  246 
val get_mode = #mode o current; 
5820  247 
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal)); 
248 

17359  249 
val mode_name = (fn Forward => "state"  Chain => "chain"  Backward => "prove"); 
5820  250 

251 
fun assert_mode pred state = 

252 
let val mode = get_mode state in 

253 
if pred mode then state 

18678  254 
else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode") 
5820  255 
end; 
256 

19308  257 
val assert_forward = assert_mode (fn mode => mode = Forward); 
258 
val assert_chain = assert_mode (fn mode => mode = Chain); 

259 
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain); 

260 
val assert_backward = assert_mode (fn mode => mode = Backward); 

261 
val assert_no_chain = assert_mode (fn mode => mode <> Chain); 

5820  262 

17359  263 
val enter_forward = put_mode Forward; 
264 
val enter_chain = put_mode Chain; 

265 
val enter_backward = put_mode Backward; 

5820  266 

17359  267 

268 
(* current goal *) 

269 

270 
fun current_goal state = 

271 
(case current state of 

272 
{context, goal = SOME (Goal goal), ...} => (context, goal) 

18678  273 
 _ => error "No current goal!"); 
5820  274 

17359  275 
fun assert_current_goal g state = 
276 
let val g' = can current_goal state in 

18678  277 
if g andalso not g' then error "No goal in this block!" 
278 
else if not g andalso g' then error "Goal present in this block!" 

17359  279 
else state 
280 
end; 

6776  281 

17359  282 
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal)); 
283 

17859  284 
val before_qed = #before_qed o #2 o current_goal; 
285 

17359  286 

287 
(* nested goal *) 

5820  288 

17359  289 
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) = 
290 
let 

24543  291 
val Goal {statement, messages, using, goal, before_qed, after_qed} = goal; 
292 
val goal' = make_goal (g (statement, messages, using, goal, before_qed, after_qed)); 

17359  293 
in State (make_node (f context, facts, mode, SOME goal'), nodes) end 
294 
 map_goal f g (State (nd, node :: nodes)) = 

295 
let val State (node', nodes') = map_goal f g (State (node, nodes)) 

296 
in map_context f (State (nd, node' :: nodes')) end 

297 
 map_goal _ _ state = state; 

5820  298 

24556  299 
fun set_goal goal = map_goal I (fn (statement, _, using, _, before_qed, after_qed) => 
300 
(statement, [], using, goal, before_qed, after_qed)); 

19188  301 

24543  302 
fun goal_message msg = map_goal I (fn (statement, messages, using, goal, before_qed, after_qed) => 
303 
(statement, msg :: messages, using, goal, before_qed, after_qed)); 

304 

24556  305 
fun using_facts using = map_goal I (fn (statement, _, _, goal, before_qed, after_qed) => 
306 
(statement, [], using, goal, before_qed, after_qed)); 

17359  307 

308 
local 

309 
fun find i state = 

310 
(case try current_goal state of 

311 
SOME (ctxt, goal) => (ctxt, (i, goal)) 

18678  312 
 NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present")); 
17359  313 
in val find_goal = find 0 end; 
314 

315 
fun get_goal state = 

316 
let val (ctxt, (_, {using, goal, ...})) = find_goal state 

317 
in (ctxt, (using, goal)) end; 

5820  318 

319 

320 

12423  321 
(** pretty_state **) 
5820  322 

13869  323 
val show_main_goal = ref false; 
16539  324 
val verbose = ProofContext.verbose; 
13698  325 

24961  326 
val pretty_goals_local = Display.pretty_goals_aux o Syntax.pp; 
12085  327 

15531  328 
fun pretty_facts _ _ NONE = [] 
329 
 pretty_facts s ctxt (SOME ths) = 

12055  330 
[Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""]; 
6756  331 

17359  332 
fun pretty_state nr state = 
5820  333 
let 
17359  334 
val {context, facts, mode, goal = _} = current state; 
5820  335 

336 
fun levels_up 0 = "" 

17359  337 
 levels_up 1 = "1 level up" 
338 
 levels_up i = string_of_int i ^ " levels up"; 

5820  339 

11556  340 
fun subgoals 0 = "" 
17359  341 
 subgoals 1 = "1 subgoal" 
342 
 subgoals n = string_of_int n ^ " subgoals"; 

343 

344 
fun description strs = 

28375  345 
(case filter_out (fn s => s = "") strs of [] => "" 
17359  346 
 strs' => enclose " (" ")" (commas strs')); 
12146  347 

29416  348 
fun prt_goal (SOME (ctxt, (i, 
349 
{statement = ((_, pos), _, _), messages, using, goal, before_qed = _, after_qed = _}))) = 

17359  350 
pretty_facts "using " ctxt 
351 
(if mode <> Backward orelse null using then NONE else SOME using) @ 

21442  352 
[Pretty.str ("goal" ^ 
353 
description [levels_up (i div 2), subgoals (Thm.nprems_of goal)] ^ ":")] @ 

23639  354 
pretty_goals_local ctxt Markup.subgoal 
24543  355 
(true, ! show_main_goal) (! Display.goals_limit) goal @ 
25958  356 
(map (fn msg => Position.setmp_thread_data pos msg ()) (rev messages)) 
17359  357 
 prt_goal NONE = []; 
6848  358 

17359  359 
val prt_ctxt = 
360 
if ! verbose orelse mode = Forward then ProofContext.pretty_context context 

18670  361 
else if mode = Backward then ProofContext.pretty_ctxt context 
7575  362 
else []; 
17359  363 
in 
364 
[Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^ 

365 
(if ! verbose then ", depth " ^ string_of_int (level state div 2  1) else "")), 

366 
Pretty.str ""] @ 

367 
(if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @ 

368 
(if ! verbose orelse mode = Forward then 

369 
pretty_facts "" context facts @ prt_goal (try find_goal state) 

370 
else if mode = Chain then pretty_facts "picking " context facts 

371 
else prt_goal (try find_goal state)) 

372 
end; 

5820  373 

12085  374 
fun pretty_goals main state = 
19188  375 
let val (ctxt, (_, goal)) = get_goal state 
23639  376 
in pretty_goals_local ctxt Markup.none (false, main) (! Display.goals_limit) goal end; 
10320  377 

5820  378 

379 

380 
(** proof steps **) 

381 

17359  382 
(* refine via method *) 
5820  383 

8234  384 
local 
385 

16146  386 
fun goalN i = "goal" ^ string_of_int i; 
387 
fun goals st = map goalN (1 upto Thm.nprems_of st); 

388 

389 
fun no_goal_cases st = map (rpair NONE) (goals st); 

390 

391 
fun goal_cases st = 

18607  392 
RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st)); 
16146  393 

25958  394 
fun apply_method current_context pos meth state = 
6848  395 
let 
24556  396 
val (goal_ctxt, (_, {statement, messages = _, using, goal, before_qed, after_qed})) = 
24543  397 
find_goal state; 
25958  398 
val ctxt = if current_context then context_of state else goal_ctxt; 
16146  399 
in 
25958  400 
Method.apply pos meth ctxt using goal > Seq.map (fn (meth_cases, goal') => 
6848  401 
state 
16146  402 
> map_goal 
18475  403 
(ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #> 
404 
ProofContext.add_cases true meth_cases) 

24556  405 
(K (statement, [], using, goal', before_qed, after_qed))) 
16146  406 
end; 
5820  407 

19188  408 
fun select_goals n meth state = 
19224  409 
state 
410 
> (#2 o #2 o get_goal) 

21687  411 
> ALLGOALS Goal.conjunction_tac 
19224  412 
> Seq.maps (fn goal => 
19188  413 
state 
21687  414 
> Seq.lift set_goal (Goal.extract 1 n goal > Seq.maps (Goal.conjunction_tac 1)) 
19188  415 
> Seq.maps meth 
416 
> Seq.maps (fn state' => state' 

417 
> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal)) 

23360  418 
> Seq.maps (apply_method true Position.none (K Method.succeed))); 
19188  419 

17112  420 
fun apply_text cc text state = 
421 
let 

422 
val thy = theory_of state; 

23360  423 
val pos_of = #2 o Args.dest_src; 
17112  424 

23360  425 
fun eval (Method.Basic (m, pos)) = apply_method cc pos m 
426 
 eval (Method.Source src) = apply_method cc (pos_of src) (Method.method thy src) 

427 
 eval (Method.Source_i src) = apply_method cc (pos_of src) (Method.method_i thy src) 

17112  428 
 eval (Method.Then txts) = Seq.EVERY (map eval txts) 
429 
 eval (Method.Orelse txts) = Seq.FIRST (map eval txts) 

430 
 eval (Method.Try txt) = Seq.TRY (eval txt) 

19188  431 
 eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt) 
432 
 eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt); 

17112  433 
in eval text state end; 
434 

8234  435 
in 
436 

17112  437 
val refine = apply_text true; 
438 
val refine_end = apply_text false; 

8234  439 

18908  440 
fun refine_insert [] = I 
23360  441 
 refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths), Position.none)); 
18908  442 

8234  443 
end; 
444 

5820  445 

17359  446 
(* refine via subproof *) 
447 

20208  448 
fun goal_tac rule = 
21687  449 
Goal.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW 
450 
(Goal.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) => 

18186  451 
if can Logic.unprotect (Logic.strip_assums_concl goal) then 
452 
Tactic.etac Drule.protectI i 

453 
else all_tac))); 

11816  454 

19915  455 
fun refine_goals print_rule inner raw_rules state = 
456 
let 

457 
val (outer, (_, goal)) = get_goal state; 

20208  458 
fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st); 
19915  459 
in 
460 
raw_rules 

20309  461 
> ProofContext.goal_export inner outer 
462 
> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state) 

19915  463 
end; 
17359  464 

6932  465 

17359  466 
(* conclude_goal *) 
6932  467 

28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset

468 
fun conclude_goal ctxt goal propss = 
5820  469 
let 
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset

470 
val thy = ProofContext.theory_of ctxt; 
24920  471 
val string_of_term = Syntax.string_of_term ctxt; 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

472 
val string_of_thm = ProofContext.string_of_thm ctxt; 
5820  473 

17359  474 
val ngoals = Thm.nprems_of goal; 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

475 
val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks 
23639  476 
(pretty_goals_local ctxt Markup.none (true, ! show_main_goal) (! Display.goals_limit) goal @ 
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 metaconjunctions 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 metaconjunctions 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 nontrivial 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 HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

521 
val match_bind = gen_bind (ProofContext.match_bind false); 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

522 
val match_bind_i = gen_bind (ProofContext.match_bind_i false); 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

523 
val let_bind = gen_bind (ProofContext.match_bind true); 
33e2bd53aec3
support HindleyMilner 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 

18670  533 
fun gen_fix add_fixes args = 
17359  534 
assert_forward 
19846  535 
#> map_context (snd o add_fixes args) 
17359  536 
#> put_facts NONE; 
5820  537 

16813  538 
in 
539 

18670  540 
val fix = gen_fix ProofContext.add_fixes; 
541 
val fix_i = gen_fix ProofContext.add_fixes_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 

17359  622 
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state = 
17112  623 
state 
624 
> assert_forward 

625 
> map_context_result (note_ctxt (Attrib.map_facts (prep_atts (theory_of state)) args)) 

626 
> these_factss (more_facts state) 

17359  627 
> opt_chain 
628 
> opt_result; 

17112  629 

630 
in 

631 

21442  632 
val note_thmss = gen_thmss (ProofContext.note_thmss "") (K []) I #2 Attrib.attribute; 
633 
val note_thmss_i = gen_thmss (ProofContext.note_thmss_i "") (K []) I #2 (K I); 

17112  634 

635 
val from_thmss = 

21442  636 
gen_thmss (ProofContext.note_thmss "") (K []) chain #2 Attrib.attribute o no_binding; 
637 
val from_thmss_i = gen_thmss (ProofContext.note_thmss_i "") (K []) chain #2 (K I) o no_binding; 

17112  638 

639 
val with_thmss = 

21442  640 
gen_thmss (ProofContext.note_thmss "") the_facts chain #2 Attrib.attribute o no_binding; 
641 
val with_thmss_i = gen_thmss (ProofContext.note_thmss_i "") the_facts chain #2 (K I) o no_binding; 

17359  642 

18808  643 
val local_results = 
21442  644 
gen_thmss (ProofContext.note_thmss_i "") (K []) I I (K I) o map (apsnd Thm.simple_fact); 
17359  645 

28965  646 
fun get_thmss state srcs = the_facts (note_thmss [((Binding.empty, []), srcs)] state); 
17112  647 

648 
end; 

649 

650 

18548  651 
(* using/unfolding *) 
17112  652 

653 
local 

654 

18548  655 
fun gen_using f g note prep_atts args state = 
17112  656 
state 
657 
> assert_backward 

21442  658 
> map_context_result 
659 
(note "" (Attrib.map_facts (prep_atts (theory_of state)) (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 

18843  673 
val using = gen_using append_using (K (K I)) ProofContext.note_thmss Attrib.attribute; 
674 
val using_i = gen_using append_using (K (K I)) ProofContext.note_thmss_i (K I); 

18826  675 
val unfolding = gen_using unfold_using unfold_goals ProofContext.note_thmss Attrib.attribute; 
676 
val unfolding_i = gen_using unfold_using unfold_goals ProofContext.note_thmss_i (K I); 

17112  677 

678 
end; 

679 

680 

681 
(* case *) 

682 

683 
local 

684 

685 
fun gen_invoke_case prep_att (name, xs, raw_atts) state = 

686 
let 

687 
val atts = map (prep_att (theory_of state)) raw_atts; 

19078  688 
val (asms, state') = state > map_context_result (fn ctxt => 
689 
ctxt > ProofContext.apply_case (ProofContext.get_case ctxt name xs)); 

28965  690 
val assumptions = asms > map (fn (a, ts) => ((Binding.name a, atts), map (rpair []) ts)); 
17112  691 
in 
692 
state' 

17359  693 
> map_context (ProofContext.qualified_names #> ProofContext.no_base_names) 
17112  694 
> assume_i assumptions 
17976  695 
> add_binds_i AutoBind.no_facts 
17112  696 
> map_context (ProofContext.restore_naming (context_of state)) 
28965  697 
> `the_facts > (fn thms => note_thmss_i [((Binding.name name, []), [(thms, [])])]) 
17112  698 
end; 
699 

700 
in 

701 

18728  702 
val invoke_case = gen_invoke_case Attrib.attribute; 
17112  703 
val invoke_case_i = gen_invoke_case (K I); 
704 

705 
end; 

706 

707 

708 

17359  709 
(** proof structure **) 
710 

711 
(* blocks *) 

712 

713 
val begin_block = 

714 
assert_forward 

715 
#> open_block 

716 
#> put_goal NONE 

717 
#> open_block; 

718 

719 
val next_block = 

720 
assert_forward 

721 
#> close_block 

722 
#> open_block 

723 
#> put_goal NONE 

724 
#> put_facts NONE; 

725 

726 
fun end_block state = 

727 
state 

728 
> assert_forward 

729 
> close_block 

730 
> assert_current_goal false 

731 
> close_block 

732 
> export_facts state; 

733 

734 

735 
(* subproofs *) 

736 

737 
fun proof opt_text = 

738 
assert_backward 

17859  739 
#> refine (the_default Method.default_text opt_text) 
17359  740 
#> Seq.map (using_facts [] #> enter_forward); 
741 

23360  742 
fun end_proof bot txt state = 
743 
state 

744 
> assert_forward 

745 
> assert_bottom bot 

746 
> close_block 

747 
> assert_current_goal true 

748 
> using_facts [] 

749 
> `before_qed > (refine o the_default Method.succeed_text) 

25958  750 
> Seq.maps (refine (Method.finish_text txt (Position.thread_data ()))); 
17359  751 

29383  752 
fun check_result msg sq = 
753 
(case Seq.pull sq of 

754 
NONE => error msg 

755 
 SOME (s, _) => s); 

756 

757 
fun check_finish sq = check_result "Failed to finish proof" sq; 

758 

17359  759 

760 
(* unstructured refinement *) 

761 

23360  762 
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i), Position.none)); 
763 
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i), Position.none)); 

17359  764 

765 
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []); 

766 
fun apply_end text = assert_forward #> refine_end text; 

767 

768 

769 

17112  770 
(** goals **) 
771 

17359  772 
(* generic goals *) 
773 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

774 
local 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

775 

19846  776 
fun implicit_vars dest add props = 
777 
let 

778 
val (explicit_vars, props') = take_prefix (can dest) props >> map dest; 

779 
val vars = rev (subtract (op =) explicit_vars (fold add props [])); 

780 
val _ = 

781 
if null vars then () 

782 
else warning ("Goal statement contains unbound schematic variable(s): " ^ 

783 
commas_quote (map (Term.string_of_vname o fst) vars)); 

784 
in (rev vars, props') end; 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

785 

5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

786 
fun refine_terms n = 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

787 
refine (Method.Basic (K (Method.RAW_METHOD 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

788 
(K (HEADGOAL (PRECISE_CONJUNCTS n 
23360  789 
(HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI)))))))), Position.none)) 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

790 
#> Seq.hd; 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

791 

5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

792 
in 
17359  793 

17859  794 
fun generic_goal prepp kind before_qed after_qed raw_propp state = 
5820  795 
let 
17359  796 
val thy = theory_of state; 
23418  797 
val cert = Thm.cterm_of thy; 
17359  798 
val chaining = can assert_chain state; 
25958  799 
val pos = Position.thread_data (); 
17359  800 

801 
val ((propss, after_ctxt), goal_state) = 

5936  802 
state 
803 
> assert_forward_or_chain 

804 
> enter_forward 

17359  805 
> open_block 
17859  806 
> 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

807 
val props = flat propss; 
15703  808 

19846  809 
val (_, props') = 
810 
implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props; 

811 
val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props'; 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

812 

5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

813 
val propss' = map (Logic.mk_term o Var) vars :: propss; 
23418  814 
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

815 
val goal = 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

816 
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

817 
> 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

818 
val statement = ((kind, pos), propss', Thm.term_of goal); 
18124  819 
val after_qed' = after_qed >> (fn after_local => 
820 
fn results => map_context after_ctxt #> after_local results); 

5820  821 
in 
17359  822 
goal_state 
21727  823 
> map_context (init_context #> Variable.set_body true) 
28410  824 
> put_goal (SOME (make_goal (statement, [], [], Goal.init goal, before_qed, after_qed'))) 
17359  825 
> map_context (ProofContext.auto_bind_goal props) 
21565  826 
> chaining ? (`the_facts #> using_facts) 
17359  827 
> put_facts NONE 
828 
> open_block 

829 
> put_goal NONE 

5820  830 
> enter_backward 
23418  831 
> not (null vars) ? refine_terms (length goal_propss) 
23360  832 
> null props ? (refine (Method.Basic (Method.assumption, Position.none)) #> Seq.hd) 
5820  833 
end; 
834 

29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset

835 
fun generic_qed after_ctxt state = 
12503  836 
let 
25958  837 
val (goal_ctxt, {statement, goal, after_qed, ...}) = current_goal state; 
8617
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

838 
val outer_state = state > close_block; 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

839 
val outer_ctxt = context_of outer_state; 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

840 

28410  841 
val ((_, pos), stmt, _) = statement; 
18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset

842 
val props = 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

843 
flat (tl stmt) 
19915  844 
> Variable.exportT_terms goal_ctxt outer_ctxt; 
17359  845 
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

846 
tl (conclude_goal goal_ctxt goal stmt) 
20309  847 
> burrow (ProofContext.export goal_ctxt outer_ctxt); 
25958  848 

849 
val (after_local, after_global) = after_qed; 

29383  850 
fun after_local' x y = Position.setmp_thread_data pos (fn () => after_local x y) (); 
25958  851 
fun after_global' x y = Position.setmp_thread_data pos (fn () => after_global x y) (); 
17359  852 
in 
853 
outer_state 

29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset

854 
> map_context (after_ctxt props) 
25958  855 
> pair ((after_local', after_global'), results) 
17359  856 
end; 
857 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

858 
end; 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

859 

9469  860 

17359  861 
(* local goals *) 
862 

17859  863 
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state = 
17359  864 
let 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

865 
val thy = theory_of state; 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

866 
val ((names, attss), propp) = 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

867 
Attrib.map_specs (prep_att thy) stmt > split_list >> split_list; 
17359  868 

18124  869 
fun after_qed' results = 
18808  870 
local_results ((names ~~ attss) ~~ results) 
17359  871 
#> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit)) 
18124  872 
#> after_qed results; 
5820  873 
in 
17359  874 
state 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

875 
> 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

876 
> tap (Variable.warn_extra_tfrees (context_of state) o context_of) 
5820  877 
end; 
878 

29383  879 
fun local_qeds txt = 
880 
end_proof false txt 

881 
#> 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

882 
(fn ((after_qed, _), results) => after_qed results)); 
5820  883 

29383  884 
fun local_qed txt = local_qeds txt #> check_finish; 
885 

5820  886 

17359  887 
(* global goals *) 
888 

21442  889 
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

890 
init ctxt 
29383  891 
> generic_goal (prepp #> ProofContext.auto_fixes) "" before_qed (K I, after_qed) propp; 
17359  892 

21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

893 
val theorem = global_goal ProofContext.bind_propp_schematic; 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

894 
val theorem_i = global_goal ProofContext.bind_propp_schematic_i; 
12065  895 

17359  896 
fun global_qeds txt = 
897 
end_proof true txt 

29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset

898 
#> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) => 
29383  899 
after_qed results (context_of state))); 
17112  900 

29383  901 
fun global_qed txt = global_qeds txt #> check_finish; 
12959  902 

5820  903 

17359  904 
(* concluding steps *) 
17112  905 

29383  906 
fun terminal_proof qed initial terminal = 
907 
proof (SOME initial) #> Seq.maps (qed terminal) #> check_finish; 

17112  908 

29383  909 
fun local_terminal_proof (text, opt_text) = terminal_proof local_qeds text (opt_text, true); 
17112  910 
val local_default_proof = local_terminal_proof (Method.default_text, NONE); 
911 
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE); 

17359  912 
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE); 
29383  913 
val local_done_proof = terminal_proof local_qeds Method.done_text (NONE, false); 
17112  914 

29383  915 
fun global_terminal_proof (text, opt_text) = terminal_proof global_qeds text (opt_text, true); 
17112  916 
val global_default_proof = global_terminal_proof (Method.default_text, NONE); 
917 
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE); 

17359  918 
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); 
29383  919 
val global_done_proof = terminal_proof global_qeds Method.done_text (NONE, false); 
5820  920 

6896  921 

17359  922 
(* common goal statements *) 
923 

924 
local 

925 

17859  926 
fun gen_have prep_att prepp before_qed after_qed stmt int = 
927 
local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt; 

6896  928 

17859  929 
fun gen_show prep_att prepp before_qed after_qed stmt int state = 
17359  930 
let 
931 
val testing = ref false; 

932 
val rule = ref (NONE: thm option); 

933 
fun fail_msg ctxt = 

29383  934 
"Local statement will fail to refine any pending goal" :: 
17359  935 
(case ! rule of NONE => []  SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th]) 
936 
> cat_lines; 

6896  937 

17359  938 
fun print_results ctxt res = 
939 
if ! testing then () else ProofDisplay.print_results int ctxt res; 

940 
fun print_rule ctxt th = 

941 
if ! testing then rule := SOME th 

942 
else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th) 

943 
else (); 

944 
val test_proof = 

29383  945 
try (local_skip_proof true) 
28289  946 
> setmp_noncritical testing true 
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset

947 
> Exn.capture; 
6896  948 

18124  949 
fun after_qed' results = 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset

950 
refine_goals print_rule (context_of state) (flat results) 
29383  951 
#> check_result "Failed to refine any pending goal" 
952 
#> after_qed results; 

17359  953 
in 
954 
state 

17859  955 
> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt 
21565  956 
> int ? (fn goal_state => 
17359  957 
(case test_proof goal_state of 
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset

958 
Exn.Result (SOME _) => goal_state 
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset

959 
 Exn.Result NONE => error (fail_msg (context_of goal_state)) 
28443  960 
 Exn.Exn Exn.Interrupt => raise Exn.Interrupt 
28458  961 
 Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))]))) 
17359  962 
end; 
963 

964 
in 

965 

18728  966 
val have = gen_have Attrib.attribute ProofContext.bind_propp; 
17359  967 
val have_i = gen_have (K I) ProofContext.bind_propp_i; 
18728  968 
val show = gen_show Attrib.attribute ProofContext.bind_propp; 
17359  969 
val show_i = gen_show (K I) ProofContext.bind_propp_i; 
6896  970 

5820  971 
end; 
17359  972 

28410  973 

29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

974 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

975 
(** future proofs **) 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

976 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

977 
(* relevant proof states *) 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

978 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

979 
fun is_schematic t = 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

980 
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

981 
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

982 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

983 
fun schematic_goal state = 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

984 
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

985 
in is_schematic prop end; 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

986 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

987 
fun is_relevant state = 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

988 
(case try find_goal state of 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

989 
NONE => true 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

990 
 SOME (_, (_, {statement = (_, _, prop), goal, ...})) => 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

991 
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

992 

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 
(* full proofs *) 
28410  995 

29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

996 
local 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

997 

29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

998 
fun future_proof done get_context fork_proof state = 
28410  999 
let 
29381
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset

1000 
val _ = assert_backward state; 
28410  1001 
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

1002 
val {statement as (kind, propss, prop), messages, using, goal, before_qed, after_qed} = goal; 
28410  1003 

29383  1004 
val _ = is_relevant state andalso error "Cannot fork relevant proof"; 
1005 

29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1006 
val prop' = Logic.protect prop; 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1007 
val statement' = (kind, [[], [prop']], prop'); 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1008 
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

1009 
(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

1010 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1011 
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

1012 
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

1013 
val after_qed' = (after_local', after_global'); 
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1014 
val this_name = ProofContext.full_bname goal_ctxt AutoBind.thisN; 
28410  1015 

28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1016 
val result_ctxt = 
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1017 
state 
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1018 
> map_contexts (Variable.declare_term prop) 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1019 
> 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

1020 
> fork_proof; 
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1021 

29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1022 
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

1023 
ProofContext.get_fact_single (get_context x) (Facts.named this_name)); 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1024 
val finished_goal = exception_trace (fn () => Goal.future_result goal_ctxt future_thm prop'); 
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1025 
val state' = 
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1026 
state 
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1027 
> 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

1028 
> done; 
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1029 
in (Future.map #1 result_ctxt, state') end; 
28410  1030 

29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1031 
in 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1032 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1033 
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

1034 
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

1035 

17359  1036 
end; 
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1037 

29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1038 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1039 
(* terminal proofs *) 
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 
local 
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 
fun future_terminal_proof proof1 proof2 meths int state = 
29381
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset

1044 
if int orelse is_relevant state orelse not (Future.enabled ()) 
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1045 
then proof1 meths state 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1046 
else snd (state > proof2 (fn state' => Future.fork_pri ~1 (fn () => ((), proof1 meths state')))); 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1047 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1048 
in 
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 
fun local_future_terminal_proof x = 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1051 
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

1052 

c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1053 
fun global_future_terminal_proof x = 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1054 
future_terminal_proof global_terminal_proof global_future_proof x; 
29350  1055 

29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1056 
end; 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1057 

29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1058 
end; 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

1059 