src/Pure/Isar/toplevel.ML
author wenzelm
Tue Oct 18 17:59:37 2005 +0200 (2005-10-18 ago)
changeset 17904 21c6894b5998
parent 17513 0393718c2f1c
child 18563 1df7022eac6f
permissions -rw-r--r--
simplified interfaces proof/proof' etc.: perform ProofHistory.apply(s)/current internally;
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@16815
    10
  datatype node =
wenzelm@17076
    11
    Theory of theory * Proof.context option |
wenzelm@17076
    12
    Proof of ProofHistory.T |
wenzelm@17076
    13
    SkipProof of int History.T * theory
wenzelm@5828
    14
  type state
wenzelm@5828
    15
  val toplevel: state
wenzelm@7732
    16
  val is_toplevel: state -> bool
wenzelm@17076
    17
  val level: state -> int
wenzelm@6689
    18
  exception UNDEF
wenzelm@17266
    19
  val assert: bool -> unit
wenzelm@6689
    20
  val node_history_of: state -> node History.T
wenzelm@5828
    21
  val node_of: state -> node
wenzelm@6664
    22
  val node_case: (theory -> 'a) -> (Proof.state -> 'a) -> state -> 'a
wenzelm@5828
    23
  val theory_of: state -> theory
wenzelm@16452
    24
  val sign_of: state -> theory    (*obsolete*)
wenzelm@17076
    25
  val body_context_of: state -> Proof.context
wenzelm@17208
    26
  val no_body_context: state -> state
wenzelm@5828
    27
  val proof_of: state -> Proof.state
wenzelm@17076
    28
  val is_proof: state -> bool
wenzelm@9453
    29
  val enter_forward_proof: state -> Proof.state
wenzelm@16815
    30
  val prompt_state_default: state -> string
wenzelm@16815
    31
  val prompt_state_fn: (state -> string) ref
wenzelm@16815
    32
  val print_state_context: state -> unit
wenzelm@16815
    33
  val print_state_default: bool -> state -> unit
wenzelm@16815
    34
  val print_state_hook: (bool -> state -> unit) -> unit
wenzelm@16815
    35
  val print_state_fn: (bool -> state -> unit) ref
wenzelm@16815
    36
  val print_state: bool -> state -> unit
wenzelm@16815
    37
  val pretty_state: bool -> state -> Pretty.T list
wenzelm@16682
    38
  val quiet: bool ref
wenzelm@16682
    39
  val debug: bool ref
wenzelm@17321
    40
  val interact: bool ref
wenzelm@16682
    41
  val timing: bool ref
wenzelm@16682
    42
  val profiling: int ref
wenzelm@16815
    43
  val skip_proofs: bool ref
wenzelm@5828
    44
  exception TERMINATE
wenzelm@5990
    45
  exception RESTART
wenzelm@16682
    46
  type transition
wenzelm@6689
    47
  val undo_limit: bool -> int option
wenzelm@5828
    48
  val empty: transition
wenzelm@14923
    49
  val name_of: transition -> string
wenzelm@14923
    50
  val source_of: transition -> OuterLex.token list option
wenzelm@5828
    51
  val name: string -> transition -> transition
wenzelm@5828
    52
  val position: Position.T -> transition -> transition
wenzelm@14923
    53
  val source: OuterLex.token list -> transition -> transition
wenzelm@5828
    54
  val interactive: bool -> transition -> transition
wenzelm@5828
    55
  val print: transition -> transition
wenzelm@16607
    56
  val print': string -> transition -> transition
wenzelm@17363
    57
  val three_buffersN: string
wenzelm@17363
    58
  val print3: transition -> transition
wenzelm@9010
    59
  val no_timing: transition -> transition
wenzelm@5828
    60
  val reset: transition -> transition
wenzelm@8465
    61
  val init: (bool -> node) -> (node -> unit) -> (node -> unit) -> transition -> transition
wenzelm@6689
    62
  val exit: transition -> transition
wenzelm@6689
    63
  val kill: transition -> transition
wenzelm@5828
    64
  val keep: (state -> unit) -> transition -> transition
wenzelm@7612
    65
  val keep': (bool -> state -> unit) -> transition -> transition
wenzelm@6689
    66
  val history: (node History.T -> node History.T) -> transition -> transition
wenzelm@5828
    67
  val imperative: (unit -> unit) -> transition -> transition
wenzelm@7105
    68
  val init_theory: (bool -> theory) -> (theory -> unit) -> (theory -> unit)
wenzelm@6689
    69
    -> transition -> transition
wenzelm@5828
    70
  val theory: (theory -> theory) -> transition -> transition
wenzelm@7612
    71
  val theory': (bool -> theory -> theory) -> transition -> transition
wenzelm@17076
    72
  val theory_context: (theory -> theory * Proof.context) -> transition -> transition
wenzelm@17363
    73
  val theory_to_proof: (theory -> Proof.state) -> transition -> transition
wenzelm@17904
    74
  val proof: (Proof.state -> Proof.state) -> transition -> transition
