(* Title: Pure/Isar/isar_cmd.ML
ID: $Id$
Author: Markus Wenzel, TU Muenchen
Non-logical toplevel commands.
*)
signature ISAR_CMD =
sig
val welcome: Toplevel.transition -> Toplevel.transition
val init_toplevel: Toplevel.transition -> Toplevel.transition
val exit: Toplevel.transition -> Toplevel.transition
val quit: Toplevel.transition -> Toplevel.transition
val touch_child_thys: string -> Toplevel.transition -> Toplevel.transition
val touch_all_thys: Toplevel.transition -> Toplevel.transition
val touch_thy: string -> Toplevel.transition -> Toplevel.transition
val remove_thy: string -> Toplevel.transition -> Toplevel.transition
val kill_thy: string -> Toplevel.transition -> Toplevel.transition
val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition
val disable_pr: Toplevel.transition -> Toplevel.transition
val enable_pr: Toplevel.transition -> Toplevel.transition
val undo_end: string -> Toplevel.transition -> Toplevel.transition
val clear_undos_theory: int -> Toplevel.transition -> Toplevel.transition
val redo: Toplevel.transition -> Toplevel.transition
val undos_proof: int -> Toplevel.transition -> Toplevel.transition
val kill_proof_notify: (unit -> unit) -> Toplevel.transition -> Toplevel.transition
val kill_proof: Toplevel.transition -> Toplevel.transition
val undo_theory: Toplevel.transition -> Toplevel.transition
val undo: Toplevel.transition -> Toplevel.transition
val kill: Toplevel.transition -> Toplevel.transition
val back: Toplevel.transition -> Toplevel.transition
val use: Path.T -> Toplevel.transition -> Toplevel.transition
val use_mltext_theory: string -> Toplevel.transition -> Toplevel.transition
val use_mltext: bool -> string -> Toplevel.transition -> Toplevel.transition
val use_commit: Toplevel.transition -> Toplevel.transition
val cd: Path.T -> Toplevel.transition -> Toplevel.transition
val pwd: Toplevel.transition -> Toplevel.transition
val use_thy: string -> Toplevel.transition -> Toplevel.transition
val use_thy_only: string -> Toplevel.transition -> Toplevel.transition
val update_thy: string -> Toplevel.transition -> Toplevel.transition
val update_thy_only: string -> Toplevel.transition -> Toplevel.transition
val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition
val print_context: Toplevel.transition -> Toplevel.transition
val print_theory: bool -> Toplevel.transition -> Toplevel.transition
val print_syntax: Toplevel.transition -> Toplevel.transition
val print_theorems: Toplevel.transition -> Toplevel.transition
val print_locales: Toplevel.transition -> Toplevel.transition
val print_locale: bool * (Locale.expr * Element.context list)
-> Toplevel.transition -> Toplevel.transition
val print_registrations: bool -> string -> Toplevel.transition -> Toplevel.transition
val print_attributes: Toplevel.transition -> Toplevel.transition
val print_simpset: Toplevel.transition -> Toplevel.transition
val print_rules: Toplevel.transition -> Toplevel.transition
val print_induct_rules: Toplevel.transition -> Toplevel.transition
val print_trans_rules: Toplevel.transition -> Toplevel.transition
val print_methods: Toplevel.transition -> Toplevel.transition
val print_antiquotations: Toplevel.transition -> Toplevel.transition
val class_deps: Toplevel.transition -> Toplevel.transition
val thm_deps: (thmref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
val find_theorems: int option * (bool * string FindTheorems.criterion) list
-> Toplevel.transition -> Toplevel.transition
val print_binds: Toplevel.transition -> Toplevel.transition
val print_lthms: Toplevel.transition -> Toplevel.transition
val print_cases: Toplevel.transition -> Toplevel.transition
val print_stmts: string list * (thmref * Attrib.src list) list
-> Toplevel.transition -> Toplevel.transition
val print_thms: string list * (thmref * Attrib.src list) list
-> Toplevel.transition -> Toplevel.transition
val print_prfs: bool -> string list * (thmref * Attrib.src list) list option
-> Toplevel.transition -> Toplevel.transition
val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition
val add_chapter: xstring option * (string * Position.T) ->
Toplevel.transition -> Toplevel.transition
val add_section: xstring option * (string * Position.T) ->
Toplevel.transition -> Toplevel.transition
val add_subsection: xstring option * (string * Position.T) ->
Toplevel.transition -> Toplevel.transition
val add_subsubsection: xstring option * (string * Position.T) ->
Toplevel.transition -> Toplevel.transition
val add_text: xstring option * (string * Position.T) ->
Toplevel.transition -> Toplevel.transition
val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition
val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition
val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
end;
structure IsarCmd: ISAR_CMD =
struct
(* variations on init / exit *)
val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
val welcome = Toplevel.imperative (writeln o Session.welcome);
val exit = Toplevel.keep (fn state =>
(Context.set_context (try Toplevel.theory_of state);
writeln "Leaving the Isar loop. Invoke 'Isar.loop();' to continue.";
raise Toplevel.TERMINATE));
val quit = Toplevel.imperative quit;
(* touch theories *)
fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
val touch_all_thys = Toplevel.imperative ThyInfo.touch_all_thys;
fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
fun kill_thy name = Toplevel.imperative (fn () => IsarThy.kill_theory name);
(* print state *)
fun with_modes modes e =
Library.setmp print_mode (modes @ ! print_mode) e ();
fun set_limit _ NONE = ()
| set_limit r (SOME n) = r := n;
fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
(set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
with_modes modes (fn () => Toplevel.print_state true state)));
val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
(* history commands *)
fun undo_end txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt));
val clear_undos_theory = Toplevel.history o History.clear;
val redo =
Toplevel.history History.redo o
Toplevel.actual_proof ProofHistory.redo o
Toplevel.skip_proof History.redo;
fun undos_proof n =
Toplevel.actual_proof (fn prf =>
if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o
Toplevel.skip_proof (fn h =>
if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h);
fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist =>
if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF
else (f (); History.undo hist));
val kill_proof = kill_proof_notify (K ());
val undo_theory = Toplevel.history (fn hist =>
if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist);
val undo = Toplevel.kill o undo_theory o undos_proof 1;
val kill = Toplevel.kill o kill_proof;
val back =
Toplevel.actual_proof ProofHistory.back o
Toplevel.skip_proof (History.apply I);
(* use ML text *)
fun use path = Toplevel.keep (fn state =>
Context.setmp (try Toplevel.theory_of state) (ThyInfo.load_file false) path);
(*passes changes of theory context*)
val use_mltext_theory = Toplevel.theory' o Context.use_mltext_theory;
(*ignore result theory context*)
fun use_mltext v txt = Toplevel.keep' (fn verb => fn state =>
(Context.use_mltext txt (v andalso verb) (try Toplevel.theory_of state)));
val use_commit = Toplevel.imperative Secure.commit;
(* current working directory *)
fun cd path = Toplevel.imperative (fn () => (File.cd path));
val pwd = Toplevel.imperative (fn () => writeln (Path.pack (File.pwd ())));
(* load theory files *)
fun use_thy name = Toplevel.imperative (fn () => Context.save ThyInfo.use_thy name);
fun use_thy_only name = Toplevel.imperative (fn () => Context.save ThyInfo.use_thy_only name);
fun update_thy name = Toplevel.imperative (fn () => Context.save ThyInfo.update_thy name);
fun update_thy_only name =
Toplevel.imperative (fn () => Context.save ThyInfo.update_thy_only name);
(* present draft files *)
fun display_drafts files = Toplevel.imperative (fn () =>
let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
in File.isatool ("display -c " ^ outfile ^ " &"); () end);
fun print_drafts files = Toplevel.imperative (fn () =>
let val outfile = File.shell_path (Present.drafts "ps" files)
in File.isatool ("print -c " ^ outfile); () end);
(* pretty_setmargin *)
fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
(* print parts of theory and proof context *)
val print_context = Toplevel.keep Toplevel.print_state_context;
fun print_theory verbose = Toplevel.unknown_theory o
Toplevel.keep (ProofDisplay.print_full_theory verbose o Toplevel.theory_of);
val print_syntax = Toplevel.unknown_theory o
Toplevel.keep (Display.print_syntax o Toplevel.theory_of) o
Toplevel.keep (ProofContext.print_syntax o Proof.context_of o Toplevel.proof_of);
val print_theorems_proof = Toplevel.keep (fn state =>
ProofContext.setmp_verbose
ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
val print_theorems_theory = Toplevel.keep (fn state =>
Toplevel.theory_of state |>
(case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff prev_thy
| _ => ProofDisplay.print_theorems));
val print_theorems = Toplevel.unknown_theory o print_theorems_theory o print_theorems_proof;
val print_locales = Toplevel.unknown_theory o
Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
fun print_locale (show_facts, (import, body)) = Toplevel.unknown_theory o
Toplevel.keep (fn state =>
Locale.print_locale (Toplevel.theory_of state) show_facts import body);
fun print_registrations show_wits name = Toplevel.unknown_context o
Toplevel.keep (Toplevel.node_case (Locale.print_global_registrations show_wits name)
(Locale.print_local_registrations show_wits name o Proof.context_of));
val print_attributes = Toplevel.unknown_theory o
Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
val print_simpset = Toplevel.unknown_context o
Toplevel.keep (Toplevel.node_case Simplifier.print_simpset
(Simplifier.print_local_simpset o Proof.context_of));
val print_rules = Toplevel.unknown_context o
Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
val print_induct_rules = Toplevel.unknown_context o
Toplevel.keep (InductAttrib.print_rules o Toplevel.context_of);
val print_trans_rules = Toplevel.unknown_context o
Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
val print_methods = Toplevel.unknown_theory o
Toplevel.keep (Method.print_methods o Toplevel.theory_of);
val print_antiquotations = Toplevel.imperative IsarOutput.print_antiquotations;
val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
let
val thy = Toplevel.theory_of state;
val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
val {classes, ...} = Sorts.rep_algebra algebra;
fun entry (c, (i, (_, cs))) =
(i, {name = NameSpace.extern space c, ID = c, parents = cs,
dir = "", unfold = true, path = ""});
val gr =
Graph.fold (cons o entry) classes []
|> sort (int_ord o pairself #1) |> map #2;
in Present.display_graph gr end);
(* retrieve theorems *)
fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_forward_proof state) args));
fun find_theorems (opt_lim, spec) = Toplevel.unknown_theory o Toplevel.keep (fn state =>
let
val proof_state = Toplevel.enter_forward_proof state;
val ctxt = Proof.context_of proof_state;
val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
in FindTheorems.print_theorems ctxt opt_goal opt_lim spec end);
(* print proof context contents *)
val print_binds = Toplevel.unknown_proof o Toplevel.keep (fn state =>
ProofContext.setmp_verbose
ProofContext.print_binds (Proof.context_of (Toplevel.proof_of state)));
val print_lthms = Toplevel.unknown_proof o print_theorems_proof;
val print_cases = Toplevel.unknown_proof o Toplevel.keep (fn state =>
ProofContext.setmp_verbose
ProofContext.print_cases (Proof.context_of (Toplevel.proof_of state)));
(* print theorems, terms, types etc. *)
local
fun string_of_stmts state args =
Proof.get_thmss state args
|> map (Element.pretty_statement (Proof.context_of state) PureThy.lemmaK)
|> Pretty.chunks2 |> Pretty.string_of;
fun string_of_thms state args =
Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
(Proof.get_thmss state args));
fun string_of_prfs full state arg =
Pretty.string_of (case arg of
NONE =>
let
val (ctxt, (_, thm)) = Proof.get_goal state;
val {thy, der = (_, prf), ...} = Thm.rep_thm thm;
val prop = Thm.full_prop_of thm;
val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
in
ProofContext.pretty_proof ctxt
(if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
end
| SOME args => Pretty.chunks
(map (ProofContext.pretty_proof_of (Proof.context_of state) full)
(Proof.get_thmss state args)));
fun string_of_prop state s =
let
val ctxt = Proof.context_of state;
val prop = ProofContext.read_prop ctxt s;
in Pretty.string_of (Pretty.quote (ProofContext.pretty_term ctxt prop)) end;
fun string_of_term state s =
let
val ctxt = Proof.context_of state;
val t = ProofContext.read_term ctxt s;
val T = Term.type_of t;
in
Pretty.string_of
(Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk,
Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)])
end;
fun string_of_type state s =
let
val ctxt = Proof.context_of state;
val T = ProofContext.read_typ ctxt s;
in Pretty.string_of (Pretty.quote (ProofContext.pretty_typ ctxt T)) end;
fun print_item string_of (modes, arg) = Toplevel.keep (fn state => with_modes modes (fn () =>
writeln (string_of (Toplevel.enter_forward_proof state) arg)));
in
val print_stmts = print_item string_of_stmts;
val print_thms = print_item string_of_thms;
val print_prfs = print_item o string_of_prfs;
val print_prop = print_item string_of_prop;
val print_term = print_item string_of_term;
val print_type = print_item string_of_type;
end;
(* markup commands *)
fun add_header s = Toplevel.keep' (fn int => fn state =>
(Toplevel.assert (Toplevel.is_toplevel state);
if int then OuterSyntax.check_text s NONE else ()));
local
fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
| present f (s, _) false node =
Context.setmp (try (Toplevel.cases_node I Proof.theory_of) node) f s;
fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
in
val add_chapter = present_local_theory Present.section;
val add_section = present_local_theory Present.section;
val add_subsection = present_local_theory Present.subsection;
val add_subsubsection = present_local_theory Present.subsubsection;
val add_text = present_local_theory (K ());
fun add_text_raw txt = present_local_theory (K ()) (NONE, txt);
val add_txt = present_proof (K ());
val add_txt_raw = add_txt;
val add_sect = add_txt;
val add_subsect = add_txt;
val add_subsubsect = add_txt;
end;
end;