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