src/Pure/Isar/toplevel.ML
author wenzelm
Mon Aug 09 22:21:35 1999 +0200 (1999-08-09 ago)
changeset 7198 680d43e41b0d
parent 7105 dcd7ac72f1e7
child 7308 e01aab03a2a1
permissions -rw-r--r--
tuned print_state;
quiet flag;
wenzelm@5828
     1
(*  Title:      Pure/Isar/toplevel.ML
wenzelm@5828
     2
    ID:         $Id$
wenzelm@5828
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5828
     4
wenzelm@5828
     5
The Isabelle/Isar toplevel.
wenzelm@5828
     6
*)
wenzelm@5828
     7
wenzelm@5828
     8
signature TOPLEVEL =
wenzelm@5828
     9
sig
wenzelm@5828
    10
  datatype node = Theory of theory | Proof of ProofHistory.T
wenzelm@5828
    11
  type state
wenzelm@5828
    12
  val toplevel: state
wenzelm@6689
    13
  val prompt_state_default: state -> string
wenzelm@6689
    14
  val prompt_state_fn: (state -> string) ref
wenzelm@5946
    15
  val print_state_default: state -> unit
wenzelm@5946
    16
  val print_state_fn: (state -> unit) ref
wenzelm@5828
    17
  val print_state: state -> unit
wenzelm@6689
    18
  exception UNDEF
wenzelm@6689
    19
  val node_history_of: state -> node History.T
wenzelm@5828
    20
  val node_of: state -> node
wenzelm@6664
    21
  val node_case: (theory -> 'a) -> (Proof.state -> 'a) -> state -> 'a
wenzelm@5828
    22
  val theory_of: state -> theory
wenzelm@5828
    23
  val sign_of: state -> Sign.sg
wenzelm@5828
    24
  val proof_of: state -> Proof.state
wenzelm@5828
    25
  type transition
wenzelm@5828
    26
  exception TERMINATE
wenzelm@5990
    27
  exception RESTART
wenzelm@6689
    28
  val undo_limit: bool -> int option
wenzelm@5828
    29
  val empty: transition
wenzelm@5828
    30
  val name: string -> transition -> transition
wenzelm@5828
    31
  val position: Position.T -> transition -> transition
wenzelm@5828
    32
  val interactive: bool -> transition -> transition
wenzelm@5828
    33
  val print: transition -> transition
wenzelm@5828
    34
  val reset: transition -> transition
wenzelm@7105
    35
  val init: (bool -> state -> node) -> (node -> unit) -> (node -> unit) -> transition -> transition
wenzelm@6689
    36
  val exit: transition -> transition
wenzelm@6689
    37
  val kill: transition -> transition
wenzelm@5828
    38
  val keep: (state -> unit) -> transition -> transition
wenzelm@6689
    39
  val history: (node History.T -> node History.T) -> transition -> transition
wenzelm@5828
    40
  val imperative: (unit -> unit) -> transition -> transition
wenzelm@7105
    41
  val init_theory: (bool -> theory) -> (theory -> unit) -> (theory -> unit)
wenzelm@6689
    42
    -> transition -> transition
wenzelm@5828
    43
  val theory: (theory -> theory) -> transition -> transition
wenzelm@6689
    44
  val theory_to_proof: (bool -> theory -> ProofHistory.T) -> transition -> transition
wenzelm@5828
    45
  val proof: (ProofHistory.T -> ProofHistory.T) -> transition -> transition
wenzelm@6689
    46
  val proof': (bool -> ProofHistory.T -> ProofHistory.T) -> transition -> transition
wenzelm@5828
    47
  val proof_to_theory: (ProofHistory.T -> theory) -> transition -> transition
wenzelm@7198
    48
  val quiet: bool ref
wenzelm@5828
    49
  val trace: bool ref
wenzelm@5922
    50
  val exn_message: exn -> string
wenzelm@5828
    51
  val apply: bool -> transition -> state -> (state * (exn * string) option) option
wenzelm@5828
    52
  val excursion: transition list -> unit
wenzelm@7062
    53
  val excursion_error: transition list -> unit
wenzelm@5828
    54
  val set_state: state -> unit
wenzelm@5828
    55
  val get_state: unit -> state
wenzelm@5828
    56
  val exn: unit -> (exn * string) option
wenzelm@5828
    57
  val >> : transition -> bool
