author  wenzelm 
Thu, 18 Sep 2008 14:06:58 +0200  
changeset 28289  efd53393412b 
parent 28278  7af26c1f02ec 
child 28375  c879d88d038a 
permissions  rwrr 
5820  1 
(* Title: Pure/Isar/proof.ML 
2 
ID: $Id$ 

3 
Author: Markus Wenzel, TU Muenchen 

4 

19000  5 
The Isar/VM proof language interpreter: maintains a structured flow of 
6 
context elements, goals, refinements, and facts. 

5820  7 
*) 
8 

9 
signature PROOF = 

10 
sig 

23639  11 
type context = Context.proof 
12 
type method = Method.method 

5820  13 
type state 
17359  14 
val init: context > state 
15 
val level: state > int 

16 
val assert_bottom: bool > state > state 

5820  17 
val context_of: state > context 
18 
val theory_of: state > theory 

13377  19 
val map_context: (context > context) > state > state 
28278  20 
val map_contexts: (context > context) > state > state 
17976  21 
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

22 
val put_thms: bool > string * thm list option > state > state 
6091  23 
val the_facts: state > thm list 
9469  24 
val the_fact: state > thm 
17450  25 
val put_facts: thm list option > state > state 
6891  26 
val assert_forward: state > state 
17359  27 
val assert_chain: state > state 
9469  28 
val assert_forward_or_chain: state > state 
5820  29 
val assert_backward: state > state 
8206  30 
val assert_no_chain: state > state 
5820  31 
val enter_forward: state > state 
24543  32 
val goal_message: (unit > Pretty.T) > state > state 
17359  33 
val get_goal: state > context * (thm list * thm) 
19995  34 
val schematic_goal: state > bool 
16539  35 
val show_main_goal: bool ref 
6529  36 
val verbose: bool ref 
12423  37 
val pretty_state: int > state > Pretty.T list 
10360  38 
val pretty_goals: bool > state > Pretty.T list 
17112  39 
val refine: Method.text > state > state Seq.seq 
40 
val refine_end: Method.text > state > state Seq.seq 

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

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

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

47 
val let_bind_i: (term list * term) list > state > state 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

48 
val fix: (Name.binding * string option * mixfix) list > state > state 
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

49 
val fix_i: (Name.binding * typ option * mixfix) list > state > state 
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

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

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

52 
val assm_i: Assumption.export > 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

53 
((Name.binding * attribute list) * (term * term list) list) list > state > state 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

54 
val assume: (Attrib.binding * (string * string list) list) list > state > state 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

55 
val assume_i: ((Name.binding * attribute list) * (term * term list) list) list > 
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

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

57 
val presume: (Attrib.binding * (string * string list) list) list > state > state 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

58 
val presume_i: ((Name.binding * attribute list) * (term * term list) list) list > 
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

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

60 
val def: (Attrib.binding * ((Name.binding * mixfix) * (string * string list))) list > 
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

61 
state > state 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

62 
val def_i: ((Name.binding * attribute list) * 
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

63 
((Name.binding * mixfix) * (term * term list))) list > state > state 
17359  64 
val chain: state > state 
65 
val chain_facts: thm list > state > state 

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

66 
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

67 
val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list > state > state 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

68 
val note_thmss_i: ((Name.binding * attribute list) * 
18728  69 
(thm list * attribute list) list) list > state > state 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset

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

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

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

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

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

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

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

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

