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