src/Pure/Isar/isar_cmd.ML
author wenzelm
Mon Nov 28 22:05:32 2011 +0100 (2011-11-28 ago)
changeset 45666 d83797ef0d2d
parent 45488 6d71d9e52369
child 46922 3717f3878714
permissions -rw-r--r--
separate module for concrete Isabelle markup;
     1 (*  Title:      Pure/Isar/isar_cmd.ML
     2     Author:     Markus Wenzel, TU Muenchen
     3 
     4 Miscellaneous Isar commands.
     5 *)
     6 
     7 signature ISAR_CMD =
     8 sig
     9   val global_setup: Symbol_Pos.text * Position.T -> theory -> theory
    10   val local_setup: Symbol_Pos.text * Position.T -> Proof.context -> Proof.context
    11   val parse_ast_translation: bool * (Symbol_Pos.text * Position.T) -> theory -> theory
    12   val parse_translation: bool * (Symbol_Pos.text * Position.T) -> theory -> theory
    13   val print_translation: bool * (Symbol_Pos.text * Position.T) -> theory -> theory
    14   val typed_print_translation: bool * (Symbol_Pos.text * Position.T) -> theory -> theory
    15   val print_ast_translation: bool * (Symbol_Pos.text * Position.T) -> theory -> theory
    16   val translations: (xstring * string) Syntax.trrule list -> theory -> theory
    17   val no_translations: (xstring * string) Syntax.trrule list -> theory -> theory
    18   val oracle: bstring * Position.T -> Symbol_Pos.text * Position.T -> theory -> theory
    19   val add_axioms: (Attrib.binding * string) list -> theory -> theory
    20   val add_defs: (bool * bool) * ((binding * string) * Attrib.src list) list -> theory -> theory
    21   val declaration: {syntax: bool, pervasive: bool} ->
    22     Symbol_Pos.text * Position.T -> local_theory -> local_theory
    23   val simproc_setup: string * Position.T -> string list -> Symbol_Pos.text * Position.T ->
    24     string list -> local_theory -> local_theory
    25   val hide_class: bool -> xstring list -> theory -> theory
    26   val hide_type: bool -> xstring list -> theory -> theory
    27   val hide_const: bool -> xstring list -> theory -> theory
    28   val hide_fact: bool -> xstring list -> theory -> theory
    29   val have: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    30   val hence: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    31   val show: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    32   val thus: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    33   val qed: Method.text option -> Toplevel.transition -> Toplevel.transition
    34   val terminal_proof: Method.text * Method.text option ->
    35     Toplevel.transition -> Toplevel.transition
    36   val default_proof: Toplevel.transition -> Toplevel.transition
    37   val immediate_proof: Toplevel.transition -> Toplevel.transition
    38   val done_proof: Toplevel.transition -> Toplevel.transition
    39   val skip_proof: Toplevel.transition -> Toplevel.transition
    40   val ml_diag: bool -> Symbol_Pos.text * Position.T -> Toplevel.transition -> Toplevel.transition
    41   val diag_state: unit -> Toplevel.state
    42   val diag_goal: unit -> {context: Proof.context, facts: thm list, goal: thm}
    43   val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
    44   val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
    45   val print_context: Toplevel.transition -> Toplevel.transition
    46   val print_theory: bool -> Toplevel.transition -> Toplevel.transition
    47   val print_syntax: Toplevel.transition -> Toplevel.transition
    48   val print_abbrevs: Toplevel.transition -> Toplevel.transition
    49   val print_facts: Toplevel.transition -> Toplevel.transition
    50   val print_configs: Toplevel.transition -> Toplevel.transition
    51   val print_theorems: bool -> Toplevel.transition -> Toplevel.transition
    52   val print_locales: Toplevel.transition -> Toplevel.transition
    53   val print_locale: bool * xstring -> Toplevel.transition -> Toplevel.transition
    54   val print_registrations: string -> Toplevel.transition -> Toplevel.transition
    55   val print_dependencies: bool * Expression.expression -> Toplevel.transition
    56     -> Toplevel.transition
    57   val print_attributes: Toplevel.transition -> Toplevel.transition
    58   val print_simpset: Toplevel.transition -> Toplevel.transition
    59   val print_rules: Toplevel.transition -> Toplevel.transition
    60   val print_trans_rules: Toplevel.transition -> Toplevel.transition
    61   val print_methods: Toplevel.transition -> Toplevel.transition
    62   val print_antiquotations: Toplevel.transition -> Toplevel.transition
    63   val class_deps: Toplevel.transition -> Toplevel.transition
    64   val thy_deps: Toplevel.transition -> Toplevel.transition
    65   val thm_deps: (Facts.ref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
    66   val unused_thms: (string list * string list option) option ->
    67     Toplevel.transition -> Toplevel.transition
    68   val print_binds: Toplevel.transition -> Toplevel.transition
    69   val print_cases: Toplevel.transition -> Toplevel.transition
    70   val print_stmts: string list * (Facts.ref * Attrib.src list) list
    71     -> Toplevel.transition -> Toplevel.transition
    72   val print_thms: string list * (Facts.ref * Attrib.src list) list
    73     -> Toplevel.transition -> Toplevel.transition
    74   val print_prfs: bool -> string list * (Facts.ref * Attrib.src list) list option
    75     -> Toplevel.transition -> Toplevel.transition
    76   val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
    77   val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
    78   val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
    79   val header_markup: Symbol_Pos.text * Position.T -> Toplevel.transition -> Toplevel.transition
    80   val local_theory_markup: (xstring * Position.T) option * (Symbol_Pos.text * Position.T) ->
    81     Toplevel.transition -> Toplevel.transition
    82   val proof_markup: Symbol_Pos.text * Position.T -> Toplevel.transition -> Toplevel.transition
    83 end;
    84 
    85 structure Isar_Cmd: ISAR_CMD =
    86 struct
    87 
    88 
    89 (** theory declarations **)
    90 
    91 (* generic setup *)
    92 
    93 fun global_setup (txt, pos) =
    94   ML_Lex.read pos txt
    95   |> ML_Context.expression pos "val setup: theory -> theory" "Context.map_theory setup"
    96   |> Context.theory_map;
    97 
    98 fun local_setup (txt, pos) =
    99   ML_Lex.read pos txt
   100   |> ML_Context.expression pos "val setup: local_theory -> local_theory" "Context.map_proof setup"
   101   |> Context.proof_map;
   102 
   103 
   104 (* translation functions *)
   105 
   106 local
   107 
   108 fun advancedT false = ""
   109   | advancedT true = "Proof.context -> ";
   110 
   111 fun advancedN false = ""
   112   | advancedN true = "advanced_";
   113 
   114 in
   115 
   116 fun parse_ast_translation (a, (txt, pos)) =
   117   ML_Lex.read pos txt
   118   |> ML_Context.expression pos
   119     ("val parse_ast_translation: (string * (" ^ advancedT a ^
   120       "Ast.ast list -> Ast.ast)) list")
   121     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
   122   |> Context.theory_map;
   123 
   124 fun parse_translation (a, (txt, pos)) =
   125   ML_Lex.read pos txt
   126   |> ML_Context.expression pos
   127     ("val parse_translation: (string * (" ^ advancedT a ^
   128       "term list -> term)) list")
   129     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))")
   130   |> Context.theory_map;
   131 
   132 fun print_translation (a, (txt, pos)) =
   133   ML_Lex.read pos txt
   134   |> ML_Context.expression pos
   135     ("val print_translation: (string * (" ^ advancedT a ^
   136       "term list -> term)) list")
   137     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
   138   |> Context.theory_map;
   139 
   140 fun print_ast_translation (a, (txt, pos)) =
   141   ML_Lex.read pos txt
   142   |> ML_Context.expression pos
   143     ("val print_ast_translation: (string * (" ^ advancedT a ^
   144       "Ast.ast list -> Ast.ast)) list")
   145     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))")
   146   |> Context.theory_map;
   147 
   148 fun typed_print_translation (a, (txt, pos)) =
   149   ML_Lex.read pos txt
   150   |> ML_Context.expression pos
   151     ("val typed_print_translation: (string * (" ^ advancedT a ^ "typ -> term list -> term)) list")
   152     ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
   153   |> Context.theory_map;
   154 
   155 end;
   156 
   157 
   158 (* translation rules *)
   159 
   160 fun read_trrules thy raw_rules =
   161   let
   162     val ctxt = Proof_Context.init_global thy;
   163   in
   164     raw_rules |> map (Syntax.map_trrule (fn (r, s) =>
   165       Syntax_Phases.parse_ast_pattern ctxt (Proof_Context.intern_type ctxt r, s)))
   166   end;
   167 
   168 fun translations args thy = Sign.add_trrules (read_trrules thy args) thy;
   169 fun no_translations args thy = Sign.del_trrules (read_trrules thy args) thy;
   170 
   171 
   172 (* oracles *)
   173 
   174 fun oracle (name, pos) (body_txt, body_pos) =
   175   let
   176     val body = ML_Lex.read body_pos body_txt;
   177     val ants =
   178       ML_Lex.read Position.none
   179        ("local\n\
   180         \  val binding = " ^ ML_Syntax.make_binding (name, pos) ^ ";\n\
   181         \  val body = ") @ body @ ML_Lex.read Position.none (";\n\
   182         \in\n\
   183         \  val " ^ name ^ " = snd (Context.>>> (Context.map_theory_result (Thm.add_oracle (binding, body))));\n\
   184         \end;\n");
   185   in Context.theory_map (ML_Context.exec (fn () => ML_Context.eval false body_pos ants)) end;
   186 
   187 
   188 (* old-style axioms *)
   189 
   190 val add_axioms = fold (snd oo Specification.axiom_cmd);
   191 
   192 fun add_defs ((unchecked, overloaded), args) thy =
   193   thy |>
   194     (if unchecked then Global_Theory.add_defs_unchecked_cmd else Global_Theory.add_defs_cmd)
   195       overloaded (map (fn ((b, ax), srcs) => ((b, ax), map (Attrib.attribute thy) srcs)) args)
   196   |> snd;
   197 
   198 
   199 (* declarations *)
   200 
   201 fun declaration {syntax, pervasive} (txt, pos) =
   202   ML_Lex.read pos txt
   203   |> ML_Context.expression pos
   204     "val declaration: Morphism.declaration"
   205     ("Context.map_proof (Local_Theory.declaration {syntax = " ^ Bool.toString syntax ^ ", \
   206       \pervasive = " ^ Bool.toString pervasive ^ "} declaration)")
   207   |> Context.proof_map;
   208 
   209 
   210 (* simprocs *)
   211 
   212 fun simproc_setup name lhss (txt, pos) identifier =
   213   ML_Lex.read pos txt
   214   |> ML_Context.expression pos
   215     "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
   216     ("Context.map_proof (Simplifier.def_simproc_cmd {name = " ^ ML_Syntax.make_binding name ^ ", \
   217       \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
   218       \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})")
   219   |> Context.proof_map;
   220 
   221 
   222 (* hide names *)
   223 
   224 fun hide_names intern check hide fully xnames thy =
   225   let
   226     val names = map (intern thy) xnames;
   227     val bads = filter_out (check thy) names;
   228   in
   229     if null bads then fold (hide fully) names thy
   230     else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
   231   end;
   232 
   233 val hide_class = hide_names Sign.intern_class (can o Sign.certify_class) Sign.hide_class;
   234 val hide_type = hide_names Sign.intern_type Sign.declared_tyname Sign.hide_type;
   235 val hide_const = hide_names Sign.intern_const Sign.declared_const Sign.hide_const;
   236 val hide_fact =
   237   hide_names Global_Theory.intern_fact Global_Theory.defined_fact Global_Theory.hide_fact;
   238 
   239 
   240 (* goals *)
   241 
   242 fun goal opt_chain goal stmt int =
   243   opt_chain #> goal NONE (K I) stmt int;
   244 
   245 val have = goal I Proof.have_cmd;
   246 val hence = goal Proof.chain Proof.have_cmd;
   247 val show = goal I Proof.show_cmd;
   248 val thus = goal Proof.chain Proof.show_cmd;
   249 
   250 
   251 (* local endings *)
   252 
   253 fun local_qed m = Toplevel.proof (Proof.local_qed (m, true));
   254 val local_terminal_proof = Toplevel.proof' o Proof.local_future_terminal_proof;
   255 val local_default_proof = Toplevel.proof Proof.local_default_proof;
   256 val local_immediate_proof = Toplevel.proof Proof.local_immediate_proof;
   257 val local_done_proof = Toplevel.proof Proof.local_done_proof;
   258 val local_skip_proof = Toplevel.proof' Proof.local_skip_proof;
   259 
   260 val skip_local_qed = Toplevel.skip_proof (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF);
   261 
   262 
   263 (* global endings *)
   264 
   265 fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
   266 val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
   267 val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
   268 val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
   269 val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
   270 val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
   271 
   272 val skip_global_qed = Toplevel.skip_proof_to_theory (fn n => n = 1);
   273 
   274 
   275 (* common endings *)
   276 
   277 fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
   278 fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
   279 val default_proof = local_default_proof o global_default_proof;
   280 val immediate_proof = local_immediate_proof o global_immediate_proof;
   281 val done_proof = local_done_proof o global_done_proof;
   282 val skip_proof = local_skip_proof o global_skip_proof;
   283 
   284 
   285 (* diagnostic ML evaluation *)
   286 
   287 structure Diag_State = Proof_Data
   288 (
   289   type T = Toplevel.state;
   290   fun init _ = Toplevel.toplevel;
   291 );
   292 
   293 fun ml_diag verbose (txt, pos) = Toplevel.keep (fn state =>
   294   let val opt_ctxt =
   295     try Toplevel.generic_theory_of state
   296     |> Option.map (Context.proof_of #> Diag_State.put state)
   297   in ML_Context.eval_text_in opt_ctxt verbose pos txt end);
   298 
   299 fun diag_state () = Diag_State.get (ML_Context.the_local_context ());
   300 
   301 fun diag_goal () =
   302   Proof.goal (Toplevel.proof_of (diag_state ()))
   303     handle Toplevel.UNDEF => error "No goal present";
   304 
   305 val _ =
   306   Context.>> (Context.map_theory
   307    (ML_Antiquote.value (Binding.qualify true "Isar" (Binding.name "state"))
   308       (Scan.succeed "Isar_Cmd.diag_state ()") #>
   309     ML_Antiquote.value (Binding.qualify true "Isar" (Binding.name "goal"))
   310       (Scan.succeed "Isar_Cmd.diag_goal ()")));
   311 
   312 
   313 (* present draft files *)
   314 
   315 fun display_drafts files = Toplevel.imperative (fn () =>
   316   let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
   317   in Isabelle_System.isabelle_tool "display" ("-c " ^ outfile ^ " &"); () end);
   318 
   319 fun print_drafts files = Toplevel.imperative (fn () =>
   320   let val outfile = File.shell_path (Present.drafts "ps" files)
   321   in Isabelle_System.isabelle_tool "print" ("-c " ^ outfile); () end);
   322 
   323 
   324 (* print parts of theory and proof context *)
   325 
   326 val print_context = Toplevel.keep Toplevel.print_state_context;
   327 
   328 fun print_theory verbose = Toplevel.unknown_theory o
   329   Toplevel.keep (Pretty.writeln o Proof_Display.pretty_full_theory verbose o Toplevel.theory_of);
   330 
   331 val print_syntax = Toplevel.unknown_context o
   332   Toplevel.keep (Proof_Context.print_syntax o Toplevel.context_of);
   333 
   334 val print_abbrevs = Toplevel.unknown_context o
   335   Toplevel.keep (Proof_Context.print_abbrevs o Toplevel.context_of);
   336 
   337 val print_facts = Toplevel.unknown_context o
   338   Toplevel.keep (Proof_Context.print_lthms o Toplevel.context_of);
   339 
   340 val print_configs = Toplevel.unknown_context o
   341   Toplevel.keep (Attrib.print_configs o Toplevel.context_of);
   342 
   343 val print_theorems_proof =
   344   Toplevel.keep (Proof_Context.print_lthms o Proof.context_of o Toplevel.proof_of);
   345 
   346 fun print_theorems_theory verbose = Toplevel.keep (fn state =>
   347   Toplevel.theory_of state |>
   348   (case Toplevel.previous_context_of state of
   349     SOME prev => Proof_Display.print_theorems_diff verbose (Proof_Context.theory_of prev)
   350   | NONE => Proof_Display.print_theorems verbose));
   351 
   352 fun print_theorems verbose =
   353   Toplevel.unknown_context o print_theorems_theory verbose o print_theorems_proof;
   354 
   355 val print_locales = Toplevel.unknown_theory o
   356   Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
   357 
   358 fun print_locale (verbose, name) = Toplevel.unknown_theory o
   359   Toplevel.keep (fn state => Locale.print_locale (Toplevel.theory_of state) verbose name);
   360 
   361 fun print_registrations name = Toplevel.unknown_context o
   362   Toplevel.keep (fn state =>
   363     Locale.print_registrations (Toplevel.context_of state) name);
   364 
   365 fun print_dependencies (clean, expression) = Toplevel.unknown_context o
   366   Toplevel.keep (fn state =>
   367     Expression.print_dependencies (Toplevel.context_of state) clean expression);
   368 
   369 val print_attributes = Toplevel.unknown_theory o
   370   Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
   371 
   372 val print_simpset = Toplevel.unknown_context o
   373   Toplevel.keep (fn state =>
   374     let val ctxt = Toplevel.context_of state
   375     in Pretty.writeln (Simplifier.pretty_ss ctxt (simpset_of ctxt)) end);
   376 
   377 val print_rules = Toplevel.unknown_context o
   378   Toplevel.keep (Context_Rules.print_rules o Toplevel.context_of);
   379 
   380 val print_trans_rules = Toplevel.unknown_context o
   381   Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
   382 
   383 val print_methods = Toplevel.unknown_theory o
   384   Toplevel.keep (Method.print_methods o Toplevel.theory_of);
   385 
   386 val print_antiquotations =
   387   Toplevel.keep (Thy_Output.print_antiquotations o Toplevel.context_of);
   388 
   389 val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   390   let
   391     val thy = Toplevel.theory_of state;
   392     val thy_session = Present.session_name thy;
   393 
   394     val gr = rev (Theory.nodes_of thy) |> map (fn node =>
   395       let
   396         val name = Context.theory_name node;
   397         val parents = map Context.theory_name (Theory.parents_of node);
   398         val session = Present.session_name node;
   399         val unfold = (session = thy_session);
   400       in {name = name, ID = name, parents = parents, dir = session, unfold = unfold, path = ""} end);
   401   in Present.display_graph gr end);
   402 
   403 val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   404   let
   405     val ctxt = Toplevel.context_of state;
   406     val {classes = (space, algebra), ...} = Type.rep_tsig (Proof_Context.tsig_of ctxt);
   407     val classes = Sorts.classes_of algebra;
   408     fun entry (c, (i, (_, cs))) =
   409       (i, {name = Name_Space.extern ctxt space c, ID = c, parents = Graph.Keys.dest cs,
   410             dir = "", unfold = true, path = ""});
   411     val gr =
   412       Graph.fold (cons o entry) classes []
   413       |> sort (int_ord o pairself #1) |> map #2;
   414   in Present.display_graph gr end);
   415 
   416 fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   417   Thm_Deps.thm_deps (Toplevel.theory_of state)
   418     (Attrib.eval_thms (Toplevel.context_of state) args));
   419 
   420 
   421 (* find unused theorems *)
   422 
   423 fun unused_thms opt_range = Toplevel.keep (fn state =>
   424   let
   425     val thy = Toplevel.theory_of state;
   426     val ctxt = Toplevel.context_of state;
   427     fun pretty_thm (a, th) = Proof_Context.pretty_fact ctxt (a, [th]);
   428     val get_theory = Context.get_theory thy;
   429   in
   430     Thm_Deps.unused_thms
   431       (case opt_range of
   432         NONE => (Theory.parents_of thy, [thy])
   433       | SOME (xs, NONE) => (map get_theory xs, [thy])
   434       | SOME (xs, SOME ys) => (map get_theory xs, map get_theory ys))
   435     |> map pretty_thm |> Pretty.chunks |> Pretty.writeln
   436   end);
   437 
   438 
   439 (* print proof context contents *)
   440 
   441 val print_binds = Toplevel.unknown_context o
   442   Toplevel.keep (Proof_Context.print_binds o Toplevel.context_of);
   443 
   444 val print_cases = Toplevel.unknown_context o
   445   Toplevel.keep (Proof_Context.print_cases o Toplevel.context_of);
   446 
   447 
   448 (* print theorems, terms, types etc. *)
   449 
   450 local
   451 
   452 fun string_of_stmts ctxt args =
   453   Attrib.eval_thms ctxt args
   454   |> map (Element.pretty_statement ctxt Thm.theoremK)
   455   |> Pretty.chunks2 |> Pretty.string_of;
   456 
   457 fun string_of_thms ctxt args =
   458   Pretty.string_of (Display.pretty_thms ctxt (Attrib.eval_thms ctxt args));
   459 
   460 fun string_of_prfs full state arg =
   461   Pretty.string_of
   462     (case arg of
   463       NONE =>
   464         let
   465           val {context = ctxt, goal = thm} = Proof.simple_goal (Toplevel.proof_of state);
   466           val thy = Proof_Context.theory_of ctxt;
   467           val prf = Thm.proof_of thm;
   468           val prop = Thm.full_prop_of thm;
   469           val prf' = Proofterm.rewrite_proof_notypes ([], []) prf;
   470         in
   471           Proof_Syntax.pretty_proof ctxt
   472             (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
   473         end
   474     | SOME srcs =>
   475         let val ctxt = Toplevel.context_of state
   476         in map (Proof_Syntax.pretty_proof_of ctxt full) (Attrib.eval_thms ctxt srcs) end
   477         |> Pretty.chunks);
   478 
   479 fun string_of_prop ctxt s =
   480   let
   481     val prop = Syntax.read_prop ctxt s;
   482     val ctxt' = Variable.auto_fixes prop ctxt;
   483   in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt' prop)) end;
   484 
   485 fun string_of_term ctxt s =
   486   let
   487     val t = Syntax.read_term ctxt s;
   488     val T = Term.type_of t;
   489     val ctxt' = Variable.auto_fixes t ctxt;
   490   in
   491     Pretty.string_of
   492       (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t), Pretty.fbrk,
   493         Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' T)])
   494   end;
   495 
   496 fun string_of_type ctxt s =
   497   let val T = Syntax.read_typ ctxt s
   498   in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end;
   499 
   500 fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
   501   Print_Mode.with_modes modes (fn () => writeln (string_of state arg)) ());
   502 
   503 in
   504 
   505 val print_stmts = print_item (string_of_stmts o Toplevel.context_of);
   506 val print_thms = print_item (string_of_thms o Toplevel.context_of);
   507 val print_prfs = print_item o string_of_prfs;
   508 val print_prop = print_item (string_of_prop o Toplevel.context_of);
   509 val print_term = print_item (string_of_term o Toplevel.context_of);
   510 val print_type = print_item (string_of_type o Toplevel.context_of);
   511 
   512 end;
   513 
   514 
   515 (* markup commands *)
   516 
   517 fun check_text (txt, pos) state =
   518  (Position.report pos Isabelle_Markup.doc_source;
   519   ignore (Thy_Output.eval_antiquote (#1 (Keyword.get_lexicons ())) state (txt, pos)));
   520 
   521 fun header_markup txt = Toplevel.keep (fn state =>
   522   if Toplevel.is_toplevel state then check_text txt state
   523   else raise Toplevel.UNDEF);
   524 
   525 fun local_theory_markup (loc, txt) = Toplevel.present_local_theory loc (check_text txt);
   526 val proof_markup = Toplevel.present_proof o check_text;
   527 
   528 end;