author  wenzelm 
Wed, 07 Jan 2009 12:09:39 +0100  
changeset 29381  45d77aeb1608 
parent 29364  cea7b4034461 
child 29383  223f18cfbb32 
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) 
19995  33 
val schematic_goal: state > bool 
16539  34 
val show_main_goal: bool ref 
6529  35 
val verbose: bool ref 
12423  36 
val pretty_state: int > state > Pretty.T list 
10360  37 
val pretty_goals: bool > state > Pretty.T list 
17112  38 
val refine: Method.text > state > state Seq.seq 
39 
val refine_end: Method.text > state > state Seq.seq 

18908  40 
val refine_insert: thm list > state > state 
20208  41 
val goal_tac: thm > int > tactic 
17359  42 
val refine_goals: (context > thm > unit) > context > thm list > state > state Seq.seq 
5936  43 
val match_bind: (string list * string) list > state > state 
44 
val match_bind_i: (term list * term) list > state > state 

8617
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

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

46 
val let_bind_i: (term list * term) list > state > state 
28965  47 
val fix: (Binding.T * string option * mixfix) list > state > state 
48 
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

49 
val assm: Assumption.export > 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

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

51 
val assm_i: Assumption.export > 
28965  52 
((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

53 
val assume: (Attrib.binding * (string * string list) list) list > state > state 
28965  54 
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

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

56 
val presume: (Attrib.binding * (string * string list) list) list > state > state 
28965  57 
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

58 
state > state 
28965  59 
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

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

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

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

65 
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

66 
val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list > state > state 
28965  67 
val note_thmss_i: ((Binding.T * attribute list) * 
18728  68 
(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 from_thmss: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  70 
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

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

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

75 
val unfolding: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  76 
val unfolding_i: ((thm list * attribute list) list) list > state > state 
17112  77 
val invoke_case: string * string option list * Attrib.src list > state > state 
18728  78 
val invoke_case_i: string * string option list * attribute list > state > state 
17359  79 
val begin_block: state > state 
80 
val next_block: state > state 

20309  81 
val end_block: state > state 
17112  82 
val proof: Method.text option > state > state Seq.seq 
83 
val defer: int option > state > state Seq.seq 

84 
val prefer: int > state > state Seq.seq 

85 
val apply: Method.text > state > state Seq.seq 

86 
val apply_end: Method.text > state > state Seq.seq 

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

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

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

97 
val global_qed: Method.text option * bool > state > context 
17359  98 
val local_terminal_proof: Method.text * Method.text option > state > state Seq.seq 
99 
val local_default_proof: state > state Seq.seq 

100 
val local_immediate_proof: state > state Seq.seq 

101 
val local_done_proof: state > state Seq.seq 

102 
val local_skip_proof: bool > state > state Seq.seq 

20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

103 
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

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

105 
val global_immediate_proof: state > context 
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 
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

107 
val global_skip_proof: bool > state > context 
18124  108 
val have: Method.text option > (thm list list > state > state Seq.seq) > 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

109 
(Attrib.binding * (string * string list) list) list > bool > state > state 
18124  110 
val have_i: Method.text option > (thm list list > state > state Seq.seq) > 
28965  111 
((Binding.T * attribute list) * (term * term list) list) list > bool > state > state 
18124  112 
val show: Method.text option > (thm list list > state > state Seq.seq) > 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

113 
(Attrib.binding * (string * string list) list) list > bool > state > state 
18124  114 
val show_i: Method.text option > (thm list list > state > state Seq.seq) > 
28965  115 
((Binding.T * attribute list) * (term * term list) list) list > bool > state > state 
28452  116 
val is_relevant: state > bool 
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

117 
val future_proof: (state > ('a * context) future) > state > 'a future * context 
29381
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset

118 
val future_terminal_proof: Method.text * Method.text option > bool > state > context 
5820  119 
end; 
120 

13377  121 
structure Proof: PROOF = 
5820  122 
struct 
123 

20309  124 
type context = Context.proof; 
17112  125 
type method = Method.method; 
16813  126 

5820  127 

128 
(** proof state **) 

129 

17359  130 
(* datatype state *) 
5820  131 

17112  132 
datatype mode = Forward  Chain  Backward; 
5820  133 

17359  134 
datatype state = 
135 
State of node Stack.T 

136 
and node = 

7176  137 
Node of 
138 
{context: context, 

139 
facts: thm list option, 

140 
mode: mode, 

17359  141 
goal: goal option} 
142 
and goal = 

143 
Goal of 

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

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

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

17859  149 
before_qed: Method.text option, 
18124  150 
after_qed: 
151 
(thm list list > state > state Seq.seq) * 

20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

152 
(thm list list > context > context)}; 
17359  153 

24543  154 
fun make_goal (statement, messages, using, goal, before_qed, after_qed) = 
155 
Goal {statement = statement, messages = messages, using = using, goal = goal, 

17859  156 
before_qed = before_qed, after_qed = after_qed}; 
5820  157 

7176  158 
fun make_node (context, facts, mode, goal) = 
159 
Node {context = context, facts = facts, mode = mode, goal = goal}; 

160 

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

5820  163 

21727  164 
val init_context = 
165 
ProofContext.set_stmt true #> ProofContext.reset_naming; 

166 

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

167 
fun init ctxt = 
21727  168 
State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE))); 
5820  169 

17359  170 
fun current (State st) = Stack.top st > (fn Node node => node); 
21274  171 
fun map_current f (State st) = State (Stack.map_top (map_node f) st); 
28278  172 
fun map_all f (State st) = State (Stack.map_all (map_node f) st); 
12045  173 

5820  174 

175 

176 
(** basic proof state operations **) 

177 

17359  178 
(* block structure *) 
179 

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

181 

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

17359  184 

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

186 

187 
fun assert_bottom b state = 

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

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

17359  191 
else state 
192 
end; 

193 

194 

5820  195 
(* context *) 
196 

17359  197 
val context_of = #context o current; 
5820  198 
val theory_of = ProofContext.theory_of o context_of; 
199 

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

5820  202 

17359  203 
fun map_context_result f state = 
17859  204 
f (context_of state) > (fn ctxt => map_context (K ctxt) state); 
5820  205 

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

10809  208 
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

209 
val put_thms = map_context oo ProofContext.put_thms; 
5820  210 

211 

212 
(* facts *) 

213 

17359  214 
val get_facts = #facts o current; 
215 

216 
fun the_facts state = 

217 
(case get_facts state of SOME facts => facts 

18678  218 
 NONE => error "No current facts available"); 
5820  219 

9469  220 
fun the_fact state = 
17359  221 
(case the_facts state of [thm] => thm 
18678  222 
 _ => error "Single theorem expected"); 
7605  223 

17359  224 
fun put_facts facts = 
19078  225 
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

226 
put_thms true (AutoBind.thisN, facts); 
5820  227 

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

229 
(named_factss, state > put_facts (SOME (maps snd named_factss @ more_facts))); 
5820  230 

17359  231 
fun export_facts inner outer = 
232 
(case get_facts inner of 

20309  233 
NONE => put_facts NONE outer 
17359  234 
 SOME thms => 
235 
thms 

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

5820  238 

239 

240 
(* mode *) 

241 

17359  242 
val get_mode = #mode o current; 
5820  243 
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal)); 
244 

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

247 
fun assert_mode pred state = 

248 
let val mode = get_mode state in 

249 
if pred mode then state 

18678  250 
else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode") 
5820  251 
end; 
252 

19308  253 
val assert_forward = assert_mode (fn mode => mode = Forward); 
254 
val assert_chain = assert_mode (fn mode => mode = Chain); 

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

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

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

5820  258 

17359  259 
val enter_forward = put_mode Forward; 
260 
val enter_chain = put_mode Chain; 

261 
val enter_backward = put_mode Backward; 

5820  262 

17359  263 

264 
(* current goal *) 

265 

266 
fun current_goal state = 

267 
(case current state of 

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

18678  269 
 _ => error "No current goal!"); 
5820  270 

17359  271 
fun assert_current_goal g state = 
272 
let val g' = can current_goal state in 

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

17359  275 
else state 
276 
end; 

6776  277 

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

17859  280 
val before_qed = #before_qed o #2 o current_goal; 
281 

17359  282 

283 
(* nested goal *) 

5820  284 

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

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

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

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

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

293 
 map_goal _ _ state = state; 

5820  294 

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

19188  297 

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

300 

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

17359  303 

304 
local 

305 
fun find i state = 

306 
(case try current_goal state of 

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

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

311 
fun get_goal state = 

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

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

5820  314 

19995  315 
fun schematic_goal state = 
28410  316 
let val (_, (_, {statement = (_, _, prop), ...})) = find_goal state in 
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

317 
Term.exists_subterm Term.is_Var prop orelse 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

318 
Term.exists_type (Term.exists_subtype Term.is_TVar) prop 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

319 
end; 
19995  320 

5820  321 

322 

12423  323 
(** pretty_state **) 
5820  324 

13869  325 
val show_main_goal = ref false; 
16539  326 
val verbose = ProofContext.verbose; 
13698  327 

24961  328 
val pretty_goals_local = Display.pretty_goals_aux o Syntax.pp; 
12085  329 

15531  330 
fun pretty_facts _ _ NONE = [] 
331 
 pretty_facts s ctxt (SOME ths) = 

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

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

338 
fun levels_up 0 = "" 

17359  339 
 levels_up 1 = "1 level up" 
340 
 levels_up i = string_of_int i ^ " levels up"; 

5820  341 

11556  342 
fun subgoals 0 = "" 
17359  343 
 subgoals 1 = "1 subgoal" 
344 
 subgoals n = string_of_int n ^ " subgoals"; 

345 

346 
fun description strs = 

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

24550  350 
fun prt_goal (SOME (ctxt, (i, 
28410  351 
{statement = ((_, pos), _, _), messages, using, goal, before_qed, after_qed}))) = 
17359  352 
pretty_facts "using " ctxt 
353 
(if mode <> Backward orelse null using then NONE else SOME using) @ 

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

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

17359  361 
val prt_ctxt = 
362 
if ! verbose orelse mode = Forward then ProofContext.pretty_context context 

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

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

368 
Pretty.str ""] @ 

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

370 
(if ! verbose orelse mode = Forward then 

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

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

373 
else prt_goal (try find_goal state)) 

374 
end; 

5820  375 

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

5820  380 

381 

382 
(** proof steps **) 

383 

17359  384 
(* refine via method *) 
5820  385 

8234  386 
local 
387 

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

390 

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

392 

393 
fun goal_cases st = 

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

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

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

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

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

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

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

17112  422 
fun apply_text cc text state = 
423 
let 

424 
val thy = theory_of state; 

23360  425 
val pos_of = #2 o Args.dest_src; 
17112  426 

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

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

17112  430 
 eval (Method.Then txts) = Seq.EVERY (map eval txts) 
431 
 eval (Method.Orelse txts) = Seq.FIRST (map eval txts) 

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

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

17112  435 
in eval text state end; 
436 

8234  437 
in 
438 

17112  439 
val refine = apply_text true; 
440 
val refine_end = apply_text false; 

8234  441 

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

8234  445 
end; 
446 

5820  447 

17359  448 
(* refine via subproof *) 
449 

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

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

455 
else all_tac))); 

