src/Pure/Isar/toplevel.ML
author wenzelm
Mon Mar 24 12:00:17 2014 +0100 (2014-03-24 ago)
changeset 56265 785569927666
parent 56147 9589605bcf41
child 56303 4cc3f4db3447
permissions -rw-r--r--
discontinued Toplevel.debug in favour of system option "exception_trace";
wenzelm@5828
     1
(*  Title:      Pure/Isar/toplevel.ML
wenzelm@5828
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5828
     3
wenzelm@26602
     4
Isabelle/Isar toplevel transactions.
wenzelm@5828
     5
*)
wenzelm@5828
     6
wenzelm@5828
     7
signature TOPLEVEL =
wenzelm@5828
     8
sig
wenzelm@19063
     9
  exception UNDEF
wenzelm@5828
    10
  type state
wenzelm@26602
    11
  val toplevel: state
wenzelm@7732
    12
  val is_toplevel: state -> bool
wenzelm@18589
    13
  val is_theory: state -> bool
wenzelm@18589
    14
  val is_proof: state -> bool
wenzelm@51555
    15
  val is_skipped_proof: state -> bool
wenzelm@17076
    16
  val level: state -> int
wenzelm@30398
    17
  val presentation_context_of: state -> Proof.context
wenzelm@30801
    18
  val previous_context_of: state -> Proof.context option
wenzelm@21506
    19
  val context_of: state -> Proof.context
wenzelm@22089
    20
  val generic_theory_of: state -> generic_theory
wenzelm@5828
    21
  val theory_of: state -> theory
wenzelm@5828
    22
  val proof_of: state -> Proof.state
wenzelm@18589
    23
  val proof_position_of: state -> int
wenzelm@37953
    24
  val end_theory: Position.T -> state -> theory
wenzelm@16815
    25
  val print_state_context: state -> unit
wenzelm@16815
    26
  val print_state: bool -> state -> unit
wenzelm@37858
    27
  val pretty_abstract: state -> Pretty.T
wenzelm@32738
    28
  val quiet: bool Unsynchronized.ref
wenzelm@32738
    29
  val interact: bool Unsynchronized.ref
wenzelm@32738
    30
  val timing: bool Unsynchronized.ref
wenzelm@32738
    31
  val profiling: int Unsynchronized.ref
wenzelm@56265
    32
  val debugging: Context.generic option -> ('a -> 'b) -> 'a -> 'b
wenzelm@56265
    33
  val controlled_execution: Context.generic option -> ('a -> 'b) -> 'a -> 'b
