src/Pure/Isar/toplevel.ML
author wenzelm
Mon Nov 14 16:52:19 2011 +0100 (2011-11-14 ago)
changeset 45488 6d71d9e52369
parent 44304 7ee000ce5390
child 45666 d83797ef0d2d
permissions -rw-r--r--
pass positions for named targets, for formal links in the document model;
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@27500
    40
  val str_of: transition -> string
wenzelm@5828
    41
  val name: string -> transition -> transition
wenzelm@5828
    42
  val position: Position.T -> transition -> transition
wenzelm@5828
    43
  val interactive: bool -> transition -> transition
wenzelm@38888
    44
  val set_print: bool -> transition -> transition
wenzelm@5828
    45
  val print: transition -> transition
wenzelm@9010
    46
  val no_timing: transition -> transition
wenzelm@44187
    47
  val init_theory: (unit -> theory) -> transition -> transition
wenzelm@44187
    48
  val is_init: transition -> bool
wenzelm@44186
    49
  val modify_init: (unit -> theory) -> transition -> transition
wenzelm@6689
    50
  val exit: transition -> transition
wenzelm@5828
    51
  val keep: (state -> unit) -> transition -> transition
wenzelm@7612
    52
  val keep': (bool -> state -> unit) -> transition -> transition
wenzelm@5828
    53
  val imperative: (unit -> unit) -> transition -> transition
wenzelm@27840
    54
  val ignored: Position.T -> transition
wenzelm@27840
    55
  val malformed: Position.T -> string -> transition
wenzelm@5828
    56
  val theory: (theory -> theory) -> transition -> transition
wenzelm@26491
    57
  val generic_theory: (generic_theory -> generic_theory) -> transition -> transition
wenzelm@7612
    58
  val theory': (bool -> 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@45488
    61
  val local_theory': (xstring * Position.T) option -> (bool -> local_theory -> local_theory) ->
wenzelm@45488
    62
    transition -> transition
wenzelm@45488
    63
  val local_theory: (xstring * Position.T) option -> (local_theory -> local_theory) ->
wenzelm@29380
    64
    transition -> transition
wenzelm@45488
    65
  val present_local_theory: (xstring * Position.T) option -> (state -> unit) ->
berghofe@24453
    66
    transition -> transition
wenzelm@45488
    67
  val local_theory_to_proof': (xstring * Position.T) option ->
wenzelm@45488
    68
    (bool -> local_theory -> Proof.state) -> transition -> transition
wenzelm@45488
    69
  val local_theory_to_proof: (xstring * Position.T) option ->
wenzelm@45488
    70
    (local_theory -> Proof.state) -> transition -> transition
wenzelm@17363
    71
  val theory_to_proof: (theory -> Proof.state) -> transition -> transition
wenzelm@21007
    72
  val end_proof: (bool -> Proof.state -> Proof.context) -> transition -> transition
wenzelm@21007
    73
  val forget_proof: transition -> transition
wenzelm@30366
    74
  val present_proof: (state -> unit) -> transition -> transition
wenzelm@21177
    75
  val proofs': (bool -> Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@17904
    76
  val proof': (bool -> Proof.state -> Proof.state) -> transition -> transition