11816  456 

19915  457 
fun refine_goals print_rule inner raw_rules state = 
458 
let 

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

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

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

19915  465 
end; 
17359  466 

6932  467 

17359  468 
(* conclude_goal *) 
6932  469 

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

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

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

474 
val string_of_thm = ProofContext.string_of_thm ctxt; 
5820  475 

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

477 
val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks 
23639  478 
(pretty_goals_local ctxt Markup.none (true, ! show_main_goal) (! Display.goals_limit) goal @ 
479 
[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

480 

9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

481 
val extra_hyps = Assumption.extra_hyps ctxt goal; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

482 
val _ = null extra_hyps orelse 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

483 
error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term extra_hyps)); 
5820  484 

23418  485 
fun lost_structure () = error ("Lost goal structure:\n" ^ string_of_thm goal); 
486 

23782
4dd0ba632e40
Proof terms for metaconjunctions are now normalized before
berghofe
parents:
23639
diff
changeset

487 
val th = Goal.conclude 
23806  488 
(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

489 
handle THM _ => lost_structure (); 
23418  490 
val goal_propss = filter_out null propss; 
491 
val results = 

492 
Conjunction.elim_balanced (length goal_propss) th 

493 
> map2 Conjunction.elim_balanced (map length goal_propss) 

494 
handle THM _ => lost_structure (); 

495 
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

496 
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

497 
val _ = Thm.check_shyps (Variable.sorts_of ctxt) th; 
23418  498 

499 
fun recover_result ([] :: pss) thss = [] :: recover_result pss thss 

500 
 recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss 

501 
 recover_result [] [] = [] 

502 
 recover_result _ _ = lost_structure (); 

503 
in recover_result propss results end; 

5820  504 

505 

506 

507 
(*** structured proof commands ***) 

508 

17112  509 
(** context elements **) 
5820  510 

17112  511 
(* bindings *) 
5820  512 

16813  513 
local 
514 

17359  515 
fun gen_bind bind args state = 
5820  516 
state 
517 
> assert_forward 

18308  518 
> map_context (bind args #> snd) 
17359  519 
> put_facts NONE; 
5820  520 

16813  521 
in 
522 

8617
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

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

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

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

526 
val let_bind_i = gen_bind (ProofContext.match_bind_i true); 
5820  527 

16813  528 
end; 
529 

5820  530 

17359  531 
(* fix *) 
9196  532 

12714  533 
local 
534 

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

16813  540 
in 
541 

18670  542 
val fix = gen_fix ProofContext.add_fixes; 
543 
val fix_i = gen_fix ProofContext.add_fixes_i; 

5820  544 

16813  545 
end; 
546 

5820  547 

17359  548 
(* assume etc. *) 
5820  549 

16813  550 
local 
551 

17112  552 
fun gen_assume asm prep_att exp args state = 
5820  553 
state 
554 
> assert_forward 

17112  555 
> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args)) 
17359  556 
> these_factss [] > #2; 
6932  557 