wenzelm@6965
    58
  type isar
wenzelm@5828
    59
  val loop: isar -> unit
wenzelm@5828
    60
end;
wenzelm@5828
    61
wenzelm@6965
    62
structure Toplevel: TOPLEVEL =
wenzelm@5828
    63
struct
wenzelm@5828
    64
wenzelm@5828
    65
wenzelm@5828
    66
(** toplevel state **)
wenzelm@5828
    67
wenzelm@5828
    68
(* datatype node *)
wenzelm@5828
    69
wenzelm@5828
    70
datatype node =
wenzelm@5828
    71
  Theory of theory |
wenzelm@5828
    72
  Proof of ProofHistory.T;
wenzelm@5828
    73
wenzelm@6689
    74
fun str_of_node (Theory _) = "in theory mode"
wenzelm@6689
    75
  | str_of_node (Proof _) = "in proof mode";
wenzelm@6689
    76
wenzelm@5828
    77
fun print_node (Theory thy) = Pretty.writeln (Pretty.block
wenzelm@5828
    78
      [Pretty.str "Theory:", Pretty.brk 1, Pretty.str (PureThy.get_name thy),
wenzelm@5828
    79
        Pretty.str " =", Pretty.brk 1, Display.pretty_theory thy])
wenzelm@7198
    80
  | print_node (Proof prf) = Proof.print_state (ProofHistory.position prf) (ProofHistory.current prf);
wenzelm@5828
    81
wenzelm@5828
    82
wenzelm@5828
    83
(* datatype state *)
wenzelm@5828
    84
wenzelm@6689
    85
datatype state = State of (node History.T * ((node -> unit) * (node -> unit))) list;
wenzelm@5828
    86
wenzelm@5828
    87
val toplevel = State [];
wenzelm@5828
    88
wenzelm@5828
    89
fun str_of_state (State []) = "at top level"
wenzelm@6689
    90
  | str_of_state (State ((node, _) :: _)) = str_of_node (History.current node);
wenzelm@6689
    91
wenzelm@6689
    92
wenzelm@6689
    93
(* prompt_state hook *)
wenzelm@6689
    94
wenzelm@6689
    95
fun prompt_state_default (State nodes) =
wenzelm@6689
    96
  let val len = length nodes
wenzelm@6689
    97
  in (if len < 2 then "" else string_of_int len) ^ Source.default_prompt end;
wenzelm@6689
    98
wenzelm@6689
    99
val prompt_state_fn = ref prompt_state_default;
wenzelm@6689
   100
fun prompt_state state = ! prompt_state_fn state;
wenzelm@5828
   101
wenzelm@5828
   102
wenzelm@5946
   103
(* print_state hook *)
wenzelm@5946
   104
wenzelm@5946
   105
fun print_topnode (State []) = ()
wenzelm@6689
   106
  | print_topnode (State ((node, _) :: _)) = print_node (History.current node);
wenzelm@5946
   107
wenzelm@5946
   108
fun print_state_default state =
wenzelm@5946
   109
  let val ref (begin_state, end_state, _) = Goals.current_goals_markers in
wenzelm@5946
   110
    if begin_state = "" then () else writeln begin_state;
wenzelm@5946
   111
    print_topnode state;
wenzelm@5946
   112
    if end_state = "" then () else writeln end_state
wenzelm@5946
   113
  end;
wenzelm@5946
   114
wenzelm@5946
   115
val print_state_fn = ref print_state_default;
wenzelm@5946
   116
fun print_state state = ! print_state_fn state;
wenzelm@5946
   117
wenzelm@5946
   118
wenzelm@5828
   119
(* top node *)
wenzelm@5828
   120
wenzelm@6689
   121
exception UNDEF;
wenzelm@6689
   122
wenzelm@6689
   123
fun node_history_of (State []) = raise UNDEF
wenzelm@6689
   124
  | node_history_of (State ((node, _) :: _)) = node;
wenzelm@6689
   125
wenzelm@6689
   126
val node_of = History.current o node_history_of;
wenzelm@5828
   127
wenzelm@6664
   128
fun node_case f g state =
wenzelm@5828
   129
  (case node_of state of
wenzelm@5828
   130
    Theory thy => f thy
wenzelm@5828
   131
  | Proof prf => g (ProofHistory.current prf));
wenzelm@5828
   132
wenzelm@6664
   133