wenzelm@17904
    75
  val proofs: (Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@17904
    76
  val proof': (bool -> Proof.state -> Proof.state) -> transition -> transition
wenzelm@17904
    77
  val proofs': (bool -> Proof.state -> Proof.state Seq.seq) -> transition -> transition
wenzelm@16815
    78
  val actual_proof: (ProofHistory.T -> ProofHistory.T) -> transition -> transition
wenzelm@16815
    79
  val skip_proof: (int History.T -> int History.T) -> transition -> transition
wenzelm@17904
    80
  val proof_to_theory: (Proof.state -> theory) -> transition -> transition
wenzelm@17904
    81
  val proof_to_theory': (bool -> Proof.state -> theory) -> transition -> transition
wenzelm@17904
    82
  val proof_to_theory_context: (bool -> Proof.state -> theory * Proof.context)
wenzelm@17076
    83
    -> transition -> transition
wenzelm@17904
    84
  val skip_proof_to_theory: (int -> bool) -> transition -> transition
wenzelm@9512
    85
  val unknown_theory: transition -> transition
wenzelm@9512
    86
  val unknown_proof: transition -> transition
wenzelm@9512
    87
  val unknown_context: transition -> transition
wenzelm@5922
    88
  val exn_message: exn -> string
wenzelm@5828
    89
  val apply: bool -> transition -> state -> (state * (exn * string) option) option
wenzelm@17266
    90
  val command: transition -> state -> state
wenzelm@17076
    91
  val present_excursion: (transition * (state -> state -> 'a -> 'a)) list -> 'a -> 'a
wenzelm@5828
    92
  val excursion: transition list -> unit
wenzelm@5828
    93
  val set_state: state -> unit
wenzelm@5828
    94
  val get_state: unit -> state
wenzelm@5828
    95
  val exn: unit -> (exn * string) option
wenzelm@5828
    96
  val >> : transition -> bool
wenzelm@14985
    97
  val >>> : transition list -> unit
nipkow@14091
    98
  type 'a isar
nipkow@14091
    99
  val loop: 'a isar -> unit
wenzelm@5828
   100
end;
wenzelm@5828
   101
wenzelm@6965
   102
structure Toplevel: TOPLEVEL =
wenzelm@5828
   103
struct
wenzelm@5828
   104
wenzelm@5828
   105
wenzelm@5828
   106
(** toplevel state **)
wenzelm@5828
   107
wenzelm@16815
   108
(* datatype state *)
wenzelm@5828
   109
wenzelm@5828
   110
datatype node =
wenzelm@17076
   111
  Theory of theory * Proof.context option |  (*theory with optional body context*)
wenzelm@17076
   112
  Proof of ProofHistory.T |                  (*history of proof states*)
wenzelm@17076
   113
  SkipProof of int History.T * theory;       (*history of proof depths*)
wenzelm@5828
   114
wenzelm@8465
   115
datatype state = State of (node History.T * ((node -> unit) * (node -> unit))) option;
wenzelm@5828
   116
skalberg@15531
   117
val toplevel = State NONE;
wenzelm@5828
   118
skalberg@15531
   119
fun is_toplevel (State NONE) = true
wenzelm@7732
   120
  | is_toplevel _ = false;
wenzelm@7732
   121
wenzelm@17076
   122
fun level (State NONE) = 0
wenzelm@17076
   123
  | level (State (SOME (node, _))) =
wenzelm@17076
   124
      (case History.current node of
wenzelm@17076
   125
        Theory _ => 0
wenzelm@17076
   126
      | Proof prf => Proof.level (ProofHistory.current prf)
wenzelm@17076
   127
      | SkipProof (h, _) => History.current h + 1);    (*different notion of proof depth!*)
wenzelm@17076
   128
skalberg@15531
   129
fun str_of_state (State NONE) = "at top level"
wenzelm@16815
   130
  | str_of_state (State (SOME (node, _))) =
wenzelm@16815
   131
      (case History.current node of
wenzelm@16815
   132
        Theory _ => "in theory mode"
wenzelm@16815
   133
      | Proof _ => "in proof mode"
wenzelm@16815
   134
      | SkipProof _ => "in skipped proof mode");
wenzelm@5946
   135
wenzelm@5946
   136
wenzelm@5828
   137
(* top node *)
wenzelm@5828
   138
wenzelm@6689
   139
exception UNDEF;
wenzelm@6689
   140
wenzelm@17266
   141
fun assert true = ()
wenzelm@17266
   142
  | assert false = raise UNDEF;
wenzelm@17266
   143
skalberg@15531
   144
fun node_history_of (State NONE) = raise UNDEF
skalberg@15531
   145
  | node_history_of (State (SOME (node, _))) = node;
wenzelm@6689
   146
wenzelm@6689
   147
val node_of = History.current o node_history_of;
wenzelm@5828
   148
wenzelm@6664
   149
fun node_case f g state =
wenzelm@5828
   150
  (case node_of state of
wenzelm@17076
   151
    Theory (thy, _) => f thy
wenzelm@16815
   152
  | Proof prf => g (ProofHistory.current prf)
wenzelm@16815
   153
  | SkipProof (_, thy) => f thy);
wenzelm@5828
   154
wenzelm@6664
   155
val theory_of = node_case I Proof.theory_of;
wenzelm@16452
   156
val sign_of = theory_of;
wenzelm@17076
   157
wenzelm@17076
   158
fun body_context_of state =
wenzelm@17076
   159
  (case node_of state of
wenzelm@17076
   160
    Theory (_, SOME ctxt) => ctxt
wenzelm@17076
   161
  | _ => node_case ProofContext.init Proof.context_of state);
wenzelm@17076
   162
wenzelm@17208
   163
fun no_body_context (State NONE) = State NONE
wenzelm@17208
   164
  | no_body_context (State (SOME (node, x))) =
wenzelm@17208
   165
      State (SOME (History.apply (fn Theory (thy, _) => Theory (thy, NONE) | nd => nd) node, x));
wenzelm@17208
   166
wenzelm@6664
   167
val proof_of = node_case (fn _ => raise UNDEF) I;
wenzelm@17076
   168
val is_proof = can proof_of;
wenzelm@6664
   169
wenzelm@17363
   170
val enter_forward_proof = node_case (Proof.init o ProofContext.init) Proof.enter_forward;
wenzelm@5828
   171
wenzelm@5828
   172
wenzelm@16815
   173
(* prompt state *)
wenzelm@16815
   174
wenzelm@16815
   175
fun prompt_state_default (State _) = Source.default_prompt;
wenzelm@16815
   176
wenzelm@16815
   177
val prompt_state_fn = ref prompt_state_default;
wenzelm@16815
   178
fun prompt_state state = ! prompt_state_fn state;
wenzelm@16815
   179
wenzelm@16815
   180
wenzelm@16815
   181
(* print state *)
wenzelm@16815
   182
wenzelm@16815
   183
fun pretty_context thy = [Pretty.block
wenzelm@16815
   184
  [Pretty.str "theory", Pretty.brk 1, Pretty.str (Context.theory_name thy),
wenzelm@16815
   185
    Pretty.str " =", Pretty.brk 1, ThyInfo.pretty_theory thy]];
wenzelm@16815
   186
wenzelm@16815
   187
fun pretty_state_context state =
wenzelm@16815
   188
  (case try theory_of state of NONE => []
wenzelm@16815
   189
  | SOME thy => pretty_context thy);
wenzelm@16815
   190
wenzelm@17076
   191
fun pretty_node prf_only (Theory (thy, _)) = if prf_only then [] else pretty_context thy
wenzelm@16815
   192
  | pretty_node _ (Proof prf) =
wenzelm@16815
   193
      Proof.pretty_state (ProofHistory.position prf) (ProofHistory.current prf)
wenzelm@16815
   194
  | pretty_node _ (SkipProof (h, _)) =
wenzelm@16815
   195
      [Pretty.str ("skipped proof: depth " ^ string_of_int (History.current h))];
wenzelm@16815
   196
wenzelm@16815
   197
fun pretty_state prf_only state =
wenzelm@16815
   198
  let val ref (begin_state, end_state, _) = Display.current_goals_markers in
wenzelm@16815
   199
    (case try node_of state of NONE => []
wenzelm@16815
   200
    | SOME node =>
wenzelm@16815
   201
        (if begin_state = "" then [] else [Pretty.str begin_state]) @
wenzelm@16815
   202
        pretty_node prf_only node @
wenzelm@16815
   203
        (if end_state = "" then [] else [Pretty.str end_state]))
wenzelm@16815
   204
  end;
wenzelm@16815
   205
wenzelm@16815
   206
val print_state_context = Pretty.writelns o pretty_state_context;
wenzelm@16815
   207
fun print_state_default prf_only state = Pretty.writelns (pretty_state prf_only state);
wenzelm@16815
   208
wenzelm@16815
   209
val print_state_hooks = ref ([]: (bool -> state -> unit) list);
wenzelm@16815
   210
fun print_state_hook f = change print_state_hooks (cons f);
wenzelm@16815
   211
val print_state_fn = ref print_state_default;
wenzelm@16815
   212
wenzelm@16815
   213
fun print_state prf_only state =
wenzelm@16815
   214
 (List.app (fn f => (try (fn () => f prf_only state) (); ())) (! print_state_hooks);
wenzelm@16815
   215
  ! print_state_fn prf_only state);
wenzelm@16815
   216
wenzelm@16815
   217
wenzelm@15668
   218
wenzelm@5828
   219
(** toplevel transitions **)
wenzelm@5828
   220
wenzelm@16682
   221
val quiet = ref false;
wenzelm@16682
   222
val debug = ref false;
wenzelm@17321
   223
val interact = ref false;
wenzelm@16682
   224
val timing = Output.timing;
wenzelm@16682
   225
val profiling = ref 0;
wenzelm@16815
   226
val skip_proofs = ref false;
wenzelm@16682
   227
wenzelm@5828
   228
exception TERMINATE;
wenzelm@5990
   229
exception RESTART;
wenzelm@7022
   230
exception EXCURSION_FAIL of exn * string;
wenzelm@6689
   231
exception FAILURE of state * exn;
wenzelm@5828
   232
wenzelm@5828
   233
wenzelm@16815
   234
(* node transactions and recovery from stale theories *)
wenzelm@6689
   235
wenzelm@16815
   236
(*NB: proof commands should be non-destructive!*)
wenzelm@7022
   237
wenzelm@6689
   238
local
wenzelm@6689
   239
wenzelm@16452
   240
fun is_stale state = Context.is_stale (theory_of state) handle UNDEF => false;
wenzelm@6689
   241
wenzelm@16815
   242
val stale_theory = ERROR_MESSAGE "Stale theory encountered after succesful execution!";
wenzelm@16815
   243
wenzelm@17076
   244
fun checkpoint_node true (Theory (thy, ctxt)) = Theory (Theory.checkpoint thy, ctxt)
wenzelm@6689
   245
  | checkpoint_node _ node = node;
wenzelm@6689
   246
wenzelm@17076
   247
fun copy_node true (Theory (thy, ctxt)) = Theory (Theory.copy thy, ctxt)
wenzelm@6689
   248
  | copy_node _ node = node;
wenzelm@6689
   249
skalberg@15531
   250
fun return (result, NONE) = result
skalberg@15531
   251
  | return (result, SOME exn) = raise FAILURE (result, exn);
wenzelm@7022
   252
wenzelm@16729
   253
fun debug_trans f x =
wenzelm@16729
   254
  if ! debug then
wenzelm@16815
   255
    setmp Output.transform_exceptions false
wenzelm@16815
   256
      exception_trace (fn () => f x)
wenzelm@16729
   257
  else f x;
wenzelm@16729
   258
wenzelm@16729
   259
fun interruptible f x =
wenzelm@16729
   260
  let val y = ref x
wenzelm@16729
   261
  in raise_interrupt (fn () => y := f x) (); ! y end;
wenzelm@16729
   262
wenzelm@6689
   263
in
wenzelm@6689
   264
wenzelm@16815
   265
fun transaction _ _ _ (State NONE) = raise UNDEF
wenzelm@16815
   266
  | transaction int hist f (State (SOME (node, term))) =
wenzelm@6689
   267
      let
wenzelm@16046
   268
        val cont_node = History.map (checkpoint_node int) node;
wenzelm@16046
   269
        val back_node = History.map (copy_node int) cont_node;
wenzelm@16729
   270
        fun state nd = State (SOME (nd, term));
wenzelm@16729
   271
        fun normal_state nd = (state nd, NONE);
wenzelm@16729
   272
        fun error_state nd exn = (state nd, SOME exn);
wenzelm@6689
   273
wenzelm@16729
   274
        val (result, err) =
wenzelm@16729
   275
          cont_node
wenzelm@16729
   276
          |> ((fn nd => f int nd)
wenzelm@16729
   277
              |> (if hist then History.apply_copy (copy_node int) else History.map)
wenzelm@16729
   278
              |> debug_trans
wenzelm@16729
   279
              |> interruptible
wenzelm@16729
   280
              |> transform_error)
wenzelm@16729
   281
          |> normal_state
wenzelm@16729
   282
          handle exn => error_state cont_node exn;
wenzelm@6689
   283
      in
wenzelm@16729
   284
        if is_stale result
wenzelm@16729
   285
        then return (error_state back_node (if_none err stale_theory))
wenzelm@16729
   286
        else return (result, err)
wenzelm@6689
   287
      end;
wenzelm@6689
   288
wenzelm@6689
   289
end;
wenzelm@6689
   290
wenzelm@6689
   291
wenzelm@6689
   292
(* primitive transitions *)
wenzelm@6689
   293
wenzelm@16815
   294
(*NB: recovery from stale theories is provided only for theory-level
wenzelm@16815
   295
  operations via MapCurrent and AppCurrent.  Other node or state
wenzelm@16815
   296
  operations should not touch theories at all.
wenzelm@6965
   297
wenzelm@16815
   298
  Interrupts are enabled only for Keep, MapCurrent, and AppCurrent.*)
wenzelm@5828
   299
wenzelm@5828
   300
datatype trans =
wenzelm@6689
   301
  Reset |                                       (*empty toplevel*)
wenzelm@8465
   302
  Init of (bool -> node) * ((node -> unit) * (node -> unit)) |
wenzelm@8465
   303
    (*init node; provide exit/kill operation*)
wenzelm@8465
   304
  Exit |                                        (*conclude node*)
wenzelm@6689
   305
  Kill |                                        (*abort node*)
wenzelm@7612
   306
  Keep of bool -> state -> unit |               (*peek at state*)
wenzelm@6689
   307
  History of node History.T -> node History.T | (*history operation (undo etc.)*)
wenzelm@6689
   308
  MapCurrent of bool -> node -> node |          (*change node, bypassing history*)
wenzelm@6689
   309
  AppCurrent of bool -> node -> node;           (*change node, recording history*)
wenzelm@6689
   310
skalberg@15531
   311
fun undo_limit int = if int then NONE else SOME 0;
wenzelm@6689
   312
wenzelm@6689
   313
local
wenzelm@5828
   314
wenzelm@6689
   315
fun apply_tr _ Reset _ = toplevel
skalberg@15531
   316
  | apply_tr int (Init (f, term)) (State NONE) =
skalberg@15531
   317
      State (SOME (History.init (undo_limit int) (f int), term))
skalberg@15531
   318
  | apply_tr _ (Init _ ) (State (SOME _)) = raise UNDEF
skalberg@15531
   319
  | apply_tr _ Exit (State NONE) = raise UNDEF
skalberg@15531
   320
  | apply_tr _ Exit (State (SOME (node, (exit, _)))) =
skalberg@15531
   321
      (exit (History.current node); State NONE)
skalberg@15531
   322
  | apply_tr _ Kill (State NONE) = raise UNDEF
skalberg@15531
   323
  | apply_tr _ Kill (State (SOME (node, (_, kill)))) =
skalberg@15531
   324
      (kill (History.current node); State NONE)
wenzelm@12987
   325
  | apply_tr int (Keep f) state = (raise_interrupt (f int) state; state)
skalberg@15531
   326
  | apply_tr _ (History _) (State NONE) = raise UNDEF
skalberg@15531
   327
  | apply_tr _ (History f) (State (SOME (node, term))) = State (SOME (f node, term))
wenzelm@16815
   328
  | apply_tr int (MapCurrent f) state = transaction int false f state
wenzelm@16815
   329
  | apply_tr int (AppCurrent f) state = transaction int true f state;
wenzelm@5828
   330
wenzelm@6689
   331
fun apply_union _ [] state = raise FAILURE (state, UNDEF)
wenzelm@6689
   332
  | apply_union int (tr :: trs) state =
wenzelm@6689
   333
      transform_error (apply_tr int tr) state
wenzelm@6689
   334
        handle UNDEF => apply_union int trs state
wenzelm@6689
   335
          | FAILURE (alt_state, UNDEF) => apply_union int trs alt_state
wenzelm@6689
   336
          | exn as FAILURE _ => raise exn
wenzelm@6689
   337
          | exn => raise FAILURE (state, exn);
wenzelm@6689
   338
wenzelm@6689
   339
in
wenzelm@6689
   340
skalberg@15531
   341
fun apply_trans int trs state = (apply_union int trs state, NONE)
skalberg@15531
   342
  handle FAILURE (alt_state, exn) => (alt_state, SOME exn) | exn => (state, SOME exn);
wenzelm@6689
   343
wenzelm@6689
   344
end;
wenzelm@5828
   345
wenzelm@5828
   346
wenzelm@5828
   347
(* datatype transition *)
wenzelm@5828
   348
wenzelm@5828
   349
datatype transition = Transition of
wenzelm@16815
   350
 {name: string,                        (*command name*)
wenzelm@16815
   351
  pos: Position.T,                     (*source position*)
wenzelm@16815
   352
  source: OuterLex.token list option,  (*source text*)
wenzelm@16815
   353
  int_only: bool,                      (*interactive-only*)
wenzelm@16815
   354
  print: string list,                  (*print modes (union)*)
wenzelm@16815
   355
  no_timing: bool,                     (*suppress timing*)
wenzelm@16815
   356
  trans: trans list};                  (*primitive transitions (union)*)
wenzelm@5828
   357
wenzelm@14923
   358
fun make_transition (name, pos, source, int_only, print, no_timing, trans) =
wenzelm@14923
   359
  Transition {name = name, pos = pos, source = source,
wenzelm@14923
   360
    int_only = int_only, print = print, no_timing = no_timing, trans = trans};
wenzelm@5828
   361
wenzelm@14923
   362
fun map_transition f (Transition {name, pos, source, int_only, print, no_timing, trans}) =
wenzelm@14923
   363
  make_transition (f (name, pos, source, int_only, print, no_timing, trans));
wenzelm@5828
   364
wenzelm@16607
   365
val empty = make_transition ("<unknown>", Position.none, NONE, false, [], false, []);
wenzelm@14923
   366
wenzelm@14923
   367
fun name_of (Transition {name, ...}) = name;
wenzelm@14923
   368
fun source_of (Transition {source, ...}) = source;
wenzelm@5828
   369
wenzelm@5828
   370
wenzelm@5828
   371
(* diagnostics *)
wenzelm@5828
   372
wenzelm@5828
   373
fun str_of_transition (Transition {name, pos, ...}) = quote name ^ Position.str_of pos;
wenzelm@5828
   374
wenzelm@5828
   375
fun command_msg msg tr = msg ^ "command " ^ str_of_transition tr;
wenzelm@5828
   376
fun at_command tr = command_msg "At " tr ^ ".";
wenzelm@5828
   377
wenzelm@5828
   378
fun type_error tr state =
wenzelm@6689
   379
  ERROR_MESSAGE (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
wenzelm@5828
   380
wenzelm@5828
   381
wenzelm@5828
   382
(* modify transitions *)
wenzelm@5828
   383
wenzelm@14923
   384
fun name nm = map_transition (fn (_, pos, source, int_only, print, no_timing, trans) =>
wenzelm@14923
   385
  (nm, pos, source, int_only, print, no_timing, trans));
wenzelm@5828
   386
wenzelm@14923
   387
fun position pos = map_transition (fn (name, _, source, int_only, print, no_timing, trans) =>
wenzelm@14923
   388
  (name, pos, source, int_only, print, no_timing, trans));
wenzelm@9010
   389
wenzelm@14923
   390
fun source src = map_transition (fn (name, pos, _, int_only, print, no_timing, trans) =>
skalberg@15531
   391
  (name, pos, SOME src, int_only, print, no_timing, trans));
wenzelm@5828
   392
wenzelm@14923
   393
fun interactive int_only = map_transition (fn (name, pos, source, _, print, no_timing, trans) =>
wenzelm@14923
   394
  (name, pos, source, int_only, print, no_timing, trans));
wenzelm@14923
   395
wenzelm@17363
   396
val no_timing = map_transition (fn (name, pos, source, int_only, print, _, trans) =>
wenzelm@17363
   397
  (name, pos, source, int_only, print, true, trans));
wenzelm@17363
   398
wenzelm@17363
   399
fun add_trans tr = map_transition (fn (name, pos, source, int_only, print, no_timing, trans) =>
wenzelm@17363
   400
  (name, pos, source, int_only, print, no_timing, trans @ [tr]));
wenzelm@17363
   401
wenzelm@16607
   402
fun print' mode = map_transition (fn (name, pos, source, int_only, print, no_timing, trans) =>
wenzelm@16607
   403
  (name, pos, source, int_only, insert (op =) mode print, no_timing, trans));
wenzelm@16607
   404
wenzelm@16607
   405
val print = print' "";
wenzelm@5828
   406
wenzelm@17363
   407
val three_buffersN = "three_buffers";
wenzelm@17363
   408
val print3 = print' three_buffersN;
wenzelm@5828
   409
wenzelm@5828
   410
wenzelm@5828
   411
(* build transitions *)
wenzelm@5828
   412
wenzelm@5828
   413
val reset = add_trans Reset;
wenzelm@6689
   414
fun init f exit kill = add_trans (Init (f, (exit, kill)));
wenzelm@6689
   415
val exit = add_trans Exit;
wenzelm@6689
   416
val kill = add_trans Kill;
wenzelm@7612
   417
val keep' = add_trans o Keep;
wenzelm@6689
   418
val history = add_trans o History;
wenzelm@5828
   419
val map_current = add_trans o MapCurrent;
wenzelm@6689
   420
val app_current = add_trans o AppCurrent;
wenzelm@5828
   421
wenzelm@7612
   422
fun keep f = add_trans (Keep (fn _ => f));
wenzelm@5828
   423
fun imperative f = keep (fn _ => f ());
wenzelm@5828
   424
wenzelm@6689
   425
fun init_theory f exit kill =
wenzelm@17076
   426
  init (fn int => Theory (f int, NONE))
wenzelm@17076
   427
    (fn Theory (thy, _) => exit thy | _ => raise UNDEF)
wenzelm@17076
   428
    (fn Theory (thy, _) => kill thy | _ => raise UNDEF);
wenzelm@5828
   429
wenzelm@15668
   430
wenzelm@15668
   431
(* typed transitions *)
wenzelm@15668
   432
wenzelm@17076
   433
fun theory f = app_current (K (fn Theory (thy, _) => Theory (f thy, NONE) | _ => raise UNDEF));
wenzelm@17076
   434
fun theory' f = app_current (fn int =>
wenzelm@17076
   435
  (fn Theory (thy, _) => Theory (f int thy, NONE) | _ => raise UNDEF));
