src/Pure/Isar/toplevel.ML
author wenzelm
Thu Dec 11 20:17:57 2008 +0100 (2008-12-11 ago)
changeset 29068 b92443a701de
parent 29066 f50c24e5b9fe
child 29122 b3bae49a013a
permissions -rw-r--r--
removed spurious exception_trace;
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@26602
     5
Isabelle/Isar toplevel transactions.
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@27564
    14
  val proof_node: node -> ProofNode.T option
wenzelm@20963
    15
  val cases_node: (generic_theory -> 'a) -> (Proof.state -> 'a) -> node -> 'a
wenzelm@29066
    16
  val context_node: node -> Proof.context
wenzelm@20963
    17
  val presentation_context: node option -> xstring option -> Proof.context
wenzelm@5828
    18
  type state
wenzelm@26602
    19
  val toplevel: state
wenzelm@7732
    20
  val is_toplevel: state -> bool
wenzelm@18589
    21
  val is_theory: state -> bool
wenzelm@18589
    22
  val is_proof: state -> bool
wenzelm@17076
    23
  val level: state -> int
wenzelm@27576
    24
  val previous_node_of: state -> node option
wenzelm@5828
    25
  val node_of: state -> node
wenzelm@20963
    26
  val node_case: (generic_theory -> 'a) -> (Proof.state -> 'a) -> state -> 'a
wenzelm@21506
    27
  val context_of: state -> Proof.context
wenzelm@22089
    28
  val generic_theory_of: state -> generic_theory
wenzelm@5828
    29
  val theory_of: state -> theory
wenzelm@5828
    30
  val proof_of: state -> Proof.state
wenzelm@18589
    31
  val proof_position_of: state -> int
wenzelm@21007
    32
  val enter_proof_body: state -> Proof.state
wenzelm@16815
    33
  val print_state_context: state -> unit
wenzelm@16815
    34
  val print_state: bool -> state -> unit
wenzelm@16682
    35
  val quiet: bool ref
wenzelm@16682
    36
  val debug: bool ref
wenzelm@17321
    37
  val interact: bool ref
wenzelm@16682
    38
  val timing: bool ref
wenzelm@16682
    39
  val profiling: int ref
wenzelm@16815
    40
  val skip_proofs: bool ref
wenzelm@5828
    41
  exception TERMINATE
wenzelm@27583
    42
  exception TOPLEVEL_ERROR
wenzelm@26256
    43
  exception CONTEXT of Proof.context * exn
wenzelm@20128
    44
  val exn_message: exn -> string
