src/Pure/Isar/isar_cmd.ML
author wenzelm
Tue Jun 26 00:35:14 2007 +0200 (2007-06-26 ago)
changeset 23500 3e3c9d4da476
parent 22872 d7189dc8939c
child 23660 18765718cf62
permissions -rw-r--r--
fixed undo: try undos_proof first!
     1 (*  Title:      Pure/Isar/isar_cmd.ML
     2     ID:         $Id$
     3     Author:     Markus Wenzel, TU Muenchen
     4 
     5 Derived Isar commands.
     6 *)
     7 
     8 signature ISAR_CMD =
     9 sig
    10   val generic_setup: string option -> theory -> theory
    11   val parse_ast_translation: bool * string -> theory -> theory
    12   val parse_translation: bool * string -> theory -> theory
    13   val print_translation: bool * string -> theory -> theory
    14   val typed_print_translation: bool * string -> theory -> theory
    15   val print_ast_translation: bool * string -> theory -> theory
    16   val token_translation: string -> theory -> theory
    17   val oracle: bstring -> string -> string -> theory -> theory
    18   val add_axioms: ((bstring * string) * Attrib.src list) list -> theory -> theory
    19   val add_defs: (bool * bool) * ((bstring * string) * Attrib.src list) list -> theory -> theory
    20   val apply_theorems: (thmref * Attrib.src list) list -> theory -> thm list * theory
    21   val apply_theorems_i: (thm list * attribute list) list -> theory -> thm list * theory
    22   val declaration: string -> local_theory -> local_theory
    23   val simproc_setup: string -> string list -> string -> string list -> local_theory -> local_theory
    24   val have: ((string * Attrib.src list) * (string * string list) list) list ->
    25     bool -> Proof.state -> Proof.state
    26   val hence: ((string * Attrib.src list) * (string * string list) list) list ->
    27     bool -> Proof.state -> Proof.state
    28   val show: ((string * Attrib.src list) * (string * string list) list) list ->
    29     bool -> Proof.state -> Proof.state
    30   val thus: ((string * Attrib.src list) * (string * string list) list) list ->
    31     bool -> Proof.state -> Proof.state
    32   val qed: Method.text option -> Toplevel.transition -> Toplevel.transition
    33   val terminal_proof: Method.text * Method.text option ->
    34     Toplevel.transition -> Toplevel.transition
    35   val default_proof: Toplevel.transition -> Toplevel.transition
    36   val immediate_proof: Toplevel.transition -> Toplevel.transition
    37   val done_proof: Toplevel.transition -> Toplevel.transition
    38   val skip_proof: Toplevel.transition -> Toplevel.transition
    39   val begin_theory: string -> string list -> (string * bool) list -> bool -> theory
    40   val end_theory: theory -> theory
    41   val kill_theory: string -> unit
    42   val theory: string * string list * (string * bool) list
    43     -> Toplevel.transition -> Toplevel.transition
    44   val welcome: Toplevel.transition -> Toplevel.transition
    45   val init_toplevel: Toplevel.transition -> Toplevel.transition
    46   val exit: Toplevel.transition -> Toplevel.transition
    47   val quit: Toplevel.transition -> Toplevel.transition
    48   val touch_child_thys: string -> Toplevel.transition -> Toplevel.transition
    49   val touch_all_thys: Toplevel.transition -> Toplevel.transition
    50   val touch_thy: string -> Toplevel.transition -> Toplevel.transition
    51   val remove_thy: string -> Toplevel.transition -> Toplevel.transition
    52   val kill_thy: string -> Toplevel.transition -> Toplevel.transition
    53   val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition
    54   val disable_pr: Toplevel.transition -> Toplevel.transition
    55   val enable_pr: Toplevel.transition -> Toplevel.transition
    56   val redo: Toplevel.transition -> Toplevel.transition
    57   val undos_proof: int -> Toplevel.transition -> Toplevel.transition
    58   val kill_proof_notify: (unit -> unit) -> Toplevel.transition -> Toplevel.transition
    59   val kill_proof: Toplevel.transition -> Toplevel.transition
    60   val undo_theory: Toplevel.transition -> Toplevel.transition
    61   val undo: Toplevel.transition -> Toplevel.transition
    62   val cannot_undo: string -> Toplevel.transition -> Toplevel.transition
    63   val kill: Toplevel.transition -> Toplevel.transition
    64   val back: Toplevel.transition -> Toplevel.transition
    65   val use: Path.T -> Toplevel.transition -> Toplevel.transition
    66   val use_mltext_theory: string -> Toplevel.transition -> Toplevel.transition
    67   val use_mltext: bool -> string -> Toplevel.transition -> Toplevel.transition
    68   val use_commit: Toplevel.transition -> Toplevel.transition
    69   val cd: Path.T -> Toplevel.transition -> Toplevel.transition
    70   val pwd: Toplevel.transition -> Toplevel.transition
    71   val use_thy: string -> Toplevel.transition -> Toplevel.transition
    72   val use_thy_only: string -> Toplevel.transition -> Toplevel.transition
    73   val update_thy: string -> Toplevel.transition -> Toplevel.transition
    74   val update_thy_only: string -> Toplevel.transition -> Toplevel.transition
    75   val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
    76   val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
    77   val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition
    78   val print_context: Toplevel.transition -> Toplevel.transition
    79   val print_theory: bool -> Toplevel.transition -> Toplevel.transition
    80   val print_syntax: Toplevel.transition -> Toplevel.transition
    81   val print_abbrevs: Toplevel.transition -> Toplevel.transition
    82   val print_facts: Toplevel.transition -> Toplevel.transition
    83   val print_theorems: Toplevel.transition -> Toplevel.transition
    84   val print_locales: Toplevel.transition -> Toplevel.transition
    85   val print_locale: bool * (Locale.expr * Element.context list)
    86     -> Toplevel.transition -> Toplevel.transition
    87   val print_registrations: bool -> string -> Toplevel.transition -> Toplevel.transition
    88   val print_attributes: Toplevel.transition -> Toplevel.transition
    89   val print_simpset: Toplevel.transition -> Toplevel.transition
    90   val print_rules: Toplevel.transition -> Toplevel.transition
    91   val print_induct_rules: Toplevel.transition -> Toplevel.transition
    92   val print_trans_rules: Toplevel.transition -> Toplevel.transition
    93   val print_methods: Toplevel.transition -> Toplevel.transition
    94   val print_antiquotations: Toplevel.transition -> Toplevel.transition
    95   val class_deps: Toplevel.transition -> Toplevel.transition
    96   val thy_deps: Toplevel.transition -> Toplevel.transition
    97   val thm_deps: (thmref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
    98   val find_theorems: (int option * bool) * (bool * string FindTheorems.criterion) list
    99     -> Toplevel.transition -> Toplevel.transition
   100   val print_binds: Toplevel.transition -> Toplevel.transition
   101   val print_cases: Toplevel.transition -> Toplevel.transition
   102   val print_stmts: string list * (thmref * Attrib.src list) list
   103     -> Toplevel.transition -> Toplevel.transition
   104   val print_thms: string list * (thmref * Attrib.src list) list
   105     -> Toplevel.transition -> Toplevel.transition
   106   val print_prfs: bool -> string list * (thmref * Attrib.src list) list option
   107     -> Toplevel.transition -> Toplevel.transition
   108   val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
   109   val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
   110   val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
   111   val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition
   112   val add_chapter: xstring option * (string * Position.T) ->
   113     Toplevel.transition -> Toplevel.transition
   114   val add_section: xstring option * (string * Position.T) ->
   115     Toplevel.transition -> Toplevel.transition
   116   val add_subsection: xstring option * (string * Position.T) ->
   117     Toplevel.transition -> Toplevel.transition
   118   val add_subsubsection: xstring option * (string * Position.T) ->
   119     Toplevel.transition -> Toplevel.transition
   120   val add_text: xstring option * (string * Position.T) ->
   121     Toplevel.transition -> Toplevel.transition
   122   val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
   123   val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition
   124   val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
   125   val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
   126   val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition
   127   val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
   128 end;
   129 
   130 structure IsarCmd: ISAR_CMD =
   131 struct
   132 
   133 
   134 (** theory declarations **)
   135 
   136 (* generic_setup *)
   137 
   138 fun generic_setup NONE = (fn thy => thy |> Context.setup ())
   139   | generic_setup (SOME txt) =
   140       ML_Context.use_let "val setup: theory -> theory" "Context.map_theory setup" txt
   141       |> Context.theory_map;
   142 
   143 
   144 (* translation functions *)
   145 
   146 local
   147 
   148 fun advancedT false = ""
   149   | advancedT true = "Proof.context -> ";
   150 
   151 fun advancedN false = ""
   152   | advancedN true = "advanced_";
   153 
   154 in
   155 
   156 fun parse_ast_translation (a, txt) =
   157   txt |> ML_Context.use_let ("val parse_ast_translation: (string * (" ^ advancedT a ^
   158       "Syntax.ast list -> Syntax.ast)) list")
   159     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
   160   |> Context.theory_map;
   161 
   162 fun parse_translation (a, txt) =
   163   txt |> ML_Context.use_let ("val parse_translation: (string * (" ^ advancedT a ^
   164       "term list -> term)) list")
   165     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))")
   166   |> Context.theory_map;
   167 
   168 fun print_translation (a, txt) =
   169   txt |> ML_Context.use_let ("val print_translation: (string * (" ^ advancedT a ^
   170       "term list -> term)) list")
   171     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
   172   |> Context.theory_map;
   173 
   174 fun print_ast_translation (a, txt) =
   175   txt |> ML_Context.use_let ("val print_ast_translation: (string * (" ^ advancedT a ^
   176       "Syntax.ast list -> Syntax.ast)) list")
   177     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))")
   178   |> Context.theory_map;
   179 
   180 fun typed_print_translation (a, txt) =
   181   txt |> ML_Context.use_let ("val typed_print_translation: (string * (" ^ advancedT a ^
   182       "bool -> typ -> term list -> term)) list")
   183     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
   184   |> Context.theory_map;
   185 
   186 val token_translation =
   187   ML_Context.use_let "val token_translation: (string * string * (string -> string * real)) list"
   188     "Context.map_theory (Sign.add_tokentrfuns token_translation)"
   189   #> Context.theory_map;
   190 
   191 end;
   192 
   193 
   194 (* oracles *)
   195 
   196 fun oracle name typ oracle =
   197   let val txt =
   198     "local\n\
   199     \  type T = " ^ typ ^ ";\n\
   200     \  val oracle: theory -> T -> term = " ^ oracle ^ ";\n\
   201     \  val name = " ^ quote name ^ ";\n\
   202     \  exception Arg of T;\n\
   203     \  val _ = ML_Context.>> (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x));\n\
   204     \  val thy = ML_Context.the_context ();\n\
   205     \  val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\
   206     \in\n\
   207     \  fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\
   208     \end;\n";
   209   in ML_Context.use_mltext_update txt false end
   210   |> Context.theory_map;
   211 
   212 
   213 (* axioms *)
   214 
   215 fun add_axms f args thy =
   216   f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy;
   217 
   218 val add_axioms = add_axms (snd oo PureThy.add_axioms);
   219 
   220 fun add_defs ((unchecked, overloaded), args) =
   221   add_axms
   222     (snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args;
   223 
   224 
   225 (* facts *)
   226 
   227 fun apply_theorems args thy =
   228   let val facts = Attrib.map_facts (Attrib.attribute thy) [(("", []), args)]
   229   in apfst (maps snd) (PureThy.note_thmss "" facts thy) end;
   230 
   231 fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)];
   232 
   233 
   234 (* declarations *)
   235 
   236 val declaration =
   237   ML_Context.use_let
   238     "val declaration: Morphism.morphism -> Context.generic -> Context.generic"
   239   "Context.map_proof (LocalTheory.declaration declaration)"
   240   #> Context.proof_map;
   241 
   242 
   243 (* simprocs *)
   244 
   245 fun simproc_setup name lhss proc identifier =
   246   ML_Context.use_let
   247     "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
   248   ("Context.map_proof (Simplifier.def_simproc {name = " ^ ML_Syntax.print_string name ^ ", \
   249     \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
   250     \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})") proc
   251   |> Context.proof_map;
   252 
   253 
   254 (* goals *)
   255 
   256 fun goal opt_chain goal stmt int =
   257   opt_chain #> goal NONE (K Seq.single) stmt int;
   258 
   259 val have = goal I Proof.have;
   260 val hence = goal Proof.chain Proof.have;
   261 val show = goal I Proof.show;
   262 val thus = goal Proof.chain Proof.show;
   263 
   264 
   265 (* local endings *)
   266 
   267 fun local_qed m = Toplevel.proofs (Proof.local_qed (m, true));
   268 val local_terminal_proof = Toplevel.proofs o Proof.local_terminal_proof;
   269 val local_default_proof = Toplevel.proofs Proof.local_default_proof;
   270 val local_immediate_proof = Toplevel.proofs Proof.local_immediate_proof;
   271 val local_done_proof = Toplevel.proofs Proof.local_done_proof;
   272 val local_skip_proof = Toplevel.proofs' Proof.local_skip_proof;
   273 
   274 val skip_local_qed =
   275   Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF));
   276 
   277 
   278 (* global endings *)
   279 
   280 fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
   281 val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
   282 val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
   283 val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
   284 val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
   285 val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
   286 
   287 val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1);
   288 
   289 
   290 (* common endings *)
   291 
   292 fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
   293 fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
   294 val default_proof = local_default_proof o global_default_proof;
   295 val immediate_proof = local_immediate_proof o global_immediate_proof;
   296 val done_proof = local_done_proof o global_done_proof;
   297 val skip_proof = local_skip_proof o global_skip_proof;
   298 
   299 
   300 (* init and exit *)
   301 
   302 fun begin_theory name imports uses =
   303   ThyInfo.begin_theory Present.begin_theory name imports (map (apfst Path.explode) uses);
   304 
   305 fun end_theory thy =
   306   if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy;
   307 
   308 val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
   309 
   310 fun theory (name, imports, uses) =
   311   Toplevel.init_theory (begin_theory name imports uses)
   312     (fn thy => (end_theory thy; ()))
   313     (kill_theory o Context.theory_name);
   314 
   315 val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
   316 
   317 val welcome = Toplevel.imperative (writeln o Session.welcome);
   318 
   319 val exit = Toplevel.keep (fn state =>
   320   (ML_Context.set_context (try Toplevel.generic_theory_of state); raise Toplevel.TERMINATE));
   321 
   322 val quit = Toplevel.imperative quit;
   323 
   324 
   325 (* touch theories *)
   326 
   327 fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
   328 val touch_all_thys = Toplevel.imperative ThyInfo.touch_all_thys;
   329 fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
   330 fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
   331 fun kill_thy name = Toplevel.imperative (fn () => kill_theory name);
   332 
   333 
   334 (* print state *)
   335 
   336 fun with_modes modes e =
   337   Library.setmp print_mode (modes @ ! print_mode) e ();
   338 
   339 fun set_limit _ NONE = ()
   340   | set_limit r (SOME n) = r := n;
   341 
   342 fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
   343   (set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
   344     with_modes modes (fn () => Toplevel.print_state true state)));
   345 
   346 val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
   347 val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
   348 
   349 
   350 (* history commands *)
   351 
   352 val redo =
   353   Toplevel.history History.redo o
   354   Toplevel.actual_proof ProofHistory.redo o
   355   Toplevel.skip_proof History.redo;
   356 
   357 fun undos_proof n =
   358   Toplevel.actual_proof (fn prf =>
   359     if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o
   360   Toplevel.skip_proof (fn h =>
   361     if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h);
   362 
   363 fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist =>
   364   if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF
   365   else (f (); History.undo hist));
   366 
   367 val kill_proof = kill_proof_notify (K ());
   368 
   369 val undo_theory = Toplevel.history (fn hist =>
   370   if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist);
   371 
   372 val undo = Toplevel.kill o undo_theory o Toplevel.undo_exit o undos_proof 1;
   373 
   374 fun cannot_undo "end" = undo   (*ProofGeneral legacy*)
   375   | cannot_undo txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt));
   376 
   377 val kill = Toplevel.kill o kill_proof;
   378 
   379 val back =
   380   Toplevel.actual_proof ProofHistory.back o
   381   Toplevel.skip_proof (History.apply I);
   382 
   383 
   384 (* use ML text *)
   385 
   386 fun use path = Toplevel.keep (fn state =>
   387   ML_Context.setmp (try Toplevel.generic_theory_of state) (ThyInfo.load_file false) path);
   388 
   389 (*passes changes of theory context*)
   390 val use_mltext_theory = Toplevel.theory' o (Context.theory_map oo ML_Context.use_mltext_update);
   391 
   392 (*ignore result theory context*)
   393 fun use_mltext v txt = Toplevel.keep' (fn verb => fn state =>
   394   (ML_Context.use_mltext txt (v andalso verb) (try Toplevel.generic_theory_of state)));
   395 
   396 val use_commit = Toplevel.imperative Secure.commit;
   397 
   398 
   399 (* current working directory *)
   400 
   401 fun cd path = Toplevel.imperative (fn () => (File.cd path));
   402 val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
   403 
   404 
   405 (* load theory files *)
   406 
   407 fun use_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy name);
   408 fun use_thy_only name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy_only name);
   409 fun update_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.update_thy name);
   410 fun update_thy_only name =
   411   Toplevel.imperative (fn () => ML_Context.save ThyInfo.update_thy_only name);
   412 
   413 
   414 (* present draft files *)
   415 
   416 fun display_drafts files = Toplevel.imperative (fn () =>
   417   let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
   418   in File.isatool ("display -c " ^ outfile ^ " &"); () end);
   419 
   420 fun print_drafts files = Toplevel.imperative (fn () =>
   421   let val outfile = File.shell_path (Present.drafts "ps" files)
   422   in File.isatool ("print -c " ^ outfile); () end);
   423 
   424 
   425 (* pretty_setmargin *)
   426 
   427 fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
   428 
   429 
   430 (* print parts of theory and proof context *)
   431 
   432 val print_context = Toplevel.keep Toplevel.print_state_context;
   433 
   434 fun print_theory verbose = Toplevel.unknown_theory o
   435   Toplevel.keep (Pretty.writeln o ProofDisplay.pretty_full_theory verbose o Toplevel.theory_of);
   436 
   437 val print_syntax = Toplevel.unknown_context o
   438   Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
   439 
   440 val print_abbrevs = Toplevel.unknown_context o
   441   Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
   442 
   443 val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
   444   ProofContext.setmp_verbose
   445     ProofContext.print_lthms (Toplevel.context_of state));
   446 
   447 val print_theorems_proof = Toplevel.keep (fn state =>
   448   ProofContext.setmp_verbose
   449     ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
   450 
   451 val print_theorems_theory = Toplevel.keep (fn state =>
   452   Toplevel.theory_of state |>
   453   (case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
   454     SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy)
   455   | _ => ProofDisplay.print_theorems));
   456 
   457 val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
   458 
   459 val print_locales = Toplevel.unknown_theory o
   460   Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
   461 
   462 fun print_locale (show_facts, (imports, body)) = Toplevel.unknown_theory o
   463   Toplevel.keep (fn state =>
   464     Locale.print_locale (Toplevel.theory_of state) show_facts imports body);
   465 
   466 fun print_registrations show_wits name = Toplevel.unknown_context o
   467   Toplevel.keep (Toplevel.node_case
   468       (Context.cases (Locale.print_global_registrations show_wits name)
   469         (Locale.print_local_registrations show_wits name))
   470     (Locale.print_local_registrations show_wits name o Proof.context_of));
   471 
   472 val print_attributes = Toplevel.unknown_theory o
   473   Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
   474 
   475 val print_simpset = Toplevel.unknown_context o
   476   Toplevel.keep (Toplevel.node_case
   477     (Context.cases Simplifier.print_simpset Simplifier.print_local_simpset)
   478     (Simplifier.print_local_simpset o Proof.context_of));
   479 
   480 val print_rules = Toplevel.unknown_context o
   481   Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
   482 
   483 val print_induct_rules = Toplevel.unknown_context o
   484   Toplevel.keep (InductAttrib.print_rules o Toplevel.context_of);
   485 
   486 val print_trans_rules = Toplevel.unknown_context o
   487   Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
   488 
   489 val print_methods = Toplevel.unknown_theory o
   490   Toplevel.keep (Method.print_methods o Toplevel.theory_of);
   491 
   492 val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations;
   493 
   494 val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   495   let
   496     val thy = Toplevel.theory_of state;
   497     val all_thys = sort Context.thy_ord (thy :: Theory.ancestors_of thy);
   498     val gr = all_thys |> map (fn node =>
   499       let
   500         val name = Context.theory_name node;
   501         val parents = map Context.theory_name (Theory.parents_of node);
   502       in {name = name, ID = name, parents = parents, dir = "", unfold = true, path = ""} end);
   503   in Present.display_graph gr end);
   504 
   505 val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   506   let
   507     val thy = Toplevel.theory_of state;
   508     val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
   509     val {classes, ...} = Sorts.rep_algebra algebra;
   510     fun entry (c, (i, (_, cs))) =
   511       (i, {name = NameSpace.extern space c, ID = c, parents = cs,
   512             dir = "", unfold = true, path = ""});
   513     val gr =
   514       Graph.fold (cons o entry) classes []
   515       |> sort (int_ord o pairself #1) |> map #2;
   516   in Present.display_graph gr end);
   517 
   518 
   519 (* retrieve theorems *)
   520 
   521 fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   522   ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
   523 
   524 fun find_theorems ((opt_lim, rem_dups), spec) = 
   525   Toplevel.unknown_theory o Toplevel.keep (fn state =>
   526   let
   527     val proof_state = Toplevel.enter_proof_body state;
   528     val ctxt = Proof.context_of proof_state;
   529     val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
   530   in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end);
   531 
   532 
   533 (* print proof context contents *)
   534 
   535 val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
   536   ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
   537 
   538 val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
   539   ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
   540 
   541 
   542 (* print theorems, terms, types etc. *)
   543 
   544 local
   545 
   546 fun string_of_stmts state args =
   547   Proof.get_thmss state args
   548   |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
   549   |> Pretty.chunks2 |> Pretty.string_of;
   550 
   551 fun string_of_thms state args =
   552   Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
   553     (Proof.get_thmss state args));
   554 
   555 fun string_of_prfs full state arg =
   556   Pretty.string_of (case arg of
   557       NONE =>
   558         let
   559           val (ctxt, (_, thm)) = Proof.get_goal state;
   560           val {thy, der = (_, prf), ...} = Thm.rep_thm thm;
   561           val prop = Thm.full_prop_of thm;
   562           val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
   563         in
   564           ProofContext.pretty_proof ctxt
   565             (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
   566         end
   567     | SOME args => Pretty.chunks
   568         (map (ProofContext.pretty_proof_of (Proof.context_of state) full)
   569           (Proof.get_thmss state args)));
   570 
   571 fun string_of_prop state s =
   572   let
   573     val ctxt = Proof.context_of state;
   574     val prop = ProofContext.read_prop ctxt s;
   575   in Pretty.string_of (Pretty.quote (ProofContext.pretty_term ctxt prop)) end;
   576 
   577 fun string_of_term state s =
   578   let
   579     val ctxt = Proof.context_of state;
   580     val t = ProofContext.read_term ctxt s;
   581     val T = Term.type_of t;
   582   in
   583     Pretty.string_of
   584       (Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk,
   585         Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)])
   586   end;
   587 
   588 fun string_of_type state s =
   589   let
   590     val ctxt = Proof.context_of state;
   591     val T = ProofContext.read_typ ctxt s;
   592   in Pretty.string_of (Pretty.quote (ProofContext.pretty_typ ctxt T)) end;
   593 
   594 fun print_item string_of (modes, arg) = Toplevel.keep (fn state => with_modes modes (fn () =>
   595   writeln (string_of (Toplevel.enter_proof_body state) arg)));
   596 
   597 in
   598 
   599 val print_stmts = print_item string_of_stmts;
   600 val print_thms = print_item string_of_thms;
   601 val print_prfs = print_item o string_of_prfs;
   602 val print_prop = print_item string_of_prop;
   603 val print_term = print_item string_of_term;
   604 val print_type = print_item string_of_type;
   605 
   606 end;
   607 
   608 
   609 (* markup commands *)
   610 
   611 fun add_header s = Toplevel.keep' (fn int => fn state =>
   612   (if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF;
   613    if int then OuterSyntax.check_text s NONE else ()));
   614 
   615 local
   616 
   617 fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
   618   | present f (s, _) false node =
   619       ML_Context.setmp (try (Toplevel.cases_node I (Context.Proof o Proof.context_of)) node) f s;
   620 
   621 fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
   622 fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
   623 
   624 in
   625 
   626 val add_chapter       = present_local_theory Present.section;
   627 val add_section       = present_local_theory Present.section;
   628 val add_subsection    = present_local_theory Present.subsection;
   629 val add_subsubsection = present_local_theory Present.subsubsection;
   630 val add_text          = present_local_theory (K ());
   631 fun add_text_raw txt  = present_local_theory (K ()) (NONE, txt);
   632 val add_txt           = present_proof (K ());
   633 val add_txt_raw       = add_txt;
   634 val add_sect          = add_txt;
   635 val add_subsect       = add_txt;
   636 val add_subsubsect    = add_txt;
   637 
   638 end;
   639 
   640 end;