src/Pure/Isar/toplevel.ML
author wenzelm
Sat Nov 04 19:25:43 2006 +0100 (2006-11-04)
changeset 21177 e8228486aa03
parent 21007 1bbb31aaf98d
child 21231 df149b8c86b8
permissions -rw-r--r--
removed checkpoint interface;
moved back to copy/checkpoint instead of checkpoint/checkpoint
(NB 1: checkpoint is idempotent, i.e. impure data is being shared, which is inappropriate;
NB 2: copying a checkpoint always produces a related theory);
present_proof: proper treatment of history;
tuned;
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@19063
    10
  exception UNDEF
wenzelm@20963
    11
  type generic_theory
wenzelm@18589
    12
  type node
wenzelm@20963
    13
  val theory_node: node -> generic_theory option
wenzelm@18589
    14
  val proof_node: node -> ProofHistory.T option
wenzelm@20963
    15
  val cases_node: (generic_theory -> 'a) -> (Proof.state -> 'a) -> node -> 'a
wenzelm@20963
    16
  val presentation_context: node option -> xstring option -> Proof.context
wenzelm@5828
    17
  type state
wenzelm@5828
    18
  val toplevel: state
wenzelm@7732
    19
  val is_toplevel: state -> bool
wenzelm@18589
    20
  val is_theory: state -> bool
wenzelm@18589
    21
  val is_proof: state -> bool
wenzelm@17076
    22
  val level: state -> int
wenzelm@17266
    23
  val assert: bool -> unit
wenzelm@6689
    24
  val node_history_of: state -> node History.T
wenzelm@5828
    25
  val node_of: state -> node
wenzelm@20963
    26
  val node_case: (generic_theory -> 'a) -> (Proof.state -> 'a) -> state -> 'a
wenzelm@18641
    27
  val context_of: state -> Context.generic
wenzelm@5828
    28
  val theory_of: state -> theory
wenzelm@5828
    29
  val proof_of: state -> Proof.state
wenzelm@18589
    30
  val proof_position_of: state -> int
wenzelm@21007
    31
  val enter_proof_body: state -> Proof.state
wenzelm@16815
    32
  val prompt_state_default: state -> string
wenzelm@16815
    33
  val prompt_state_fn: (state -> string) ref
wenzelm@16815
    34
  val print_state_context: state -> unit
wenzelm@16815
    35
  val print_state_default: bool -> state -> unit
wenzelm@16815
    36
  val print_state_hook: (bool -> state -> unit) -> unit
wenzelm@16815
    37
  val print_state_fn: (bool -> state -> unit) ref
wenzelm@16815
    38
  val print_state: bool -> state -> unit
wenzelm@16815
    39
  val pretty_state: bool -> state -> Pretty.T list
wenzelm@16682
    40
  val quiet: bool ref
wenzelm@16682
    41
  val debug: bool ref
wenzelm@17321
    42
  val interact: bool ref
wenzelm@16682
    43
  val timing: bool ref
wenzelm@16682
    44
  val profiling: int ref
wenzelm@16815
    45
  val skip_proofs: bool ref
wenzelm@5828
    46
  exception TERMINATE
wenzelm@5990
    47
  exception RESTART
wenzelm@20128
    48
  val exn_message: exn -> string