val theory_of = node_case I Proof.theory_of;
wenzelm@5828
   134
val sign_of = Theory.sign_of o theory_of;
wenzelm@6664
   135
val proof_of = node_case (fn _ => raise UNDEF) I;
wenzelm@6664
   136
wenzelm@5828
   137
wenzelm@5828
   138
wenzelm@5828
   139
(** toplevel transitions **)
wenzelm@5828
   140
wenzelm@5828
   141
exception TERMINATE;
wenzelm@5990
   142
exception RESTART;
wenzelm@7022
   143
exception EXCURSION_FAIL of exn * string;
wenzelm@6689
   144
exception FAILURE of state * exn;
wenzelm@5828
   145
wenzelm@5828
   146
wenzelm@6689
   147
(* recovery from stale signatures *)
wenzelm@6689
   148
wenzelm@7022
   149
(*note: proof commands should be non-destructive!*)
wenzelm@7022
   150
wenzelm@6689
   151
local
wenzelm@6689
   152
wenzelm@6689
   153
fun is_stale state = Sign.is_stale (sign_of state) handle UNDEF => false;
wenzelm@6689
   154
wenzelm@6689
   155
fun checkpoint_node true (Theory thy) = Theory (PureThy.checkpoint thy)
wenzelm@6689
   156
  | checkpoint_node _ node = node;
wenzelm@6689
   157
wenzelm@6689
   158
fun copy_node true (Theory thy) = Theory (Theory.copy thy)
wenzelm@6689
   159
  | copy_node _ node = node;
wenzelm@6689
   160
wenzelm@6965
   161
fun interruptible f x =
wenzelm@6965
   162
  let val y = ref (None: node History.T option);
wenzelm@6965
   163
  in exhibit_interrupt (fn () => y := Some (f x)) (); the (! y) end;
wenzelm@6965
   164
wenzelm@7022
   165
val rollback = ERROR_MESSAGE "Stale signature encountered after succesful execution!";
wenzelm@7022
   166
wenzelm@7022
   167
fun return (result, None) = result
wenzelm@7022
   168
  | return (result, Some exn) = raise FAILURE (result, exn);
wenzelm@7022
   169
wenzelm@6689
   170
in
wenzelm@6689
   171
wenzelm@6689
   172
fun node_trans _ _ _ (State []) = raise UNDEF
wenzelm@6689
   173
  | node_trans int hist f (State ((node, term) :: nodes)) =
wenzelm@6689
   174
      let
wenzelm@6689
   175
        fun mk_state nd = State ((nd, term) :: nodes);
wenzelm@6689
   176
wenzelm@6689
   177
        val cont_node = History.map (checkpoint_node int) node;
wenzelm@6689
   178
        val back_node = History.map (copy_node int) cont_node;
wenzelm@6689
   179
wenzelm@6689
   180
        val trans = if hist then History.apply_copy (copy_node int) else History.map;
wenzelm@6965
   181
        val (result, opt_exn) =
wenzelm@6965
   182
          (mk_state (transform_error (interruptible (trans (f int))) cont_node), None)
wenzelm@6965
   183
            handle exn => (mk_state cont_node, Some exn);
wenzelm@6689
   184
      in
wenzelm@7022
   185
        if is_stale result then return (mk_state back_node, Some (if_none opt_exn rollback))
wenzelm@7022
   186
        else return (result, opt_exn)
wenzelm@6689
   187
      end;
wenzelm@6689
   188
wenzelm@6689
   189
fun check_stale state =
wenzelm@6689
   190
  if not (is_stale state) then ()
wenzelm@7022
   191
  else warning "Stale signature encountered!  Should restart current theory.";
wenzelm@6689
   192
wenzelm@6689
   193
end;
wenzelm@6689
   194
wenzelm@6689
   195
wenzelm@6689
   196
(* primitive transitions *)
wenzelm@6689
   197
wenzelm@6689
   198
(*Important note: recovery from stale signatures is provided only for
wenzelm@6689
   199
  theory-level operations via MapCurrent and AppCurrent.  Other node
wenzelm@6965
   200
  or state operations should not touch signatures at all.
wenzelm@6965
   201
wenzelm@6965
   202
  Also note that interrupts are enabled for Keep, MapCurrent, and
wenzelm@6965
   203
  AppCurrent only.*)
wenzelm@5828
   204
