src/Pure/Isar/toplevel.ML
author wenzelm
Tue Jul 20 20:56:28 2010 +0200 (2010-07-20 ago)
changeset 37858 e1ef6b441fe7
parent 37856 173974e07dea
child 37859 575a14dd4167
permissions -rw-r--r--
toplevel pp for Proof.state and Toplevel.state;
     1 (*  Title:      Pure/Isar/toplevel.ML
     2     Author:     Markus Wenzel, TU Muenchen
     3 
     4 Isabelle/Isar toplevel transactions.
     5 *)
     6 
     7 signature TOPLEVEL =
     8 sig
     9   exception UNDEF
    10   type generic_theory
    11   type state
    12   val toplevel: state
    13   val is_toplevel: state -> bool
    14   val is_theory: state -> bool
    15   val is_proof: state -> bool
    16   val level: state -> int
    17   val presentation_context_of: state -> Proof.context
    18   val previous_context_of: state -> Proof.context option
    19   val context_of: state -> Proof.context
    20   val generic_theory_of: state -> generic_theory
    21   val theory_of: state -> theory
    22   val proof_of: state -> Proof.state
    23   val proof_position_of: state -> int
    24   val enter_proof_body: state -> Proof.state
    25   val print_state_context: state -> unit
    26   val print_state: bool -> state -> unit
    27   val pretty_abstract: state -> Pretty.T
    28   val quiet: bool Unsynchronized.ref
    29   val debug: bool Unsynchronized.ref
    30   val interact: bool Unsynchronized.ref
    31   val timing: bool Unsynchronized.ref
    32   val profiling: int Unsynchronized.ref
    33   val skip_proofs: bool Unsynchronized.ref
    34   exception TERMINATE
    35   exception TOPLEVEL_ERROR
    36   val program: (unit -> 'a) -> 'a
    37   val thread: bool -> (unit -> unit) -> Thread.thread
    38   type transition
    39   val empty: transition
    40   val init_of: transition -> string option
    41   val name_of: transition -> string
    42   val pos_of: transition -> Position.T
    43   val str_of: transition -> string
    44   val name: string -> transition -> transition
    45   val position: Position.T -> transition -> transition
    46   val interactive: bool -> transition -> transition
    47   val print: transition -> transition
    48   val no_timing: transition -> transition
    49   val init_theory: string -> (bool -> theory) -> (theory -> unit) -> transition -> transition
    50   val exit: transition -> transition
    51   val keep: (state -> unit) -> transition -> transition
    52   val keep': (bool -> state -> unit) -> transition -> transition
    53   val imperative: (unit -> unit) -> transition -> transition
    54   val ignored: Position.T -> transition
    55   val malformed: Position.T -> string -> transition
    56   val theory: (theory -> theory) -> transition -> transition
    57   val generic_theory: (generic_theory -> generic_theory) -> transition -> transition
    58   val theory': (bool -> theory -> theory) -> transition -> transition
    59   val begin_local_theory: bool -> (theory -> local_theory) -> transition -> transition
    60   val end_local_theory: transition -> transition
    61   val local_theory': xstring option -> (bool -> local_theory -> local_theory) ->
    62     transition -> transition
    63   val local_theory: xstring option -> (local_theory -> local_theory) -> transition -> transition
    64   val present_local_theory: xstring option -> (state -> unit) -> transition -> transition
    65   val local_theory_to_proof': xstring option -> (bool -> local_theory -> Proof.state) ->
    66     transition -> transition
    67   val local_theory_to_proof: xstring option -> (local_theory -> Proof.state) ->
    68     transition -> transition
    69   val theory_to_proof: (theory -> Proof.state) -> transition -> transition
    70   val end_proof: (bool -> Proof.state -> Proof.context) -> transition -> transition
    71   val forget_proof: transition -> transition
    72   val present_proof: (state -> unit) -> transition -> transition
    73   val proofs': (bool -> Proof.state -> Proof.state Seq.seq) -> transition -> transition
    74   val proof': (bool -> Proof.state -> Proof.state) -> transition -> transition
    75   val proofs: (Proof.state -> Proof.state Seq.seq) -> transition -> transition
    76   val proof: (Proof.state -> Proof.state) -> transition -> transition
    77   val actual_proof: (Proof_Node.T -> Proof_Node.T) -> transition -> transition
    78   val skip_proof: (int -> int) -> transition -> transition
    79   val skip_proof_to_theory: (int -> bool) -> transition -> transition
    80   val get_id: transition -> string option
    81   val put_id: string -> transition -> transition
    82   val unknown_theory: transition -> transition
    83   val unknown_proof: transition -> transition
    84   val unknown_context: transition -> transition
    85   val setmp_thread_position: transition -> ('a -> 'b) -> 'a -> 'b
    86   val status: transition -> Markup.T -> unit
    87   val error_msg: transition -> exn * string -> unit
    88   val add_hook: (transition -> state -> state -> unit) -> unit
    89   val transition: bool -> transition -> state -> (state * (exn * string) option) option
    90   val run_command: string -> transition -> state -> state option
    91   val commit_exit: Position.T -> transition
    92   val command: transition -> state -> state
    93   val excursion: (transition * transition list) list -> (transition * state) list lazy
    94 end;
    95 
    96 structure Toplevel: TOPLEVEL =
    97 struct
    98 
    99 (** toplevel state **)
   100 
   101 exception UNDEF = Runtime.UNDEF;
   102 
   103 
   104 (* local theory wrappers *)
   105 
   106 type generic_theory = Context.generic;    (*theory or local_theory*)
   107 
   108 val loc_init = Theory_Target.context_cmd;
   109 val loc_exit = Local_Theory.exit_global;
   110 
   111 fun loc_begin loc (Context.Theory thy) = loc_init (the_default "-" loc) thy
   112   | loc_begin NONE (Context.Proof lthy) = lthy
   113   | loc_begin (SOME loc) (Context.Proof lthy) = loc_init loc (loc_exit lthy);
   114 
   115 fun loc_finish _ (Context.Theory _) = Context.Theory o loc_exit
   116   | loc_finish NONE (Context.Proof _) = Context.Proof o Local_Theory.restore
   117   | loc_finish (SOME _) (Context.Proof lthy) = fn lthy' =>
   118       Context.Proof (Local_Theory.reinit (Local_Theory.raw_theory (K (loc_exit lthy')) lthy));
   119 
   120 
   121 (* datatype node *)
   122 
   123 datatype node =
   124   Theory of generic_theory * Proof.context option
   125     (*theory with presentation context*) |
   126   Proof of Proof_Node.T * ((Proof.context -> generic_theory) * generic_theory)
   127     (*proof node, finish, original theory*) |
   128   SkipProof of int * (generic_theory * generic_theory);
   129     (*proof depth, resulting theory, original theory*)
   130 
   131 val theory_node = fn Theory (gthy, _) => SOME gthy | _ => NONE;
   132 val proof_node = fn Proof (prf, _) => SOME prf | _ => NONE;
   133 
   134 fun cases_node f _ (Theory (gthy, _)) = f gthy
   135   | cases_node _ g (Proof (prf, _)) = g (Proof_Node.current prf)
   136   | cases_node f _ (SkipProof (_, (gthy, _))) = f gthy;
   137 
   138 val context_node = cases_node Context.proof_of Proof.context_of;
   139 
   140 
   141 (* datatype state *)
   142 
   143 type node_info = node * (theory -> unit);  (*node with exit operation*)
   144 datatype state = State of node_info option * node_info option;  (*current, previous*)
   145 
   146 val toplevel = State (NONE, NONE);
   147 
   148 fun is_toplevel (State (NONE, _)) = true
   149   | is_toplevel _ = false;
   150 
   151 fun level (State (NONE, _)) = 0
   152   | level (State (SOME (Theory _, _), _)) = 0
   153   | level (State (SOME (Proof (prf, _), _), _)) = Proof.level (Proof_Node.current prf)
   154   | level (State (SOME (SkipProof (d, _), _), _)) = d + 1;   (*different notion of proof depth!*)
   155 
   156 fun str_of_state (State (NONE, _)) = "at top level"
   157   | str_of_state (State (SOME (Theory (Context.Theory _, _), _), _)) = "in theory mode"
   158   | str_of_state (State (SOME (Theory (Context.Proof _, _), _), _)) = "in local theory mode"
   159   | str_of_state (State (SOME (Proof _, _), _)) = "in proof mode"
   160   | str_of_state (State (SOME (SkipProof _, _), _)) = "in skipped proof mode";
   161 
   162 
   163 (* current node *)
   164 
   165 fun node_of (State (NONE, _)) = raise UNDEF
   166   | node_of (State (SOME (node, _), _)) = node;
   167 
   168 fun is_theory state = not (is_toplevel state) andalso is_some (theory_node (node_of state));
   169 fun is_proof state = not (is_toplevel state) andalso is_some (proof_node (node_of state));
   170 
   171 fun node_case f g state = cases_node f g (node_of state);
   172 
   173 fun presentation_context_of state =
   174   (case try node_of state of
   175     SOME (Theory (_, SOME ctxt)) => ctxt
   176   | SOME node => context_node node
   177   | NONE => raise UNDEF);
   178 
   179 fun previous_context_of (State (_, NONE)) = NONE
   180   | previous_context_of (State (_, SOME (prev, _))) = SOME (context_node prev);
   181 
   182 val context_of = node_case Context.proof_of Proof.context_of;
   183 val generic_theory_of = node_case I (Context.Proof o Proof.context_of);
   184 val theory_of = node_case Context.theory_of Proof.theory_of;
   185 val proof_of = node_case (fn _ => raise UNDEF) I;
   186 
   187 fun proof_position_of state =
   188   (case node_of state of
   189     Proof (prf, _) => Proof_Node.position prf
   190   | _ => raise UNDEF);
   191 
   192 val enter_proof_body = node_case (Proof.init o Context.proof_of) Proof.enter_forward;
   193 
   194 
   195 (* print state *)
   196 
   197 val pretty_context = Local_Theory.pretty o Context.cases (Theory_Target.init NONE) I;
   198 
   199 fun print_state_context state =
   200   (case try node_of state of
   201     NONE => []
   202   | SOME (Theory (gthy, _)) => pretty_context gthy
   203   | SOME (Proof (_, (_, gthy))) => pretty_context gthy
   204   | SOME (SkipProof (_, (gthy, _))) => pretty_context gthy)
   205   |> Pretty.chunks |> Pretty.writeln;
   206 
   207 fun print_state prf_only state =
   208   (case try node_of state of
   209     NONE => []
   210   | SOME (Theory (gthy, _)) => if prf_only then [] else pretty_context gthy
   211   | SOME (Proof (prf, _)) =>
   212       Proof.pretty_state (Proof_Node.position prf) (Proof_Node.current prf)
   213   | SOME (SkipProof (d, _)) => [Pretty.str ("skipped proof: depth " ^ string_of_int d)])
   214   |> Pretty.markup_chunks Markup.state |> Pretty.writeln;
   215 
   216 fun pretty_abstract state = Pretty.str ("<Isar " ^ str_of_state state ^ ">");
   217 
   218 
   219 
   220 (** toplevel transitions **)
   221 
   222 val quiet = Unsynchronized.ref false;
   223 val debug = Output.debugging;
   224 val interact = Unsynchronized.ref false;
   225 val timing = Output.timing;
   226 val profiling = Unsynchronized.ref 0;
   227 val skip_proofs = Unsynchronized.ref false;
   228 
   229 exception TERMINATE = Runtime.TERMINATE;
   230 exception EXCURSION_FAIL = Runtime.EXCURSION_FAIL;
   231 exception TOPLEVEL_ERROR = Runtime.TOPLEVEL_ERROR;
   232 
   233 fun program body =
   234  (body
   235   |> Runtime.controlled_execution
   236   |> Runtime.toplevel_error (Output.error_msg o ML_Compiler.exn_message)) ();
   237 
   238 fun thread interrupts body =
   239   Thread.fork
   240     (((fn () => body () handle Exn.Interrupt => ())
   241         |> Runtime.debugging
   242         |> Runtime.toplevel_error
   243           (fn exn => priority ("## INTERNAL ERROR ##\n" ^ ML_Compiler.exn_message exn))),
   244       Simple_Thread.attributes interrupts);
   245 
   246 
   247 (* node transactions -- maintaining stable checkpoints *)
   248 
   249 exception FAILURE of state * exn;
   250 
   251 local
   252 
   253 fun reset_presentation (Theory (gthy, _)) = Theory (gthy, NONE)
   254   | reset_presentation node = node;
   255 
   256 fun is_draft_theory (Theory (gthy, _)) = Context.is_draft (Context.theory_of gthy)
   257   | is_draft_theory _ = false;
   258 
   259 fun is_stale state = Context.is_stale (theory_of state) handle Runtime.UNDEF => false;
   260 
   261 fun stale_error NONE = SOME (ERROR "Stale theory encountered after successful execution!")
   262   | stale_error some = some;
   263 
   264 fun map_theory f (Theory (gthy, ctxt)) =
   265       Theory (Context.mapping f (Local_Theory.raw_theory f) gthy, ctxt)
   266   | map_theory _ node = node;
   267 
   268 in
   269 
   270 fun apply_transaction f g (node, exit) =
   271   let
   272     val _ = is_draft_theory node andalso error "Illegal draft theory in toplevel state";
   273     val cont_node = reset_presentation node;
   274     val back_node = map_theory (Theory.checkpoint o Theory.copy) cont_node;
   275     fun state_error e nd = (State (SOME (nd, exit), SOME (node, exit)), e);
   276 
   277     val (result, err) =
   278       cont_node
   279       |> Runtime.controlled_execution f
   280       |> map_theory Theory.checkpoint
   281       |> state_error NONE
   282       handle exn => state_error (SOME exn) cont_node;
   283 
   284     val (result', err') =
   285       if is_stale result then state_error (stale_error err) back_node
   286       else (result, err);
   287   in
   288     (case err' of
   289       NONE => tap g result'
   290     | SOME exn => raise FAILURE (result', exn))
   291   end;
   292 
   293 end;
   294 
   295 
   296 (* primitive transitions *)
   297 
   298 datatype trans =
   299   Init of string * (bool -> theory) * (theory -> unit) | (*theory name, init, exit*)
   300   Exit |                                         (*formal exit of theory -- without committing*)
   301   CommitExit |                                   (*exit and commit final theory*)
   302   Keep of bool -> state -> unit |                (*peek at state*)
   303   Transaction of (bool -> node -> node) * (state -> unit);  (*node transaction and presentation*)
   304 
   305 local
   306 
   307 fun apply_tr int (Init (_, f, exit)) (State (NONE, _)) =
   308       State (SOME (Theory (Context.Theory
   309           (Theory.checkpoint (Runtime.controlled_execution f int)), NONE), exit), NONE)
   310   | apply_tr _ Exit (State (prev as SOME (Theory (Context.Theory _, _), _), _)) =
   311       State (NONE, prev)
   312   | apply_tr _ CommitExit (State (NONE, SOME (Theory (Context.Theory thy, _), exit))) =
   313       (Runtime.controlled_execution exit thy; toplevel)
   314   | apply_tr int (Keep f) state =
   315       Runtime.controlled_execution (fn x => tap (f int) x) state
   316   | apply_tr int (Transaction (f, g)) (State (SOME state, _)) =
   317       apply_transaction (fn x => f int x) g state
   318   | apply_tr _ _ _ = raise UNDEF;
   319 
   320 fun apply_union _ [] state = raise FAILURE (state, UNDEF)
   321   | apply_union int (tr :: trs) state =
   322       apply_union int trs state
   323         handle Runtime.UNDEF => apply_tr int tr state
   324           | FAILURE (alt_state, UNDEF) => apply_tr int tr alt_state
   325           | exn as FAILURE _ => raise exn
   326           | exn => raise FAILURE (state, exn);
   327 
   328 in
   329 
   330 fun apply_trans int trs state = (apply_union int trs state, NONE)
   331   handle FAILURE (alt_state, exn) => (alt_state, SOME exn) | exn => (state, SOME exn);
   332 
   333 end;
   334 
   335 
   336 (* datatype transition *)
   337 
   338 datatype transition = Transition of
   339  {name: string,              (*command name*)
   340   pos: Position.T,           (*source position*)
   341   int_only: bool,            (*interactive-only*)
   342   print: bool,               (*print result state*)
   343   no_timing: bool,           (*suppress timing*)
   344   trans: trans list};        (*primitive transitions (union)*)
   345 
   346 fun make_transition (name, pos, int_only, print, no_timing, trans) =
   347   Transition {name = name, pos = pos, int_only = int_only, print = print, no_timing = no_timing,
   348     trans = trans};
   349 
   350 fun map_transition f (Transition {name, pos, int_only, print, no_timing, trans}) =
   351   make_transition (f (name, pos, int_only, print, no_timing, trans));
   352 
   353 val empty = make_transition ("", Position.none, false, false, false, []);
   354 
   355 
   356 (* diagnostics *)
   357 
   358 fun init_of (Transition {trans = [Init (name, _, _)], ...}) = SOME name
   359   | init_of _ = NONE;
   360 
   361 fun name_of (Transition {name, ...}) = name;
   362 fun pos_of (Transition {pos, ...}) = pos;
   363 fun str_of tr = quote (name_of tr) ^ Position.str_of (pos_of tr);
   364 
   365 fun command_msg msg tr = msg ^ "command " ^ str_of tr;
   366 fun at_command tr = command_msg "At " tr ^ ".";
   367 
   368 fun type_error tr state =
   369   ERROR (command_msg "Illegal application of " tr ^ " " ^ str_of_state state);
   370 
   371 
   372 (* modify transitions *)
   373 
   374 fun name name = map_transition (fn (_, pos, int_only, print, no_timing, trans) =>
   375   (name, pos, int_only, print, no_timing, trans));
   376 
   377 fun position pos = map_transition (fn (name, _, int_only, print, no_timing, trans) =>
   378   (name, pos, int_only, print, no_timing, trans));
   379 
   380 fun interactive int_only = map_transition (fn (name, pos, _, print, no_timing, trans) =>
   381   (name, pos, int_only, print, no_timing, trans));
   382 
   383 val no_timing = map_transition (fn (name, pos, int_only, print, _, trans) =>
   384   (name, pos, int_only, print, true, trans));
   385 
   386 fun add_trans tr = map_transition (fn (name, pos, int_only, print, no_timing, trans) =>
   387   (name, pos, int_only, print, no_timing, tr :: trans));
   388 
   389 val reset_trans = map_transition (fn (name, pos, int_only, print, no_timing, _) =>
   390   (name, pos, int_only, print, no_timing, []));
   391 
   392 fun set_print print = map_transition (fn (name, pos, int_only, _, no_timing, trans) =>
   393   (name, pos, int_only, print, no_timing, trans));
   394 
   395 val print = set_print true;
   396 
   397 
   398 (* basic transitions *)
   399 
   400 fun init_theory name f exit = add_trans (Init (name, f, exit));
   401 val exit = add_trans Exit;
   402 val keep' = add_trans o Keep;
   403 
   404 fun present_transaction f g = add_trans (Transaction (f, g));
   405 fun transaction f = present_transaction f (K ());
   406 
   407 fun keep f = add_trans (Keep (fn _ => f));
   408 fun imperative f = keep (fn _ => f ());
   409 
   410 fun ignored pos = empty |> name "<ignored>" |> position pos |> imperative I;
   411 fun malformed pos msg =
   412   empty |> name "<malformed>" |> position pos |> imperative (fn () => error msg);
   413 
   414 val unknown_theory = imperative (fn () => warning "Unknown theory context");
   415 val unknown_proof = imperative (fn () => warning "Unknown proof context");
   416 val unknown_context = imperative (fn () => warning "Unknown context");
   417 
   418 
   419 (* theory transitions *)
   420 
   421 fun generic_theory f = transaction (fn _ =>
   422   (fn Theory (gthy, _) => Theory (f gthy, NONE)
   423     | _ => raise UNDEF));
   424 
   425 fun theory' f = transaction (fn int =>
   426   (fn Theory (Context.Theory thy, _) =>
   427       let val thy' = thy
   428         |> Sign.new_group
   429         |> Theory.checkpoint
   430         |> f int
   431         |> Sign.reset_group;
   432       in Theory (Context.Theory thy', NONE) end
   433     | _ => raise UNDEF));
   434 
   435 fun theory f = theory' (K f);
   436 
   437 fun begin_local_theory begin f = transaction (fn _ =>
   438   (fn Theory (Context.Theory thy, _) =>
   439         let
   440           val lthy = f thy;
   441           val gthy = if begin then Context.Proof lthy else Context.Theory (loc_exit lthy);
   442         in Theory (gthy, SOME lthy) end
   443     | _ => raise UNDEF));
   444 
   445 val end_local_theory = transaction (fn _ =>
   446   (fn Theory (Context.Proof lthy, _) => Theory (Context.Theory (loc_exit lthy), SOME lthy)
   447     | _ => raise UNDEF));
   448 
   449 local
   450 
   451 fun local_theory_presentation loc f = present_transaction (fn int =>
   452   (fn Theory (gthy, _) =>
   453         let
   454           val finish = loc_finish loc gthy;
   455           val lthy' = loc_begin loc gthy
   456             |> Local_Theory.new_group
   457             |> f int
   458             |> Local_Theory.reset_group;
   459         in Theory (finish lthy', SOME lthy') end
   460     | _ => raise UNDEF));
   461 
   462 in
   463 
   464 fun local_theory' loc f = local_theory_presentation loc f (K ());
   465 fun local_theory loc f = local_theory' loc (K f);
   466 fun present_local_theory loc = local_theory_presentation loc (K I);
   467 
   468 end;
   469 
   470 
   471 (* proof transitions *)
   472 
   473 fun end_proof f = transaction (fn int =>
   474   (fn Proof (prf, (finish, _)) =>
   475         let val state = Proof_Node.current prf in
   476           if can (Proof.assert_bottom true) state then
   477             let
   478               val ctxt' = f int state;
   479               val gthy' = finish ctxt';
   480             in Theory (gthy', SOME ctxt') end
   481           else raise UNDEF
   482         end
   483     | SkipProof (0, (gthy, _)) => Theory (gthy, NONE)
   484     | _ => raise UNDEF));
   485 
   486 local
   487 
   488 fun begin_proof init finish = transaction (fn int =>
   489   (fn Theory (gthy, _) =>
   490     let
   491       val prf = init int gthy;
   492       val skip = ! skip_proofs;
   493       val schematic = Proof.schematic_goal prf;
   494     in
   495       if skip andalso schematic then
   496         warning "Cannot skip proof of schematic goal statement"
   497       else ();
   498       if skip andalso not schematic then
   499         SkipProof (0, (finish gthy (Proof.global_skip_proof int prf), gthy))
   500       else Proof (Proof_Node.init prf, (finish gthy, gthy))
   501     end
   502   | _ => raise UNDEF));
   503 
   504 in
   505 
   506 fun local_theory_to_proof' loc f = begin_proof
   507   (fn int => fn gthy => f int (Local_Theory.new_group (loc_begin loc gthy)))
   508   (fn gthy => loc_finish loc gthy o Local_Theory.reset_group);
   509 
   510 fun local_theory_to_proof loc f = local_theory_to_proof' loc (K f);
   511 
   512 fun theory_to_proof f = begin_proof
   513   (K (fn Context.Theory thy => f (Theory.checkpoint (Sign.new_group thy)) | _ => raise UNDEF))
   514   (K (Context.Theory o Sign.reset_group o ProofContext.theory_of));
   515 
   516 end;
   517 
   518 val forget_proof = transaction (fn _ =>
   519   (fn Proof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
   520     | SkipProof (_, (_, orig_gthy)) => Theory (orig_gthy, NONE)
   521     | _ => raise UNDEF));
   522 
   523 val present_proof = present_transaction (fn _ =>
   524   (fn Proof (prf, x) => Proof (Proof_Node.apply I prf, x)
   525     | skip as SkipProof _ => skip
   526     | _ => raise UNDEF));
   527 
   528 fun proofs' f = transaction (fn int =>
   529   (fn Proof (prf, x) => Proof (Proof_Node.applys (f int) prf, x)
   530     | skip as SkipProof _ => skip
   531     | _ => raise UNDEF));
   532 
   533 fun proof' f = proofs' (Seq.single oo f);
   534 val proofs = proofs' o K;
   535 val proof = proof' o K;
   536 
   537 fun actual_proof f = transaction (fn _ =>
   538   (fn Proof (prf, x) => Proof (f prf, x)
   539     | _ => raise UNDEF));
   540 
   541 fun skip_proof f = transaction (fn _ =>
   542   (fn SkipProof (h, x) => SkipProof (f h, x)
   543     | _ => raise UNDEF));
   544 
   545 fun skip_proof_to_theory pred = transaction (fn _ =>
   546   (fn SkipProof (d, (gthy, _)) => if pred d then Theory (gthy, NONE) else raise UNDEF
   547     | _ => raise UNDEF));
   548 
   549 
   550 
   551 (** toplevel transactions **)
   552 
   553 (* identification *)
   554 
   555 fun get_id (Transition {pos, ...}) = Position.get_id pos;
   556 fun put_id id (tr as Transition {pos, ...}) = position (Position.put_id id pos) tr;
   557 
   558 
   559 (* thread position *)
   560 
   561 fun setmp_thread_position (Transition {pos, ...}) f x =
   562   Position.setmp_thread_data pos f x;
   563 
   564 fun status tr m =
   565   setmp_thread_position tr (fn () => Output.status (Markup.markup m "")) ();
   566 
   567 fun async_state (tr as Transition {print, ...}) st =
   568   if print then
   569     ignore
   570       (Future.fork_group (Task_Queue.new_group (Future.worker_group ()))
   571         (fn () =>
   572           setmp_thread_position tr (fn () => Future.report (fn () => print_state false st)) ()))
   573   else ();
   574 
   575 fun error_msg tr exn_info =
   576   setmp_thread_position tr (fn () =>
   577     Output.error_msg (ML_Compiler.exn_message (EXCURSION_FAIL exn_info))) ();
   578 
   579 
   580 (* post-transition hooks *)
   581 
   582 local val hooks = Unsynchronized.ref ([]: (transition -> state -> state -> unit) list) in
   583 
   584 fun add_hook f = CRITICAL (fn () => Unsynchronized.change hooks (cons f));
   585 fun get_hooks () = ! hooks;
   586 
   587 end;
   588 
   589 
   590 (* apply transitions *)
   591 
   592 local
   593 
   594 fun app int (tr as Transition {trans, print, no_timing, ...}) =
   595   setmp_thread_position tr (fn state =>
   596     let
   597       fun do_timing f x = (warning (command_msg "" tr); timeap f x);
   598       fun do_profiling f x = profile (! profiling) f x;
   599 
   600       val (result, status) =
   601          state |> (apply_trans int trans
   602           |> (if ! profiling > 0 andalso not no_timing then do_profiling else I)
   603           |> (if ! profiling > 0 orelse ! timing andalso not no_timing then do_timing else I));
   604 
   605       val _ = if int andalso not (! quiet) andalso print then print_state false result else ();
   606     in (result, Option.map (fn UNDEF => type_error tr state | exn => exn) status) end);
   607 
   608 in
   609 
   610 fun transition int tr st =
   611   let
   612     val hooks = get_hooks ();
   613     fun apply_hooks st' = hooks |> List.app (fn f => (try (fn () => f tr st st') (); ()));
   614 
   615     val ctxt = try context_of st;
   616     val res =
   617       (case app int tr st of
   618         (_, SOME TERMINATE) => NONE
   619       | (st', SOME (EXCURSION_FAIL exn_info)) => SOME (st', SOME exn_info)
   620       | (st', SOME exn) => SOME (st', SOME (Runtime.exn_context ctxt exn, at_command tr))
   621       | (st', NONE) => SOME (st', NONE));
   622     val _ = (case res of SOME (st', NONE) => apply_hooks st' | _ => ());
   623   in res end;
   624 
   625 end;
   626 
   627 
   628 (* managed execution *)
   629 
   630 fun run_command thy_name (tr as Transition {print, ...}) st =
   631   (case
   632       (case init_of tr of
   633         SOME name => Exn.capture (fn () => Thy_Load.check_name thy_name name) ()
   634       | NONE => Exn.Result ()) of
   635     Exn.Result () =>
   636       (case transition (is_some (init_of tr)) tr st of
   637         SOME (st', NONE) => (status tr Markup.finished; async_state tr st'; SOME st')
   638       | SOME (_, SOME (exn as Exn.Interrupt, _)) => reraise exn
   639       | SOME (_, SOME exn_info) => (error_msg tr exn_info; status tr Markup.failed; NONE)
   640       | NONE => (error_msg tr (TERMINATE, at_command tr); status tr Markup.failed; NONE))
   641   | Exn.Exn exn => (error_msg tr (exn, at_command tr); status tr Markup.failed; NONE));
   642 
   643 
   644 (* commit final exit *)
   645 
   646 fun commit_exit pos =
   647   name "end" empty
   648   |> position pos
   649   |> add_trans CommitExit
   650   |> imperative (fn () => warning "Expected to find finished theory");
   651 
   652 
   653 (* nested commands *)
   654 
   655 fun command tr st =
   656   (case transition (! interact) tr st of
   657     SOME (st', NONE) => st'
   658   | SOME (_, SOME exn_info) => raise EXCURSION_FAIL exn_info
   659   | NONE => raise EXCURSION_FAIL (TERMINATE, at_command tr));
   660 
   661 fun command_result tr st =
   662   let val st' = command tr st
   663   in (st', st') end;
   664 
   665 
   666 (* excursion of units, consisting of commands with proof *)
   667 
   668 structure States = Proof_Data
   669 (
   670   type T = state list future option;
   671   fun init _ = NONE;
   672 );
   673 
   674 fun proof_result immediate (tr, proof_trs) st =
   675   let val st' = command tr st in
   676     if immediate orelse
   677       null proof_trs orelse
   678       Keyword.is_schematic_goal (name_of tr) orelse
   679       exists (Keyword.is_qed_global o name_of) proof_trs orelse
   680       not (can proof_of st') orelse
   681       Proof.is_relevant (proof_of st')
   682     then
   683       let val (states, st'') = fold_map command_result proof_trs st'
   684       in (Lazy.value ((tr, st') :: (proof_trs ~~ states)), st'') end
   685     else
   686       let
   687         val (body_trs, end_tr) = split_last proof_trs;
   688         val finish = Context.Theory o ProofContext.theory_of;
   689 
   690         val future_proof = Proof.global_future_proof
   691           (fn prf =>
   692             Future.fork_pri ~1 (fn () =>
   693               let val (states, result_state) =
   694                 (case st' of State (SOME (Proof (_, (_, orig_gthy)), exit), prev)
   695                   => State (SOME (Proof (Proof_Node.init prf, (finish, orig_gthy)), exit), prev))
   696                 |> fold_map command_result body_trs
   697                 ||> command (end_tr |> set_print false);
   698               in (states, presentation_context_of result_state) end))
   699           #> (fn (states, ctxt) => States.put (SOME states) ctxt);
   700 
   701         val st'' = st' |> command (end_tr |> reset_trans |> end_proof (K future_proof));
   702 
   703         val states =
   704           (case States.get (presentation_context_of st'') of
   705             NONE => raise Fail ("No future states for " ^ name_of tr ^ Position.str_of (pos_of tr))
   706           | SOME states => states);
   707         val result = Lazy.lazy
   708           (fn () => (tr, st') :: (body_trs ~~ Future.join states) @ [(end_tr, st'')]);
   709 
   710       in (result, st'') end
   711   end;
   712 
   713 fun excursion input =
   714   let
   715     val end_pos = if null input then error "No input" else pos_of (fst (List.last input));
   716 
   717     val immediate = not (Goal.future_enabled ());
   718     val (results, end_state) = fold_map (proof_result immediate) input toplevel;
   719     val _ =
   720       (case end_state of
   721         State (NONE, SOME (Theory (Context.Theory _, _), _)) =>
   722           command (commit_exit end_pos) end_state
   723       | _ => error "Unfinished development at end of input");
   724   in Lazy.lazy (fn () => maps Lazy.force results) end;
   725 
   726 end;