wenzelm@17076
   436
wenzelm@17076
   437
fun theory_context f =
wenzelm@17076
   438
  app_current (K (fn Theory (thy, _) => Theory (apsnd SOME (f thy)) | _ => raise UNDEF));
wenzelm@15668
   439
berghofe@15237
   440
fun theory_to_proof f = app_current (fn int =>
wenzelm@17076
   441
  (fn Theory (thy, _) =>
wenzelm@17452
   442
      let val st = f thy in
wenzelm@17452
   443
        if Theory.eq_thy (thy, Proof.theory_of st) then ()
wenzelm@17452
   444
        else error "Theory changed at start of proof";
wenzelm@17452
   445
        if ! skip_proofs then
wenzelm@17452
   446
          SkipProof (History.init (undo_limit int) 0, #1 (Proof.global_skip_proof int st))
wenzelm@17452
   447
        else Proof (ProofHistory.init (undo_limit int) st)
wenzelm@17452
   448
      end
berghofe@15237
   449
    | _ => raise UNDEF));
wenzelm@15668
   450
wenzelm@17904
   451
fun proofs' f = map_current (fn int =>
wenzelm@17904
   452
  (fn Proof prf => Proof (ProofHistory.applys (f int) prf)
wenzelm@17904
   453
    | SkipProof (h, thy) => SkipProof (History.apply I h, thy)
wenzelm@16815
   454
    | _ => raise UNDEF));
