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