16813  558 
in 
559 

18728  560 
val assm = gen_assume ProofContext.add_assms Attrib.attribute; 
18670  561 
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

562 
val assume = assm Assumption.assume_export; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

563 
val assume_i = assm_i Assumption.assume_export; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

564 
val presume = assm Assumption.presume_export; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

565 
val presume_i = assm_i Assumption.presume_export; 
5820  566 

16813  567 
end; 
568 

7271  569 

17359  570 
(* def *) 
11891  571 

16813  572 
local 
573 

20913  574 
fun gen_def prep_att prep_vars prep_binds args state = 
11891  575 
let 
576 
val _ = assert_forward state; 

17112  577 
val thy = theory_of state; 
20913  578 
val ctxt = context_of state; 
11891  579 

20913  580 
val (raw_name_atts, (raw_vars, raw_rhss)) = args > split_list > split_list; 
581 
val name_atts = map (apsnd (map (prep_att thy))) raw_name_atts; 

11891  582 
in 
20913  583 
state 
584 
> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars)) 

585 
>> map (fn (x, _, mx) => (x, mx)) 

586 
> (fn vars => 

587 
map_context_result (prep_binds false (map swap raw_rhss)) 

588 
#> (fn rhss => map_context_result (LocalDefs.add_defs (vars ~~ (name_atts ~~ rhss))))) 

589 
> (put_facts o SOME o map (#2 o #2)) 

11891  590 
end; 
591 

16813  592 
in 
593 

20913  594 
val def = gen_def Attrib.attribute ProofContext.read_vars ProofContext.match_bind; 
595 
val def_i = gen_def (K I) ProofContext.cert_vars ProofContext.match_bind_i; 

11891  596 

16813  597 
end; 
598 

11891  599 

8374  600 

17112  601 
(** facts **) 
5820  602 

17359  603 
(* chain *) 
5820  604 

24011  605 
fun clean_facts ctxt = 
24050  606 
put_facts (SOME (filter_out Thm.is_dummy (the_facts ctxt))) ctxt; 
24011  607 

17359  608 
val chain = 
609 
assert_forward 

24011  610 
#> clean_facts 
17359  611 
#> enter_chain; 
5820  612 

17359  613 
fun chain_facts facts = 
614 
put_facts (SOME facts) 

615 
#> chain; 

5820  616 

617 

17359  618 
(* note etc. *) 
17112  619 

28965  620 
fun no_binding args = map (pair (Binding.empty, [])) args; 
17112  621 

622 
local 

623 

17359  624 
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state = 
17112  625 
state 
626 
> assert_forward 

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

628 
> these_factss (more_facts state) 

17359  629 
> opt_chain 
630 
> opt_result; 

17112  631 

632 
in 

633 

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

17112  636 

637 
val from_thmss = 

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

17112  640 

641 
val with_thmss = 

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

17359  644 

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

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

650 
end; 

651 

652 

18548  653 
(* using/unfolding *) 
17112  654 

655 
local 

656 

18548  657 
fun gen_using f g note prep_atts args state = 
17112  658 
state 
659 
> assert_backward 

21442  660 
> map_context_result 
661 
(note "" (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args))) 

18843  662 
> (fn (named_facts, state') => 
24556  663 
state' > map_goal I (fn (statement, _, using, goal, before_qed, after_qed) => 
18843  664 
let 
665 
val ctxt = context_of state'; 

19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset

666 
val ths = maps snd named_facts; 
24556  667 
in (statement, [], f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end)); 
18548  668 

24050  669 
fun append_using _ ths using = using @ filter_out Thm.is_dummy ths; 
18878  670 
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths); 
671 
val unfold_goals = LocalDefs.unfold_goals; 

17112  672 

673 
in 

674 

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

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

17112  679 

680 
end; 

681 

682 

683 
(* case *) 

684 

685 
local 

686 

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

688 
let 

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

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

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

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

702 
in 

703 

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

707 
end; 

708 

709 

710 

17359  711 
(** proof structure **) 
712 

713 
(* blocks *) 

714 

715 
val begin_block = 

716 
assert_forward 

717 
#> open_block 

718 
#> put_goal NONE 

719 
#> open_block; 

720 

721 
val next_block = 

722 
assert_forward 

723 
#> close_block 

724 
#> open_block 

725 
#> put_goal NONE 

726 
#> put_facts NONE; 

727 

728 
fun end_block state = 

729 
state 

730 
> assert_forward 

731 
> close_block 

732 
> assert_current_goal false 

733 
> close_block 

734 
> export_facts state; 

735 

736 

737 
(* subproofs *) 

738 

739 
fun proof opt_text = 

740 
assert_backward 

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

23360  744 
fun end_proof bot txt state = 
745 
state 

746 
> assert_forward 

747 
> assert_bottom bot 

748 
> close_block 

749 
> assert_current_goal true 

750 
> using_facts [] 

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

25958  752 
> Seq.maps (refine (Method.finish_text txt (Position.thread_data ()))); 
17359  753 

754 

755 
(* unstructured refinement *) 

756 

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

17359  759 

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

761 
fun apply_end text = assert_forward #> refine_end text; 

762 

763 

764 

17112  765 
(** goals **) 
766 

17359  767 
(* generic goals *) 
768 

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

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

770 

19846  771 
fun implicit_vars dest add props = 
772 
let 

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

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

775 
val _ = 

776 
if null vars then () 

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

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

779 
in (rev vars, props') end; 

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

780 

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

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

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

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

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

786 

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

787 
in 
17359  788 

17859  789 
fun generic_goal prepp kind before_qed after_qed raw_propp state = 
5820  790 
let 
17359  791 
val thy = theory_of state; 
23418  792 
val cert = Thm.cterm_of thy; 
17359  793 
val chaining = can assert_chain state; 
25958  794 
val pos = Position.thread_data (); 
17359  795 

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

5936  797 
state 
798 
> assert_forward_or_chain 

799 
> enter_forward 

17359  800 
> open_block 
17859  801 
> 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

802 
val props = flat propss; 
15703  803 

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

806 
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

807 

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

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

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

811 
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

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

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

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

824 
> put_goal NONE 

5820  825 
> enter_backward 
23418  826 
> not (null vars) ? refine_terms (length goal_propss) 
23360  827 
> null props ? (refine (Method.Basic (Method.assumption, Position.none)) #> Seq.hd) 
5820  828 
end; 
829 

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

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

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

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

835 

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

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

838 
flat (tl stmt) 
19915  839 
> Variable.exportT_terms goal_ctxt outer_ctxt; 
17359  840 
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

841 
tl (conclude_goal goal_ctxt goal stmt) 
20309  842 
> burrow (ProofContext.export goal_ctxt outer_ctxt); 
25958  843 

844 
val (after_local, after_global) = after_qed; 

845 
fun after_local' x y = Position.setmp_thread_data_seq pos (fn () => after_local x y) (); 

846 
fun after_global' x y = Position.setmp_thread_data pos (fn () => after_global x y) (); 

17359  847 
in 
848 
outer_state 

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

849 
> map_context (after_ctxt props) 
25958  850 
> pair ((after_local', after_global'), results) 
17359  851 
end; 
852 

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

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

854 

9469  855 

17359  856 
(* local goals *) 
857 

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

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

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

862 
Attrib.map_specs (prep_att thy) stmt > split_list >> split_list; 
17359  863 

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

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

871 
> tap (Variable.warn_extra_tfrees (context_of state) o context_of) 
5820  872 
end; 
873 

17359  874 
fun local_qed txt = 
20309  875 
end_proof false txt #> 
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset

876 
Seq.maps (generic_qed ProofContext.auto_bind_facts #> 
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset

877 
(fn ((after_qed, _), results) => after_qed results)); 
5820  878 

879 

17359  880 
(* global goals *) 
881 

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

883 
init ctxt 
21442  884 
> generic_goal (prepp #> ProofContext.auto_fixes) "" 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

885 
before_qed (K Seq.single, after_qed) propp; 
17359  886 

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

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

888 
val theorem_i = global_goal ProofContext.bind_propp_schematic_i; 
12065  889 

18678  890 
fun check_result msg sq = 
17112  891 
(case Seq.pull sq of 
18678  892 
NONE => error msg 
19475  893 
 SOME (s', sq') => Seq.cons s' sq'); 
17112  894 

17359  895 
fun global_qeds txt = 
896 
end_proof true txt 

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

897 
#> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) => 
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

898 
after_qed results (context_of state))) 
17112  899 
> Seq.DETERM; (*backtracking may destroy theory!*) 
900 

18678  901 
fun global_qed txt = 
902 
global_qeds txt 

903 
#> check_result "Failed to finish proof" 

904 
#> Seq.hd; 

12959  905 

5820  906 

17359  907 
(* concluding steps *) 
17112  908 

17359  909 
fun local_terminal_proof (text, opt_text) = 
910 
proof (SOME text) #> Seq.maps (local_qed (opt_text, true)); 

17112  911 

912 
val local_default_proof = local_terminal_proof (Method.default_text, NONE); 

913 
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE); 

17359  914 
val local_done_proof = proof (SOME Method.done_text) #> Seq.maps (local_qed (NONE, false)); 
915 
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE); 

17112  916 

18678  917 
fun global_term_proof immed (text, opt_text) = 
918 
proof (SOME text) 

919 
#> check_result "Terminal proof method failed" 

920 
#> Seq.maps (global_qeds (opt_text, immed)) 

921 
#> check_result "Failed to finish proof (after successful terminal method)" 

922 
#> Seq.hd; 

17112  923 

924 
val global_terminal_proof = global_term_proof true; 

925 
val global_default_proof = global_terminal_proof (Method.default_text, NONE); 

926 
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE); 

