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