author | ballarin |
Thu, 10 Feb 2005 12:06:40 +0100 | |
changeset 15519 | 7751ed89ab50 |
parent 15431 | 6f4959ba7664 |
child 15531 | 08c8dad8e399 |
permissions | -rw-r--r-- |
5828 | 1 |
(* Title: Pure/Isar/toplevel.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
5 |
The Isabelle/Isar toplevel. |
|
6 |
*) |
|
7 |
||
8 |
signature TOPLEVEL = |
|
9 |
sig |
|
10 |
datatype node = Theory of theory | Proof of ProofHistory.T |
|
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
11 |
| SkipProof of int History.T * theory |
5828 | 12 |
type state |
13 |
val toplevel: state |
|
7732 | 14 |
val is_toplevel: state -> bool |
6689 | 15 |
val prompt_state_default: state -> string |
16 |
val prompt_state_fn: (state -> string) ref |
|
7308 | 17 |
val print_state_context: state -> unit |
8886 | 18 |
val print_state_default: bool -> state -> unit |
19 |
val print_state_fn: (bool -> state -> unit) ref |
|
20 |
val print_state: bool -> state -> unit |
|
12423 | 21 |
val pretty_state: bool -> state -> Pretty.T list |
6689 | 22 |
exception UNDEF |
23 |
val node_history_of: state -> node History.T |
|
5828 | 24 |
val node_of: state -> node |
6664 | 25 |
val node_case: (theory -> 'a) -> (Proof.state -> 'a) -> state -> 'a |
5828 | 26 |
val theory_of: state -> theory |
27 |
val sign_of: state -> Sign.sg |
|
7501 | 28 |
val context_of: state -> Proof.context |
5828 | 29 |
val proof_of: state -> Proof.state |
9453 | 30 |
val enter_forward_proof: state -> Proof.state |
5828 | 31 |
type transition |
32 |
exception TERMINATE |
|
5990 | 33 |
exception RESTART |
6689 | 34 |
val undo_limit: bool -> int option |
5828 | 35 |
val empty: transition |
14923 | 36 |
val name_of: transition -> string |
37 |
val source_of: transition -> OuterLex.token list option |
|
5828 | 38 |
val name: string -> transition -> transition |
39 |
val position: Position.T -> transition -> transition |
|
14923 | 40 |
val source: OuterLex.token list -> transition -> transition |
5828 | 41 |
val interactive: bool -> transition -> transition |
42 |
val print: transition -> transition |
|
9010 | 43 |
val no_timing: transition -> transition |
5828 | 44 |
val reset: transition -> transition |
8465 | 45 |
val init: (bool -> node) -> (node -> unit) -> (node -> unit) -> transition -> transition |
6689 | 46 |
val exit: transition -> transition |
47 |
val kill: transition -> transition |
|
5828 | 48 |
val keep: (state -> unit) -> transition -> transition |
7612 | 49 |
val keep': (bool -> state -> unit) -> transition -> transition |
6689 | 50 |
val history: (node History.T -> node History.T) -> transition -> transition |
5828 | 51 |
val imperative: (unit -> unit) -> transition -> transition |
7105 | 52 |
val init_theory: (bool -> theory) -> (theory -> unit) -> (theory -> unit) |
6689 | 53 |
-> transition -> transition |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
54 |
val skip_proofs: bool ref |
5828 | 55 |
val theory: (theory -> theory) -> transition -> transition |
7612 | 56 |
val theory': (bool -> theory -> theory) -> transition -> transition |
6689 | 57 |
val theory_to_proof: (bool -> theory -> ProofHistory.T) -> transition -> transition |
5828 | 58 |
val proof: (ProofHistory.T -> ProofHistory.T) -> transition -> transition |
6689 | 59 |
val proof': (bool -> ProofHistory.T -> ProofHistory.T) -> transition -> transition |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
60 |
val proof'': (ProofHistory.T -> ProofHistory.T) -> transition -> transition |
5828 | 61 |
val proof_to_theory: (ProofHistory.T -> theory) -> transition -> transition |
12315 | 62 |
val proof_to_theory': (bool -> ProofHistory.T -> theory) -> transition -> transition |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
63 |
val skip_proof: (int History.T -> int History.T) -> transition -> transition |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
64 |
val skip_proof_to_theory: (int History.T -> bool) -> transition -> transition |
9512 | 65 |
val unknown_theory: transition -> transition |
66 |
val unknown_proof: transition -> transition |
|
67 |
val unknown_context: transition -> transition |
|
7198 | 68 |
val quiet: bool ref |
15519 | 69 |
val debug: bool ref |
5922 | 70 |
val exn_message: exn -> string |
5828 | 71 |
val apply: bool -> transition -> state -> (state * (exn * string) option) option |
15431
6f4959ba7664
excursion_result now also passes previous state to presentation functions.
berghofe
parents:
15237
diff
changeset
|
72 |
val excursion_result: ((transition * (state -> state -> 'a -> 'a)) list * 'a) -> 'a |
5828 | 73 |
val excursion: transition list -> unit |
74 |
val set_state: state -> unit |
|
75 |
val get_state: unit -> state |
|
76 |
val exn: unit -> (exn * string) option |
|
77 |
val >> : transition -> bool |
|
14985 | 78 |
val >>> : transition list -> unit |
14091 | 79 |
type 'a isar |
80 |
val loop: 'a isar -> unit |
|
5828 | 81 |
end; |
82 |
||
6965 | 83 |
structure Toplevel: TOPLEVEL = |
5828 | 84 |
struct |
85 |
||
86 |
||
87 |
(** toplevel state **) |
|
88 |
||
89 |
(* datatype node *) |
|
90 |
||
91 |
datatype node = |
|
92 |
Theory of theory | |
|
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
93 |
Proof of ProofHistory.T | |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
94 |
SkipProof of int History.T * theory; |
5828 | 95 |
|
6689 | 96 |
fun str_of_node (Theory _) = "in theory mode" |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
97 |
| str_of_node _ = "in proof mode"; |
6689 | 98 |
|
12423 | 99 |
fun pretty_context thy = [Pretty.block |
8561 | 100 |
[Pretty.str "theory", Pretty.brk 1, Pretty.str (PureThy.get_name thy), |
12423 | 101 |
Pretty.str " =", Pretty.brk 1, Display.pretty_theory thy]]; |
7308 | 102 |
|
12423 | 103 |
fun pretty_prf prf = Proof.pretty_state (ProofHistory.position prf) (ProofHistory.current prf); |
8886 | 104 |
|
12423 | 105 |
fun pretty_node_context (Theory thy) = pretty_context thy |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
106 |
| pretty_node_context (Proof prf) = pretty_context (Proof.theory_of (ProofHistory.current prf)) |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
107 |
| pretty_node_context _ = []; |
7308 | 108 |
|
12423 | 109 |
fun pretty_node prf_only (Theory thy) = if prf_only then [] else pretty_context thy |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
110 |
| pretty_node _ (Proof prf) = pretty_prf prf |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
111 |
| pretty_node _ _ = []; |
5828 | 112 |
|
113 |
||
114 |
(* datatype state *) |
|
115 |
||
8465 | 116 |
datatype state = State of (node History.T * ((node -> unit) * (node -> unit))) option; |
5828 | 117 |
|
8465 | 118 |
val toplevel = State None; |
5828 | 119 |
|
8465 | 120 |
fun is_toplevel (State None) = true |
7732 | 121 |
| is_toplevel _ = false; |
122 |
||
8465 | 123 |
fun str_of_state (State None) = "at top level" |
124 |
| str_of_state (State (Some (node, _))) = str_of_node (History.current node); |
|
6689 | 125 |
|
126 |
||
127 |
(* prompt_state hook *) |
|
128 |
||
8465 | 129 |
fun prompt_state_default (State _) = Source.default_prompt; |
6689 | 130 |
|
131 |
val prompt_state_fn = ref prompt_state_default; |
|
132 |
fun prompt_state state = ! prompt_state_fn state; |
|
5828 | 133 |
|
134 |
||
7308 | 135 |
(* print state *) |
5946
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
136 |
|
12423 | 137 |
fun pretty_current_node _ (State None) = [] |
138 |
| pretty_current_node prt (State (Some (node, _))) = prt (History.current node); |
|
7308 | 139 |
|
12423 | 140 |
val print_state_context = |
141 |
Pretty.writeln o Pretty.chunks o pretty_current_node pretty_node_context; |
|
5946
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
142 |
|
12423 | 143 |
fun pretty_state prf_only state = |
11894 | 144 |
let val ref (begin_state, end_state, _) = Display.current_goals_markers in |
12423 | 145 |
(case pretty_current_node (pretty_node prf_only) state of [] => [] |
146 |
| prts => |
|
147 |
(if begin_state = "" then [] else [Pretty.str begin_state]) @ prts @ |
|
148 |
(if end_state = "" then [] else [Pretty.str end_state])) |
|
5946
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
149 |
end; |
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
150 |
|
12423 | 151 |
fun print_state_default prf_only state = Pretty.writelns (pretty_state prf_only state); |
5946
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
152 |
val print_state_fn = ref print_state_default; |
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
153 |
fun print_state state = ! print_state_fn state; |
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
154 |
|
a4600d21b59b
print_state hook, obeys Goals.current_goals_markers by default;
wenzelm
parents:
5939
diff
changeset
|
155 |
|
5828 | 156 |
(* top node *) |
157 |
||
6689 | 158 |
exception UNDEF; |
159 |
||
8465 | 160 |
fun node_history_of (State None) = raise UNDEF |
161 |
| node_history_of (State (Some (node, _))) = node; |
|
6689 | 162 |
|
163 |
val node_of = History.current o node_history_of; |
|
5828 | 164 |
|
6664 | 165 |
fun node_case f g state = |
5828 | 166 |
(case node_of state of |
167 |
Theory thy => f thy |
|
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
168 |
| SkipProof (i, thy) => f thy |
5828 | 169 |
| Proof prf => g (ProofHistory.current prf)); |
170 |
||
6664 | 171 |
val theory_of = node_case I Proof.theory_of; |
7501 | 172 |
val context_of = node_case ProofContext.init Proof.context_of; |
5828 | 173 |
val sign_of = Theory.sign_of o theory_of; |
6664 | 174 |
val proof_of = node_case (fn _ => raise UNDEF) I; |
175 |
||
12049 | 176 |
val enter_forward_proof = node_case Proof.init_state Proof.enter_forward; |
5828 | 177 |
|
178 |
||
179 |
(** toplevel transitions **) |
|
180 |
||
181 |
exception TERMINATE; |
|
5990 | 182 |
exception RESTART; |
7022 | 183 |
exception EXCURSION_FAIL of exn * string; |
6689 | 184 |
exception FAILURE of state * exn; |
5828 | 185 |
|
186 |
||
6689 | 187 |
(* recovery from stale signatures *) |
188 |
||
7022 | 189 |
(*note: proof commands should be non-destructive!*) |
190 |
||
6689 | 191 |
local |
192 |
||
193 |
fun is_stale state = Sign.is_stale (sign_of state) handle UNDEF => false; |
|
194 |
||
195 |
fun checkpoint_node true (Theory thy) = Theory (PureThy.checkpoint thy) |
|
196 |
| checkpoint_node _ node = node; |
|
197 |
||
198 |
fun copy_node true (Theory thy) = Theory (Theory.copy thy) |
|
199 |
| copy_node _ node = node; |
|
200 |
||
6965 | 201 |
fun interruptible f x = |
202 |
let val y = ref (None: node History.T option); |
|
12987 | 203 |
in raise_interrupt (fn () => y := Some (f x)) (); the (! y) end; |
6965 | 204 |
|
7022 | 205 |
val rollback = ERROR_MESSAGE "Stale signature encountered after succesful execution!"; |
206 |
||
207 |
fun return (result, None) = result |
|
208 |
| return (result, Some exn) = raise FAILURE (result, exn); |
|
209 |
||
6689 | 210 |
in |
211 |
||
8465 | 212 |
fun node_trans _ _ _ (State None) = raise UNDEF |
213 |
| node_trans int hist f (State (Some (node, term))) = |
|
6689 | 214 |
let |
8465 | 215 |
fun mk_state nd = State (Some (nd, term)); |
6689 | 216 |
|
217 |
val cont_node = History.map (checkpoint_node int) node; |
|
218 |
val back_node = History.map (copy_node int) cont_node; |
|
219 |
||
220 |
val trans = if hist then History.apply_copy (copy_node int) else History.map; |
|
6965 | 221 |
val (result, opt_exn) = |
222 |
(mk_state (transform_error (interruptible (trans (f int))) cont_node), None) |
|
223 |
handle exn => (mk_state cont_node, Some exn); |
|
6689 | 224 |
in |
7022 | 225 |
if is_stale result then return (mk_state back_node, Some (if_none opt_exn rollback)) |
226 |
else return (result, opt_exn) |
|
6689 | 227 |
end; |
228 |
||
229 |
fun check_stale state = |
|
230 |
if not (is_stale state) then () |
|
7022 | 231 |
else warning "Stale signature encountered! Should restart current theory."; |
6689 | 232 |
|
233 |
end; |
|
234 |
||
235 |
||
236 |
(* primitive transitions *) |
|
237 |
||
238 |
(*Important note: recovery from stale signatures is provided only for |
|
239 |
theory-level operations via MapCurrent and AppCurrent. Other node |
|
6965 | 240 |
or state operations should not touch signatures at all. |
241 |
||
242 |
Also note that interrupts are enabled for Keep, MapCurrent, and |
|
243 |
AppCurrent only.*) |
|
5828 | 244 |
|
245 |
datatype trans = |
|
6689 | 246 |
Reset | (*empty toplevel*) |
8465 | 247 |
Init of (bool -> node) * ((node -> unit) * (node -> unit)) | |
248 |
(*init node; provide exit/kill operation*) |
|
249 |
Exit | (*conclude node*) |
|
6689 | 250 |
Kill | (*abort node*) |
7612 | 251 |
Keep of bool -> state -> unit | (*peek at state*) |
6689 | 252 |
History of node History.T -> node History.T | (*history operation (undo etc.)*) |
253 |
MapCurrent of bool -> node -> node | (*change node, bypassing history*) |
|
254 |
AppCurrent of bool -> node -> node; (*change node, recording history*) |
|
255 |
||
256 |
fun undo_limit int = if int then None else Some 0; |
|
257 |
||
258 |
local |
|
5828 | 259 |
|
6689 | 260 |
fun apply_tr _ Reset _ = toplevel |
8465 | 261 |
| apply_tr int (Init (f, term)) (State None) = |
262 |
State (Some (History.init (undo_limit int) (f int), term)) |
|
263 |
| apply_tr _ (Init _ ) (State (Some _)) = raise UNDEF |
|
264 |
| apply_tr _ Exit (State None) = raise UNDEF |
|
265 |
| apply_tr _ Exit (State (Some (node, (exit, _)))) = |
|
266 |
(exit (History.current node); State None) |
|
267 |
| apply_tr _ Kill (State None) = raise UNDEF |
|
268 |
| apply_tr _ Kill (State (Some (node, (_, kill)))) = |
|
269 |
(kill (History.current node); State None) |
|
12987 | 270 |
| apply_tr int (Keep f) state = (raise_interrupt (f int) state; state) |
8465 | 271 |
| apply_tr _ (History _) (State None) = raise UNDEF |
272 |
| apply_tr _ (History f) (State (Some (node, term))) = State (Some (f node, term)) |
|
6689 | 273 |
| apply_tr int (MapCurrent f) state = node_trans int false f state |
274 |
| apply_tr int (AppCurrent f) state = node_trans int true f state; |
|
5828 | 275 |
|
6689 | 276 |
fun apply_union _ [] state = raise FAILURE (state, UNDEF) |
277 |
| apply_union int (tr :: trs) state = |
|
278 |
transform_error (apply_tr int tr) state |
|
279 |
handle UNDEF => apply_union int trs state |
|
280 |
| FAILURE (alt_state, UNDEF) => apply_union int trs alt_state |
|
281 |
| exn as FAILURE _ => raise exn |
|
282 |
| exn => raise FAILURE (state, exn); |
|
283 |
||
284 |
in |
|
285 |
||
286 |
fun apply_trans int trs state = (apply_union int trs state, None) |
|
287 |
handle FAILURE (alt_state, exn) => (alt_state, Some exn) | exn => (state, Some exn); |
|
288 |
||
289 |
end; |
|
5828 | 290 |
|
291 |
||
292 |
(* datatype transition *) |
|
293 |
||
294 |
datatype transition = Transition of |
|
295 |
{name: string, |
|
296 |
pos: Position.T, |
|
14923 | 297 |
source: OuterLex.token list option, |
5828 | 298 |
int_only: bool, |
299 |
print: bool, |
|
9010 | 300 |
no_timing: bool, |
5828 | 301 |
trans: trans list}; |
302 |
||
14923 | 303 |
fun make_transition (name, pos, source, int_only, print, no_timing, trans) = |
304 |
Transition {name = name, pos = pos, source = source, |
|
305 |
int_only = int_only, print = print, no_timing = no_timing, trans = trans}; |
|
5828 | 306 |
|
14923 | 307 |
fun map_transition f (Transition {name, pos, source, int_only, print, no_timing, trans}) = |
308 |
make_transition (f (name, pos, source, int_only, print, no_timing, trans)); |
|
5828 | 309 |
|
14923 | 310 |
val empty = make_transition ("<unknown>", Position.none, None, false, false, false, []); |
311 |
||
312 |
fun name_of (Transition {name, ...}) = name; |
|
313 |
fun source_of (Transition {source, ...}) = source; |
|
5828 | 314 |
|
315 |
||
316 |
(* diagnostics *) |
|
317 |
||
318 |
fun str_of_transition (Transition {name, pos, ...}) = quote name ^ Position.str_of pos; |
|
319 |
||
320 |
fun command_msg msg tr = msg ^ "command " ^ str_of_transition tr; |
|
321 |
fun at_command tr = command_msg "At " tr ^ "."; |
|
322 |
||
323 |
fun type_error tr state = |
|
6689 | 324 |
ERROR_MESSAGE (command_msg "Illegal application of " tr ^ " " ^ str_of_state state); |
5828 | 325 |
|
326 |
||
327 |
(* modify transitions *) |
|
328 |
||
14923 | 329 |
fun name nm = map_transition (fn (_, pos, source, int_only, print, no_timing, trans) => |
330 |
(nm, pos, source, int_only, print, no_timing, trans)); |
|
5828 | 331 |
|
14923 | 332 |
fun position pos = map_transition (fn (name, _, source, int_only, print, no_timing, trans) => |
333 |
(name, pos, source, int_only, print, no_timing, trans)); |
|
9010 | 334 |
|
14923 | 335 |
fun source src = map_transition (fn (name, pos, _, int_only, print, no_timing, trans) => |
336 |
(name, pos, Some src, int_only, print, no_timing, trans)); |
|
5828 | 337 |
|
14923 | 338 |
fun interactive int_only = map_transition (fn (name, pos, source, _, print, no_timing, trans) => |
339 |
(name, pos, source, int_only, print, no_timing, trans)); |
|
340 |
||
341 |
val print = map_transition (fn (name, pos, source, int_only, _, no_timing, trans) => |
|
342 |
(name, pos, source, int_only, true, no_timing, trans)); |
|
5828 | 343 |
|
14923 | 344 |
val no_timing = map_transition (fn (name, pos, source, int_only, print, _, trans) => |
345 |
(name, pos, source, int_only, print, true, trans)); |
|
5828 | 346 |
|
14923 | 347 |
fun add_trans tr = map_transition (fn (name, pos, source, int_only, print, no_timing, trans) => |
348 |
(name, pos, source, int_only, print, no_timing, trans @ [tr])); |
|
5828 | 349 |
|
350 |
||
351 |
(* build transitions *) |
|
352 |
||
353 |
val reset = add_trans Reset; |
|
6689 | 354 |
fun init f exit kill = add_trans (Init (f, (exit, kill))); |
355 |
val exit = add_trans Exit; |
|
356 |
val kill = add_trans Kill; |
|
7612 | 357 |
val keep' = add_trans o Keep; |
6689 | 358 |
val history = add_trans o History; |
5828 | 359 |
val map_current = add_trans o MapCurrent; |
6689 | 360 |
val app_current = add_trans o AppCurrent; |
5828 | 361 |
|
7612 | 362 |
fun keep f = add_trans (Keep (fn _ => f)); |
5828 | 363 |
fun imperative f = keep (fn _ => f ()); |
364 |
||
6689 | 365 |
fun init_theory f exit kill = |
8465 | 366 |
init (fn int => Theory (f int)) |
6689 | 367 |
(fn Theory thy => exit thy | _ => raise UNDEF) |
368 |
(fn Theory thy => kill thy | _ => raise UNDEF); |
|
5828 | 369 |
|
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
370 |
(* |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
371 |
The skip_proofs flag allows proof scripts to be skipped during interactive |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
372 |
proof in order to speed up processing of large theories. While in skipping |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
373 |
mode, states are represented as SkipProof (h, thy), where h contains a |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
374 |
counter for the number of open proof blocks. |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
375 |
*) |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
376 |
|
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
377 |
val skip_proofs = ref false; |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
378 |
|
6689 | 379 |
fun theory f = app_current (fn _ => (fn Theory thy => Theory (f thy) | _ => raise UNDEF)); |
7612 | 380 |
fun theory' f = app_current (fn int => (fn Theory thy => Theory (f int thy) | _ => raise UNDEF)); |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
381 |
fun theory_to_proof f = app_current (fn int => |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
382 |
(fn Theory thy => |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
383 |
if !skip_proofs then SkipProof (History.init (undo_limit int) 0, |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
384 |
fst (SkipProof.global_skip_proof int (ProofHistory.current (f int thy)))) |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
385 |
else Proof (f int thy) |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
386 |
| _ => raise UNDEF)); |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
387 |
fun proof''' b f = map_current (fn int => (fn Proof prf => Proof (f int prf) |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
388 |
| SkipProof (h, thy) => if b then SkipProof (History.apply I h, thy) else raise UNDEF |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
389 |
| _ => raise UNDEF)); |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
390 |
val proof' = proof''' true; |
6689 | 391 |
val proof = proof' o K; |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
392 |
val proof'' = proof''' false o K; |
12315 | 393 |
fun proof_to_theory' f = |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
394 |
map_current (fn int => (fn Proof prf => Theory (f int prf) |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
395 |
| SkipProof (h, thy) => if History.current h = 0 then Theory thy else raise UNDEF |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
396 |
| _ => raise UNDEF)); |
12315 | 397 |
val proof_to_theory = proof_to_theory' o K; |
15237
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
398 |
fun skip_proof f = map_current (fn int => |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
399 |
(fn SkipProof (h, thy) => SkipProof (f h, thy) | _ => raise UNDEF)); |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
400 |
fun skip_proof_to_theory p = map_current (fn int => |
250e9be7a09d
Some changes to allow skipping of proof scripts.
berghofe
parents:
14985
diff
changeset
|
401 |
(fn SkipProof (h, thy) => if p h then Theory thy else raise UNDEF | _ => raise UNDEF)); |
5828 | 402 |
|
9512 | 403 |
val unknown_theory = imperative (fn () => warning "Unknown theory context"); |
404 |
val unknown_proof = imperative (fn () => warning "Unknown proof context"); |
|
405 |
val unknown_context = imperative (fn () => warning "Unknown context"); |
|
406 |
||
5828 | 407 |
|
408 |
||
409 |
(** toplevel transactions **) |
|
410 |
||
7198 | 411 |
val quiet = ref false; |
15519 | 412 |
val debug = ref false; (* Verbose messages for core exceptions. *) |
5828 | 413 |
|
414 |
(* print exceptions *) |
|
415 |
||
416 |
fun raised name = "exception " ^ name ^ " raised"; |
|
417 |
fun raised_msg name msg = raised name ^ ": " ^ msg; |
|
418 |
||
15519 | 419 |
fun msg_on_debug (THM (msg, i, thms)) = |
420 |
if !debug |
|
421 |
then raised_msg ("THM " ^ string_of_int i) |
|
422 |
(cat_lines ("" :: msg :: map Display.string_of_thm thms)) |
|
423 |
else raised_msg "THM" msg |
|
424 |
| msg_on_debug (THEORY (msg, thys)) = |
|
425 |
if !debug |
|
426 |
then raised_msg "THEORY" (cat_lines ("" :: msg :: |
|
427 |
map (Pretty.string_of o Display.pretty_theory) thys)) |
|
428 |
else msg |
|
429 |
| msg_on_debug (TERM (msg, ts)) = |
|
430 |
(case (!debug, Context.get_context ()) of |
|
431 |
(true, Some thy) => |
|
432 |
let val sg = Theory.sign_of thy in |
|
433 |
raised_msg "TERM" |
|
434 |
(cat_lines |
|
435 |
("" :: msg :: map (Sign.string_of_term sg) ts)) |
|
436 |
end |
|
437 |
| _ => raised_msg "TERM" msg) |
|
438 |
| msg_on_debug (TYPE (msg, Ts, ts)) = |
|
439 |
(case (!debug, Context.get_context ()) of |
|
440 |
(true, Some thy) => |
|
441 |
let val sg = Theory.sign_of thy in |
|
442 |
raised_msg "TYPE" |
|
443 |
(cat_lines |
|
444 |
("" :: msg :: map (Sign.string_of_typ sg) Ts @ |
|
445 |
map (Sign.string_of_term sg) ts)) |
|
446 |
end |
|
447 |
| _ => raised_msg "TYPE" msg) |
|
448 |
||
449 |
(* |
|
450 |
(writeln ("Exception THM " ^ string_of_int i ^ " raised:\n" ^ msg); |
|
451 |
seq print_thm thms) |
|
452 |
| THEORY (msg,thys) => |
|
453 |
(writeln ("Exception THEORY raised:\n" ^ msg); |
|
454 |
seq (Pretty.writeln o Display.pretty_theory) thys) |
|
455 |
| TERM (msg,ts) => |
|
456 |
(writeln ("Exception TERM raised:\n" ^ msg); |
|
457 |
seq (writeln o Sign.string_of_term sign) ts) |
|
458 |
| TYPE (msg,Ts,ts) => |
|
459 |
(writeln ("Exception TYPE raised:\n" ^ msg); |
|
460 |
seq (writeln o Sign.string_of_typ sign) Ts; |
|
461 |
seq (writeln o Sign.string_of_term sign) ts) |
|
462 |
*) |
|
463 |
||
5828 | 464 |
fun exn_message TERMINATE = "Exit." |
5990 | 465 |
| exn_message RESTART = "Restart." |
7022 | 466 |
| exn_message (EXCURSION_FAIL (exn, msg)) = cat_lines [exn_message exn, msg] |
6971 | 467 |
| exn_message Interrupt = "Interrupt." |
6002 | 468 |
| exn_message ERROR = "ERROR." |
5828 | 469 |
| exn_message (ERROR_MESSAGE msg) = msg |
15519 | 470 |
| exn_message (THEORY (msg, thys)) = msg_on_debug (THEORY (msg, thys)) |
5828 | 471 |
| exn_message (ProofContext.CONTEXT (msg, _)) = msg |
472 |
| exn_message (Proof.STATE (msg, _)) = msg |
|
473 |
| exn_message (ProofHistory.FAIL msg) = msg |
|
13486
54464ea94d6f
exception SIMPROC_FAIL: solid error reporting of simprocs;
wenzelm
parents:
12987
diff
changeset
|
474 |
| exn_message (MetaSimplifier.SIMPROC_FAIL (name, exn)) = |
54464ea94d6f
exception SIMPROC_FAIL: solid error reporting of simprocs;
wenzelm
parents:
12987
diff
changeset
|
475 |
fail_message "simproc" ((name, Position.none), exn) |
5920 | 476 |
| exn_message (Attrib.ATTRIB_FAIL info) = fail_message "attribute" info |
477 |
| exn_message (Method.METHOD_FAIL info) = fail_message "method" info |
|
12881 | 478 |
| exn_message (Antiquote.ANTIQUOTE_FAIL info) = fail_message "antiquotation" info |
5828 | 479 |
| exn_message (Syntax.AST (msg, _)) = raised_msg "AST" msg |
15519 | 480 |
| exn_message (TYPE (msg, Ts, ts)) = msg_on_debug (TYPE (msg, Ts, ts)) |
481 |
| exn_message (TERM (msg, ts)) = msg_on_debug (TERM (msg, ts)) |
|
482 |
| exn_message (THM (msg, i, thms)) = msg_on_debug (THM (msg, i, thms)) |
|
5828 | 483 |
| exn_message Library.OPTION = raised "Library.OPTION" |
484 |
| exn_message (Library.LIST msg) = raised_msg "Library.LIST" msg |
|
5920 | 485 |
| exn_message exn = General.exnMessage exn |
486 |
and fail_message kind ((name, pos), exn) = |
|
9152 | 487 |
"Error in " ^ kind ^ " " ^ quote name ^ Position.str_of pos ^ ":\n" ^ exn_message exn; |
5828 | 488 |
|
489 |
fun print_exn None = () |
|
490 |
| print_exn (Some (exn, s)) = error_msg (cat_lines [exn_message exn, s]); |
|
491 |
||
492 |
||
493 |
(* apply transitions *) |
|
494 |
||
6664 | 495 |
local |
496 |
||
9010 | 497 |
fun app int (tr as Transition {trans, int_only, print, no_timing, ...}) state = |
5828 | 498 |
let |
499 |
val _ = |
|
500 |
if int orelse not int_only then () |
|
8722 | 501 |
else warning (command_msg "Interactive-only " tr); |
6689 | 502 |
val (result, opt_exn) = |
14825 | 503 |
(if ! Output.timing andalso not no_timing then (warning (command_msg "" tr); timeap) else I) |
9010 | 504 |
(apply_trans int trans) state; |
8886 | 505 |
val _ = if int andalso print andalso not (! quiet) then print_state false result else (); |
6689 | 506 |
in (result, apsome (fn UNDEF => type_error tr state | exn => exn) opt_exn) end; |
6664 | 507 |
|
508 |
in |
|
5828 | 509 |
|
6689 | 510 |
fun apply int tr st = |
6965 | 511 |
(case app int tr st of |
6689 | 512 |
(_, Some TERMINATE) => None |
6664 | 513 |
| (_, Some RESTART) => Some (toplevel, None) |
7022 | 514 |
| (state', Some (EXCURSION_FAIL exn_info)) => Some (state', Some exn_info) |
6689 | 515 |
| (state', Some exn) => Some (state', Some (exn, at_command tr)) |
516 |
| (state', None) => Some (state', None)); |
|
6664 | 517 |
|
518 |
end; |
|
5828 | 519 |
|
520 |
||
521 |
(* excursion: toplevel -- apply transformers -- toplevel *) |
|
522 |
||
6664 | 523 |
local |
524 |
||
5828 | 525 |
fun excur [] x = x |
9134 | 526 |
| excur ((tr, f) :: trs) (st, res) = |
527 |
(case apply false tr st of |
|
528 |
Some (st', None) => |
|
15431
6f4959ba7664
excursion_result now also passes previous state to presentation functions.
berghofe
parents:
15237
diff
changeset
|
529 |
excur trs (st', transform_error (fn () => f st st' res) () handle exn => |
10324 | 530 |
raise EXCURSION_FAIL (exn, "Presentation failed\n" ^ at_command tr)) |
9134 | 531 |
| Some (st', Some exn_info) => raise EXCURSION_FAIL exn_info |
7022 | 532 |
| None => raise EXCURSION_FAIL (TERMINATE, at_command tr)); |
5828 | 533 |
|
6664 | 534 |
in |
535 |
||
9134 | 536 |
fun excursion_result (trs, res) = |
537 |
(case excur trs (State None, res) of |
|
538 |
(State None, res') => res' |
|
539 |
| _ => raise ERROR_MESSAGE "Unfinished development at end of input") |
|
540 |
handle exn => error (exn_message exn); |
|
541 |
||
5828 | 542 |
fun excursion trs = |
15431
6f4959ba7664
excursion_result now also passes previous state to presentation functions.
berghofe
parents:
15237
diff
changeset
|
543 |
excursion_result (map (fn tr => (tr, fn _ => fn _ => fn _ => ())) trs, ()); |
7062 | 544 |
|
6664 | 545 |
end; |
546 |
||
5828 | 547 |
|
548 |
||
549 |
(** interactive transformations **) |
|
550 |
||
551 |
(* the global state reference *) |
|
552 |
||
6689 | 553 |
val global_state = ref (toplevel, None: (exn * string) option); |
5828 | 554 |
|
555 |
fun set_state state = global_state := (state, None); |
|
556 |
fun get_state () = fst (! global_state); |
|
557 |
fun exn () = snd (! global_state); |
|
558 |
||
559 |
||
6965 | 560 |
(* the Isar source of transitions *) |
561 |
||
14091 | 562 |
type 'a isar = |
6965 | 563 |
(transition, (transition option, |
12881 | 564 |
(OuterLex.token, (OuterLex.token option, (OuterLex.token, (OuterLex.token, |
14091 | 565 |
Position.T * (Symbol.symbol, (string, 'a) Source.source) Source.source) |
12881 | 566 |
Source.source) Source.source) Source.source) Source.source) Source.source) Source.source; |
6965 | 567 |
|
568 |
||
5828 | 569 |
(* apply transformers to global state *) |
570 |
||
14985 | 571 |
nonfix >> >>>; |
5828 | 572 |
|
573 |
fun >> tr = |
|
574 |
(case apply true tr (get_state ()) of |
|
575 |
None => false |
|
576 |
| Some (state', exn_info) => |
|
577 |
(global_state := (state', exn_info); |
|
578 |
check_stale state'; print_exn exn_info; |
|
579 |
true)); |
|
580 |
||
14985 | 581 |
fun >>> [] = () |
582 |
| >>> (tr :: trs) = if >> tr then >>> trs else (); |
|
583 |
||
7602 | 584 |
(*Note: this is for Poly/ML only, we really do not intend to exhibit |
585 |
interrupts here*) |
|
586 |
fun get_interrupt src = Some (Source.get_single src) handle Interrupt => None; |
|
587 |
||
5828 | 588 |
fun raw_loop src = |
7602 | 589 |
(case get_interrupt (Source.set_prompt (prompt_state (get_state ())) src) of |
6971 | 590 |
None => (writeln "\nInterrupt."; raw_loop src) |
5828 | 591 |
| Some None => () |
592 |
| Some (Some (tr, src')) => if >> tr then raw_loop src' else ()); |
|
593 |
||
594 |
||
12987 | 595 |
fun loop src = ignore_interrupt raw_loop src; |
5828 | 596 |
|
597 |
||
598 |
end; |