wenzelm@20128
    34
  val program: (unit -> 'a) -> 'a
wenzelm@33604
    35
  val thread: bool -> (unit -> unit) -> Thread.thread
wenzelm@16682
    36
  type transition
wenzelm@5828
    37
  val empty: transition
wenzelm@38888
    38
  val print_of: transition -> bool
wenzelm@27427
    39
  val name_of: transition -> string
wenzelm@28105
    40
  val pos_of: transition -> Position.T
wenzelm@5828
    41
  val name: string -> transition -> transition
wenzelm@5828
    42
  val position: Position.T -> transition -> transition
wenzelm@5828
    43
  val interactive: bool -> transition -> transition
wenzelm@38888
    44
  val set_print: bool -> transition -> transition
wenzelm@5828
    45
  val print: transition -> transition
wenzelm@44187
    46
  val init_theory: (unit -> theory) -> transition -> transition
wenzelm@44187
    47
  val is_init: transition -> bool
wenzelm@44186
    48
  val modify_init: (unit -> theory) -> transition -> transition
wenzelm@6689
    49
  val exit: transition -> transition
wenzelm@5828
    50
  val keep: (state -> unit) -> transition -> transition
wenzelm@7612
    51
  val keep': (bool -> state -> unit) -> transition -> transition
wenzelm@5828
    52
  val imperative: (unit -> unit) -> transition -> transition
wenzelm@27840
    53
  val ignored: Position.T -> transition
wenzelm@51268
    54
  val is_ignored: transition -> bool
wenzelm@27840
    55
  val malformed: Position.T -> string -> transition
wenzelm@48772
    56
  val is_malformed: transition -> bool
wenzelm@26491
    57
  val generic_theory: (generic_theory -> generic_theory) -> transition -> transition
wenzelm@7612
    58
  val theory': (bool -> theory -> theory) -> transition -> transition
wenzelm@49012
    59
  val theory: (theory -> theory) -> transition -> transition
wenzelm@20985
    60
  val begin_local_theory: bool -> (theory -> local_theory) -> transition -> transition
wenzelm@21007
    61
  val end_local_theory: transition -> transition
wenzelm@47069
    62
  val open_target: (generic_theory -> local_theory) -> transition -> transition
wenzelm@47069
    63
  val close_target: transition -> transition
wenzelm@45488
    64
  val local_theory': (xstring * Position.T) option -> (bool -> local_theory -> local_theory) ->
wenzelm@45488
    65
    transition -> transition
wenzelm@45488
    66
  val local_theory: (xstring * Position.T) option -> (local_theory -> local_theory) ->
wenzelm@29380
    67
    transition -> transition
wenzelm@45488
    68
  val present_local_theory: (xstring * Position.T) option -> (state -> unit) ->
berghofe@24453
    69
    transition -> transition
wenzelm@45488
    70
  val local_theory_to_proof': (xstring * Position.T) option ->
wenzelm@45488
    71
    (bool -> local_theory -> Proof.state) -> transition -> transition
wenzelm@45488
    72
  val local_theory_to_proof: (xstring * Position.T) option ->
wenzelm@45488
    73
    (local_theory -> Proof.state) -> transition -> transition
wenzelm@17363
    74
  val theory_to_proof: (theory -> Proof.state) -> transition -> transition
wenzelm@21007
    75
  val end_proof: (bool -> Proof.state -> Proof.context) -> transition -> transition
wenzelm@21007
    76
  val forget_proof: transition -> transition
wenzelm@30366
    77
  val present_proof: (state -> unit) -> transition -> transition
wenzelm@49863
    78
  val proofs': (bool -> Proof.state -> Proof.state Seq.result Seq.seq) -> transition -> transition
wenzelm@17904
    79
  val proof': (bool -> Proof.state -> Proof.state) -> transition -> transition
wenzelm@49863
    80
  val proofs: (Proof.state -> Proof.state Seq.result Seq.seq) -> transition -> transition
wenzelm@21177
    81
  val proof: (Proof.state -> Proof.state) -> transition -> transition
wenzelm@33390
    82
  val actual_proof: (Proof_Node.T -> Proof_Node.T) -> transition -> transition
wenzelm@27564
    83
  val skip_proof: (int -> int) -> transition -> transition
wenzelm@17904
    84
  val skip_proof_to_theory: (int -> bool) -> transition -> transition
wenzelm@52536
    85
  val exec_id: Document_ID.exec -> transition -> transition
wenzelm@9512
    86
  val unknown_theory: transition -> transition
wenzelm@9512
    87
  val unknown_proof: transition -> transition
wenzelm@9512
    88
  val unknown_context: transition -> transition
wenzelm@28425
    89
  val setmp_thread_position: transition -> ('a -> 'b) -> 'a -> 'b
wenzelm@28103
    90
  val add_hook: (transition -> state -> state -> unit) -> unit
wenzelm@51423
    91
  val get_timing: transition -> Time.time option
wenzelm@51423
    92
  val put_timing: Time.time option -> transition -> transition
wenzelm@26602
    93
  val transition: bool -> transition -> state -> (state * (exn * string) option) option
wenzelm@51323
    94
  val command_errors: bool -> transition -> state -> Runtime.error list * state option
wenzelm@51284
    95
  val command_exception: bool -> transition -> state -> state
wenzelm@51332
    96
  type result
wenzelm@51332
    97
  val join_results: result -> (transition * state) list
wenzelm@51332
    98
  val element_result: transition Thy_Syntax.element -> state -> result * state
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@31476
   106
exception UNDEF = Runtime.UNDEF;
wenzelm@19063
   107
wenzelm@19063
   108
wenzelm@21294
   109
(* local theory wrappers *)
wenzelm@5828
   110
haftmann@38350
   111
val loc_init = Named_Target.context_cmd;
haftmann@52118
   112
val loc_exit = Local_Theory.assert_bottom true #> Local_Theory.exit_global;
wenzelm@21294
   113
wenzelm@47274
   114
fun loc_begin loc (Context.Theory thy) =
wenzelm@47274
   115
      (Context.Theory o loc_exit, loc_init (the_default ("-", Position.none) loc) thy)
wenzelm@47274
   116
  | loc_begin NONE (Context.Proof lthy) =
wenzelm@47274
   117
      (Context.Proof o Local_Theory.restore, lthy)
wenzelm@47274
   118
  | loc_begin (SOME loc) (Context.Proof lthy) =
wenzelm@55446
   119
      (Context.Proof o Named_Target.reinit lthy,
wenzelm@55446
   120
        loc_init loc (loc_exit (Local_Theory.assert_nonbrittle lthy)));
wenzelm@21294
   121
wenzelm@21294
   122
wenzelm@21958
   123
(* datatype node *)
wenzelm@21294
   124
wenzelm@5828
   125
datatype node =
wenzelm@27576
   126
  Theory of generic_theory * Proof.context option
wenzelm@27576
   127
    (*theory with presentation context*) |
wenzelm@33390
   128
  Proof of Proof_Node.T * ((Proof.context -> generic_theory) * generic_theory)
wenzelm@27576
   129
    (*proof node, finish, original theory*) |
wenzelm@51555
   130
  Skipped_Proof of int * (generic_theory * generic_theory);
wenzelm@27564
   131
    (*proof depth, resulting theory, original theory*)
wenzelm@5828
   132
wenzelm@20963
   133
val theory_node = fn Theory (gthy, _) => SOME gthy | _ => NONE;
wenzelm@18589
   134
val proof_node = fn Proof (prf, _) => SOME prf | _ => NONE;
wenzelm@51555
   135
val skipped_proof_node = fn Skipped_Proof _ => true | _ => false;
wenzelm@18589
   136
wenzelm@20963
   137
fun cases_node f _ (Theory (gthy, _)) = f gthy
wenzelm@33390
   138
  | cases_node _ g (Proof (prf, _)) = g (Proof_Node.current prf)
wenzelm@51555
   139
  | cases_node f _ (Skipped_Proof (_, (gthy, _))) = f gthy;
wenzelm@19063
   140
wenzelm@29066
   141
val context_node = cases_node Context.proof_of Proof.context_of;
wenzelm@29066
   142
wenzelm@21958
   143
wenzelm@21958
   144
(* datatype state *)
wenzelm@21958
   145
wenzelm@37953
   146
datatype state = State of node option * node option;  (*current, previous*)
wenzelm@5828
   147
wenzelm@27576
   148
val toplevel = State (NONE, NONE);
wenzelm@5828
   149
wenzelm@27576
   150
fun is_toplevel (State (NONE, _)) = true
wenzelm@7732
   151
  | is_toplevel _ = false;
wenzelm@7732
   152
wenzelm@27576
   153
fun level (State (NONE, _)) = 0
wenzelm@37953
   154
  | level (State (SOME (Theory _), _)) = 0
wenzelm@37953
   155
  | level (State (SOME (Proof (prf, _)), _)) = Proof.level (Proof_Node.current prf)
wenzelm@51555
   156
  | level (State (SOME (Skipped_Proof (d, _)), _)) = d + 1;   (*different notion of proof depth!*)
wenzelm@17076
   157
wenzelm@52565
   158
fun str_of_state (State (NONE, SOME (Theory (Context.Theory thy, _)))) =
wenzelm@52565
   159
      "at top level, result theory " ^ quote (Context.theory_name thy)
wenzelm@52565
   160
  | str_of_state (State (NONE, _)) = "at top level"
wenzelm@37953
   161
  | str_of_state (State (SOME (Theory (Context.Theory _, _)), _)) = "in theory mode"
wenzelm@37953
   162
  | str_of_state (State (SOME (Theory (Context.Proof _, _)), _)) = "in local theory mode"
wenzelm@37953
   163
  | str_of_state (State (SOME (Proof _), _)) = "in proof mode"
wenzelm@51555
   164
  | str_of_state (State (SOME (Skipped_Proof _), _)) = "in skipped proof mode";
wenzelm@5946
   165
wenzelm@5946
   166
wenzelm@27576
   167
(* current node *)
wenzelm@5828
   168
wenzelm@27576
   169
fun node_of (State (NONE, _)) = raise UNDEF
wenzelm@37953
   170
  | node_of (State (SOME node, _)) = node;
wenzelm@5828
   171
wenzelm@18589
   172
fun is_theory state = not (is_toplevel state) andalso is_some (theory_node (node_of state));
wenzelm@18589
   173
fun is_proof state = not (is_toplevel state) andalso is_some (proof_node (node_of state));
wenzelm@51555
   174
fun is_skipped_proof state = not (is_toplevel state) andalso skipped_proof_node (node_of state);
wenzelm@18589
   175
wenzelm@19063
   176
fun node_case f g state = cases_node f g (node_of state);
wenzelm@5828
   177
wenzelm@30398
   178
fun presentation_context_of state =
wenzelm@30398
   179
  (case try node_of state of
wenzelm@30398
   180
    SOME (Theory (_, SOME ctxt)) => ctxt
wenzelm@30398
   181
  | SOME node => context_node node
wenzelm@30398
   182
  | NONE => raise UNDEF);
wenzelm@30366
   183
wenzelm@30801
   184
fun previous_context_of (State (_, NONE)) = NONE
wenzelm@37953
   185
  | previous_context_of (State (_, SOME prev)) = SOME (context_node prev);
wenzelm@30801
   186
wenzelm@21506
   187
val context_of = node_case Context.proof_of Proof.context_of;
wenzelm@22089
   188
val generic_theory_of = node_case I (Context.Proof o Proof.context_of);
wenzelm@20963
   189
val theory_of = node_case Context.theory_of Proof.theory_of;
wenzelm@18589
   190
val proof_of = node_case (fn _ => raise UNDEF) I;
wenzelm@17208
   191
wenzelm@18589
   192
fun proof_position_of state =
wenzelm@18589
   193
  (case node_of state of
wenzelm@33390
   194
    Proof (prf, _) => Proof_Node.position prf
wenzelm@18589
   195
  | _ => raise UNDEF);
wenzelm@6664
   196
wenzelm@43667
   197
fun end_theory _ (State (NONE, SOME (Theory (Context.Theory thy, _)))) = thy
wenzelm@48992
   198
  | end_theory pos (State (NONE, _)) = error ("Bad theory" ^ Position.here pos)
wenzelm@48992
   199
  | end_theory pos (State (SOME _, _)) = error ("Unfinished theory" ^ Position.here pos);
wenzelm@37953
   200
wenzelm@5828
   201
wenzelm@16815
   202
(* print state *)
wenzelm@16815
   203
haftmann@38388
   204
val pretty_context = Local_Theory.pretty o Context.cases (Named_Target.theory_init) I;
wenzelm@16815
   205
wenzelm@23640
   206
fun print_state_context state =
wenzelm@24795
   207
  (case try node_of state of
wenzelm@21506
   208
    NONE => []
wenzelm@24795
   209
  | SOME (Theory (gthy, _)) => pretty_context gthy
wenzelm@24795
   210
  | SOME (Proof (_, (_, gthy))) => pretty_context gthy
wenzelm@51555
   211
  | SOME (Skipped_Proof (_, (gthy, _))) => pretty_context gthy)
wenzelm@23640
   212
  |> Pretty.chunks |> Pretty.writeln;
wenzelm@16815
   213
wenzelm@23640
   214
fun print_state prf_only state =
wenzelm@23701
   215
  (case try node_of state of
wenzelm@23701
   216
    NONE => []
wenzelm@23701
   217
  | SOME (Theory (gthy, _)) => if prf_only then [] else pretty_context gthy
wenzelm@23701
   218
  | SOME (Proof (prf, _)) =>
wenzelm@33390
   219
      Proof.pretty_state (Proof_Node.position prf) (Proof_Node.current prf)
wenzelm@51555
   220
  | SOME (Skipped_Proof (d, _)) => [Pretty.str ("skipped proof: depth " ^ string_of_int d)])
wenzelm@50201
   221
  |> Pretty.markup_chunks Markup.state |> Pretty.writeln;
wenzelm@16815
   222
wenzelm@37858
   223
fun pretty_abstract state = Pretty.str ("<Isar " ^ str_of_state state ^ ">");
wenzelm@37858
   224
wenzelm@16815
   225
wenzelm@15668
   226
wenzelm@5828
   227
(** toplevel transitions **)
wenzelm@5828
   228
wenzelm@53403
   229
val quiet = Unsynchronized.ref false;  (*Proof General legacy*)
wenzelm@53403
   230
val interact = Unsynchronized.ref false;  (*Proof General legacy*)
wenzelm@53403
   231
val timing = Unsynchronized.ref false;  (*Proof General legacy*)
wenzelm@32738
   232
val profiling = Unsynchronized.ref 0;
wenzelm@16682
   233
wenzelm@53709
   234
wenzelm@53709
   235
(* controlled execution *)
wenzelm@53709
   236
wenzelm@56265
   237
fun debugging arg = Runtime.debugging ML_Compiler.exn_message arg;
wenzelm@56265
   238
fun controlled_execution arg = Runtime.controlled_execution ML_Compiler.exn_message arg;
wenzelm@53709
   239
wenzelm@33604
   240
fun program body =
wenzelm@33604
   241
 (body
wenzelm@56265
   242
  |> controlled_execution NONE
wenzelm@54387
   243
  |> Runtime.toplevel_error ML_Compiler.exn_error_message) ();
wenzelm@33604
   244
wenzelm@33604
   245
fun thread interrupts body =
wenzelm@33604
   246
  Thread.fork
wenzelm@39232
   247
    (((fn () => body () handle exn => if Exn.is_interrupt exn then () else reraise exn)
wenzelm@56265
   248
        |> debugging NONE
wenzelm@33604
   249
        |> Runtime.toplevel_error
wenzelm@40132
   250
          (fn exn =>
wenzelm@40132
   251
            Output.urgent_message ("## INTERNAL ERROR ##\n" ^ ML_Compiler.exn_message exn))),
wenzelm@37216
   252
      Simple_Thread.attributes interrupts);
wenzelm@20128
   253
wenzelm@5828
   254
wenzelm@27601
   255
(* node transactions -- maintaining stable checkpoints *)
wenzelm@7022
   256
wenzelm@31476
   257
exception FAILURE of state * exn;
wenzelm@31476
   258
wenzelm@6689
   259
local
wenzelm@6689
   260
wenzelm@30366
   261
fun reset_presentation (Theory (gthy, _)) = Theory (gthy, NONE)
wenzelm@30366
   262
  | reset_presentation node = node;
wenzelm@30366
   263
wenzelm@27576
   264
fun map_theory f (Theory (gthy, ctxt)) =
wenzelm@33671
   265
      Theory (Context.mapping f (Local_Theory.raw_theory f) gthy, ctxt)
wenzelm@27576
   266
  | map_theory _ node = node;
wenzelm@6689
   267
wenzelm@6689
   268
in
wenzelm@6689
   269
wenzelm@37953
   270
fun apply_transaction f g node =
wenzelm@20128
   271
  let
wenzelm@27576
   272
    val cont_node = reset_presentation node;
wenzelm@56265
   273
    val context = cases_node I (Context.Proof o Proof.context_of) cont_node;
wenzelm@37953
   274
    fun state_error e nd = (State (SOME nd, SOME node), e);
wenzelm@6689
   275
wenzelm@20128
   276
    val (result, err) =
wenzelm@20128
   277
      cont_node
wenzelm@56265
   278
      |> controlled_execution (SOME context) f
wenzelm@26624
   279
      |> state_error NONE
wenzelm@26624
   280
      handle exn => state_error (SOME exn) cont_node;
wenzelm@20128
   281
  in
wenzelm@52696
   282
    (case err of
wenzelm@52696
   283
      NONE => tap g result
wenzelm@52696
   284
    | SOME exn => raise FAILURE (result, exn))
wenzelm@20128
   285
  end;
wenzelm@6689
   286
wenzelm@43667
   287
val exit_transaction =
wenzelm@43667
   288
  apply_transaction
wenzelm@43667
   289
    (fn Theory (Context.Theory thy, _) => Theory (Context.Theory (Theory.end_theory thy), NONE)
wenzelm@43667
   290
      | node => node) (K ())
wenzelm@43667
   291
  #> (fn State (node', _) => State (NONE, node'));
wenzelm@43667
   292
wenzelm@6689
   293
end;
wenzelm@6689
   294
wenzelm@6689
   295
wenzelm@6689
   296
(* primitive transitions *)
wenzelm@6689
   297
wenzelm@5828
   298
datatype trans =
wenzelm@44187
   299
  Init of unit -> theory |               (*init theory*)
wenzelm@37953
   300
  Exit |                                 (*formal exit of theory*)
wenzelm@37953
   301
  Keep of bool -> state -> unit |        (*peek at state*)
wenzelm@30366
   302
  Transaction of (bool -> node -> node) * (state -> unit);  (*node transaction and presentation*)
wenzelm@21958
   303
wenzelm@6689
   304
local
wenzelm@5828
   305
wenzelm@44187
   306
fun apply_tr _ (Init f) (State (NONE, _)) =
wenzelm@56265
   307
      State (SOME (Theory (Context.Theory (controlled_execution NONE f ()), NONE)), NONE)
wenzelm@43667
   308
  | apply_tr _ Exit (State (SOME (state as Theory (Context.Theory _, _)), _)) =
wenzelm@43667
   309
      exit_transaction state
wenzelm@32792
   310
  | apply_tr int (Keep f) state =
wenzelm@56265
   311
      controlled_execution (try generic_theory_of state) (fn x => tap (f int) x) state
wenzelm@32792
   312
  | apply_tr int (Transaction (f, g)) (State (SOME state, _)) =
wenzelm@32792
   313
      apply_transaction (fn x => f int x) g state
wenzelm@32792
   314
  | apply_tr _ _ _ = raise UNDEF;
wenzelm@5828
   315
wenzelm@32792
   316
fun apply_union _ [] state = raise FAILURE (state, UNDEF)
wenzelm@32792
   317
  | apply_union int (tr :: trs) state =
wenzelm@32792
   318
      apply_union int trs state
wenzelm@32792
   319
        handle Runtime.UNDEF => apply_tr int tr state
wenzelm@32792
   320
          | FAILURE (alt_state, UNDEF) => apply_tr int tr alt_state
wenzelm@6689
   321
          | exn as FAILURE _ => raise exn
wenzelm@6689
   322
          | exn => raise FAILURE (state, exn);
wenzelm@6689
   323
wenzelm@6689
   324
in
wenzelm@6689
   325
wenzelm@32792
   326
fun apply_trans int trs state = (apply_union int trs state, NONE)
skalberg@15531
   327
  handle FAILURE (alt_state, exn) => (alt_state, SOME exn) | exn => (state, SOME exn);
wenzelm@6689
   328
wenzelm@6689
   329
end;
wenzelm@5828
   330
wenzelm@5828
   331
wenzelm@5828
   332
(* datatype transition *)
wenzelm@5828
   333
wenzelm@5828
   334
datatype transition = Transition of
wenzelm@26621
   335
 {name: string,              (*command name*)
wenzelm@26621
   336
  pos: Position.T,           (*source position*)
wenzelm@53403
   337
  int_only: bool,            (*interactive-only*)  (* TTY / Proof General legacy*)
wenzelm@26621
   338
  print: bool,               (*print result state*)
wenzelm@51423
   339
  timing: Time.time option,  (*prescient timing information*)
wenzelm@26621
   340
  trans: trans list};        (*primitive transitions (union)*)
wenzelm@5828
   341
wenzelm@51658
   342
fun make_transition (name, pos, int_only, print, timing, trans) =
wenzelm@51217
   343
  Transition {name = name, pos = pos, int_only = int_only, print = print,
wenzelm@51658
   344
    timing = timing, trans = trans};
wenzelm@5828
   345
wenzelm@51658
   346
fun map_transition f (Transition {name, pos, int_only, print, timing, trans}) =
wenzelm@51658
   347
  make_transition (f (name, pos, int_only, print, timing, trans));
wenzelm@5828
   348
wenzelm@51658
   349
val empty = make_transition ("", Position.none, false, false, NONE, []);
wenzelm@5828
   350
wenzelm@5828
   351
wenzelm@5828
   352
(* diagnostics *)
wenzelm@5828
   353
wenzelm@38888
   354
fun print_of (Transition {print, ...}) = print;
wenzelm@27427
   355
fun name_of (Transition {name, ...}) = name;
wenzelm@28105
   356
fun pos_of (Transition {pos, ...}) = pos;
wenzelm@5828
   357
wenzelm@48993
   358
fun command_msg msg tr = msg ^ "command " ^ quote (name_of tr) ^ Position.here (pos_of tr);
wenzelm@38875
   359
fun at_command tr = command_msg "At " tr;
wenzelm@5828
   360
wenzelm@5828
   361
fun type_error tr state =
wenzelm@18685
   362
  ERROR (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
wenzelm@5828
   363
wenzelm@5828
   364
wenzelm@5828
   365
(* modify transitions *)
wenzelm@5828
   366
wenzelm@51658
   367
fun name name = map_transition (fn (_, pos, int_only, print, timing, trans) =>
wenzelm@51658
   368
  (name, pos, int_only, print, timing, trans));
wenzelm@9010
   369
wenzelm@51658
   370
fun position pos = map_transition (fn (name, _, int_only, print, timing, trans) =>
wenzelm@51658
   371
  (name, pos, int_only, print, timing, trans));
wenzelm@5828
   372
wenzelm@51658
   373
fun interactive int_only = map_transition (fn (name, pos, _, print, timing, trans) =>
wenzelm@51658
   374
  (name, pos, int_only, print, timing, trans));
wenzelm@14923
   375
wenzelm@51658
   376
fun add_trans tr = map_transition (fn (name, pos, int_only, print, timing, trans) =>
wenzelm@51658
   377
  (name, pos, int_only, print, timing, tr :: trans));
wenzelm@16607
   378
wenzelm@51658
   379
val reset_trans = map_transition (fn (name, pos, int_only, print, timing, _) =>
wenzelm@51658
   380
  (name, pos, int_only, print, timing, []));
wenzelm@28433
   381
wenzelm@51658
   382
fun set_print print = map_transition (fn (name, pos, int_only, _, timing, trans) =>
wenzelm@51658
   383
  (name, pos, int_only, print, timing, trans));
wenzelm@28453
   384
wenzelm@28453
   385
val print = set_print true;
wenzelm@5828
   386
wenzelm@5828
   387
wenzelm@21007
   388
(* basic transitions *)
wenzelm@5828
   389
wenzelm@44187
   390
fun init_theory f = add_trans (Init f);
wenzelm@37977
   391
wenzelm@44187
   392
fun is_init (Transition {trans = [Init _], ...}) = true
wenzelm@44187
   393
  | is_init _ = false;
wenzelm@44187
   394
wenzelm@44187
   395
fun modify_init f tr = if is_init tr then init_theory f (reset_trans tr) else tr;
wenzelm@37977
   396
wenzelm@6689
   397
val exit = add_trans Exit;
wenzelm@7612
   398
val keep' = add_trans o Keep;
wenzelm@30366
   399
wenzelm@30366
   400
fun present_transaction f g = add_trans (Transaction (f, g));
wenzelm@30366
   401
fun transaction f = present_transaction f (K ());
wenzelm@5828
   402
wenzelm@7612
   403
fun keep f = add_trans (Keep (fn _ => f));
wenzelm@5828
   404
fun imperative f = keep (fn _ => f ());
wenzelm@5828
   405
wenzelm@27840
   406
fun ignored pos = empty |> name "<ignored>" |> position pos |> imperative I;
wenzelm@51268
   407
fun is_ignored tr = name_of tr = "<ignored>";
wenzelm@48772
   408
wenzelm@48772
   409
val malformed_name = "<malformed>";
wenzelm@27840
   410
fun malformed pos msg =
wenzelm@48772
   411
  empty |> name malformed_name |> position pos |> imperative (fn () => error msg);
wenzelm@48772
   412
fun is_malformed tr = name_of tr = malformed_name;
wenzelm@27840
   413
wenzelm@21007
   414
val unknown_theory = imperative (fn () => warning "Unknown theory context");
wenzelm@21007
   415
val unknown_proof = imperative (fn () => warning "Unknown proof context");
wenzelm@21007
   416
val unknown_context = imperative (fn () => warning "Unknown context");
wenzelm@15668
   417
wenzelm@21007
   418
wenzelm@49012
   419
(* theory transitions *)
wenzelm@44304
   420
wenzelm@27601
   421
fun generic_theory f = transaction (fn _ =>
wenzelm@26491
   422
  (fn Theory (gthy, _) => Theory (f gthy, NONE)
wenzelm@26491
   423
    | _ => raise UNDEF));
wenzelm@26491
   424
wenzelm@27601
   425
fun theory' f = transaction (fn int =>
wenzelm@33725
   426
  (fn Theory (Context.Theory thy, _) =>
wenzelm@33725
   427
      let val thy' = thy
wenzelm@49012
   428
        |> Sign.new_group
wenzelm@33725
   429
        |> f int
wenzelm@33725
   430
        |> Sign.reset_group;
wenzelm@33725
   431
      in Theory (Context.Theory thy', NONE) end
wenzelm@20963
   432
    | _ => raise UNDEF));
wenzelm@20963
   433
wenzelm@20963
   434
fun theory f = theory' (K f);
wenzelm@20963
   435
wenzelm@27601
   436
fun begin_local_theory begin f = transaction (fn _ =>
wenzelm@20963
   437
  (fn Theory (Context.Theory thy, _) =>
wenzelm@20963
   438
        let
wenzelm@20985
   439
          val lthy = f thy;
wenzelm@21294
   440
          val gthy = if begin then Context.Proof lthy else Context.Theory (loc_exit lthy);
wenzelm@21294
   441
        in Theory (gthy, SOME lthy) end
wenzelm@20963
   442
    | _ => raise UNDEF));
wenzelm@17076
   443
wenzelm@27601
   444
val end_local_theory = transaction (fn _ =>
wenzelm@21294
   445
  (fn Theory (Context.Proof lthy, _) => Theory (Context.Theory (loc_exit lthy), SOME lthy)
wenzelm@21007
   446
    | _ => raise UNDEF));
wenzelm@21007
   447
wenzelm@47069
   448
fun open_target f = transaction (fn _ =>
wenzelm@47069
   449
  (fn Theory (gthy, _) =>
wenzelm@47069
   450
        let val lthy = f gthy
wenzelm@47069
   451
        in Theory (Context.Proof lthy, SOME lthy) end
wenzelm@47069
   452
    | _ => raise UNDEF));
wenzelm@47069
   453
wenzelm@47069
   454
val close_target = transaction (fn _ =>
wenzelm@47069
   455
  (fn Theory (Context.Proof lthy, _) =>
wenzelm@47069
   456
        (case try Local_Theory.close_target lthy of
wenzelm@50739
   457
          SOME ctxt' =>
wenzelm@50739
   458
            let
wenzelm@50739
   459
              val gthy' =
wenzelm@50739
   460
                if can Local_Theory.assert ctxt'
wenzelm@50739
   461
                then Context.Proof ctxt'
wenzelm@50739
   462
                else Context.Theory (Proof_Context.theory_of ctxt');
wenzelm@50739
   463
            in Theory (gthy', SOME lthy) end
wenzelm@47069
   464
        | NONE => raise UNDEF)
wenzelm@47069
   465
    | _ => raise UNDEF));
wenzelm@47069
   466
wenzelm@47069
   467
wenzelm@21007
   468
local
wenzelm@21007
   469
wenzelm@30366
   470
fun local_theory_presentation loc f = present_transaction (fn int =>
wenzelm@21294
   471
  (fn Theory (gthy, _) =>
wenzelm@21294
   472
        let
wenzelm@49062
   473
          val (finish, lthy) = loc_begin loc gthy;
wenzelm@47274
   474
          val lthy' = lthy
wenzelm@49012
   475
            |> Local_Theory.new_group
wenzelm@33725
   476
            |> f int
wenzelm@33725
   477
            |> Local_Theory.reset_group;
wenzelm@21294
   478
        in Theory (finish lthy', SOME lthy') end
wenzelm@30366
   479
    | _ => raise UNDEF));
wenzelm@15668
   480
wenzelm@21007
   481
in
wenzelm@21007
   482
wenzelm@30366
   483
fun local_theory' loc f = local_theory_presentation loc f (K ());
wenzelm@29380
   484
fun local_theory loc f = local_theory' loc (K f);
wenzelm@30366
   485
fun present_local_theory loc = local_theory_presentation loc (K I);
wenzelm@18955
   486
wenzelm@21007
   487
end;
wenzelm@21007
   488
wenzelm@21007
   489
wenzelm@21007
   490
(* proof transitions *)
wenzelm@21007
   491
wenzelm@27601
   492
fun end_proof f = transaction (fn int =>
wenzelm@24795
   493
  (fn Proof (prf, (finish, _)) =>
wenzelm@33390
   494
        let val state = Proof_Node.current prf in
wenzelm@21007
   495
          if can (Proof.assert_bottom true) state then
wenzelm@21007
   496
            let
wenzelm@21007
   497
              val ctxt' = f int state;
wenzelm@21007
   498
              val gthy' = finish ctxt';
wenzelm@21007
   499
            in Theory (gthy', SOME ctxt') end
wenzelm@21007
   500
          else raise UNDEF
wenzelm@21007
   501
        end
wenzelm@51555
   502
    | Skipped_Proof (0, (gthy, _)) => Theory (gthy, NONE)
wenzelm@21007
   503
    | _ => raise UNDEF));
wenzelm@21007
   504
wenzelm@21294
   505
local
wenzelm@21294
   506
wenzelm@47274
   507
fun begin_proof init = transaction (fn int =>
wenzelm@21294
   508
  (fn Theory (gthy, _) =>
wenzelm@21294
   509
    let
wenzelm@47274
   510
      val (finish, prf) = init int gthy;
wenzelm@52499
   511
      val skip = Goal.skip_proofs_enabled ();
wenzelm@40960
   512
      val (is_goal, no_skip) =
wenzelm@40960
   513
        (true, Proof.schematic_goal prf) handle ERROR _ => (false, true);
wenzelm@47274
   514
      val _ =
wenzelm@47274
   515
        if is_goal andalso skip andalso no_skip then
wenzelm@47274
   516
          warning "Cannot skip proof of schematic goal statement"
wenzelm@47274
   517
        else ();
wenzelm@21294
   518
    in
wenzelm@40960
   519
      if skip andalso not no_skip then
wenzelm@51555
   520
        Skipped_Proof (0, (finish (Proof.global_skip_proof true prf), gthy))
wenzelm@47274
   521
      else Proof (Proof_Node.init prf, (finish, gthy))
wenzelm@21294
   522
    end
wenzelm@21294
   523
  | _ => raise UNDEF));
wenzelm@21294
   524
wenzelm@21294
   525
in
wenzelm@21294
   526
wenzelm@24780
   527
fun local_theory_to_proof' loc f = begin_proof
wenzelm@47274
   528
  (fn int => fn gthy =>
wenzelm@49062
   529
    let val (finish, lthy) = loc_begin loc gthy
wenzelm@49012
   530
    in (finish o Local_Theory.reset_group, f int (Local_Theory.new_group lthy)) end);
wenzelm@24780
   531
berghofe@24453
   532
fun local_theory_to_proof loc f = local_theory_to_proof' loc (K f);
wenzelm@21294
   533
wenzelm@21294
   534
fun theory_to_proof f = begin_proof
wenzelm@47274
   535
  (fn _ => fn gthy =>
wenzelm@56057
   536
    (Context.Theory o Sign.reset_group o Sign.change_check o Proof_Context.theory_of,
wenzelm@49062
   537
      (case gthy of
wenzelm@52788
   538
        Context.Theory thy => f (Sign.new_group thy)
wenzelm@49012
   539
      | _ => raise UNDEF)));
wenzelm@21294
   540
wenzelm@21294
   541
end;
wenzelm@21294
   542
wenzelm@27601
   543
val forget_proof = transaction (fn _ =>
wenzelm@21007
   544
  (fn Proof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@51555
   545
    | Skipped_Proof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@21007
   546
    | _ => raise UNDEF));
wenzelm@21007
   547
wenzelm@30366
   548
val present_proof = present_transaction (fn _ =>
wenzelm@49062
   549
  (fn Proof (prf, x) => Proof (Proof_Node.apply I prf, x)
wenzelm@51555
   550
    | skip as Skipped_Proof _ => skip
wenzelm@30366
   551
    | _ => raise UNDEF));
wenzelm@21177
   552
wenzelm@27601
   553
fun proofs' f = transaction (fn int =>
wenzelm@49062
   554
  (fn Proof (prf, x) => Proof (Proof_Node.applys (f int) prf, x)
wenzelm@51555
   555
    | skip as Skipped_Proof _ => skip
wenzelm@16815
   556
    | _ => raise UNDEF));
wenzelm@15668
   557
wenzelm@49863
   558
fun proof' f = proofs' ((Seq.single o Seq.Result) oo f);
wenzelm@17904
   559
val proofs = proofs' o K;
wenzelm@6689
   560
val proof = proof' o K;
wenzelm@16815
   561
wenzelm@27601
   562
fun actual_proof f = transaction (fn _ =>
wenzelm@21007
   563
  (fn Proof (prf, x) => Proof (f prf, x)
wenzelm@20963
   564
    | _ => raise UNDEF));
wenzelm@16815
   565
wenzelm@53403
   566
(*Proof General legacy*)
wenzelm@27601
   567
fun skip_proof f = transaction (fn _ =>
wenzelm@51555
   568
  (fn Skipped_Proof (h, x) => Skipped_Proof (f h, x)
wenzelm@18563
   569
    | _ => raise UNDEF));
wenzelm@18563
   570
wenzelm@53403
   571
(*Proof General legacy*)
wenzelm@27601
   572
fun skip_proof_to_theory pred = transaction (fn _ =>
wenzelm@51555
   573
  (fn Skipped_Proof (d, (gthy, _)) => if pred d then Theory (gthy, NONE) else raise UNDEF
wenzelm@33725
   574
    | _ => raise UNDEF));
wenzelm@5828
   575
wenzelm@5828
   576
wenzelm@5828
   577
wenzelm@5828
   578
(** toplevel transactions **)
wenzelm@5828
   579
wenzelm@52527
   580
(* runtime position *)
wenzelm@27427
   581
wenzelm@52536
   582
fun exec_id id (tr as Transition {pos, ...}) =
wenzelm@52536
   583
  position (Position.put_id (Document_ID.print id) pos) tr;
wenzelm@25799
   584
wenzelm@25960
   585
fun setmp_thread_position (Transition {pos, ...}) f x =
wenzelm@25819
   586
  Position.setmp_thread_data pos f x;
wenzelm@25799
   587
wenzelm@25799
   588
wenzelm@28095
   589
(* post-transition hooks *)
wenzelm@28095
   590
wenzelm@37905
   591
local
wenzelm@56147
   592
  val hooks =
wenzelm@56147
   593
    Synchronized.var "Toplevel.hooks" ([]: (transition -> state -> state -> unit) list);
wenzelm@37905
   594
in
wenzelm@28095
   595
wenzelm@56147
   596
fun add_hook hook = Synchronized.change hooks (cons hook);
wenzelm@56147
   597
fun get_hooks () = Synchronized.value hooks;
wenzelm@28095
   598
wenzelm@28095
   599
end;
wenzelm@28095
   600
wenzelm@28095
   601
wenzelm@5828
   602
(* apply transitions *)
wenzelm@5828
   603
wenzelm@51217
   604
fun get_timing (Transition {timing, ...}) = timing;
wenzelm@51658
   605
fun put_timing timing = map_transition (fn (name, pos, int_only, print, _, trans) =>
wenzelm@51658
   606
  (name, pos, int_only, print, timing, trans));
wenzelm@51217
   607
wenzelm@6664
   608
local
wenzelm@6664
   609
wenzelm@51658
   610
fun app int (tr as Transition {trans, print, ...}) =
wenzelm@25819
   611
  setmp_thread_position tr (fn state =>
wenzelm@25799
   612
    let
wenzelm@51595
   613
      val timing_start = Timing.start ();
wenzelm@25799
   614
wenzelm@51595
   615
      val (result, opt_err) =
wenzelm@51658
   616
         state |> (apply_trans int trans |> ! profiling > 0 ? profile (! profiling));
wenzelm@26621
   617
      val _ = if int andalso not (! quiet) andalso print then print_state false result else ();
wenzelm@51216
   618
wenzelm@51595
   619
      val timing_result = Timing.result timing_start;
wenzelm@51662
   620
      val timing_props =
wenzelm@51662
   621
        Markup.command_timing :: (Markup.nameN, name_of tr) :: Position.properties_of (pos_of tr);
wenzelm@51662
   622
      val _ = Timing.protocol_message timing_props timing_result;
wenzelm@51595
   623
    in
wenzelm@51595
   624
      (result, Option.map (fn UNDEF => type_error tr state | exn => exn) opt_err)
wenzelm@51595
   625
    end);
wenzelm@6664
   626
wenzelm@6664
   627
in
wenzelm@5828
   628
wenzelm@26602
   629
fun transition int tr st =
wenzelm@28095
   630
  let
wenzelm@28095
   631
    val hooks = get_hooks ();
wenzelm@28103
   632
    fun apply_hooks st' = hooks |> List.app (fn f => (try (fn () => f tr st st') (); ()));