wenzelm@20128
    45
  val program: (unit -> 'a) -> 'a
wenzelm@16682
    46
  type transition
wenzelm@5828
    47
  val empty: transition
wenzelm@27441
    48
  val init_of: transition -> string option
wenzelm@27427
    49
  val name_of: transition -> string
wenzelm@28105
    50
  val pos_of: transition -> Position.T
wenzelm@27500
    51
  val str_of: transition -> string
wenzelm@5828
    52
  val name: string -> transition -> transition
wenzelm@5828
    53
  val position: Position.T -> transition -> transition
wenzelm@5828
    54
  val interactive: bool -> transition -> transition
wenzelm@5828
    55
  val print: transition -> transition
wenzelm@9010
    56
  val no_timing: transition -> transition
wenzelm@27576
    57
  val init_theory: string -> (bool -> theory) -> (theory -> unit) -> transition -> transition
wenzelm@6689
    58
  val exit: transition -> transition
wenzelm@5828
    59
  val keep: (state -> unit) -> transition -> transition
wenzelm@7612
    60
  val keep': (bool -> state -> unit) -> transition -> transition
wenzelm@5828
    61
  val imperative: (unit -> unit) -> transition -> transition
wenzelm@27840
    62
  val ignored: Position.T -> transition
wenzelm@27840
    63
  val malformed: Position.T -> string -> transition
wenzelm@5828
    64
  val theory: (theory -> theory) -> transition -> transition
wenzelm@26491
    65
  val generic_theory: (generic_theory -> generic_theory) -> transition -> transition
wenzelm@7612
    66
  val theory': (bool -> theory -> theory) -> transition -> transition
wenzelm@20985
    67
  val begin_local_theory: bool -> (theory -> local_theory) -> transition -> transition
wenzelm@21007
    68
  val end_local_theory: transition -> transition
wenzelm@20963
    69
  val local_theory: xstring option -> (local_theory -> local_theory) -> transition -> transition
wenzelm@27859
    70
  val present_local_theory: xstring option -> (node -> unit) -> transition -> transition
berghofe@24453
    71
  val local_theory_to_proof': xstring option -> (bool -> local_theory -> Proof.state) ->
berghofe@24453
    72
    transition -> transition
wenzelm@21007
    73
  val local_theory_to_proof: xstring option -> (local_theory -> Proof.state) ->
wenzelm@21007
    74
    transition -> transition
wenzelm@17363
    75
  val theory_to_proof: (theory -> Proof.state) -> transition -> transition
wenzelm@21007
    76
  val end_proof: (bool -> Proof.state -> Proof.context) -> transition -> transition
wenzelm@21007
    77
  val forget_proof: transition -> transition
wenzelm@27859
    78
  val present_proof: (node -> unit) -> transition -> transition
wenzelm@21177
    79
  val proofs': (bool -> Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@17904
    80
  val proof': (bool -> Proof.state -> Proof.state) -> transition -> transition
wenzelm@21177
    81
  val proofs: (Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@21177
    82
  val proof: (Proof.state -> Proof.state) -> transition -> transition
wenzelm@27564
    83
  val actual_proof: (ProofNode.T -> ProofNode.T) -> transition -> transition
wenzelm@27564
    84
  val skip_proof: (int -> int) -> transition -> transition
wenzelm@17904
    85
  val skip_proof_to_theory: (int -> bool) -> transition -> transition
wenzelm@27427
    86
  val get_id: transition -> string option
wenzelm@27427
    87
  val put_id: string -> transition -> transition
wenzelm@9512
    88
  val unknown_theory: transition -> transition
wenzelm@9512
    89
  val unknown_proof: transition -> transition
wenzelm@9512
    90
  val unknown_context: transition -> transition
wenzelm@28425
    91
  val setmp_thread_position: transition -> ('a -> 'b) -> 'a -> 'b
wenzelm@27606
    92
  val status: transition -> Markup.T -> unit
wenzelm@26602
    93
  val error_msg: transition -> exn * string -> unit
wenzelm@28103
    94
  val add_hook: (transition -> state -> state -> unit) -> unit
wenzelm@26602
    95
  val transition: bool -> transition -> state -> (state * (exn * string) option) option
wenzelm@28425
    96
  val commit_exit: Position.T -> transition
wenzelm@28425
    97
  val command: transition -> state -> state
wenzelm@28433
    98
  val excursion: (transition * transition list) list -> (transition * state) list * (unit -> unit)
wenzelm@5828
    99
end;
wenzelm@5828
   100
wenzelm@6965
   101
structure Toplevel: TOPLEVEL =
wenzelm@5828
   102
struct
wenzelm@5828
   103
wenzelm@5828
   104
(** toplevel state **)
wenzelm@5828
   105
wenzelm@19063
   106
exception UNDEF;
wenzelm@19063
   107
wenzelm@19063
   108
wenzelm@21294
   109
(* local theory wrappers *)
wenzelm@5828
   110
wenzelm@20963
   111
type generic_theory = Context.generic;    (*theory or local_theory*)
wenzelm@20963
   112
wenzelm@25292
   113
val loc_init = TheoryTarget.context;
wenzelm@28394
   114
val loc_exit = LocalTheory.exit_global;
wenzelm@21294
   115
wenzelm@25292
   116
fun loc_begin loc (Context.Theory thy) = loc_init (the_default "-" loc) thy
wenzelm@21294
   117
  | loc_begin NONE (Context.Proof lthy) = lthy
haftmann@25269
   118
  | loc_begin (SOME loc) (Context.Proof lthy) = loc_init loc (loc_exit lthy);
wenzelm@21294
   119
wenzelm@21294
   120
fun loc_finish _ (Context.Theory _) = Context.Theory o loc_exit
wenzelm@21294
   121
  | loc_finish NONE (Context.Proof _) = Context.Proof o LocalTheory.restore
wenzelm@25292
   122
  | loc_finish (SOME _) (Context.Proof lthy) = fn lthy' =>
wenzelm@25292
   123
      Context.Proof (LocalTheory.reinit (LocalTheory.raw_theory (K (loc_exit lthy')) lthy));
wenzelm@21294
   124
wenzelm@21294
   125
wenzelm@21958
   126
(* datatype node *)
wenzelm@21294
   127
wenzelm@5828
   128
datatype node =
wenzelm@27576
   129
  Theory of generic_theory * Proof.context option
wenzelm@27576
   130
    (*theory with presentation context*) |
wenzelm@27576
   131
  Proof of ProofNode.T * ((Proof.context -> generic_theory) * generic_theory)
wenzelm@27576
   132
    (*proof node, finish, original theory*) |
wenzelm@27564
   133
  SkipProof of int * (generic_theory * generic_theory);
wenzelm@27564
   134
    (*proof depth, resulting theory, original theory*)
wenzelm@5828
   135
wenzelm@22056
   136
val the_global_theory = fn Theory (Context.Theory thy, _) => thy | _ => raise UNDEF;
wenzelm@20963
   137
val theory_node = fn Theory (gthy, _) => SOME gthy | _ => NONE;
wenzelm@18589
   138
val proof_node = fn Proof (prf, _) => SOME prf | _ => NONE;
wenzelm@18589
   139
wenzelm@20963
   140
fun cases_node f _ (Theory (gthy, _)) = f gthy
wenzelm@27564
   141
  | cases_node _ g (Proof (prf, _)) = g (ProofNode.current prf)
wenzelm@21007
   142
  | cases_node f _ (SkipProof (_, (gthy, _))) = f gthy;
wenzelm@19063
   143
wenzelm@29066
   144
val context_node = cases_node Context.proof_of Proof.context_of;
wenzelm@29066
   145
wenzelm@20963
   146
fun presentation_context (SOME (Theory (_, SOME ctxt))) NONE = ctxt
wenzelm@29066
   147
  | presentation_context (SOME node) NONE = context_node node
wenzelm@20963
   148
  | presentation_context (SOME node) (SOME loc) =
haftmann@25269
   149
      loc_init loc (cases_node Context.theory_of Proof.theory_of node)
wenzelm@20963
   150
  | presentation_context NONE _ = raise UNDEF;
wenzelm@19063
   151
wenzelm@26624
   152
fun reset_presentation (Theory (gthy, _)) = Theory (gthy, NONE)
wenzelm@26624
   153
  | reset_presentation node = node;
wenzelm@26624
   154
wenzelm@21958
   155
wenzelm@21958
   156
(* datatype state *)
wenzelm@21958
   157
wenzelm@27601
   158
type node_info = node * (theory -> unit);  (*node with exit operation*)
wenzelm@27601
   159
datatype state = State of node_info option * node_info option;  (*current, previous*)
wenzelm@5828
   160
wenzelm@27576
   161
val toplevel = State (NONE, NONE);
wenzelm@5828
   162
wenzelm@27576
   163
fun is_toplevel (State (NONE, _)) = true
wenzelm@7732
   164
  | is_toplevel _ = false;
wenzelm@7732
   165
wenzelm@27576
   166
fun level (State (NONE, _)) = 0
wenzelm@27576
   167
  | level (State (SOME (Theory _, _), _)) = 0
wenzelm@27576
   168
  | level (State (SOME (Proof (prf, _), _), _)) = Proof.level (ProofNode.current prf)
wenzelm@27576
   169
  | level (State (SOME (SkipProof (d, _), _), _)) = d + 1;   (*different notion of proof depth!*)
wenzelm@17076
   170
wenzelm@27576
   171
fun str_of_state (State (NONE, _)) = "at top level"
wenzelm@27576
   172
  | str_of_state (State (SOME (Theory (Context.Theory _, _), _), _)) = "in theory mode"
wenzelm@27576
   173
  | str_of_state (State (SOME (Theory (Context.Proof _, _), _), _)) = "in local theory mode"
wenzelm@27576
   174
  | str_of_state (State (SOME (Proof _, _), _)) = "in proof mode"
wenzelm@27576
   175
  | str_of_state (State (SOME (SkipProof _, _), _)) = "in skipped proof mode";
wenzelm@5946
   176
wenzelm@5946
   177
wenzelm@27576
   178
(* current node *)
wenzelm@5828
   179
wenzelm@27603
   180
fun previous_node_of (State (_, prev)) = Option.map #1 prev;
wenzelm@6689
   181
wenzelm@27576
   182
fun node_of (State (NONE, _)) = raise UNDEF
wenzelm@27576
   183
  | node_of (State (SOME (node, _), _)) = node;
wenzelm@5828
   184
wenzelm@18589
   185
fun is_theory state = not (is_toplevel state) andalso is_some (theory_node (node_of state));
wenzelm@18589
   186
fun is_proof state = not (is_toplevel state) andalso is_some (proof_node (node_of state));
wenzelm@18589
   187
wenzelm@19063
   188
fun node_case f g state = cases_node f g (node_of state);
wenzelm@5828
   189
wenzelm@21506
   190
val context_of = node_case Context.proof_of Proof.context_of;
wenzelm@22089
   191
val generic_theory_of = node_case I (Context.Proof o Proof.context_of);
wenzelm@20963
   192
val theory_of = node_case Context.theory_of Proof.theory_of;
wenzelm@18589
   193
val proof_of = node_case (fn _ => raise UNDEF) I;
wenzelm@17208
   194
wenzelm@18589
   195
fun proof_position_of state =
wenzelm@18589
   196
  (case node_of state of
wenzelm@27564
   197
    Proof (prf, _) => ProofNode.position prf
wenzelm@18589
   198
  | _ => raise UNDEF);
wenzelm@6664
   199
wenzelm@21007
   200
val enter_proof_body = node_case (Proof.init o Context.proof_of) Proof.enter_forward;
wenzelm@5828
   201
wenzelm@5828
   202
wenzelm@16815
   203
(* print state *)
wenzelm@16815
   204
wenzelm@25292
   205
val pretty_context = LocalTheory.pretty o Context.cases (TheoryTarget.init NONE) I;
wenzelm@16815
   206
wenzelm@23640
   207
fun print_state_context state =
wenzelm@24795
   208
  (case try node_of state of
wenzelm@21506
   209
    NONE => []
wenzelm@24795
   210
  | SOME (Theory (gthy, _)) => pretty_context gthy
wenzelm@24795
   211
  | SOME (Proof (_, (_, gthy))) => pretty_context gthy
wenzelm@24795
   212
  | SOME (SkipProof (_, (gthy, _))) => pretty_context gthy)
wenzelm@23640
   213
  |> Pretty.chunks |> Pretty.writeln;
wenzelm@16815
   214
wenzelm@23640
   215
fun print_state prf_only state =
wenzelm@23701
   216
  (case try node_of state of
wenzelm@23701
   217
    NONE => []
wenzelm@23701
   218
  | SOME (Theory (gthy, _)) => if prf_only then [] else pretty_context gthy
wenzelm@23701
   219
  | SOME (Proof (prf, _)) =>
wenzelm@27564
   220
      Proof.pretty_state (ProofNode.position prf) (ProofNode.current prf)
wenzelm@27564
   221
  | SOME (SkipProof (d, _)) => [Pretty.str ("skipped proof: depth " ^ string_of_int d)])
wenzelm@23701
   222
  |> Pretty.markup_chunks Markup.state |> Pretty.writeln;
wenzelm@16815
   223
wenzelm@16815
   224
wenzelm@15668
   225
wenzelm@5828
   226
(** toplevel transitions **)
wenzelm@5828
   227
wenzelm@16682
   228
val quiet = ref false;
wenzelm@22135
   229
val debug = Output.debugging;
wenzelm@17321
   230
val interact = ref false;
wenzelm@16682
   231
val timing = Output.timing;
wenzelm@16682
   232
val profiling = ref 0;
wenzelm@16815
   233
val skip_proofs = ref false;
wenzelm@16682
   234
wenzelm@5828
   235
exception TERMINATE;
wenzelm@7022
   236
exception EXCURSION_FAIL of exn * string;
wenzelm@6689
   237
exception FAILURE of state * exn;
wenzelm@24055
   238
exception TOPLEVEL_ERROR;
wenzelm@5828
   239
wenzelm@20128
   240
wenzelm@20128
   241
(* print exceptions *)
wenzelm@20128
   242
wenzelm@26256
   243
exception CONTEXT of Proof.context * exn;
wenzelm@26256
   244
wenzelm@26256
   245
fun exn_context NONE exn = exn
wenzelm@26256
   246
  | exn_context (SOME ctxt) exn = CONTEXT (ctxt, exn);
wenzelm@26256
   247
wenzelm@20128
   248
local
wenzelm@20128
   249
wenzelm@26256
   250
fun if_context NONE _ _ = []
wenzelm@26256
   251
  | if_context (SOME ctxt) f xs = map (f ctxt) xs;
wenzelm@20128
   252
wenzelm@20128
   253
fun raised name [] = "exception " ^ name ^ " raised"
wenzelm@20128
   254
  | raised name [msg] = "exception " ^ name ^ " raised: " ^ msg
wenzelm@20128
   255
  | raised name msgs = cat_lines (("exception " ^ name ^ " raised:") :: msgs);
wenzelm@20128
   256
wenzelm@20128
   257
in
wenzelm@20128
   258
wenzelm@26256
   259
fun exn_message e =
wenzelm@26256
   260
  let
wenzelm@26256
   261
    val detailed = ! debug;
wenzelm@26256
   262
wenzelm@26256
   263
    fun exn_msg _ (CONTEXT (ctxt, exn)) = exn_msg (SOME ctxt) exn
wenzelm@28458
   264
      | exn_msg ctxt (Exn.EXCEPTIONS exns) = cat_lines (map (exn_msg ctxt) exns)
wenzelm@26293
   265
      | exn_msg ctxt (EXCURSION_FAIL (exn, loc)) =
wenzelm@26293
   266
          exn_msg ctxt exn ^ Markup.markup Markup.location ("\n" ^ loc)
wenzelm@26256
   267
      | exn_msg _ TERMINATE = "Exit."
wenzelm@28443
   268
      | exn_msg _ Exn.Interrupt = "Interrupt."
wenzelm@26256
   269
      | exn_msg _ TimeLimit.TimeOut = "Timeout."
wenzelm@26256
   270
      | exn_msg _ TOPLEVEL_ERROR = "Error."
wenzelm@26256
   271
      | exn_msg _ (SYS_ERROR msg) = "## SYSTEM ERROR ##\n" ^ msg
wenzelm@26256
   272
      | exn_msg _ (ERROR msg) = msg
wenzelm@26256
   273
      | exn_msg _ (Fail msg) = raised "Fail" [msg]
wenzelm@26256
   274
      | exn_msg _ (THEORY (msg, thys)) =
wenzelm@26256
   275
          raised "THEORY" (msg :: (if detailed then map Context.str_of_thy thys else []))
wenzelm@26256
   276
      | exn_msg _ (Syntax.AST (msg, asts)) = raised "AST" (msg ::
wenzelm@26256
   277
            (if detailed then map (Pretty.string_of o Syntax.pretty_ast) asts else []))
wenzelm@26256
   278
      | exn_msg ctxt (TYPE (msg, Ts, ts)) = raised "TYPE" (msg ::
wenzelm@26256
   279
            (if detailed then
wenzelm@26256
   280
              if_context ctxt Syntax.string_of_typ Ts @ if_context ctxt Syntax.string_of_term ts
wenzelm@26256
   281
             else []))
wenzelm@26256
   282
      | exn_msg ctxt (TERM (msg, ts)) = raised "TERM" (msg ::
wenzelm@26256
   283
            (if detailed then if_context ctxt Syntax.string_of_term ts else []))
wenzelm@26256
   284
      | exn_msg ctxt (THM (msg, i, thms)) = raised ("THM " ^ string_of_int i) (msg ::
wenzelm@26256
   285
            (if detailed then if_context ctxt ProofContext.string_of_thm thms else []))
wenzelm@26256
   286
      | exn_msg _ exn = raised (General.exnMessage exn) []
wenzelm@26256
   287
  in exn_msg NONE e end;
wenzelm@26256
   288
wenzelm@20128
   289
end;
wenzelm@20128
   290
wenzelm@20128
   291
wenzelm@20128
   292
(* controlled execution *)
wenzelm@20128
   293
wenzelm@20128
   294
local
wenzelm@20128
   295
wenzelm@18685
   296
fun debugging f x =
wenzelm@23940
   297
  if ! debug then exception_trace (fn () => f x)
wenzelm@18685
   298
  else f x;
wenzelm@18685
   299
wenzelm@26256
   300
fun toplevel_error f x =
wenzelm@26256
   301
  let val ctxt = try ML_Context.the_local_context () in
wenzelm@26256
   302
    f x handle exn =>
wenzelm@26256
   303
      (Output.error_msg (exn_message (exn_context ctxt exn)); raise TOPLEVEL_ERROR)
wenzelm@26256
   304
  end;
wenzelm@24055
   305
wenzelm@20128
   306
in
wenzelm@20128
   307
wenzelm@20128
   308
fun controlled_execution f =
wenzelm@20128
   309
  f
wenzelm@20128
   310
  |> debugging
wenzelm@24055
   311
  |> interruptible;
wenzelm@20128
   312
wenzelm@20128
   313
fun program f =
wenzelm@24055
   314
 (f
wenzelm@28463
   315
  |> controlled_execution
wenzelm@24055
   316
  |> toplevel_error) ();
wenzelm@20128
   317
wenzelm@20128
   318
end;
wenzelm@20128
   319
wenzelm@5828
   320
wenzelm@27601
   321
(* node transactions -- maintaining stable checkpoints *)
wenzelm@7022
   322
wenzelm@6689
   323
local
wenzelm@6689
   324
wenzelm@26624
   325
fun is_draft_theory (Theory (gthy, _)) = Context.is_draft (Context.theory_of gthy)
wenzelm@26624
   326
  | is_draft_theory _ = false;
wenzelm@26624
   327
wenzelm@27601
   328
fun is_stale state = Context.is_stale (theory_of state) handle UNDEF => false;
wenzelm@27601
   329
wenzelm@26624
   330
fun stale_error NONE = SOME (ERROR "Stale theory encountered after successful execution!")
wenzelm@26624
   331
  | stale_error some = some;
wenzelm@16815
   332
wenzelm@27576
   333
fun map_theory f (Theory (gthy, ctxt)) =
wenzelm@27576
   334
      Theory (Context.mapping f (LocalTheory.raw_theory f) gthy, ctxt)
wenzelm@27576
   335
  | map_theory _ node = node;
wenzelm@6689
   336
wenzelm@6689
   337
in
wenzelm@6689
   338
wenzelm@27601
   339
fun apply_transaction pos f (node, exit) =
wenzelm@20128
   340
  let
wenzelm@27576
   341
    val _ = is_draft_theory node andalso error "Illegal draft theory in toplevel state";
wenzelm@27576
   342
    val cont_node = reset_presentation node;
wenzelm@27576
   343
    val back_node = map_theory (Theory.checkpoint o Theory.copy) cont_node;
wenzelm@27601
   344
    fun state_error e nd = (State (SOME (nd, exit), SOME (node, exit)), e);
wenzelm@6689
   345
wenzelm@20128
   346
    val (result, err) =
wenzelm@20128
   347
      cont_node
wenzelm@27576
   348
      |> controlled_execution f
wenzelm@26624
   349
      |> map_theory Theory.checkpoint
wenzelm@26624
   350
      |> state_error NONE
wenzelm@26624
   351
      handle exn => state_error (SOME exn) cont_node;
wenzelm@26624
   352
wenzelm@26624
   353
    val (result', err') =
wenzelm@26624
   354
      if is_stale result then state_error (stale_error err) back_node
wenzelm@26624
   355
      else (result, err);
wenzelm@20128
   356
  in
wenzelm@26624
   357
    (case err' of
wenzelm@26624
   358
      NONE => result'
wenzelm@26624
   359
    | SOME exn => raise FAILURE (result', exn))
wenzelm@20128
   360
  end;
wenzelm@6689
   361
wenzelm@6689
   362
end;
wenzelm@6689
   363
wenzelm@6689
   364
wenzelm@6689
   365
(* primitive transitions *)
wenzelm@6689
   366
wenzelm@5828
   367
datatype trans =
wenzelm@27576
   368
  Init of string * (bool -> theory) * (theory -> unit) | (*theory name, init, exit*)
wenzelm@27576
   369
  Exit |                                         (*formal exit of theory -- without committing*)
wenzelm@27576
   370
  CommitExit |                                   (*exit and commit final theory*)
wenzelm@27576
   371
  Keep of bool -> state -> unit |                (*peek at state*)
wenzelm@27576
   372
  Transaction of bool -> node -> node;           (*node transaction*)
wenzelm@21958
   373
wenzelm@6689
   374
local
wenzelm@5828
   375
wenzelm@27576
   376
fun apply_tr int _ (Init (_, f, exit)) (State (NONE, _)) =
wenzelm@27576
   377
      State (SOME (Theory (Context.Theory (Theory.checkpoint (f int)), NONE), exit), NONE)
wenzelm@27603
   378
  | apply_tr _ _ Exit (State (prev as SOME (Theory (Context.Theory _, _), _), _)) =
wenzelm@27603
   379
      State (NONE, prev)
wenzelm@27601
   380
  | apply_tr _ _ CommitExit (State (NONE, SOME (Theory (Context.Theory thy, _), exit))) =
wenzelm@27576
   381
      (controlled_execution exit thy; toplevel)
wenzelm@27576
   382
  | apply_tr int _ (Keep f) state =
wenzelm@27576
   383
      controlled_execution (fn x => tap (f int) x) state
wenzelm@27576
   384
  | apply_tr int pos (Transaction f) (State (SOME state, _)) =
wenzelm@27601
   385
      apply_transaction pos (fn x => f int x) state
wenzelm@23363
   386
  | apply_tr _ _ _ _ = raise UNDEF;
wenzelm@5828
   387
wenzelm@23363
   388
fun apply_union _ _ [] state = raise FAILURE (state, UNDEF)
wenzelm@23363
   389
  | apply_union int pos (tr :: trs) state =
wenzelm@28451
   390
      apply_union int pos trs state
wenzelm@28451
   391
        handle UNDEF => apply_tr int pos tr state
wenzelm@28451
   392
          | FAILURE (alt_state, UNDEF) => apply_tr int pos tr alt_state
wenzelm@6689
   393
          | exn as FAILURE _ => raise exn
wenzelm@6689
   394
          | exn => raise FAILURE (state, exn);
wenzelm@6689
   395
wenzelm@6689
   396
in
wenzelm@6689
   397
wenzelm@23363
   398
fun apply_trans int pos trs state = (apply_union int pos trs state, NONE)
skalberg@15531
   399
  handle FAILURE (alt_state, exn) => (alt_state, SOME exn) | exn => (state, SOME exn);
wenzelm@6689
   400
wenzelm@6689
   401
end;
wenzelm@5828
   402
wenzelm@5828
   403
wenzelm@5828
   404
(* datatype transition *)
wenzelm@5828
   405
wenzelm@5828
   406
datatype transition = Transition of
wenzelm@26621
   407
 {name: string,              (*command name*)
wenzelm@26621
   408
  pos: Position.T,           (*source position*)
wenzelm@26621
   409
  int_only: bool,            (*interactive-only*)
wenzelm@26621
   410
  print: bool,               (*print result state*)
wenzelm@26621
   411
  no_timing: bool,           (*suppress timing*)
wenzelm@26621
   412
  trans: trans list};        (*primitive transitions (union)*)
wenzelm@5828
   413
wenzelm@26621
   414
fun make_transition (name, pos, int_only, print, no_timing, trans) =
wenzelm@26621
   415
  Transition {name = name, pos = pos, int_only = int_only, print = print, no_timing = no_timing,
wenzelm@26621
   416
    trans = trans};
wenzelm@5828
   417
wenzelm@26621
   418
fun map_transition f (Transition {name, pos, int_only, print, no_timing, trans}) =
wenzelm@26621
   419
  make_transition (f (name, pos, int_only, print, no_timing, trans));
wenzelm@5828
   420
wenzelm@27441
   421
val empty = make_transition ("", Position.none, false, false, false, []);
wenzelm@5828
   422
wenzelm@5828
   423
wenzelm@5828
   424
(* diagnostics *)
wenzelm@5828
   425
wenzelm@27441
   426
fun init_of (Transition {trans = [Init (name, _, _)], ...}) = SOME name
wenzelm@27441
   427
  | init_of _ = NONE;
wenzelm@27441
   428
wenzelm@27427
   429
fun name_of (Transition {name, ...}) = name;
wenzelm@28105
   430
fun pos_of (Transition {pos, ...}) = pos;
wenzelm@28105
   431
fun str_of tr = quote (name_of tr) ^ Position.str_of (pos_of tr);
wenzelm@5828
   432
wenzelm@27427
   433
fun command_msg msg tr = msg ^ "command " ^ str_of tr;
wenzelm@5828
   434
fun at_command tr = command_msg "At " tr ^ ".";
wenzelm@5828
   435
wenzelm@5828
   436
fun type_error tr state =
wenzelm@18685
   437
  ERROR (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
wenzelm@5828
   438
wenzelm@5828
   439
wenzelm@5828
   440
(* modify transitions *)
wenzelm@5828
   441
wenzelm@28451
   442
fun name name = map_transition (fn (_, pos, int_only, print, no_timing, trans) =>
wenzelm@28451
   443
  (name, pos, int_only, print, no_timing, trans));
wenzelm@9010
   444
wenzelm@26621
   445
fun position pos = map_transition (fn (name, _, int_only, print, no_timing, trans) =>
wenzelm@26621
   446
  (name, pos, int_only, print, no_timing, trans));
wenzelm@5828
   447
wenzelm@26621
   448
fun interactive int_only = map_transition (fn (name, pos, _, print, no_timing, trans) =>
wenzelm@26621
   449
  (name, pos, int_only, print, no_timing, trans));
wenzelm@14923
   450
wenzelm@26621
   451
val no_timing = map_transition (fn (name, pos, int_only, print, _, trans) =>
wenzelm@26621
   452
  (name, pos, int_only, print, true, trans));
wenzelm@17363
   453
wenzelm@26621
   454
fun add_trans tr = map_transition (fn (name, pos, int_only, print, no_timing, trans) =>
wenzelm@28451
   455
  (name, pos, int_only, print, no_timing, tr :: trans));
wenzelm@16607
   456
wenzelm@28433
   457
val reset_trans = map_transition (fn (name, pos, int_only, print, no_timing, _) =>
wenzelm@28433
   458
  (name, pos, int_only, print, no_timing, []));
wenzelm@28433
   459
wenzelm@28453
   460
fun set_print print = map_transition (fn (name, pos, int_only, _, no_timing, trans) =>
wenzelm@28453
   461
  (name, pos, int_only, print, no_timing, trans));
wenzelm@28453
   462
wenzelm@28453
   463
val print = set_print true;
wenzelm@5828
   464
wenzelm@5828
   465
wenzelm@21007
   466
(* basic transitions *)
wenzelm@5828
   467
wenzelm@27576
   468
fun init_theory name f exit = add_trans (Init (name, f, exit));
wenzelm@6689
   469
val exit = add_trans Exit;
wenzelm@7612
   470
val keep' = add_trans o Keep;
wenzelm@27601
   471
fun transaction f = add_trans (Transaction f);
wenzelm@5828
   472
wenzelm@7612
   473
fun keep f = add_trans (Keep (fn _ => f));
wenzelm@5828
   474
fun imperative f = keep (fn _ => f ());
wenzelm@5828
   475
wenzelm@27840
   476
fun ignored pos = empty |> name "<ignored>" |> position pos |> imperative I;
wenzelm@27840
   477
fun malformed pos msg =
wenzelm@27840
   478
  empty |> name "<malformed>" |> position pos |> imperative (fn () => error msg);
wenzelm@27840
   479
wenzelm@21007
   480
val unknown_theory = imperative (fn () => warning "Unknown theory context");
wenzelm@21007
   481
val unknown_proof = imperative (fn () => warning "Unknown proof context");
wenzelm@21007
   482
val unknown_context = imperative (fn () => warning "Unknown context");
wenzelm@15668
   483
wenzelm@21007
   484
wenzelm@21007
   485
(* theory transitions *)
wenzelm@15668
   486
wenzelm@27601
   487
fun generic_theory f = transaction (fn _ =>
wenzelm@26491
   488
  (fn Theory (gthy, _) => Theory (f gthy, NONE)
wenzelm@26491
   489
    | _ => raise UNDEF));
wenzelm@26491
   490
wenzelm@27601
   491
fun theory' f = transaction (fn int =>
wenzelm@20963
   492
  (fn Theory (Context.Theory thy, _) => Theory (Context.Theory (f int thy), NONE)
wenzelm@20963
   493
    | _ => raise UNDEF));
wenzelm@20963
   494
wenzelm@20963
   495
fun theory f = theory' (K f);
wenzelm@20963
   496
wenzelm@27601
   497
fun begin_local_theory begin f = transaction (fn _ =>
wenzelm@20963
   498
  (fn Theory (Context.Theory thy, _) =>
wenzelm@20963
   499
        let
wenzelm@20985
   500
          val lthy = f thy;
wenzelm@21294
   501
          val gthy = if begin then Context.Proof lthy else Context.Theory (loc_exit lthy);
wenzelm@21294
   502
        in Theory (gthy, SOME lthy) end
wenzelm@20963
   503
    | _ => raise UNDEF));
wenzelm@17076
   504
wenzelm@27601
   505
val end_local_theory = transaction (fn _ =>
wenzelm@21294
   506
  (fn Theory (Context.Proof lthy, _) => Theory (Context.Theory (loc_exit lthy), SOME lthy)
wenzelm@21007
   507
    | _ => raise UNDEF));
wenzelm@21007
   508
wenzelm@21007
   509
local
wenzelm@21007
   510
wenzelm@27601
   511
fun local_theory_presentation loc f g = transaction (fn int =>
wenzelm@21294
   512
  (fn Theory (gthy, _) =>
wenzelm@21294
   513
        let
wenzelm@21294
   514
          val finish = loc_finish loc gthy;
wenzelm@25960
   515
          val lthy' = f (loc_begin loc gthy);
wenzelm@21294
   516
        in Theory (finish lthy', SOME lthy') end
wenzelm@27859
   517
    | _ => raise UNDEF) #> tap g);
wenzelm@15668
   518
wenzelm@21007
   519
in
wenzelm@21007
   520
wenzelm@20963
   521
fun local_theory loc f = local_theory_presentation loc f (K I);
wenzelm@20963
   522
fun present_local_theory loc g = local_theory_presentation loc I g;
wenzelm@18955
   523
wenzelm@21007
   524
end;
wenzelm@21007
   525
wenzelm@21007
   526
wenzelm@21007
   527
(* proof transitions *)
wenzelm@21007
   528
wenzelm@27601
   529
fun end_proof f = transaction (fn int =>
wenzelm@24795
   530
  (fn Proof (prf, (finish, _)) =>
wenzelm@27564
   531
        let val state = ProofNode.current prf in
wenzelm@21007
   532
          if can (Proof.assert_bottom true) state then
wenzelm@21007
   533
            let
wenzelm@21007
   534
              val ctxt' = f int state;
wenzelm@21007
   535
              val gthy' = finish ctxt';
wenzelm@21007
   536
            in Theory (gthy', SOME ctxt') end
wenzelm@21007
   537
          else raise UNDEF
wenzelm@21007
   538
        end
wenzelm@27564
   539
    | SkipProof (0, (gthy, _)) => Theory (gthy, NONE)
wenzelm@21007
   540
    | _ => raise UNDEF));
wenzelm@21007
   541
wenzelm@21294
   542
local
wenzelm@21294
   543
wenzelm@27601
   544
fun begin_proof init finish = transaction (fn int =>
wenzelm@21294
   545
  (fn Theory (gthy, _) =>
wenzelm@21294
   546
    let
berghofe@24453
   547
      val prf = init int gthy;
wenzelm@28433
   548
      val skip = ! skip_proofs;
wenzelm@21294
   549
      val schematic = Proof.schematic_goal prf;
wenzelm@21294
   550
    in
wenzelm@28433
   551
      if skip andalso schematic then
wenzelm@21294
   552
        warning "Cannot skip proof of schematic goal statement"
wenzelm@21294
   553
      else ();
wenzelm@28433
   554
      if skip andalso not schematic then
wenzelm@27564
   555
        SkipProof (0, (finish gthy (Proof.global_skip_proof int prf), gthy))
wenzelm@27564
   556
      else Proof (ProofNode.init prf, (finish gthy, gthy))
wenzelm@21294
   557
    end
wenzelm@21294
   558
  | _ => raise UNDEF));
wenzelm@21294
   559
wenzelm@21294
   560
in
wenzelm@21294
   561
wenzelm@24780
   562
fun local_theory_to_proof' loc f = begin_proof
wenzelm@25960
   563
  (fn int => fn gthy => f int (loc_begin loc gthy))
wenzelm@24780
   564
  (loc_finish loc);
wenzelm@24780
   565
berghofe@24453
   566
fun local_theory_to_proof loc f = local_theory_to_proof' loc (K f);
wenzelm@21294
   567
wenzelm@21294
   568
fun theory_to_proof f = begin_proof
wenzelm@24780
   569
  (K (fn Context.Theory thy => f thy | _ => raise UNDEF))
wenzelm@24780
   570
  (K (Context.Theory o ProofContext.theory_of));
wenzelm@21294
   571
wenzelm@21294
   572
end;
wenzelm@21294
   573
wenzelm@27601
   574
val forget_proof = transaction (fn _ =>
wenzelm@21007
   575
  (fn Proof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@21007
   576
    | SkipProof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@21007
   577
    | _ => raise UNDEF));
wenzelm@21007
   578
wenzelm@27859
   579
fun present_proof f = transaction (fn _ =>
wenzelm@27564
   580
  (fn Proof (prf, x) => Proof (ProofNode.apply I prf, x)
wenzelm@27564
   581
    | skip as SkipProof _ => skip
wenzelm@27859
   582
    | _ => raise UNDEF) #> tap f);
wenzelm@21177
   583
wenzelm@27601
   584
fun proofs' f = transaction (fn int =>
wenzelm@27564
   585
  (fn Proof (prf, x) => Proof (ProofNode.applys (f int) prf, x)
wenzelm@27564
   586
    | skip as SkipProof _ => skip
wenzelm@16815
   587
    | _ => raise UNDEF));
wenzelm@15668
   588
wenzelm@17904
   589
fun proof' f = proofs' (Seq.single oo f);
wenzelm@17904
   590
val proofs = proofs' o K;
wenzelm@6689
   591
val proof = proof' o K;
wenzelm@16815
   592
wenzelm@27601
   593
fun actual_proof f = transaction (fn _ =>
wenzelm@21007
   594
  (fn Proof (prf, x) => Proof (f prf, x)
wenzelm@20963
   595
    | _ => raise UNDEF));
wenzelm@16815
   596
wenzelm@27601
   597
fun skip_proof f = transaction (fn _ =>
wenzelm@21007
   598
  (fn SkipProof (h, x) => SkipProof (f h, x)
wenzelm@18563
   599
    | _ => raise UNDEF));
wenzelm@18563
   600
wenzelm@27601
   601
fun skip_proof_to_theory pred = transaction (fn _ =>
wenzelm@27564
   602
  (fn SkipProof (d, (gthy, _)) => if pred d then Theory (gthy, NONE) else raise UNDEF
wenzelm@17904
   603
  | _ => raise UNDEF));
wenzelm@5828
   604
wenzelm@5828
   605
wenzelm@5828
   606
wenzelm@5828
   607
(** toplevel transactions **)
wenzelm@5828
   608
wenzelm@27427
   609
(* identification *)
wenzelm@27427
   610
wenzelm@27427
   611
fun get_id (Transition {pos, ...}) = Position.get_id pos;
wenzelm@27427
   612
fun put_id id (tr as Transition {pos, ...}) = position (Position.put_id id pos) tr;
wenzelm@27427
   613
wenzelm@27427
   614
wenzelm@25960
   615
(* thread position *)
wenzelm@25799
   616
wenzelm@25960
   617
fun setmp_thread_position (Transition {pos, ...}) f x =
wenzelm@25819
   618
  Position.setmp_thread_data pos f x;
wenzelm@25799
   619
wenzelm@27606
   620
fun status tr m =
wenzelm@27606
   621
  setmp_thread_position tr (fn () => Output.status (Markup.markup m "")) ();
wenzelm@27606
   622
wenzelm@26602
   623
fun error_msg tr exn_info =
wenzelm@26602
   624
  setmp_thread_position tr (fn () => Output.error_msg (exn_message (EXCURSION_FAIL exn_info))) ();
wenzelm@26602
   625
wenzelm@25799
   626
wenzelm@28095
   627
(* post-transition hooks *)
wenzelm@28095
   628
wenzelm@28103
   629
local val hooks = ref ([]: (transition -> state -> state -> unit) list) in
wenzelm@28095
   630
wenzelm@28095
   631
fun add_hook f = CRITICAL (fn () => change hooks (cons f));
wenzelm@28095
   632
fun get_hooks () = CRITICAL (fn () => ! hooks);
wenzelm@28095
   633
wenzelm@28095
   634
end;
wenzelm@28095
   635
wenzelm@28095
   636
wenzelm@5828
   637
(* apply transitions *)
wenzelm@5828
   638
wenzelm@6664
   639
local
wenzelm@6664
   640
wenzelm@25799
   641
fun app int (tr as Transition {trans, pos, int_only, print, no_timing, ...}) =
wenzelm@25819
   642
  setmp_thread_position tr (fn state =>
wenzelm@25799
   643
    let
wenzelm@26621
   644
      val _ = if not int andalso int_only then warning (command_msg "Interactive-only " tr) else ();
wenzelm@16682
   645
wenzelm@25799
   646
      fun do_timing f x = (warning (command_msg "" tr); timeap f x);
wenzelm@25799
   647
      fun do_profiling f x = profile (! profiling) f x;
wenzelm@25799
   648
wenzelm@26256
   649
      val (result, status) =
wenzelm@25799
   650
         state |> (apply_trans int pos trans
wenzelm@25799
   651
          |> (if ! profiling > 0 andalso not no_timing then do_profiling else I)
wenzelm@25799
   652
          |> (if ! profiling > 0 orelse ! timing andalso not no_timing then do_timing else I));
wenzelm@26256
   653
wenzelm@26621
   654
      val _ = if int andalso not (! quiet) andalso print then print_state false result else ();
wenzelm@26256
   655
    in (result, Option.map (fn UNDEF => type_error tr state | exn => exn) status) end);
wenzelm@6664
   656
wenzelm@6664
   657
in
wenzelm@5828
   658
wenzelm@26602
   659
fun transition int tr st =
wenzelm@28095
   660
  let
wenzelm@28095
   661
    val hooks = get_hooks ();
wenzelm@28103
   662
    fun apply_hooks st' = hooks |> List.app (fn f => (try (fn () => f tr st st') (); ()));
wenzelm@28095
   663
wenzelm@28095
   664
    val ctxt = try context_of st;
wenzelm@28095
   665
    val res =
wenzelm@28095
   666
      (case app int tr st of
wenzelm@28095
   667
        (_, SOME TERMINATE) => NONE
wenzelm@28103
   668
      | (st', SOME (EXCURSION_FAIL exn_info)) => SOME (st', SOME exn_info)
wenzelm@28103
   669
      | (st', SOME exn) => SOME (st', SOME (exn_context ctxt exn, at_command tr))
wenzelm@28103
   670
      | (st', NONE) => SOME (st', NONE));
wenzelm@28103
   671
    val _ = (case res of SOME (st', NONE) => apply_hooks st' | _ => ());
wenzelm@28095
   672
  in res end;
wenzelm@6664
   673
wenzelm@6664
   674
end;
wenzelm@5828
   675
wenzelm@5828
   676
wenzelm@27601
   677
(* commit final exit *)
wenzelm@27601
   678
wenzelm@28425
   679
fun commit_exit pos =
wenzelm@27601
   680
  name "end" empty
wenzelm@28425
   681
  |> position pos
wenzelm@27601
   682
  |> add_trans CommitExit
wenzelm@27601
   683
  |> imperative (fn () => warning "Expected to find finished theory");
wenzelm@27601
   684
wenzelm@27601
   685
wenzelm@28425
   686
(* nested commands *)
wenzelm@5828
   687
wenzelm@28425
   688
fun command tr st =
wenzelm@27576
   689
  (case transition (! interact) tr st of
wenzelm@28425
   690
    SOME (st', NONE) => st'
wenzelm@28425
   691
  | SOME (_, SOME exn_info) => raise EXCURSION_FAIL exn_info
wenzelm@27576
   692
  | NONE => raise EXCURSION_FAIL (TERMINATE, at_command tr));
wenzelm@27576
   693
wenzelm@28433
   694
wenzelm@28433
   695
(* excursion of units, consisting of commands with proof *)
wenzelm@28433
   696
wenzelm@28974
   697
structure States = ProofDataFun
wenzelm@28974
   698
(
wenzelm@28974
   699
  type T = state list future option;
wenzelm@28974
   700
  fun init _ = NONE;
wenzelm@28974
   701
);
wenzelm@28974
   702
wenzelm@28425
   703
fun command_result tr st =
wenzelm@28425
   704
  let val st' = command tr st
wenzelm@28425
   705
  in (st', st') end;
wenzelm@17076
   706
wenzelm@28974
   707
fun proof_result immediate (tr, proof_trs) st =
wenzelm@28433
   708
  let val st' = command tr st in
wenzelm@28453
   709
    if immediate orelse null proof_trs orelse
wenzelm@28453
   710
      not (can proof_of st') orelse Proof.is_relevant (proof_of st')
wenzelm@28433
   711
    then
wenzelm@28453
   712
      let val (states, st'') = fold_map command_result proof_trs st'
wenzelm@28974
   713
      in (Lazy.value ((tr, st') :: (proof_trs ~~ states)), st'') end
wenzelm@28453
   714
    else
wenzelm@28433
   715
      let
wenzelm@28433
   716
        val (body_trs, end_tr) = split_last proof_trs;
wenzelm@28453
   717
        val finish = Context.Theory o ProofContext.theory_of;
wenzelm@28974
   718
wenzelm@28974
   719
        val future_proof = Proof.future_proof
wenzelm@28974
   720
          (fn prf =>
wenzelm@28974
   721
            Future.fork_background (fn () =>
wenzelm@28974
   722
              let val (states, State (result_node, _)) =
wenzelm@28974
   723
                (case st' of State (SOME (Proof (_, (_, orig_gthy)), exit), prev)
wenzelm@28974
   724
                  => State (SOME (Proof (ProofNode.init prf, (finish, orig_gthy)), exit), prev))
wenzelm@28974
   725
                |> fold_map command_result body_trs
wenzelm@28974
   726
                ||> command (end_tr |> set_print false);
wenzelm@28974
   727
              in (states, presentation_context (Option.map #1 result_node) NONE) end))
wenzelm@28974
   728
          #> (fn (states, ctxt) => States.put (SOME states) ctxt);
wenzelm@28974
   729
wenzelm@28974
   730
        val st'' = st' |> command (end_tr |> reset_trans |> end_proof (K future_proof));
wenzelm@28974
   731
wenzelm@28974
   732
        val states =
wenzelm@28974
   733
          (case States.get (presentation_context (SOME (node_of st'')) NONE) of
wenzelm@28974
   734
            NONE => sys_error ("No future states for " ^ name_of tr ^ Position.str_of (pos_of tr))
wenzelm@28974
   735
          | SOME states => states);
wenzelm@28974
   736
        val result = Lazy.lazy
wenzelm@28974
   737
          (fn () => (tr, st') :: (body_trs ~~ Future.join states) @ [(end_tr, st'')]);
wenzelm@28974
   738
wenzelm@28974
   739
      in (result, st'') end
wenzelm@28433
   740
  end;
wenzelm@28433
   741
wenzelm@29068
   742
fun excursion input =
wenzelm@28425
   743
  let
wenzelm@28433
   744
    val end_pos = if null input then error "No input" else pos_of (fst (List.last input));
wenzelm@28433
   745
wenzelm@28645
   746
    val immediate = not (Future.enabled ());
wenzelm@28974
   747
    val (future_results, end_state) = fold_map (proof_result immediate) input toplevel;
wenzelm@28433
   748
    val _ =
wenzelm@28433
   749
      (case end_state of
wenzelm@28999
   750
        State (NONE, SOME (Theory (Context.Theory _, _), _)) => ()
wenzelm@28433
   751
      | _ => error "Unfinished development at end of input");
wenzelm@28974
   752
    val results = maps Lazy.force future_results;
wenzelm@29068
   753
  in (results, fn () => ignore (command (commit_exit end_pos) end_state)) end;
wenzelm@7062
   754
wenzelm@6664
   755
end;