wenzelm@15668
   455
wenzelm@17904
   456
fun proof' f = proofs' (Seq.single oo f);
wenzelm@17904
   457
val proofs = proofs' o K;
wenzelm@6689
   458
val proof = proof' o K;
wenzelm@16815
   459
wenzelm@16815
   460
fun actual_proof f = map_current (fn _ =>
wenzelm@16815
   461
  (fn Proof prf => Proof (f prf) | _ => raise UNDEF));
wenzelm@16815
   462
wenzelm@16815
   463
fun skip_proof f = map_current (fn _ =>
wenzelm@16815
   464
  (fn SkipProof (h, thy) => SkipProof (f h, thy) | _ => raise UNDEF));
wenzelm@15668
   465
wenzelm@17904
   466
fun end_proof f = map_current (fn int =>
wenzelm@17904
   467
  (fn Proof prf => Theory (f int (ProofHistory.current prf))
wenzelm@17076
   468
    | SkipProof (h, thy) => if History.current h = 0 then Theory (thy, NONE) else raise UNDEF
berghofe@15237
   469
    | _ => raise UNDEF));
wenzelm@15668
   470
wenzelm@17076
   471
fun proof_to_theory' f = end_proof (rpair NONE oo f);
wenzelm@17076
   472
fun proof_to_theory f = proof_to_theory' (K f);
wenzelm@17115
   473
