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