1 (* Title: Pure/Isar/isar_cmd.ML
3 Author: Markus Wenzel, TU Muenchen
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_thy: string -> Toplevel.transition -> Toplevel.transition
50 val remove_thy: string -> Toplevel.transition -> Toplevel.transition
51 val kill_thy: string -> Toplevel.transition -> Toplevel.transition
52 val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition
53 val disable_pr: Toplevel.transition -> Toplevel.transition
54 val enable_pr: Toplevel.transition -> Toplevel.transition
55 val redo: Toplevel.transition -> Toplevel.transition
56 val undos_proof: int -> Toplevel.transition -> Toplevel.transition
57 val kill_proof_notify: (unit -> unit) -> Toplevel.transition -> Toplevel.transition
58 val kill_proof: Toplevel.transition -> Toplevel.transition
59 val undo_theory: Toplevel.transition -> Toplevel.transition
60 val undo: Toplevel.transition -> Toplevel.transition
61 val cannot_undo: string -> Toplevel.transition -> Toplevel.transition
62 val kill: Toplevel.transition -> Toplevel.transition
63 val back: Toplevel.transition -> Toplevel.transition
64 val use: Path.T -> Toplevel.transition -> Toplevel.transition
65 val use_mltext_theory: string -> Toplevel.transition -> Toplevel.transition
66 val use_mltext: bool -> string -> Toplevel.transition -> Toplevel.transition
67 val use_commit: Toplevel.transition -> Toplevel.transition
68 val nested_command: Markup.property list -> string * Position.T -> 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 display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
73 val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
74 val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition
75 val print_context: Toplevel.transition -> Toplevel.transition
76 val print_theory: bool -> Toplevel.transition -> Toplevel.transition
77 val print_syntax: Toplevel.transition -> Toplevel.transition
78 val print_abbrevs: Toplevel.transition -> Toplevel.transition
79 val print_facts: Toplevel.transition -> Toplevel.transition
80 val print_configs: Toplevel.transition -> Toplevel.transition
81 val print_theorems: Toplevel.transition -> Toplevel.transition
82 val print_locales: Toplevel.transition -> Toplevel.transition
83 val print_locale: bool * (Locale.expr * Element.context list)
84 -> Toplevel.transition -> Toplevel.transition
85 val print_registrations: bool -> string -> Toplevel.transition -> Toplevel.transition
86 val print_attributes: Toplevel.transition -> Toplevel.transition
87 val print_simpset: Toplevel.transition -> Toplevel.transition
88 val print_rules: Toplevel.transition -> Toplevel.transition
89 val print_trans_rules: Toplevel.transition -> Toplevel.transition
90 val print_methods: Toplevel.transition -> Toplevel.transition
91 val print_antiquotations: Toplevel.transition -> Toplevel.transition
92 val class_deps: Toplevel.transition -> Toplevel.transition
93 val thy_deps: Toplevel.transition -> Toplevel.transition
94 val thm_deps: (thmref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
95 val find_theorems: (int option * bool) * (bool * string FindTheorems.criterion) list
96 -> Toplevel.transition -> Toplevel.transition
97 val unused_thms: (string list * string list option) option ->
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
129 structure IsarCmd: ISAR_CMD =
133 (** theory declarations **)
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;
143 (* translation functions *)
147 fun advancedT false = ""
148 | advancedT true = "Proof.context -> ";
150 fun advancedN false = ""
151 | advancedN true = "advanced_";
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;
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;
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;
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;
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;
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;
195 fun oracle name typ oracle =
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\
206 \ fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\
208 in ML_Context.use_mltext_update txt false end
209 |> Context.theory_map;
214 fun add_axms f args thy =
215 f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy;
217 val add_axioms = add_axms (snd oo PureThy.add_axioms);
219 fun add_defs ((unchecked, overloaded), args) =
221 (snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args;
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;
230 fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)];
236 ML_Context.use_let "val declaration: Morphism.declaration"
237 "Context.map_proof (LocalTheory.declaration declaration)"
238 #> Context.proof_map;
243 fun simproc_setup name lhss proc identifier =
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;
254 fun goal opt_chain goal stmt int =
255 opt_chain #> goal NONE (K Seq.single) stmt int;
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;
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;
273 Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF));
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);
285 val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1);
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;
300 fun begin_theory name imports uses =
301 ThyInfo.begin_theory name imports (map (apfst Path.explode) uses);
304 if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy;
306 val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
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);
313 val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
315 val welcome = Toplevel.imperative (writeln o Session.welcome);
317 val exit = Toplevel.keep (fn state =>
318 (CRITICAL (fn () => ML_Context.set_context (try Toplevel.generic_theory_of state));
319 raise Toplevel.TERMINATE));
321 val quit = Toplevel.imperative quit;
326 fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
327 fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
328 fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
329 fun kill_thy name = Toplevel.imperative (fn () => kill_theory name);
334 fun set_limit _ NONE = ()
335 | set_limit r (SOME n) = r := n;
337 fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
338 (set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
339 PrintMode.with_modes modes (Toplevel.print_state true) state));
341 val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
342 val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
345 (* history commands *)
348 Toplevel.history History.redo o
349 Toplevel.actual_proof ProofHistory.redo o
350 Toplevel.skip_proof History.redo;
353 Toplevel.actual_proof (fn prf =>
354 if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o
355 Toplevel.skip_proof (fn h =>
356 if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h);
358 fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist =>
359 if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF
360 else (f (); History.undo hist));
362 val kill_proof = kill_proof_notify (K ());
364 val undo_theory = Toplevel.history (fn hist =>
365 if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist);
367 val undo = Toplevel.kill o undo_theory o Toplevel.undo_exit o undos_proof 1;
369 fun cannot_undo "end" = undo (*ProofGeneral legacy*)
370 | cannot_undo txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt));
372 val kill = Toplevel.kill o kill_proof;
375 Toplevel.actual_proof ProofHistory.back o
376 Toplevel.skip_proof (History.apply I);
381 fun use path = Toplevel.keep (fn state =>
382 ML_Context.setmp (try Toplevel.generic_theory_of state) (ThyInfo.load_file false) path);
384 (*passes changes of theory context*)
385 val use_mltext_theory = Toplevel.theory' o (Context.theory_map oo ML_Context.use_mltext_update);
387 (*ignore result theory context*)
388 fun use_mltext verbose txt = Toplevel.keep' (fn int => fn state =>
389 (ML_Context.use_mltext txt (verbose andalso int) (try Toplevel.generic_theory_of state)));
391 val use_commit = Toplevel.imperative Secure.commit;
394 (* nested commands *)
396 fun nested_command props (str, pos) =
397 let val pos' = Position.of_properties (props |> Position.default_properties pos) in
398 (case OuterSyntax.parse pos' str of
399 [transition] => transition
400 | _ => error "exactly one command expected")
404 (* current working directory *)
406 fun cd path = Toplevel.imperative (fn () => (File.cd path));
407 val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
410 (* load theory files *)
412 fun use_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy name);
415 (* present draft files *)
417 fun display_drafts files = Toplevel.imperative (fn () =>
418 let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
419 in File.isatool ("display -c " ^ outfile ^ " &"); () end);
421 fun print_drafts files = Toplevel.imperative (fn () =>
422 let val outfile = File.shell_path (Present.drafts "ps" files)
423 in File.isatool ("print -c " ^ outfile); () end);
426 (* pretty_setmargin *)
428 fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
431 (* print parts of theory and proof context *)
433 val print_context = Toplevel.keep Toplevel.print_state_context;
435 fun print_theory verbose = Toplevel.unknown_theory o
436 Toplevel.keep (Pretty.writeln o ProofDisplay.pretty_full_theory verbose o Toplevel.theory_of);
438 val print_syntax = Toplevel.unknown_context o
439 Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
441 val print_abbrevs = Toplevel.unknown_context o
442 Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
444 val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
445 ProofContext.setmp_verbose
446 ProofContext.print_lthms (Toplevel.context_of state));
448 val print_configs = Toplevel.unknown_context o Toplevel.keep (fn state =>
449 Attrib.print_configs (Toplevel.context_of state));
451 val print_theorems_proof = Toplevel.keep (fn state =>
452 ProofContext.setmp_verbose
453 ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
455 val print_theorems_theory = Toplevel.keep (fn state =>
456 Toplevel.theory_of state |>
457 (case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
458 SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy)
459 | _ => ProofDisplay.print_theorems));
461 val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
463 val print_locales = Toplevel.unknown_theory o
464 Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
466 fun print_locale (show_facts, (imports, body)) = Toplevel.unknown_theory o
467 Toplevel.keep (fn state =>
468 Locale.print_locale (Toplevel.theory_of state) show_facts imports body);
470 fun print_registrations show_wits name = Toplevel.unknown_context o
471 Toplevel.keep (Toplevel.node_case
472 (Context.cases (Locale.print_registrations show_wits name o ProofContext.init)
473 (Locale.print_registrations show_wits name))
474 (Locale.print_registrations show_wits name o Proof.context_of));
476 val print_attributes = Toplevel.unknown_theory o
477 Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
479 val print_simpset = Toplevel.unknown_context o
480 Toplevel.keep (Toplevel.node_case
481 (Context.cases Simplifier.print_simpset Simplifier.print_local_simpset)
482 (Simplifier.print_local_simpset o Proof.context_of));
484 val print_rules = Toplevel.unknown_context o
485 Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
487 val print_trans_rules = Toplevel.unknown_context o
488 Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
490 val print_methods = Toplevel.unknown_theory o
491 Toplevel.keep (Method.print_methods o Toplevel.theory_of);
493 val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations;
495 val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
497 val thy = Toplevel.theory_of state;
498 val all_thys = sort ThyInfo.thy_ord (thy :: Theory.ancestors_of thy);
499 val gr = all_thys |> map (fn node =>
501 val name = Context.theory_name node;
502 val parents = map Context.theory_name (Theory.parents_of node);
503 val dir = Present.session_name node;
504 val unfold = not (ThyInfo.known_thy name andalso ThyInfo.is_finished name);
505 in {name = name, ID = name, parents = parents, dir = dir, unfold = unfold, path = ""} end);
506 in Present.display_graph gr end);
508 val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
510 val thy = Toplevel.theory_of state;
511 val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
512 val {classes, ...} = Sorts.rep_algebra algebra;
513 fun entry (c, (i, (_, cs))) =
514 (i, {name = NameSpace.extern space c, ID = c, parents = cs,
515 dir = "", unfold = true, path = ""});
517 Graph.fold (cons o entry) classes []
518 |> sort (int_ord o pairself #1) |> map #2;
519 in Present.display_graph gr end);
522 (* retrieve theorems *)
524 fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
525 ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
527 fun find_theorems ((opt_lim, rem_dups), spec) =
528 Toplevel.unknown_theory o Toplevel.keep (fn state =>
530 val proof_state = Toplevel.enter_proof_body state;
531 val ctxt = Proof.context_of proof_state;
532 val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
533 in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end);
536 (* find unused theorems *)
540 fun pretty_name_thm (a, th) =
541 Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, Display.pretty_thm th];
545 fun unused_thms opt_range =
546 Toplevel.keep (fn state => ThmDeps.unused_thms
548 NONE => (NONE, [Toplevel.theory_of state])
550 (SOME (map ThyInfo.get_theory xs), [Toplevel.theory_of state])
551 | SOME (xs, SOME ys) =>
552 (SOME (map ThyInfo.get_theory xs), map ThyInfo.get_theory ys)) |>
553 map pretty_name_thm |> Pretty.chunks |> Pretty.writeln);
558 (* print proof context contents *)
560 val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
561 ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
563 val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
564 ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
567 (* print theorems, terms, types etc. *)
571 fun string_of_stmts state args =
572 Proof.get_thmss state args
573 |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
574 |> Pretty.chunks2 |> Pretty.string_of;
576 fun string_of_thms state args =
577 Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
578 (Proof.get_thmss state args));
580 fun string_of_prfs full state arg =
581 Pretty.string_of (case arg of
584 val (ctxt, (_, thm)) = Proof.get_goal state;
585 val {thy, der = (_, prf), ...} = Thm.rep_thm thm;
586 val prop = Thm.full_prop_of thm;
587 val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
589 ProofContext.pretty_proof ctxt
590 (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
592 | SOME args => Pretty.chunks
593 (map (ProofContext.pretty_proof_of (Proof.context_of state) full)
594 (Proof.get_thmss state args)));
596 fun string_of_prop state s =
598 val ctxt = Proof.context_of state;
599 val prop = Syntax.read_prop ctxt s;
600 in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt prop)) end;
602 fun string_of_term state s =
604 val ctxt = Proof.context_of state;
605 val t = Syntax.read_term ctxt s;
606 val T = Term.type_of t;
609 (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.fbrk,
610 Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt T)])
613 fun string_of_type state s =
615 val ctxt = Proof.context_of state;
616 val T = Syntax.read_typ ctxt s;
617 in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end;
619 fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
620 PrintMode.with_modes modes (fn () =>
621 writeln (string_of (Toplevel.enter_proof_body state) arg)) ());
625 val print_stmts = print_item string_of_stmts;
626 val print_thms = print_item string_of_thms;
627 val print_prfs = print_item o string_of_prfs;
628 val print_prop = print_item string_of_prop;
629 val print_term = print_item string_of_term;
630 val print_type = print_item string_of_type;
635 (* markup commands *)
637 fun add_header s = Toplevel.keep' (fn int => fn state =>
638 (if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF;
639 if int then OuterSyntax.check_text s NONE else ()));
643 fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
644 | present f (s, _) false node =
645 ML_Context.setmp (try (Toplevel.cases_node I (Context.Proof o Proof.context_of)) node) f s;
647 fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
648 fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
652 val add_chapter = present_local_theory Present.section;
653 val add_section = present_local_theory Present.section;
654 val add_subsection = present_local_theory Present.subsection;
655 val add_subsubsection = present_local_theory Present.subsubsection;
656 val add_text = present_local_theory (K ());
657 fun add_text_raw txt = present_local_theory (K ()) (NONE, txt);
658 val add_txt = present_proof (K ());
659 val add_txt_raw = add_txt;
660 val add_sect = add_txt;
661 val add_subsect = add_txt;
662 val add_subsubsect = add_txt;