fun proof_to_theory_context f = end_proof (apsnd SOME oo f);
wenzelm@15668
   474
wenzelm@16815
   475
fun skip_proof_to_theory p = map_current (fn _ =>
wenzelm@17904
   476
  (fn SkipProof (h, thy) =>
wenzelm@17904
   477
    if p (History.current h) then Theory (thy, NONE)
wenzelm@17904
   478
    else raise UNDEF
wenzelm@17904
   479
  | _ => raise UNDEF));
wenzelm@5828
   480
wenzelm@9512
   481
val unknown_theory = imperative (fn () => warning "Unknown theory context");
wenzelm@9512
   482
val unknown_proof = imperative (fn () => warning "Unknown proof context");
wenzelm@9512
   483
val unknown_context = imperative (fn () => warning "Unknown context");
wenzelm@9512
   484
wenzelm@5828
   485
wenzelm@5828
   486
wenzelm@5828
   487
(** toplevel transactions **)
wenzelm@5828
   488
wenzelm@5828
   489
(* print exceptions *)
wenzelm@5828
   490
wenzelm@15668
   491
local
wenzelm@15668
   492
wenzelm@15668
   493
fun with_context f xs =
wenzelm@15668
   494
  (case Context.get_context () of NONE => []
wenzelm@16452
   495
  | SOME thy => map (f thy) xs);