wenzelm@28095
   633
wenzelm@28095
   634
    val ctxt = try context_of st;
wenzelm@28095
   635
    val res =
wenzelm@28095
   636
      (case app int tr st of
wenzelm@38888
   637
        (_, SOME Runtime.TERMINATE) => NONE
wenzelm@38888
   638
      | (st', SOME (Runtime.EXCURSION_FAIL exn_info)) => SOME (st', SOME exn_info)
wenzelm@31476
   639
      | (st', SOME exn) => SOME (st', SOME (Runtime.exn_context ctxt exn, at_command tr))
wenzelm@28103
   640
      | (st', NONE) => SOME (st', NONE));
wenzelm@28103
   641
    val _ = (case res of SOME (st', NONE) => apply_hooks st' | _ => ());
wenzelm@28095
   642
  in res end;
wenzelm@6664
   643
wenzelm@6664
   644
end;
wenzelm@5828
   645
wenzelm@5828
   646
wenzelm@51284
   647
(* managed commands *)
wenzelm@5828
   648
wenzelm@51323
   649
fun command_errors int tr st =
wenzelm@51323
   650
  (case transition int tr st of
wenzelm@51323
   651
    SOME (st', NONE) => ([], SOME st')
wenzelm@51323
   652
  | SOME (_, SOME (exn, _)) => (ML_Compiler.exn_messages_ids exn, NONE)
wenzelm@51323
   653
  | NONE => (ML_Compiler.exn_messages_ids Runtime.TERMINATE, NONE));
wenzelm@51323
   654
wenzelm@51284
   655
fun command_exception int tr st =
wenzelm@51284
   656
  (case transition int tr st of
wenzelm@28425
   657
    SOME (st', NONE) => st'
wenzelm@39285
   658
  | SOME (_, SOME (exn, info)) =>
wenzelm@39285
   659
      if Exn.is_interrupt exn then reraise exn else raise Runtime.EXCURSION_FAIL (exn, info)
wenzelm@38888
   660
  | NONE => raise Runtime.EXCURSION_FAIL (Runtime.TERMINATE, at_command tr));
wenzelm@27576
   661
wenzelm@51323
   662
fun command tr = command_exception (! interact) tr;
wenzelm@51284
   663
wenzelm@28433
   664
wenzelm@46959
   665
(* scheduled proof result *)
wenzelm@28433
   666
wenzelm@51332
   667
datatype result =
wenzelm@51332
   668
  Result of transition * state |
wenzelm@51332
   669
  Result_List of result list |
wenzelm@51332
   670
  Result_Future of result future;
wenzelm@51332
   671
wenzelm@51332
   672
fun join_results (Result x) = [x]
wenzelm@51332
   673
  | join_results (Result_List xs) = maps join_results xs
wenzelm@51332
   674
  | join_results (Result_Future x) = join_results (Future.join x);
wenzelm@51332
   675
wenzelm@51323
   676
local
wenzelm@51323
   677
wenzelm@47417
   678
structure Result = Proof_Data
wenzelm@28974
   679
(
wenzelm@51332
   680
  type T = result;
wenzelm@51332
   681
  val empty: T = Result_List [];
wenzelm@47417
   682
  fun init _ = empty;
wenzelm@28974
   683
);
wenzelm@28974
   684
wenzelm@51332
   685
val get_result = Result.get o Proof.context_of;
wenzelm@51332
   686
val put_result = Proof.map_context o Result.put;
wenzelm@51324
   687
wenzelm@51423
   688
fun timing_estimate include_head elem =
wenzelm@51423
   689
  let
wenzelm@51423
   690
    val trs = Thy_Syntax.flat_element elem |> not include_head ? tl;
wenzelm@51423
   691
    val timings = map get_timing trs;
wenzelm@51423
   692
  in
wenzelm@51423
   693
    if forall is_some timings then
wenzelm@51423
   694
      SOME (fold (curry Time.+ o the) timings Time.zeroTime)
wenzelm@51423
   695
    else NONE
wenzelm@51423
   696
  end;
wenzelm@51423
   697
wenzelm@51423
   698
fun priority NONE = ~1
wenzelm@51423
   699
  | priority (SOME estimate) =
wenzelm@51423
   700
      Int.min (Real.floor (Real.max (Math.log10 (Time.toReal estimate), ~3.0)) - 3, ~1);
wenzelm@51423
   701
wenzelm@51423
   702
fun proof_future_enabled estimate st =
wenzelm@51324
   703
  (case try proof_of st of
wenzelm@51324
   704
    NONE => false
wenzelm@51324
   705
  | SOME state =>
wenzelm@51324
   706
      not (Proof.is_relevant state) andalso
wenzelm@51324
   707
       (if can (Proof.assert_bottom true) state
wenzelm@53189
   708
        then Goal.future_enabled 1
wenzelm@51423
   709
        else
wenzelm@51423
   710
          (case estimate of
wenzelm@53189
   711
            NONE => Goal.future_enabled 2
wenzelm@51423
   712
          | SOME t => Goal.future_enabled_timing t)));
wenzelm@51278
   713
wenzelm@51323
   714
fun atom_result tr st =
wenzelm@51323
   715
  let
wenzelm@51323
   716
    val st' =
wenzelm@53189
   717
      if Goal.future_enabled 1 andalso Keyword.is_diag (name_of tr) then
wenzelm@53192
   718
        (Execution.fork
wenzelm@51605
   719
          {name = "Toplevel.diag", pos = pos_of tr,
wenzelm@51605
   720
            pri = priority (timing_estimate true (Thy_Syntax.atom tr))}
wenzelm@51605
   721
          (fn () => command tr st); st)
wenzelm@51323
   722
      else command tr st;
wenzelm@51332
   723
  in (Result (tr, st'), st') end;
wenzelm@51323
   724
wenzelm@51323
   725
in
wenzelm@51323
   726
wenzelm@51332
   727
fun element_result (Thy_Syntax.Element (tr, NONE)) st = atom_result tr st
wenzelm@51423
   728
  | element_result (elem as Thy_Syntax.Element (head_tr, SOME element_rest)) st =
wenzelm@48633
   729
      let
wenzelm@51324
   730
        val (head_result, st') = atom_result head_tr st;
wenzelm@51332
   731
        val (body_elems, end_tr) = element_rest;
wenzelm@51423
   732
        val estimate = timing_estimate false elem;
wenzelm@51324
   733
      in
wenzelm@51423
   734
        if not (proof_future_enabled estimate st')
wenzelm@51324
   735
        then
wenzelm@51332
   736
          let
wenzelm@51332
   737
            val proof_trs = maps Thy_Syntax.flat_element body_elems @ [end_tr];
wenzelm@51332
   738
            val (proof_results, st'') = fold_map atom_result proof_trs st';
wenzelm@51332
   739
          in (Result_List (head_result :: proof_results), st'') end
wenzelm@51324
   740
        else
wenzelm@51324
   741
          let
wenzelm@51324
   742
            val finish = Context.Theory o Proof_Context.theory_of;
wenzelm@28974
   743
wenzelm@51605
   744
            val future_proof =
wenzelm@51605
   745
              Proof.future_proof (fn state =>
wenzelm@53192
   746
                Execution.fork
wenzelm@51605
   747
                  {name = "Toplevel.future_proof", pos = pos_of head_tr, pri = priority estimate}
wenzelm@51605
   748
                  (fn () =>
wenzelm@51605
   749
                    let
wenzelm@51605
   750
                      val State (SOME (Proof (prf, (_, orig_gthy))), prev) = st';
wenzelm@51605
   751
                      val prf' = Proof_Node.apply (K state) prf;
wenzelm@51605
   752
                      val (result, result_state) =
wenzelm@51605
   753
                        State (SOME (Proof (prf', (finish, orig_gthy))), prev)
wenzelm@51605
   754
                        |> fold_map element_result body_elems ||> command end_tr;
wenzelm@51605
   755
                    in (Result_List result, presentation_context_of result_state) end))
wenzelm@51332
   756
              #> (fn (res, state') => state' |> put_result (Result_Future res));
wenzelm@51332
   757
wenzelm@51332
   758
            val forked_proof =
wenzelm@51332
   759
              proof (future_proof #>
wenzelm@51332
   760
                (fn state => state |> Proof.local_done_proof |> put_result (get_result state))) o
wenzelm@51332
   761
              end_proof (fn _ => future_proof #>
wenzelm@51332
   762
                (fn state => state |> Proof.global_done_proof |> Result.put (get_result state)));
wenzelm@28974
   763
wenzelm@51324
   764
            val st'' = st'
wenzelm@51332
   765
              |> command (head_tr |> set_print false |> reset_trans |> forked_proof);
wenzelm@51332
   766
            val end_result = Result (end_tr, st'');
wenzelm@51324
   767
            val result =
wenzelm@51332
   768
              Result_List [head_result, Result.get (presentation_context_of st''), end_result];
wenzelm@51324
   769
          in (result, st'') end
wenzelm@51324
   770
      end;
wenzelm@28433
   771
wenzelm@6664
   772
end;
wenzelm@51323
   773
wenzelm@51323
   774
end;