927 
val global_done_proof = global_term_proof false (Method.done_text, NONE); 

17359  928 
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); 
5820  929 

6896  930 

17359  931 
(* common goal statements *) 
932 

933 
local 

934 

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

6896  937 

17859  938 
fun gen_show prep_att prepp before_qed after_qed stmt int state = 
17359  939 
let 
940 
val testing = ref false; 

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

942 
fun fail_msg ctxt = 

943 
"Local statement will fail to solve any pending goal" :: 

944 
(case ! rule of NONE => []  SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th]) 

945 
> cat_lines; 

6896  946 

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

949 
fun print_rule ctxt th = 

950 
if ! testing then rule := SOME th 

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

952 
else (); 

953 
val test_proof = 

954 
(Seq.pull oo local_skip_proof) true 

28289  955 
> setmp_noncritical testing true 
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset

956 
> Exn.capture; 
6896  957 

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

959 
refine_goals print_rule (context_of state) (flat results) 
18124  960 
#> Seq.maps (after_qed results); 
17359  961 
in 
962 
state 

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

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

967 
 Exn.Result NONE => error (fail_msg (context_of goal_state)) 
28443  968 
 Exn.Exn Exn.Interrupt => raise Exn.Interrupt 
28458  969 
 Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))]))) 
17359  970 
end; 
971 