wenzelm@15668
   496
wenzelm@15668
   497
fun raised name [] = "exception " ^ name ^ " raised"
wenzelm@15668
   498
  | raised name [msg] = "exception " ^ name ^ " raised: " ^ msg
wenzelm@15668
   499
  | raised name msgs = cat_lines (("exception " ^ name ^ " raised:") :: msgs);
wenzelm@5828
   500
wenzelm@15668
   501
fun exn_msg _ TERMINATE = "Exit."
wenzelm@15668
   502
  | exn_msg _ RESTART = "Restart."
wenzelm@15668
   503
  | exn_msg _ Interrupt = "Interrupt."
wenzelm@15668
   504
  | exn_msg _ ERROR = "ERROR."
wenzelm@15668
   505
  | exn_msg _ (ERROR_MESSAGE msg) = msg
wenzelm@17363
   506
  | exn_msg detailed (EXCEPTION (exn, msg)) = cat_lines [exn_msg detailed exn, msg]
wenzelm@16452
   507
  | exn_msg detailed (EXCURSION_FAIL (exn, msg)) = cat_lines [exn_msg detailed exn, msg]
wenzelm@15668
   508
  | exn_msg false (THEORY (msg, _)) = msg
wenzelm@16452
   509
  | exn_msg true (THEORY (msg, thys)) = raised "THEORY" (msg :: map Context.str_of_thy thys)