wenzelm@5828
   205
datatype trans =
wenzelm@6689
   206
  Reset |                                       (*empty toplevel*)
wenzelm@7105
   207
  Init of (bool -> state -> node) * ((node -> unit) * (node -> unit)) |
wenzelm@6689
   208
    (*push node; provide exit/kill operation*)
wenzelm@6689
   209
  Exit |                                        (*pop node*)
wenzelm@6689
   210
  Kill |                                        (*abort node*)
wenzelm@6689
   211
  Keep of state -> unit |                       (*peek at state*)
wenzelm@6689
   212
  History of node History.T -> node History.T | (*history operation (undo etc.)*)
wenzelm@6689
   213
  MapCurrent of bool -> node -> node |          (*change node, bypassing history*)
wenzelm@6689
   214
  AppCurrent of bool -> node -> node;           (*change node, recording history*)
wenzelm@6689
   215
wenzelm@6689
   216
fun undo_limit int = if int then None else Some 0;
wenzelm@6689
   217
wenzelm@6689
   218
local
wenzelm@5828
   219
wenzelm@6689
   220
fun apply_tr _ Reset _ = toplevel
wenzelm@6689
   221
  | apply_tr int (Init (f, term)) (state as State nodes) =
wenzelm@7105
   222
      State ((History.init (undo_limit int) (f int state), term) :: nodes)
wenzelm@6689
   223
  | apply_tr _ Exit (State []) = raise UNDEF
wenzelm@6689
   224
  | apply_tr _ Exit (State ((node, (exit, _)):: nodes)) =
wenzelm@6689
   225
      (exit (History.current node); State nodes)
wenzelm@6689
   226
  | apply_tr _ Kill (State []) = raise UNDEF
wenzelm@6689
   227
  | apply_tr _ Kill (State ((node, (_, kill)) :: nodes)) =
wenzelm@6689
   228
      (kill (History.current node); State nodes)
wenzelm@6965
   229
  | apply_tr _ (Keep f) state = (exhibit_interrupt f state; state)
wenzelm@6689
   230
  | apply_tr _ (History _) (State []) = raise UNDEF
wenzelm@6689
   231
  | apply_tr _ (History f) (State ((node, term) :: nodes)) = State ((f node, term) :: nodes)
wenzelm@6689
   232
  | apply_tr int (MapCurrent f) state = node_trans int false f state
wenzelm@6689
   233
  | apply_tr int (AppCurrent f) state = node_trans int true f state;
wenzelm@5828
   234
wenzelm@6689
   235
fun apply_union _ [] state = raise FAILURE (state, UNDEF)
wenzelm@6689
   236
  | apply_union int (tr :: trs) state =
wenzelm@6689
   237
      transform_error (apply_tr int tr) state
wenzelm@6689
   238
        handle UNDEF => apply_union int trs state
wenzelm@6689
   239
          | FAILURE (alt_state, UNDEF) => apply_union int trs alt_state
wenzelm@6689
   240
          | exn as FAILURE _ => raise exn
wenzelm@6689
   241
          | exn => raise FAILURE (state, exn);
wenzelm@6689
   242
wenzelm@6689
   243
in
wenzelm@6689
   244
wenzelm@6689
   245
fun apply_trans int trs state = (apply_union int trs state, None)
wenzelm@6689
   246
  handle FAILURE (alt_state, exn) => (alt_state, Some exn) | exn => (state, Some exn);
wenzelm@6689
   247
wenzelm@6689
   248
end;
wenzelm@5828
   249
wenzelm@5828
   250
wenzelm@5828
   251
(* datatype transition *)
wenzelm@5828
   252
wenzelm@5828
   253
datatype transition = Transition of
wenzelm@5828
   254
 {name: string,
wenzelm@5828
   255
  pos: Position.T,
wenzelm@5828
   256
  int_only: bool,
wenzelm@5828
   257
  print: bool,
wenzelm@5828
   258
  trans: trans list};
wenzelm@5828
   259
wenzelm@5828
   260
fun make_transition (name, pos, int_only, print, trans) =
wenzelm@5828
   261
  Transition {name = name, pos = pos, int_only = int_only, print = print, trans = trans};
wenzelm@5828
   262
wenzelm@5828
   263
fun map_transition f (Transition {name, pos, int_only, print, trans}) =
wenzelm@5828
   264
  make_transition (f (name, pos, int_only, print, trans));