17359  88 
val local_goal: (context > ((string * string) * (string * thm list) list) > unit) > 
18728  89 
(theory > 'a > attribute) > 
17359  90 
(context * 'b list > context * (term list list * (context > context))) > 
18124  91 
string > Method.text option > (thm list list > state > state Seq.seq) > 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

92 
((Name.binding * 'a list) * 'b) list > state > state 
17359  93 
val local_qed: Method.text option * bool > state > state Seq.seq 
21442  94 
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

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

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

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

101 
val local_immediate_proof: state > state Seq.seq 

102 
val local_done_proof: state > state Seq.seq 

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

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

104 
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

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

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

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

108 
val global_skip_proof: bool > state > context 
18124  109 
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

110 
(Attrib.binding * (string * string list) list) list > bool > state > state 
18124  111 
val have_i: Method.text option > (thm list list > state > state Seq.seq) > 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

112 
((Name.binding * attribute list) * (term * term list) list) list > bool > state > state 
18124  113 
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

114 
(Attrib.binding * (string * string list) list) list > bool > state > state 
18124  115 
val show_i: Method.text option > (thm list list > state > state Seq.seq) > 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

116 
((Name.binding * attribute list) * (term * term list) list) list > bool > state > state 
5820  117 
end; 
118 

13377  119 
structure Proof: PROOF = 
5820  120 
struct 
121 

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

5820  125 

126 
(** proof state **) 

127 

17359  128 
(* datatype state *) 
5820  129 

17112  130 
datatype mode = Forward  Chain  Backward; 
5820  131 

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

134 
and node = 

7176  135 
Node of 
136 
{context: context, 

137 
facts: thm list option, 

138 
mode: mode, 

17359  139 
goal: goal option} 
140 
and goal = 

141 
Goal of 

25958  142 
{statement: (string * Position.T) * term list list, 
143 
(*goal kind and statement (starting with vars)*) 

144 
messages: (unit > Pretty.T) list, (*persistent messages (hints etc.)*) 

145 
using: thm list, (*goal facts*) 

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

17859  147 
before_qed: Method.text option, 
18124  148 
after_qed: 
149 
(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

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

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

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

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

158 

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

5820  161 

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

164 

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

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

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

5820  172 

173 

174 
(** basic proof state operations **) 

175 

17359  176 
(* block structure *) 
177 

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

179 

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

17359  182 

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

184 

185 
fun assert_bottom b state = 

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

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

17359  189 
else state 
190 
end; 

191 

192 

5820  193 
(* context *) 
194 

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

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

5820  200 

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

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

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

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

209 

210 
(* facts *) 

211 

17359  212 
val get_facts = #facts o current; 
213 

214 
fun the_facts state = 

215 
(case get_facts state of SOME facts => facts 

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

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

17359  222 
fun put_facts facts = 
19078  223 
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

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

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

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

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

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

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

5820  236 

237 

238 
(* mode *) 

239 

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

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

245 
fun assert_mode pred state = 

246 
let val mode = get_mode state in 

247 
if pred mode then state 

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

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

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

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

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

5820  256 

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

259 
val enter_backward = put_mode Backward; 

5820  260 

17359  261 

262 
(* current goal *) 

263 

264 
fun current_goal state = 

265 
(case current state of 

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

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

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

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

17359  273 
else state 
274 
end; 

6776  275 

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

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

17359  280 

281 
(* nested goal *) 

5820  282 

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

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

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

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

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

291 
 map_goal _ _ state = state; 

5820  292 

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

19188  295 

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

298 

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

17359  301 

302 
local 

303 
fun find i state = 

304 
(case try current_goal state of 

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

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

309 
fun get_goal state = 

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

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

5820  312 

19995  313 
fun schematic_goal state = 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

314 
let val (_, (_, {statement = (_, propss), ...})) = find_goal state in 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

315 
exists (exists (Term.exists_subterm Term.is_Var)) propss orelse 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

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

317 
end; 
19995  318 

5820  319 

320 

12423  321 
(** pretty_state **) 
5820  322 

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

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

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

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

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

336 
fun levels_up 0 = "" 

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

5820  339 

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

343 

344 
fun description strs = 

345 
(case filter_out (equal "") strs of [] => "" 

346 
 strs' => enclose " (" ")" (commas strs')); 

12146  347 

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

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

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

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

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

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

366 
Pretty.str ""] @ 

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

368 
(if ! verbose orelse mode = Forward then 

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

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

371 
else prt_goal (try find_goal state)) 

372 
end; 

5820  373 

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

5820  378 

379 

380 
(** proof steps **) 

381 

17359  382 
(* refine via method *) 
5820  383 

8234  384 
local 
385 

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

388 

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

390 

391 
fun goal_cases st = 

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

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

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

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

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

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

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

17112  420 
fun apply_text cc text state = 
421 
let 

422 
val thy = theory_of state; 

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

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

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

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

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

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

17112  433 
in eval text state end; 
434 

8234  435 
in 
436 

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

8234  439 

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

8234  443 
end; 
444 

5820  445 

17359  446 
(* refine via subproof *) 
447 

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

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

453 
else all_tac))); 

11816  454 

19915  455 
fun refine_goals print_rule inner raw_rules state = 
456 
let 

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

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

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

19915  463 
end; 
17359  464 

6932  465 

17359  466 
(* conclude_goal *) 
6932  467 

18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset

468 
fun conclude_goal state goal propss = 
5820  469 
let 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

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

473 
val string_of_thm = ProofContext.string_of_thm ctxt; 
5820  474 

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

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

479 

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

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

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

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

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

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

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

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

491 
Conjunction.elim_balanced (length goal_propss) th 

492 
> map2 Conjunction.elim_balanced (map length goal_propss) 

493 
handle THM _ => lost_structure (); 

494 
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

495 
error ("Proved a different theorem:\n" ^ string_of_thm th); 
23418  496 

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

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

499 
 recover_result [] [] = [] 

500 
 recover_result _ _ = lost_structure (); 

501 
in recover_result propss results end; 

5820  502 

503 

504 

505 
(*** structured proof commands ***) 

506 

17112  507 
(** context elements **) 
5820  508 

17112  509 
(* bindings *) 
5820  510 

16813  511 
local 
512 

17359  513 
fun gen_bind bind args state = 
5820  514 
state 
515 
> assert_forward 

18308  516 
> map_context (bind args #> snd) 
17359  517 
> put_facts NONE; 
5820  518 

16813  519 
in 
520 

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

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

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

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

524 
val let_bind_i = gen_bind (ProofContext.match_bind_i true); 
5820  525 

16813  526 
end; 
527 

5820  528 

17359  529 
(* fix *) 
9196  530 

12714  531 
local 
532 

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

16813  538 
in 
539 

18670  540 
val fix = gen_fix ProofContext.add_fixes; 
541 
val fix_i = gen_fix ProofContext.add_fixes_i; 

5820  542 

16813  543 
end; 
544 

5820  545 

17359  546 
(* assume etc. *) 
5820  547 

16813  548 
local 
549 

17112  550 
fun gen_assume asm prep_att exp args state = 
5820  551 
state 
552 
> assert_forward 

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

16813  556 
in 
557 

18728  558 
val assm = gen_assume ProofContext.add_assms Attrib.attribute; 
18670  559 
val assm_i = gen_assume ProofContext.add_assms_i (K I); 
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

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

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

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

563 
val presume_i = assm_i Assumption.presume_export; 
5820  564 

16813  565 
end; 
566 

7271  567 

17359  568 
(* def *) 
11891  569 

16813  570 
local 
571 

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

17112  575 
val thy = theory_of state; 
20913  576 
val ctxt = context_of state; 
11891  577 

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

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

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

584 
> (fn vars => 

585 
map_context_result (prep_binds false (map swap raw_rhss)) 

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

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

11891  588 
end; 
589 

16813  590 
in 
591 

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

11891  594 

16813  595 
end; 
596 

11891  597 

8374  598 

17112  599 
(** facts **) 
5820  600 

17359  601 
(* chain *) 
5820  602 

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

17359  606 
val chain = 
607 
assert_forward 

24011  608 
#> clean_facts 
17359  609 
#> enter_chain; 
5820  610 

17359  611 
fun chain_facts facts = 
612 
put_facts (SOME facts) 

613 
#> chain; 

5820  614 

615 

17359  616 
(* note etc. *) 
17112  617 

28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

618 
fun no_binding args = map (pair (Name.no_binding, [])) args; 
17112  619 

620 
local 

621 

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

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

626 
> these_factss (more_facts state) 

17359  627 
> opt_chain 
628 
> opt_result; 

17112  629 

630 
in 

631 

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

17112  634 

635 
val from_thmss = 

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

17112  638 

639 
val with_thmss = 

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

17359  642 

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

28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

646 
fun get_thmss state srcs = the_facts (note_thmss [((Name.no_binding, []), srcs)] state); 
17112  647 

648 
end; 

649 

650 

18548  651 
(* using/unfolding *) 
17112  652 

653 
local 

654 

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

21442  658 
> map_context_result 
659 
(note "" (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args))) 

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

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

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

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

17112  670 

671 
in 

672 

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

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

17112  677 

678 
end; 

679 

680 

681 
(* case *) 

682 

683 
local 

684 

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

686 
let 

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

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

28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

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

17359  693 
> map_context (ProofContext.qualified_names #> ProofContext.no_base_names) 
17112  694 
> assume_i assumptions 
17976  695 
> add_binds_i AutoBind.no_facts 
17112  696 
> map_context (ProofContext.restore_naming (context_of state)) 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
26922
diff
changeset

697 
> `the_facts > (fn thms => note_thmss_i [((Name.binding name, []), [(thms, [])])]) 
17112  698 
end; 
699 

700 
in 

701 

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

705 
end; 

706 

707 

708 

17359  709 
(** proof structure **) 
710 

711 
(* blocks *) 

712 

713 
val begin_block = 

714 
assert_forward 

715 
#> open_block 

716 
#> put_goal NONE 

717 
#> open_block; 

718 

719 
val next_block = 

720 
assert_forward 

721 
#> close_block 

722 
#> open_block 

723 
#> put_goal NONE 

724 
#> put_facts NONE; 

725 

726 
fun end_block state = 

727 
state 

728 
> assert_forward 

729 
> close_block 

730 
> assert_current_goal false 

731 
> close_block 

732 
> export_facts state; 

733 

734 

735 
(* subproofs *) 

736 

737 
fun proof opt_text = 

738 
assert_backward 

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

23360  742 
fun end_proof bot txt state = 
743 
state 

744 
> assert_forward 

745 
> assert_bottom bot 

746 
> close_block 

747 
> assert_current_goal true 

748 
> using_facts [] 

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

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

752 

753 
(* unstructured refinement *) 

754 

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

17359  757 

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

759 
fun apply_end text = assert_forward #> refine_end text; 

760 

761 

762 

17112  763 
(** goals **) 
764 

17359  765 
(* generic goals *) 
766 

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

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

768 

19846  769 
fun implicit_vars dest add props = 
770 
let 

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

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

773 
val _ = 

774 
if null vars then () 

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

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

777 
in (rev vars, props') end; 

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

778 

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

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

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

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

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

784 

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

785 
in 
17359  786 

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

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

5936  795 
state 
796 
> assert_forward_or_chain 

797 
> enter_forward 

17359  798 
> open_block 
17859  799 
> 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

800 
val props = flat propss; 
15703  801 

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

804 
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

805 

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

806 
val propss' = map (Logic.mk_term o Var) vars :: propss; 
23418  807 
val goal_propss = filter_out null propss'; 
808 
val goal = Goal.init (cert 

809 
(Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss))); 

18124  810 
val after_qed' = after_qed >> (fn after_local => 
811 
fn results => map_context after_ctxt #> after_local results); 

5820  812 
in 
17359  813 
goal_state 
21727  814 
> map_context (init_context #> Variable.set_body true) 
25958  815 
> put_goal (SOME (make_goal (((kind, pos), propss'), [], [], goal, before_qed, after_qed'))) 
17359  816 
> map_context (ProofContext.auto_bind_goal props) 
21565  817 
> chaining ? (`the_facts #> using_facts) 
17359  818 
> put_facts NONE 
819 
> open_block 

820 
> put_goal NONE 

5820  821 
> enter_backward 
23418  822 
> not (null vars) ? refine_terms (length goal_propss) 
23360  823 
> null props ? (refine (Method.Basic (Method.assumption, Position.none)) #> Seq.hd) 
5820  824 
end; 
825 

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

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

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

831 

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

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

834 
flat (tl stmt) 
19915  835 
> Variable.exportT_terms goal_ctxt outer_ctxt; 
17359  836 
val results = 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

837 
tl (conclude_goal state goal stmt) 
20309  838 
> burrow (ProofContext.export goal_ctxt outer_ctxt); 
25958  839 

840 
val (after_local, after_global) = after_qed; 

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

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

17359  843 
in 
844 
outer_state 

845 
> map_context (ProofContext.auto_bind_facts props) 

25958  846 
> pair ((after_local', after_global'), results) 
17359  847 
end; 
848 

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

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

850 

9469  851 

17359  852 
(* local goals *) 
853 

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

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

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

858 
Attrib.map_specs (prep_att thy) stmt > split_list >> split_list; 
17359  859 

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

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

867 
> tap (Variable.warn_extra_tfrees (context_of state) o context_of) 
5820  868 
end; 
869 

17359  870 
fun local_qed txt = 
20309  871 
end_proof false txt #> 
872 
Seq.maps (generic_qed #> (fn ((after_qed, _), results) => after_qed results)); 

5820  873 

874 

17359  875 
(* global goals *) 
876 

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

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

880 
before_qed (K Seq.single, after_qed) propp; 
17359  881 

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

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

883 
val theorem_i = global_goal ProofContext.bind_propp_schematic_i; 
12065  884 

18678  885 
fun check_result msg sq = 
17112  886 
(case Seq.pull sq of 
18678  887 
NONE => error msg 
19475  888 
 SOME (s', sq') => Seq.cons s' sq'); 
17112  889 

17359  890 
fun global_qeds txt = 
891 
end_proof true txt 

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

893 
after_qed results (context_of state))) 
17112  894 
> Seq.DETERM; (*backtracking may destroy theory!*) 
895 

18678  896 
fun global_qed txt = 
897 
global_qeds txt 

898 
#> check_result "Failed to finish proof" 

899 
#> Seq.hd; 

12959  900 

5820  901 

17359  902 
(* concluding steps *) 
17112  903 

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

17112  906 

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

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

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

17112  911 

18678  912 
fun global_term_proof immed (text, opt_text) = 
913 
proof (SOME text) 

914 
#> check_result "Terminal proof method failed" 

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

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

917 
#> Seq.hd; 

17112  918 

919 
val global_terminal_proof = global_term_proof true; 

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

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

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

17359  923 
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); 
5820  924 

6896  925 

17359  926 
(* common goal statements *) 
927 

928 
local 

929 

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

6896  932 

17859  933 
fun gen_show prep_att prepp before_qed after_qed stmt int state = 
17359  934 
let 
935 
val testing = ref false; 

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

937 
fun fail_msg ctxt = 

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

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

940 
> cat_lines; 

6896  941 

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

944 
fun print_rule ctxt th = 

945 
if ! testing then rule := SOME th 

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

947 
else (); 

948 
val test_proof = 

949 
(Seq.pull oo local_skip_proof) true 

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

951 
> Exn.capture; 
6896  952 

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

954 
refine_goals print_rule (context_of state) (flat results) 
18124  955 
#> Seq.maps (after_qed results); 
17359  956 
in 
957 
state 

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

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

962 
 Exn.Result NONE => error (fail_msg (context_of goal_state)) 
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset

963 
 Exn.Exn Interrupt => raise Interrupt 
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset

964 
 Exn.Exn exn => raise Exn.EXCEPTIONS ([exn], fail_msg (context_of goal_state)))) 
17359  965 
end; 
966 

967 
in 

968 

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

5820  974 
end; 
17359  975 

976 
end; 