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