wenzelm@5828
   265
wenzelm@5828
   266
val empty = make_transition ("<unknown>", Position.none, false, false, []);
wenzelm@5828
   267
wenzelm@5828
   268
wenzelm@5828
   269
(* diagnostics *)
wenzelm@5828
   270
wenzelm@5828
   271
fun str_of_transition (Transition {name, pos, ...}) = quote name ^ Position.str_of pos;
wenzelm@5828
   272
wenzelm@5828
   273
fun command_msg msg tr = msg ^ "command " ^ str_of_transition tr;
wenzelm@5828
   274
fun at_command tr = command_msg "At " tr ^ ".";
wenzelm@5828
   275
wenzelm@5828
   276
fun type_error tr state =
wenzelm@6689
   277
  ERROR_MESSAGE (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
wenzelm@5828
   278
wenzelm@5828
   279
wenzelm@5828
   280
(* modify transitions *)
wenzelm@5828
   281
wenzelm@5828
   282
fun name nm = map_transition
wenzelm@5828
   283
  (fn (_, pos, int_only, print, trans) => (nm, pos, int_only, print, trans));
wenzelm@5828
   284
wenzelm@5828
   285
fun position pos = map_transition
wenzelm@5828
   286
  (fn (name, _, int_only, print, trans) => (name, pos, int_only, print, trans));
wenzelm@5828
   287
wenzelm@5828
   288
fun interactive int_only = map_transition
wenzelm@5828
   289
  (fn (name, pos, _, print, trans) => (name, pos, int_only, print, trans));
wenzelm@5828
   290
wenzelm@5828
   291
val print = map_transition
wenzelm@5828
   292
  (fn (name, pos, int_only, _, trans) => (name, pos, int_only, true, trans));
wenzelm@5828
   293
wenzelm@5828
   294
fun add_trans tr = map_transition
wenzelm@5828
   295
  (fn (name, pos, int_only, print, trans) => (name, pos, int_only, print, trans @ [tr]));
wenzelm@5828
   296
wenzelm@5828
   297
wenzelm@5828
   298
(* build transitions *)
wenzelm@5828
   299
wenzelm@5828
   300
val reset = add_trans Reset;
wenzelm@6689
   301
fun init f exit kill = add_trans (Init (f, (exit, kill)));
wenzelm@6689
   302
val exit = add_trans Exit;
wenzelm@6689
   303
val kill = add_trans Kill;
wenzelm@5828
   304
val keep = add_trans o Keep;
wenzelm@6689
   305
val history = add_trans o History;
wenzelm@5828
   306
val map_current = add_trans o MapCurrent;
wenzelm@6689
   307
val app_current = add_trans o AppCurrent;
wenzelm@5828
   308
wenzelm@5828
   309
fun imperative f = keep (fn _ => f ());
wenzelm@5828
   310
wenzelm@6689
   311
fun init_theory f exit kill =
wenzelm@7105
   312
  init (fn int => fn _ => Theory (f int))
wenzelm@6689
   313
    (fn Theory thy => exit thy | _ => raise UNDEF)
wenzelm@6689
   314
    (fn Theory thy => kill thy | _ => raise UNDEF);
wenzelm@5828
   315
wenzelm@6689
   316
fun theory f = app_current (fn _ => (fn Theory thy => Theory (f thy) | _ => raise UNDEF));
wenzelm@6689
   317
fun theory_to_proof f =
wenzelm@6689
   318
  app_current (fn int => (fn Theory thy => Proof (f int thy) | _ => raise UNDEF));
wenzelm@6689
   319
fun proof' f = map_current (fn int => (fn Proof prf => Proof (f int prf) | _ => raise UNDEF));
wenzelm@6689
   320
val proof = proof' o K;
wenzelm@6689
   321
fun proof_to_theory f = map_current (fn _ => (fn Proof prf => Theory (f prf) | _ => raise UNDEF));
wenzelm@5828
   322
wenzelm@5828
   323
wenzelm@5828
   324
wenzelm@5828
   325
(** toplevel transactions **)
wenzelm@5828
   326
wenzelm@7198
   327
val quiet = ref false;
wenzelm@5828
   328
val trace = ref false;
wenzelm@5828
   329
wenzelm@5828
   330
wenzelm@5828
   331
(* print exceptions *)
wenzelm@5828
   332
wenzelm@5828
   333
fun raised name = "exception " ^ name ^ " raised";
wenzelm@5828
   334
fun raised_msg name msg = raised name ^ ": " ^ msg;
wenzelm@5828
   335
wenzelm@5828
   336
fun exn_message TERMINATE = "Exit."
wenzelm@5990
   337
  | exn_message RESTART = "Restart."
wenzelm@7022
   338
  | exn_message (EXCURSION_FAIL (exn, msg)) = cat_lines [exn_message exn, msg]
wenzelm@6971
   339
  | exn_message Interrupt = "Interrupt."
wenzelm@6002
   340
  | exn_message ERROR = "ERROR."
wenzelm@5828
   341
  | exn_message (ERROR_MESSAGE msg) = msg
wenzelm@5828
   342
  | exn_message (THEORY (msg, _)) = msg
wenzelm@5828
   343
  | exn_message (ProofContext.CONTEXT (msg, _)) = msg
wenzelm@5828
   344
  | exn_message (Proof.STATE (msg, _)) = msg
wenzelm@5828
   345
  | exn_message (ProofHistory.FAIL msg) = msg
wenzelm@5920
   346
  | exn_message (Attrib.ATTRIB_FAIL info) = fail_message "attribute" info
wenzelm@5920
   347
  | exn_message (Method.METHOD_FAIL info) = fail_message "method" info
wenzelm@5828
   348
  | exn_message (Syntax.AST (msg, _)) = raised_msg "AST" msg
wenzelm@5828
   349
  | exn_message (TYPE (msg, _, _)) = raised_msg "TYPE" msg
wenzelm@5828
   350
  | exn_message (TERM (msg, _)) = raised_msg "TERM" msg
wenzelm@5828
   351
  | exn_message (THM (msg, _, _)) = raised_msg "THM" msg
wenzelm@5828
   352
  | exn_message Library.OPTION = raised "Library.OPTION"
wenzelm@5828
   353
  | exn_message (Library.LIST msg) = raised_msg "Library.LIST" msg
wenzelm@5920
   354
  | exn_message exn = General.exnMessage exn
wenzelm@5920
   355
and fail_message kind ((name, pos), exn) =
wenzelm@5920
   356
  "Error in " ^ kind ^ " " ^ name ^ Position.str_of pos ^ ":\n" ^ exn_message exn;
wenzelm@5828
   357
wenzelm@5828
   358
fun print_exn None = ()
wenzelm@5828
   359
  | print_exn (Some (exn, s)) = error_msg (cat_lines [exn_message exn, s]);
wenzelm@5828
   360
wenzelm@5828
   361
wenzelm@5828
   362
(* apply transitions *)
wenzelm@5828
   363
wenzelm@6664
   364
local
wenzelm@6664
   365
wenzelm@6689
   366
fun app int (tr as Transition {trans, int_only, print, ...}) state =
wenzelm@5828
   367
  let
wenzelm@5828
   368
    val _ =
wenzelm@5828
   369
      if int orelse not int_only then ()
wenzelm@5828
   370
      else warning (command_msg "Executing interactive-only " tr);
wenzelm@6689
   371
    val (result, opt_exn) =
wenzelm@6689
   372
      (if ! trace then (writeln (command_msg "" tr); timeap) else I) (apply_trans int trans) state;
wenzelm@7198
   373
    val _ = if int andalso print andalso not (! quiet) then print_state result else ();
wenzelm@6689
   374
  in (result, apsome (fn UNDEF => type_error tr state | exn => exn) opt_exn) end;
wenzelm@6664
   375
wenzelm@6664
   376
in
wenzelm@5828
   377
wenzelm@6689
   378
fun apply int tr st =
wenzelm@6965
   379
  (case app int tr st of
wenzelm@6689
   380
    (_, Some TERMINATE) => None
wenzelm@6664
   381
  | (_, Some RESTART) => Some (toplevel, None)
wenzelm@7022
   382
  | (state', Some (EXCURSION_FAIL exn_info)) => Some (state', Some exn_info)
wenzelm@6689
   383
  | (state', Some exn) => Some (state', Some (exn, at_command tr))
wenzelm@6689
   384
  | (state', None) => Some (state', None));
wenzelm@6664
   385
wenzelm@6664
   386
end;
wenzelm@5828
   387
wenzelm@5828
   388
wenzelm@5828
   389
(* excursion: toplevel -- apply transformers -- toplevel *)
wenzelm@5828
   390
wenzelm@6664
   391
local
wenzelm@6664
   392
wenzelm@5828
   393
fun excur [] x = x
wenzelm@5828
   394
  | excur (tr :: trs) x =
wenzelm@5828
   395
      (case apply false tr x of
wenzelm@5828
   396
        Some (x', None) => excur trs x'
wenzelm@7022
   397
      | Some (x', Some exn_info) => raise EXCURSION_FAIL exn_info
wenzelm@7022
   398
      | None => raise EXCURSION_FAIL (TERMINATE, at_command tr));
wenzelm@5828
   399
wenzelm@6664
   400
in
wenzelm@6664
   401
wenzelm@5828
   402
fun excursion trs =
wenzelm@5828
   403
  (case excur trs (State []) of
wenzelm@5828
   404
    State [] => ()
wenzelm@6244
   405
  | _ => raise ERROR_MESSAGE "Open block(s) pending at end of input");
wenzelm@5828
   406
wenzelm@7062
   407
fun excursion_error trs =
wenzelm@7062
   408
  excursion trs handle exn => error (exn_message exn);
wenzelm@7062
   409
wenzelm@6664
   410
end;
wenzelm@6664
   411
wenzelm@5828
   412
wenzelm@5828
   413
wenzelm@5828
   414
(** interactive transformations **)
wenzelm@5828
   415
wenzelm@5828
   416
(* the global state reference *)
wenzelm@5828
   417
wenzelm@6689
   418
val global_state = ref (toplevel, None: (exn * string) option);
wenzelm@5828
   419
wenzelm@5828
   420
fun set_state state = global_state := (state, None);
wenzelm@5828
   421
fun get_state () = fst (! global_state);
wenzelm@5828
   422
fun exn () = snd (! global_state);
wenzelm@5828
   423
wenzelm@5828
   424
wenzelm@6965
   425
(* the Isar source of transitions *)
wenzelm@6965
   426
wenzelm@6965
   427
type isar =
wenzelm@6965
   428
  (transition, (transition option,
wenzelm@6965
   429
    (OuterLex.token, (OuterLex.token,
wenzelm@6965
   430
      Position.T * (Symbol.symbol, (string, unit) Source.source) Source.source)
wenzelm@6965
   431
          Source.source) Source.source) Source.source) Source.source;
wenzelm@6965
   432
wenzelm@6965
   433
fun transform_interrupt_isar f x =
wenzelm@6965
   434
  let val y = ref (None: (transition * isar) option option);
wenzelm@6965
   435
  in exhibit_interrupt (fn () => y := Some (f x)) (); the (! y) end;
wenzelm@6965
   436
wenzelm@6965
   437
fun get_interruptible src =
wenzelm@6965
   438
  Some (transform_interrupt_isar Source.get_single src)
wenzelm@6965
   439
    handle Interrupt => None;
wenzelm@6965
   440
wenzelm@6965
   441
wenzelm@5828
   442
(* apply transformers to global state *)
wenzelm@5828
   443
wenzelm@5828
   444
nonfix >>;
wenzelm@5828
   445
wenzelm@5828
   446
fun >> tr =
wenzelm@5828
   447
  (case apply true tr (get_state ()) of
wenzelm@5828
   448
    None => false
wenzelm@5828
   449
  | Some (state', exn_info) =>
wenzelm@5828
   450
      (global_state := (state', exn_info);
wenzelm@5828
   451
        check_stale state'; print_exn exn_info;
wenzelm@5828
   452
        true));
wenzelm@5828
   453
wenzelm@5828
   454
fun raw_loop src =
wenzelm@6689
   455
  (case get_interruptible (Source.set_prompt (prompt_state (get_state ())) src) of
wenzelm@6971
   456
    None => (writeln "\nInterrupt."; raw_loop src)
wenzelm@5828
   457
  | Some None => ()
wenzelm@5828
   458
  | Some (Some (tr, src')) => if >> tr then raw_loop src' else ());
wenzelm@5828
   459
wenzelm@5828
   460
wenzelm@5828
   461
fun loop src = mask_interrupt raw_loop src;
wenzelm@5828
   462
wenzelm@5828
   463
wenzelm@5828
   464
end;