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