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