author  wenzelm 
Fri, 13 Mar 2009 19:58:26 +0100  
changeset 30510  4120fc59dd85 
parent 30419  c944e299eaf9 
child 30557  a28d83e903ce 
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 
29581  46 
val fix: (binding * string option * mixfix) list > state > state 
47 
val fix_i: (binding * typ option * mixfix) list > state > state 

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

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

49 
(Attrib.binding * (string * string list) list) list > state > state 
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

50 
val assm_i: Assumption.export > 
30211  51 
(Thm.binding * (term * term list) list) list > state > state 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

52 
val assume: (Attrib.binding * (string * string list) list) list > state > state 
30211  53 
val assume_i: (Thm.binding * (term * term list) list) list > state > state 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

54 
val presume: (Attrib.binding * (string * string list) list) list > state > state 
30211  55 
val presume_i: (Thm.binding * (term * term list) list) list > state > state 
56 
val def: (Attrib.binding * ((binding * mixfix) * (string * string list))) list > state > state 

57 
val def_i: (Thm.binding * ((binding * mixfix) * (term * term list))) list > state > state 

17359  58 
val chain: state > state 
59 
val chain_facts: thm list > state > state 

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

60 
val get_thmss: state > (Facts.ref * Attrib.src list) list > thm list 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

61 
val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list > state > state 
30211  62 
val note_thmss_i: (Thm.binding * (thm list * attribute list) list) list > state > state 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset

63 
val from_thmss: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  64 
val from_thmss_i: ((thm list * attribute list) list) list > state > state 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset

65 
val with_thmss: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  66 
val with_thmss_i: ((thm list * attribute list) list) list > state > state 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset

67 
val using: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  68 
val using_i: ((thm list * attribute list) list) list > state > state 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset

69 
val unfolding: ((Facts.ref * Attrib.src list) list) list > state > state 
18728  70 
val unfolding_i: ((thm list * attribute list) list) list > state > state 
17112  71 
val invoke_case: string * string option list * Attrib.src list > state > state 
18728  72 
val invoke_case_i: string * string option list * attribute list > state > state 
17359  73 
val begin_block: state > state 
74 
val next_block: state > state 

20309  75 
val end_block: state > state 
17112  76 
val proof: Method.text option > state > state Seq.seq 
77 
val defer: int option > state > state Seq.seq 

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

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

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

