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