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