wenzelm@20128
    49
  val program: (unit -> 'a) -> 'a
wenzelm@16682
    50
  type transition
wenzelm@6689
    51
  val undo_limit: bool -> int option
wenzelm@5828
    52
  val empty: transition
wenzelm@14923
    53
  val name_of: transition -> string
wenzelm@14923
    54
  val source_of: transition -> OuterLex.token list option
wenzelm@5828
    55
  val name: string -> transition -> transition
wenzelm@5828
    56
  val position: Position.T -> transition -> transition
wenzelm@14923
    57
  val source: OuterLex.token list -> transition -> transition
wenzelm@5828
    58
  val interactive: bool -> transition -> transition
wenzelm@5828
    59
  val print: transition -> transition
wenzelm@16607
    60
  val print': string -> transition -> transition
wenzelm@17363
    61
  val three_buffersN: string
wenzelm@17363
    62
  val print3: transition -> transition
wenzelm@9010
    63
  val no_timing: transition -> transition
wenzelm@5828
    64
  val reset: transition -> transition
wenzelm@8465
    65
  val init: (bool -> node) -> (node -> unit) -> (node -> unit) -> transition -> transition
wenzelm@6689
    66
  val exit: transition -> transition
wenzelm@6689
    67
  val kill: transition -> transition
wenzelm@20128
    68
  val history: (node History.T -> node History.T) -> transition -> transition
wenzelm@5828
    69
  val keep: (state -> unit) -> transition -> transition
wenzelm@7612
    70
  val keep': (bool -> state -> unit) -> transition -> transition
wenzelm@5828
    71
  val imperative: (unit -> unit) -> transition -> transition
wenzelm@21007
    72
  val init_theory: (bool -> theory) -> (theory -> unit) -> (theory -> unit) ->
wenzelm@21007
    73
    transition -> transition
wenzelm@5828
    74
  val theory: (theory -> theory) -> transition -> transition
wenzelm@7612
    75
  val theory': (bool -> theory -> theory) -> transition -> transition
wenzelm@20985
    76
  val begin_local_theory: bool -> (theory -> local_theory) -> transition -> transition
wenzelm@21007
    77
  val end_local_theory: transition -> transition
wenzelm@20963
    78
  val local_theory: xstring option -> (local_theory -> local_theory) -> transition -> transition
wenzelm@20963
    79
  val present_local_theory: xstring option -> (bool -> node -> unit) -> transition -> transition
wenzelm@21007
    80
  val local_theory_to_proof: xstring option -> (local_theory -> Proof.state) ->
wenzelm@21007
    81
    transition -> transition
wenzelm@17363
    82
  val theory_to_proof: (theory -> Proof.state) -> transition -> transition
wenzelm@21007
    83
  val end_proof: (bool -> Proof.state -> Proof.context) -> transition -> transition
wenzelm@21007
    84
  val forget_proof: transition -> transition
wenzelm@21177
    85
  val present_proof: (bool -> node -> unit) -> transition -> transition
wenzelm@21177
    86
  val proofs': (bool -> Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@17904
    87
  val proof': (bool -> Proof.state -> Proof.state) -> transition -> transition
wenzelm@21177
    88
  val proofs: (Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@21177
    89
  val proof: (Proof.state -> Proof.state) -> transition -> transition
wenzelm@16815
    90
  val actual_proof: (ProofHistory.T -> ProofHistory.T) -> transition -> transition
wenzelm@16815
    91
  val skip_proof: (int History.T -> int History.T) -> transition -> transition
wenzelm@17904
    92
  val skip_proof_to_theory: (int -> bool) -> transition -> transition
wenzelm@9512
    93
  val unknown_theory: transition -> transition
wenzelm@9512
    94
  val unknown_proof: transition -> transition
wenzelm@9512
    95
  val unknown_context: transition -> transition
wenzelm@5828
    96
  val apply: bool -> transition -> state -> (state * (exn * string) option) option
wenzelm@17076
    97
  val present_excursion: (transition * (state -> state -> 'a -> 'a)) list -> 'a -> 'a
wenzelm@5828
    98
  val excursion: transition list -> unit
wenzelm@5828
    99
  val set_state: state -> unit
wenzelm@5828
   100
  val get_state: unit -> state
wenzelm@5828
   101
  val exn: unit -> (exn * string) option
wenzelm@5828
   102
  val >> : transition -> bool
wenzelm@14985
   103
  val >>> : transition list -> unit
nipkow@14091
   104
  type 'a isar
nipkow@14091
   105
  val loop: 'a isar -> unit
wenzelm@5828
   106
end;
wenzelm@5828
   107
wenzelm@6965
   108
structure Toplevel: TOPLEVEL =
wenzelm@5828
   109
struct
wenzelm@5828
   110
wenzelm@5828
   111
(** toplevel state **)
wenzelm@5828
   112
wenzelm@19063
   113
exception UNDEF;
wenzelm@19063
   114
wenzelm@19063
   115
wenzelm@16815
   116
(* datatype state *)
wenzelm@5828
   117
wenzelm@20963
   118
type generic_theory = Context.generic;    (*theory or local_theory*)
wenzelm@20963
   119
wenzelm@5828
   120
datatype node =
wenzelm@20963
   121
  Theory of generic_theory * Proof.context option | (*theory with presentation context*)
wenzelm@21007
   122
  Proof of ProofHistory.T * ((Proof.context -> generic_theory) * generic_theory) |
wenzelm@21007
   123
    (*history of proof states, finish, original theory*)
wenzelm@21007
   124
  SkipProof of int History.T * (generic_theory * generic_theory);
wenzelm@18563
   125
    (*history of proof depths, resulting theory, original theory*)
wenzelm@5828
   126
wenzelm@20963
   127
val theory_node = fn Theory (gthy, _) => SOME gthy | _ => NONE;
wenzelm@18589
   128
val proof_node = fn Proof (prf, _) => SOME prf | _ => NONE;
wenzelm@18589
   129
wenzelm@20963
   130
fun cases_node f _ (Theory (gthy, _)) = f gthy
wenzelm@19063
   131
  | cases_node _ g (Proof (prf, _)) = g (ProofHistory.current prf)
wenzelm@21007
   132
  | cases_node f _ (SkipProof (_, (gthy, _))) = f gthy;
wenzelm@19063
   133
wenzelm@20963
   134
fun presentation_context (SOME (Theory (_, SOME ctxt))) NONE = ctxt
wenzelm@20963
   135
  | presentation_context (SOME node) NONE = cases_node Context.proof_of Proof.context_of node
wenzelm@20963
   136
  | presentation_context (SOME node) (SOME loc) =
wenzelm@20963
   137
      TheoryTarget.init (SOME loc) (cases_node Context.theory_of Proof.theory_of node)
wenzelm@20963
   138
  | presentation_context NONE _ = raise UNDEF;
wenzelm@19063
   139
wenzelm@8465
   140
datatype state = State of (node History.T * ((node -> unit) * (node -> unit))) option;
wenzelm@5828
   141
skalberg@15531
   142
val toplevel = State NONE;
wenzelm@5828
   143
skalberg@15531
   144
fun is_toplevel (State NONE) = true
wenzelm@7732
   145
  | is_toplevel _ = false;
wenzelm@7732
   146
wenzelm@17076
   147
fun level (State NONE) = 0
wenzelm@17076
   148
  | level (State (SOME (node, _))) =
wenzelm@17076
   149
      (case History.current node of
wenzelm@20963
   150
        Theory (Context.Theory _, _) => 0
wenzelm@20963
   151
      | Theory (Context.Proof _, _) => 1
wenzelm@20963
   152
      | Proof (prf, _) => Proof.level (ProofHistory.current prf) + 1
wenzelm@21007
   153
      | SkipProof (h, _) => History.current h + 2);   (*different notion of proof depth!*)
wenzelm@17076
   154
skalberg@15531
   155
fun str_of_state (State NONE) = "at top level"
wenzelm@16815
   156
  | str_of_state (State (SOME (node, _))) =
wenzelm@16815
   157
      (case History.current node of
wenzelm@20963
   158
        Theory (Context.Theory _, _) => "in theory mode"
wenzelm@20963
   159
      | Theory (Context.Proof _, _) => "in local theory mode"
wenzelm@16815
   160
      | Proof _ => "in proof mode"
wenzelm@16815
   161
      | SkipProof _ => "in skipped proof mode");
wenzelm@5946
   162
wenzelm@5946
   163
wenzelm@5828
   164
(* top node *)
wenzelm@5828
   165
wenzelm@17266
   166
fun assert true = ()
wenzelm@17266
   167
  | assert false = raise UNDEF;
wenzelm@17266
   168
skalberg@15531
   169
fun node_history_of (State NONE) = raise UNDEF
skalberg@15531
   170
  | node_history_of (State (SOME (node, _))) = node;
wenzelm@6689
   171
wenzelm@6689
   172
val node_of = History.current o node_history_of;
wenzelm@5828
   173
wenzelm@18589
   174
fun is_theory state = not (is_toplevel state) andalso is_some (theory_node (node_of state));
wenzelm@18589
   175
fun is_proof state = not (is_toplevel state) andalso is_some (proof_node (node_of state));
wenzelm@18589
   176
wenzelm@19063
   177
fun node_case f g state = cases_node f g (node_of state);
wenzelm@5828
   178
wenzelm@20963
   179
val context_of = node_case I (Context.Proof o Proof.context_of);
wenzelm@20963
   180
val theory_of = node_case Context.theory_of Proof.theory_of;
wenzelm@18589
   181
val proof_of = node_case (fn _ => raise UNDEF) I;
wenzelm@17208
   182
wenzelm@18589
   183
fun proof_position_of state =
wenzelm@18589
   184
  (case node_of state of
wenzelm@18589
   185
    Proof (prf, _) => ProofHistory.position prf
wenzelm@18589
   186
  | _ => raise UNDEF);
wenzelm@6664
   187
wenzelm@21007
   188
val enter_proof_body = node_case (Proof.init o Context.proof_of) Proof.enter_forward;
wenzelm@5828
   189
wenzelm@5828
   190
wenzelm@16815
   191
(* prompt state *)
wenzelm@16815
   192
wenzelm@16815
   193
fun prompt_state_default (State _) = Source.default_prompt;
wenzelm@16815
   194
wenzelm@16815
   195
val prompt_state_fn = ref prompt_state_default;
wenzelm@16815
   196
fun prompt_state state = ! prompt_state_fn state;
wenzelm@16815
   197
wenzelm@16815
   198
wenzelm@16815
   199
(* print state *)
wenzelm@16815
   200
wenzelm@20963
   201
val pretty_context = LocalTheory.pretty o Context.cases (TheoryTarget.init NONE) I;
wenzelm@16815
   202
wenzelm@16815
   203
fun pretty_state_context state =
wenzelm@20963
   204
  (case try context_of state of NONE => []
wenzelm@20963
   205
  | SOME gthy => pretty_context gthy);
wenzelm@16815
   206
wenzelm@20963
   207
fun pretty_node prf_only (Theory (gthy, _)) = if prf_only then [] else pretty_context gthy
wenzelm@18563
   208
  | pretty_node _ (Proof (prf, _)) =
wenzelm@16815
   209
      Proof.pretty_state (ProofHistory.position prf) (ProofHistory.current prf)
wenzelm@21007
   210
  | pretty_node _ (SkipProof (h, _)) =
wenzelm@16815
   211
      [Pretty.str ("skipped proof: depth " ^ string_of_int (History.current h))];
wenzelm@16815
   212
wenzelm@16815
   213
fun pretty_state prf_only state =
wenzelm@16815
   214
  let val ref (begin_state, end_state, _) = Display.current_goals_markers in
wenzelm@16815
   215
    (case try node_of state of NONE => []
wenzelm@16815
   216
    | SOME node =>
wenzelm@16815
   217
        (if begin_state = "" then [] else [Pretty.str begin_state]) @
wenzelm@16815
   218
        pretty_node prf_only node @
wenzelm@16815
   219
        (if end_state = "" then [] else [Pretty.str end_state]))
wenzelm@16815
   220
  end;
wenzelm@16815
   221
wenzelm@16815
   222
val print_state_context = Pretty.writelns o pretty_state_context;
wenzelm@16815
   223
fun print_state_default prf_only state = Pretty.writelns (pretty_state prf_only state);
wenzelm@16815
   224
wenzelm@16815
   225
val print_state_hooks = ref ([]: (bool -> state -> unit) list);
wenzelm@16815
   226
fun print_state_hook f = change print_state_hooks (cons f);
wenzelm@16815
   227
val print_state_fn = ref print_state_default;
wenzelm@16815
   228
wenzelm@16815
   229
fun print_state prf_only state =
wenzelm@16815
   230
 (List.app (fn f => (try (fn () => f prf_only state) (); ())) (! print_state_hooks);
wenzelm@16815
   231
  ! print_state_fn prf_only state);
wenzelm@16815
   232
wenzelm@16815
   233
wenzelm@15668
   234
wenzelm@5828
   235
(** toplevel transitions **)
wenzelm@5828
   236
wenzelm@16682
   237
val quiet = ref false;
wenzelm@16682
   238
val debug = ref false;
wenzelm@17321
   239
val interact = ref false;
wenzelm@16682
   240
val timing = Output.timing;
wenzelm@16682
   241
val profiling = ref 0;
wenzelm@16815
   242
val skip_proofs = ref false;
wenzelm@16682
   243
wenzelm@5828
   244
exception TERMINATE;
wenzelm@5990
   245
exception RESTART;
wenzelm@7022
   246
exception EXCURSION_FAIL of exn * string;
wenzelm@6689
   247
exception FAILURE of state * exn;
wenzelm@5828
   248
wenzelm@20128
   249
wenzelm@20128
   250
(* print exceptions *)
wenzelm@20128
   251
wenzelm@20128
   252
local
wenzelm@20128
   253
wenzelm@20128
   254
fun with_context f xs =
wenzelm@20128
   255
  (case Context.get_context () of NONE => []
wenzelm@20128
   256
  | SOME thy => map (f thy) xs);
wenzelm@20128
   257
wenzelm@20128
   258
fun raised name [] = "exception " ^ name ^ " raised"
wenzelm@20128
   259
  | raised name [msg] = "exception " ^ name ^ " raised: " ^ msg
wenzelm@20128
   260
  | raised name msgs = cat_lines (("exception " ^ name ^ " raised:") :: msgs);
wenzelm@20128
   261
wenzelm@20128
   262
fun exn_msg _ TERMINATE = "Exit."
wenzelm@20128
   263
  | exn_msg _ RESTART = "Restart."
wenzelm@20128
   264
  | exn_msg _ Interrupt = "Interrupt."
wenzelm@20128
   265
  | exn_msg _ Output.TOPLEVEL_ERROR = "Error."
wenzelm@20128
   266
  | exn_msg _ (SYS_ERROR msg) = "## SYSTEM ERROR ##\n" ^ msg
wenzelm@20128
   267
  | exn_msg _ (ERROR msg) = msg
wenzelm@20128
   268
  | exn_msg detailed (EXCEPTION (exn, msg)) = cat_lines [exn_msg detailed exn, msg]
wenzelm@20128
   269
  | exn_msg detailed (EXCURSION_FAIL (exn, msg)) = cat_lines [exn_msg detailed exn, msg]
wenzelm@20128
   270
  | exn_msg false (THEORY (msg, _)) = msg
wenzelm@20128
   271
  | exn_msg true (THEORY (msg, thys)) = raised "THEORY" (msg :: map Context.str_of_thy thys)
wenzelm@20128
   272
  | exn_msg detailed (MetaSimplifier.SIMPROC_FAIL (name, exn)) =
wenzelm@20128
   273
      fail_msg detailed "simproc" ((name, Position.none), exn)
wenzelm@20128
   274
  | exn_msg detailed (Attrib.ATTRIB_FAIL info) = fail_msg detailed "attribute" info
wenzelm@20128
   275
  | exn_msg detailed (Method.METHOD_FAIL info) = fail_msg detailed "method" info
wenzelm@20128
   276
  | exn_msg detailed (Antiquote.ANTIQUOTE_FAIL info) = fail_msg detailed "antiquotation" info
wenzelm@20128
   277
  | exn_msg false (Syntax.AST (msg, _)) = raised "AST" [msg]
wenzelm@20128
   278
  | exn_msg true (Syntax.AST (msg, asts)) =
wenzelm@20128
   279
      raised "AST" (msg :: map (Pretty.string_of o Syntax.pretty_ast) asts)
wenzelm@20128
   280
  | exn_msg false (TYPE (msg, _, _)) = raised "TYPE" [msg]
wenzelm@20128
   281
  | exn_msg true (TYPE (msg, Ts, ts)) = raised "TYPE" (msg ::
wenzelm@20128
   282
        with_context Sign.string_of_typ Ts @ with_context Sign.string_of_term ts)
wenzelm@20128
   283
  | exn_msg false (TERM (msg, _)) = raised "TERM" [msg]
wenzelm@20128
   284
  | exn_msg true (TERM (msg, ts)) = raised "TERM" (msg :: with_context Sign.string_of_term ts)
wenzelm@20128
   285
  | exn_msg false (THM (msg, _, _)) = raised "THM" [msg]
wenzelm@20128
   286
  | exn_msg true (THM (msg, i, thms)) =
wenzelm@20128
   287
      raised ("THM " ^ string_of_int i) (msg :: map Display.string_of_thm thms)
wenzelm@20128
   288
  | exn_msg _ Option.Option = raised "Option" []
wenzelm@20128
   289
  | exn_msg _ Library.UnequalLengths = raised "UnequalLengths" []
wenzelm@20128
   290
  | exn_msg _ Empty = raised "Empty" []
wenzelm@20128
   291
  | exn_msg _ Subscript = raised "Subscript" []
wenzelm@20128
   292
  | exn_msg _ (Fail msg) = raised "Fail" [msg]
wenzelm@20128
   293
  | exn_msg _ exn = General.exnMessage exn
wenzelm@20128
   294
and fail_msg detailed kind ((name, pos), exn) =
wenzelm@20128
   295
  "Error in " ^ kind ^ " " ^ quote name ^ Position.str_of pos ^ ":\n" ^ exn_msg detailed exn;
wenzelm@20128
   296
wenzelm@20128
   297
in
wenzelm@20128
   298
wenzelm@20128
   299
fun exn_message exn = exn_msg (! debug) exn;
wenzelm@20128
   300
wenzelm@20128
   301
fun print_exn NONE = ()
wenzelm@20128
   302
  | print_exn (SOME (exn, s)) = Output.error_msg (cat_lines [exn_message exn, s]);
wenzelm@20128
   303
wenzelm@20128
   304
end;
wenzelm@20128
   305
wenzelm@20128
   306
wenzelm@20128
   307
(* controlled execution *)
wenzelm@20128
   308
wenzelm@20128
   309
local
wenzelm@20128
   310
wenzelm@18685
   311
fun debugging f x =
wenzelm@18685
   312
  if ! debug then
wenzelm@18685
   313
    setmp Library.do_transform_failure false
wenzelm@18685
   314
      exception_trace (fn () => f x)
wenzelm@18685
   315
  else f x;
wenzelm@18685
   316
wenzelm@20128
   317
fun interruptible f x =
wenzelm@20128
   318
  let val y = ref x
wenzelm@20128
   319
  in raise_interrupt (fn () => y := f x) (); ! y end;
wenzelm@20128
   320
wenzelm@20128
   321
in
wenzelm@20128
   322
wenzelm@20128
   323
fun controlled_execution f =
wenzelm@20128
   324
  f
wenzelm@20128
   325
  |> debugging
wenzelm@20128
   326
  |> interruptible
wenzelm@20128
   327
  |> setmp Output.do_toplevel_errors false;
wenzelm@20128
   328
wenzelm@20128
   329
fun program f =
wenzelm@20128
   330
  Output.ML_errors (fn () => debugging f () handle exn => error (exn_message exn)) ();
wenzelm@20128
   331
wenzelm@20128
   332
end;
wenzelm@20128
   333
wenzelm@5828
   334
wenzelm@16815
   335
(* node transactions and recovery from stale theories *)
wenzelm@6689
   336
wenzelm@16815
   337
(*NB: proof commands should be non-destructive!*)
wenzelm@7022
   338
wenzelm@6689
   339
local
wenzelm@6689
   340
wenzelm@16452
   341
fun is_stale state = Context.is_stale (theory_of state) handle UNDEF => false;
wenzelm@6689
   342
wenzelm@18685
   343
val stale_theory = ERROR "Stale theory encountered after succesful execution!";
wenzelm@16815
   344
wenzelm@21177
   345
fun map_theory f = History.map
wenzelm@21177
   346
  (fn Theory (gthy, _) => Theory (Context.mapping f (LocalTheory.raw_theory f) gthy, NONE)
wenzelm@21177
   347
    | node => node);
wenzelm@6689
   348
skalberg@15531
   349
fun return (result, NONE) = result
skalberg@15531
   350
  | return (result, SOME exn) = raise FAILURE (result, exn);
wenzelm@7022
   351
wenzelm@6689
   352
in
wenzelm@6689
   353
wenzelm@20128
   354
fun transaction hist f (node, term) =
wenzelm@20128
   355
  let
wenzelm@21177
   356
    val cont_node = map_theory Theory.checkpoint node;
wenzelm@21177
   357
    val back_node = map_theory Theory.copy cont_node;
wenzelm@20128
   358
    fun state nd = State (SOME (nd, term));
wenzelm@20128
   359
    fun normal_state nd = (state nd, NONE);
wenzelm@20128
   360
    fun error_state nd exn = (state nd, SOME exn);
wenzelm@6689
   361
wenzelm@20128
   362
    val (result, err) =
wenzelm@20128
   363
      cont_node
wenzelm@20128
   364
      |> (f
wenzelm@21177
   365
          |> (if hist then History.apply' (History.current back_node) else History.map)
wenzelm@20128
   366
          |> controlled_execution)
wenzelm@20128
   367
      |> normal_state
wenzelm@20128
   368
      handle exn => error_state cont_node exn;
wenzelm@20128
   369
  in
wenzelm@20128
   370
    if is_stale result
wenzelm@20128
   371
    then return (error_state back_node (the_default stale_theory err))
wenzelm@20128
   372
    else return (result, err)
wenzelm@20128
   373
  end;
wenzelm@6689
   374
wenzelm@6689
   375
end;
wenzelm@6689
   376
wenzelm@6689
   377
wenzelm@6689
   378
(* primitive transitions *)
wenzelm@6689
   379
wenzelm@18563
   380
(*Note: Recovery from stale theories is provided only for theory-level
wenzelm@18589
   381
  operations via Transaction.  Other node or state operations should
wenzelm@18589
   382
  not touch theories at all.  Interrupts are enabled only for Keep and
wenzelm@18589
   383
  Transaction.*)
wenzelm@5828
   384
wenzelm@5828
   385
datatype trans =
wenzelm@18563
   386
  Reset |                                               (*empty toplevel*)
wenzelm@8465
   387
  Init of (bool -> node) * ((node -> unit) * (node -> unit)) |
wenzelm@18563
   388
                                                        (*init node; with exit/kill operation*)
wenzelm@18563
   389
  Exit |                                                (*conclude node*)
wenzelm@18563
   390
  Kill |                                                (*abort node*)
wenzelm@20128
   391
  History of node History.T -> node History.T |         (*history operation (undo etc.)*)
wenzelm@18563
   392
  Keep of bool -> state -> unit |                       (*peek at state*)
wenzelm@18592
   393
  Transaction of bool * (bool -> node -> node);         (*node transaction*)
wenzelm@6689
   394
skalberg@15531
   395
fun undo_limit int = if int then NONE else SOME 0;
wenzelm@6689
   396
wenzelm@6689
   397
local
wenzelm@5828
   398
wenzelm@6689
   399
fun apply_tr _ Reset _ = toplevel
skalberg@15531
   400
  | apply_tr int (Init (f, term)) (State NONE) =
skalberg@15531
   401
      State (SOME (History.init (undo_limit int) (f int), term))
skalberg@15531
   402
  | apply_tr _ (Init _ ) (State (SOME _)) = raise UNDEF
skalberg@15531
   403
  | apply_tr _ Exit (State NONE) = raise UNDEF
skalberg@15531
   404
  | apply_tr _ Exit (State (SOME (node, (exit, _)))) =
skalberg@15531
   405
      (exit (History.current node); State NONE)
skalberg@15531
   406
  | apply_tr _ Kill (State NONE) = raise UNDEF
skalberg@15531
   407
  | apply_tr _ Kill (State (SOME (node, (_, kill)))) =
skalberg@15531
   408
      (kill (History.current node); State NONE)
skalberg@15531
   409
  | apply_tr _ (History _) (State NONE) = raise UNDEF
skalberg@15531
   410
  | apply_tr _ (History f) (State (SOME (node, term))) = State (SOME (f node, term))
wenzelm@20128
   411
  | apply_tr int (Keep f) state =
wenzelm@20128
   412
      controlled_execution (fn x => tap (f int) x) state
wenzelm@20128
   413
  | apply_tr _ (Transaction _) (State NONE) = raise UNDEF
wenzelm@20128
   414
  | apply_tr int (Transaction (hist, f)) (State (SOME state)) =
wenzelm@20128
   415
      transaction hist (fn x => f int x) state;
wenzelm@5828
   416
wenzelm@6689
   417
fun apply_union _ [] state = raise FAILURE (state, UNDEF)
wenzelm@6689
   418
  | apply_union int (tr :: trs) state =
wenzelm@18685
   419
      apply_tr int tr state
wenzelm@6689
   420
        handle UNDEF => apply_union int trs state
wenzelm@6689
   421
          | FAILURE (alt_state, UNDEF) => apply_union int trs alt_state
wenzelm@6689
   422
          | exn as FAILURE _ => raise exn
wenzelm@6689
   423
          | exn => raise FAILURE (state, exn);
wenzelm@6689
   424
wenzelm@6689
   425
in
wenzelm@6689
   426
skalberg@15531
   427
fun apply_trans int trs state = (apply_union int trs state, NONE)
skalberg@15531
   428
  handle FAILURE (alt_state, exn) => (alt_state, SOME exn) | exn => (state, SOME exn);
wenzelm@6689
   429
wenzelm@6689
   430
end;
wenzelm@5828
   431
wenzelm@5828
   432
wenzelm@5828
   433
(* datatype transition *)
wenzelm@5828
   434
wenzelm@5828
   435
datatype transition = Transition of
wenzelm@16815
   436
 {name: string,                        (*command name*)
wenzelm@16815
   437
  pos: Position.T,                     (*source position*)
wenzelm@16815
   438
  source: OuterLex.token list option,  (*source text*)
wenzelm@16815
   439
  int_only: bool,                      (*interactive-only*)
wenzelm@16815
   440
  print: string list,                  (*print modes (union)*)
wenzelm@16815
   441
  no_timing: bool,                     (*suppress timing*)
wenzelm@16815
   442
  trans: trans list};                  (*primitive transitions (union)*)
wenzelm@5828
   443
wenzelm@14923
   444
fun make_transition (name, pos, source, int_only, print, no_timing, trans) =
wenzelm@14923
   445
  Transition {name = name, pos = pos, source = source,
wenzelm@14923
   446
    int_only = int_only, print = print, no_timing = no_timing, trans = trans};
wenzelm@5828
   447
wenzelm@14923
   448
fun map_transition f (Transition {name, pos, source, int_only, print, no_timing, trans}) =
wenzelm@14923
   449
  make_transition (f (name, pos, source, int_only, print, no_timing, trans));
wenzelm@5828
   450
wenzelm@16607
   451
val empty = make_transition ("<unknown>", Position.none, NONE, false, [], false, []);
wenzelm@14923
   452
wenzelm@14923
   453
fun name_of (Transition {name, ...}) = name;
wenzelm@14923
   454
fun source_of (Transition {source, ...}) = source;
wenzelm@5828
   455
wenzelm@5828
   456
wenzelm@5828
   457
(* diagnostics *)
wenzelm@5828
   458
wenzelm@5828
   459
fun str_of_transition (Transition {name, pos, ...}) = quote name ^ Position.str_of pos;
wenzelm@5828
   460
wenzelm@5828
   461
fun command_msg msg tr = msg ^ "command " ^ str_of_transition tr;
wenzelm@5828
   462
fun at_command tr = command_msg "At " tr ^ ".";
wenzelm@5828
   463
wenzelm@5828
   464
fun type_error tr state =
wenzelm@18685
   465
  ERROR (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
wenzelm@5828
   466
wenzelm@5828
   467
wenzelm@5828
   468
(* modify transitions *)
wenzelm@5828
   469
wenzelm@14923
   470
fun name nm = map_transition (fn (_, pos, source, int_only, print, no_timing, trans) =>
wenzelm@14923
   471
  (nm, pos, source, int_only, print, no_timing, trans));
wenzelm@5828
   472
wenzelm@14923
   473
fun position pos = map_transition (fn (name, _, source, int_only, print, no_timing, trans) =>
wenzelm@14923
   474
  (name, pos, source, int_only, print, no_timing, trans));
wenzelm@9010
   475
wenzelm@14923
   476
fun source src = map_transition (fn (name, pos, _, int_only, print, no_timing, trans) =>
skalberg@15531
   477
  (name, pos, SOME src, int_only, print, no_timing, trans));
wenzelm@5828
   478
wenzelm@14923
   479
fun interactive int_only = map_transition (fn (name, pos, source, _, print, no_timing, trans) =>
wenzelm@14923
   480
  (name, pos, source, int_only, print, no_timing, trans));
wenzelm@14923
   481
wenzelm@17363
   482
val no_timing = map_transition (fn (name, pos, source, int_only, print, _, trans) =>
wenzelm@17363
   483
  (name, pos, source, int_only, print, true, trans));
wenzelm@17363
   484
wenzelm@17363
   485
fun add_trans tr = map_transition (fn (name, pos, source, int_only, print, no_timing, trans) =>
wenzelm@17363
   486
  (name, pos, source, int_only, print, no_timing, trans @ [tr]));
wenzelm@17363
   487
wenzelm@16607
   488
fun print' mode = map_transition (fn (name, pos, source, int_only, print, no_timing, trans) =>
wenzelm@16607
   489
  (name, pos, source, int_only, insert (op =) mode print, no_timing, trans));
wenzelm@16607
   490
wenzelm@16607
   491
val print = print' "";
wenzelm@5828
   492
wenzelm@17363
   493
val three_buffersN = "three_buffers";
wenzelm@17363
   494
val print3 = print' three_buffersN;
wenzelm@5828
   495
wenzelm@5828
   496
wenzelm@21007
   497
(* basic transitions *)
wenzelm@5828
   498
wenzelm@5828
   499
val reset = add_trans Reset;
wenzelm@6689
   500
fun init f exit kill = add_trans (Init (f, (exit, kill)));
wenzelm@6689
   501
val exit = add_trans Exit;
wenzelm@6689
   502
val kill = add_trans Kill;
wenzelm@20128
   503
val history = add_trans o History;
wenzelm@7612
   504
val keep' = add_trans o Keep;
wenzelm@18592
   505
fun map_current f = add_trans (Transaction (false, f));
wenzelm@18592
   506
fun app_current f = add_trans (Transaction (true, f));
wenzelm@5828
   507
wenzelm@7612
   508
fun keep f = add_trans (Keep (fn _ => f));
wenzelm@5828
   509
fun imperative f = keep (fn _ => f ());
wenzelm@5828
   510
wenzelm@6689
   511
fun init_theory f exit kill =
wenzelm@20963
   512
  init (fn int => Theory (Context.Theory (f int), NONE))
wenzelm@20963
   513
    (fn Theory (Context.Theory thy, _) => exit thy | _ => raise UNDEF)
wenzelm@20963
   514
    (fn Theory (Context.Theory thy, _) => kill thy | _ => raise UNDEF);
wenzelm@5828
   515
wenzelm@21007
   516
val unknown_theory = imperative (fn () => warning "Unknown theory context");
wenzelm@21007
   517
val unknown_proof = imperative (fn () => warning "Unknown proof context");
wenzelm@21007
   518
val unknown_context = imperative (fn () => warning "Unknown context");
wenzelm@15668
   519
wenzelm@21007
   520
wenzelm@21007
   521
(* theory transitions *)
wenzelm@15668
   522
wenzelm@20963
   523
fun theory' f = app_current (fn int =>
wenzelm@20963
   524
  (fn Theory (Context.Theory thy, _) => Theory (Context.Theory (f int thy), NONE)
wenzelm@20963
   525
    | _ => raise UNDEF));
wenzelm@20963
   526
wenzelm@20963
   527
fun theory f = theory' (K f);
wenzelm@20963
   528
wenzelm@20985
   529
fun begin_local_theory begin f = app_current (fn int =>
wenzelm@20963
   530
  (fn Theory (Context.Theory thy, _) =>
wenzelm@20963
   531
        let
wenzelm@20985
   532
          val lthy = f thy;
wenzelm@20963
   533
          val (ctxt, gthy) =
wenzelm@20963
   534
            if begin then (lthy, Context.Proof lthy)
wenzelm@20985
   535
            else lthy |> LocalTheory.exit int ||> Context.Theory;
wenzelm@20963
   536
        in Theory (gthy, SOME ctxt) end
wenzelm@20963
   537
    | _ => raise UNDEF));
wenzelm@17076
   538
wenzelm@21007
   539
val end_local_theory = app_current (fn int =>
wenzelm@21007
   540
  (fn Theory (Context.Proof lthy, _) =>
wenzelm@21007
   541
      let val (ctxt', thy') = LocalTheory.exit int lthy
wenzelm@21007
   542
      in Theory (Context.Theory thy', SOME ctxt') end
wenzelm@21007
   543
    | _ => raise UNDEF));
wenzelm@21007
   544
wenzelm@21007
   545
local
wenzelm@21007
   546
wenzelm@20963
   547
fun local_theory_presentation loc f g = app_current (fn int =>
wenzelm@20963
   548
  (fn Theory (Context.Theory thy, _) =>
wenzelm@20963
   549
        let val (ctxt', thy') = TheoryTarget.mapping loc f thy
wenzelm@20963
   550
        in Theory (Context.Theory thy', SOME ctxt') end
wenzelm@20963
   551
    | Theory (Context.Proof lthy, _) =>
wenzelm@20963
   552
        let val (ctxt', lthy') =
wenzelm@20963
   553
          if is_none loc then f lthy |> (fn lthy' => (lthy', LocalTheory.reinit lthy'))
wenzelm@20963
   554
          else lthy |> LocalTheory.raw_theory_result (TheoryTarget.mapping loc f)
wenzelm@20963
   555
        in Theory (Context.Proof lthy', SOME ctxt') end
wenzelm@20963
   556
    | _ => raise UNDEF) #> tap (g int));
wenzelm@15668
   557
wenzelm@21007
   558
in
wenzelm@21007
   559
wenzelm@20963
   560
fun local_theory loc f = local_theory_presentation loc f (K I);
wenzelm@20963
   561
fun present_local_theory loc g = local_theory_presentation loc I g;
wenzelm@18955
   562
wenzelm@21007
   563
end;
wenzelm@21007
   564
wenzelm@21007
   565
wenzelm@21007
   566
(* proof transitions *)
wenzelm@21007
   567
wenzelm@21007
   568
local
wenzelm@21007
   569
wenzelm@21007
   570
fun begin_proof init finish = app_current (fn int =>
wenzelm@21007
   571
  (fn Theory (gthy, _) =>
wenzelm@21007
   572
    let 
wenzelm@21007
   573
      val prf = init gthy;
wenzelm@19996
   574
      val schematic = Proof.schematic_goal prf;
wenzelm@19996
   575
    in
wenzelm@19996
   576
      if ! skip_proofs andalso schematic then
wenzelm@19996
   577
        warning "Cannot skip proof of schematic goal statement"
wenzelm@19996
   578
      else ();
wenzelm@19996
   579
      if ! skip_proofs andalso not schematic then
wenzelm@21007
   580
        SkipProof
wenzelm@21007
   581
          (History.init (undo_limit int) 0, (finish gthy (Proof.global_skip_proof int prf), gthy))
wenzelm@21007
   582
      else Proof (ProofHistory.init (undo_limit int) prf, (finish gthy, gthy))
wenzelm@19996
   583
    end
wenzelm@18592
   584
  | _ => raise UNDEF));
wenzelm@18563
   585
wenzelm@21007
   586
val global_finish = Context.Theory o ProofContext.theory_of;
wenzelm@21007
   587
val local_finish = Context.Proof o LocalTheory.reinit;
wenzelm@21007
   588
wenzelm@21007
   589
fun mixed_finish (Context.Theory _) ctxt = global_finish ctxt
wenzelm@21007
   590
  | mixed_finish (Context.Proof lthy) ctxt =
wenzelm@21007
   591
      Context.Proof (LocalTheory.raw_theory (K (ProofContext.theory_of ctxt)) lthy);
wenzelm@21007
   592
wenzelm@21007
   593
in
wenzelm@21007
   594
wenzelm@21007
   595
fun local_theory_to_proof NONE f = begin_proof
wenzelm@21007
   596
      (fn Context.Theory thy => f (TheoryTarget.init NONE thy)
wenzelm@21007
   597
        | Context.Proof lthy => f lthy)
wenzelm@21007
   598
      (fn Context.Theory _ => global_finish
wenzelm@21007
   599
        | Context.Proof _ => local_finish)
wenzelm@21007
   600
  | local_theory_to_proof loc f =
wenzelm@21007
   601
      begin_proof (f o TheoryTarget.init loc o Context.theory_of) mixed_finish;
wenzelm@21007
   602
wenzelm@21007
   603
fun theory_to_proof f =
wenzelm@21007
   604
  begin_proof (fn Context.Theory thy => f thy | _ => raise UNDEF) (K global_finish);
wenzelm@21007
   605
wenzelm@21007
   606
end;
wenzelm@21007
   607
wenzelm@21007
   608
fun end_proof f = map_current (fn int =>
wenzelm@21007
   609
  (fn Proof (prf, (finish, orig_gthy)) =>
wenzelm@21007
   610
        let val state = ProofHistory.current prf in
wenzelm@21007
   611
          if can (Proof.assert_bottom true) state then
wenzelm@21007
   612
            let
wenzelm@21007
   613
              val ctxt' = f int state;
wenzelm@21007
   614
              val gthy' = finish ctxt';
wenzelm@21007
   615
            in Theory (gthy', SOME ctxt') end
wenzelm@21007
   616
          else raise UNDEF
wenzelm@21007
   617
        end
wenzelm@21007
   618
    | SkipProof (h, (gthy, _)) =>
wenzelm@21007
   619
        if History.current h = 0 then Theory (gthy, NONE) else raise UNDEF
wenzelm@21007
   620
    | _ => raise UNDEF));
wenzelm@21007
   621
wenzelm@21007
   622
val forget_proof = map_current (fn _ =>
wenzelm@21007
   623
  (fn Proof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@21007
   624
    | SkipProof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@21007
   625
    | _ => raise UNDEF));
wenzelm@21007
   626
wenzelm@21177
   627
fun present_proof f = map_current (fn int =>
wenzelm@21177
   628
  (fn Proof (prf, x) => Proof (ProofHistory.apply I prf, x)
wenzelm@21177
   629
    | SkipProof (h, x) => SkipProof (History.apply I h, x)
wenzelm@21177
   630
    | _ => raise UNDEF) #> tap (f int));
wenzelm@21177
   631
wenzelm@17904
   632
fun proofs' f = map_current (fn int =>
wenzelm@21007
   633
  (fn Proof (prf, x) => Proof (ProofHistory.applys (f int) prf, x)
wenzelm@21007
   634
    | SkipProof (h, x) => SkipProof (History.apply I h, x)
wenzelm@16815
   635
    | _ => raise UNDEF));
wenzelm@15668
   636
wenzelm@17904
   637
fun proof' f = proofs' (Seq.single oo f);
wenzelm@17904
   638
val proofs = proofs' o K;
wenzelm@6689
   639
val proof = proof' o K;
wenzelm@16815
   640
wenzelm@16815
   641
fun actual_proof f = map_current (fn _ =>
wenzelm@21007
   642
  (fn Proof (prf, x) => Proof (f prf, x)
wenzelm@20963
   643
    | _ => raise UNDEF));
wenzelm@16815
   644
wenzelm@16815
   645
fun skip_proof f = map_current (fn _ =>
wenzelm@21007
   646
  (fn SkipProof (h, x) => SkipProof (f h, x)
wenzelm@18563
   647
    | _ => raise UNDEF));
wenzelm@18563
   648
wenzelm@16815
   649
fun skip_proof_to_theory p = map_current (fn _ =>
wenzelm@21007
   650
  (fn SkipProof (h, (gthy, _)) =>
wenzelm@21007
   651
    if p (History.current h) then Theory (gthy, NONE)
wenzelm@17904
   652
    else raise UNDEF
wenzelm@17904
   653
  | _ => raise UNDEF));
wenzelm@5828
   654
wenzelm@5828
   655
wenzelm@5828
   656
wenzelm@5828
   657
(** toplevel transactions **)
wenzelm@5828
   658
wenzelm@5828
   659
(* apply transitions *)
wenzelm@5828
   660
wenzelm@6664
   661
local
wenzelm@6664
   662
wenzelm@9010
   663
fun app int (tr as Transition {trans, int_only, print, no_timing, ...}) state =
wenzelm@5828
   664
  let
wenzelm@16682
   665
    val _ = conditional (not int andalso int_only) (fn () =>
wenzelm@16682
   666
      warning (command_msg "Interactive-only " tr));
wenzelm@16682
   667
wenzelm@18685
   668
    fun do_timing f x = (Output.info (command_msg "" tr); timeap f x);
wenzelm@16682
   669
    fun do_profiling f x = profile (! profiling) f x;
wenzelm@16682
   670
wenzelm@6689
   671
    val (result, opt_exn) =
wenzelm@16729
   672
       state |> (apply_trans int trans
wenzelm@16729
   673
        |> (if ! profiling > 0 then do_profiling else I)
wenzelm@16729
   674
        |> (if ! profiling > 0 orelse ! timing andalso not no_timing then do_timing else I));
wenzelm@16607
   675
    val _ = conditional (int andalso not (! quiet) andalso
wenzelm@20664
   676
        exists (member (op =) print) ("" :: ! print_mode))
wenzelm@16607
   677
      (fn () => print_state false result);
skalberg@15570
   678
  in (result, Option.map (fn UNDEF => type_error tr state | exn => exn) opt_exn) end;
wenzelm@6664
   679
wenzelm@6664
   680
in
wenzelm@5828
   681
wenzelm@6689
   682
fun apply int tr st =
wenzelm@6965
   683
  (case app int tr st of
skalberg@15531
   684
    (_, SOME TERMINATE) => NONE
skalberg@15531
   685
  | (_, SOME RESTART) => SOME (toplevel, NONE)
skalberg@15531
   686
  | (state', SOME (EXCURSION_FAIL exn_info)) => SOME (state', SOME exn_info)
skalberg@15531
   687
  | (state', SOME exn) => SOME (state', SOME (exn, at_command tr))
skalberg@15531
   688
  | (state', NONE) => SOME (state', NONE));
wenzelm@6664
   689
wenzelm@6664
   690
end;
wenzelm@5828
   691
wenzelm@5828
   692
wenzelm@17076
   693
(* excursion: toplevel -- apply transformers/presentation -- toplevel *)
wenzelm@5828
   694
wenzelm@6664
   695
local
wenzelm@6664
   696
wenzelm@5828
   697
fun excur [] x = x
wenzelm@17076
   698
  | excur ((tr, pr) :: trs) (st, res) =
wenzelm@17321
   699
      (case apply (! interact) tr st of
skalberg@15531
   700
        SOME (st', NONE) =>
wenzelm@18685
   701
          excur trs (st', pr st st' res handle exn =>
wenzelm@10324
   702
            raise EXCURSION_FAIL (exn, "Presentation failed\n" ^ at_command tr))
skalberg@15531
   703
      | SOME (st', SOME exn_info) => raise EXCURSION_FAIL exn_info
skalberg@15531
   704
      | NONE => raise EXCURSION_FAIL (TERMINATE, at_command tr));
wenzelm@5828
   705
wenzelm@17076
   706
fun no_pr _ _ _ = ();
wenzelm@17076
   707
wenzelm@6664
   708
in
wenzelm@6664
   709
wenzelm@17076
   710
fun present_excursion trs res =
skalberg@15531
   711
  (case excur trs (State NONE, res) of
skalberg@15531
   712
    (State NONE, res') => res'
wenzelm@18685
   713
  | _ => error "Unfinished development at end of input")
wenzelm@9134
   714
  handle exn => error (exn_message exn);
wenzelm@9134
   715
wenzelm@17076
   716
fun excursion trs = present_excursion (map (rpair no_pr) trs) ();
wenzelm@7062
   717
wenzelm@6664
   718
end;
wenzelm@6664
   719
wenzelm@5828
   720
wenzelm@5828
   721
wenzelm@5828
   722
(** interactive transformations **)
wenzelm@5828
   723
wenzelm@5828
   724
(* the global state reference *)
wenzelm@5828
   725
skalberg@15531
   726
val global_state = ref (toplevel, NONE: (exn * string) option);
wenzelm@5828
   727
skalberg@15531
   728
fun set_state state = global_state := (state, NONE);
wenzelm@5828
   729
fun get_state () = fst (! global_state);
wenzelm@5828
   730
fun exn () = snd (! global_state);
wenzelm@5828
   731
wenzelm@5828
   732
wenzelm@6965
   733
(* the Isar source of transitions *)
wenzelm@6965
   734
nipkow@14091
   735
type 'a isar =
wenzelm@6965
   736
  (transition, (transition option,
wenzelm@12881
   737
    (OuterLex.token, (OuterLex.token option, (OuterLex.token, (OuterLex.token,
nipkow@14091
   738
      Position.T * (Symbol.symbol, (string, 'a) Source.source) Source.source)
wenzelm@12881
   739
          Source.source) Source.source) Source.source) Source.source) Source.source) Source.source;
wenzelm@6965
   740
wenzelm@6965
   741
wenzelm@5828
   742
(* apply transformers to global state *)
wenzelm@5828
   743
wenzelm@14985
   744
nonfix >> >>>;
wenzelm@5828
   745
wenzelm@5828
   746
fun >> tr =
wenzelm@5828
   747
  (case apply true tr (get_state ()) of
skalberg@15531
   748
    NONE => false
skalberg@15531
   749
  | SOME (state', exn_info) =>
wenzelm@5828
   750
      (global_state := (state', exn_info);
wenzelm@16729
   751
        print_exn exn_info;
wenzelm@5828
   752
        true));
wenzelm@5828
   753
wenzelm@14985
   754
fun >>> [] = ()
wenzelm@14985
   755
  | >>> (tr :: trs) = if >> tr then >>> trs else ();
wenzelm@14985
   756
wenzelm@17513
   757
(*Spurious interrupts ahead!  Race condition?*)
wenzelm@17513
   758
fun get_interrupt src = SOME (Source.get_single src) handle Interrupt => NONE;
wenzelm@7602
   759
wenzelm@20928
   760
fun warn_secure () =
wenzelm@20928
   761
  let val secure = Secure.is_secure ()
wenzelm@20928
   762
  in if secure then warning "Cannot exit to ML in secure mode" else (); secure end;
wenzelm@20928
   763
wenzelm@5828
   764
fun raw_loop src =
wenzelm@7602
   765
  (case get_interrupt (Source.set_prompt (prompt_state (get_state ())) src) of
skalberg@15531
   766
    NONE => (writeln "\nInterrupt."; raw_loop src)
wenzelm@20928
   767
  | SOME NONE => if warn_secure () then quit () else ()
wenzelm@20928
   768
  | SOME (SOME (tr, src')) =>
wenzelm@20928
   769
      if >> tr orelse warn_secure () then raw_loop src'
wenzelm@20928
   770
      else ());
wenzelm@5828
   771
wenzelm@12987
   772
fun loop src = ignore_interrupt raw_loop src;
wenzelm@5828
   773
wenzelm@5828
   774
end;