972 
in 

973 

18728  974 
val have = gen_have Attrib.attribute ProofContext.bind_propp; 
17359  975 
val have_i = gen_have (K I) ProofContext.bind_propp_i; 
18728  976 
val show = gen_show Attrib.attribute ProofContext.bind_propp; 
17359  977 
val show_i = gen_show (K I) ProofContext.bind_propp_i; 
6896  978 

5820  979 
end; 
17359  980 

28410  981 

28452  982 
(* fork global proofs *) 
28410  983 

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

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

985 

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

986 
fun is_original state = 
28410  987 
(case try find_goal state of 
988 
NONE => false 

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

989 
 SOME (_, (_, {statement = (_, _, prop), goal, ...})) => 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

990 
Logic.protect prop aconv Thm.concl_of goal); 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

991 

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

992 
in 
28410  993 

28452  994 
fun is_relevant state = 
995 
can (assert_bottom false) state orelse 

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

996 
not (is_original state) orelse 
28452  997 
schematic_goal state; 
28410  998 

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

999 
fun future_proof fork_proof state = 
28410  1000 
let 
28452  1001 
val _ = is_relevant state andalso error "Cannot fork relevant proof"; 
28410  1002 

29381
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset

1003 
val _ = assert_backward state; 
28410  1004 
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

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

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

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

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

