author | wenzelm |
Sun, 25 Aug 2013 17:04:22 +0200 | |
changeset 53190 | 5d92649a310e |
parent 53189 | ee8b8dafef0e |
child 53192 | 04df1d236e1c |
permissions | -rw-r--r-- |
17980 | 1 |
(* Title: Pure/goal.ML |
29345 | 2 |
Author: Makarius |
17980 | 3 |
|
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
4 |
Goals in tactical theorem proving, with support for forked proofs. |
17980 | 5 |
*) |
6 |
||
7 |
signature BASIC_GOAL = |
|
8 |
sig |
|
32738 | 9 |
val parallel_proofs: int Unsynchronized.ref |
17980 | 10 |
val SELECT_GOAL: tactic -> int -> tactic |
52458
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
11 |
val PREFER_GOAL: tactic -> int -> tactic |
23418 | 12 |
val CONJUNCTS: tactic -> int -> tactic |
23414
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
13 |
val PRECISE_CONJUNCTS: int -> tactic -> int -> tactic |
32365 | 14 |
val PARALLEL_CHOICE: tactic list -> tactic |
15 |
val PARALLEL_GOALS: tactic -> tactic |
|
17980 | 16 |
end; |
17 |
||
18 |
signature GOAL = |
|
19 |
sig |
|
20 |
include BASIC_GOAL |
|
21 |
val init: cterm -> thm |
|
52456 | 22 |
val protect: int -> thm -> thm |
17980 | 23 |
val conclude: thm -> thm |
49845 | 24 |
val check_finished: Proof.context -> thm -> thm |
32197 | 25 |
val finish: Proof.context -> thm -> thm |
21604
1af327306c8e
added norm/close_result (supercede local_standard etc.);
wenzelm
parents:
21579
diff
changeset
|
26 |
val norm_result: thm -> thm |
51605
eca8acb42e4a
more explicit Goal.fork_params -- avoid implicit arguments via thread data;
wenzelm
parents:
51553
diff
changeset
|
27 |
val fork_params: {name: string, pos: Position.T, pri: int} -> (unit -> 'a) -> 'a future |
51222
8c3e5fb41139
improved scheduling of forked proofs, based on elapsed time estimate (from last run via session log file);
wenzelm
parents:
51118
diff
changeset
|
28 |
val fork: int -> (unit -> 'a) -> 'a future |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
29 |
val peek_futures: int -> Future.group list |
52765
260949bf6529
actually purge removed goal futures -- avoid memory leak;
wenzelm
parents:
52764
diff
changeset
|
30 |
val purge_futures: int list -> unit |
49931
85780e6f8fd2
more basic Goal.reset_futures as snapshot of implicit state;
wenzelm
parents:
49893
diff
changeset
|
31 |
val reset_futures: unit -> Future.group list |
51276 | 32 |
val shutdown_futures: unit -> unit |
52499 | 33 |
val skip_proofs_enabled: unit -> bool |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
34 |
val future_enabled: int -> bool |
51423
e5f9a6d9ca82
clarified parallel_subproofs_saturation (blind guess) vs. parallel_subproofs_threshold (precient timing estimate);
wenzelm
parents:
51276
diff
changeset
|
35 |
val future_enabled_timing: Time.time -> bool |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28619
diff
changeset
|
36 |
val future_result: Proof.context -> thm future -> term -> thm |
23356 | 37 |
val prove_internal: cterm list -> cterm -> (thm list -> tactic) -> thm |
51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
38 |
val is_schematic: term -> bool |
20290 | 39 |
val prove_multi: Proof.context -> string list -> term list -> term list -> |
40 |
({prems: thm list, context: Proof.context} -> tactic) -> thm list |
|
28446
a01de3b3fa2e
renamed promise to future, tuned related interfaces;
wenzelm
parents:
28363
diff
changeset
|
41 |
val prove_future: Proof.context -> string list -> term list -> term -> |
28340 | 42 |
({prems: thm list, context: Proof.context} -> tactic) -> thm |
20290 | 43 |
val prove: Proof.context -> string list -> term list -> term -> |
44 |
({prems: thm list, context: Proof.context} -> tactic) -> thm |
|
51118
32a5994dd205
tuned signature -- legacy packages might want to fork proofs as well;
wenzelm
parents:
51110
diff
changeset
|
45 |
val prove_global_future: theory -> string list -> term list -> term -> |
32a5994dd205
tuned signature -- legacy packages might want to fork proofs as well;
wenzelm
parents:
51110
diff
changeset
|
46 |
({prems: thm list, context: Proof.context} -> tactic) -> thm |
26713
1c6181def1d0
prove_global: Variable.set_body true, pass context;
wenzelm
parents:
26628
diff
changeset
|
47 |
val prove_global: theory -> string list -> term list -> term -> |
1c6181def1d0
prove_global: Variable.set_body true, pass context;
wenzelm
parents:
26628
diff
changeset
|
48 |
({prems: thm list, context: Proof.context} -> tactic) -> thm |
51551 | 49 |
val prove_sorry: Proof.context -> string list -> term list -> term -> |
50 |
({prems: thm list, context: Proof.context} -> tactic) -> thm |
|
51 |
val prove_sorry_global: theory -> string list -> term list -> term -> |
|
52 |
({prems: thm list, context: Proof.context} -> tactic) -> thm |
|
52458
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
53 |
val restrict: int -> int -> thm -> thm |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
54 |
val unrestrict: int -> thm -> thm |
23418 | 55 |
val conjunction_tac: int -> tactic |
23414
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
56 |
val precise_conjunction_tac: int -> int -> tactic |
23418 | 57 |
val recover_conjunction_tac: tactic |
21687 | 58 |
val norm_hhf_tac: int -> tactic |
23237 | 59 |
val assume_rule_tac: Proof.context -> int -> tactic |
17980 | 60 |
end; |
61 |
||
62 |
structure Goal: GOAL = |
|
63 |
struct |
|
64 |
||
18027
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
65 |
(** goals **) |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
66 |
|
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
67 |
(* |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
68 |
-------- (init) |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
69 |
C ==> #C |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
70 |
*) |
20290 | 71 |
val init = |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
21687
diff
changeset
|
72 |
let val A = #1 (Thm.dest_implies (Thm.cprop_of Drule.protectI)) |
20290 | 73 |
in fn C => Thm.instantiate ([], [(A, C)]) Drule.protectI end; |
17980 | 74 |
|
75 |
(* |
|
52456 | 76 |
A1 ==> ... ==> An ==> C |
77 |
------------------------ (protect n) |
|
78 |
A1 ==> ... ==> An ==> #C |
|
17980 | 79 |
*) |
52456 | 80 |
fun protect n th = Drule.comp_no_flatten (th, n) 1 Drule.protectI; |
17980 | 81 |
|
82 |
(* |
|
18027
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
83 |
A ==> ... ==> #C |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
84 |
---------------- (conclude) |
17980 | 85 |
A ==> ... ==> C |
86 |
*) |
|
29345 | 87 |
fun conclude th = Drule.comp_no_flatten (th, Thm.nprems_of th) 1 Drule.protectD; |
17980 | 88 |
|
89 |
(* |
|
18027
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
90 |
#C |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
91 |
--- (finish) |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
92 |
C |
17983 | 93 |
*) |
32197 | 94 |
fun check_finished ctxt th = |
51608 | 95 |
if Thm.no_prems th then th |
96 |
else |
|
51958
bca32217b304
retain goal display options when printing error messages, to avoid breakdown for huge goals;
wenzelm
parents:
51608
diff
changeset
|
97 |
raise THM ("Proof failed.\n" ^ Pretty.string_of (Goal_Display.pretty_goal ctxt th), 0, [th]); |
32197 | 98 |
|
49845 | 99 |
fun finish ctxt = check_finished ctxt #> conclude; |
17980 | 100 |
|
101 |
||
18027
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
102 |
|
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
103 |
(** results **) |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
104 |
|
28340 | 105 |
(* normal form *) |
106 |
||
21604
1af327306c8e
added norm/close_result (supercede local_standard etc.);
wenzelm
parents:
21579
diff
changeset
|
107 |
val norm_result = |
1af327306c8e
added norm/close_result (supercede local_standard etc.);
wenzelm
parents:
21579
diff
changeset
|
108 |
Drule.flexflex_unique |
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
39125
diff
changeset
|
109 |
#> Raw_Simplifier.norm_hhf_protect |
21604
1af327306c8e
added norm/close_result (supercede local_standard etc.);
wenzelm
parents:
21579
diff
changeset
|
110 |
#> Thm.strip_shyps |
1af327306c8e
added norm/close_result (supercede local_standard etc.);
wenzelm
parents:
21579
diff
changeset
|
111 |
#> Drule.zero_var_indexes; |
1af327306c8e
added norm/close_result (supercede local_standard etc.);
wenzelm
parents:
21579
diff
changeset
|
112 |
|
1af327306c8e
added norm/close_result (supercede local_standard etc.);
wenzelm
parents:
21579
diff
changeset
|
113 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
114 |
(* forked proofs *) |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
115 |
|
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
116 |
local |
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
117 |
|
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
118 |
val forked_proofs = |
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
119 |
Synchronized.var "forked_proofs" |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
120 |
(Inttab.empty: Future.group list Inttab.table); |
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
121 |
|
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
122 |
fun register_forked id future = |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
123 |
Synchronized.change forked_proofs |
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
124 |
(Inttab.cons_list (id, Task_Queue.group_of_task (Future.task_of future))); |
37186
349e9223c685
explicit markup for forked goals, as indicated by Goal.fork;
wenzelm
parents:
36613
diff
changeset
|
125 |
|
49036
4680c4046814
further refinement of command status, to accomodate forked proofs;
wenzelm
parents:
49012
diff
changeset
|
126 |
fun status task markups = |
50201
c26369c9eda6
Isabelle-specific implementation of quasi-abstract markup elements -- back to module arrangement before d83797ef0d2d;
wenzelm
parents:
49931
diff
changeset
|
127 |
let val props = Markup.properties [(Markup.taskN, Task_Queue.str_of_task task)] |
49036
4680c4046814
further refinement of command status, to accomodate forked proofs;
wenzelm
parents:
49012
diff
changeset
|
128 |
in Output.status (implode (map (Markup.markup_only o props) markups)) end; |
49009 | 129 |
|
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
130 |
in |
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
131 |
|
51605
eca8acb42e4a
more explicit Goal.fork_params -- avoid implicit arguments via thread data;
wenzelm
parents:
51553
diff
changeset
|
132 |
fun fork_params {name, pos, pri} e = |
51607
ee3398dfee9a
recover implicit thread position for status messages (cf. eca8acb42e4a);
wenzelm
parents:
51605
diff
changeset
|
133 |
uninterruptible (fn _ => Position.setmp_thread_data pos (fn () => |
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
134 |
let |
50914
fe4714886d92
identify future results more carefully, to avoid odd duplication of error messages, notably from forked goals;
wenzelm
parents:
50911
diff
changeset
|
135 |
val id = the_default 0 (Position.parse_id pos); |
fe4714886d92
identify future results more carefully, to avoid odd duplication of error messages, notably from forked goals;
wenzelm
parents:
50911
diff
changeset
|
136 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
137 |
val future = |
44302 | 138 |
(singleton o Future.forks) |
51222
8c3e5fb41139
improved scheduling of forked proofs, based on elapsed time estimate (from last run via session log file);
wenzelm
parents:
51118
diff
changeset
|
139 |
{name = name, group = NONE, deps = [], pri = pri, interrupts = false} |
49036
4680c4046814
further refinement of command status, to accomodate forked proofs;
wenzelm
parents:
49012
diff
changeset
|
140 |
(fn () => |
4680c4046814
further refinement of command status, to accomodate forked proofs;
wenzelm
parents:
49012
diff
changeset
|
141 |
let |
4680c4046814
further refinement of command status, to accomodate forked proofs;
wenzelm
parents:
49012
diff
changeset
|
142 |
val task = the (Future.worker_task ()); |
50201
c26369c9eda6
Isabelle-specific implementation of quasi-abstract markup elements -- back to module arrangement before d83797ef0d2d;
wenzelm
parents:
49931
diff
changeset
|
143 |
val _ = status task [Markup.running]; |
50914
fe4714886d92
identify future results more carefully, to avoid odd duplication of error messages, notably from forked goals;
wenzelm
parents:
50911
diff
changeset
|
144 |
val result = |
fe4714886d92
identify future results more carefully, to avoid odd duplication of error messages, notably from forked goals;
wenzelm
parents:
50911
diff
changeset
|
145 |
Exn.capture (Future.interruptible_task e) () |
fe4714886d92
identify future results more carefully, to avoid odd duplication of error messages, notably from forked goals;
wenzelm
parents:
50911
diff
changeset
|
146 |
|> Future.identify_result pos; |
50201
c26369c9eda6
Isabelle-specific implementation of quasi-abstract markup elements -- back to module arrangement before d83797ef0d2d;
wenzelm
parents:
49931
diff
changeset
|
147 |
val _ = status task [Markup.finished, Markup.joined]; |
49036
4680c4046814
further refinement of command status, to accomodate forked proofs;
wenzelm
parents:
49012
diff
changeset
|
148 |
val _ = |
49041
9edfd36a0355
more informative error message from failed goal forks (violating old-style TTY protocol!);
wenzelm
parents:
49037
diff
changeset
|
149 |
(case result of |
9edfd36a0355
more informative error message from failed goal forks (violating old-style TTY protocol!);
wenzelm
parents:
49037
diff
changeset
|
150 |
Exn.Res _ => () |
9edfd36a0355
more informative error message from failed goal forks (violating old-style TTY protocol!);
wenzelm
parents:
49037
diff
changeset
|
151 |
| Exn.Exn exn => |
49830
28d207ba9340
no special treatment of errors inside goal forks without transaction id, to avoid duplication in plain build with sequential log, for example;
wenzelm
parents:
49829
diff
changeset
|
152 |
if id = 0 orelse Exn.is_interrupt exn then () |
49829
2bc5924b117f
do not treat interrupt as error here, to avoid confusion in log etc.;
wenzelm
parents:
49061
diff
changeset
|
153 |
else |
50201
c26369c9eda6
Isabelle-specific implementation of quasi-abstract markup elements -- back to module arrangement before d83797ef0d2d;
wenzelm
parents:
49931
diff
changeset
|
154 |
(status task [Markup.failed]; |
c26369c9eda6
Isabelle-specific implementation of quasi-abstract markup elements -- back to module arrangement before d83797ef0d2d;
wenzelm
parents:
49931
diff
changeset
|
155 |
Output.report (Markup.markup_only Markup.bad); |
50914
fe4714886d92
identify future results more carefully, to avoid odd duplication of error messages, notably from forked goals;
wenzelm
parents:
50911
diff
changeset
|
156 |
List.app (Future.error_msg pos) (ML_Compiler.exn_messages_ids exn))); |
49036
4680c4046814
further refinement of command status, to accomodate forked proofs;
wenzelm
parents:
49012
diff
changeset
|
157 |
in Exn.release result end); |
50201
c26369c9eda6
Isabelle-specific implementation of quasi-abstract markup elements -- back to module arrangement before d83797ef0d2d;
wenzelm
parents:
49931
diff
changeset
|
158 |
val _ = status (Future.task_of future) [Markup.forked]; |
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
159 |
val _ = register_forked id future; |
51607
ee3398dfee9a
recover implicit thread position for status messages (cf. eca8acb42e4a);
wenzelm
parents:
51605
diff
changeset
|
160 |
in future end)) (); |
29448
34b9652b2f45
added Goal.future_enabled abstraction -- now also checks that this is already
wenzelm
parents:
29435
diff
changeset
|
161 |
|
51605
eca8acb42e4a
more explicit Goal.fork_params -- avoid implicit arguments via thread data;
wenzelm
parents:
51553
diff
changeset
|
162 |
fun fork pri e = |
eca8acb42e4a
more explicit Goal.fork_params -- avoid implicit arguments via thread data;
wenzelm
parents:
51553
diff
changeset
|
163 |
fork_params {name = "Goal.fork", pos = Position.thread_data (), pri = pri} e; |
41677 | 164 |
|
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
165 |
fun peek_futures id = |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
166 |
Inttab.lookup_list (Synchronized.value forked_proofs) id; |
52775
e0169f13bd37
keep memo_exec execution running, which is important to cancel goal forks eventually;
wenzelm
parents:
52765
diff
changeset
|
167 |
|
52765
260949bf6529
actually purge removed goal futures -- avoid memory leak;
wenzelm
parents:
52764
diff
changeset
|
168 |
fun purge_futures ids = |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
169 |
Synchronized.change forked_proofs (fn tab => |
52765
260949bf6529
actually purge removed goal futures -- avoid memory leak;
wenzelm
parents:
52764
diff
changeset
|
170 |
let |
260949bf6529
actually purge removed goal futures -- avoid memory leak;
wenzelm
parents:
52764
diff
changeset
|
171 |
val tab' = fold Inttab.delete_safe ids tab; |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
172 |
val () = |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
173 |
Inttab.fold (fn (id, groups) => fn () => |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
174 |
if Inttab.defined tab' id then () |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
175 |
else groups |> List.app (fn group => |
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
176 |
if Task_Queue.is_canceled group then () |
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
177 |
else raise Fail ("Attempt to purge valid execution " ^ string_of_int id))) tab (); |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
178 |
in tab' end); |
52765
260949bf6529
actually purge removed goal futures -- avoid memory leak;
wenzelm
parents:
52764
diff
changeset
|
179 |
|
49931
85780e6f8fd2
more basic Goal.reset_futures as snapshot of implicit state;
wenzelm
parents:
49893
diff
changeset
|
180 |
fun reset_futures () = |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
181 |
Synchronized.change_result forked_proofs (fn tab => |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
182 |
let val groups = Inttab.fold (fold cons o #2) tab [] |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
183 |
in (groups, Inttab.empty) end); |
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
184 |
|
51276 | 185 |
fun shutdown_futures () = |
186 |
(Future.shutdown (); |
|
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
53189
diff
changeset
|
187 |
(case maps Task_Queue.group_status (reset_futures ()) of |
51276 | 188 |
[] => () |
189 |
| exns => raise Par_Exn.make exns)); |
|
190 |
||
49061
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
191 |
end; |
7449b804073b
central management of forked goals wrt. transaction id;
wenzelm
parents:
49041
diff
changeset
|
192 |
|
41677 | 193 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
194 |
(* scheduling parameters *) |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
195 |
|
52499 | 196 |
fun skip_proofs_enabled () = |
52710
52790e3961fe
just one option "skip_proofs", without direct access within the editor (it makes document processing stateful without strong reasons -- monotonic updates already handle goal forks smoothly);
wenzelm
parents:
52696
diff
changeset
|
197 |
let val skip = Options.default_bool "skip_proofs" in |
52499 | 198 |
if Proofterm.proofs_enabled () andalso skip then |
199 |
(warning "Proof terms enabled -- cannot skip proofs"; false) |
|
200 |
else skip |
|
201 |
end; |
|
202 |
||
32738 | 203 |
val parallel_proofs = Unsynchronized.ref 1; |
29448
34b9652b2f45
added Goal.future_enabled abstraction -- now also checks that this is already
wenzelm
parents:
29435
diff
changeset
|
204 |
|
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
205 |
fun future_enabled n = |
49012
8686c36fa27d
refined treatment of forked proofs at transaction boundaries, including proof commands (see also 7ee000ce5390);
wenzelm
parents:
49009
diff
changeset
|
206 |
Multithreading.enabled () andalso ! parallel_proofs >= n andalso |
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41683
diff
changeset
|
207 |
is_some (Future.worker_task ()); |
32061
11f8ee55662d
parallel_proofs: more fine-grained control with optional parallel checking of nested Isar proofs;
wenzelm
parents:
32058
diff
changeset
|
208 |
|
51423
e5f9a6d9ca82
clarified parallel_subproofs_saturation (blind guess) vs. parallel_subproofs_threshold (precient timing estimate);
wenzelm
parents:
51276
diff
changeset
|
209 |
fun future_enabled_timing t = |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
210 |
future_enabled 1 andalso |
52104 | 211 |
Time.toReal t >= Options.default_real "parallel_subproofs_threshold"; |
29448
34b9652b2f45
added Goal.future_enabled abstraction -- now also checks that this is already
wenzelm
parents:
29435
diff
changeset
|
212 |
|
34b9652b2f45
added Goal.future_enabled abstraction -- now also checks that this is already
wenzelm
parents:
29435
diff
changeset
|
213 |
|
28446
a01de3b3fa2e
renamed promise to future, tuned related interfaces;
wenzelm
parents:
28363
diff
changeset
|
214 |
(* future_result *) |
28340 | 215 |
|
28446
a01de3b3fa2e
renamed promise to future, tuned related interfaces;
wenzelm
parents:
28363
diff
changeset
|
216 |
fun future_result ctxt result prop = |
28340 | 217 |
let |
42360 | 218 |
val thy = Proof_Context.theory_of ctxt; |
28340 | 219 |
val cert = Thm.cterm_of thy; |
220 |
val certT = Thm.ctyp_of thy; |
|
221 |
||
30473
e0b66c11e7e4
Assumption.all_prems_of, Assumption.all_assms_of;
wenzelm
parents:
29448
diff
changeset
|
222 |
val assms = Assumption.all_assms_of ctxt; |
28340 | 223 |
val As = map Thm.term_of assms; |
224 |
||
225 |
val xs = map Free (fold Term.add_frees (prop :: As) []); |
|
226 |
val fixes = map cert xs; |
|
227 |
||
228 |
val tfrees = fold Term.add_tfrees (prop :: As) []; |
|
229 |
val instT = map (fn (a, S) => (certT (TVar ((a, 0), S)), certT (TFree (a, S)))) tfrees; |
|
230 |
||
231 |
val global_prop = |
|
45344
e209da839ff4
added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents:
44302
diff
changeset
|
232 |
cert (Logic.varify_types_global (fold_rev Logic.all xs (Logic.list_implies (As, prop)))) |
32056
f4b74cbecdaf
future_result: explicitly impose Variable.sorts_of again;
wenzelm
parents:
30473
diff
changeset
|
233 |
|> Thm.weaken_sorts (Variable.sorts_of ctxt); |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28619
diff
changeset
|
234 |
val global_result = result |> Future.map |
33768
bba9eac8aa25
future_result: purge flexflex pairs, which should normally be trivial anyway -- prevent Thm.future_result from complaining about tpairs;
wenzelm
parents:
32788
diff
changeset
|
235 |
(Drule.flexflex_unique #> |
bba9eac8aa25
future_result: purge flexflex pairs, which should normally be trivial anyway -- prevent Thm.future_result from complaining about tpairs;
wenzelm
parents:
32788
diff
changeset
|
236 |
Thm.adjust_maxidx_thm ~1 #> |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28619
diff
changeset
|
237 |
Drule.implies_intr_list assms #> |
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28619
diff
changeset
|
238 |
Drule.forall_intr_list fixes #> |
36613
f3157c288aca
simplified primitive Thm.future: more direct theory check, do not hardwire strip_shyps here;
wenzelm
parents:
36610
diff
changeset
|
239 |
Thm.generalize (map #1 tfrees, []) 0 #> |
f3157c288aca
simplified primitive Thm.future: more direct theory check, do not hardwire strip_shyps here;
wenzelm
parents:
36610
diff
changeset
|
240 |
Thm.strip_shyps); |
28340 | 241 |
val local_result = |
32056
f4b74cbecdaf
future_result: explicitly impose Variable.sorts_of again;
wenzelm
parents:
30473
diff
changeset
|
242 |
Thm.future global_result global_prop |
50987
616789281413
always close derivation at the bottom of forked proofs (despite increased non-determinism of proof terms) -- improve parallel performance by avoiding dynamic dependency within large Isar proofs, e.g. Slicing/JinjaVM/SemanticsWF.thy in AFP/bf9b14cbc707;
wenzelm
parents:
50974
diff
changeset
|
243 |
|> Thm.close_derivation |
28340 | 244 |
|> Thm.instantiate (instT, []) |
245 |
|> Drule.forall_elim_list fixes |
|
246 |
|> fold (Thm.elim_implies o Thm.assume) assms; |
|
247 |
in local_result end; |
|
248 |
||
249 |
||
18027
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
250 |
|
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
251 |
(** tactical theorem proving **) |
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
252 |
|
23356 | 253 |
(* prove_internal -- minimal checks, no normalization of result! *) |
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
254 |
|
23356 | 255 |
fun prove_internal casms cprop tac = |
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
256 |
(case SINGLE (tac (map Assumption.assume casms)) (init cprop) of |
32197 | 257 |
SOME th => Drule.implies_intr_list casms |
258 |
(finish (Syntax.init_pretty_global (Thm.theory_of_thm th)) th) |
|
38875
c7a66b584147
tuned messages: discontinued spurious full-stops (messages are occasionally composed unexpectedly);
wenzelm
parents:
38236
diff
changeset
|
259 |
| NONE => error "Tactic failed"); |
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
260 |
|
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
261 |
|
51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
262 |
(* prove variations *) |
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
263 |
|
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
264 |
fun is_schematic t = |
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
265 |
Term.exists_subterm Term.is_Var t orelse |
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
266 |
Term.exists_type (Term.exists_subtype Term.is_TVar) t; |
17986 | 267 |
|
52811
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
268 |
fun prove_common immediate pri ctxt xs asms props tac = |
17980 | 269 |
let |
42360 | 270 |
val thy = Proof_Context.theory_of ctxt; |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26713
diff
changeset
|
271 |
val string_of_term = Syntax.string_of_term ctxt; |
20056 | 272 |
|
51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
273 |
val schematic = exists is_schematic props; |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
274 |
val future = future_enabled 1; |
52499 | 275 |
val skip = not immediate andalso not schematic andalso future andalso skip_proofs_enabled (); |
51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
276 |
|
28355 | 277 |
val pos = Position.thread_data (); |
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
278 |
fun err msg = cat_error msg |
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
279 |
("The error(s) above occurred for the goal statement:\n" ^ |
28355 | 280 |
string_of_term (Logic.list_implies (asms, Logic.mk_conjunction_list props)) ^ |
48992 | 281 |
(case Position.here pos of "" => "" | s => "\n" ^ s)); |
17980 | 282 |
|
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
283 |
fun cert_safe t = Thm.cterm_of thy (Envir.beta_norm (Term.no_dummy_patterns t)) |
17980 | 284 |
handle TERM (msg, _) => err msg | TYPE (msg, _, _) => err msg; |
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
285 |
val casms = map cert_safe asms; |
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
286 |
val cprops = map cert_safe props; |
17980 | 287 |
|
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
288 |
val (prems, ctxt') = ctxt |
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
289 |
|> Variable.add_fixes_direct xs |
27218
4548c83cd508
prove: full Variable.declare_term, including constraints;
wenzelm
parents:
26939
diff
changeset
|
290 |
|> fold Variable.declare_term (asms @ props) |
26713
1c6181def1d0
prove_global: Variable.set_body true, pass context;
wenzelm
parents:
26628
diff
changeset
|
291 |
|> Assumption.add_assumes casms |
1c6181def1d0
prove_global: Variable.set_body true, pass context;
wenzelm
parents:
26628
diff
changeset
|
292 |
||> Variable.set_body true; |
28619
89f9dd800a22
prove_common: include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28446
diff
changeset
|
293 |
val sorts = Variable.sorts_of ctxt'; |
17980 | 294 |
|
28619
89f9dd800a22
prove_common: include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28446
diff
changeset
|
295 |
val stmt = Thm.weaken_sorts sorts (Conjunction.mk_conjunction_balanced cprops); |
28340 | 296 |
|
51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
297 |
fun tac' args st = |
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
298 |
if skip then ALLGOALS Skip_Proof.cheat_tac st before Skip_Proof.report ctxt |
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
299 |
else tac args st; |
28340 | 300 |
fun result () = |
51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
301 |
(case SINGLE (tac' {prems = prems, context = ctxt'}) (init stmt) of |
38875
c7a66b584147
tuned messages: discontinued spurious full-stops (messages are occasionally composed unexpectedly);
wenzelm
parents:
38236
diff
changeset
|
302 |
NONE => err "Tactic failed" |
28340 | 303 |
| SOME st => |
32197 | 304 |
let val res = finish ctxt' st handle THM (msg, _, _) => err msg in |
28619
89f9dd800a22
prove_common: include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28446
diff
changeset
|
305 |
if Unify.matches_list thy [Thm.term_of stmt] [Thm.prop_of res] |
89f9dd800a22
prove_common: include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28446
diff
changeset
|
306 |
then Thm.check_shyps sorts res |
28340 | 307 |
else err ("Proved a different theorem: " ^ string_of_term (Thm.prop_of res)) |
308 |
end); |
|
309 |
val res = |
|
51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51552
diff
changeset
|
310 |
if immediate orelse schematic orelse not future orelse skip |
29088
95a239a5e055
future proofs: more robust check via Future.enabled;
wenzelm
parents:
28973
diff
changeset
|
311 |
then result () |
52811
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
312 |
else future_result ctxt' (fork pri result) (Thm.term_of stmt); |
17980 | 313 |
in |
28340 | 314 |
Conjunction.elim_balanced (length props) res |
20290 | 315 |
|> map (Assumption.export false ctxt' ctxt) |
20056 | 316 |
|> Variable.export ctxt' ctxt |
20250
c3f209752749
prove: proper assumption context, more tactic arguments;
wenzelm
parents:
20228
diff
changeset
|
317 |
|> map Drule.zero_var_indexes |
17980 | 318 |
end; |
319 |
||
52811
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
320 |
val prove_multi = prove_common true 0; |
17980 | 321 |
|
52811
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
322 |
fun prove_future_pri pri ctxt xs asms prop tac = |
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
323 |
hd (prove_common false pri ctxt xs asms [prop] tac); |
51118
32a5994dd205
tuned signature -- legacy packages might want to fork proofs as well;
wenzelm
parents:
51110
diff
changeset
|
324 |
|
52811
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
325 |
val prove_future = prove_future_pri ~1; |
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
326 |
|
dae6c61f991e
clarified priority of "skipped" proofs, which might take long but do not produce relevant information (potential conflict of quick interactive feedback vs. performance in batch mode);
wenzelm
parents:
52775
diff
changeset
|
327 |
fun prove ctxt xs asms prop tac = hd (prove_multi ctxt xs asms [prop] tac); |
20056 | 328 |
|
51118
32a5994dd205
tuned signature -- legacy packages might want to fork proofs as well;
wenzelm
parents:
51110
diff
changeset
|
329 |
fun prove_global_future thy xs asms prop tac = |
32a5994dd205
tuned signature -- legacy packages might want to fork proofs as well;
wenzelm
parents:
51110
diff
changeset
|
330 |
Drule.export_without_context (prove_future (Proof_Context.init_global thy) xs asms prop tac); |
32a5994dd205
tuned signature -- legacy packages might want to fork proofs as well;
wenzelm
parents:
51110
diff
changeset
|
331 |
|
20056 | 332 |
fun prove_global thy xs asms prop tac = |
42360 | 333 |
Drule.export_without_context (prove (Proof_Context.init_global thy) xs asms prop tac); |
18027
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
334 |
|
51551 | 335 |
fun prove_sorry ctxt xs asms prop tac = |
52059 | 336 |
if Config.get ctxt quick_and_dirty then |
51552
c713c9505f68
clarified Skip_Proof.cheat_tac: more standard tactic;
wenzelm
parents:
51551
diff
changeset
|
337 |
prove ctxt xs asms prop (fn _ => ALLGOALS Skip_Proof.cheat_tac) |
53189
ee8b8dafef0e
discontinued parallel_subproofs_saturation and related internal counters (superseded by parallel_subproofs_threshold and timing information);
wenzelm
parents:
52811
diff
changeset
|
338 |
else (if future_enabled 1 then prove_future_pri ~2 else prove) ctxt xs asms prop tac; |
51551 | 339 |
|
340 |
fun prove_sorry_global thy xs asms prop tac = |
|
341 |
Drule.export_without_context |
|
342 |
(prove_sorry (Proof_Context.init_global thy) xs asms prop tac); |
|
343 |
||
18027
09ab79d4e8e1
renamed Goal constant to prop, more general protect/unprotect interfaces;
wenzelm
parents:
17986
diff
changeset
|
344 |
|
17980 | 345 |
|
21687 | 346 |
(** goal structure **) |
347 |
||
52458
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
348 |
(* rearrange subgoals *) |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
349 |
|
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
350 |
fun restrict i n st = |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
351 |
if i < 1 orelse n < 1 orelse i + n - 1 > Thm.nprems_of st |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
352 |
then raise THM ("Goal.restrict", i, [st]) |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
353 |
else rotate_prems (i - 1) st |> protect n; |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
354 |
|
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
355 |
fun unrestrict i = conclude #> rotate_prems (1 - i); |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
356 |
|
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
357 |
(*with structural marker*) |
17980 | 358 |
fun SELECT_GOAL tac i st = |
19191 | 359 |
if Thm.nprems_of st = 1 andalso i = 1 then tac st |
52458
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
360 |
else (PRIMITIVE (restrict i 1) THEN tac THEN PRIMITIVE (unrestrict i)) st; |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
361 |
|
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
362 |
(*without structural marker*) |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
363 |
fun PREFER_GOAL tac i st = |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
364 |
if i < 1 orelse i > Thm.nprems_of st then Seq.empty |
210bca64b894
less intrusive SELECT_GOAL: merely rearrange subgoals without detaching goal state, and thus preserve maxidx context;
wenzelm
parents:
52456
diff
changeset
|
365 |
else (PRIMITIVE (rotate_prems (i - 1)) THEN tac THEN PRIMITIVE (rotate_prems (1 - i))) st; |
17980 | 366 |
|
21687 | 367 |
|
368 |
(* multiple goals *) |
|
369 |
||
23418 | 370 |
fun precise_conjunction_tac 0 i = eq_assume_tac i |
371 |
| precise_conjunction_tac 1 i = SUBGOAL (K all_tac) i |
|
372 |
| precise_conjunction_tac n i = PRIMITIVE (Drule.with_subgoal i (Conjunction.curry_balanced n)); |
|
23414
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
373 |
|
23418 | 374 |
val adhoc_conjunction_tac = REPEAT_ALL_NEW |
375 |
(SUBGOAL (fn (goal, i) => |
|
376 |
if can Logic.dest_conjunction goal then rtac Conjunction.conjunctionI i |
|
377 |
else no_tac)); |
|
21687 | 378 |
|
23418 | 379 |
val conjunction_tac = SUBGOAL (fn (goal, i) => |
380 |
precise_conjunction_tac (length (Logic.dest_conjunctions goal)) i ORELSE |
|
381 |
TRY (adhoc_conjunction_tac i)); |
|
21687 | 382 |
|
23418 | 383 |
val recover_conjunction_tac = PRIMITIVE (fn th => |
384 |
Conjunction.uncurry_balanced (Thm.nprems_of th) th); |
|
23414
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
385 |
|
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
386 |
fun PRECISE_CONJUNCTS n tac = |
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
387 |
SELECT_GOAL (precise_conjunction_tac n 1 |
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
388 |
THEN tac |
23418 | 389 |
THEN recover_conjunction_tac); |
23414
927203ad4b3a
tuned conjunction tactics: slightly smaller proof terms;
wenzelm
parents:
23356
diff
changeset
|
390 |
|
21687 | 391 |
fun CONJUNCTS tac = |
392 |
SELECT_GOAL (conjunction_tac 1 |
|
393 |
THEN tac |
|
23418 | 394 |
THEN recover_conjunction_tac); |
21687 | 395 |
|
396 |
||
397 |
(* hhf normal form *) |
|
398 |
||
399 |
val norm_hhf_tac = |
|
400 |
rtac Drule.asm_rl (*cheap approximation -- thanks to builtin Logic.flatten_params*) |
|
401 |
THEN' SUBGOAL (fn (t, i) => |
|
402 |
if Drule.is_norm_hhf t then all_tac |
|
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
39125
diff
changeset
|
403 |
else rewrite_goal_tac Drule.norm_hhf_eqs i); |
21687 | 404 |
|
23237 | 405 |
|
406 |
(* non-atomic goal assumptions *) |
|
407 |
||
23356 | 408 |
fun non_atomic (Const ("==>", _) $ _ $ _) = true |
409 |
| non_atomic (Const ("all", _) $ _) = true |
|
410 |
| non_atomic _ = false; |
|
411 |
||
23237 | 412 |
fun assume_rule_tac ctxt = norm_hhf_tac THEN' CSUBGOAL (fn (goal, i) => |
413 |
let |
|
42495
1af81b70cf09
clarified Variable.focus vs. Variable.focus_cterm -- eliminated clone;
wenzelm
parents:
42371
diff
changeset
|
414 |
val ((_, goal'), ctxt') = Variable.focus_cterm goal ctxt; |
23237 | 415 |
val goal'' = Drule.cterm_rule (singleton (Variable.export ctxt' ctxt)) goal'; |
23356 | 416 |
val Rs = filter (non_atomic o Thm.term_of) (Drule.strip_imp_prems goal''); |
23237 | 417 |
val tacs = Rs |> map (fn R => |
52732 | 418 |
etac (Raw_Simplifier.norm_hhf (Thm.trivial R)) THEN_ALL_NEW assume_tac); |
23237 | 419 |
in fold_rev (curry op APPEND') tacs (K no_tac) i end); |
420 |
||
32365 | 421 |
|
52461
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
422 |
|
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
423 |
(** parallel tacticals **) |
32365 | 424 |
|
52461
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
425 |
(* parallel choice of single results *) |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
426 |
|
32365 | 427 |
fun PARALLEL_CHOICE tacs st = |
428 |
(case Par_List.get_some (fn tac => SINGLE tac st) tacs of |
|
429 |
NONE => Seq.empty |
|
430 |
| SOME st' => Seq.single st'); |
|
431 |
||
52461
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
432 |
|
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
433 |
(* parallel refinement of non-schematic goal by single results *) |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
434 |
|
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
435 |
local |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
436 |
|
32788
a65deb8f9434
PARALLEL_GOALS: proper scope for exception FAILED, with dummy argument to prevent its interpretation as variable;
wenzelm
parents:
32738
diff
changeset
|
437 |
exception FAILED of unit; |
52461
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
438 |
|
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
439 |
fun retrofit st' = |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
440 |
rotate_prems ~1 #> |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
441 |
Thm.bicompose {flatten = false, match = false, incremented = false} |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
442 |
(false, conclude st', Thm.nprems_of st') 1; |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
443 |
|
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
444 |
in |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
445 |
|
42370 | 446 |
fun PARALLEL_GOALS tac = |
447 |
Thm.adjust_maxidx_thm ~1 #> |
|
448 |
(fn st => |
|
42371
5900f06b4198
enable PARALLEL_GOALS more liberally, unlike forked proofs (cf. 34b9652b2f45);
wenzelm
parents:
42370
diff
changeset
|
449 |
if not (Multithreading.enabled ()) orelse Thm.maxidx_of st >= 0 orelse Thm.nprems_of st <= 1 |
42370 | 450 |
then DETERM tac st |
451 |
else |
|
452 |
let |
|
453 |
fun try_tac g = |
|
454 |
(case SINGLE tac g of |
|
455 |
NONE => raise FAILED () |
|
456 |
| SOME g' => g'); |
|
32365 | 457 |
|
42370 | 458 |
val goals = Drule.strip_imp_prems (Thm.cprop_of st); |
459 |
val results = Par_List.map (try_tac o init) goals; |
|
52461
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
460 |
in EVERY (map retrofit (rev results)) st end |
42370 | 461 |
handle FAILED () => Seq.empty); |
32365 | 462 |
|
18207 | 463 |
end; |
464 |
||
52461
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
465 |
end; |
ef4c16887f83
more scalable PARALLEL_GOALS, using more elementary retrofit;
wenzelm
parents:
52458
diff
changeset
|
466 |
|
32365 | 467 |
structure Basic_Goal: BASIC_GOAL = Goal; |
468 |
open Basic_Goal; |