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