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