17359  81 
val local_goal: (context > ((string * string) * (string * thm list) list) > unit) > 
18728  82 
(theory > 'a > attribute) > 
17359  83 
(context * 'b list > context * (term list list * (context > context))) > 
29383  84 
string > Method.text option > (thm list list > state > state) > 
29581  85 
((binding * 'a list) * 'b) list > state > state 
29383  86 
val local_qed: Method.text option * bool > state > state 
21442  87 
val theorem: Method.text option > (thm list list > context > context) > 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

88 
(string * string list) list list > context > state 
21442  89 
val theorem_i: Method.text option > (thm list list > context > context) > 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

90 
(term * term list) list list > context > state 
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

91 
val global_qed: Method.text option * bool > state > context 
29383  92 
val local_terminal_proof: Method.text * Method.text option > state > state 
93 
val local_default_proof: state > state 

94 
val local_immediate_proof: state > state 

95 
val local_skip_proof: bool > state > state 

96 
val local_done_proof: state > state 

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

97 
val global_terminal_proof: Method.text * Method.text option > state > context 
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

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

99 
val global_immediate_proof: state > context 
29383  100 
val global_skip_proof: bool > state > context 
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

101 
val global_done_proof: state > context 
29383  102 
val have: Method.text option > (thm list list > state > state) > 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

103 
(Attrib.binding * (string * string list) list) list > bool > state > state 
29383  104 
val have_i: Method.text option > (thm list list > state > state) > 
30211  105 
(Thm.binding * (term * term list) list) list > bool > state > state 
29383  106 
val show: Method.text option > (thm list list > state > state) > 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

107 
(Attrib.binding * (string * string list) list) list > bool > state > state 
29383  108 
val show_i: Method.text option > (thm list list > state > state) > 
30211  109 
(Thm.binding * (term * term list) list) list > bool > state > state 
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

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

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

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

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

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

116 
val local_future_terminal_proof: Method.text * Method.text option > bool > state > state 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

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

13377  120 
structure Proof: PROOF = 
5820  121 
struct 
122 

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

5820  126 

127 
(** proof state **) 

128 

17359  129 
(* datatype state *) 
5820  130 

17112  131 
datatype mode = Forward  Chain  Backward; 
5820  132 

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

135 
and node = 

7176  136 
Node of 
137 
{context: context, 

138 
facts: thm list option, 

139 
mode: mode, 

17359  140 
goal: goal option} 
141 
and goal = 

142 
Goal of 

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

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

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

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

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

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

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

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

159 

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

5820  162 

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

165 

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

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

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

5820  173 

174 

175 
(** basic proof state operations **) 

176 

17359  177 
(* block structure *) 
178 

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

180 

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

17359  183 

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

185 

186 
fun assert_bottom b state = 

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

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

17359  190 
else state 
191 
end; 

192 

193 

5820  194 
(* context *) 
195 

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

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

5820  201 

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

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

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

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

210 

211 
(* facts *) 

212 

17359  213 
val get_facts = #facts o current; 
214 

215 
fun the_facts state = 

216 
(case get_facts state of SOME facts => facts 

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

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

17359  223 
fun put_facts facts = 
19078  224 
map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #> 
26251
b8c6259d366b
put_facts: do_props, i.e. facts are indexed by proposition again;
wenzelm
parents:
25958
diff
changeset

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

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

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

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

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

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

5820  237 

238 

239 
(* mode *) 

240 

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

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

246 
fun assert_mode pred state = 

247 
let val mode = get_mode state in 

248 
if pred mode then state 

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

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

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

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

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

5820  257 

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

260 
val enter_backward = put_mode Backward; 

5820  261 

17359  262 

263 
(* current goal *) 

264 

265 
fun current_goal state = 

266 
(case current state of 

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

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

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

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

17359  274 
else state 
275 
end; 

6776  276 

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

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

17359  281 

282 
(* nested goal *) 

5820  283 

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

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

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

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

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

292 
 map_goal _ _ state = state; 

5820  293 

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

19188  296 

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

299 

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

17359  302 

303 
local 

304 
fun find i state = 

305 
(case try current_goal state of 

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

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

310 
fun get_goal state = 

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

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

5820  313 

314 

315 

12423  316 
(** pretty_state **) 
5820  317 

13869  318 
val show_main_goal = ref false; 
16539  319 
val verbose = ProofContext.verbose; 
13698  320 

24961  321 
val pretty_goals_local = Display.pretty_goals_aux o Syntax.pp; 
12085  322 

15531  323 
fun pretty_facts _ _ NONE = [] 
324 
 pretty_facts s ctxt (SOME ths) = 

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

17359  327 
fun pretty_state nr state = 
5820  328 
let 
17359  329 
val {context, facts, mode, goal = _} = current state; 
5820  330 

331 
fun levels_up 0 = "" 

17359  332 
 levels_up 1 = "1 level up" 
333 
 levels_up i = string_of_int i ^ " levels up"; 

5820  334 

11556  335 
fun subgoals 0 = "" 
17359  336 
 subgoals 1 = "1 subgoal" 
337 
 subgoals n = string_of_int n ^ " subgoals"; 

338 

339 
fun description strs = 

28375  340 
(case filter_out (fn s => s = "") strs of [] => "" 
17359  341 
 strs' => enclose " (" ")" (commas strs')); 
12146  342 

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

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

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

23639  349 
pretty_goals_local ctxt Markup.subgoal 
24543  350 
(true, ! show_main_goal) (! Display.goals_limit) goal @ 
25958  351 
(map (fn msg => Position.setmp_thread_data pos msg ()) (rev messages)) 
17359  352 
 prt_goal NONE = []; 
6848  353 

17359  354 
val prt_ctxt = 
355 
if ! verbose orelse mode = Forward then ProofContext.pretty_context context 

18670  356 
else if mode = Backward then ProofContext.pretty_ctxt context 
7575  357 
else []; 
17359  358 
in 
359 
[Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^ 

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

361 
Pretty.str ""] @ 

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

363 
(if ! verbose orelse mode = Forward then 

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

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

366 
else prt_goal (try find_goal state)) 

367 
end; 

5820  368 

12085  369 
fun pretty_goals main state = 
19188  370 
let val (ctxt, (_, goal)) = get_goal state 
23639  371 
in pretty_goals_local ctxt Markup.none (false, main) (! Display.goals_limit) goal end; 
10320  372 

5820  373 

374 

375 
(** proof steps **) 

376 

17359  377 
(* refine via method *) 
5820  378 

8234  379 
local 
380 

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

383 

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

385 

386 
fun goal_cases st = 

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

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

24556  400 
(K (statement, [], using, goal', before_qed, after_qed))) 
16146  401 
end; 
5820  402 

19188  403 
fun select_goals n meth state = 
19224  404 
state 
405 
> (#2 o #2 o get_goal) 

21687  406 
> ALLGOALS Goal.conjunction_tac 
19224  407 
> Seq.maps (fn goal => 
19188  408 
state 
21687  409 
> Seq.lift set_goal (Goal.extract 1 n goal > Seq.maps (Goal.conjunction_tac 1)) 
19188  410 
> Seq.maps meth 
411 
> Seq.maps (fn state' => state' 

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

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

17112  415 
fun apply_text cc text state = 
416 
let 

417 
val thy = theory_of state; 

23360  418 
val pos_of = #2 o Args.dest_src; 
17112  419 

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

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

17112  423 
 eval (Method.Then txts) = Seq.EVERY (map eval txts) 
424 
 eval (Method.Orelse txts) = Seq.FIRST (map eval txts) 

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

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

17112  428 
in eval text state end; 
429 

8234  430 
in 
431 

17112  432 
val refine = apply_text true; 
433 
val refine_end = apply_text false; 

8234  434 

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

8234  438 
end; 
439 

5820  440 

17359  441 
(* refine via subproof *) 
442 

20208  443 
fun goal_tac rule = 
21687  444 
Goal.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW 
445 
(Goal.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) => 

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

448 
else all_tac))); 

11816  449 

19915  450 
fun refine_goals print_rule inner raw_rules state = 
451 
let 

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

20208  453 
fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st); 
19915  454 
in 
455 
raw_rules 

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

19915  458 
end; 
17359  459 

6932  460 

17359  461 
(* conclude_goal *) 
6932  462 

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

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

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

467 
val string_of_thm = ProofContext.string_of_thm ctxt; 
5820  468 

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

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

473 

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

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

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

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

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

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

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

482 
handle THM _ => lost_structure (); 
23418  483 
val goal_propss = filter_out null propss; 
484 
val results = 

485 
Conjunction.elim_balanced (length goal_propss) th 

486 
> map2 Conjunction.elim_balanced (map length goal_propss) 

487 
handle THM _ => lost_structure (); 

488 
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

489 
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

490 
val _ = Thm.check_shyps (Variable.sorts_of ctxt) th; 
23418  491 

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

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

494 
 recover_result [] [] = [] 

495 
 recover_result _ _ = lost_structure (); 

496 
in recover_result propss results end; 

5820  497 

498 

499 

500 
(*** structured proof commands ***) 

501 

17112  502 
(** context elements **) 
5820  503 

17112  504 
(* bindings *) 
5820  505 

16813  506 
local 
507 

17359  508 
fun gen_bind bind args state = 
5820  509 
state 
510 
> assert_forward 

18308  511 
> map_context (bind args #> snd) 
17359  512 
> put_facts NONE; 
5820  513 

16813  514 
in 
515 

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

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

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

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

519 
val let_bind_i = gen_bind (ProofContext.match_bind_i true); 
5820  520 

16813  521 
end; 
522 

5820  523 

17359  524 
(* fix *) 
9196  525 

12714  526 
local 
527 

18670  528 
fun gen_fix add_fixes args = 
17359  529 
assert_forward 
19846  530 
#> map_context (snd o add_fixes args) 
17359  531 
#> put_facts NONE; 
5820  532 

16813  533 
in 
534 

18670  535 
val fix = gen_fix ProofContext.add_fixes; 
536 
val fix_i = gen_fix ProofContext.add_fixes_i; 

5820  537 

16813  538 
end; 
539 

5820  540 

17359  541 
(* assume etc. *) 
5820  542 

16813  543 
local 
544 

17112  545 
fun gen_assume asm prep_att exp args state = 
5820  546 
state 
547 
> assert_forward 

17112  548 
> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args)) 
17359  549 
> these_factss [] > #2; 
6932  550 

16813  551 
in 
552 

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

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

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

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

558 
val presume_i = assm_i Assumption.presume_export; 
5820  559 

16813  560 
end; 
561 

7271  562 

17359  563 
(* def *) 
11891  564 

16813  565 
local 
566 

20913  567 
fun gen_def prep_att prep_vars prep_binds args state = 
11891  568 
let 
569 
val _ = assert_forward state; 

17112  570 
val thy = theory_of state; 
20913  571 
val ctxt = context_of state; 
11891  572 

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

11891  575 
in 
20913  576 
state 
577 
> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars)) 

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

579 
> (fn vars => 

580 
map_context_result (prep_binds false (map swap raw_rhss)) 

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

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

11891  583 
end; 
584 

16813  585 
in 
586 

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

11891  589 

16813  590 
end; 
591 

11891  592 

8374  593 

17112  594 
(** facts **) 
5820  595 

17359  596 
(* chain *) 
5820  597 

24011  598 
fun clean_facts ctxt = 
24050  599 
put_facts (SOME (filter_out Thm.is_dummy (the_facts ctxt))) ctxt; 
24011  600 

17359  601 
val chain = 
602 
assert_forward 

24011  603 
#> clean_facts 
17359  604 
#> enter_chain; 
5820  605 

17359  606 
fun chain_facts facts = 
607 
put_facts (SOME facts) 

608 
#> chain; 

5820  609 

610 

17359  611 
(* note etc. *) 
17112  612 

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

615 
local 

616 

17359  617 
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state = 
17112  618 
state 
619 
> assert_forward 

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

621 
> these_factss (more_facts state) 

17359  622 
> opt_chain 
623 
> opt_result; 

17112  624 

625 
in 

626 

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

17112  629 

630 
val from_thmss = 

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

17112  633 

634 
val with_thmss = 

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

17359  637 

18808  638 
val local_results = 
21442  639 
gen_thmss (ProofContext.note_thmss_i "") (K []) I I (K I) o map (apsnd Thm.simple_fact); 
17359  640 

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

643 
end; 

644 

645 

18548  646 
(* using/unfolding *) 
17112  647 

648 
local 

649 

18548  650 
fun gen_using f g note prep_atts args state = 
17112  651 
state 
652 
> assert_backward 

21442  653 
> map_context_result 
654 
(note "" (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args))) 

18843  655 
> (fn (named_facts, state') => 
24556  656 
state' > map_goal I (fn (statement, _, using, goal, before_qed, after_qed) => 
18843  657 
let 
658 
val ctxt = context_of state'; 

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

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

24050  662 
fun append_using _ ths using = using @ filter_out Thm.is_dummy ths; 
18878  663 
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths); 
664 
val unfold_goals = LocalDefs.unfold_goals; 

17112  665 

666 
in 

667 

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

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

17112  672 

673 
end; 

674 

675 

676 
(* case *) 

677 

678 
local 

679 

30419
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset

680 
fun qualified_binding a = 
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset

681 
Binding.qualify true (Long_Name.qualifier a) (Binding.name (Long_Name.base_name a)); 
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset

682 

17112  683 
fun gen_invoke_case prep_att (name, xs, raw_atts) state = 
684 
let 

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

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

30419
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset

688 
val assumptions = asms > map (fn (a, ts) => ((qualified_binding a, atts), map (rpair []) ts)); 
17112  689 
in 
690 
state' 

691 
> assume_i assumptions 

17976  692 
> add_binds_i AutoBind.no_facts 
28965  693 
> `the_facts > (fn thms => note_thmss_i [((Binding.name name, []), [(thms, [])])]) 
17112  694 
end; 
695 

696 
in 

697 

18728  698 
val invoke_case = gen_invoke_case Attrib.attribute; 
17112  699 
val invoke_case_i = gen_invoke_case (K I); 
700 

701 
end; 

702 

703 

704 

17359  705 
(** proof structure **) 
706 

707 
(* blocks *) 

708 

709 
val begin_block = 

710 
assert_forward 

711 
#> open_block 

712 
#> put_goal NONE 

713 
#> open_block; 

714 

715 
val next_block = 

716 
assert_forward 

717 
#> close_block 

718 
#> open_block 

719 
#> put_goal NONE 

720 
#> put_facts NONE; 

721 

722 
fun end_block state = 

723 
state 

724 
> assert_forward 

725 
> close_block 

726 
> assert_current_goal false 

727 
> close_block 

728 
> export_facts state; 

729 

730 

731 
(* subproofs *) 

732 

733 
fun proof opt_text = 

734 
assert_backward 

17859  735 
#> refine (the_default Method.default_text opt_text) 
17359  736 
#> Seq.map (using_facts [] #> enter_forward); 
737 

23360  738 
fun end_proof bot txt state = 
739 
state 

740 
> assert_forward 

741 
> assert_bottom bot 

742 
> close_block 

743 
> assert_current_goal true 

744 
> using_facts [] 

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

25958  746 
> Seq.maps (refine (Method.finish_text txt (Position.thread_data ()))); 
17359  747 

29383  748 
fun check_result msg sq = 
749 
(case Seq.pull sq of 

750 
NONE => error msg 

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

752 

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

754 

17359  755 

756 
(* unstructured refinement *) 

757 

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

17359  760 

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

762 
fun apply_end text = assert_forward #> refine_end text; 

763 

764 

765 

17112  766 
(** goals **) 
767 

17359  768 
(* generic goals *) 
769 

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

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

771 

19846  772 
fun implicit_vars dest add props = 
773 
let 

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

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

776 
val _ = 

777 
if null vars then () 

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

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

780 
in (rev vars, props') end; 

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

781 

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

782 
fun refine_terms n = 
30510
4120fc59dd85
unified type Proof.method and pervasive METHOD combinators;
wenzelm
parents:
30419
diff
changeset

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

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

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

787 

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

788 
in 
17359  789 

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

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

5936  798 
state 
799 
> assert_forward_or_chain 

800 
> enter_forward 

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

803 
val props = flat propss; 
15703  804 

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

807 
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

808 

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

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

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

812 
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

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

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

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

825 
> put_goal NONE 

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

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

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

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

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

836 

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

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

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

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

845 
val (after_local, after_global) = after_qed; 

29383  846 
fun after_local' x y = Position.setmp_thread_data pos (fn () => after_local x y) (); 
25958  847 
fun after_global' x y = Position.setmp_thread_data pos (fn () => after_global x y) (); 
17359  848 
in 
849 
outer_state 

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

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

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

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

855 

9469  856 

17359  857 
(* local goals *) 
858 

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

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

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

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

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

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

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

29383  875 
fun local_qeds txt = 
876 
end_proof false txt 

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

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

29383  880 
fun local_qed txt = local_qeds txt #> check_finish; 
881 

5820  882 

17359  883 
(* global goals *) 
884 

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

886 
init ctxt 
29383  887 
> generic_goal (prepp #> ProofContext.auto_fixes) "" before_qed (K I, after_qed) propp; 
17359  888 

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

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

890 
val theorem_i = global_goal ProofContext.bind_propp_schematic_i; 
12065  891 

17359  892 
fun global_qeds txt = 
893 
end_proof true txt 

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

894 
#> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) => 
29383  895 
after_qed results (context_of state))); 
17112  896 

29383  897 
fun global_qed txt = global_qeds txt #> check_finish; 
12959  898 

5820  899 

17359  900 
(* concluding steps *) 
17112  901 

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

17112  904 

29383  905 
fun local_terminal_proof (text, opt_text) = terminal_proof local_qeds text (opt_text, true); 
17112  906 
val local_default_proof = local_terminal_proof (Method.default_text, NONE); 
907 
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE); 

17359  908 
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE); 
29383  909 
val local_done_proof = terminal_proof local_qeds Method.done_text (NONE, false); 
17112  910 

29383  911 
fun global_terminal_proof (text, opt_text) = terminal_proof global_qeds text (opt_text, true); 
17112  912 
val global_default_proof = global_terminal_proof (Method.default_text, NONE); 
913 
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE); 

17359  914 
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); 
29383  915 
val global_done_proof = terminal_proof global_qeds Method.done_text (NONE, false); 
5820  916 

6896  917 

17359  918 
(* common goal statements *) 
919 

920 
local 

921 

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

6896  924 

17859  925 
fun gen_show prep_att prepp before_qed after_qed stmt int state = 
17359  926 
let 
927 
val testing = ref false; 

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

929 
fun fail_msg ctxt = 

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

6896  933 

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

936 
fun print_rule ctxt th = 

937 
if ! testing then rule := SOME th 

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

939 
else (); 

940 
val test_proof = 

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

943 
> Exn.capture; 
6896  944 

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

946 
refine_goals print_rule (context_of state) (flat results) 
29383  947 
#> check_result "Failed to refine any pending goal" 
948 
#> after_qed results; 

17359  949 
in 
950 
state 

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

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

955 
 Exn.Result NONE => error (fail_msg (context_of goal_state)) 
28443  956 
 Exn.Exn Exn.Interrupt => raise Exn.Interrupt 
28458  957 
 Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))]))) 
17359  958 
end; 
959 

960 
in 

961 

18728  962 
val have = gen_have Attrib.attribute ProofContext.bind_propp; 
17359  963 
val have_i = gen_have (K I) ProofContext.bind_propp_i; 
18728  964 
val show = gen_show Attrib.attribute ProofContext.bind_propp; 
17359  965 
val show_i = gen_show (K I) ProofContext.bind_propp_i; 
6896  966 

5820  967 
end; 
17359  968 

28410  969 

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

970 

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

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

972 

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

973 
(* relevant proof states *) 
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 
fun is_schematic t = 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

976 
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

977 
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

978 

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

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

980 
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

981 
in is_schematic prop end; 
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 is_relevant state = 
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset

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

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

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

987 
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

988 

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

989 

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

990 
(* full proofs *) 
28410  991 

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

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

993 

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

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

996 
val _ = assert_backward state; 
28410  997 
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

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

29383  1000 
val _ = is_relevant state andalso error "Cannot fork relevant proof"; 
1001 

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

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

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

1004 
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

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

1006 

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

1007 
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

1008 
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

1009 
val after_qed' = (after_local', after_global'); 
30279  1010 
val this_name = ProofContext.full_name goal_ctxt (Binding.name AutoBind.thisN); 
28410  1011 

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

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

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

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

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

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

1017 

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

1018 
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

1019 
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

1020 
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

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

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

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

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

1025 
in (Future.map #1 result_ctxt, state') end; 
28410  1026 

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

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

1028 

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

1029 
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

1030 
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

1031 

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

1033 

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

1034 

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

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

1036 

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

1037 
local 
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 
fun future_terminal_proof proof1 proof2 meths int state = 
29448
34b9652b2f45
added Goal.future_enabled abstraction  now also checks that this is already
wenzelm
parents:
29435
diff
changeset

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

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

1042 
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

1043 

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

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

1045 

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

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

1047 
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

1048 

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

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

1050 
future_terminal_proof global_terminal_proof global_future_proof x; 
29350  1051 

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

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

1053 

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

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

1055 