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