wenzelm@15668
   510
  | exn_msg _ (ProofContext.CONTEXT (msg, _)) = msg
wenzelm@15668
   511
  | exn_msg _ (Proof.STATE (msg, _)) = msg
wenzelm@15668
   512
  | exn_msg _ (ProofHistory.FAIL msg) = msg
wenzelm@15668
   513
  | exn_msg detailed (MetaSimplifier.SIMPROC_FAIL (name, exn)) =
wenzelm@15668
   514
      fail_msg detailed "simproc" ((name, Position.none), exn)
wenzelm@15668
   515
  | exn_msg detailed (Attrib.ATTRIB_FAIL info) = fail_msg detailed "attribute" info
wenzelm@15668
   516
  | exn_msg detailed (Method.METHOD_FAIL info) = fail_msg detailed "method" info
wenzelm@15668
   517
  | exn_msg detailed (Antiquote.ANTIQUOTE_FAIL info) = fail_msg detailed "antiquotation" info
wenzelm@15668
   518
  | exn_msg false (Syntax.AST (msg, _)) = raised "AST" [msg]
wenzelm@15668
   519
  | exn_msg true (Syntax.AST (msg, asts)) =
wenzelm@15668
   520
      raised "AST" (msg :: map (Pretty.string_of o Syntax.pretty_ast) asts)
wenzelm@15668
   521
  | exn_msg false (TYPE (msg, _, _)) = raised "TYPE" [msg]
wenzelm@15668
   522
  | exn_msg true (TYPE (msg, Ts, ts)) = raised "TYPE" (msg ::
wenzelm@15668
   523
        with_context Sign.string_of_typ Ts @ with_context Sign.string_of_term ts)
wenzelm@15668
   524
  | exn_msg false (TERM (msg, _)) = raised "TERM" [msg]
wenzelm@15668
   525
  | exn_msg true (TERM (msg, ts)) = raised "TERM" (msg :: with_context Sign.string_of_term ts)
wenzelm@15668
   526
  | exn_msg false (THM (msg, _, _)) = raised "THM" [msg]
wenzelm@15668
   527
  | exn_msg true (THM (msg, i, thms)) =
wenzelm@15668
   528
      raised ("THM " ^ string_of_int i) (msg :: map Display.string_of_thm thms)
wenzelm@15668
   529
  | exn_msg _ Option = raised "Option" []
wenzelm@15668
   530
  | exn_msg _ UnequalLengths = raised "UnequalLengths" []
wenzelm@15668
   531
  | exn_msg _ Empty = raised "Empty" []
wenzelm@15668
   532
  | exn_msg _ Subscript = raised "Subscript" []
wenzelm@16197
   533
  | exn_msg _ (Fail msg) = raised "Fail" [msg]
wenzelm@15668
   534
  | exn_msg _ exn = General.exnMessage exn
wenzelm@15668
   535
and fail_msg detailed kind ((name, pos), exn) =
wenzelm@15668
   536
  "Error in " ^ kind ^ " " ^ quote name ^ Position.str_of pos ^ ":\n" ^ exn_msg detailed exn;
ballarin@15519
   537
wenzelm@15668
   538
in
wenzelm@15668
   539
wenzelm@15668
   540
fun exn_message exn = exn_msg (! debug) exn;
wenzelm@5828
   541
skalberg@15531
   542
fun print_exn NONE = ()
skalberg@15531
   543
  | print_exn (SOME (exn, s)) = error_msg (cat_lines [exn_message exn, s]);
wenzelm@5828
   544
wenzelm@15668
   545
end;
wenzelm@15668
   546
wenzelm@5828
   547
wenzelm@5828
   548
(* apply transitions *)
wenzelm@5828
   549
wenzelm@6664
   550
local
wenzelm@6664
   551
wenzelm@9010
   552
fun app int (tr as Transition {trans, int_only, print, no_timing, ...}) state =
wenzelm@5828
   553
  let
wenzelm@16682
   554
    val _ = conditional (not int andalso int_only) (fn () =>
wenzelm@16682
   555
      warning (command_msg "Interactive-only " tr));
wenzelm@16682
   556
wenzelm@16682
   557
    fun do_timing f x = (info (command_msg "" tr); timeap f x);
wenzelm@16682
   558
    fun do_profiling f x = profile (! profiling) f x;
wenzelm@16682
   559
wenzelm@6689
   560
    val (result, opt_exn) =
wenzelm@16729
   561
       state |> (apply_trans int trans
wenzelm@16729
   562
        |> (if ! profiling > 0 then do_profiling else I)
wenzelm@16729
   563
        |> (if ! profiling > 0 orelse ! timing andalso not no_timing then do_timing else I));
wenzelm@16607
   564
    val _ = conditional (int andalso not (! quiet) andalso
wenzelm@16607
   565
        exists (fn m => m mem_string print) ("" :: ! print_mode))
wenzelm@16607
   566
      (fn () => print_state false result);
skalberg@15570
   567
  in (result, Option.map (fn UNDEF => type_error tr state | exn => exn) opt_exn) end;
wenzelm@6664
   568
wenzelm@6664
   569
in
wenzelm@5828
   570
wenzelm@6689
   571
