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 print_binds: Toplevel.transition -> Toplevel.transition
98 val print_cases: Toplevel.transition -> Toplevel.transition
99 val print_stmts: string list * (thmref * Attrib.src list) list
100 -> Toplevel.transition -> Toplevel.transition
101 val print_thms: string list * (thmref * Attrib.src list) list
102 -> Toplevel.transition -> Toplevel.transition
103 val print_prfs: bool -> string list * (thmref * Attrib.src list) list option
104 -> Toplevel.transition -> Toplevel.transition
105 val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
106 val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
107 val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
108 val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition
109 val add_chapter: xstring option * (string * Position.T) ->
110 Toplevel.transition -> Toplevel.transition
111 val add_section: xstring option * (string * Position.T) ->
112 Toplevel.transition -> Toplevel.transition
113 val add_subsection: xstring option * (string * Position.T) ->
114 Toplevel.transition -> Toplevel.transition
115 val add_subsubsection: xstring option * (string * Position.T) ->
116 Toplevel.transition -> Toplevel.transition
117 val add_text: xstring option * (string * Position.T) ->
118 Toplevel.transition -> Toplevel.transition
119 val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
120 val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition
121 val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
122 val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
123 val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition
124 val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
127 structure IsarCmd: ISAR_CMD =
131 (** theory declarations **)
135 fun generic_setup NONE = (fn thy => thy |> Context.setup ())
136 | generic_setup (SOME txt) =
137 ML_Context.use_let "val setup: theory -> theory" "Context.map_theory setup" txt
138 |> Context.theory_map;
141 (* translation functions *)
145 fun advancedT false = ""
146 | advancedT true = "Proof.context -> ";
148 fun advancedN false = ""
149 | advancedN true = "advanced_";
153 fun parse_ast_translation (a, txt) =
154 txt |> ML_Context.use_let ("val parse_ast_translation: (string * (" ^ advancedT a ^
155 "Syntax.ast list -> Syntax.ast)) list")
156 ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
157 |> Context.theory_map;
159 fun parse_translation (a, txt) =
160 txt |> ML_Context.use_let ("val parse_translation: (string * (" ^ advancedT a ^
161 "term list -> term)) list")
162 ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))")
163 |> Context.theory_map;
165 fun print_translation (a, txt) =
166 txt |> ML_Context.use_let ("val print_translation: (string * (" ^ advancedT a ^
167 "term list -> term)) list")
168 ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
169 |> Context.theory_map;
171 fun print_ast_translation (a, txt) =
172 txt |> ML_Context.use_let ("val print_ast_translation: (string * (" ^ advancedT a ^
173 "Syntax.ast list -> Syntax.ast)) list")
174 ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))")
175 |> Context.theory_map;
177 fun typed_print_translation (a, txt) =
178 txt |> ML_Context.use_let ("val typed_print_translation: (string * (" ^ advancedT a ^
179 "bool -> typ -> term list -> term)) list")
180 ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
181 |> Context.theory_map;
183 val token_translation =
184 ML_Context.use_let "val token_translation: (string * string * (string -> output * int)) list"
185 "Context.map_theory (Sign.add_tokentrfuns token_translation)"
186 #> Context.theory_map;
193 fun oracle name typ oracle =
196 \ type T = " ^ typ ^ ";\n\
197 \ val oracle: theory -> T -> term = " ^ oracle ^ ";\n\
198 \ val name = " ^ quote name ^ ";\n\
199 \ exception Arg of T;\n\
200 \ val _ = ML_Context.>> (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x));\n\
201 \ val thy = ML_Context.the_context ();\n\
202 \ val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\
204 \ fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\
206 in ML_Context.use_mltext_update txt false end
207 |> Context.theory_map;
212 fun add_axms f args thy =
213 f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy;
215 val add_axioms = add_axms (snd oo PureThy.add_axioms);
217 fun add_defs ((unchecked, overloaded), args) =
219 (snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args;
224 fun apply_theorems args thy =
225 let val facts = Attrib.map_facts (Attrib.attribute thy) [(("", []), args)]
226 in apfst (maps snd) (PureThy.note_thmss "" facts thy) end;
228 fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)];
234 ML_Context.use_let "val declaration: Morphism.declaration"
235 "Context.map_proof (LocalTheory.declaration declaration)"
236 #> Context.proof_map;
241 fun simproc_setup name lhss proc identifier =
243 "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
244 ("Context.map_proof (Simplifier.def_simproc {name = " ^ ML_Syntax.print_string name ^ ", \
245 \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
246 \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})") proc
247 |> Context.proof_map;
252 fun goal opt_chain goal stmt int =
253 opt_chain #> goal NONE (K Seq.single) stmt int;
255 val have = goal I Proof.have;
256 val hence = goal Proof.chain Proof.have;
257 val show = goal I Proof.show;
258 val thus = goal Proof.chain Proof.show;
263 fun local_qed m = Toplevel.proofs (Proof.local_qed (m, true));
264 val local_terminal_proof = Toplevel.proofs o Proof.local_terminal_proof;
265 val local_default_proof = Toplevel.proofs Proof.local_default_proof;
266 val local_immediate_proof = Toplevel.proofs Proof.local_immediate_proof;
267 val local_done_proof = Toplevel.proofs Proof.local_done_proof;
268 val local_skip_proof = Toplevel.proofs' Proof.local_skip_proof;
271 Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF));
276 fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
277 val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
278 val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
279 val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
280 val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
281 val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
283 val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1);
288 fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
289 fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
290 val default_proof = local_default_proof o global_default_proof;
291 val immediate_proof = local_immediate_proof o global_immediate_proof;
292 val done_proof = local_done_proof o global_done_proof;
293 val skip_proof = local_skip_proof o global_skip_proof;
298 fun begin_theory name imports uses =
299 ThyInfo.begin_theory name imports (map (apfst Path.explode) uses);
302 if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy;
304 val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
306 fun theory (name, imports, uses) =
307 Toplevel.init_theory (begin_theory name imports uses)
308 (fn thy => (end_theory thy; ()))
309 (kill_theory o Context.theory_name);
311 val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
313 val welcome = Toplevel.imperative (writeln o Session.welcome);
315 val exit = Toplevel.keep (fn state =>
316 (CRITICAL (fn () => ML_Context.set_context (try Toplevel.generic_theory_of state));
317 raise Toplevel.TERMINATE));
319 val quit = Toplevel.imperative quit;
324 fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
325 fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
326 fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
327 fun kill_thy name = Toplevel.imperative (fn () => kill_theory name);
332 fun set_limit _ NONE = ()
333 | set_limit r (SOME n) = r := n;
335 fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
336 (set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
337 PrintMode.with_modes modes (Toplevel.print_state true) state));
339 val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
340 val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
343 (* history commands *)
346 Toplevel.history History.redo o
347 Toplevel.actual_proof ProofHistory.redo o
348 Toplevel.skip_proof History.redo;
351 Toplevel.actual_proof (fn prf =>
352 if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o
353 Toplevel.skip_proof (fn h =>
354 if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h);
356 fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist =>
357 if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF
358 else (f (); History.undo hist));
360 val kill_proof = kill_proof_notify (K ());
362 val undo_theory = Toplevel.history (fn hist =>
363 if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist);
365 val undo = Toplevel.kill o undo_theory o Toplevel.undo_exit o undos_proof 1;
367 fun cannot_undo "end" = undo (*ProofGeneral legacy*)
368 | cannot_undo txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt));
370 val kill = Toplevel.kill o kill_proof;
373 Toplevel.actual_proof ProofHistory.back o
374 Toplevel.skip_proof (History.apply I);
379 fun use path = Toplevel.keep (fn state =>
380 ML_Context.setmp (try Toplevel.generic_theory_of state) (ThyInfo.load_file false) path);
382 (*passes changes of theory context*)
383 val use_mltext_theory = Toplevel.theory' o (Context.theory_map oo ML_Context.use_mltext_update);
385 (*ignore result theory context*)
386 fun use_mltext verbose txt = Toplevel.keep' (fn int => fn state =>
387 (ML_Context.use_mltext txt (verbose andalso int) (try Toplevel.generic_theory_of state)));
389 val use_commit = Toplevel.imperative Secure.commit;
392 (* nested commands *)
394 fun nested_command props (str, pos) =
395 let val pos' = Position.of_properties (props |> Position.default_properties pos) in
396 (case OuterSyntax.parse pos' str of
397 [transition] => transition
398 | _ => error "exactly one command expected")
402 (* current working directory *)
404 fun cd path = Toplevel.imperative (fn () => (File.cd path));
405 val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
408 (* load theory files *)
410 fun use_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy name);
413 (* present draft files *)
415 fun display_drafts files = Toplevel.imperative (fn () =>
416 let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
417 in File.isatool ("display -c " ^ outfile ^ " &"); () end);
419 fun print_drafts files = Toplevel.imperative (fn () =>
420 let val outfile = File.shell_path (Present.drafts "ps" files)
421 in File.isatool ("print -c " ^ outfile); () end);
424 (* pretty_setmargin *)
426 fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
429 (* print parts of theory and proof context *)
431 val print_context = Toplevel.keep Toplevel.print_state_context;
433 fun print_theory verbose = Toplevel.unknown_theory o
434 Toplevel.keep (Pretty.writeln o ProofDisplay.pretty_full_theory verbose o Toplevel.theory_of);
436 val print_syntax = Toplevel.unknown_context o
437 Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
439 val print_abbrevs = Toplevel.unknown_context o
440 Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
442 val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
443 ProofContext.setmp_verbose
444 ProofContext.print_lthms (Toplevel.context_of state));
446 val print_configs = Toplevel.unknown_context o Toplevel.keep (fn state =>
447 Attrib.print_configs (Toplevel.context_of state));
449 val print_theorems_proof = Toplevel.keep (fn state =>
450 ProofContext.setmp_verbose
451 ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
453 val print_theorems_theory = Toplevel.keep (fn state =>
454 Toplevel.theory_of state |>
455 (case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
456 SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy)
457 | _ => ProofDisplay.print_theorems));
459 val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
461 val print_locales = Toplevel.unknown_theory o
462 Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
464 fun print_locale (show_facts, (imports, body)) = Toplevel.unknown_theory o
465 Toplevel.keep (fn state =>
466 Locale.print_locale (Toplevel.theory_of state) show_facts imports body);
468 fun print_registrations show_wits name = Toplevel.unknown_context o
469 Toplevel.keep (Toplevel.node_case
470 (Context.cases (Locale.print_registrations show_wits name o ProofContext.init)
471 (Locale.print_registrations show_wits name))
472 (Locale.print_registrations show_wits name o Proof.context_of));
474 val print_attributes = Toplevel.unknown_theory o
475 Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
477 val print_simpset = Toplevel.unknown_context o
478 Toplevel.keep (Toplevel.node_case
479 (Context.cases Simplifier.print_simpset Simplifier.print_local_simpset)
480 (Simplifier.print_local_simpset o Proof.context_of));
482 val print_rules = Toplevel.unknown_context o
483 Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
485 val print_trans_rules = Toplevel.unknown_context o
486 Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
488 val print_methods = Toplevel.unknown_theory o
489 Toplevel.keep (Method.print_methods o Toplevel.theory_of);
491 val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations;
493 val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
495 val thy = Toplevel.theory_of state;
496 val all_thys = sort ThyInfo.thy_ord (thy :: Theory.ancestors_of thy);
497 val gr = all_thys |> map (fn node =>
499 val name = Context.theory_name node;
500 val parents = map Context.theory_name (Theory.parents_of node);
501 val dir = Present.session_name node;
502 val unfold = not (ThyInfo.known_thy name andalso ThyInfo.is_finished name);
503 in {name = name, ID = name, parents = parents, dir = dir, unfold = unfold, path = ""} end);
504 in Present.display_graph gr end);
506 val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
508 val thy = Toplevel.theory_of state;
509 val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
510 val {classes, ...} = Sorts.rep_algebra algebra;
511 fun entry (c, (i, (_, cs))) =
512 (i, {name = NameSpace.extern space c, ID = c, parents = cs,
513 dir = "", unfold = true, path = ""});
515 Graph.fold (cons o entry) classes []
516 |> sort (int_ord o pairself #1) |> map #2;
517 in Present.display_graph gr end);
520 (* retrieve theorems *)
522 fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
523 ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
525 fun find_theorems ((opt_lim, rem_dups), spec) =
526 Toplevel.unknown_theory o Toplevel.keep (fn state =>
528 val proof_state = Toplevel.enter_proof_body state;
529 val ctxt = Proof.context_of proof_state;
530 val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
531 in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end);
534 (* print proof context contents *)
536 val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
537 ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
539 val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
540 ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
543 (* print theorems, terms, types etc. *)
547 fun string_of_stmts state args =
548 Proof.get_thmss state args
549 |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
550 |> Pretty.chunks2 |> Pretty.string_of;
552 fun string_of_thms state args =
553 Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
554 (Proof.get_thmss state args));
556 fun string_of_prfs full state arg =
557 Pretty.string_of (case arg of
560 val (ctxt, (_, thm)) = Proof.get_goal state;
561 val {thy, der = (_, prf), ...} = Thm.rep_thm thm;
562 val prop = Thm.full_prop_of thm;
563 val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
565 ProofContext.pretty_proof ctxt
566 (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
568 | SOME args => Pretty.chunks
569 (map (ProofContext.pretty_proof_of (Proof.context_of state) full)
570 (Proof.get_thmss state args)));
572 fun string_of_prop state s =
574 val ctxt = Proof.context_of state;
575 val prop = Syntax.read_prop ctxt s;
576 in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt prop)) end;
578 fun string_of_term state s =
580 val ctxt = Proof.context_of state;
581 val t = Syntax.read_term ctxt s;
582 val T = Term.type_of t;
585 (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.fbrk,
586 Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt T)])
589 fun string_of_type state s =
591 val ctxt = Proof.context_of state;
592 val T = Syntax.read_typ ctxt s;
593 in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end;
595 fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
596 PrintMode.with_modes modes (fn () =>
597 writeln (string_of (Toplevel.enter_proof_body state) arg)) ());
601 val print_stmts = print_item string_of_stmts;
602 val print_thms = print_item string_of_thms;
603 val print_prfs = print_item o string_of_prfs;
604 val print_prop = print_item string_of_prop;
605 val print_term = print_item string_of_term;
606 val print_type = print_item string_of_type;
611 (* markup commands *)
613 fun add_header s = Toplevel.keep' (fn int => fn state =>
614 (if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF;
615 if int then OuterSyntax.check_text s NONE else ()));
619 fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
620 | present f (s, _) false node =
621 ML_Context.setmp (try (Toplevel.cases_node I (Context.Proof o Proof.context_of)) node) f s;
623 fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
624 fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
628 val add_chapter = present_local_theory Present.section;
629 val add_section = present_local_theory Present.section;
630 val add_subsection = present_local_theory Present.subsection;
631 val add_subsubsection = present_local_theory Present.subsubsection;
632 val add_text = present_local_theory (K ());
633 fun add_text_raw txt = present_local_theory (K ()) (NONE, txt);
634 val add_txt = present_proof (K ());
635 val add_txt_raw = add_txt;
636 val add_sect = add_txt;
637 val add_subsect = add_txt;
638 val add_subsubsect = add_txt;