1009 
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

1010 
(Drule.comp_no_flatten (goal, Thm.nprems_of goal) 1 Drule.protectI); 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1011 
fun after_qed' [[th]] = ProofContext.put_thms false (AutoBind.thisN, SOME [th]); 
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1012 
val this_name = ProofContext.full_bname goal_ctxt AutoBind.thisN; 
28410  1013 

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

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

1015 
state 
28452  1016 
> map_contexts (Variable.auto_fixes prop) 
28450
504c4edead13
future_proof: protect conclusion of deferred proof state;
wenzelm
parents:
28446
diff
changeset

1017 
> map_goal I (K (statement', messages, using, goal', before_qed, (#1 after_qed, after_qed'))) 
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

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

1019 

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

1020 
val future_thm = result_ctxt > Future.map (fn (_, ctxt) => 
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

1021 
ProofContext.get_fact_single ctxt (Facts.named this_name)); 
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset

1022 
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

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

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

1025 
> map_goal I (K (statement, messages, using, finished_goal, NONE, after_qed)) 
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset

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

1027 
in (Future.map #1 result_ctxt, state') end; 
28410  1028 

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

1030 

29381
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset

1031 
fun future_terminal_proof meths int state = 
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset

1032 
if int orelse is_relevant state orelse not (Future.enabled ()) 
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset

1033 
then global_terminal_proof meths state 
29350  1034 
else #2 (state > future_proof (fn state' => 
1035 
Future.fork_pri ~1 (fn () => ((), global_terminal_proof meths state')))); 

1036 

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

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

1038 