wenzelm@21177
    77
  val proofs: (Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@21177
    78
  val proof: (Proof.state -> Proof.state) -> transition -> transition
wenzelm@33390
    79
  val actual_proof: (Proof_Node.T -> Proof_Node.T) -> transition -> transition
wenzelm@27564
    80
  val skip_proof: (int -> int) -> transition -> transition
wenzelm@17904
    81
  val skip_proof_to_theory: (int -> bool) -> transition -> transition
wenzelm@27427
    82
  val get_id: transition -> string option
wenzelm@27427
    83
  val put_id: string -> transition -> transition
wenzelm@9512
    84
  val unknown_theory: transition -> transition
wenzelm@9512
    85
  val unknown_proof: transition -> transition
wenzelm@9512
    86
  val unknown_context: transition -> transition
wenzelm@28425
    87
  val setmp_thread_position: transition -> ('a -> 'b) -> 'a -> 'b
wenzelm@27606
    88
  val status: transition -> Markup.T -> unit
wenzelm@44270
    89
  val error_msg: transition -> serial * string -> unit
wenzelm@28103
    90
  val add_hook: (transition -> state -> state -> unit) -> unit
wenzelm@26602
    91
  val transition: bool -> transition -> state -> (state * (exn * string) option) option
wenzelm@28425
    92
  val command: transition -> state -> state
wenzelm@42129
    93
  val excursion:
wenzelm@42129
    94
    (transition * transition list) list -> (transition * state) list future list * theory
wenzelm@5828
    95
end;
wenzelm@5828
    96
wenzelm@6965
    97
structure Toplevel: TOPLEVEL =
wenzelm@5828
    98
struct
wenzelm@5828
    99
wenzelm@5828
   100
(** toplevel state **)
wenzelm@5828
   101
wenzelm@31476
   102
exception UNDEF = Runtime.UNDEF;
wenzelm@19063
   103
wenzelm@19063
   104
wenzelm@21294
   105
(* local theory wrappers *)
wenzelm@5828
   106
haftmann@38350
   107
val loc_init = Named_Target.context_cmd;
wenzelm@33671
   108
val loc_exit = Local_Theory.exit_global;
wenzelm@21294
   109
wenzelm@45488
   110
fun loc_begin loc (Context.Theory thy) = loc_init (the_default ("-", Position.none) loc) thy
wenzelm@21294
   111
  | loc_begin NONE (Context.Proof lthy) = lthy
haftmann@38391
   112
  | loc_begin (SOME loc) (Context.Proof lthy) = (loc_init loc o loc_exit) lthy;
wenzelm@21294
   113
wenzelm@21294
   114
fun loc_finish _ (Context.Theory _) = Context.Theory o loc_exit
wenzelm@33671
   115
  | loc_finish NONE (Context.Proof _) = Context.Proof o Local_Theory.restore
haftmann@38391
   116
  | loc_finish (SOME _) (Context.Proof lthy) = Context.Proof o Named_Target.reinit lthy;
wenzelm@21294
   117
wenzelm@21294
   118
wenzelm@21958
   119
(* datatype node *)
wenzelm@21294
   120
wenzelm@5828
   121
datatype node =
wenzelm@27576
   122
  Theory of generic_theory * Proof.context option
wenzelm@27576
   123
    (*theory with presentation context*) |
wenzelm@33390
   124
  Proof of Proof_Node.T * ((Proof.context -> generic_theory) * generic_theory)
wenzelm@27576
   125
    (*proof node, finish, original theory*) |
wenzelm@27564
   126
  SkipProof of int * (generic_theory * generic_theory);
wenzelm@27564
   127
    (*proof depth, resulting theory, original theory*)
wenzelm@5828
   128
wenzelm@20963
   129
val theory_node = fn Theory (gthy, _) => SOME gthy | _ => NONE;
wenzelm@18589
   130
val proof_node = fn Proof (prf, _) => SOME prf | _ => NONE;
wenzelm@18589
   131
wenzelm@20963
   132
fun cases_node f _ (Theory (gthy, _)) = f gthy
wenzelm@33390
   133
  | cases_node _ g (Proof (prf, _)) = g (Proof_Node.current prf)
wenzelm@21007
   134
  | cases_node f _ (SkipProof (_, (gthy, _))) = f gthy;
wenzelm@19063
   135
wenzelm@29066
   136
val context_node = cases_node Context.proof_of Proof.context_of;
wenzelm@29066
   137
wenzelm@21958
   138
wenzelm@21958
   139
(* datatype state *)
wenzelm@21958
   140
wenzelm@37953
   141
datatype state = State of node option * node option;  (*current, previous*)
wenzelm@5828
   142
wenzelm@27576
   143
val toplevel = State (NONE, NONE);
wenzelm@5828
   144
wenzelm@27576
   145
fun is_toplevel (State (NONE, _)) = true
wenzelm@7732
   146
  | is_toplevel _ = false;
wenzelm@7732
   147
wenzelm@27576
   148
fun level (State (NONE, _)) = 0
wenzelm@37953
   149
  | level (State (SOME (Theory _), _)) = 0
wenzelm@37953
   150
  | level (State (SOME (Proof (prf, _)), _)) = Proof.level (Proof_Node.current prf)
wenzelm@37953
   151
  | level (State (SOME (SkipProof (d, _)), _)) = d + 1;   (*different notion of proof depth!*)
wenzelm@17076
   152
wenzelm@27576
   153
fun str_of_state (State (NONE, _)) = "at top level"
wenzelm@37953
   154
  | str_of_state (State (SOME (Theory (Context.Theory _, _)), _)) = "in theory mode"
wenzelm@37953
   155
  | str_of_state (State (SOME (Theory (Context.Proof _, _)), _)) = "in local theory mode"
wenzelm@37953
   156
  | str_of_state (State (SOME (Proof _), _)) = "in proof mode"
wenzelm@37953
   157
  | str_of_state (State (SOME (SkipProof _), _)) = "in skipped proof mode";
wenzelm@5946
   158
wenzelm@5946
   159
wenzelm@27576
   160
(* current node *)
wenzelm@5828
   161
wenzelm@27576
   162
fun node_of (State (NONE, _)) = raise UNDEF
wenzelm@37953
   163
  | node_of (State (SOME node, _)) = node;
wenzelm@5828
   164
wenzelm@18589
   165
fun is_theory state = not (is_toplevel state) andalso is_some (theory_node (node_of state));
wenzelm@18589
   166
fun is_proof state = not (is_toplevel state) andalso is_some (proof_node (node_of state));
wenzelm@18589
   167
wenzelm@19063
   168
fun node_case f g state = cases_node f g (node_of state);
wenzelm@5828
   169
wenzelm@30398
   170
fun presentation_context_of state =
wenzelm@30398
   171
  (case try node_of state of
wenzelm@30398
   172
    SOME (Theory (_, SOME ctxt)) => ctxt
wenzelm@30398
   173
  | SOME node => context_node node
wenzelm@30398
   174
  | NONE => raise UNDEF);
wenzelm@30366
   175
wenzelm@30801
   176
fun previous_context_of (State (_, NONE)) = NONE
wenzelm@37953
   177
  | previous_context_of (State (_, SOME prev)) = SOME (context_node prev);
wenzelm@30801
   178
wenzelm@21506
   179
val context_of = node_case Context.proof_of Proof.context_of;
wenzelm@22089
   180
val generic_theory_of = node_case I (Context.Proof o Proof.context_of);
wenzelm@20963
   181
val theory_of = node_case Context.theory_of Proof.theory_of;
wenzelm@18589
   182
val proof_of = node_case (fn _ => raise UNDEF) I;
wenzelm@17208
   183
wenzelm@18589
   184
fun proof_position_of state =
wenzelm@18589
   185
  (case node_of state of
wenzelm@33390
   186
    Proof (prf, _) => Proof_Node.position prf
wenzelm@18589
   187
  | _ => raise UNDEF);
wenzelm@6664
   188
wenzelm@43667
   189
fun end_theory _ (State (NONE, SOME (Theory (Context.Theory thy, _)))) = thy
wenzelm@44200
   190
  | end_theory pos (State (NONE, _)) = error ("Missing theory" ^ Position.str_of pos)
wenzelm@44200
   191
  | end_theory pos (State (SOME _, _)) = error ("Unfinished theory" ^ Position.str_of pos);
wenzelm@37953
   192
wenzelm@5828
   193
wenzelm@16815
   194
(* print state *)
wenzelm@16815
   195
haftmann@38388
   196
val pretty_context = Local_Theory.pretty o Context.cases (Named_Target.theory_init) I;
wenzelm@16815
   197
wenzelm@23640
   198
fun print_state_context state =
wenzelm@24795
   199
  (case try node_of state of
wenzelm@21506
   200
    NONE => []
wenzelm@24795
   201
  | SOME (Theory (gthy, _)) => pretty_context gthy
wenzelm@24795
   202
  | SOME (Proof (_, (_, gthy))) => pretty_context gthy
wenzelm@24795
   203
  | SOME (SkipProof (_, (gthy, _))) => pretty_context gthy)
wenzelm@23640
   204
  |> Pretty.chunks |> Pretty.writeln;
wenzelm@16815
   205
wenzelm@23640
   206
fun print_state prf_only state =
wenzelm@23701
   207
  (case try node_of state of
wenzelm@23701
   208
    NONE => []
wenzelm@23701
   209
  | SOME (Theory (gthy, _)) => if prf_only then [] else pretty_context gthy
wenzelm@23701
   210
  | SOME (Proof (prf, _)) =>
wenzelm@33390
   211
      Proof.pretty_state (Proof_Node.position prf) (Proof_Node.current prf)
wenzelm@27564
   212
  | SOME (SkipProof (d, _)) => [Pretty.str ("skipped proof: depth " ^ string_of_int d)])
wenzelm@23701
   213
  |> Pretty.markup_chunks Markup.state |> Pretty.writeln;
wenzelm@16815
   214
wenzelm@37858
   215
fun pretty_abstract state = Pretty.str ("<Isar " ^ str_of_state state ^ ">");
wenzelm@37858
   216
wenzelm@16815
   217
wenzelm@15668
   218
wenzelm@5828
   219
(** toplevel transitions **)
wenzelm@5828
   220
wenzelm@32738
   221
val quiet = Unsynchronized.ref false;
wenzelm@39513
   222
val debug = Runtime.debug;
wenzelm@32738
   223
val interact = Unsynchronized.ref false;
wenzelm@42012
   224
val timing = Unsynchronized.ref false;
wenzelm@32738
   225
val profiling = Unsynchronized.ref 0;
wenzelm@32738
   226
val skip_proofs = Unsynchronized.ref false;
wenzelm@16682
   227
wenzelm@33604
   228
fun program body =
wenzelm@33604
   229
 (body
wenzelm@31476
   230
  |> Runtime.controlled_execution
wenzelm@33604
   231
  |> Runtime.toplevel_error (Output.error_msg o ML_Compiler.exn_message)) ();
wenzelm@33604
   232
wenzelm@33604
   233
fun thread interrupts body =
wenzelm@33604
   234
  Thread.fork
wenzelm@39232
   235
    (((fn () => body () handle exn => if Exn.is_interrupt exn then () else reraise exn)
wenzelm@33604
   236
        |> Runtime.debugging
wenzelm@33604
   237
        |> Runtime.toplevel_error
wenzelm@40132
   238
          (fn exn =>
wenzelm@40132
   239
            Output.urgent_message ("## INTERNAL ERROR ##\n" ^ ML_Compiler.exn_message exn))),
wenzelm@37216
   240
      Simple_Thread.attributes interrupts);
wenzelm@20128
   241
wenzelm@5828
   242
wenzelm@27601
   243
(* node transactions -- maintaining stable checkpoints *)
wenzelm@7022
   244
wenzelm@31476
   245
exception FAILURE of state * exn;
wenzelm@31476
   246
wenzelm@6689
   247
local
wenzelm@6689
   248
wenzelm@30366
   249
fun reset_presentation (Theory (gthy, _)) = Theory (gthy, NONE)
wenzelm@30366
   250
  | reset_presentation node = node;
wenzelm@30366
   251
wenzelm@26624
   252
fun is_draft_theory (Theory (gthy, _)) = Context.is_draft (Context.theory_of gthy)
wenzelm@26624
   253
  | is_draft_theory _ = false;
wenzelm@26624
   254
wenzelm@31476
   255
fun is_stale state = Context.is_stale (theory_of state) handle Runtime.UNDEF => false;
wenzelm@27601
   256
wenzelm@26624
   257
fun stale_error NONE = SOME (ERROR "Stale theory encountered after successful execution!")
wenzelm@26624
   258
  | stale_error some = some;
wenzelm@16815
   259
wenzelm@27576
   260
fun map_theory f (Theory (gthy, ctxt)) =
wenzelm@33671
   261
      Theory (Context.mapping f (Local_Theory.raw_theory f) gthy, ctxt)
wenzelm@27576
   262
  | map_theory _ node = node;
wenzelm@6689
   263
wenzelm@6689
   264
in
wenzelm@6689
   265
wenzelm@37953
   266
fun apply_transaction f g node =
wenzelm@20128
   267
  let
wenzelm@27576
   268
    val _ = is_draft_theory node andalso error "Illegal draft theory in toplevel state";
wenzelm@27576
   269
    val cont_node = reset_presentation node;
wenzelm@27576
   270
    val back_node = map_theory (Theory.checkpoint o Theory.copy) cont_node;
wenzelm@37953
   271
    fun state_error e nd = (State (SOME nd, SOME node), e);
wenzelm@6689
   272
wenzelm@20128
   273
    val (result, err) =
wenzelm@20128
   274
      cont_node
wenzelm@31476
   275
      |> Runtime.controlled_execution f
wenzelm@26624
   276
      |> map_theory Theory.checkpoint
wenzelm@26624
   277
      |> state_error NONE
wenzelm@26624
   278
      handle exn => state_error (SOME exn) cont_node;
wenzelm@26624
   279
wenzelm@26624
   280
    val (result', err') =
wenzelm@26624
   281
      if is_stale result then state_error (stale_error err) back_node
wenzelm@26624
   282
      else (result, err);
wenzelm@20128
   283
  in
wenzelm@26624
   284
    (case err' of
wenzelm@30366
   285
      NONE => tap g result'
wenzelm@26624
   286
    | SOME exn => raise FAILURE (result', exn))
wenzelm@20128
   287
  end;
wenzelm@6689
   288
wenzelm@43667
   289
val exit_transaction =
wenzelm@43667
   290
  apply_transaction
wenzelm@43667
   291
    (fn Theory (Context.Theory thy, _) => Theory (Context.Theory (Theory.end_theory thy), NONE)
wenzelm@43667
   292
      | node => node) (K ())
wenzelm@43667
   293
  #> (fn State (node', _) => State (NONE, node'));
wenzelm@43667
   294
wenzelm@6689
   295
end;
wenzelm@6689
   296
wenzelm@6689
   297
wenzelm@6689
   298
(* primitive transitions *)
wenzelm@6689
   299
wenzelm@5828
   300
datatype trans =
wenzelm@44187
   301
  Init of unit -> theory |               (*init theory*)
wenzelm@37953
   302
  Exit |                                 (*formal exit of theory*)
wenzelm@37953
   303
  Keep of bool -> state -> unit |        (*peek at state*)
wenzelm@30366
   304
  Transaction of (bool -> node -> node) * (state -> unit);  (*node transaction and presentation*)
wenzelm@21958
   305
wenzelm@6689
   306
local
wenzelm@5828
   307
wenzelm@44187
   308
fun apply_tr _ (Init f) (State (NONE, _)) =
wenzelm@33727
   309
      State (SOME (Theory (Context.Theory
wenzelm@44186
   310
          (Theory.checkpoint (Runtime.controlled_execution f ())), NONE)), NONE)
wenzelm@43667
   311
  | apply_tr _ Exit (State (SOME (state as Theory (Context.Theory _, _)), _)) =
wenzelm@43667
   312
      exit_transaction state
wenzelm@32792
   313
  | apply_tr int (Keep f) state =
wenzelm@31476
   314
      Runtime.controlled_execution (fn x => tap (f int) x) state
wenzelm@32792
   315
  | apply_tr int (Transaction (f, g)) (State (SOME state, _)) =
wenzelm@32792
   316
      apply_transaction (fn x => f int x) g state
wenzelm@32792
   317
  | apply_tr _ _ _ = raise UNDEF;
wenzelm@5828
   318
wenzelm@32792
   319
fun apply_union _ [] state = raise FAILURE (state, UNDEF)
wenzelm@32792
   320
  | apply_union int (tr :: trs) state =
wenzelm@32792
   321
      apply_union int trs state
wenzelm@32792
   322
        handle Runtime.UNDEF => apply_tr int tr state
wenzelm@32792
   323
          | FAILURE (alt_state, UNDEF) => apply_tr int tr alt_state
wenzelm@6689
   324
          | exn as FAILURE _ => raise exn
wenzelm@6689
   325
          | exn => raise FAILURE (state, exn);
wenzelm@6689
   326
wenzelm@6689
   327
in
wenzelm@6689
   328
wenzelm@32792
   329
fun apply_trans int trs state = (apply_union int trs state, NONE)
skalberg@15531
   330
  handle FAILURE (alt_state, exn) => (alt_state, SOME exn) | exn => (state, SOME exn);
wenzelm@6689
   331
wenzelm@6689
   332
end;
wenzelm@5828
   333
wenzelm@5828
   334
wenzelm@5828
   335
(* datatype transition *)
wenzelm@5828
   336
wenzelm@5828
   337
datatype transition = Transition of
wenzelm@26621
   338
 {name: string,              (*command name*)
wenzelm@26621
   339
  pos: Position.T,           (*source position*)
wenzelm@26621
   340
  int_only: bool,            (*interactive-only*)
wenzelm@26621
   341
  print: bool,               (*print result state*)
wenzelm@26621
   342
  no_timing: bool,           (*suppress timing*)
wenzelm@26621
   343
  trans: trans list};        (*primitive transitions (union)*)
wenzelm@5828
   344
wenzelm@26621
   345
fun make_transition (name, pos, int_only, print, no_timing, trans) =
wenzelm@26621
   346
  Transition {name = name, pos = pos, int_only = int_only, print = print, no_timing = no_timing,
wenzelm@26621
   347
    trans = trans};
wenzelm@5828
   348
wenzelm@26621
   349
fun map_transition f (Transition {name, pos, int_only, print, no_timing, trans}) =
wenzelm@26621
   350
  make_transition (f (name, pos, int_only, print, no_timing, trans));
wenzelm@5828
   351
wenzelm@27441
   352
val empty = make_transition ("", Position.none, false, false, false, []);
wenzelm@5828
   353
wenzelm@5828
   354
wenzelm@5828
   355
(* diagnostics *)
wenzelm@5828
   356
wenzelm@38888
   357
fun print_of (Transition {print, ...}) = print;
wenzelm@27427
   358
fun name_of (Transition {name, ...}) = name;
wenzelm@28105
   359
fun pos_of (Transition {pos, ...}) = pos;
wenzelm@28105
   360
fun str_of tr = quote (name_of tr) ^ Position.str_of (pos_of tr);
wenzelm@5828
   361
wenzelm@27427
   362
fun command_msg msg tr = msg ^ "command " ^ str_of tr;
wenzelm@38875
   363
fun at_command tr = command_msg "At " tr;
wenzelm@5828
   364
wenzelm@5828
   365
fun type_error tr state =
wenzelm@18685
   366
  ERROR (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
wenzelm@5828
   367
wenzelm@5828
   368
wenzelm@5828
   369
(* modify transitions *)
wenzelm@5828
   370
wenzelm@28451
   371
fun name name = map_transition (fn (_, pos, int_only, print, no_timing, trans) =>
wenzelm@28451
   372
  (name, pos, int_only, print, no_timing, trans));
wenzelm@9010
   373
wenzelm@26621
   374
fun position pos = map_transition (fn (name, _, int_only, print, no_timing, trans) =>
wenzelm@26621
   375
  (name, pos, int_only, print, no_timing, trans));
wenzelm@5828
   376
wenzelm@26621
   377
fun interactive int_only = map_transition (fn (name, pos, _, print, no_timing, trans) =>
wenzelm@26621
   378
  (name, pos, int_only, print, no_timing, trans));
wenzelm@14923
   379
wenzelm@26621
   380
val no_timing = map_transition (fn (name, pos, int_only, print, _, trans) =>
wenzelm@26621
   381
  (name, pos, int_only, print, true, trans));
wenzelm@17363
   382
wenzelm@26621
   383
fun add_trans tr = map_transition (fn (name, pos, int_only, print, no_timing, trans) =>
wenzelm@28451
   384
  (name, pos, int_only, print, no_timing, tr :: trans));
wenzelm@16607
   385
wenzelm@28433
   386
val reset_trans = map_transition (fn (name, pos, int_only, print, no_timing, _) =>
wenzelm@28433
   387
  (name, pos, int_only, print, no_timing, []));
wenzelm@28433
   388
wenzelm@28453
   389
fun set_print print = map_transition (fn (name, pos, int_only, _, no_timing, trans) =>
wenzelm@28453
   390
  (name, pos, int_only, print, no_timing, trans));
wenzelm@28453
   391
wenzelm@28453
   392
val print = set_print true;
wenzelm@5828
   393
wenzelm@5828
   394
wenzelm@21007
   395
(* basic transitions *)
wenzelm@5828
   396
wenzelm@44187
   397
fun init_theory f = add_trans (Init f);
wenzelm@37977
   398
wenzelm@44187
   399
fun is_init (Transition {trans = [Init _], ...}) = true
wenzelm@44187
   400
  | is_init _ = false;
wenzelm@44187
   401
wenzelm@44187
   402
fun modify_init f tr = if is_init tr then init_theory f (reset_trans tr) else tr;
wenzelm@37977
   403
wenzelm@6689
   404
val exit = add_trans Exit;
wenzelm@7612
   405
val keep' = add_trans o Keep;
wenzelm@30366
   406
wenzelm@30366
   407
fun present_transaction f g = add_trans (Transaction (f, g));
wenzelm@30366
   408
fun transaction f = present_transaction f (K ());
wenzelm@5828
   409
wenzelm@7612
   410
fun keep f = add_trans (Keep (fn _ => f));
wenzelm@5828
   411
fun imperative f = keep (fn _ => f ());
wenzelm@5828
   412
wenzelm@27840
   413
fun ignored pos = empty |> name "<ignored>" |> position pos |> imperative I;
wenzelm@27840
   414
fun malformed pos msg =
wenzelm@27840
   415
  empty |> name "<malformed>" |> position pos |> imperative (fn () => error msg);
wenzelm@27840
   416
wenzelm@21007
   417
val unknown_theory = imperative (fn () => warning "Unknown theory context");
wenzelm@21007
   418
val unknown_proof = imperative (fn () => warning "Unknown proof context");
wenzelm@21007
   419
val unknown_context = imperative (fn () => warning "Unknown context");
wenzelm@15668
   420
wenzelm@21007
   421
wenzelm@21007
   422
(* theory transitions *)
wenzelm@15668
   423
wenzelm@44304
   424
val global_theory_group =
wenzelm@44304
   425
  Sign.new_group #>
wenzelm@44304
   426
  Global_Theory.begin_recent_proofs #> Theory.checkpoint;
wenzelm@44304
   427
wenzelm@44304
   428
val local_theory_group =
wenzelm@44304
   429
  Local_Theory.new_group #>
wenzelm@44304
   430
  Local_Theory.raw_theory (Global_Theory.begin_recent_proofs #> Theory.checkpoint);
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@44304
   439
        |> global_theory_group
wenzelm@33725
   440
        |> f int
wenzelm@33725
   441
        |> Sign.reset_group;
wenzelm@33725
   442
      in Theory (Context.Theory thy', NONE) end
wenzelm@20963
   443
    | _ => raise UNDEF));
wenzelm@20963
   444
wenzelm@20963
   445
fun theory f = theory' (K f);
wenzelm@20963
   446
wenzelm@27601
   447
fun begin_local_theory begin f = transaction (fn _ =>
wenzelm@20963
   448
  (fn Theory (Context.Theory thy, _) =>
wenzelm@20963
   449
        let
wenzelm@20985
   450
          val lthy = f thy;
wenzelm@21294
   451
          val gthy = if begin then Context.Proof lthy else Context.Theory (loc_exit lthy);
wenzelm@21294
   452
        in Theory (gthy, SOME lthy) end
wenzelm@20963
   453
    | _ => raise UNDEF));
wenzelm@17076
   454
wenzelm@27601
   455
val end_local_theory = transaction (fn _ =>
wenzelm@21294
   456
  (fn Theory (Context.Proof lthy, _) => Theory (Context.Theory (loc_exit lthy), SOME lthy)
wenzelm@21007
   457
    | _ => raise UNDEF));
wenzelm@21007
   458
wenzelm@21007
   459
local
wenzelm@21007
   460
wenzelm@30366
   461
fun local_theory_presentation loc f = present_transaction (fn int =>
wenzelm@21294
   462
  (fn Theory (gthy, _) =>
wenzelm@21294
   463
        let
wenzelm@21294
   464
          val finish = loc_finish loc gthy;
wenzelm@33725
   465
          val lthy' = loc_begin loc gthy
wenzelm@44304
   466
            |> local_theory_group
wenzelm@33725
   467
            |> f int
wenzelm@33725
   468
            |> Local_Theory.reset_group;
wenzelm@21294
   469
        in Theory (finish lthy', SOME lthy') end
wenzelm@30366
   470
    | _ => raise UNDEF));
wenzelm@15668
   471
wenzelm@21007
   472
in
wenzelm@21007
   473
wenzelm@30366
   474
fun local_theory' loc f = local_theory_presentation loc f (K ());
wenzelm@29380
   475
fun local_theory loc f = local_theory' loc (K f);
wenzelm@30366
   476
fun present_local_theory loc = local_theory_presentation loc (K I);
wenzelm@18955
   477
wenzelm@21007
   478
end;
wenzelm@21007
   479
wenzelm@21007
   480
wenzelm@21007
   481
(* proof transitions *)
wenzelm@21007
   482
wenzelm@27601
   483
fun end_proof f = transaction (fn int =>
wenzelm@24795
   484
  (fn Proof (prf, (finish, _)) =>
wenzelm@33390
   485
        let val state = Proof_Node.current prf in
wenzelm@21007
   486
          if can (Proof.assert_bottom true) state then
wenzelm@21007
   487
            let
wenzelm@21007
   488
              val ctxt' = f int state;
wenzelm@21007
   489
              val gthy' = finish ctxt';
wenzelm@21007
   490
            in Theory (gthy', SOME ctxt') end
wenzelm@21007
   491
          else raise UNDEF
wenzelm@21007
   492
        end
wenzelm@27564
   493
    | SkipProof (0, (gthy, _)) => Theory (gthy, NONE)
wenzelm@21007
   494
    | _ => raise UNDEF));
wenzelm@21007
   495
wenzelm@21294
   496
local
wenzelm@21294
   497
wenzelm@27601
   498
fun begin_proof init finish = transaction (fn int =>
wenzelm@21294
   499
  (fn Theory (gthy, _) =>
wenzelm@21294
   500
    let
berghofe@24453
   501
      val prf = init int gthy;
wenzelm@28433
   502
      val skip = ! skip_proofs;
wenzelm@40960
   503
      val (is_goal, no_skip) =
wenzelm@40960
   504
        (true, Proof.schematic_goal prf) handle ERROR _ => (false, true);
wenzelm@21294
   505
    in
wenzelm@40960
   506
      if is_goal andalso skip andalso no_skip then
wenzelm@21294
   507
        warning "Cannot skip proof of schematic goal statement"
wenzelm@21294
   508
      else ();
wenzelm@40960
   509
      if skip andalso not no_skip then
wenzelm@27564
   510
        SkipProof (0, (finish gthy (Proof.global_skip_proof int prf), gthy))
wenzelm@33390
   511
      else Proof (Proof_Node.init prf, (finish gthy, gthy))
wenzelm@21294
   512
    end
wenzelm@21294
   513
  | _ => raise UNDEF));
wenzelm@21294
   514
wenzelm@21294
   515
in
wenzelm@21294
   516
wenzelm@24780
   517
fun local_theory_to_proof' loc f = begin_proof
wenzelm@44304
   518
  (fn int => fn gthy => f int (local_theory_group (loc_begin loc gthy)))
wenzelm@33725
   519
  (fn gthy => loc_finish loc gthy o Local_Theory.reset_group);
wenzelm@24780
   520
berghofe@24453
   521
fun local_theory_to_proof loc f = local_theory_to_proof' loc (K f);
wenzelm@21294
   522
wenzelm@21294
   523
fun theory_to_proof f = begin_proof
wenzelm@44304
   524
  (K (fn Context.Theory thy => f (global_theory_group thy) | _ => raise UNDEF))
wenzelm@42360
   525
  (K (Context.Theory o Sign.reset_group o Proof_Context.theory_of));
wenzelm@21294
   526
wenzelm@21294
   527
end;
wenzelm@21294
   528
wenzelm@27601
   529
val forget_proof = transaction (fn _ =>
wenzelm@21007
   530
  (fn Proof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@21007
   531
    | SkipProof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
wenzelm@21007
   532
    | _ => raise UNDEF));
wenzelm@21007
   533
wenzelm@30366
   534
val present_proof = present_transaction (fn _ =>
wenzelm@33390
   535
  (fn Proof (prf, x) => Proof (Proof_Node.apply I prf, x)
wenzelm@27564
   536
    | skip as SkipProof _ => skip
wenzelm@30366
   537
    | _ => raise UNDEF));
wenzelm@21177
   538
wenzelm@27601
   539
fun proofs' f = transaction (fn int =>
wenzelm@33390
   540
  (fn Proof (prf, x) => Proof (Proof_Node.applys (f int) prf, x)
wenzelm@27564
   541
    | skip as SkipProof _ => skip
wenzelm@16815
   542
    | _ => raise UNDEF));
wenzelm@15668
   543
wenzelm@17904
   544
fun proof' f = proofs' (Seq.single oo f);
wenzelm@17904
   545
val proofs = proofs' o K;
wenzelm@6689
   546
val proof = proof' o K;
wenzelm@16815
   547
wenzelm@27601
   548
fun actual_proof f = transaction (fn _ =>
wenzelm@21007
   549
  (fn Proof (prf, x) => Proof (f prf, x)
wenzelm@20963
   550
    | _ => raise UNDEF));
wenzelm@16815
   551
wenzelm@27601
   552
fun skip_proof f = transaction (fn _ =>
wenzelm@21007
   553
  (fn SkipProof (h, x) => SkipProof (f h, x)
wenzelm@18563
   554
    | _ => raise UNDEF));
wenzelm@18563
   555
wenzelm@27601
   556
fun skip_proof_to_theory pred = transaction (fn _ =>
wenzelm@27564
   557
  (fn SkipProof (d, (gthy, _)) => if pred d then Theory (gthy, NONE) else raise UNDEF
wenzelm@33725
   558
    | _ => raise UNDEF));
wenzelm@5828
   559
wenzelm@5828
   560
wenzelm@5828
   561
wenzelm@5828
   562
(** toplevel transactions **)
wenzelm@5828
   563
wenzelm@27427
   564
(* identification *)
wenzelm@27427
   565
wenzelm@27427
   566
fun get_id (Transition {pos, ...}) = Position.get_id pos;
wenzelm@27427
   567
fun put_id id (tr as Transition {pos, ...}) = position (Position.put_id id pos) tr;
wenzelm@27427
   568
wenzelm@27427
   569
wenzelm@25960
   570
(* thread position *)
wenzelm@25799
   571
wenzelm@25960
   572
fun setmp_thread_position (Transition {pos, ...}) f x =
wenzelm@25819
   573
  Position.setmp_thread_data pos f x;
wenzelm@25799
   574
wenzelm@27606
   575
fun status tr m =
wenzelm@43665
   576
  setmp_thread_position tr (fn () => Output.status (Markup.markup_only m)) ();
wenzelm@27606
   577
wenzelm@38876
   578
fun error_msg tr msg =
wenzelm@44270
   579
  setmp_thread_position tr (fn () => Output.error_msg' msg) ();
wenzelm@26602
   580
wenzelm@25799
   581
wenzelm@28095
   582
(* post-transition hooks *)
wenzelm@28095
   583
wenzelm@37905
   584
local
wenzelm@37905
   585
  val hooks = Unsynchronized.ref ([]: (transition -> state -> state -> unit) list);
wenzelm@37905
   586
in
wenzelm@28095
   587
wenzelm@32738
   588
fun add_hook f = CRITICAL (fn () => Unsynchronized.change hooks (cons f));
wenzelm@33223
   589
fun get_hooks () = ! hooks;
wenzelm@28095
   590
wenzelm@28095
   591
end;
wenzelm@28095
   592
wenzelm@28095
   593
wenzelm@5828
   594
(* apply transitions *)
wenzelm@5828
   595
wenzelm@6664
   596
local
wenzelm@6664
   597
wenzelm@32792
   598
fun app int (tr as Transition {trans, print, no_timing, ...}) =
wenzelm@25819
   599
  setmp_thread_position tr (fn state =>
wenzelm@25799
   600
    let
wenzelm@25799
   601
      fun do_timing f x = (warning (command_msg "" tr); timeap f x);
wenzelm@25799
   602
      fun do_profiling f x = profile (! profiling) f x;
wenzelm@25799
   603
wenzelm@26256
   604
      val (result, status) =
wenzelm@37905
   605
         state |>
wenzelm@37905
   606
          (apply_trans int trans
wenzelm@37905
   607
            |> (! profiling > 0 andalso not no_timing) ? do_profiling
wenzelm@37905
   608
            |> (! profiling > 0 orelse ! timing andalso not no_timing) ? do_timing);
wenzelm@26256
   609
wenzelm@26621
   610
      val _ = if int andalso not (! quiet) andalso print then print_state false result else ();
wenzelm@26256
   611
    in (result, Option.map (fn UNDEF => type_error tr state | exn => exn) status) end);
wenzelm@6664
   612
wenzelm@6664
   613
in
wenzelm@5828
   614
wenzelm@26602
   615
fun transition int tr st =
wenzelm@28095
   616
  let
wenzelm@28095
   617
    val hooks = get_hooks ();
wenzelm@28103
   618
    fun apply_hooks st' = hooks |> List.app (fn f => (try (fn () => f tr st st') (); ()));
wenzelm@28095
   619
wenzelm@28095
   620
    val ctxt = try context_of st;
wenzelm@28095
   621
    val res =
wenzelm@28095
   622
      (case app int tr st of
wenzelm@38888
   623
        (_, SOME Runtime.TERMINATE) => NONE
wenzelm@38888
   624
      | (st', SOME (Runtime.EXCURSION_FAIL exn_info)) => SOME (st', SOME exn_info)
wenzelm@31476
   625
      | (st', SOME exn) => SOME (st', SOME (Runtime.exn_context ctxt exn, at_command tr))
wenzelm@28103
   626
      | (st', NONE) => SOME (st', NONE));
wenzelm@28103
   627
    val _ = (case res of SOME (st', NONE) => apply_hooks st' | _ => ());
wenzelm@28095
   628
  in res end;
wenzelm@6664
   629
wenzelm@6664
   630
end;
wenzelm@5828
   631
wenzelm@5828
   632
wenzelm@28425
   633
(* nested commands *)
wenzelm@5828
   634
wenzelm@28425
   635
fun command tr st =
wenzelm@27576
   636
  (case transition (! interact) tr st of
wenzelm@28425
   637
    SOME (st', NONE) => st'
wenzelm@39285
   638
  | SOME (_, SOME (exn, info)) =>
wenzelm@39285
   639
      if Exn.is_interrupt exn then reraise exn else raise Runtime.EXCURSION_FAIL (exn, info)
wenzelm@38888
   640
  | NONE => raise Runtime.EXCURSION_FAIL (Runtime.TERMINATE, at_command tr));
wenzelm@27576
   641
wenzelm@29483
   642
fun command_result tr st =
wenzelm@29483
   643
  let val st' = command tr st
wenzelm@29483
   644
  in (st', st') end;
wenzelm@29483
   645
wenzelm@28433
   646
wenzelm@28433
   647
(* excursion of units, consisting of commands with proof *)
wenzelm@28433
   648
wenzelm@33519
   649
structure States = Proof_Data
wenzelm@28974
   650
(
wenzelm@28974
   651
  type T = state list future option;
wenzelm@28974
   652
  fun init _ = NONE;
wenzelm@28974
   653
);
wenzelm@28974
   654
wenzelm@28974
   655
fun proof_result immediate (tr, proof_trs) st =
wenzelm@28433
   656
  let val st' = command tr st in
wenzelm@36315
   657
    if immediate orelse
wenzelm@36315
   658
      null proof_trs orelse
wenzelm@36950
   659
      Keyword.is_schematic_goal (name_of tr) orelse
wenzelm@36950
   660
      exists (Keyword.is_qed_global o name_of) proof_trs orelse
wenzelm@36315
   661
      not (can proof_of st') orelse
wenzelm@36315
   662
      Proof.is_relevant (proof_of st')
wenzelm@28433
   663
    then
wenzelm@28453
   664
      let val (states, st'') = fold_map command_result proof_trs st'
wenzelm@42129
   665
      in (Future.value ((tr, st') :: (proof_trs ~~ states)), st'') end
wenzelm@28453
   666
    else
wenzelm@28433
   667
      let
wenzelm@28433
   668
        val (body_trs, end_tr) = split_last proof_trs;
wenzelm@42360
   669
        val finish = Context.Theory o Proof_Context.theory_of;
wenzelm@28974
   670
wenzelm@29386
   671
        val future_proof = Proof.global_future_proof
wenzelm@28974
   672
          (fn prf =>
wenzelm@41703
   673
            Goal.fork_name "Toplevel.future_proof"
wenzelm@41673
   674
              (fn () =>
wenzelm@41673
   675
                let val (states, result_state) =
wenzelm@41673
   676
                  (case st' of State (SOME (Proof (_, (_, orig_gthy))), prev)
wenzelm@41673
   677
                    => State (SOME (Proof (Proof_Node.init prf, (finish, orig_gthy))), prev))
wenzelm@41673
   678
                  |> fold_map command_result body_trs
wenzelm@41673
   679
                  ||> command (end_tr |> set_print false);
wenzelm@41673
   680
                in (states, presentation_context_of result_state) end))
wenzelm@28974
   681
          #> (fn (states, ctxt) => States.put (SOME states) ctxt);
wenzelm@28974
   682
wenzelm@28974
   683
        val st'' = st' |> command (end_tr |> reset_trans |> end_proof (K future_proof));
wenzelm@28974
   684
wenzelm@28974
   685
        val states =
wenzelm@30398
   686
          (case States.get (presentation_context_of st'') of
wenzelm@37852
   687
            NONE => raise Fail ("No future states for " ^ name_of tr ^ Position.str_of (pos_of tr))
wenzelm@28974
   688
          | SOME states => states);
wenzelm@42129
   689
        val result = states
wenzelm@42129
   690
          |> Future.map (fn sts => (tr, st') :: (body_trs ~~ sts) @ [(end_tr, st'')]);
wenzelm@28974
   691
wenzelm@28974
   692
      in (result, st'') end
wenzelm@28433
   693
  end;
wenzelm@28433
   694
wenzelm@29068
   695
fun excursion input =
wenzelm@28425
   696
  let
wenzelm@28433
   697
    val end_pos = if null input then error "No input" else pos_of (fst (List.last input));
wenzelm@29448
   698
    val immediate = not (Goal.future_enabled ());
wenzelm@29427
   699
    val (results, end_state) = fold_map (proof_result immediate) input toplevel;
wenzelm@37953
   700
    val thy = end_theory end_pos end_state;
wenzelm@42129
   701
  in (results, thy) end;
wenzelm@7062
   702
wenzelm@6664
   703
end;