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