wenzelm@5831
|
1 |
(* Title: Pure/Isar/isar_cmd.ML
|
wenzelm@5831
|
2 |
ID: $Id$
|
wenzelm@5831
|
3 |
Author: Markus Wenzel, TU Muenchen
|
wenzelm@5831
|
4 |
|
wenzelm@21350
|
5 |
Derived Isar commands.
|
wenzelm@5831
|
6 |
*)
|
wenzelm@5831
|
7 |
|
wenzelm@5831
|
8 |
signature ISAR_CMD =
|
wenzelm@5831
|
9 |
sig
|
wenzelm@26385
|
10 |
val generic_setup: (string * Position.T) option -> theory -> theory
|
wenzelm@26385
|
11 |
val parse_ast_translation: bool * (string * Position.T) -> theory -> theory
|
wenzelm@26385
|
12 |
val parse_translation: bool * (string * Position.T) -> theory -> theory
|
wenzelm@26385
|
13 |
val print_translation: bool * (string * Position.T) -> theory -> theory
|
wenzelm@26385
|
14 |
val typed_print_translation: bool * (string * Position.T) -> theory -> theory
|
wenzelm@26385
|
15 |
val print_ast_translation: bool * (string * Position.T) -> theory -> theory
|
wenzelm@26385
|
16 |
val token_translation: string * Position.T -> theory -> theory
|
wenzelm@26385
|
17 |
val oracle: bstring -> string -> string * Position.T -> theory -> theory
|
wenzelm@21350
|
18 |
val add_axioms: ((bstring * string) * Attrib.src list) list -> theory -> theory
|
wenzelm@21350
|
19 |
val add_defs: (bool * bool) * ((bstring * string) * Attrib.src list) list -> theory -> theory
|
wenzelm@26336
|
20 |
val apply_theorems: (Facts.ref * Attrib.src list) list -> theory -> thm list * theory
|
wenzelm@21350
|
21 |
val apply_theorems_i: (thm list * attribute list) list -> theory -> thm list * theory
|
wenzelm@26385
|
22 |
val declaration: string * Position.T -> local_theory -> local_theory
|
wenzelm@26385
|
23 |
val simproc_setup: string -> string list -> string * Position.T -> string list ->
|
wenzelm@26385
|
24 |
local_theory -> local_theory
|
wenzelm@21350
|
25 |
val have: ((string * Attrib.src list) * (string * string list) list) list ->
|
wenzelm@21350
|
26 |
bool -> Proof.state -> Proof.state
|
wenzelm@21350
|
27 |
val hence: ((string * Attrib.src list) * (string * string list) list) list ->
|
wenzelm@21350
|
28 |
bool -> Proof.state -> Proof.state
|
wenzelm@21350
|
29 |
val show: ((string * Attrib.src list) * (string * string list) list) list ->
|
wenzelm@21350
|
30 |
bool -> Proof.state -> Proof.state
|
wenzelm@21350
|
31 |
val thus: ((string * Attrib.src list) * (string * string list) list) list ->
|
wenzelm@21350
|
32 |
bool -> Proof.state -> Proof.state
|
wenzelm@21350
|
33 |
val qed: Method.text option -> Toplevel.transition -> Toplevel.transition
|
wenzelm@21350
|
34 |
val terminal_proof: Method.text * Method.text option ->
|
wenzelm@21350
|
35 |
Toplevel.transition -> Toplevel.transition
|
wenzelm@21350
|
36 |
val default_proof: Toplevel.transition -> Toplevel.transition
|
wenzelm@21350
|
37 |
val immediate_proof: Toplevel.transition -> Toplevel.transition
|
wenzelm@21350
|
38 |
val done_proof: Toplevel.transition -> Toplevel.transition
|
wenzelm@21350
|
39 |
val skip_proof: Toplevel.transition -> Toplevel.transition
|
wenzelm@21350
|
40 |
val begin_theory: string -> string list -> (string * bool) list -> bool -> theory
|
wenzelm@21350
|
41 |
val end_theory: theory -> theory
|
wenzelm@21350
|
42 |
val kill_theory: string -> unit
|
wenzelm@21350
|
43 |
val theory: string * string list * (string * bool) list
|
wenzelm@21350
|
44 |
-> Toplevel.transition -> Toplevel.transition
|
wenzelm@7462
|
45 |
val welcome: Toplevel.transition -> Toplevel.transition
|
wenzelm@7462
|
46 |
val init_toplevel: Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
47 |
val exit: Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
48 |
val quit: Toplevel.transition -> Toplevel.transition
|
wenzelm@7908
|
49 |
val touch_child_thys: string -> Toplevel.transition -> Toplevel.transition
|
wenzelm@7101
|
50 |
val touch_thy: string -> Toplevel.transition -> Toplevel.transition
|
wenzelm@7101
|
51 |
val remove_thy: string -> Toplevel.transition -> Toplevel.transition
|
wenzelm@7931
|
52 |
val kill_thy: string -> Toplevel.transition -> Toplevel.transition
|
wenzelm@9731
|
53 |
val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition
|
wenzelm@8453
|
54 |
val disable_pr: Toplevel.transition -> Toplevel.transition
|
wenzelm@8453
|
55 |
val enable_pr: Toplevel.transition -> Toplevel.transition
|
wenzelm@6742
|
56 |
val redo: Toplevel.transition -> Toplevel.transition
|
wenzelm@6742
|
57 |
val undos_proof: int -> Toplevel.transition -> Toplevel.transition
|
wenzelm@7936
|
58 |
val kill_proof_notify: (unit -> unit) -> Toplevel.transition -> Toplevel.transition
|
wenzelm@6742
|
59 |
val kill_proof: Toplevel.transition -> Toplevel.transition
|
wenzelm@6742
|
60 |
val undo_theory: Toplevel.transition -> Toplevel.transition
|
wenzelm@6686
|
61 |
val undo: Toplevel.transition -> Toplevel.transition
|
wenzelm@21955
|
62 |
val cannot_undo: string -> Toplevel.transition -> Toplevel.transition
|
wenzelm@8498
|
63 |
val kill: Toplevel.transition -> Toplevel.transition
|
wenzelm@17066
|
64 |
val back: Toplevel.transition -> Toplevel.transition
|
wenzelm@14950
|
65 |
val use: Path.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@26385
|
66 |
val use_mltext_theory: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@26385
|
67 |
val use_mltext: bool -> string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
68 |
val use_commit: Toplevel.transition -> Toplevel.transition
|
wenzelm@25793
|
69 |
val nested_command: Markup.property list -> string * Position.T -> Toplevel.transition
|
wenzelm@14950
|
70 |
val cd: Path.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
71 |
val pwd: Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
72 |
val use_thy: string -> Toplevel.transition -> Toplevel.transition
|
wenzelm@14950
|
73 |
val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
|
wenzelm@14950
|
74 |
val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
|
wenzelm@7124
|
75 |
val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition
|
wenzelm@7308
|
76 |
val print_context: Toplevel.transition -> Toplevel.transition
|
wenzelm@20621
|
77 |
val print_theory: bool -> Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
78 |
val print_syntax: Toplevel.transition -> Toplevel.transition
|
wenzelm@21725
|
79 |
val print_abbrevs: Toplevel.transition -> Toplevel.transition
|
wenzelm@21003
|
80 |
val print_facts: Toplevel.transition -> Toplevel.transition
|
wenzelm@24115
|
81 |
val print_configs: Toplevel.transition -> Toplevel.transition
|
wenzelm@5880
|
82 |
val print_theorems: Toplevel.transition -> Toplevel.transition
|
wenzelm@12060
|
83 |
val print_locales: Toplevel.transition -> Toplevel.transition
|
wenzelm@18135
|
84 |
val print_locale: bool * (Locale.expr * Element.context list)
|
wenzelm@12758
|
85 |
-> Toplevel.transition -> Toplevel.transition
|
ballarin@17139
|
86 |
val print_registrations: bool -> string -> Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
87 |
val print_attributes: Toplevel.transition -> Toplevel.transition
|
wenzelm@16026
|
88 |
val print_simpset: Toplevel.transition -> Toplevel.transition
|
wenzelm@12382
|
89 |
val print_rules: Toplevel.transition -> Toplevel.transition
|
wenzelm@9219
|
90 |
val print_trans_rules: Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
91 |
val print_methods: Toplevel.transition -> Toplevel.transition
|
wenzelm@9219
|
92 |
val print_antiquotations: Toplevel.transition -> Toplevel.transition
|
wenzelm@20574
|
93 |
val class_deps: Toplevel.transition -> Toplevel.transition
|
haftmann@22485
|
94 |
val thy_deps: Toplevel.transition -> Toplevel.transition
|
wenzelm@26336
|
95 |
val thm_deps: (Facts.ref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
|
kleing@22340
|
96 |
val find_theorems: (int option * bool) * (bool * string FindTheorems.criterion) list
|
wenzelm@13284
|
97 |
-> Toplevel.transition -> Toplevel.transition
|
berghofe@26184
|
98 |
val unused_thms: (string list * string list option) option ->
|
berghofe@26184
|
99 |
Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
100 |
val print_binds: Toplevel.transition -> Toplevel.transition
|
wenzelm@8369
|
101 |
val print_cases: Toplevel.transition -> Toplevel.transition
|
wenzelm@26336
|
102 |
val print_stmts: string list * (Facts.ref * Attrib.src list) list
|
wenzelm@19268
|
103 |
-> Toplevel.transition -> Toplevel.transition
|
wenzelm@26336
|
104 |
val print_thms: string list * (Facts.ref * Attrib.src list) list
|
wenzelm@8463
|
105 |
-> Toplevel.transition -> Toplevel.transition
|
wenzelm@26336
|
106 |
val print_prfs: bool -> string list * (Facts.ref * Attrib.src list) list option
|
berghofe@11524
|
107 |
-> Toplevel.transition -> Toplevel.transition
|
wenzelm@12876
|
108 |
val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12876
|
109 |
val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12876
|
110 |
val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12938
|
111 |
val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@17262
|
112 |
val add_chapter: xstring option * (string * Position.T) ->
|
wenzelm@17262
|
113 |
Toplevel.transition -> Toplevel.transition
|
wenzelm@17262
|
114 |
val add_section: xstring option * (string * Position.T) ->
|
wenzelm@17262
|
115 |
Toplevel.transition -> Toplevel.transition
|
wenzelm@17262
|
116 |
val add_subsection: xstring option * (string * Position.T) ->
|
wenzelm@17262
|
117 |
Toplevel.transition -> Toplevel.transition
|
wenzelm@17262
|
118 |
val add_subsubsection: xstring option * (string * Position.T) ->
|
wenzelm@17262
|
119 |
Toplevel.transition -> Toplevel.transition
|
wenzelm@17262
|
120 |
val add_text: xstring option * (string * Position.T) ->
|
wenzelm@17262
|
121 |
Toplevel.transition -> Toplevel.transition
|
wenzelm@12938
|
122 |
val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12938
|
123 |
val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12938
|
124 |
val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12938
|
125 |
val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12938
|
126 |
val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@12938
|
127 |
val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
|
wenzelm@5831
|
128 |
end;
|
wenzelm@5831
|
129 |
|
wenzelm@5831
|
130 |
structure IsarCmd: ISAR_CMD =
|
wenzelm@5831
|
131 |
struct
|
wenzelm@5831
|
132 |
|
wenzelm@5831
|
133 |
|
wenzelm@22116
|
134 |
(** theory declarations **)
|
wenzelm@22116
|
135 |
|
wenzelm@22116
|
136 |
(* generic_setup *)
|
wenzelm@22116
|
137 |
|
wenzelm@22116
|
138 |
fun generic_setup NONE = (fn thy => thy |> Context.setup ())
|
wenzelm@26385
|
139 |
| generic_setup (SOME (txt, pos)) =
|
wenzelm@26385
|
140 |
ML_Context.use_let pos "val setup: theory -> theory" "Context.map_theory setup" txt
|
wenzelm@22116
|
141 |
|> Context.theory_map;
|
wenzelm@22116
|
142 |
|
wenzelm@22116
|
143 |
|
wenzelm@22116
|
144 |
(* translation functions *)
|
wenzelm@22116
|
145 |
|
wenzelm@22116
|
146 |
local
|
wenzelm@22116
|
147 |
|
wenzelm@22116
|
148 |
fun advancedT false = ""
|
wenzelm@22116
|
149 |
| advancedT true = "Proof.context -> ";
|
wenzelm@22116
|
150 |
|
wenzelm@22116
|
151 |
fun advancedN false = ""
|
wenzelm@22116
|
152 |
| advancedN true = "advanced_";
|
wenzelm@22116
|
153 |
|
wenzelm@22116
|
154 |
in
|
wenzelm@22116
|
155 |
|
wenzelm@26385
|
156 |
fun parse_ast_translation (a, (txt, pos)) =
|
wenzelm@26385
|
157 |
txt |> ML_Context.use_let pos ("val parse_ast_translation: (string * (" ^ advancedT a ^
|
wenzelm@22116
|
158 |
"Syntax.ast list -> Syntax.ast)) list")
|
wenzelm@22116
|
159 |
("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
|
wenzelm@22116
|
160 |
|> Context.theory_map;
|
wenzelm@22116
|
161 |
|
wenzelm@26385
|
162 |
fun parse_translation (a, (txt, pos)) =
|
wenzelm@26385
|
163 |
txt |> ML_Context.use_let pos ("val parse_translation: (string * (" ^ advancedT a ^
|
wenzelm@22116
|
164 |
"term list -> term)) list")
|
wenzelm@22116
|
165 |
("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))")
|
wenzelm@22116
|
166 |
|> Context.theory_map;
|
wenzelm@22116
|
167 |
|
wenzelm@26385
|
168 |
fun print_translation (a, (txt, pos)) =
|
wenzelm@26385
|
169 |
txt |> ML_Context.use_let pos ("val print_translation: (string * (" ^ advancedT a ^
|
wenzelm@22116
|
170 |
"term list -> term)) list")
|
wenzelm@22116
|
171 |
("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
|
wenzelm@22116
|
172 |
|> Context.theory_map;
|
wenzelm@22116
|
173 |
|
wenzelm@26385
|
174 |
fun print_ast_translation (a, (txt, pos)) =
|
wenzelm@26385
|
175 |
txt |> ML_Context.use_let pos ("val print_ast_translation: (string * (" ^ advancedT a ^
|
wenzelm@22116
|
176 |
"Syntax.ast list -> Syntax.ast)) list")
|
wenzelm@22116
|
177 |
("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))")
|
wenzelm@22116
|
178 |
|> Context.theory_map;
|
wenzelm@22116
|
179 |
|
wenzelm@26385
|
180 |
fun typed_print_translation (a, (txt, pos)) =
|
wenzelm@26385
|
181 |
txt |> ML_Context.use_let pos ("val typed_print_translation: (string * (" ^ advancedT a ^
|
wenzelm@22116
|
182 |
"bool -> typ -> term list -> term)) list")
|
wenzelm@22116
|
183 |
("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
|
wenzelm@22116
|
184 |
|> Context.theory_map;
|
wenzelm@22116
|
185 |
|
wenzelm@26385
|
186 |
fun token_translation (txt, pos) =
|
wenzelm@26385
|
187 |
txt |> ML_Context.use_let pos
|
wenzelm@26385
|
188 |
"val token_translation: (string * string * (string -> output * int)) list"
|
wenzelm@26385
|
189 |
"Context.map_theory (Sign.add_tokentrfuns token_translation)"
|
wenzelm@26385
|
190 |
|> Context.theory_map;
|
wenzelm@22116
|
191 |
|
wenzelm@22116
|
192 |
end;
|
wenzelm@22116
|
193 |
|
wenzelm@22116
|
194 |
|
wenzelm@22116
|
195 |
(* oracles *)
|
wenzelm@22116
|
196 |
|
wenzelm@26385
|
197 |
fun oracle name typ (oracle, pos) =
|
wenzelm@22116
|
198 |
let val txt =
|
wenzelm@26385
|
199 |
"local\
|
wenzelm@26385
|
200 |
\ type T = " ^ typ ^ ";\
|
wenzelm@22116
|
201 |
\ val oracle: theory -> T -> term = " ^ oracle ^ ";\n\
|
wenzelm@22116
|
202 |
\ val name = " ^ quote name ^ ";\n\
|
wenzelm@22116
|
203 |
\ exception Arg of T;\n\
|
wenzelm@22116
|
204 |
\ val _ = ML_Context.>> (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x));\n\
|
wenzelm@22116
|
205 |
\ val thy = ML_Context.the_context ();\n\
|
wenzelm@22116
|
206 |
\ val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\
|
wenzelm@22116
|
207 |
\in\n\
|
wenzelm@22116
|
208 |
\ fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\
|
wenzelm@22116
|
209 |
\end;\n";
|
wenzelm@26385
|
210 |
in ML_Context.use_mltext_update false pos txt end
|
wenzelm@22116
|
211 |
|> Context.theory_map;
|
wenzelm@22116
|
212 |
|
wenzelm@22116
|
213 |
|
wenzelm@21350
|
214 |
(* axioms *)
|
wenzelm@21350
|
215 |
|
wenzelm@21350
|
216 |
fun add_axms f args thy =
|
wenzelm@21350
|
217 |
f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy;
|
wenzelm@21350
|
218 |
|
wenzelm@21350
|
219 |
val add_axioms = add_axms (snd oo PureThy.add_axioms);
|
wenzelm@21350
|
220 |
|
wenzelm@21350
|
221 |
fun add_defs ((unchecked, overloaded), args) =
|
wenzelm@21350
|
222 |
add_axms
|
wenzelm@21350
|
223 |
(snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args;
|
wenzelm@21350
|
224 |
|
wenzelm@21350
|
225 |
|
wenzelm@21350
|
226 |
(* facts *)
|
wenzelm@21350
|
227 |
|
wenzelm@21350
|
228 |
fun apply_theorems args thy =
|
wenzelm@21350
|
229 |
let val facts = Attrib.map_facts (Attrib.attribute thy) [(("", []), args)]
|
wenzelm@21350
|
230 |
in apfst (maps snd) (PureThy.note_thmss "" facts thy) end;
|
wenzelm@21350
|
231 |
|
wenzelm@21350
|
232 |
fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)];
|
wenzelm@21350
|
233 |
|
wenzelm@21350
|
234 |
|
wenzelm@22087
|
235 |
(* declarations *)
|
wenzelm@22087
|
236 |
|
wenzelm@26385
|
237 |
fun declaration (txt, pos) =
|
wenzelm@26385
|
238 |
txt |> ML_Context.use_let pos "val declaration: Morphism.declaration"
|
wenzelm@24020
|
239 |
"Context.map_proof (LocalTheory.declaration declaration)"
|
wenzelm@26385
|
240 |
|> Context.proof_map;
|
wenzelm@22087
|
241 |
|
wenzelm@22087
|
242 |
|
wenzelm@22202
|
243 |
(* simprocs *)
|
wenzelm@22202
|
244 |
|
wenzelm@26385
|
245 |
fun simproc_setup name lhss (proc, pos) identifier =
|
wenzelm@26385
|
246 |
ML_Context.use_let pos
|
wenzelm@22239
|
247 |
"val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
|
wenzelm@22239
|
248 |
("Context.map_proof (Simplifier.def_simproc {name = " ^ ML_Syntax.print_string name ^ ", \
|
wenzelm@22239
|
249 |
\lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
|
wenzelm@22239
|
250 |
\identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})") proc
|
wenzelm@22202
|
251 |
|> Context.proof_map;
|
wenzelm@22202
|
252 |
|
wenzelm@22202
|
253 |
|
wenzelm@21350
|
254 |
(* goals *)
|
wenzelm@21350
|
255 |
|
wenzelm@21350
|
256 |
fun goal opt_chain goal stmt int =
|
wenzelm@21350
|
257 |
opt_chain #> goal NONE (K Seq.single) stmt int;
|
wenzelm@21350
|
258 |
|
wenzelm@21350
|
259 |
val have = goal I Proof.have;
|
wenzelm@21350
|
260 |
val hence = goal Proof.chain Proof.have;
|
wenzelm@21350
|
261 |
val show = goal I Proof.show;
|
wenzelm@21350
|
262 |
val thus = goal Proof.chain Proof.show;
|
wenzelm@21350
|
263 |
|
wenzelm@21350
|
264 |
|
wenzelm@21350
|
265 |
(* local endings *)
|
wenzelm@21350
|
266 |
|
wenzelm@21350
|
267 |
fun local_qed m = Toplevel.proofs (Proof.local_qed (m, true));
|
wenzelm@21350
|
268 |
val local_terminal_proof = Toplevel.proofs o Proof.local_terminal_proof;
|
wenzelm@21350
|
269 |
val local_default_proof = Toplevel.proofs Proof.local_default_proof;
|
wenzelm@21350
|
270 |
val local_immediate_proof = Toplevel.proofs Proof.local_immediate_proof;
|
wenzelm@21350
|
271 |
val local_done_proof = Toplevel.proofs Proof.local_done_proof;
|
wenzelm@21350
|
272 |
val local_skip_proof = Toplevel.proofs' Proof.local_skip_proof;
|
wenzelm@21350
|
273 |
|
wenzelm@21350
|
274 |
val skip_local_qed =
|
wenzelm@21350
|
275 |
Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF));
|
wenzelm@21350
|
276 |
|
wenzelm@21350
|
277 |
|
wenzelm@21350
|
278 |
(* global endings *)
|
wenzelm@21350
|
279 |
|
wenzelm@21350
|
280 |
fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
|
wenzelm@21350
|
281 |
val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
|
wenzelm@21350
|
282 |
val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
|
wenzelm@21350
|
283 |
val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
|
wenzelm@21350
|
284 |
val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
|
wenzelm@21350
|
285 |
val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
|
wenzelm@21350
|
286 |
|
wenzelm@21350
|
287 |
val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1);
|
wenzelm@21350
|
288 |
|
wenzelm@21350
|
289 |
|
wenzelm@21350
|
290 |
(* common endings *)
|
wenzelm@21350
|
291 |
|
wenzelm@21350
|
292 |
fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
|
wenzelm@21350
|
293 |
fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
|
wenzelm@21350
|
294 |
val default_proof = local_default_proof o global_default_proof;
|
wenzelm@21350
|
295 |
val immediate_proof = local_immediate_proof o global_immediate_proof;
|
wenzelm@21350
|
296 |
val done_proof = local_done_proof o global_done_proof;
|
wenzelm@21350
|
297 |
val skip_proof = local_skip_proof o global_skip_proof;
|
wenzelm@21350
|
298 |
|
wenzelm@21350
|
299 |
|
wenzelm@21350
|
300 |
(* init and exit *)
|
wenzelm@21350
|
301 |
|
wenzelm@21350
|
302 |
fun begin_theory name imports uses =
|
wenzelm@23897
|
303 |
ThyInfo.begin_theory name imports (map (apfst Path.explode) uses);
|
wenzelm@21350
|
304 |
|
wenzelm@21566
|
305 |
fun end_theory thy =
|
wenzelm@21566
|
306 |
if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy;
|
wenzelm@21350
|
307 |
|
wenzelm@21350
|
308 |
val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
|
wenzelm@21350
|
309 |
|
wenzelm@21350
|
310 |
fun theory (name, imports, uses) =
|
wenzelm@21350
|
311 |
Toplevel.init_theory (begin_theory name imports uses)
|
wenzelm@21350
|
312 |
(fn thy => (end_theory thy; ()))
|
wenzelm@21350
|
313 |
(kill_theory o Context.theory_name);
|
wenzelm@21350
|
314 |
|
wenzelm@7462
|
315 |
val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
|
wenzelm@21350
|
316 |
|
wenzelm@7462
|
317 |
val welcome = Toplevel.imperative (writeln o Session.welcome);
|
wenzelm@5831
|
318 |
|
wenzelm@5831
|
319 |
val exit = Toplevel.keep (fn state =>
|
wenzelm@24071
|
320 |
(CRITICAL (fn () => ML_Context.set_context (try Toplevel.generic_theory_of state));
|
wenzelm@24071
|
321 |
raise Toplevel.TERMINATE));
|
wenzelm@5831
|
322 |
|
wenzelm@5831
|
323 |
val quit = Toplevel.imperative quit;
|
wenzelm@5831
|
324 |
|
wenzelm@7101
|
325 |
|
wenzelm@7101
|
326 |
(* touch theories *)
|
wenzelm@7101
|
327 |
|
wenzelm@7908
|
328 |
fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
|
wenzelm@7101
|
329 |
fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
|
wenzelm@7101
|
330 |
fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
|
wenzelm@21350
|
331 |
fun kill_thy name = Toplevel.imperative (fn () => kill_theory name);
|
wenzelm@7101
|
332 |
|
wenzelm@5831
|
333 |
|
wenzelm@8453
|
334 |
(* print state *)
|
wenzelm@8453
|
335 |
|
skalberg@15531
|
336 |
fun set_limit _ NONE = ()
|
skalberg@15531
|
337 |
| set_limit r (SOME n) = r := n;
|
wenzelm@9731
|
338 |
|
wenzelm@19385
|
339 |
fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
|
wenzelm@9731
|
340 |
(set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
|
wenzelm@23935
|
341 |
PrintMode.with_modes modes (Toplevel.print_state true) state));
|
wenzelm@8453
|
342 |
|
wenzelm@8453
|
343 |
val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
|
wenzelm@8453
|
344 |
val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
|
wenzelm@8453
|
345 |
|
wenzelm@8453
|
346 |
|
wenzelm@6686
|
347 |
(* history commands *)
|
wenzelm@6686
|
348 |
|
wenzelm@16812
|
349 |
val redo =
|
wenzelm@16812
|
350 |
Toplevel.history History.redo o
|
wenzelm@16812
|
351 |
Toplevel.actual_proof ProofHistory.redo o
|
berghofe@15237
|
352 |
Toplevel.skip_proof History.redo;
|
wenzelm@6686
|
353 |
|
wenzelm@16812
|
354 |
fun undos_proof n =
|
wenzelm@16812
|
355 |
Toplevel.actual_proof (fn prf =>
|
berghofe@15237
|
356 |
if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o
|
berghofe@15237
|
357 |
Toplevel.skip_proof (fn h =>
|
berghofe@15237
|
358 |
if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h);
|
wenzelm@6686
|
359 |
|
wenzelm@7936
|
360 |
fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist =>
|
wenzelm@18588
|
361 |
if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF
|
wenzelm@18588
|
362 |
else (f (); History.undo hist));
|
wenzelm@7936
|
363 |
|
wenzelm@7936
|
364 |
val kill_proof = kill_proof_notify (K ());
|
wenzelm@6686
|
365 |
|
wenzelm@6742
|
366 |
val undo_theory = Toplevel.history (fn hist =>
|
wenzelm@6742
|
367 |
if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist);
|
wenzelm@6686
|
368 |
|
wenzelm@23500
|
369 |
val undo = Toplevel.kill o undo_theory o Toplevel.undo_exit o undos_proof 1;
|
wenzelm@21955
|
370 |
|
wenzelm@21955
|
371 |
fun cannot_undo "end" = undo (*ProofGeneral legacy*)
|
wenzelm@21955
|
372 |
| cannot_undo txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt));
|
wenzelm@21955
|
373 |
|
wenzelm@21003
|
374 |
val kill = Toplevel.kill o kill_proof;
|
wenzelm@17899
|
375 |
|
wenzelm@17899
|
376 |
val back =
|
wenzelm@17899
|
377 |
Toplevel.actual_proof ProofHistory.back o
|
wenzelm@17899
|
378 |
Toplevel.skip_proof (History.apply I);
|
wenzelm@9273
|
379 |
|
wenzelm@6686
|
380 |
|
wenzelm@5831
|
381 |
(* use ML text *)
|
wenzelm@5831
|
382 |
|
wenzelm@16045
|
383 |
fun use path = Toplevel.keep (fn state =>
|
wenzelm@22116
|
384 |
ML_Context.setmp (try Toplevel.generic_theory_of state) (ThyInfo.load_file false) path);
|
wenzelm@5831
|
385 |
|
wenzelm@5831
|
386 |
(*passes changes of theory context*)
|
wenzelm@26385
|
387 |
fun use_mltext_theory (txt, pos) =
|
wenzelm@26385
|
388 |
Toplevel.theory' (fn int => Context.theory_map (ML_Context.use_mltext_update int pos txt));
|
wenzelm@5831
|
389 |
|
wenzelm@5831
|
390 |
(*ignore result theory context*)
|
wenzelm@26385
|
391 |
fun use_mltext verbose (txt, pos) = Toplevel.keep' (fn int => fn state =>
|
wenzelm@26385
|
392 |
(ML_Context.use_mltext (verbose andalso int) pos txt (try Toplevel.generic_theory_of state)));
|
wenzelm@5831
|
393 |
|
wenzelm@20927
|
394 |
val use_commit = Toplevel.imperative Secure.commit;
|
wenzelm@5831
|
395 |
|
wenzelm@5831
|
396 |
|
wenzelm@25793
|
397 |
(* nested commands *)
|
wenzelm@25793
|
398 |
|
wenzelm@25793
|
399 |
fun nested_command props (str, pos) =
|
wenzelm@26053
|
400 |
let val pos' = Position.of_properties (props |> Position.default_properties pos) in
|
wenzelm@25793
|
401 |
(case OuterSyntax.parse pos' str of
|
wenzelm@25956
|
402 |
[transition] => transition
|
wenzelm@25793
|
403 |
| _ => error "exactly one command expected")
|
wenzelm@25793
|
404 |
end;
|
wenzelm@25793
|
405 |
|
wenzelm@25793
|
406 |
|
wenzelm@5831
|
407 |
(* current working directory *)
|
wenzelm@5831
|
408 |
|
wenzelm@14950
|
409 |
fun cd path = Toplevel.imperative (fn () => (File.cd path));
|
wenzelm@21858
|
410 |
val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
|
wenzelm@5831
|
411 |
|
wenzelm@5831
|
412 |
|
wenzelm@5831
|
413 |
(* load theory files *)
|
wenzelm@5831
|
414 |
|
wenzelm@22116
|
415 |
fun use_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy name);
|
wenzelm@7124
|
416 |
|
wenzelm@7124
|
417 |
|
wenzelm@14934
|
418 |
(* present draft files *)
|
wenzelm@14934
|
419 |
|
wenzelm@14934
|
420 |
fun display_drafts files = Toplevel.imperative (fn () =>
|
wenzelm@16258
|
421 |
let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
|
wenzelm@16258
|
422 |
in File.isatool ("display -c " ^ outfile ^ " &"); () end);
|
wenzelm@14934
|
423 |
|
wenzelm@14934
|
424 |
fun print_drafts files = Toplevel.imperative (fn () =>
|
wenzelm@16258
|
425 |
let val outfile = File.shell_path (Present.drafts "ps" files)
|
wenzelm@16258
|
426 |
in File.isatool ("print -c " ^ outfile); () end);
|
wenzelm@14934
|
427 |
|
wenzelm@14934
|
428 |
|
wenzelm@7124
|
429 |
(* pretty_setmargin *)
|
wenzelm@7124
|
430 |
|
wenzelm@7124
|
431 |
fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
|
wenzelm@5831
|
432 |
|
wenzelm@5831
|
433 |
|
wenzelm@9513
|
434 |
(* print parts of theory and proof context *)
|
wenzelm@5831
|
435 |
|
wenzelm@7308
|
436 |
val print_context = Toplevel.keep Toplevel.print_state_context;
|
wenzelm@9513
|
437 |
|
wenzelm@20621
|
438 |
fun print_theory verbose = Toplevel.unknown_theory o
|
wenzelm@22872
|
439 |
Toplevel.keep (Pretty.writeln o ProofDisplay.pretty_full_theory verbose o Toplevel.theory_of);
|
wenzelm@9513
|
440 |
|
wenzelm@21663
|
441 |
val print_syntax = Toplevel.unknown_context o
|
wenzelm@21663
|
442 |
Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
|
wenzelm@9513
|
443 |
|
wenzelm@21725
|
444 |
val print_abbrevs = Toplevel.unknown_context o
|
wenzelm@21725
|
445 |
Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
|
wenzelm@21725
|
446 |
|
wenzelm@21003
|
447 |
val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
|
wenzelm@21003
|
448 |
ProofContext.setmp_verbose
|
wenzelm@21506
|
449 |
ProofContext.print_lthms (Toplevel.context_of state));
|
wenzelm@21003
|
450 |
|
wenzelm@24115
|
451 |
val print_configs = Toplevel.unknown_context o Toplevel.keep (fn state =>
|
wenzelm@24115
|
452 |
Attrib.print_configs (Toplevel.context_of state));
|
wenzelm@23989
|
453 |
|
wenzelm@17066
|
454 |
val print_theorems_proof = Toplevel.keep (fn state =>
|
wenzelm@17066
|
455 |
ProofContext.setmp_verbose
|
wenzelm@17066
|
456 |
ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
|
wenzelm@17066
|
457 |
|
wenzelm@18588
|
458 |
val print_theorems_theory = Toplevel.keep (fn state =>
|
wenzelm@18588
|
459 |
Toplevel.theory_of state |>
|
wenzelm@18588
|
460 |
(case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
|
wenzelm@20957
|
461 |
SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy)
|
wenzelm@19430
|
462 |
| _ => ProofDisplay.print_theorems));
|
wenzelm@18588
|
463 |
|
wenzelm@21663
|
464 |
val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
|
wenzelm@9513
|
465 |
|
wenzelm@12060
|
466 |
val print_locales = Toplevel.unknown_theory o
|
wenzelm@12060
|
467 |
Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
|
wenzelm@12060
|
468 |
|
wenzelm@22573
|
469 |
fun print_locale (show_facts, (imports, body)) = Toplevel.unknown_theory o
|
wenzelm@19385
|
470 |
Toplevel.keep (fn state =>
|
wenzelm@22573
|
471 |
Locale.print_locale (Toplevel.theory_of state) show_facts imports body);
|
ballarin@15596
|
472 |
|
ballarin@17139
|
473 |
fun print_registrations show_wits name = Toplevel.unknown_context o
|
wenzelm@20957
|
474 |
Toplevel.keep (Toplevel.node_case
|
ballarin@24789
|
475 |
(Context.cases (Locale.print_registrations show_wits name o ProofContext.init)
|
ballarin@24789
|
476 |
(Locale.print_registrations show_wits name))
|
ballarin@24789
|
477 |
(Locale.print_registrations show_wits name o Proof.context_of));
|
wenzelm@12060
|
478 |
|
wenzelm@9513
|
479 |
val print_attributes = Toplevel.unknown_theory o
|
wenzelm@9513
|
480 |
Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
|
wenzelm@9513
|
481 |
|
wenzelm@16026
|
482 |
val print_simpset = Toplevel.unknown_context o
|
wenzelm@20957
|
483 |
Toplevel.keep (Toplevel.node_case
|
wenzelm@20957
|
484 |
(Context.cases Simplifier.print_simpset Simplifier.print_local_simpset)
|
wenzelm@16026
|
485 |
(Simplifier.print_local_simpset o Proof.context_of));
|
wenzelm@16026
|
486 |
|
wenzelm@12382
|
487 |
val print_rules = Toplevel.unknown_context o
|
wenzelm@18639
|
488 |
Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
|
wenzelm@12382
|
489 |
|
wenzelm@9513
|
490 |
val print_trans_rules = Toplevel.unknown_context o
|
wenzelm@18639
|
491 |
Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
|
wenzelm@9513
|
492 |
|
wenzelm@9513
|
493 |
val print_methods = Toplevel.unknown_theory o
|
wenzelm@9513
|
494 |
Toplevel.keep (Method.print_methods o Toplevel.theory_of);
|
wenzelm@9513
|
495 |
|
wenzelm@22116
|
496 |
val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations;
|
wenzelm@5831
|
497 |
|
haftmann@22485
|
498 |
val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
|
haftmann@22485
|
499 |
let
|
haftmann@22485
|
500 |
val thy = Toplevel.theory_of state;
|
wenzelm@24560
|
501 |
val all_thys = sort ThyInfo.thy_ord (thy :: Theory.ancestors_of thy);
|
wenzelm@22604
|
502 |
val gr = all_thys |> map (fn node =>
|
wenzelm@22602
|
503 |
let
|
wenzelm@22602
|
504 |
val name = Context.theory_name node;
|
wenzelm@22602
|
505 |
val parents = map Context.theory_name (Theory.parents_of node);
|
wenzelm@24560
|
506 |
val dir = Present.session_name node;
|
wenzelm@24560
|
507 |
val unfold = not (ThyInfo.known_thy name andalso ThyInfo.is_finished name);
|
wenzelm@24560
|
508 |
in {name = name, ID = name, parents = parents, dir = dir, unfold = unfold, path = ""} end);
|
wenzelm@22602
|
509 |
in Present.display_graph gr end);
|
haftmann@22485
|
510 |
|
wenzelm@20574
|
511 |
val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
|
wenzelm@20574
|
512 |
let
|
wenzelm@20574
|
513 |
val thy = Toplevel.theory_of state;
|
wenzelm@20574
|
514 |
val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
|
wenzelm@20574
|
515 |
val {classes, ...} = Sorts.rep_algebra algebra;
|
wenzelm@20574
|
516 |
fun entry (c, (i, (_, cs))) =
|
wenzelm@20574
|
517 |
(i, {name = NameSpace.extern space c, ID = c, parents = cs,
|
wenzelm@20574
|
518 |
dir = "", unfold = true, path = ""});
|
wenzelm@20574
|
519 |
val gr =
|
wenzelm@20574
|
520 |
Graph.fold (cons o entry) classes []
|
wenzelm@20574
|
521 |
|> sort (int_ord o pairself #1) |> map #2;
|
wenzelm@20574
|
522 |
in Present.display_graph gr end);
|
wenzelm@20574
|
523 |
|
kleing@15964
|
524 |
|
wenzelm@16026
|
525 |
(* retrieve theorems *)
|
wenzelm@7615
|
526 |
|
wenzelm@9513
|
527 |
fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
|
wenzelm@21003
|
528 |
ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
|
wenzelm@9454
|
529 |
|
wenzelm@24560
|
530 |
fun find_theorems ((opt_lim, rem_dups), spec) =
|
kleing@22340
|
531 |
Toplevel.unknown_theory o Toplevel.keep (fn state =>
|
wenzelm@16026
|
532 |
let
|
wenzelm@21003
|
533 |
val proof_state = Toplevel.enter_proof_body state;
|
wenzelm@16026
|
534 |
val ctxt = Proof.context_of proof_state;
|
wenzelm@16026
|
535 |
val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
|
kleing@22340
|
536 |
in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end);
|
wenzelm@16026
|
537 |
|
wenzelm@5831
|
538 |
|
berghofe@26184
|
539 |
(* find unused theorems *)
|
berghofe@26184
|
540 |
|
wenzelm@26186
|
541 |
fun unused_thms opt_range = Toplevel.keep (fn state =>
|
wenzelm@26186
|
542 |
let
|
wenzelm@26186
|
543 |
val thy = Toplevel.theory_of state;
|
wenzelm@26186
|
544 |
val ctxt = Toplevel.context_of state;
|
wenzelm@26186
|
545 |
fun pretty_thm (a, th) = ProofContext.pretty_fact ctxt (a, [th]);
|
wenzelm@26186
|
546 |
in
|
wenzelm@26186
|
547 |
ThmDeps.unused_thms
|
wenzelm@26186
|
548 |
(case opt_range of
|
wenzelm@26186
|
549 |
NONE => (NONE, [thy])
|
wenzelm@26186
|
550 |
| SOME (xs, NONE) => (SOME (map ThyInfo.get_theory xs), [thy])
|
wenzelm@26186
|
551 |
| SOME (xs, SOME ys) => (SOME (map ThyInfo.get_theory xs), map ThyInfo.get_theory ys))
|
wenzelm@26186
|
552 |
|> map pretty_thm |> Pretty.chunks |> Pretty.writeln
|
wenzelm@26186
|
553 |
end);
|
berghofe@26184
|
554 |
|
berghofe@26184
|
555 |
|
wenzelm@5831
|
556 |
(* print proof context contents *)
|
wenzelm@5831
|
557 |
|
wenzelm@21663
|
558 |
val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
|
wenzelm@21663
|
559 |
ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
|
wenzelm@9513
|
560 |
|
wenzelm@21663
|
561 |
val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
|
wenzelm@21663
|
562 |
ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
|
wenzelm@5831
|
563 |
|
wenzelm@5831
|
564 |
|
wenzelm@19268
|
565 |
(* print theorems, terms, types etc. *)
|
wenzelm@19268
|
566 |
|
wenzelm@19385
|
567 |
local
|
wenzelm@19385
|
568 |
|
wenzelm@19385
|
569 |
fun string_of_stmts state args =
|
wenzelm@19268
|
570 |
Proof.get_thmss state args
|
wenzelm@21437
|
571 |
|> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
|
wenzelm@19385
|
572 |
|> Pretty.chunks2 |> Pretty.string_of;
|
wenzelm@5831
|
573 |
|
wenzelm@19385
|
574 |
fun string_of_thms state args =
|
wenzelm@12055
|
575 |
Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
|
wenzelm@19385
|
576 |
(Proof.get_thmss state args));
|
wenzelm@5880
|
577 |
|
wenzelm@19385
|
578 |
fun string_of_prfs full state arg =
|
wenzelm@17066
|
579 |
Pretty.string_of (case arg of
|
skalberg@15531
|
580 |
NONE =>
|
berghofe@12125
|
581 |
let
|
wenzelm@17066
|
582 |
val (ctxt, (_, thm)) = Proof.get_goal state;
|
wenzelm@17066
|
583 |
val {thy, der = (_, prf), ...} = Thm.rep_thm thm;
|
wenzelm@17066
|
584 |
val prop = Thm.full_prop_of thm;
|
berghofe@12125
|
585 |
val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
|
berghofe@12125
|
586 |
in
|
wenzelm@17066
|
587 |
ProofContext.pretty_proof ctxt
|
wenzelm@17066
|
588 |
(if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
|
berghofe@12125
|
589 |
end
|
skalberg@15531
|
590 |
| SOME args => Pretty.chunks
|
wenzelm@17066
|
591 |
(map (ProofContext.pretty_proof_of (Proof.context_of state) full)
|
wenzelm@19385
|
592 |
(Proof.get_thmss state args)));
|
berghofe@11524
|
593 |
|
wenzelm@19385
|
594 |
fun string_of_prop state s =
|
wenzelm@5831
|
595 |
let
|
wenzelm@12055
|
596 |
val ctxt = Proof.context_of state;
|
wenzelm@24508
|
597 |
val prop = Syntax.read_prop ctxt s;
|
wenzelm@24920
|
598 |
in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt prop)) end;
|
wenzelm@5831
|
599 |
|
wenzelm@19385
|
600 |
fun string_of_term state s =
|
wenzelm@5831
|
601 |
let
|
wenzelm@12055
|
602 |
val ctxt = Proof.context_of state;
|
wenzelm@24508
|
603 |
val t = Syntax.read_term ctxt s;
|
wenzelm@5831
|
604 |
val T = Term.type_of t;
|
wenzelm@5831
|
605 |
in
|
wenzelm@19385
|
606 |
Pretty.string_of
|
wenzelm@24920
|
607 |
(Pretty.block [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.fbrk,
|
wenzelm@24920
|
608 |
Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt T)])
|
wenzelm@9128
|
609 |
end;
|
wenzelm@5831
|
610 |
|
wenzelm@19385
|
611 |
fun string_of_type state s =
|
wenzelm@5831
|
612 |
let
|
wenzelm@12055
|
613 |
val ctxt = Proof.context_of state;
|
wenzelm@25331
|
614 |
val T = Syntax.read_typ ctxt s;
|
wenzelm@24920
|
615 |
in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end;
|
wenzelm@9128
|
616 |
|
wenzelm@23935
|
617 |
fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
|
wenzelm@23935
|
618 |
PrintMode.with_modes modes (fn () =>
|
wenzelm@23935
|
619 |
writeln (string_of (Toplevel.enter_proof_body state) arg)) ());
|
wenzelm@19385
|
620 |
|
wenzelm@19385
|
621 |
in
|
wenzelm@9128
|
622 |
|
wenzelm@19268
|
623 |
val print_stmts = print_item string_of_stmts;
|
wenzelm@12876
|
624 |
val print_thms = print_item string_of_thms;
|
wenzelm@19385
|
625 |
val print_prfs = print_item o string_of_prfs;
|
wenzelm@12876
|
626 |
val print_prop = print_item string_of_prop;
|
wenzelm@12876
|
627 |
val print_term = print_item string_of_term;
|
wenzelm@12876
|
628 |
val print_type = print_item string_of_type;
|
wenzelm@5831
|
629 |
|
wenzelm@19385
|
630 |
end;
|
wenzelm@19385
|
631 |
|
wenzelm@12938
|
632 |
|
wenzelm@12938
|
633 |
(* markup commands *)
|
wenzelm@12938
|
634 |
|
wenzelm@12938
|
635 |
fun add_header s = Toplevel.keep' (fn int => fn state =>
|
wenzelm@21858
|
636 |
(if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF;
|
wenzelm@19057
|
637 |
if int then OuterSyntax.check_text s NONE else ()));
|
wenzelm@12938
|
638 |
|
wenzelm@12953
|
639 |
local
|
wenzelm@12953
|
640 |
|
wenzelm@19057
|
641 |
fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
|
wenzelm@19057
|
642 |
| present f (s, _) false node =
|
wenzelm@22116
|
643 |
ML_Context.setmp (try (Toplevel.cases_node I (Context.Proof o Proof.context_of)) node) f s;
|
wenzelm@12938
|
644 |
|
wenzelm@19057
|
645 |
fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
|
wenzelm@19057
|
646 |
fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
|
wenzelm@12953
|
647 |
|
wenzelm@12953
|
648 |
in
|
wenzelm@12953
|
649 |
|
wenzelm@19057
|
650 |
val add_chapter = present_local_theory Present.section;
|
wenzelm@19057
|
651 |
val add_section = present_local_theory Present.section;
|
wenzelm@19057
|
652 |
val add_subsection = present_local_theory Present.subsection;
|
wenzelm@19057
|
653 |
val add_subsubsection = present_local_theory Present.subsubsection;
|
wenzelm@19057
|
654 |
val add_text = present_local_theory (K ());
|
wenzelm@19057
|
655 |
fun add_text_raw txt = present_local_theory (K ()) (NONE, txt);
|
wenzelm@19057
|
656 |
val add_txt = present_proof (K ());
|
wenzelm@19057
|
657 |
val add_txt_raw = add_txt;
|
wenzelm@19057
|
658 |
val add_sect = add_txt;
|
wenzelm@19057
|
659 |
val add_subsect = add_txt;
|
wenzelm@19057
|
660 |
val add_subsubsect = add_txt;
|
wenzelm@12938
|
661 |
|
wenzelm@5831
|
662 |
end;
|
wenzelm@12953
|
663 |
|
wenzelm@12953
|
664 |
end;
|