src/Pure/Isar/toplevel.ML
author paulson
Sat Mar 26 18:20:29 2005 +0100 (2005-03-26 ago)
changeset 15633 741deccec4e3
parent 15598 4ab52355bb53
child 15668 53c049a365cf
permissions -rw-r--r--
new display of theory stamps
wenzelm@5828
     1
(*  Title:      Pure/Isar/toplevel.ML
wenzelm@5828
     2
    ID:         $Id$
wenzelm@5828
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5828
     4
wenzelm@5828
     5
The Isabelle/Isar toplevel.
wenzelm@5828
     6
*)
wenzelm@5828
     7
wenzelm@5828
     8
signature TOPLEVEL =
wenzelm@5828
     9
sig
wenzelm@5828
    10
  datatype node = Theory of theory | Proof of ProofHistory.T
berghofe@15237
    11
    | SkipProof of int History.T * theory
wenzelm@5828
    12
  type state
wenzelm@5828
    13
  val toplevel: state
wenzelm@7732
    14
  val is_toplevel: state -> bool
wenzelm@6689
    15
  val prompt_state_default: state -> string
wenzelm@6689
    16
  val prompt_state_fn: (state -> string) ref
wenzelm@7308
    17
  val print_state_context: state -> unit
wenzelm@8886
    18
  val print_state_default: bool -> state -> unit
wenzelm@8886
    19
  val print_state_fn: (bool -> state -> unit) ref
wenzelm@8886
    20
  val print_state: bool -> state -> unit
wenzelm@12423
    21
  val pretty_state: bool -> state -> Pretty.T list
wenzelm@6689
    22
  exception UNDEF
wenzelm@6689
    23
  val node_history_of: state -> node History.T
wenzelm@5828
    24
  val node_of: state -> node
wenzelm@6664
    25
  val node_case: (theory -> 'a) -> (Proof.state -> 'a) -> state -> 'a
wenzelm@5828
    26
  val theory_of: state -> theory
wenzelm@5828
    27
  val sign_of: state -> Sign.sg
wenzelm@7501
    28
  val context_of: state -> Proof.context
wenzelm@5828
    29
  val proof_of: state -> Proof.state
wenzelm@9453
    30
  val enter_forward_proof: state -> Proof.state
wenzelm@5828
    31
  type transition
wenzelm@5828
    32
  exception TERMINATE
wenzelm@5990
    33
  exception RESTART
wenzelm@6689
    34
  val undo_limit: bool -> int option
wenzelm@5828
    35
  val empty: transition
wenzelm@14923
    36
  val name_of: transition -> string
wenzelm@14923
    37
  val source_of: transition -> OuterLex.token list option
wenzelm@5828
    38
  val name: string -> transition -> transition
wenzelm@5828
    39
  val position: Position.T -> transition -> transition
wenzelm@14923
    40
  val source: OuterLex.token list -> transition -> transition
wenzelm@5828
    41
  val interactive: bool -> transition -> transition
wenzelm@5828
    42
  val print: transition -> transition
wenzelm@9010
    43
  val no_timing: transition -> transition
wenzelm@5828
    44
  val reset: transition -> transition
wenzelm@8465
    45
  val init: (bool -> node) -> (node -> unit) -> (node -> unit) -> transition -> transition
wenzelm@6689
    46
  val exit: transition -> transition
wenzelm@6689
    47
  val kill: transition -> transition
wenzelm@5828
    48
  val keep: (state -> unit) -> transition -> transition
wenzelm@7612
    49
  val keep': (bool -> state -> unit) -> transition -> transition
wenzelm@6689
    50
  val history: (node History.T -> node History.T) -> transition -> transition
wenzelm@5828
    51
  val imperative: (unit -> unit) -> transition -> transition
wenzelm@7105
    52
  val init_theory: (bool -> theory) -> (theory -> unit) -> (theory -> unit)
wenzelm@6689
    53
    -> transition -> transition
berghofe@15237
    54
  val skip_proofs: bool ref
wenzelm@5828
    55
  val theory: (theory -> theory) -> transition -> transition
wenzelm@7612
    56
  val theory': (bool -> theory -> theory) -> transition -> transition
wenzelm@6689
    57
  val theory_to_proof: (bool -> theory -> ProofHistory.T) -> transition -> transition
wenzelm@5828
    58
  val proof: (ProofHistory.T -> ProofHistory.T) -> transition -> transition
wenzelm@6689
    59
  val proof': (bool -> ProofHistory.T -> ProofHistory.T) -> transition -> transition
berghofe@15237
    60
  val proof'': (ProofHistory.T -> ProofHistory.T) -> transition -> transition
wenzelm@5828
    61
  val proof_to_theory: (ProofHistory.T -> theory) -> transition -> transition
wenzelm@12315
    62
  val proof_to_theory': (bool -> ProofHistory.T -> theory) -> transition -> transition
berghofe@15237
    63
  val skip_proof: (int History.T -> int History.T) -> transition -> transition
berghofe@15237
    64
  val skip_proof_to_theory: (int History.T -> bool) -> transition -> transition
