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