fun apply int tr st =
wenzelm@6965
   572
  (case app int tr st of
skalberg@15531
   573
    (_, SOME TERMINATE) => NONE
skalberg@15531
   574
  | (_, SOME RESTART) => SOME (toplevel, NONE)
skalberg@15531
   575
  | (state', SOME (EXCURSION_FAIL exn_info)) => SOME (state', SOME exn_info)
skalberg@15531
   576
  | (state', SOME exn) => SOME (state', SOME (exn, at_command tr))
skalberg@15531
   577
  | (state', NONE) => SOME (state', NONE));
wenzelm@6664
   578
wenzelm@17266
   579
fun command tr st =
wenzelm@17266
   580
  (case apply false tr st of
wenzelm@17266
   581
    SOME (st', NONE) => st'
wenzelm@17266
   582
  | SOME (st', SOME exn_info) => raise EXCURSION_FAIL exn_info
wenzelm@17266
   583
  | NONE => raise EXCURSION_FAIL (TERMINATE, at_command tr));
wenzelm@17266
   584
wenzelm@6664
   585
end;
wenzelm@5828
   586
wenzelm@5828
   587
wenzelm@17076
   588
(* excursion: toplevel -- apply transformers/presentation -- toplevel *)
wenzelm@5828
   589
wenzelm@6664
   590
local
wenzelm@6664
   591
wenzelm@5828
   592
fun excur [] x = x
wenzelm@17076
   593
  | excur ((tr, pr) :: trs) (st, res) =
wenzelm@17321
   594
      (case apply (! interact) tr st of
skalberg@15531
   595
        SOME (st', NONE) =>
wenzelm@17076
   596
          excur trs (st', transform_error (fn () => pr st st' res) () handle exn =>
wenzelm@10324
   597
            raise EXCURSION_FAIL (exn, "Presentation failed\n" ^ at_command tr))
skalberg@15531
   598
      | SOME (st', SOME exn_info) => raise EXCURSION_FAIL exn_info
skalberg@15531
   599
      | NONE => raise EXCURSION_FAIL (TERMINATE, at_command tr));
wenzelm@5828
   600
wenzelm@17076
   601
fun no_pr _ _ _ = ();
wenzelm@17076
   602
wenzelm@6664
   603
in
wenzelm@6664
   604
wenzelm@17076
   605
fun present_excursion trs res =
skalberg@15531
   606
  (case excur trs (State NONE, res) of
skalberg@15531
   607
    (State NONE, res') => res'
wenzelm@9134
   608
  | _ => raise ERROR_MESSAGE "Unfinished development at end of input")
wenzelm@9134
   609
  handle exn => error (exn_message exn);
wenzelm@9134
   610
wenzelm@17076
   611
fun excursion trs = present_excursion (map (rpair no_pr) trs) ();
wenzelm@7062
   612
wenzelm@6664
   613
end;
wenzelm@6664
   614
wenzelm@5828
   615
wenzelm@5828
   616
wenzelm@5828
   617
(** interactive transformations **)
wenzelm@5828
   618
wenzelm@5828
   619
(* the global state reference *)
wenzelm@5828
   620
skalberg@15531
   621
val global_state = ref (toplevel, NONE: (exn * string) option);
wenzelm@5828
   622
skalberg@15531
   623
fun set_state state = global_state := (state, NONE);
wenzelm@5828
   624
fun get_state () = fst (! global_state);
wenzelm@5828
   625
fun exn () = snd (! global_state);
wenzelm@5828
   626
wenzelm@5828
   627
wenzelm@6965
   628
(* the Isar source of transitions *)
wenzelm@6965
   629
nipkow@14091
   630
type 'a isar =
wenzelm@6965
   631
  (transition, (transition option,
wenzelm@12881
   632
    (OuterLex.token, (OuterLex.token option, (OuterLex.token, (OuterLex.token,
nipkow@14091
   633
      Position.T * (Symbol.symbol, (string, 'a) Source.source) Source.source)
wenzelm@12881
   634
          Source.source) Source.source) Source.source) Source.source) Source.source) Source.source;
wenzelm@6965
   635
wenzelm@6965
   636
wenzelm@5828
   637
(* apply transformers to global state *)
wenzelm@5828
   638
wenzelm@14985
   639
nonfix >> >>>;
wenzelm@5828
   640
wenzelm@5828
   641
fun >> tr =
wenzelm@5828
   642
  (case apply true tr (get_state ()) of
skalberg@15531
   643
    NONE => false
skalberg@15531
   644
  | SOME (state', exn_info) =>
wenzelm@5828
   645
      (global_state := (state', exn_info);
wenzelm@16729
   646
        print_exn exn_info;
wenzelm@5828
   647
        true));
wenzelm@5828
   648
wenzelm@14985
   649
fun >>> [] = ()
wenzelm@14985
   650
  | >>> (tr :: trs) = if >> tr then >>> trs else ();
wenzelm@14985
   651
wenzelm@17513
   652
(*Spurious interrupts ahead!  Race condition?*)
wenzelm@17513
   653
fun get_interrupt src = SOME (Source.get_single src) handle Interrupt => NONE;
wenzelm@7602
   654
wenzelm@5828
   655
fun raw_loop src =
wenzelm@7602
   656
  (case get_interrupt (Source.set_prompt (prompt_state (get_state ())) src) of
skalberg@15531
   657
    NONE => (writeln "\nInterrupt."; raw_loop src)
skalberg@15531
   658
  | SOME NONE => ()
skalberg@15531
   659
  | SOME (SOME (tr, src')) => if >> tr then raw_loop src' else ());
wenzelm@5828
   660
wenzelm@12987
   661
fun loop src = ignore_interrupt raw_loop src;
wenzelm@5828
   662
wenzelm@5828
   663
end;