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