wenzelm@9512
    65
  val unknown_theory: transition -> transition
wenzelm@9512
    66
  val unknown_proof: transition -> transition
wenzelm@9512
    67
  val unknown_context: transition -> transition
wenzelm@7198
    68
  val quiet: bool ref
ballarin@15519
    69
  val debug: bool ref
wenzelm@5922
    70
  val exn_message: exn -> string
wenzelm@5828
    71
  val apply: bool -> transition -> state -> (state * (exn * string) option) option
berghofe@15431
    72
  val excursion_result: ((transition * (state -> state -> 'a -> 'a)) list * 'a) -> 'a
wenzelm@5828
    73
  val excursion: transition list -> unit
wenzelm@5828
    74
  val set_state: state -> unit
wenzelm@5828
    75
  val get_state: unit -> state
wenzelm@5828
    76
  val exn: unit -> (exn * string) option
wenzelm@5828
    77
  val >> : transition -> bool
wenzelm@14985
    78
  val >>> : transition list -> unit
nipkow@14091
    79
  type 'a isar
nipkow@14091
    80
  val loop: 'a isar -> unit
wenzelm@5828
    81
end;
wenzelm@5828
    82
wenzelm@6965
    83
structure Toplevel: TOPLEVEL =
wenzelm@5828
    84
struct
wenzelm@5828
    85
wenzelm@5828
    86
wenzelm@5828
    87
(** toplevel state **)
wenzelm@5828
    88
wenzelm@5828
    89
(* datatype node *)
wenzelm@5828
    90
wenzelm@5828
    91
datatype node =
wenzelm@5828
    92
  Theory of theory |
berghofe@15237
    93
  Proof of ProofHistory.T |
berghofe@15237
    94
  SkipProof of int History.T * theory;
wenzelm@5828
    95
wenzelm@6689
    96
fun str_of_node (Theory _) = "in theory mode"
berghofe@15237
    97
  | str_of_node _ = "in proof mode";
wenzelm@6689
    98
wenzelm@12423
    99
fun pretty_context thy = [Pretty.block
wenzelm@8561
   100
  [Pretty.str "theory", Pretty.brk 1, Pretty.str (PureThy.get_name thy),
paulson@15633
   101
    Pretty.str " =", Pretty.brk 1, ThyInfo.pretty_theory thy]];
wenzelm@7308
   102
wenzelm@12423
   103
fun pretty_prf prf = Proof.pretty_state (ProofHistory.position prf) (ProofHistory.current prf);
wenzelm@8886
   104
wenzelm@12423
   105
fun pretty_node_context (Theory thy) = pretty_context thy
berghofe@15237
   106
  | pretty_node_context (Proof prf) = pretty_context (Proof.theory_of (ProofHistory.current prf))
berghofe@15237
   107
  | pretty_node_context _ = [];
wenzelm@7308
   108
wenzelm@12423
   109
fun pretty_node prf_only (Theory thy) = if prf_only then [] else pretty_context thy
berghofe@15237
   110
  | pretty_node _ (Proof prf) = pretty_prf prf
berghofe@15237
   111
  | pretty_node _ _ = [];
wenzelm@5828
   112
wenzelm@5828
   113
wenzelm@5828
   114
(* datatype state *)
wenzelm@5828
   115
wenzelm@8465
   116
datatype state = State of (node History.T * ((node -> unit) * (node -> unit))) option;
wenzelm@5828
   117
skalberg@15531
   118
val toplevel = State NONE;
wenzelm@5828
   119
skalberg@15531
   120
fun is_toplevel (State NONE) = true
wenzelm@7732
   121
  | is_toplevel _ = false;
wenzelm@7732
   122
skalberg@15531
   123
fun str_of_state (State NONE) = "at top level"
skalberg@15531
   124
  | str_of_state (State (SOME (node, _))) = str_of_node (History.current node);
wenzelm@6689
   125
wenzelm@6689
   126
wenzelm@6689
   127
(* prompt_state hook *)
wenzelm@6689
   128
wenzelm@8465
   129
fun prompt_state_default (State _) = Source.default_prompt;
wenzelm@6689
   130
wenzelm@6689
   131
val prompt_state_fn = ref prompt_state_default;
wenzelm@6689
   132
fun prompt_state state = ! prompt_state_fn state;
wenzelm@5828
   133
wenzelm@5828
   134
wenzelm@7308
   135
(* print state *)
wenzelm@5946
   136
skalberg@15531
   137
fun pretty_current_node _ (State NONE) = []
skalberg@15531
   138
  | pretty_current_node prt (State (SOME (node, _))) = prt (History.current node);
wenzelm@7308
   139
wenzelm@12423
   140
val print_state_context =
wenzelm@12423
   141
  Pretty.writeln o Pretty.chunks o pretty_current_node pretty_node_context;
wenzelm@5946
   142
wenzelm@12423
   143
fun pretty_state prf_only state =
wenzelm@11894
   144
  let val ref (begin_state, end_state, _) = Display.current_goals_markers in
wenzelm@12423
   145
    (case pretty_current_node (pretty_node prf_only) state of [] => []
wenzelm@12423
   146
    | prts =>
wenzelm@12423
   147
        (if begin_state = "" then [] else [Pretty.str begin_state]) @ prts @
wenzelm@12423
   148
        (if end_state = "" then [] else [Pretty.str end_state]))
wenzelm@5946
   149
  end;
wenzelm@5946
   150
wenzelm@12423
   151
fun print_state_default prf_only state = Pretty.writelns (pretty_state prf_only state);
wenzelm@5946
   152
val print_state_fn = ref print_state_default;
wenzelm@5946
   153
fun print_state state = ! print_state_fn state;
wenzelm@5946
   154
wenzelm@5946
   155
wenzelm@5828
   156
(* top node *)
wenzelm@5828
   157
wenzelm@6689
   158
exception UNDEF;
wenzelm@6689
   159
skalberg@15531
   160
fun node_history_of (State NONE) = raise UNDEF
skalberg@15531
   161
  | node_history_of (State (SOME (node, _))) = node;
wenzelm@6689
   162
wenzelm@6689
   163
val node_of = History.current o node_history_of;
wenzelm@5828
   164
wenzelm@6664
   165
fun node_case f g state =
wenzelm@5828
   166
  (case node_of state of
wenzelm@5828
   167
    Theory thy => f thy
berghofe@15237
   168
  | SkipProof (i, thy) => f thy
wenzelm@5828
   169
  | Proof prf => g (ProofHistory.current prf));
wenzelm@5828
   170
wenzelm@6664
   171
val theory_of = node_case I Proof.theory_of;
wenzelm@7501
   172
val context_of = node_case ProofContext.init Proof.context_of;
wenzelm@5828
   173
val sign_of = Theory.sign_of o theory_of;
wenzelm@6664
   174
val proof_of = node_case (fn _ => raise UNDEF) I;
wenzelm@6664
   175
wenzelm@12049
   176
val enter_forward_proof = node_case Proof.init_state Proof.enter_forward;
wenzelm@5828
   177
wenzelm@5828
   178
wenzelm@5828
   179
(** toplevel transitions **)
wenzelm@5828
   180
wenzelm@5828
   181
exception TERMINATE;
wenzelm@5990
   182
exception RESTART;
wenzelm@7022
   183
exception EXCURSION_FAIL of exn * string;
wenzelm@6689
   184
exception FAILURE of state * exn;
wenzelm@5828
   185
wenzelm@5828
   186
wenzelm@6689
   187
(* recovery from stale signatures *)
wenzelm@6689
   188
wenzelm@7022
   189
(*note: proof commands should be non-destructive!*)
wenzelm@7022
   190
wenzelm@6689
   191
local
wenzelm@6689
   192
wenzelm@6689
   193
fun is_stale state = Sign.is_stale (sign_of state) handle UNDEF => false;
wenzelm@6689
   194
wenzelm@6689
   195
fun checkpoint_node true (Theory thy) = Theory (PureThy.checkpoint thy)
wenzelm@6689
   196
  | checkpoint_node _ node = node;
wenzelm@6689
   197
wenzelm@6689
   198
fun copy_node true (Theory thy) = Theory (Theory.copy thy)
wenzelm@6689
   199
  | copy_node _ node = node;
wenzelm@6689
   200
wenzelm@6965
   201
fun interruptible f x =
skalberg@15531
   202
  let val y = ref (NONE: node History.T option);
skalberg@15570
   203
  in raise_interrupt (fn () => y := SOME (f x)) (); valOf (! y) end;
wenzelm@6965
   204
wenzelm@7022
   205
val rollback = ERROR_MESSAGE "Stale signature encountered after succesful execution!";
wenzelm@7022
   206
skalberg@15531
   207
fun return (result, NONE) = result
skalberg@15531
   208
  | return (result, SOME exn) = raise FAILURE (result, exn);
wenzelm@7022
   209
wenzelm@6689
   210
in
wenzelm@6689
   211
skalberg@15531
   212
fun node_trans _ _ _ (State NONE) = raise UNDEF
skalberg@15531
   213
  | node_trans int hist f (State (SOME (node, term))) =
wenzelm@6689
   214
      let
skalberg@15531
   215
        fun mk_state nd = State (SOME (nd, term));
wenzelm@6689
   216
berghofe@15549
   217
        val f' = checkpoint_node int o f int o copy_node int;
wenzelm@6689
   218
berghofe@15549
   219
        val trans = if hist then History.apply else History.map;
wenzelm@6965
   220
        val (result, opt_exn) =
berghofe@15549
   221
          (mk_state (transform_error (interruptible (trans f')) node), NONE)
berghofe@15549
   222
            handle exn => (mk_state node, SOME exn);
wenzelm@6689
   223
      in
skalberg@15570
   224
        if is_stale result then return (mk_state node, SOME (getOpt (opt_exn, rollback)))
wenzelm@7022
   225
        else return (result, opt_exn)
wenzelm@6689
   226
      end;
wenzelm@6689
   227
wenzelm@6689
   228
fun check_stale state =
wenzelm@6689
   229
  if not (is_stale state) then ()
wenzelm@7022
   230
  else warning "Stale signature encountered!  Should restart current theory.";
wenzelm@6689
   231
wenzelm@6689
   232
end;
wenzelm@6689
   233
wenzelm@6689
   234
wenzelm@6689
   235
(* primitive transitions *)
wenzelm@6689
   236
wenzelm@6689
   237
(*Important note: recovery from stale signatures is provided only for
wenzelm@6689
   238
  theory-level operations via MapCurrent and AppCurrent.  Other node
wenzelm@6965
   239
  or state operations should not touch signatures at all.
wenzelm@6965
   240
wenzelm@6965
   241
  Also note that interrupts are enabled for Keep, MapCurrent, and
wenzelm@6965
   242
  AppCurrent only.*)
wenzelm@5828
   243
wenzelm@5828
   244
datatype trans =
wenzelm@6689
   245
  Reset |                                       (*empty toplevel*)
wenzelm@8465
   246
  Init of (bool -> node) * ((node -> unit) * (node -> unit)) |
wenzelm@8465
   247
    (*init node; provide exit/kill operation*)
wenzelm@8465
   248
  Exit |                                        (*conclude node*)
wenzelm@6689
   249
  Kill |                                        (*abort node*)
wenzelm@7612
   250
  Keep of bool -> state -> unit |               (*peek at state*)
wenzelm@6689
   251
  History of node History.T -> node History.T | (*history operation (undo etc.)*)
wenzelm@6689
   252
  MapCurrent of bool -> node -> node |          (*change node, bypassing history*)
wenzelm@6689
   253
  AppCurrent of bool -> node -> node;           (*change node, recording history*)
wenzelm@6689
   254
skalberg@15531
   255
fun undo_limit int = if int then NONE else SOME 0;
wenzelm@6689
   256
wenzelm@6689
   257
local
wenzelm@5828
   258
wenzelm@6689
   259
fun apply_tr _ Reset _ = toplevel
skalberg@15531
   260
  | apply_tr int (Init (f, term)) (State NONE) =
skalberg@15531
   261
      State (SOME (History.init (undo_limit int) (f int), term))
skalberg@15531
   262
  | apply_tr _ (Init _ ) (State (SOME _)) = raise UNDEF
skalberg@15531
   263
  | apply_tr _ Exit (State NONE) = raise UNDEF
skalberg@15531
   264
  | apply_tr _ Exit (State (SOME (node, (exit, _)))) =
skalberg@15531
   265
      (exit (History.current node); State NONE)
skalberg@15531
   266
  | apply_tr _ Kill (State NONE) = raise UNDEF
skalberg@15531
   267
  | apply_tr _ Kill (State (SOME (node, (_, kill)))) =
skalberg@15531
   268
      (kill (History.current node); State NONE)
wenzelm@12987
   269
  | apply_tr int (Keep f) state = (raise_interrupt (f int) state; state)
skalberg@15531
   270
  | apply_tr _ (History _) (State NONE) = raise UNDEF
skalberg@15531
   271
  | apply_tr _ (History f) (State (SOME (node, term))) = State (SOME (f node, term))
wenzelm@6689
   272
  | apply_tr int (MapCurrent f) state = node_trans int false f state
wenzelm@6689
   273
  | apply_tr int (AppCurrent f) state = node_trans int true f state;
wenzelm@5828
   274
wenzelm@6689
   275
fun apply_union _ [] state = raise FAILURE (state, UNDEF)
wenzelm@6689
   276
  | apply_union int (tr :: trs) state =
wenzelm@6689
   277
      transform_error (apply_tr int tr) state
wenzelm@6689
   278
        handle UNDEF => apply_union int trs state
wenzelm@6689
   279
          | FAILURE (alt_state, UNDEF) => apply_union int trs alt_state
wenzelm@6689
   280
          | exn as FAILURE _ => raise exn
wenzelm@6689
   281
          | exn => raise FAILURE (state, exn);
wenzelm@6689
   282
wenzelm@6689
   283
in
wenzelm@6689
   284
skalberg@15531
   285
fun apply_trans int trs state = (apply_union int trs state, NONE)
skalberg@15531
   286
  handle FAILURE (alt_state, exn) => (alt_state, SOME exn) | exn => (state, SOME exn);
wenzelm@6689
   287
wenzelm@6689
   288
end;
wenzelm@5828
   289
wenzelm@5828
   290
wenzelm@5828
   291
(* datatype transition *)
wenzelm@5828
   292
wenzelm@5828
   293
datatype transition = Transition of
wenzelm@5828
   294
 {name: string,
wenzelm@5828
   295
  pos: Position.T,
wenzelm@14923
   296
  source: OuterLex.token list option,
wenzelm@5828
   297
  int_only: bool,
wenzelm@5828
   298
  print: bool,
wenzelm@9010
   299
  no_timing: bool,
wenzelm@5828
   300
  trans: trans list};
wenzelm@5828
   301
wenzelm@14923
   302
fun make_transition (name, pos, source, int_only, print, no_timing, trans) =
wenzelm@14923
   303
  Transition {name = name, pos = pos, source = source,
wenzelm@14923
   304
    int_only = int_only, print = print, no_timing = no_timing, trans = trans};
wenzelm@5828
   305
wenzelm@14923
   306
fun map_transition f (Transition {name, pos, source, int_only, print, no_timing, trans}) =
wenzelm@14923
   307
  make_transition (f (name, pos, source, int_only, print, no_timing, trans));
wenzelm@5828
   308
skalberg@15531
   309
val empty = make_transition ("<unknown>", Position.none, NONE, false, false, false, []);
wenzelm@14923
   310
wenzelm@14923
   311
fun name_of (Transition {name, ...}) = name;
wenzelm@14923
   312
fun source_of (Transition {source, ...}) = source;
wenzelm@5828
   313
wenzelm@5828
   314
wenzelm@5828
   315
(* diagnostics *)
wenzelm@5828
   316
wenzelm@5828
   317
fun str_of_transition (Transition {name, pos, ...}) = quote name ^ Position.str_of pos;
wenzelm@5828
   318
wenzelm@5828
   319
fun command_msg msg tr = msg ^ "command " ^ str_of_transition tr;
wenzelm@5828
   320
fun at_command tr = command_msg "At " tr ^ ".";
wenzelm@5828
   321
wenzelm@5828
   322
fun type_error tr state =
wenzelm@6689
   323
  ERROR_MESSAGE (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
wenzelm@5828
   324
wenzelm@5828
   325
wenzelm@5828
   326
(* modify transitions *)
wenzelm@5828
   327
wenzelm@14923
   328
fun name nm = map_transition (fn (_, pos, source, int_only, print, no_timing, trans) =>
wenzelm@14923
   329
  (nm, pos, source, int_only, print, no_timing, trans));
wenzelm@5828
   330
wenzelm@14923
   331
fun position pos = map_transition (fn (name, _, source, int_only, print, no_timing, trans) =>
wenzelm@14923
   332
  (name, pos, source, int_only, print, no_timing, trans));
wenzelm@9010
   333
wenzelm@14923
   334
fun source src = map_transition (fn (name, pos, _, int_only, print, no_timing, trans) =>
skalberg@15531
   335
  (name, pos, SOME src, int_only, print, no_timing, trans));
wenzelm@5828
   336
wenzelm@14923
   337
fun interactive int_only = map_transition (fn (name, pos, source, _, print, no_timing, trans) =>
wenzelm@14923
   338
  (name, pos, source, int_only, print, no_timing, trans));
wenzelm@14923
   339
wenzelm@14923
   340
val print = map_transition (fn (name, pos, source, int_only, _, no_timing, trans) =>
wenzelm@14923
   341
  (name, pos, source, int_only, true, no_timing, trans));
wenzelm@5828
   342
wenzelm@14923
   343
val no_timing = map_transition (fn (name, pos, source, int_only, print, _, trans) =>
wenzelm@14923
   344
  (name, pos, source, int_only, print, true, trans));
wenzelm@5828
   345
wenzelm@14923
   346
fun add_trans tr = map_transition (fn (name, pos, source, int_only, print, no_timing, trans) =>
wenzelm@14923
   347
  (name, pos, source, int_only, print, no_timing, trans @ [tr]));
wenzelm@5828
   348
wenzelm@5828
   349
wenzelm@5828
   350
(* build transitions *)
wenzelm@5828
   351
wenzelm@5828
   352
val reset = add_trans Reset;
wenzelm@6689
   353
fun init f exit kill = add_trans (Init (f, (exit, kill)));
wenzelm@6689
   354
val exit = add_trans Exit;
wenzelm@6689
   355
val kill = add_trans Kill;
wenzelm@7612
   356
val keep' = add_trans o Keep;
wenzelm@6689
   357
val history = add_trans o History;
wenzelm@5828
   358
val map_current = add_trans o MapCurrent;
wenzelm@6689
   359
val app_current = add_trans o AppCurrent;
wenzelm@5828
   360
wenzelm@7612
   361
fun keep f = add_trans (Keep (fn _ => f));
wenzelm@5828
   362
fun imperative f = keep (fn _ => f ());
wenzelm@5828
   363
wenzelm@6689
   364
fun init_theory f exit kill =
wenzelm@8465
   365
  init (fn int => Theory (f int))
wenzelm@6689
   366
    (fn Theory thy => exit thy | _ => raise UNDEF)
wenzelm@6689
   367
    (fn Theory thy => kill thy | _ => raise UNDEF);
wenzelm@5828
   368
berghofe@15237
   369
(*
berghofe@15237
   370
The skip_proofs flag allows proof scripts to be skipped during interactive
berghofe@15237
   371
proof in order to speed up processing of large theories. While in skipping
berghofe@15237
   372
mode, states are represented as SkipProof (h, thy), where h contains a
berghofe@15237
   373
counter for the number of open proof blocks.
berghofe@15237
   374
*)
berghofe@15237
   375
berghofe@15237
   376
val skip_proofs = ref false;
berghofe@15237
   377
wenzelm@6689
   378
fun theory f = app_current (fn _ => (fn Theory thy => Theory (f thy) | _ => raise UNDEF));
wenzelm@7612
   379
fun theory' f = app_current (fn int => (fn Theory thy => Theory (f int thy) | _ => raise UNDEF));
berghofe@15237
   380
fun theory_to_proof f = app_current (fn int =>
berghofe@15237
   381
  (fn Theory thy =>
berghofe@15237
   382
        if !skip_proofs then SkipProof (History.init (undo_limit int) 0,
berghofe@15237
   383
          fst (SkipProof.global_skip_proof int (ProofHistory.current (f int thy))))
berghofe@15237
   384
        else Proof (f int thy)
berghofe@15237
   385
    | _ => raise UNDEF));
berghofe@15237
   386
fun proof''' b f = map_current (fn int => (fn Proof prf => Proof (f int prf)
berghofe@15237
   387
  | SkipProof (h, thy) => if b then SkipProof (History.apply I h, thy) else raise UNDEF
berghofe@15237
   388
  | _ => raise UNDEF));
berghofe@15237
   389
val proof' = proof''' true;
wenzelm@6689
   390
val proof = proof' o K;
berghofe@15237
   391
val proof'' = proof''' false o K;
wenzelm@12315
   392
fun proof_to_theory' f =
berghofe@15237
   393
  map_current (fn int => (fn Proof prf => Theory (f int prf)
berghofe@15237
   394
    | SkipProof (h, thy) => if History.current h = 0 then Theory thy else raise UNDEF
berghofe@15237
   395
    | _ => raise UNDEF));
wenzelm@12315
   396
val proof_to_theory = proof_to_theory' o K;
berghofe@15237
   397
fun skip_proof f = map_current (fn int =>
berghofe@15237
   398
  (fn SkipProof (h, thy) => SkipProof (f h, thy) | _ => raise UNDEF));
berghofe@15237
   399
fun skip_proof_to_theory p = map_current (fn int =>
berghofe@15237
   400
  (fn SkipProof (h, thy) => if p h then Theory thy else raise UNDEF | _ => raise UNDEF));
wenzelm@5828
   401
wenzelm@9512
   402
val unknown_theory = imperative (fn () => warning "Unknown theory context");
wenzelm@9512
   403
val unknown_proof = imperative (fn () => warning "Unknown proof context");
wenzelm@9512
   404
val unknown_context = imperative (fn () => warning "Unknown context");
wenzelm@9512
   405
wenzelm@5828
   406
wenzelm@5828
   407
wenzelm@5828
   408
(** toplevel transactions **)
wenzelm@5828
   409
wenzelm@7198
   410
val quiet = ref false;
ballarin@15519
   411
val debug = ref false;  (* Verbose messages for core exceptions. *)
wenzelm@5828
   412
wenzelm@5828
   413
(* print exceptions *)
wenzelm@5828
   414
wenzelm@5828
   415
fun raised name = "exception " ^ name ^ " raised";
wenzelm@5828
   416
fun raised_msg name msg = raised name ^ ": " ^ msg;
wenzelm@5828
   417
ballarin@15519
   418
fun msg_on_debug (THM (msg, i, thms)) =
ballarin@15519
   419
     if !debug
ballarin@15519
   420
     then raised_msg ("THM " ^ string_of_int i)
ballarin@15519
   421
       (cat_lines ("" :: msg :: map Display.string_of_thm thms))
ballarin@15519
   422
     else raised_msg "THM" msg
ballarin@15519
   423
  | msg_on_debug (THEORY (msg, thys)) =
ballarin@15519
   424
     if !debug
ballarin@15519
   425
     then raised_msg "THEORY" (cat_lines ("" :: msg ::
ballarin@15519
   426
       map (Pretty.string_of o Display.pretty_theory) thys))
ballarin@15519
   427
     else msg
ballarin@15596
   428
  | msg_on_debug (AST (msg, asts)) =
ballarin@15596
   429
     if !debug
ballarin@15596
   430
     then raised_msg "AST" (cat_lines ("" :: msg ::
ballarin@15596
   431
       map (Pretty.string_of o Syntax.pretty_ast) asts))
ballarin@15596
   432
     else msg
ballarin@15519
   433
  | msg_on_debug (TERM (msg, ts)) =
ballarin@15519
   434
     (case (!debug, Context.get_context ()) of
skalberg@15531
   435
         (true, SOME thy) =>
ballarin@15519
   436
           let val sg = Theory.sign_of thy in
ballarin@15519
   437
             raised_msg "TERM"
ballarin@15519
   438
               (cat_lines
ballarin@15519
   439
                 ("" :: msg :: map (Sign.string_of_term sg) ts))
ballarin@15519
   440
           end
ballarin@15519
   441
       | _ => raised_msg "TERM" msg)
ballarin@15519
   442
  | msg_on_debug (TYPE (msg, Ts, ts)) =
ballarin@15519
   443
     (case (!debug, Context.get_context ()) of
skalberg@15531
   444
         (true, SOME thy) =>
ballarin@15519
   445
           let val sg = Theory.sign_of thy in
ballarin@15519
   446
             raised_msg "TYPE"
ballarin@15519
   447
               (cat_lines
ballarin@15519
   448
                 ("" :: msg :: map (Sign.string_of_typ sg) Ts @
ballarin@15519
   449
                  map (Sign.string_of_term sg) ts))
ballarin@15519
   450
           end
ballarin@15519
   451
       | _ => raised_msg "TYPE" msg)
ballarin@15519
   452
wenzelm@5828
   453
fun exn_message TERMINATE = "Exit."
wenzelm@5990
   454
  | exn_message RESTART = "Restart."
wenzelm@7022
   455
  | exn_message (EXCURSION_FAIL (exn, msg)) = cat_lines [exn_message exn, msg]
wenzelm@6971
   456
  | exn_message Interrupt = "Interrupt."
wenzelm@6002
   457
  | exn_message ERROR = "ERROR."
wenzelm@5828
   458
  | exn_message (ERROR_MESSAGE msg) = msg
ballarin@15519
   459
  | exn_message (THEORY (msg, thys)) = msg_on_debug (THEORY (msg, thys))
wenzelm@5828
   460
  | exn_message (ProofContext.CONTEXT (msg, _)) = msg
wenzelm@5828
   461
  | exn_message (Proof.STATE (msg, _)) = msg
wenzelm@5828
   462
  | exn_message (ProofHistory.FAIL msg) = msg
wenzelm@13486
   463
  | exn_message (MetaSimplifier.SIMPROC_FAIL (name, exn)) =
wenzelm@13486
   464
      fail_message "simproc" ((name, Position.none), exn)
wenzelm@5920
   465
  | exn_message (Attrib.ATTRIB_FAIL info) = fail_message "attribute" info
wenzelm@5920
   466
  | exn_message (Method.METHOD_FAIL info) = fail_message "method" info
wenzelm@12881
   467
  | exn_message (Antiquote.ANTIQUOTE_FAIL info) = fail_message "antiquotation" info
ballarin@15596
   468
  | exn_message (Syntax.AST (msg, asts)) = msg_on_debug (AST (msg, asts))
ballarin@15519
   469
  | exn_message (TYPE (msg, Ts, ts)) = msg_on_debug (TYPE (msg, Ts, ts))
ballarin@15519
   470
  | exn_message (TERM (msg, ts)) = msg_on_debug (TERM (msg, ts))
ballarin@15519
   471
  | exn_message (THM (msg, i, thms)) = msg_on_debug (THM (msg, i, thms))
skalberg@15531
   472
  | exn_message Option = raised "Option"
skalberg@15570
   473
  | exn_message UnequalLengths = raised "UnequalLengths"
ballarin@15598
   474
  | exn_message Empty = raised "Empty"
ballarin@15598
   475
  | exn_message Subscript = raised "Subscript"
wenzelm@5920
   476
  | exn_message exn = General.exnMessage exn
wenzelm@5920
   477
and fail_message kind ((name, pos), exn) =
wenzelm@9152
   478
  "Error in " ^ kind ^ " " ^ quote name ^ Position.str_of pos ^ ":\n" ^ exn_message exn;
wenzelm@5828
   479
skalberg@15531
   480
fun print_exn NONE = ()
skalberg@15531
   481
  | print_exn (SOME (exn, s)) = error_msg (cat_lines [exn_message exn, s]);
wenzelm@5828
   482
wenzelm@5828
   483
wenzelm@5828
   484
(* apply transitions *)
wenzelm@5828
   485
wenzelm@6664
   486
local
wenzelm@6664
   487
wenzelm@9010
   488
fun app int (tr as Transition {trans, int_only, print, no_timing, ...}) state =
wenzelm@5828
   489
  let
wenzelm@5828
   490
    val _ =
wenzelm@5828
   491
      if int orelse not int_only then ()
wenzelm@8722
   492
      else warning (command_msg "Interactive-only " tr);
wenzelm@6689
   493
    val (result, opt_exn) =
wenzelm@14825
   494
      (if ! Output.timing andalso not no_timing then (warning (command_msg "" tr); timeap) else I)
wenzelm@9010
   495
        (apply_trans int trans) state;
wenzelm@8886
   496
    val _ = if int andalso print andalso not (! quiet) then print_state false result else ();
skalberg@15570
   497
  in (result, Option.map (fn UNDEF => type_error tr state | exn => exn) opt_exn) end;
wenzelm@6664
   498
wenzelm@6664
   499
in
wenzelm@5828
   500
wenzelm@6689
   501
fun apply int tr st =
wenzelm@6965
   502
  (case app int tr st of
skalberg@15531
   503
    (_, SOME TERMINATE) => NONE
skalberg@15531
   504
  | (_, SOME RESTART) => SOME (toplevel, NONE)
skalberg@15531
   505
  | (state', SOME (EXCURSION_FAIL exn_info)) => SOME (state', SOME exn_info)
skalberg@15531
   506
  | (state', SOME exn) => SOME (state', SOME (exn, at_command tr))
skalberg@15531
   507
  | (state', NONE) => SOME (state', NONE));
wenzelm@6664
   508
wenzelm@6664
   509
end;
wenzelm@5828
   510
wenzelm@5828
   511
wenzelm@5828
   512
(* excursion: toplevel -- apply transformers -- toplevel *)
wenzelm@5828
   513
wenzelm@6664
   514
local
wenzelm@6664
   515
wenzelm@5828
   516
fun excur [] x = x
wenzelm@9134
   517
  | excur ((tr, f) :: trs) (st, res) =
wenzelm@9134
   518
      (case apply false tr st of
skalberg@15531
   519
        SOME (st', NONE) =>
berghofe@15431
   520
          excur trs (st', transform_error (fn () => f st st' res) () handle exn =>
wenzelm@10324
   521
            raise EXCURSION_FAIL (exn, "Presentation failed\n" ^ at_command tr))
skalberg@15531
   522
      | SOME (st', SOME exn_info) => raise EXCURSION_FAIL exn_info
skalberg@15531
   523
      | NONE => raise EXCURSION_FAIL (TERMINATE, at_command tr));
wenzelm@5828
   524
wenzelm@6664
   525
in
wenzelm@6664
   526
wenzelm@9134
   527
fun excursion_result (trs, res) =
skalberg@15531
   528
  (case excur trs (State NONE, res) of
skalberg@15531
   529
    (State NONE, res') => res'
wenzelm@9134
   530
  | _ => raise ERROR_MESSAGE "Unfinished development at end of input")
wenzelm@9134
   531
  handle exn => error (exn_message exn);
wenzelm@9134
   532
wenzelm@5828
   533
fun excursion trs =
berghofe@15431
   534
  excursion_result (map (fn tr => (tr, fn _ => fn _ => fn _ => ())) trs, ());
wenzelm@7062
   535
wenzelm@6664
   536
end;
wenzelm@6664
   537
wenzelm@5828
   538
wenzelm@5828
   539
wenzelm@5828
   540
(** interactive transformations **)
wenzelm@5828
   541
wenzelm@5828
   542
(* the global state reference *)
wenzelm@5828
   543
skalberg@15531
   544
val global_state = ref (toplevel, NONE: (exn * string) option);
wenzelm@5828
   545
skalberg@15531
   546
fun set_state state = global_state := (state, NONE);
wenzelm@5828
   547
fun get_state () = fst (! global_state);
wenzelm@5828
   548
fun exn () = snd (! global_state);
wenzelm@5828
   549
wenzelm@5828
   550
wenzelm@6965
   551
(* the Isar source of transitions *)
wenzelm@6965
   552
nipkow@14091
   553
type 'a isar =
wenzelm@6965
   554
  (transition, (transition option,
wenzelm@12881
   555
    (OuterLex.token, (OuterLex.token option, (OuterLex.token, (OuterLex.token,
nipkow@14091
   556
      Position.T * (Symbol.symbol, (string, 'a) Source.source) Source.source)
wenzelm@12881
   557
          Source.source) Source.source) Source.source) Source.source) Source.source) Source.source;
wenzelm@6965
   558
wenzelm@6965
   559
wenzelm@5828
   560
(* apply transformers to global state *)
wenzelm@5828
   561
wenzelm@14985
   562
nonfix >> >>>;
wenzelm@5828
   563
wenzelm@5828
   564
fun >> tr =
wenzelm@5828
   565
  (case apply true tr (get_state ()) of
skalberg@15531
   566
    NONE => false
skalberg@15531
   567
  | SOME (state', exn_info) =>
wenzelm@5828
   568
      (global_state := (state', exn_info);
wenzelm@5828
   569
        check_stale state'; print_exn exn_info;
wenzelm@5828
   570
        true));
wenzelm@5828
   571
wenzelm@14985
   572
fun >>> [] = ()
wenzelm@14985
   573
  | >>> (tr :: trs) = if >> tr then >>> trs else ();
wenzelm@14985
   574
wenzelm@7602
   575
(*Note: this is for Poly/ML only, we really do not intend to exhibit
wenzelm@7602
   576
  interrupts here*)
skalberg@15531
   577
fun get_interrupt src = SOME (Source.get_single src) handle Interrupt => NONE;
wenzelm@7602
   578
wenzelm@5828
   579
fun raw_loop src =
wenzelm@7602
   580
  (case get_interrupt (Source.set_prompt (prompt_state (get_state ())) src) of
skalberg@15531
   581
    NONE => (writeln "\nInterrupt."; raw_loop src)
skalberg@15531
   582
  | SOME NONE => ()
skalberg@15531
   583
  | SOME (SOME (tr, src')) => if >> tr then raw_loop src' else ());
wenzelm@5828
   584
wenzelm@5828
   585
wenzelm@12987
   586
fun loop src = ignore_interrupt raw_loop src;
wenzelm@5828
   587
wenzelm@5828
   588
wenzelm@5828
   589
end;