wenzelm@5831: (* Title: Pure/Isar/isar_cmd.ML wenzelm@5831: ID: $Id$ wenzelm@5831: Author: Markus Wenzel, TU Muenchen wenzelm@5831: wenzelm@21350: Derived Isar commands. wenzelm@5831: *) wenzelm@5831: wenzelm@5831: signature ISAR_CMD = wenzelm@5831: sig wenzelm@22116: val generic_setup: string option -> theory -> theory wenzelm@22116: val parse_ast_translation: bool * string -> theory -> theory wenzelm@22116: val parse_translation: bool * string -> theory -> theory wenzelm@22116: val print_translation: bool * string -> theory -> theory wenzelm@22116: val typed_print_translation: bool * string -> theory -> theory wenzelm@22116: val print_ast_translation: bool * string -> theory -> theory wenzelm@22116: val token_translation: string -> theory -> theory wenzelm@22239: val oracle: bstring -> string -> string -> theory -> theory wenzelm@21350: val add_axioms: ((bstring * string) * Attrib.src list) list -> theory -> theory wenzelm@21350: val add_defs: (bool * bool) * ((bstring * string) * Attrib.src list) list -> theory -> theory wenzelm@21350: val apply_theorems: (thmref * Attrib.src list) list -> theory -> thm list * theory wenzelm@21350: val apply_theorems_i: (thm list * attribute list) list -> theory -> thm list * theory wenzelm@22087: val declaration: string -> local_theory -> local_theory wenzelm@22239: val simproc_setup: string -> string list -> string -> string list -> local_theory -> local_theory wenzelm@21350: val have: ((string * Attrib.src list) * (string * string list) list) list -> wenzelm@21350: bool -> Proof.state -> Proof.state wenzelm@21350: val hence: ((string * Attrib.src list) * (string * string list) list) list -> wenzelm@21350: bool -> Proof.state -> Proof.state wenzelm@21350: val show: ((string * Attrib.src list) * (string * string list) list) list -> wenzelm@21350: bool -> Proof.state -> Proof.state wenzelm@21350: val thus: ((string * Attrib.src list) * (string * string list) list) list -> wenzelm@21350: bool -> Proof.state -> Proof.state wenzelm@21350: val qed: Method.text option -> Toplevel.transition -> Toplevel.transition wenzelm@21350: val terminal_proof: Method.text * Method.text option -> wenzelm@21350: Toplevel.transition -> Toplevel.transition wenzelm@21350: val default_proof: Toplevel.transition -> Toplevel.transition wenzelm@21350: val immediate_proof: Toplevel.transition -> Toplevel.transition wenzelm@21350: val done_proof: Toplevel.transition -> Toplevel.transition wenzelm@21350: val skip_proof: Toplevel.transition -> Toplevel.transition wenzelm@21350: val begin_theory: string -> string list -> (string * bool) list -> bool -> theory wenzelm@21350: val end_theory: theory -> theory wenzelm@21350: val kill_theory: string -> unit wenzelm@21350: val theory: string * string list * (string * bool) list wenzelm@21350: -> Toplevel.transition -> Toplevel.transition wenzelm@7462: val welcome: Toplevel.transition -> Toplevel.transition wenzelm@7462: val init_toplevel: Toplevel.transition -> Toplevel.transition wenzelm@5831: val exit: Toplevel.transition -> Toplevel.transition wenzelm@5831: val quit: Toplevel.transition -> Toplevel.transition wenzelm@7908: val touch_child_thys: string -> Toplevel.transition -> Toplevel.transition wenzelm@7101: val touch_all_thys: Toplevel.transition -> Toplevel.transition wenzelm@7101: val touch_thy: string -> Toplevel.transition -> Toplevel.transition wenzelm@7101: val remove_thy: string -> Toplevel.transition -> Toplevel.transition wenzelm@7931: val kill_thy: string -> Toplevel.transition -> Toplevel.transition wenzelm@9731: val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition wenzelm@8453: val disable_pr: Toplevel.transition -> Toplevel.transition wenzelm@8453: val enable_pr: Toplevel.transition -> Toplevel.transition wenzelm@6742: val redo: Toplevel.transition -> Toplevel.transition wenzelm@6742: val undos_proof: int -> Toplevel.transition -> Toplevel.transition wenzelm@7936: val kill_proof_notify: (unit -> unit) -> Toplevel.transition -> Toplevel.transition wenzelm@6742: val kill_proof: Toplevel.transition -> Toplevel.transition wenzelm@6742: val undo_theory: Toplevel.transition -> Toplevel.transition wenzelm@6686: val undo: Toplevel.transition -> Toplevel.transition wenzelm@21955: val cannot_undo: string -> Toplevel.transition -> Toplevel.transition wenzelm@8498: val kill: Toplevel.transition -> Toplevel.transition wenzelm@17066: val back: Toplevel.transition -> Toplevel.transition wenzelm@14950: val use: Path.T -> Toplevel.transition -> Toplevel.transition wenzelm@12876: val use_mltext_theory: string -> Toplevel.transition -> Toplevel.transition wenzelm@12876: val use_mltext: bool -> string -> Toplevel.transition -> Toplevel.transition wenzelm@5831: val use_commit: Toplevel.transition -> Toplevel.transition wenzelm@14950: val cd: Path.T -> Toplevel.transition -> Toplevel.transition wenzelm@5831: val pwd: Toplevel.transition -> Toplevel.transition wenzelm@5831: val use_thy: string -> Toplevel.transition -> Toplevel.transition wenzelm@6694: val use_thy_only: string -> Toplevel.transition -> Toplevel.transition wenzelm@6195: val update_thy: string -> Toplevel.transition -> Toplevel.transition wenzelm@7101: val update_thy_only: string -> Toplevel.transition -> Toplevel.transition wenzelm@14950: val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition wenzelm@14950: val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition wenzelm@7124: val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition wenzelm@7308: val print_context: Toplevel.transition -> Toplevel.transition wenzelm@20621: val print_theory: bool -> Toplevel.transition -> Toplevel.transition wenzelm@5831: val print_syntax: Toplevel.transition -> Toplevel.transition wenzelm@21725: val print_abbrevs: Toplevel.transition -> Toplevel.transition wenzelm@21003: val print_facts: Toplevel.transition -> Toplevel.transition wenzelm@5880: val print_theorems: Toplevel.transition -> Toplevel.transition wenzelm@12060: val print_locales: Toplevel.transition -> Toplevel.transition wenzelm@18135: val print_locale: bool * (Locale.expr * Element.context list) wenzelm@12758: -> Toplevel.transition -> Toplevel.transition ballarin@17139: val print_registrations: bool -> string -> Toplevel.transition -> Toplevel.transition wenzelm@5831: val print_attributes: Toplevel.transition -> Toplevel.transition wenzelm@16026: val print_simpset: Toplevel.transition -> Toplevel.transition wenzelm@12382: val print_rules: Toplevel.transition -> Toplevel.transition wenzelm@11666: val print_induct_rules: Toplevel.transition -> Toplevel.transition wenzelm@9219: val print_trans_rules: Toplevel.transition -> Toplevel.transition wenzelm@5831: val print_methods: Toplevel.transition -> Toplevel.transition wenzelm@9219: val print_antiquotations: Toplevel.transition -> Toplevel.transition wenzelm@20574: val class_deps: Toplevel.transition -> Toplevel.transition haftmann@22485: val thy_deps: Toplevel.transition -> Toplevel.transition wenzelm@20574: val thm_deps: (thmref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition kleing@22340: val find_theorems: (int option * bool) * (bool * string FindTheorems.criterion) list wenzelm@13284: -> Toplevel.transition -> Toplevel.transition wenzelm@5831: val print_binds: Toplevel.transition -> Toplevel.transition wenzelm@8369: val print_cases: Toplevel.transition -> Toplevel.transition wenzelm@19268: val print_stmts: string list * (thmref * Attrib.src list) list wenzelm@19268: -> Toplevel.transition -> Toplevel.transition wenzelm@15703: val print_thms: string list * (thmref * Attrib.src list) list wenzelm@10581: -> Toplevel.transition -> Toplevel.transition wenzelm@15703: val print_prfs: bool -> string list * (thmref * Attrib.src list) list option berghofe@11524: -> Toplevel.transition -> Toplevel.transition wenzelm@12876: val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition wenzelm@12876: val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition wenzelm@12876: val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition wenzelm@12938: val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition wenzelm@17262: val add_chapter: xstring option * (string * Position.T) -> wenzelm@17262: Toplevel.transition -> Toplevel.transition wenzelm@17262: val add_section: xstring option * (string * Position.T) -> wenzelm@17262: Toplevel.transition -> Toplevel.transition wenzelm@17262: val add_subsection: xstring option * (string * Position.T) -> wenzelm@17262: Toplevel.transition -> Toplevel.transition wenzelm@17262: val add_subsubsection: xstring option * (string * Position.T) -> wenzelm@17262: Toplevel.transition -> Toplevel.transition wenzelm@17262: val add_text: xstring option * (string * Position.T) -> wenzelm@17262: Toplevel.transition -> Toplevel.transition wenzelm@12938: val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition wenzelm@12938: val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition wenzelm@12938: val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition wenzelm@12938: val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition wenzelm@12938: val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition wenzelm@12938: val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition wenzelm@5831: end; wenzelm@5831: wenzelm@5831: structure IsarCmd: ISAR_CMD = wenzelm@5831: struct wenzelm@5831: wenzelm@5831: wenzelm@22116: (** theory declarations **) wenzelm@22116: wenzelm@22116: (* generic_setup *) wenzelm@22116: wenzelm@22116: fun generic_setup NONE = (fn thy => thy |> Context.setup ()) wenzelm@22116: | generic_setup (SOME txt) = wenzelm@22116: ML_Context.use_let "val setup: theory -> theory" "Context.map_theory setup" txt wenzelm@22116: |> Context.theory_map; wenzelm@22116: wenzelm@22116: wenzelm@22116: (* translation functions *) wenzelm@22116: wenzelm@22116: local wenzelm@22116: wenzelm@22116: fun advancedT false = "" wenzelm@22116: | advancedT true = "Proof.context -> "; wenzelm@22116: wenzelm@22116: fun advancedN false = "" wenzelm@22116: | advancedN true = "advanced_"; wenzelm@22116: wenzelm@22116: in wenzelm@22116: wenzelm@22116: fun parse_ast_translation (a, txt) = wenzelm@22116: txt |> ML_Context.use_let ("val parse_ast_translation: (string * (" ^ advancedT a ^ wenzelm@22116: "Syntax.ast list -> Syntax.ast)) list") wenzelm@22116: ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))") wenzelm@22116: |> Context.theory_map; wenzelm@22116: wenzelm@22116: fun parse_translation (a, txt) = wenzelm@22116: txt |> ML_Context.use_let ("val parse_translation: (string * (" ^ advancedT a ^ wenzelm@22116: "term list -> term)) list") wenzelm@22116: ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))") wenzelm@22116: |> Context.theory_map; wenzelm@22116: wenzelm@22116: fun print_translation (a, txt) = wenzelm@22116: txt |> ML_Context.use_let ("val print_translation: (string * (" ^ advancedT a ^ wenzelm@22116: "term list -> term)) list") wenzelm@22116: ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))") wenzelm@22116: |> Context.theory_map; wenzelm@22116: wenzelm@22116: fun print_ast_translation (a, txt) = wenzelm@22116: txt |> ML_Context.use_let ("val print_ast_translation: (string * (" ^ advancedT a ^ wenzelm@22116: "Syntax.ast list -> Syntax.ast)) list") wenzelm@22116: ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))") wenzelm@22116: |> Context.theory_map; wenzelm@22116: wenzelm@22116: fun typed_print_translation (a, txt) = wenzelm@22116: txt |> ML_Context.use_let ("val typed_print_translation: (string * (" ^ advancedT a ^ wenzelm@22116: "bool -> typ -> term list -> term)) list") wenzelm@22116: ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)") wenzelm@22116: |> Context.theory_map; wenzelm@22116: wenzelm@22116: val token_translation = wenzelm@22116: ML_Context.use_let "val token_translation: (string * string * (string -> string * real)) list" wenzelm@22116: "Context.map_theory (Sign.add_tokentrfuns token_translation)" wenzelm@22116: #> Context.theory_map; wenzelm@22116: wenzelm@22116: end; wenzelm@22116: wenzelm@22116: wenzelm@22116: (* oracles *) wenzelm@22116: wenzelm@22239: fun oracle name typ oracle = wenzelm@22116: let val txt = wenzelm@22116: "local\n\ wenzelm@22239: \ type T = " ^ typ ^ ";\n\ wenzelm@22116: \ val oracle: theory -> T -> term = " ^ oracle ^ ";\n\ wenzelm@22116: \ val name = " ^ quote name ^ ";\n\ wenzelm@22116: \ exception Arg of T;\n\ wenzelm@22116: \ val _ = ML_Context.>> (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x));\n\ wenzelm@22116: \ val thy = ML_Context.the_context ();\n\ wenzelm@22116: \ val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\ wenzelm@22116: \in\n\ wenzelm@22116: \ fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\ wenzelm@22116: \end;\n"; wenzelm@22116: in ML_Context.use_mltext_update txt false end wenzelm@22116: |> Context.theory_map; wenzelm@22116: wenzelm@22116: wenzelm@21350: (* axioms *) wenzelm@21350: wenzelm@21350: fun add_axms f args thy = wenzelm@21350: f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy; wenzelm@21350: wenzelm@21350: val add_axioms = add_axms (snd oo PureThy.add_axioms); wenzelm@21350: wenzelm@21350: fun add_defs ((unchecked, overloaded), args) = wenzelm@21350: add_axms wenzelm@21350: (snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args; wenzelm@21350: wenzelm@21350: wenzelm@21350: (* facts *) wenzelm@21350: wenzelm@21350: fun apply_theorems args thy = wenzelm@21350: let val facts = Attrib.map_facts (Attrib.attribute thy) [(("", []), args)] wenzelm@21350: in apfst (maps snd) (PureThy.note_thmss "" facts thy) end; wenzelm@21350: wenzelm@21350: fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)]; wenzelm@21350: wenzelm@21350: wenzelm@22087: (* declarations *) wenzelm@22087: wenzelm@22087: val declaration = wenzelm@22116: ML_Context.use_let wenzelm@22116: "val declaration: Morphism.morphism -> Context.generic -> Context.generic" wenzelm@22087: "Context.map_proof (LocalTheory.declaration declaration)" wenzelm@22087: #> Context.proof_map; wenzelm@22087: wenzelm@22087: wenzelm@22202: (* simprocs *) wenzelm@22202: wenzelm@22239: fun simproc_setup name lhss proc identifier = wenzelm@22202: ML_Context.use_let wenzelm@22239: "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option" wenzelm@22239: ("Context.map_proof (Simplifier.def_simproc {name = " ^ ML_Syntax.print_string name ^ ", \ wenzelm@22239: \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \ wenzelm@22239: \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})") proc wenzelm@22202: |> Context.proof_map; wenzelm@22202: wenzelm@22202: wenzelm@21350: (* goals *) wenzelm@21350: wenzelm@21350: fun goal opt_chain goal stmt int = wenzelm@21350: opt_chain #> goal NONE (K Seq.single) stmt int; wenzelm@21350: wenzelm@21350: val have = goal I Proof.have; wenzelm@21350: val hence = goal Proof.chain Proof.have; wenzelm@21350: val show = goal I Proof.show; wenzelm@21350: val thus = goal Proof.chain Proof.show; wenzelm@21350: wenzelm@21350: wenzelm@21350: (* local endings *) wenzelm@21350: wenzelm@21350: fun local_qed m = Toplevel.proofs (Proof.local_qed (m, true)); wenzelm@21350: val local_terminal_proof = Toplevel.proofs o Proof.local_terminal_proof; wenzelm@21350: val local_default_proof = Toplevel.proofs Proof.local_default_proof; wenzelm@21350: val local_immediate_proof = Toplevel.proofs Proof.local_immediate_proof; wenzelm@21350: val local_done_proof = Toplevel.proofs Proof.local_done_proof; wenzelm@21350: val local_skip_proof = Toplevel.proofs' Proof.local_skip_proof; wenzelm@21350: wenzelm@21350: val skip_local_qed = wenzelm@21350: Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF)); wenzelm@21350: wenzelm@21350: wenzelm@21350: (* global endings *) wenzelm@21350: wenzelm@21350: fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true))); wenzelm@21350: val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof; wenzelm@21350: val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof); wenzelm@21350: val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof); wenzelm@21350: val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof; wenzelm@21350: val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof); wenzelm@21350: wenzelm@21350: val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1); wenzelm@21350: wenzelm@21350: wenzelm@21350: (* common endings *) wenzelm@21350: wenzelm@21350: fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed; wenzelm@21350: fun terminal_proof m = local_terminal_proof m o global_terminal_proof m; wenzelm@21350: val default_proof = local_default_proof o global_default_proof; wenzelm@21350: val immediate_proof = local_immediate_proof o global_immediate_proof; wenzelm@21350: val done_proof = local_done_proof o global_done_proof; wenzelm@21350: val skip_proof = local_skip_proof o global_skip_proof; wenzelm@21350: wenzelm@21350: wenzelm@21350: (* init and exit *) wenzelm@21350: wenzelm@21350: fun begin_theory name imports uses = wenzelm@21858: ThyInfo.begin_theory Present.begin_theory name imports (map (apfst Path.explode) uses); wenzelm@21350: wenzelm@21566: fun end_theory thy = wenzelm@21566: if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy; wenzelm@21350: wenzelm@21350: val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy; wenzelm@21350: wenzelm@21350: fun theory (name, imports, uses) = wenzelm@21350: Toplevel.init_theory (begin_theory name imports uses) wenzelm@21350: (fn thy => (end_theory thy; ())) wenzelm@21350: (kill_theory o Context.theory_name); wenzelm@21350: wenzelm@7462: val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART); wenzelm@21350: wenzelm@7462: val welcome = Toplevel.imperative (writeln o Session.welcome); wenzelm@5831: wenzelm@5831: val exit = Toplevel.keep (fn state => wenzelm@22116: (ML_Context.set_context (try Toplevel.generic_theory_of state); raise Toplevel.TERMINATE)); wenzelm@5831: wenzelm@5831: val quit = Toplevel.imperative quit; wenzelm@5831: wenzelm@7101: wenzelm@7101: (* touch theories *) wenzelm@7101: wenzelm@7908: fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name); wenzelm@7101: val touch_all_thys = Toplevel.imperative ThyInfo.touch_all_thys; wenzelm@7101: fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name); wenzelm@7101: fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name); wenzelm@21350: fun kill_thy name = Toplevel.imperative (fn () => kill_theory name); wenzelm@7101: wenzelm@5831: wenzelm@8453: (* print state *) wenzelm@8453: wenzelm@8463: fun with_modes modes e = wenzelm@8463: Library.setmp print_mode (modes @ ! print_mode) e (); wenzelm@8463: skalberg@15531: fun set_limit _ NONE = () skalberg@15531: | set_limit r (SOME n) = r := n; wenzelm@9731: wenzelm@19385: fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state => wenzelm@9731: (set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false; wenzelm@19385: with_modes modes (fn () => Toplevel.print_state true state))); wenzelm@8453: wenzelm@8453: val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true); wenzelm@8453: val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false); wenzelm@8453: wenzelm@8453: wenzelm@6686: (* history commands *) wenzelm@6686: wenzelm@16812: val redo = wenzelm@16812: Toplevel.history History.redo o wenzelm@16812: Toplevel.actual_proof ProofHistory.redo o berghofe@15237: Toplevel.skip_proof History.redo; wenzelm@6686: wenzelm@16812: fun undos_proof n = wenzelm@16812: Toplevel.actual_proof (fn prf => berghofe@15237: if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o berghofe@15237: Toplevel.skip_proof (fn h => berghofe@15237: if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h); wenzelm@6686: wenzelm@7936: fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist => wenzelm@18588: if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF wenzelm@18588: else (f (); History.undo hist)); wenzelm@7936: wenzelm@7936: val kill_proof = kill_proof_notify (K ()); wenzelm@6686: wenzelm@6742: val undo_theory = Toplevel.history (fn hist => wenzelm@6742: if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist); wenzelm@6686: wenzelm@21955: val undo = Toplevel.kill o undos_proof 1 o undo_theory o Toplevel.undo_exit; wenzelm@21955: wenzelm@21955: fun cannot_undo "end" = undo (*ProofGeneral legacy*) wenzelm@21955: | cannot_undo txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt)); wenzelm@21955: wenzelm@21003: val kill = Toplevel.kill o kill_proof; wenzelm@17899: wenzelm@17899: val back = wenzelm@17899: Toplevel.actual_proof ProofHistory.back o wenzelm@17899: Toplevel.skip_proof (History.apply I); wenzelm@9273: wenzelm@6686: wenzelm@5831: (* use ML text *) wenzelm@5831: wenzelm@16045: fun use path = Toplevel.keep (fn state => wenzelm@22116: ML_Context.setmp (try Toplevel.generic_theory_of state) (ThyInfo.load_file false) path); wenzelm@5831: wenzelm@5831: (*passes changes of theory context*) wenzelm@22116: val use_mltext_theory = Toplevel.theory' o (Context.theory_map oo ML_Context.use_mltext_update); wenzelm@5831: wenzelm@5831: (*ignore result theory context*) wenzelm@12876: fun use_mltext v txt = Toplevel.keep' (fn verb => fn state => wenzelm@22116: (ML_Context.use_mltext txt (v andalso verb) (try Toplevel.generic_theory_of state))); wenzelm@5831: wenzelm@20927: val use_commit = Toplevel.imperative Secure.commit; wenzelm@5831: wenzelm@5831: wenzelm@5831: (* current working directory *) wenzelm@5831: wenzelm@14950: fun cd path = Toplevel.imperative (fn () => (File.cd path)); wenzelm@21858: val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ()))); wenzelm@5831: wenzelm@5831: wenzelm@5831: (* load theory files *) wenzelm@5831: wenzelm@22116: fun use_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy name); wenzelm@22116: fun use_thy_only name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy_only name); wenzelm@22116: fun update_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.update_thy name); wenzelm@7124: fun update_thy_only name = wenzelm@22116: Toplevel.imperative (fn () => ML_Context.save ThyInfo.update_thy_only name); wenzelm@7124: wenzelm@7124: wenzelm@14934: (* present draft files *) wenzelm@14934: wenzelm@14934: fun display_drafts files = Toplevel.imperative (fn () => wenzelm@16258: let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files) wenzelm@16258: in File.isatool ("display -c " ^ outfile ^ " &"); () end); wenzelm@14934: wenzelm@14934: fun print_drafts files = Toplevel.imperative (fn () => wenzelm@16258: let val outfile = File.shell_path (Present.drafts "ps" files) wenzelm@16258: in File.isatool ("print -c " ^ outfile); () end); wenzelm@14934: wenzelm@14934: wenzelm@7124: (* pretty_setmargin *) wenzelm@7124: wenzelm@7124: fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n); wenzelm@5831: wenzelm@5831: wenzelm@9513: (* print parts of theory and proof context *) wenzelm@5831: wenzelm@7308: val print_context = Toplevel.keep Toplevel.print_state_context; wenzelm@9513: wenzelm@20621: fun print_theory verbose = Toplevel.unknown_theory o wenzelm@22872: Toplevel.keep (Pretty.writeln o ProofDisplay.pretty_full_theory verbose o Toplevel.theory_of); wenzelm@9513: wenzelm@21663: val print_syntax = Toplevel.unknown_context o wenzelm@21663: Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of); wenzelm@9513: wenzelm@21725: val print_abbrevs = Toplevel.unknown_context o wenzelm@21725: Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of); wenzelm@21725: wenzelm@21003: val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state => wenzelm@21003: ProofContext.setmp_verbose wenzelm@21506: ProofContext.print_lthms (Toplevel.context_of state)); wenzelm@21003: wenzelm@17066: val print_theorems_proof = Toplevel.keep (fn state => wenzelm@17066: ProofContext.setmp_verbose wenzelm@17066: ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state))); wenzelm@17066: wenzelm@18588: val print_theorems_theory = Toplevel.keep (fn state => wenzelm@18588: Toplevel.theory_of state |> wenzelm@18588: (case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of wenzelm@20957: SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy) wenzelm@19430: | _ => ProofDisplay.print_theorems)); wenzelm@18588: wenzelm@21663: val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof; wenzelm@9513: wenzelm@12060: val print_locales = Toplevel.unknown_theory o wenzelm@12060: Toplevel.keep (Locale.print_locales o Toplevel.theory_of); wenzelm@12060: wenzelm@22573: fun print_locale (show_facts, (imports, body)) = Toplevel.unknown_theory o wenzelm@19385: Toplevel.keep (fn state => wenzelm@22573: Locale.print_locale (Toplevel.theory_of state) show_facts imports body); ballarin@15596: ballarin@17139: fun print_registrations show_wits name = Toplevel.unknown_context o wenzelm@20957: Toplevel.keep (Toplevel.node_case wenzelm@20957: (Context.cases (Locale.print_global_registrations show_wits name) wenzelm@20957: (Locale.print_local_registrations show_wits name)) ballarin@17139: (Locale.print_local_registrations show_wits name o Proof.context_of)); wenzelm@12060: wenzelm@9513: val print_attributes = Toplevel.unknown_theory o wenzelm@9513: Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of); wenzelm@9513: wenzelm@16026: val print_simpset = Toplevel.unknown_context o wenzelm@20957: Toplevel.keep (Toplevel.node_case wenzelm@20957: (Context.cases Simplifier.print_simpset Simplifier.print_local_simpset) wenzelm@16026: (Simplifier.print_local_simpset o Proof.context_of)); wenzelm@16026: wenzelm@12382: val print_rules = Toplevel.unknown_context o wenzelm@18639: Toplevel.keep (ContextRules.print_rules o Toplevel.context_of); wenzelm@12382: wenzelm@11666: val print_induct_rules = Toplevel.unknown_context o wenzelm@18639: Toplevel.keep (InductAttrib.print_rules o Toplevel.context_of); wenzelm@11666: wenzelm@9513: val print_trans_rules = Toplevel.unknown_context o wenzelm@18639: Toplevel.keep (Calculation.print_rules o Toplevel.context_of); wenzelm@9513: wenzelm@9513: val print_methods = Toplevel.unknown_theory o wenzelm@9513: Toplevel.keep (Method.print_methods o Toplevel.theory_of); wenzelm@9513: wenzelm@22116: val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations; wenzelm@5831: haftmann@22485: val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state => haftmann@22485: let haftmann@22485: val thy = Toplevel.theory_of state; wenzelm@22604: val all_thys = sort Context.thy_ord (thy :: Theory.ancestors_of thy); wenzelm@22604: val gr = all_thys |> map (fn node => wenzelm@22602: let wenzelm@22602: val name = Context.theory_name node; wenzelm@22602: val parents = map Context.theory_name (Theory.parents_of node); wenzelm@22602: in {name = name, ID = name, parents = parents, dir = "", unfold = true, path = ""} end); wenzelm@22602: in Present.display_graph gr end); haftmann@22485: wenzelm@20574: val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state => wenzelm@20574: let wenzelm@20574: val thy = Toplevel.theory_of state; wenzelm@20574: val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy); wenzelm@20574: val {classes, ...} = Sorts.rep_algebra algebra; wenzelm@20574: fun entry (c, (i, (_, cs))) = wenzelm@20574: (i, {name = NameSpace.extern space c, ID = c, parents = cs, wenzelm@20574: dir = "", unfold = true, path = ""}); wenzelm@20574: val gr = wenzelm@20574: Graph.fold (cons o entry) classes [] wenzelm@20574: |> sort (int_ord o pairself #1) |> map #2; wenzelm@20574: in Present.display_graph gr end); wenzelm@20574: kleing@15964: wenzelm@16026: (* retrieve theorems *) wenzelm@7615: wenzelm@9513: fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state => wenzelm@21003: ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args)); wenzelm@9454: kleing@22340: fun find_theorems ((opt_lim, rem_dups), spec) = kleing@22340: Toplevel.unknown_theory o Toplevel.keep (fn state => wenzelm@16026: let wenzelm@21003: val proof_state = Toplevel.enter_proof_body state; wenzelm@16026: val ctxt = Proof.context_of proof_state; wenzelm@16026: val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2); kleing@22340: in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end); wenzelm@16026: wenzelm@5831: wenzelm@5831: (* print proof context contents *) wenzelm@5831: wenzelm@21663: val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state => wenzelm@21663: ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state)); wenzelm@9513: wenzelm@21663: val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state => wenzelm@21663: ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state)); wenzelm@5831: wenzelm@5831: wenzelm@19268: (* print theorems, terms, types etc. *) wenzelm@19268: wenzelm@19385: local wenzelm@19385: wenzelm@19385: fun string_of_stmts state args = wenzelm@19268: Proof.get_thmss state args wenzelm@21437: |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK) wenzelm@19385: |> Pretty.chunks2 |> Pretty.string_of; wenzelm@5880: wenzelm@19385: fun string_of_thms state args = wenzelm@12055: Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state) wenzelm@19385: (Proof.get_thmss state args)); wenzelm@5895: wenzelm@19385: fun string_of_prfs full state arg = wenzelm@17066: Pretty.string_of (case arg of skalberg@15531: NONE => berghofe@12125: let wenzelm@17066: val (ctxt, (_, thm)) = Proof.get_goal state; wenzelm@17066: val {thy, der = (_, prf), ...} = Thm.rep_thm thm; wenzelm@17066: val prop = Thm.full_prop_of thm; berghofe@12125: val prf' = Proofterm.rewrite_proof_notypes ([], []) prf berghofe@12125: in wenzelm@17066: ProofContext.pretty_proof ctxt wenzelm@17066: (if full then Reconstruct.reconstruct_proof thy prop prf' else prf') berghofe@12125: end skalberg@15531: | SOME args => Pretty.chunks wenzelm@17066: (map (ProofContext.pretty_proof_of (Proof.context_of state) full) wenzelm@19385: (Proof.get_thmss state args))); berghofe@11524: wenzelm@19385: fun string_of_prop state s = wenzelm@5831: let wenzelm@12055: val ctxt = Proof.context_of state; wenzelm@12055: val prop = ProofContext.read_prop ctxt s; wenzelm@19385: in Pretty.string_of (Pretty.quote (ProofContext.pretty_term ctxt prop)) end; wenzelm@5831: wenzelm@19385: fun string_of_term state s = wenzelm@5831: let wenzelm@12055: val ctxt = Proof.context_of state; wenzelm@12055: val t = ProofContext.read_term ctxt s; wenzelm@5831: val T = Term.type_of t; wenzelm@5831: in wenzelm@19385: Pretty.string_of wenzelm@12055: (Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk, wenzelm@19385: Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)]) wenzelm@9128: end; wenzelm@5831: wenzelm@19385: fun string_of_type state s = wenzelm@5831: let wenzelm@12055: val ctxt = Proof.context_of state; wenzelm@12055: val T = ProofContext.read_typ ctxt s; wenzelm@19385: in Pretty.string_of (Pretty.quote (ProofContext.pretty_typ ctxt T)) end; wenzelm@9128: wenzelm@19385: fun print_item string_of (modes, arg) = Toplevel.keep (fn state => with_modes modes (fn () => wenzelm@21003: writeln (string_of (Toplevel.enter_proof_body state) arg))); wenzelm@19385: wenzelm@19385: in wenzelm@9128: wenzelm@19268: val print_stmts = print_item string_of_stmts; wenzelm@12876: val print_thms = print_item string_of_thms; wenzelm@19385: val print_prfs = print_item o string_of_prfs; wenzelm@12876: val print_prop = print_item string_of_prop; wenzelm@12876: val print_term = print_item string_of_term; wenzelm@12876: val print_type = print_item string_of_type; wenzelm@5831: wenzelm@19385: end; wenzelm@19385: wenzelm@12938: wenzelm@12938: (* markup commands *) wenzelm@12938: wenzelm@12938: fun add_header s = Toplevel.keep' (fn int => fn state => wenzelm@21858: (if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF; wenzelm@19057: if int then OuterSyntax.check_text s NONE else ())); wenzelm@12938: wenzelm@12953: local wenzelm@12953: wenzelm@19057: fun present _ txt true node = OuterSyntax.check_text txt (SOME node) wenzelm@19057: | present f (s, _) false node = wenzelm@22116: ML_Context.setmp (try (Toplevel.cases_node I (Context.Proof o Proof.context_of)) node) f s; wenzelm@12953: wenzelm@19057: fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt); wenzelm@19057: fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt); wenzelm@12938: wenzelm@12953: in wenzelm@12953: wenzelm@19057: val add_chapter = present_local_theory Present.section; wenzelm@19057: val add_section = present_local_theory Present.section; wenzelm@19057: val add_subsection = present_local_theory Present.subsection; wenzelm@19057: val add_subsubsection = present_local_theory Present.subsubsection; wenzelm@19057: val add_text = present_local_theory (K ()); wenzelm@19057: fun add_text_raw txt = present_local_theory (K ()) (NONE, txt); wenzelm@19057: val add_txt = present_proof (K ()); wenzelm@19057: val add_txt_raw = add_txt; wenzelm@19057: val add_sect = add_txt; wenzelm@19057: val add_subsect = add_txt; wenzelm@19057: val add_subsubsect = add_txt; wenzelm@12938: wenzelm@5831: end; wenzelm@12953: wenzelm@12953: end;