wenzelm@5819
|
1 |
(* Title: Pure/Isar/proof_context.ML
|
wenzelm@5819
|
2 |
Author: Markus Wenzel, TU Muenchen
|
wenzelm@5819
|
3 |
|
wenzelm@19001
|
4 |
The key concept of Isar proof contexts: elevates primitive local
|
wenzelm@19001
|
5 |
reasoning Gamma |- phi to a structured concept, with generic context
|
wenzelm@20234
|
6 |
elements. See also structure Variable and Assumption.
|
wenzelm@5819
|
7 |
*)
|
wenzelm@5819
|
8 |
|
wenzelm@5819
|
9 |
signature PROOF_CONTEXT =
|
wenzelm@5819
|
10 |
sig
|
wenzelm@20310
|
11 |
val theory_of: Proof.context -> theory
|
wenzelm@36633
|
12 |
val init_global: theory -> Proof.context
|
wenzelm@24388
|
13 |
type mode
|
wenzelm@24501
|
14 |
val mode_default: mode
|
wenzelm@24501
|
15 |
val mode_stmt: mode
|
wenzelm@24501
|
16 |
val mode_pattern: mode
|
wenzelm@24501
|
17 |
val mode_schematic: mode
|
wenzelm@24501
|
18 |
val mode_abbrev: mode
|
wenzelm@24388
|
19 |
val set_mode: mode -> Proof.context -> Proof.context
|
wenzelm@24388
|
20 |
val get_mode: Proof.context -> mode
|
wenzelm@24388
|
21 |
val restore_mode: Proof.context -> Proof.context -> Proof.context
|
wenzelm@27286
|
22 |
val abbrev_mode: Proof.context -> bool
|
wenzelm@21667
|
23 |
val set_stmt: bool -> Proof.context -> Proof.context
|
wenzelm@33165
|
24 |
val local_naming: Name_Space.naming
|
wenzelm@33165
|
25 |
val map_naming: (Name_Space.naming -> Name_Space.naming) -> Proof.context -> Proof.context
|
wenzelm@33100
|
26 |
val naming_of: Proof.context -> Name_Space.naming
|
wenzelm@33165
|
27 |
val restore_naming: Proof.context -> Proof.context -> Proof.context
|
haftmann@29581
|
28 |
val full_name: Proof.context -> binding -> string
|
wenzelm@43116
|
29 |
val syntax_of: Proof.context -> Local_Syntax.T
|
wenzelm@35114
|
30 |
val syn_of: Proof.context -> Syntax.syntax
|
wenzelm@35676
|
31 |
val tsig_of: Proof.context -> Type.tsig
|
wenzelm@36451
|
32 |
val set_defsort: sort -> Proof.context -> Proof.context
|
wenzelm@35680
|
33 |
val default_sort: Proof.context -> indexname -> sort
|
wenzelm@20310
|
34 |
val consts_of: Proof.context -> Consts.T
|
haftmann@24752
|
35 |
val the_const_constraint: Proof.context -> string -> typ
|
wenzelm@20784
|
36 |
val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context
|
wenzelm@20310
|
37 |
val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
|
wenzelm@26284
|
38 |
val facts_of: Proof.context -> Facts.T
|
blanchet@34969
|
39 |
val cases_of: Proof.context -> (string * (Rule_Cases.T * bool)) list
|
wenzelm@43230
|
40 |
val class_space: Proof.context -> Name_Space.T
|
wenzelm@43230
|
41 |
val type_space: Proof.context -> Name_Space.T
|
wenzelm@43230
|
42 |
val const_space: Proof.context -> Name_Space.T
|
wenzelm@43230
|
43 |
val intern_class: Proof.context -> xstring -> string
|
wenzelm@43230
|
44 |
val intern_type: Proof.context -> xstring -> string
|
wenzelm@43230
|
45 |
val intern_const: Proof.context -> xstring -> string
|
wenzelm@43230
|
46 |
val extern_class: Proof.context -> string -> xstring
|
wenzelm@43230
|
47 |
val extern_type: Proof.context -> string -> xstring
|
wenzelm@43230
|
48 |
val extern_const: Proof.context -> string -> xstring
|
wenzelm@27259
|
49 |
val transfer_syntax: theory -> Proof.context -> Proof.context
|
wenzelm@20310
|
50 |
val transfer: theory -> Proof.context -> Proof.context
|
wenzelm@39031
|
51 |
val background_theory: (theory -> theory) -> Proof.context -> Proof.context
|
wenzelm@39031
|
52 |
val background_theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
|
wenzelm@28212
|
53 |
val extern_fact: Proof.context -> string -> xstring
|
wenzelm@21728
|
54 |
val pretty_term_abbrev: Proof.context -> term -> Pretty.T
|
wenzelm@30726
|
55 |
val pretty_fact_aux: Proof.context -> bool -> string * thm list -> Pretty.T
|
wenzelm@20310
|
56 |
val pretty_fact: Proof.context -> string * thm list -> Pretty.T
|
wenzelm@35676
|
57 |
val read_class: Proof.context -> xstring -> class
|
wenzelm@35676
|
58 |
val read_arity: Proof.context -> xstring * string list * string -> arity
|
wenzelm@35676
|
59 |
val cert_arity: Proof.context -> arity -> arity
|
wenzelm@20310
|
60 |
val read_typ: Proof.context -> string -> typ
|
wenzelm@20310
|
61 |
val read_typ_syntax: Proof.context -> string -> typ
|
wenzelm@20310
|
62 |
val read_typ_abbrev: Proof.context -> string -> typ
|
wenzelm@20310
|
63 |
val cert_typ: Proof.context -> typ -> typ
|
wenzelm@20310
|
64 |
val cert_typ_syntax: Proof.context -> typ -> typ
|
wenzelm@20310
|
65 |
val cert_typ_abbrev: Proof.context -> typ -> typ
|
wenzelm@36521
|
66 |
val infer_type: Proof.context -> string * typ -> typ
|
wenzelm@28082
|
67 |
val inferred_param: string -> Proof.context -> typ * Proof.context
|
wenzelm@25328
|
68 |
val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
|
wenzelm@35360
|
69 |
val read_type_name: Proof.context -> bool -> string -> typ
|
wenzelm@35676
|
70 |
val read_type_name_proper: Proof.context -> bool -> string -> typ
|
wenzelm@35399
|
71 |
val read_const_proper: Proof.context -> bool -> string -> term
|
wenzelm@36521
|
72 |
val read_const: Proof.context -> bool -> typ -> string -> term
|
wenzelm@27259
|
73 |
val allow_dummies: Proof.context -> Proof.context
|
wenzelm@43125
|
74 |
val get_sort: Proof.context -> (indexname * sort) list -> indexname -> sort
|
wenzelm@36153
|
75 |
val check_tvar: Proof.context -> indexname * sort -> indexname * sort
|
wenzelm@36153
|
76 |
val check_tfree: Proof.context -> string * sort -> string * sort
|
wenzelm@43125
|
77 |
val intern_skolem: Proof.context -> string -> string option
|
wenzelm@24684
|
78 |
val read_term_pattern: Proof.context -> string -> term
|
wenzelm@24684
|
79 |
val read_term_schematic: Proof.context -> string -> term
|
wenzelm@24684
|
80 |
val read_term_abbrev: Proof.context -> string -> term
|
wenzelm@41137
|
81 |
val show_abbrevs_raw: Config.raw
|
wenzelm@41137
|
82 |
val show_abbrevs: bool Config.T
|
wenzelm@25345
|
83 |
val expand_abbrevs: Proof.context -> term -> term
|
wenzelm@20310
|
84 |
val cert_term: Proof.context -> term -> term
|
wenzelm@20310
|
85 |
val cert_prop: Proof.context -> term -> term
|
wenzelm@35616
|
86 |
val def_type: Proof.context -> indexname -> typ option
|
wenzelm@20310
|
87 |
val goal_export: Proof.context -> Proof.context -> thm list -> thm list
|
wenzelm@20310
|
88 |
val export: Proof.context -> Proof.context -> thm list -> thm list
|
wenzelm@21531
|
89 |
val export_morphism: Proof.context -> Proof.context -> morphism
|
wenzelm@28396
|
90 |
val norm_export_morphism: Proof.context -> Proof.context -> morphism
|
wenzelm@30764
|
91 |
val bind_terms: (indexname * term option) list -> Proof.context -> Proof.context
|
wenzelm@20310
|
92 |
val auto_bind_goal: term list -> Proof.context -> Proof.context
|
wenzelm@20310
|
93 |
val auto_bind_facts: term list -> Proof.context -> Proof.context
|
wenzelm@20310
|
94 |
val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
|
wenzelm@20310
|
95 |
val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
|
wenzelm@20310
|
96 |
val read_propp: Proof.context * (string * string list) list list
|
wenzelm@20310
|
97 |
-> Proof.context * (term * term list) list list
|
wenzelm@20310
|
98 |
val cert_propp: Proof.context * (term * term list) list list
|
wenzelm@20310
|
99 |
-> Proof.context * (term * term list) list list
|
wenzelm@20310
|
100 |
val read_propp_schematic: Proof.context * (string * string list) list list
|
wenzelm@20310
|
101 |
-> Proof.context * (term * term list) list list
|
wenzelm@20310
|
102 |
val cert_propp_schematic: Proof.context * (term * term list) list list
|
wenzelm@20310
|
103 |
-> Proof.context * (term * term list) list list
|
wenzelm@20310
|
104 |
val bind_propp: Proof.context * (string * string list) list list
|
wenzelm@20310
|
105 |
-> Proof.context * (term list list * (Proof.context -> Proof.context))
|
wenzelm@20310
|
106 |
val bind_propp_i: Proof.context * (term * term list) list list
|
wenzelm@20310
|
107 |
-> Proof.context * (term list list * (Proof.context -> Proof.context))
|
wenzelm@20310
|
108 |
val bind_propp_schematic: Proof.context * (string * string list) list list
|
wenzelm@20310
|
109 |
-> Proof.context * (term list list * (Proof.context -> Proof.context))
|
wenzelm@20310
|
110 |
val bind_propp_schematic_i: Proof.context * (term * term list) list list
|
wenzelm@20310
|
111 |
-> Proof.context * (term list list * (Proof.context -> Proof.context))
|
wenzelm@18042
|
112 |
val fact_tac: thm list -> int -> tactic
|
wenzelm@20310
|
113 |
val some_fact_tac: Proof.context -> int -> tactic
|
wenzelm@26346
|
114 |
val get_fact: Proof.context -> Facts.ref -> thm list
|
wenzelm@26346
|
115 |
val get_fact_single: Proof.context -> Facts.ref -> thm
|
wenzelm@26346
|
116 |
val get_thms: Proof.context -> xstring -> thm list
|
wenzelm@26346
|
117 |
val get_thm: Proof.context -> xstring -> thm
|
wenzelm@30768
|
118 |
val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list ->
|
wenzelm@30215
|
119 |
Proof.context -> (string * thm list) list * Proof.context
|
wenzelm@26250
|
120 |
val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
|
haftmann@29581
|
121 |
val read_vars: (binding * string option * mixfix) list -> Proof.context ->
|
haftmann@29581
|
122 |
(binding * typ option * mixfix) list * Proof.context
|
haftmann@29581
|
123 |
val cert_vars: (binding * typ option * mixfix) list -> Proof.context ->
|
haftmann@29581
|
124 |
(binding * typ option * mixfix) list * Proof.context
|
wenzelm@30770
|
125 |
val add_fixes: (binding * typ option * mixfix) list -> Proof.context ->
|
wenzelm@30770
|
126 |
string list * Proof.context
|
wenzelm@20310
|
127 |
val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
|
wenzelm@20310
|
128 |
val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
|
wenzelm@20234
|
129 |
val add_assms: Assumption.export ->
|
wenzelm@30215
|
130 |
(Thm.binding * (string * string list) list) list ->
|
wenzelm@28082
|
131 |
Proof.context -> (string * thm list) list * Proof.context
|
wenzelm@20234
|
132 |
val add_assms_i: Assumption.export ->
|
wenzelm@30215
|
133 |
(Thm.binding * (term * term list) list) list ->
|
wenzelm@28082
|
134 |
Proof.context -> (string * thm list) list * Proof.context
|
wenzelm@33368
|
135 |
val add_cases: bool -> (string * Rule_Cases.T option) list -> Proof.context -> Proof.context
|
wenzelm@33368
|
136 |
val apply_case: Rule_Cases.T -> Proof.context -> (string * term list) list * Proof.context
|
wenzelm@33368
|
137 |
val get_case: Proof.context -> string -> string option list -> Rule_Cases.T
|
wenzelm@35417
|
138 |
val type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> Proof.context -> Proof.context
|
wenzelm@24949
|
139 |
val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
|
wenzelm@35417
|
140 |
val target_type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> morphism ->
|
wenzelm@35417
|
141 |
Context.generic -> Context.generic
|
wenzelm@24949
|
142 |
val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
|
wenzelm@21744
|
143 |
Context.generic -> Context.generic
|
wenzelm@35680
|
144 |
val class_alias: binding -> class -> Proof.context -> Proof.context
|
wenzelm@35680
|
145 |
val type_alias: binding -> string -> Proof.context -> Proof.context
|
wenzelm@35680
|
146 |
val const_alias: binding -> string -> Proof.context -> Proof.context
|
wenzelm@24767
|
147 |
val add_const_constraint: string * typ option -> Proof.context -> Proof.context
|
wenzelm@33173
|
148 |
val add_abbrev: string -> binding * term -> Proof.context -> (term * term) * Proof.context
|
wenzelm@25052
|
149 |
val revert_abbrev: string -> string -> Proof.context -> Proof.context
|
wenzelm@20310
|
150 |
val print_syntax: Proof.context -> unit
|
wenzelm@21728
|
151 |
val print_abbrevs: Proof.context -> unit
|
wenzelm@20310
|
152 |
val print_binds: Proof.context -> unit
|
wenzelm@20310
|
153 |
val print_lthms: Proof.context -> unit
|
wenzelm@20310
|
154 |
val print_cases: Proof.context -> unit
|
wenzelm@32738
|
155 |
val debug: bool Unsynchronized.ref
|
wenzelm@35146
|
156 |
val verbose: bool Unsynchronized.ref
|
wenzelm@20310
|
157 |
val pretty_ctxt: Proof.context -> Pretty.T list
|
wenzelm@20310
|
158 |
val pretty_context: Proof.context -> Pretty.T list
|
wenzelm@5819
|
159 |
end;
|
wenzelm@5819
|
160 |
|
wenzelm@43231
|
161 |
structure Proof_Context: PROOF_CONTEXT =
|
wenzelm@5819
|
162 |
struct
|
wenzelm@5819
|
163 |
|
wenzelm@43234
|
164 |
val theory_of = Proof_Context.theory_of;
|
wenzelm@43234
|
165 |
val init_global = Proof_Context.init_global;
|
wenzelm@43234
|
166 |
|
wenzelm@16540
|
167 |
|
wenzelm@16540
|
168 |
|
wenzelm@24388
|
169 |
(** inner syntax mode **)
|
wenzelm@24388
|
170 |
|
wenzelm@24388
|
171 |
datatype mode =
|
wenzelm@24388
|
172 |
Mode of
|
wenzelm@24486
|
173 |
{stmt: bool, (*inner statement mode*)
|
wenzelm@24388
|
174 |
pattern: bool, (*pattern binding schematic variables*)
|
wenzelm@24388
|
175 |
schematic: bool, (*term referencing loose schematic variables*)
|
wenzelm@24388
|
176 |
abbrev: bool}; (*abbrev mode -- no normalization*)
|
wenzelm@24388
|
177 |
|
wenzelm@24486
|
178 |
fun make_mode (stmt, pattern, schematic, abbrev) =
|
wenzelm@24486
|
179 |
Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
|
wenzelm@24388
|
180 |
|
wenzelm@24486
|
181 |
val mode_default = make_mode (false, false, false, false);
|
wenzelm@24486
|
182 |
val mode_stmt = make_mode (true, false, false, false);
|
wenzelm@24486
|
183 |
val mode_pattern = make_mode (false, true, false, false);
|
wenzelm@24486
|
184 |
val mode_schematic = make_mode (false, false, true, false);
|
wenzelm@24486
|
185 |
val mode_abbrev = make_mode (false, false, false, true);
|
wenzelm@24388
|
186 |
|
wenzelm@24388
|
187 |
|
wenzelm@16540
|
188 |
|
wenzelm@16540
|
189 |
(** Isar proof context information **)
|
wenzelm@5819
|
190 |
|
wenzelm@16540
|
191 |
datatype ctxt =
|
wenzelm@16540
|
192 |
Ctxt of
|
wenzelm@36451
|
193 |
{mode: mode, (*inner syntax mode*)
|
wenzelm@36451
|
194 |
naming: Name_Space.naming, (*local naming conventions*)
|
wenzelm@36451
|
195 |
syntax: Local_Syntax.T, (*local syntax*)
|
wenzelm@36451
|
196 |
tsig: Type.tsig * Type.tsig, (*local/global type signature -- local name space / defsort only*)
|
wenzelm@36451
|
197 |
consts: Consts.T * Consts.T, (*local/global consts -- local name space / abbrevs only*)
|
wenzelm@36451
|
198 |
facts: Facts.T, (*local facts*)
|
wenzelm@33368
|
199 |
cases: (string * (Rule_Cases.T * bool)) list}; (*named case contexts*)
|
wenzelm@5819
|
200 |
|
wenzelm@36450
|
201 |
fun make_ctxt (mode, naming, syntax, tsig, consts, facts, cases) =
|
haftmann@26240
|
202 |
Ctxt {mode = mode, naming = naming, syntax = syntax,
|
wenzelm@36450
|
203 |
tsig = tsig, consts = consts, facts = facts, cases = cases};
|
wenzelm@5819
|
204 |
|
wenzelm@33100
|
205 |
val local_naming = Name_Space.default_naming |> Name_Space.add_path "local";
|
wenzelm@19079
|
206 |
|
wenzelm@37216
|
207 |
structure Data = Proof_Data
|
wenzelm@18672
|
208 |
(
|
wenzelm@16540
|
209 |
type T = ctxt;
|
wenzelm@16540
|
210 |
fun init thy =
|
wenzelm@33387
|
211 |
make_ctxt (mode_default, local_naming, Local_Syntax.init thy,
|
wenzelm@35676
|
212 |
(Sign.tsig_of thy, Sign.tsig_of thy),
|
wenzelm@26284
|
213 |
(Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
|
wenzelm@18672
|
214 |
);
|
wenzelm@10810
|
215 |
|
wenzelm@37216
|
216 |
fun rep_context ctxt = Data.get ctxt |> (fn Ctxt args => args);
|
wenzelm@10810
|
217 |
|
wenzelm@18672
|
218 |
fun map_context f =
|
wenzelm@37216
|
219 |
Data.map (fn Ctxt {mode, naming, syntax, tsig, consts, facts, cases} =>
|
wenzelm@36450
|
220 |
make_ctxt (f (mode, naming, syntax, tsig, consts, facts, cases)));
|
wenzelm@21443
|
221 |
|
wenzelm@36450
|
222 |
fun set_mode mode = map_context (fn (_, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
223 |
(mode, naming, syntax, tsig, consts, facts, cases));
|
wenzelm@24388
|
224 |
|
wenzelm@24388
|
225 |
fun map_mode f =
|
wenzelm@36450
|
226 |
map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
227 |
(make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, tsig, consts, facts, cases));
|
wenzelm@18672
|
228 |
|
wenzelm@19001
|
229 |
fun map_naming f =
|
wenzelm@36450
|
230 |
map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
231 |
(mode, f naming, syntax, tsig, consts, facts, cases));
|
wenzelm@18672
|
232 |
|
wenzelm@19001
|
233 |
fun map_syntax f =
|
wenzelm@36450
|
234 |
map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
235 |
(mode, naming, f syntax, tsig, consts, facts, cases));
|
wenzelm@35676
|
236 |
|
wenzelm@36450
|
237 |
fun map_tsig f =
|
wenzelm@36450
|
238 |
map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
239 |
(mode, naming, syntax, f tsig, consts, facts, cases));
|
wenzelm@18672
|
240 |
|
wenzelm@19001
|
241 |
fun map_consts f =
|
wenzelm@36450
|
242 |
map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
243 |
(mode, naming, syntax, tsig, f consts, facts, cases));
|
wenzelm@18672
|
244 |
|
wenzelm@26284
|
245 |
fun map_facts f =
|
wenzelm@36450
|
246 |
map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
247 |
(mode, naming, syntax, tsig, consts, f facts, cases));
|
wenzelm@18672
|
248 |
|
wenzelm@19001
|
249 |
fun map_cases f =
|
wenzelm@36450
|
250 |
map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
|
wenzelm@36450
|
251 |
(mode, naming, syntax, tsig, consts, facts, f cases));
|
wenzelm@21443
|
252 |
|
wenzelm@24388
|
253 |
val get_mode = #mode o rep_context;
|
wenzelm@28407
|
254 |
val restore_mode = set_mode o get_mode;
|
wenzelm@27286
|
255 |
val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
|
wenzelm@24388
|
256 |
|
wenzelm@24486
|
257 |
fun set_stmt stmt =
|
wenzelm@24486
|
258 |
map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
|
wenzelm@19001
|
259 |
|
wenzelm@19001
|
260 |
val naming_of = #naming o rep_context;
|
wenzelm@33165
|
261 |
val restore_naming = map_naming o K o naming_of
|
wenzelm@33100
|
262 |
val full_name = Name_Space.full_name o naming_of;
|
wenzelm@10810
|
263 |
|
wenzelm@16540
|
264 |
val syntax_of = #syntax o rep_context;
|
wenzelm@33387
|
265 |
val syn_of = Local_Syntax.syn_of o syntax_of;
|
wenzelm@33387
|
266 |
val set_syntax_mode = map_syntax o Local_Syntax.set_mode;
|
wenzelm@33387
|
267 |
val restore_syntax_mode = map_syntax o Local_Syntax.restore_mode o syntax_of;
|
wenzelm@19001
|
268 |
|
wenzelm@36450
|
269 |
val tsig_of = #1 o #tsig o rep_context;
|
wenzelm@36451
|
270 |
val set_defsort = map_tsig o apfst o Type.set_defsort;
|
wenzelm@35680
|
271 |
fun default_sort ctxt = the_default (Type.defaultS (tsig_of ctxt)) o Variable.def_sort ctxt;
|
wenzelm@35676
|
272 |
|
wenzelm@25052
|
273 |
val consts_of = #1 o #consts o rep_context;
|
haftmann@24752
|
274 |
val the_const_constraint = Consts.the_constraint o consts_of;
|
wenzelm@10810
|
275 |
|
wenzelm@26284
|
276 |
val facts_of = #facts o rep_context;
|
wenzelm@16540
|
277 |
val cases_of = #cases o rep_context;
|
wenzelm@10810
|
278 |
|
wenzelm@10810
|
279 |
|
wenzelm@43230
|
280 |
(* name spaces *)
|
wenzelm@43230
|
281 |
|
wenzelm@43230
|
282 |
val class_space = Type.class_space o tsig_of;
|
wenzelm@43230
|
283 |
val type_space = Type.type_space o tsig_of;
|
wenzelm@43230
|
284 |
val const_space = Consts.space_of o consts_of;
|
wenzelm@43230
|
285 |
|
wenzelm@43230
|
286 |
val intern_class = Name_Space.intern o class_space;
|
wenzelm@43230
|
287 |
val intern_type = Name_Space.intern o type_space;
|
wenzelm@43230
|
288 |
val intern_const = Name_Space.intern o const_space;
|
wenzelm@43230
|
289 |
|
wenzelm@43230
|
290 |
fun extern_class ctxt = Name_Space.extern ctxt (class_space ctxt);
|
wenzelm@43230
|
291 |
fun extern_type ctxt = Name_Space.extern ctxt (type_space ctxt);
|
wenzelm@43230
|
292 |
fun extern_const ctxt = Name_Space.extern ctxt (const_space ctxt);
|
wenzelm@43230
|
293 |
|
wenzelm@43230
|
294 |
|
wenzelm@20367
|
295 |
(* theory transfer *)
|
wenzelm@10810
|
296 |
|
wenzelm@35676
|
297 |
fun transfer_syntax thy ctxt = ctxt |>
|
wenzelm@35676
|
298 |
map_syntax (Local_Syntax.rebuild thy) |>
|
wenzelm@36450
|
299 |
map_tsig (fn tsig as (local_tsig, global_tsig) =>
|
wenzelm@35676
|
300 |
let val thy_tsig = Sign.tsig_of thy in
|
wenzelm@36450
|
301 |
if Type.eq_tsig (thy_tsig, global_tsig) then tsig
|
wenzelm@43262
|
302 |
else (Type.merge_tsig ctxt (local_tsig, thy_tsig), thy_tsig)
|
wenzelm@35676
|
303 |
end) |>
|
wenzelm@30425
|
304 |
map_consts (fn consts as (local_consts, global_consts) =>
|
wenzelm@30425
|
305 |
let val thy_consts = Sign.consts_of thy in
|
wenzelm@30425
|
306 |
if Consts.eq_consts (thy_consts, global_consts) then consts
|
wenzelm@30425
|
307 |
else (Consts.merge (local_consts, thy_consts), thy_consts)
|
wenzelm@30425
|
308 |
end);
|
wenzelm@12093
|
309 |
|
wenzelm@33031
|
310 |
fun transfer thy = Context.raw_transfer thy #> transfer_syntax thy;
|
wenzelm@17072
|
311 |
|
wenzelm@39031
|
312 |
fun background_theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
|
wenzelm@20367
|
313 |
|
wenzelm@39031
|
314 |
fun background_theory_result f ctxt =
|
wenzelm@20367
|
315 |
let val (res, thy') = f (theory_of ctxt)
|
wenzelm@20367
|
316 |
in (res, ctxt |> transfer thy') end;
|
wenzelm@19019
|
317 |
|
wenzelm@12093
|
318 |
|
wenzelm@12093
|
319 |
|
wenzelm@14828
|
320 |
(** pretty printing **)
|
wenzelm@14828
|
321 |
|
wenzelm@28212
|
322 |
(* extern *)
|
wenzelm@28212
|
323 |
|
wenzelm@43249
|
324 |
fun which_facts ctxt name =
|
wenzelm@28212
|
325 |
let
|
wenzelm@28212
|
326 |
val local_facts = facts_of ctxt;
|
wenzelm@39814
|
327 |
val global_facts = Global_Theory.facts_of (theory_of ctxt);
|
wenzelm@28212
|
328 |
in
|
wenzelm@28212
|
329 |
if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
|
wenzelm@43249
|
330 |
then local_facts else global_facts
|
wenzelm@28212
|
331 |
end;
|
wenzelm@28212
|
332 |
|
wenzelm@43250
|
333 |
fun markup_fact ctxt name = Name_Space.markup (Facts.space_of (which_facts ctxt name)) name;
|
wenzelm@43249
|
334 |
|
wenzelm@43249
|
335 |
fun extern_fact ctxt name = Facts.extern ctxt (which_facts ctxt name) name;
|
wenzelm@43249
|
336 |
|
wenzelm@28212
|
337 |
|
wenzelm@28212
|
338 |
(* pretty *)
|
wenzelm@28212
|
339 |
|
wenzelm@24922
|
340 |
fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
|
wenzelm@14828
|
341 |
|
wenzelm@43249
|
342 |
fun pretty_fact_name ctxt a =
|
wenzelm@43249
|
343 |
Pretty.block [Pretty.mark_str (markup_fact ctxt a, extern_fact ctxt a), Pretty.str ":"];
|
wenzelm@28209
|
344 |
|
wenzelm@32110
|
345 |
fun pretty_fact_aux ctxt flag ("", ths) =
|
wenzelm@32110
|
346 |
Display.pretty_thms_aux ctxt flag ths
|
wenzelm@30726
|
347 |
| pretty_fact_aux ctxt flag (a, [th]) = Pretty.block
|
wenzelm@32110
|
348 |
[pretty_fact_name ctxt a, Pretty.brk 1, Display.pretty_thm_aux ctxt flag th]
|
wenzelm@30726
|
349 |
| pretty_fact_aux ctxt flag (a, ths) = Pretty.block
|
wenzelm@32110
|
350 |
(Pretty.fbreaks (pretty_fact_name ctxt a :: map (Display.pretty_thm_aux ctxt flag) ths));
|
wenzelm@30726
|
351 |
|
wenzelm@30726
|
352 |
fun pretty_fact ctxt = pretty_fact_aux ctxt true;
|
wenzelm@14828
|
353 |
|
wenzelm@14828
|
354 |
|
wenzelm@14828
|
355 |
|
wenzelm@10810
|
356 |
(** prepare types **)
|
wenzelm@10810
|
357 |
|
wenzelm@35676
|
358 |
(* classes *)
|
wenzelm@35676
|
359 |
|
wenzelm@35676
|
360 |
fun read_class ctxt text =
|
wenzelm@35676
|
361 |
let
|
wenzelm@35676
|
362 |
val tsig = tsig_of ctxt;
|
wenzelm@35676
|
363 |
val (syms, pos) = Syntax.read_token text;
|
wenzelm@35676
|
364 |
val c = Type.cert_class tsig (Type.intern_class tsig (Symbol_Pos.content syms))
|
wenzelm@35676
|
365 |
handle TYPE (msg, _, _) => error (msg ^ Position.str_of pos);
|
wenzelm@39776
|
366 |
val _ = Context_Position.report ctxt pos (Markup.tclass c);
|
wenzelm@43338
|
367 |
val _ = Context_Position.report ctxt pos (Name_Space.markup (Type.class_space tsig) c);
|
wenzelm@35676
|
368 |
in c end;
|
wenzelm@35676
|
369 |
|
wenzelm@35676
|
370 |
|
wenzelm@35676
|
371 |
(* type arities *)
|
wenzelm@35676
|
372 |
|
wenzelm@35676
|
373 |
local
|
wenzelm@35676
|
374 |
|
wenzelm@35676
|
375 |
fun prep_arity prep_tycon prep_sort ctxt (t, Ss, S) =
|
wenzelm@35676
|
376 |
let val arity = (prep_tycon ctxt t, map (prep_sort ctxt) Ss, prep_sort ctxt S)
|
wenzelm@43262
|
377 |
in Type.add_arity ctxt arity (tsig_of ctxt); arity end;
|
wenzelm@35676
|
378 |
|
wenzelm@35676
|
379 |
in
|
wenzelm@35676
|
380 |
|
wenzelm@43230
|
381 |
val read_arity = prep_arity intern_type Syntax.read_sort;
|
wenzelm@35676
|
382 |
val cert_arity = prep_arity (K I) (Type.cert_sort o tsig_of);
|
wenzelm@35676
|
383 |
|
wenzelm@35676
|
384 |
end;
|
wenzelm@35676
|
385 |
|
wenzelm@35676
|
386 |
|
wenzelm@35676
|
387 |
(* types *)
|
wenzelm@24277
|
388 |
|
wenzelm@24277
|
389 |
fun read_typ_mode mode ctxt s =
|
wenzelm@24486
|
390 |
Syntax.read_typ (Type.set_mode mode ctxt) s;
|
wenzelm@24277
|
391 |
|
wenzelm@35676
|
392 |
val read_typ = read_typ_mode Type.mode_default;
|
wenzelm@24277
|
393 |
val read_typ_syntax = read_typ_mode Type.mode_syntax;
|
wenzelm@24277
|
394 |
val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
|
wenzelm@24277
|
395 |
|
wenzelm@24277
|
396 |
|
wenzelm@24277
|
397 |
fun cert_typ_mode mode ctxt T =
|
wenzelm@35676
|
398 |
Type.cert_typ_mode mode (tsig_of ctxt) T
|
wenzelm@24277
|
399 |
handle TYPE (msg, _, _) => error msg;
|
wenzelm@24277
|
400 |
|
wenzelm@35676
|
401 |
val cert_typ = cert_typ_mode Type.mode_default;
|
wenzelm@24277
|
402 |
val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
|
wenzelm@24277
|
403 |
val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
|
wenzelm@24277
|
404 |
|
wenzelm@24277
|
405 |
|
wenzelm@24388
|
406 |
|
wenzelm@24388
|
407 |
(** prepare variables **)
|
wenzelm@24388
|
408 |
|
wenzelm@43360
|
409 |
(* check Skolem constants *)
|
wenzelm@10810
|
410 |
|
wenzelm@18678
|
411 |
fun no_skolem internal x =
|
wenzelm@20086
|
412 |
if can Name.dest_skolem x then
|
wenzelm@18678
|
413 |
error ("Illegal reference to internal Skolem constant: " ^ quote x)
|
wenzelm@20086
|
414 |
else if not internal andalso can Name.dest_internal x then
|
wenzelm@18678
|
415 |
error ("Illegal reference to internal variable: " ^ quote x)
|
wenzelm@10810
|
416 |
else x;
|
wenzelm@10810
|
417 |
|
wenzelm@10810
|
418 |
|
wenzelm@18187
|
419 |
|
wenzelm@10810
|
420 |
(** prepare terms and propositions **)
|
wenzelm@10810
|
421 |
|
wenzelm@25328
|
422 |
(* inferred types of parameters *)
|
wenzelm@25328
|
423 |
|
wenzelm@25328
|
424 |
fun infer_type ctxt x =
|
wenzelm@36521
|
425 |
Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt)) (Free x));
|
wenzelm@25328
|
426 |
|
wenzelm@25328
|
427 |
fun inferred_param x ctxt =
|
wenzelm@36521
|
428 |
let val T = infer_type ctxt (x, dummyT)
|
wenzelm@28082
|
429 |
in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
|
wenzelm@25328
|
430 |
|
wenzelm@25328
|
431 |
fun inferred_fixes ctxt =
|
wenzelm@28082
|
432 |
let
|
wenzelm@43360
|
433 |
val xs = map #2 (Variable.dest_fixes ctxt);
|
wenzelm@28082
|
434 |
val (Ts, ctxt') = fold_map inferred_param xs ctxt;
|
wenzelm@28082
|
435 |
in (xs ~~ Ts, ctxt') end;
|
wenzelm@25328
|
436 |
|
wenzelm@25328
|
437 |
|
wenzelm@25328
|
438 |
(* type and constant names *)
|
wenzelm@25328
|
439 |
|
wenzelm@27821
|
440 |
local
|
wenzelm@25328
|
441 |
|
wenzelm@30576
|
442 |
val token_content = Syntax.read_token #>> Symbol_Pos.content;
|
wenzelm@25328
|
443 |
|
wenzelm@35399
|
444 |
fun prep_const_proper ctxt strict (c, pos) =
|
wenzelm@35399
|
445 |
let
|
wenzelm@35399
|
446 |
fun err msg = error (msg ^ Position.str_of pos);
|
wenzelm@35399
|
447 |
val consts = consts_of ctxt;
|
wenzelm@35399
|
448 |
val t as Const (d, _) =
|
wenzelm@35399
|
449 |
(case Variable.lookup_const ctxt c of
|
wenzelm@35399
|
450 |
SOME d =>
|
wenzelm@35399
|
451 |
Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => err msg)
|
wenzelm@43340
|
452 |
| NONE => Consts.read_const consts (c, pos));
|
wenzelm@35399
|
453 |
val _ =
|
wenzelm@35399
|
454 |
if strict then ignore (Consts.the_type consts d) handle TYPE (msg, _, _) => err msg
|
wenzelm@35399
|
455 |
else ();
|
wenzelm@39776
|
456 |
val _ = Context_Position.report ctxt pos (Markup.const d);
|
wenzelm@43338
|
457 |
val _ = Context_Position.report ctxt pos (Name_Space.markup (Consts.space_of consts) d);
|
wenzelm@35399
|
458 |
in t end;
|
wenzelm@27821
|
459 |
|
wenzelm@27821
|
460 |
in
|
wenzelm@27821
|
461 |
|
wenzelm@35399
|
462 |
fun read_type_name ctxt strict text =
|
wenzelm@27821
|
463 |
let
|
wenzelm@35676
|
464 |
val tsig = tsig_of ctxt;
|
wenzelm@35399
|
465 |
val (c, pos) = token_content text;
|
wenzelm@27821
|
466 |
in
|
wenzelm@43162
|
467 |
if Lexicon.is_tid c then
|
wenzelm@39776
|
468 |
(Context_Position.report ctxt pos Markup.tfree;
|
wenzelm@35680
|
469 |
TFree (c, default_sort ctxt (c, ~1)))
|
wenzelm@27821
|
470 |
else
|
wenzelm@27821
|
471 |
let
|
wenzelm@43230
|
472 |
val d = intern_type ctxt c;
|
wenzelm@43339
|
473 |
val decl = Type.the_decl tsig (d, pos);
|
wenzelm@43338
|
474 |
fun err () = error ("Bad type name: " ^ quote d ^ Position.str_of pos);
|
wenzelm@35360
|
475 |
val args =
|
wenzelm@35360
|
476 |
(case decl of
|
wenzelm@35360
|
477 |
Type.LogicalType n => n
|
wenzelm@35360
|
478 |
| Type.Abbreviation (vs, _, _) => if strict then err () else length vs
|
wenzelm@35360
|
479 |
| Type.Nonterminal => if strict then err () else 0);
|
wenzelm@43338
|
480 |
val _ = Context_Position.report ctxt pos (Markup.tycon d);
|
wenzelm@43338
|
481 |
val _ = Context_Position.report ctxt pos (Name_Space.markup (Type.type_space tsig) d);
|
wenzelm@35360
|
482 |
in Type (d, replicate args dummyT) end
|
wenzelm@27821
|
483 |
end;
|
wenzelm@27821
|
484 |
|
wenzelm@35676
|
485 |
fun read_type_name_proper ctxt strict text =
|
wenzelm@35676
|
486 |
(case read_type_name ctxt strict text of
|
wenzelm@35676
|
487 |
T as Type _ => T
|
wenzelm@35676
|
488 |
| T => error ("Not a type constructor: " ^ Syntax.string_of_typ ctxt T));
|
wenzelm@35676
|
489 |
|
wenzelm@35676
|
490 |
|
wenzelm@35399
|
491 |
fun read_const_proper ctxt strict = prep_const_proper ctxt strict o token_content;
|
wenzelm@27821
|
492 |
|
wenzelm@36521
|
493 |
fun read_const ctxt strict ty text =
|
wenzelm@36542
|
494 |
let
|
wenzelm@36542
|
495 |
val (c, pos) = token_content text;
|
wenzelm@36542
|
496 |
val _ = no_skolem false c;
|
wenzelm@36542
|
497 |
in
|
wenzelm@43360
|
498 |
(case (Variable.lookup_fixed ctxt c, Variable.is_const ctxt c) of
|
wenzelm@27821
|
499 |
(SOME x, false) =>
|
wenzelm@39776
|
500 |
(Context_Position.report ctxt pos
|
wenzelm@39776
|
501 |
(Markup.name x (if can Name.dest_skolem x then Markup.skolem else Markup.free));
|
wenzelm@36521
|
502 |
Free (x, infer_type ctxt (x, ty)))
|
wenzelm@35399
|
503 |
| _ => prep_const_proper ctxt strict (c, pos))
|
wenzelm@27821
|
504 |
end;
|
wenzelm@27821
|
505 |
|
wenzelm@27821
|
506 |
end;
|
wenzelm@25328
|
507 |
|
wenzelm@25328
|
508 |
|
wenzelm@43125
|
509 |
(* skolem variables *)
|
wenzelm@43125
|
510 |
|
wenzelm@43125
|
511 |
fun intern_skolem ctxt x =
|
wenzelm@43125
|
512 |
let
|
wenzelm@43125
|
513 |
val _ = no_skolem false x;
|
wenzelm@43360
|
514 |
val sko = Variable.lookup_fixed ctxt x;
|
wenzelm@43125
|
515 |
val is_const = can (read_const_proper ctxt false) x orelse Long_Name.is_qualified x;
|
wenzelm@43125
|
516 |
val is_declared = is_some (Variable.def_type ctxt false (x, ~1));
|
wenzelm@43125
|
517 |
in
|
wenzelm@43125
|
518 |
if Variable.is_const ctxt x then NONE
|
wenzelm@43125
|
519 |
else if is_some sko then sko
|
wenzelm@43125
|
520 |
else if not is_const orelse is_declared then SOME x
|
wenzelm@43125
|
521 |
else NONE
|
wenzelm@43125
|
522 |
end;
|
wenzelm@43125
|
523 |
|
wenzelm@43125
|
524 |
|
wenzelm@24684
|
525 |
(* read_term *)
|
wenzelm@24684
|
526 |
|
wenzelm@24684
|
527 |
fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
|
wenzelm@24684
|
528 |
|
wenzelm@24684
|
529 |
val read_term_pattern = read_term_mode mode_pattern;
|
wenzelm@24684
|
530 |
val read_term_schematic = read_term_mode mode_schematic;
|
wenzelm@24684
|
531 |
val read_term_abbrev = read_term_mode mode_abbrev;
|
wenzelm@24684
|
532 |
|
wenzelm@24684
|
533 |
|
wenzelm@19001
|
534 |
(* local abbreviations *)
|
wenzelm@10810
|
535 |
|
wenzelm@24501
|
536 |
local
|
wenzelm@24501
|
537 |
|
wenzelm@43258
|
538 |
fun certify_consts ctxt = Consts.certify (Context.pretty ctxt) (tsig_of ctxt)
|
wenzelm@27286
|
539 |
(not (abbrev_mode ctxt)) (consts_of ctxt);
|
wenzelm@19001
|
540 |
|
wenzelm@39284
|
541 |
fun expand_binds ctxt =
|
wenzelm@39284
|
542 |
let
|
wenzelm@39284
|
543 |
val Mode {pattern, schematic, ...} = get_mode ctxt;
|
wenzelm@19897
|
544 |
|
wenzelm@39284
|
545 |
fun reject_schematic (t as Var _) =
|
wenzelm@39284
|
546 |
error ("Unbound schematic variable: " ^ Syntax.string_of_term ctxt t)
|
wenzelm@39284
|
547 |
| reject_schematic (Abs (_, _, t)) = reject_schematic t
|
wenzelm@39284
|
548 |
| reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
|
wenzelm@39284
|
549 |
| reject_schematic _ = ();
|
wenzelm@39284
|
550 |
in
|
wenzelm@24495
|
551 |
if pattern then I
|
wenzelm@24495
|
552 |
else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
|
wenzelm@24495
|
553 |
end;
|
wenzelm@10810
|
554 |
|
wenzelm@24501
|
555 |
in
|
wenzelm@24501
|
556 |
|
wenzelm@24501
|
557 |
fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
|
wenzelm@24501
|
558 |
|
wenzelm@24501
|
559 |
end;
|
wenzelm@24501
|
560 |
|
wenzelm@41137
|
561 |
val show_abbrevs_raw = Config.declare "show_abbrevs" (fn _ => Config.Bool true);
|
wenzelm@41137
|
562 |
val show_abbrevs = Config.bool show_abbrevs_raw;
|
wenzelm@10810
|
563 |
|
wenzelm@24922
|
564 |
fun contract_abbrevs ctxt t =
|
wenzelm@24922
|
565 |
let
|
wenzelm@24922
|
566 |
val thy = theory_of ctxt;
|
wenzelm@24922
|
567 |
val consts = consts_of ctxt;
|
wenzelm@24922
|
568 |
val Mode {abbrev, ...} = get_mode ctxt;
|
wenzelm@30566
|
569 |
val retrieve = Consts.retrieve_abbrevs consts (print_mode_value () @ [""]);
|
wenzelm@30566
|
570 |
fun match_abbrev u = Option.map #1 (get_first (Pattern.match_rew thy u) (retrieve u));
|
wenzelm@24922
|
571 |
in
|
wenzelm@41137
|
572 |
if abbrev orelse not (Config.get ctxt show_abbrevs) orelse not (can Term.type_of t) then t
|
berghofe@35203
|
573 |
else Pattern.rewrite_term_top thy [] [match_abbrev] t
|
wenzelm@24922
|
574 |
end;
|
wenzelm@24922
|
575 |
|
wenzelm@24922
|
576 |
|
wenzelm@24518
|
577 |
(* patterns *)
|
wenzelm@24518
|
578 |
|
wenzelm@32003
|
579 |
fun prepare_patternT ctxt T =
|
wenzelm@32003
|
580 |
let
|
wenzelm@32003
|
581 |
val Mode {pattern, schematic, ...} = get_mode ctxt;
|
wenzelm@32003
|
582 |
val _ =
|
wenzelm@32003
|
583 |
pattern orelse schematic orelse
|
wenzelm@32003
|
584 |
T |> Term.exists_subtype
|
wenzelm@39284
|
585 |
(fn T as TVar (xi, _) =>
|
wenzelm@37153
|
586 |
not (Type_Infer.is_param xi) andalso
|
wenzelm@39284
|
587 |
error ("Illegal schematic type variable: " ^ Syntax.string_of_typ ctxt T)
|
wenzelm@32003
|
588 |
| _ => false)
|
wenzelm@32003
|
589 |
in T end;
|
wenzelm@24518
|
590 |
|
wenzelm@22712
|
591 |
|
wenzelm@24505
|
592 |
local
|
wenzelm@10810
|
593 |
|
wenzelm@43231
|
594 |
val dummies = Config.bool (Config.declare "Proof_Context.dummies" (K (Config.Bool false)));
|
wenzelm@27259
|
595 |
|
wenzelm@27259
|
596 |
fun check_dummies ctxt t =
|
wenzelm@39777
|
597 |
if Config.get ctxt dummies then t
|
wenzelm@27259
|
598 |
else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
|
wenzelm@27259
|
599 |
|
wenzelm@24767
|
600 |
fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
|
wenzelm@10810
|
601 |
|
wenzelm@27259
|
602 |
in
|
wenzelm@10810
|
603 |
|
wenzelm@39777
|
604 |
val allow_dummies = Config.put dummies true;
|
wenzelm@24505
|
605 |
|
wenzelm@24684
|
606 |
fun prepare_patterns ctxt =
|
wenzelm@24518
|
607 |
let val Mode {pattern, ...} = get_mode ctxt in
|
wenzelm@39549
|
608 |
Type_Infer.fixate ctxt #>
|
wenzelm@24767
|
609 |
pattern ? Variable.polymorphic ctxt #>
|
wenzelm@24684
|
610 |
(map o Term.map_types) (prepare_patternT ctxt) #>
|
wenzelm@27259
|
611 |
(if pattern then prepare_dummies else map (check_dummies ctxt))
|
wenzelm@24505
|
612 |
end;
|
wenzelm@24505
|
613 |
|
wenzelm@24505
|
614 |
end;
|
wenzelm@24505
|
615 |
|
wenzelm@10810
|
616 |
|
wenzelm@43125
|
617 |
(* sort constraints *)
|
wenzelm@27286
|
618 |
|
wenzelm@36448
|
619 |
fun get_sort ctxt raw_text =
|
wenzelm@27286
|
620 |
let
|
wenzelm@35676
|
621 |
val tsig = tsig_of ctxt;
|
wenzelm@27286
|
622 |
|
wenzelm@36448
|
623 |
val text = distinct (op =) (map (apsnd (Type.minimize_sort tsig)) raw_text);
|
wenzelm@36153
|
624 |
val _ =
|
wenzelm@36448
|
625 |
(case duplicates (eq_fst (op =)) text of
|
wenzelm@36153
|
626 |
[] => ()
|
wenzelm@27286
|
627 |
| dups => error ("Inconsistent sort constraints for type variable(s) "
|
wenzelm@27286
|
628 |
^ commas_quote (map (Term.string_of_vname' o fst) dups)));
|
wenzelm@27286
|
629 |
|
wenzelm@36153
|
630 |
fun lookup xi =
|
wenzelm@36448
|
631 |
(case AList.lookup (op =) text xi of
|
wenzelm@36153
|
632 |
NONE => NONE
|
wenzelm@36153
|
633 |
| SOME S => if S = dummyS then NONE else SOME S);
|
wenzelm@36153
|
634 |
|
wenzelm@27286
|
635 |
fun get xi =
|
wenzelm@36153
|
636 |
(case (lookup xi, Variable.def_sort ctxt xi) of
|
wenzelm@27286
|
637 |
(NONE, NONE) => Type.defaultS tsig
|
wenzelm@27286
|
638 |
| (NONE, SOME S) => S
|
wenzelm@27286
|
639 |
| (SOME S, NONE) => S
|
wenzelm@27286
|
640 |
| (SOME S, SOME S') =>
|
wenzelm@27286
|
641 |
if Type.eq_sort tsig (S, S') then S'
|
wenzelm@35676
|
642 |
else error ("Sort constraint " ^ Syntax.string_of_sort ctxt S ^
|
wenzelm@35676
|
643 |
" inconsistent with default " ^ Syntax.string_of_sort ctxt S' ^
|
wenzelm@30817
|
644 |
" for type variable " ^ quote (Term.string_of_vname' xi)));
|
wenzelm@36448
|
645 |
in get end;
|
wenzelm@27286
|
646 |
|
wenzelm@36153
|
647 |
fun check_tvar ctxt (xi, S) = (xi, get_sort ctxt [(xi, S)] xi);
|
wenzelm@36153
|
648 |
fun check_tfree ctxt (x, S) = apfst fst (check_tvar ctxt ((x, ~1), S));
|
wenzelm@36153
|
649 |
|
wenzelm@10810
|
650 |
|
wenzelm@10810
|
651 |
(* certify terms *)
|
wenzelm@10810
|
652 |
|
wenzelm@10810
|
653 |
local
|
wenzelm@10810
|
654 |
|
wenzelm@24684
|
655 |
fun gen_cert prop ctxt t =
|
wenzelm@24684
|
656 |
t
|
wenzelm@24684
|
657 |
|> expand_abbrevs ctxt
|
wenzelm@43258
|
658 |
|> (fn t' =>
|
wenzelm@43258
|
659 |
#1 (Sign.certify' prop (Context.pretty ctxt) false (consts_of ctxt) (theory_of ctxt) t')
|
wenzelm@43258
|
660 |
handle TYPE (msg, _, _) => error msg | TERM (msg, _) => error msg);
|
wenzelm@16501
|
661 |
|
wenzelm@10810
|
662 |
in
|
wenzelm@10810
|
663 |
|
wenzelm@24684
|
664 |
val cert_term = gen_cert false;
|
wenzelm@24684
|
665 |
val cert_prop = gen_cert true;
|
wenzelm@10810
|
666 |
|
wenzelm@10810
|
667 |
end;
|
wenzelm@10810
|
668 |
|
wenzelm@10810
|
669 |
|
wenzelm@43286
|
670 |
(* check/uncheck *)
|
wenzelm@22701
|
671 |
|
wenzelm@35616
|
672 |
fun def_type ctxt =
|
wenzelm@35616
|
673 |
let val Mode {pattern, ...} = get_mode ctxt
|
wenzelm@35616
|
674 |
in Variable.def_type ctxt pattern end;
|
wenzelm@35616
|
675 |
|
wenzelm@25406
|
676 |
local
|
wenzelm@25406
|
677 |
|
wenzelm@24518
|
678 |
fun standard_typ_check ctxt =
|
wenzelm@24518
|
679 |
map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
|
wenzelm@24518
|
680 |
map (prepare_patternT ctxt);
|
wenzelm@24518
|
681 |
|
wenzelm@24922
|
682 |
fun standard_term_uncheck ctxt =
|
wenzelm@24922
|
683 |
map (contract_abbrevs ctxt);
|
wenzelm@24922
|
684 |
|
wenzelm@24518
|
685 |
in
|
wenzelm@24518
|
686 |
|
wenzelm@43283
|
687 |
val _ = Context.>>
|
wenzelm@43283
|
688 |
(Syntax.add_typ_check 0 "standard" standard_typ_check #>
|
wenzelm@43283
|
689 |
Syntax.add_term_check 100 "fixate" prepare_patterns #>
|
wenzelm@43283
|
690 |
Syntax.add_term_uncheck 0 "standard" standard_term_uncheck);
|
wenzelm@22701
|
691 |
|
wenzelm@24518
|
692 |
end;
|
wenzelm@22701
|
693 |
|
wenzelm@22701
|
694 |
|
wenzelm@10810
|
695 |
|
wenzelm@21610
|
696 |
(** export results **)
|
wenzelm@21531
|
697 |
|
wenzelm@20310
|
698 |
fun common_export is_goal inner outer =
|
wenzelm@20310
|
699 |
map (Assumption.export is_goal inner outer) #>
|
wenzelm@20310
|
700 |
Variable.export inner outer;
|
wenzelm@10810
|
701 |
|
wenzelm@20310
|
702 |
val goal_export = common_export true;
|
wenzelm@20310
|
703 |
val export = common_export false;
|
wenzelm@12704
|
704 |
|
wenzelm@21531
|
705 |
fun export_morphism inner outer =
|
wenzelm@21531
|
706 |
Assumption.export_morphism inner outer $>
|
wenzelm@21531
|
707 |
Variable.export_morphism inner outer;
|
wenzelm@21531
|
708 |
|
wenzelm@28396
|
709 |
fun norm_export_morphism inner outer =
|
wenzelm@28396
|
710 |
export_morphism inner outer $>
|
wenzelm@28396
|
711 |
Morphism.thm_morphism Goal.norm_result;
|
wenzelm@28396
|
712 |
|
wenzelm@21531
|
713 |
|
wenzelm@15758
|
714 |
|
wenzelm@30764
|
715 |
(** term bindings **)
|
wenzelm@10810
|
716 |
|
wenzelm@10810
|
717 |
(* simult_matches *)
|
wenzelm@10810
|
718 |
|
wenzelm@19867
|
719 |
fun simult_matches ctxt (t, pats) =
|
wenzelm@19867
|
720 |
(case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
|
wenzelm@19867
|
721 |
NONE => error "Pattern match failed!"
|
wenzelm@32043
|
722 |
| SOME (env, _) => Vartab.fold (fn (v, (_, t)) => cons (v, t)) (Envir.term_env env) []);
|
wenzelm@10810
|
723 |
|
wenzelm@10810
|
724 |
|
wenzelm@30764
|
725 |
(* bind_terms *)
|
wenzelm@10810
|
726 |
|
wenzelm@30764
|
727 |
val bind_terms = fold (fn (xi, t) => fn ctxt =>
|
wenzelm@30764
|
728 |
ctxt
|
wenzelm@30764
|
729 |
|> Variable.bind_term (xi, Option.map (cert_term (set_mode mode_default ctxt)) t));
|
wenzelm@10810
|
730 |
|
wenzelm@10810
|
731 |
|
wenzelm@30764
|
732 |
(* auto_bind *)
|
wenzelm@10810
|
733 |
|
wenzelm@20330
|
734 |
fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
|
wenzelm@10810
|
735 |
| drop_schematic b = b;
|
wenzelm@10810
|
736 |
|
wenzelm@30764
|
737 |
fun auto_bind f ts ctxt = ctxt |> bind_terms (map drop_schematic (f (theory_of ctxt) ts));
|
wenzelm@10810
|
738 |
|
wenzelm@33386
|
739 |
val auto_bind_goal = auto_bind Auto_Bind.goal;
|
wenzelm@33386
|
740 |
val auto_bind_facts = auto_bind Auto_Bind.facts;
|
wenzelm@10810
|
741 |
|
wenzelm@10810
|
742 |
|
wenzelm@10810
|
743 |
(* match_bind(_i) *)
|
wenzelm@10810
|
744 |
|
wenzelm@10810
|
745 |
local
|
wenzelm@10810
|
746 |
|
wenzelm@24684
|
747 |
fun gen_bind prep_terms gen raw_binds ctxt =
|
wenzelm@10810
|
748 |
let
|
wenzelm@24684
|
749 |
fun prep_bind (raw_pats, t) ctxt1 =
|
wenzelm@24684
|
750 |
let
|
wenzelm@24684
|
751 |
val T = Term.fastype_of t;
|
wenzelm@24684
|
752 |
val ctxt2 = Variable.declare_term t ctxt1;
|
wenzelm@24684
|
753 |
val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
|
wenzelm@24684
|
754 |
val binds = simult_matches ctxt2 (t, pats);
|
wenzelm@24684
|
755 |
in (binds, ctxt2) end;
|
wenzelm@10810
|
756 |
|
wenzelm@24686
|
757 |
val ts = prep_terms ctxt dummyT (map snd raw_binds);
|
wenzelm@24686
|
758 |
val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
|
wenzelm@10810
|
759 |
val binds' =
|
wenzelm@19916
|
760 |
if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
|
wenzelm@10810
|
761 |
else binds;
|
skalberg@15531
|
762 |
val binds'' = map (apsnd SOME) binds';
|
wenzelm@18310
|
763 |
val ctxt'' =
|
wenzelm@19897
|
764 |
tap (Variable.warn_extra_tfrees ctxt)
|
wenzelm@18310
|
765 |
(if gen then
|
wenzelm@30764
|
766 |
ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> bind_terms binds''
|
wenzelm@30764
|
767 |
else ctxt' |> bind_terms binds'');
|
wenzelm@18310
|
768 |
in (ts, ctxt'') end;
|
wenzelm@10810
|
769 |
|
wenzelm@10810
|
770 |
in
|
wenzelm@10810
|
771 |
|
wenzelm@24684
|
772 |
fun read_terms ctxt T =
|
wenzelm@39541
|
773 |
map (Syntax.parse_term ctxt #> Type.constraint T) #> Syntax.check_terms ctxt;
|
wenzelm@24684
|
774 |
|
wenzelm@24684
|
775 |
val match_bind = gen_bind read_terms;
|
wenzelm@24684
|
776 |
val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
|
wenzelm@10810
|
777 |
|
wenzelm@10810
|
778 |
end;
|
wenzelm@10810
|
779 |
|
wenzelm@10810
|
780 |
|
wenzelm@10810
|
781 |
(* propositions with patterns *)
|
wenzelm@10810
|
782 |
|
wenzelm@10810
|
783 |
local
|
wenzelm@10810
|
784 |
|
wenzelm@24684
|
785 |
fun prep_propp mode prep_props (context, args) =
|
wenzelm@10810
|
786 |
let
|
wenzelm@19585
|
787 |
fun prep (_, raw_pats) (ctxt, prop :: props) =
|
wenzelm@24684
|
788 |
let val ctxt' = Variable.declare_term prop ctxt
|
wenzelm@24684
|
789 |
in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
|
wenzelm@24684
|
790 |
|
wenzelm@17860
|
791 |
val (propp, (context', _)) = (fold_map o fold_map) prep args
|
wenzelm@24684
|
792 |
(context, prep_props (set_mode mode context) (maps (map fst) args));
|
wenzelm@10810
|
793 |
in (context', propp) end;
|
wenzelm@10810
|
794 |
|
wenzelm@24684
|
795 |
fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
|
wenzelm@10810
|
796 |
let
|
wenzelm@24684
|
797 |
val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
|
wenzelm@19585
|
798 |
val binds = flat (flat (map (map (simult_matches ctxt')) args));
|
wenzelm@10810
|
799 |
val propss = map (map #1) args;
|
wenzelm@10810
|
800 |
|
wenzelm@10810
|
801 |
(*generalize result: context evaluated now, binds added later*)
|
wenzelm@19916
|
802 |
val gen = Variable.exportT_terms ctxt' ctxt;
|
wenzelm@30764
|
803 |
fun gen_binds c = c |> bind_terms (map #1 binds ~~ map SOME (gen (map #2 binds)));
|
wenzelm@30764
|
804 |
in (ctxt' |> bind_terms (map (apsnd SOME) binds), (propss, gen_binds)) end;
|
wenzelm@10810
|
805 |
|
wenzelm@10810
|
806 |
in
|
wenzelm@10810
|
807 |
|
wenzelm@24684
|
808 |
val read_propp = prep_propp mode_default Syntax.read_props;
|
wenzelm@24684
|
809 |
val cert_propp = prep_propp mode_default (map o cert_prop);
|
wenzelm@24684
|
810 |
val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
|
wenzelm@24684
|
811 |
val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
|
wenzelm@10810
|
812 |
|
wenzelm@24684
|
813 |
val bind_propp = gen_bind_propp mode_default Syntax.read_props;
|
wenzelm@24684
|
814 |
val bind_propp_i = gen_bind_propp mode_default (map o cert_prop);
|
wenzelm@24684
|
815 |
val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props;
|
wenzelm@24684
|
816 |
val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
|
wenzelm@10810
|
817 |
|
wenzelm@10810
|
818 |
end;
|
wenzelm@10810
|
819 |
|
wenzelm@10810
|
820 |
|
wenzelm@10810
|
821 |
|
wenzelm@10810
|
822 |
(** theorems **)
|
wenzelm@10810
|
823 |
|
wenzelm@18042
|
824 |
(* fact_tac *)
|
wenzelm@18042
|
825 |
|
wenzelm@27867
|
826 |
fun comp_incr_tac [] _ = no_tac
|
wenzelm@27867
|
827 |
| comp_incr_tac (th :: ths) i =
|
wenzelm@27867
|
828 |
(fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
|
wenzelm@18042
|
829 |
|
wenzelm@21687
|
830 |
fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
|
wenzelm@18122
|
831 |
|
wenzelm@27867
|
832 |
fun potential_facts ctxt prop =
|
wenzelm@27867
|
833 |
Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
|
wenzelm@27867
|
834 |
|
wenzelm@27867
|
835 |
fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
|
wenzelm@18042
|
836 |
|
wenzelm@18042
|
837 |
|
wenzelm@10810
|
838 |
(* get_thm(s) *)
|
wenzelm@10810
|
839 |
|
wenzelm@26361
|
840 |
local
|
wenzelm@26361
|
841 |
|
wenzelm@26687
|
842 |
fun retrieve_thms pick ctxt (Facts.Fact s) =
|
wenzelm@16501
|
843 |
let
|
wenzelm@27867
|
844 |
val (_, pos) = Syntax.read_token s;
|
wenzelm@24511
|
845 |
val prop = Syntax.read_prop (set_mode mode_default ctxt) s
|
wenzelm@24511
|
846 |
|> singleton (Variable.polymorphic ctxt);
|
wenzelm@27867
|
847 |
|
wenzelm@27867
|
848 |
fun prove_fact th =
|
wenzelm@33700
|
849 |
Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th])));
|
wenzelm@27867
|
850 |
val res =
|
wenzelm@27867
|
851 |
(case get_first (try prove_fact) (potential_facts ctxt prop) of
|
wenzelm@27867
|
852 |
SOME res => res
|
wenzelm@27867
|
853 |
| NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^
|
wenzelm@27867
|
854 |
Syntax.string_of_term ctxt prop))
|
wenzelm@27867
|
855 |
in pick "" [res] end
|
wenzelm@26687
|
856 |
| retrieve_thms pick ctxt xthmref =
|
wenzelm@18042
|
857 |
let
|
wenzelm@18042
|
858 |
val thy = theory_of ctxt;
|
wenzelm@26284
|
859 |
val local_facts = facts_of ctxt;
|
wenzelm@26673
|
860 |
val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
|
wenzelm@26336
|
861 |
val name = Facts.name_of_ref thmref;
|
wenzelm@27821
|
862 |
val pos = Facts.pos_of_ref xthmref;
|
wenzelm@24012
|
863 |
val thms =
|
wenzelm@24012
|
864 |
if name = "" then [Thm.transfer thy Drule.dummy_thm]
|
wenzelm@24012
|
865 |
else
|
wenzelm@26393
|
866 |
(case Facts.lookup (Context.Proof ctxt) local_facts name of
|
wenzelm@39776
|
867 |
SOME (_, ths) =>
|
wenzelm@43249
|
868 |
(Context_Position.report ctxt pos
|
wenzelm@43250
|
869 |
(Name_Space.markup (Facts.space_of local_facts) name);
|
wenzelm@43249
|
870 |
map (Thm.transfer thy) (Facts.select thmref ths))
|
wenzelm@39814
|
871 |
| NONE => Global_Theory.get_fact (Context.Proof ctxt) thy xthmref);
|
wenzelm@24012
|
872 |
in pick name thms end;
|
wenzelm@10810
|
873 |
|
wenzelm@26361
|
874 |
in
|
wenzelm@26346
|
875 |
|
wenzelm@26687
|
876 |
val get_fact = retrieve_thms (K I);
|
wenzelm@26687
|
877 |
val get_fact_single = retrieve_thms Facts.the_single;
|
wenzelm@26346
|
878 |
|
wenzelm@26361
|
879 |
fun get_thms ctxt = get_fact ctxt o Facts.named;
|
wenzelm@26361
|
880 |
fun get_thm ctxt = get_fact_single ctxt o Facts.named;
|
wenzelm@26361
|
881 |
|
wenzelm@26361
|
882 |
end;
|
wenzelm@10810
|
883 |
|
wenzelm@10810
|
884 |
|
wenzelm@26284
|
885 |
(* facts *)
|
wenzelm@12309
|
886 |
|
wenzelm@28082
|
887 |
local
|
wenzelm@28082
|
888 |
|
haftmann@28965
|
889 |
fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b))
|
haftmann@28861
|
890 |
| update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts
|
wenzelm@43246
|
891 |
(Facts.add_local ctxt do_props (naming_of ctxt) (b, ths) #> snd);
|
wenzelm@10810
|
892 |
|
wenzelm@30768
|
893 |
in
|
wenzelm@30768
|
894 |
|
wenzelm@30768
|
895 |
fun note_thmss kind = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt =>
|
wenzelm@28082
|
896 |
let
|
haftmann@28965
|
897 |
val name = full_name ctxt b;
|
wenzelm@39814
|
898 |
val facts = Global_Theory.name_thmss false name raw_facts;
|
wenzelm@21443
|
899 |
fun app (th, attrs) x =
|
wenzelm@30768
|
900 |
swap (Library.foldl_map
|
wenzelm@30768
|
901 |
(Thm.proof_attributes (surround (Thm.kind kind) (attrs @ more_attrs))) (x, th));
|
wenzelm@21443
|
902 |
val (res, ctxt') = fold_map app facts ctxt;
|
wenzelm@39814
|
903 |
val thms = Global_Theory.name_thms false false name (flat res);
|
wenzelm@24388
|
904 |
val Mode {stmt, ...} = get_mode ctxt;
|
haftmann@28861
|
905 |
in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end);
|
wenzelm@12711
|
906 |
|
wenzelm@28417
|
907 |
fun put_thms do_props thms ctxt = ctxt
|
wenzelm@28417
|
908 |
|> map_naming (K local_naming)
|
wenzelm@33383
|
909 |
|> Context_Position.set_visible false
|
haftmann@28965
|
910 |
|> update_thms do_props (apfst Binding.name thms)
|
wenzelm@33383
|
911 |
|> Context_Position.restore_visible ctxt
|
wenzelm@28417
|
912 |
|> restore_naming ctxt;
|
wenzelm@28082
|
913 |
|
wenzelm@12711
|
914 |
end;
|
wenzelm@10810
|
915 |
|
wenzelm@10810
|
916 |
|
wenzelm@10810
|
917 |
|
wenzelm@35680
|
918 |
(** basic logical entities **)
|
wenzelm@18187
|
919 |
|
wenzelm@18187
|
920 |
(* variables *)
|
wenzelm@18187
|
921 |
|
wenzelm@19897
|
922 |
fun declare_var (x, opt_T, mx) ctxt =
|
wenzelm@43159
|
923 |
let val T = (case opt_T of SOME T => T | NONE => Mixfix.mixfixT mx)
|
wenzelm@20163
|
924 |
in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
|
wenzelm@19897
|
925 |
|
wenzelm@18187
|
926 |
local
|
wenzelm@18187
|
927 |
|
wenzelm@25353
|
928 |
fun prep_vars prep_typ internal =
|
wenzelm@35129
|
929 |
fold_map (fn (b, raw_T, mx) => fn ctxt =>
|
wenzelm@18672
|
930 |
let
|
wenzelm@43366
|
931 |
val x = Variable.check_name b;
|
wenzelm@43162
|
932 |
val _ = Lexicon.is_identifier (no_skolem internal x) orelse
|
wenzelm@43252
|
933 |
error ("Illegal variable name: " ^ Binding.print b);
|
wenzelm@18187
|
934 |
|
wenzelm@18672
|
935 |
fun cond_tvars T =
|
wenzelm@18672
|
936 |
if internal then T
|
wenzelm@18678
|
937 |
else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
|
wenzelm@24277
|
938 |
val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
|
wenzelm@35129
|
939 |
val (_, ctxt') = ctxt |> declare_var (x, opt_T, mx);
|
wenzelm@35129
|
940 |
in ((b, opt_T, mx), ctxt') end);
|
wenzelm@18187
|
941 |
|
wenzelm@18187
|
942 |
in
|
wenzelm@18187
|
943 |
|
wenzelm@25353
|
944 |
val read_vars = prep_vars Syntax.parse_typ false;
|
wenzelm@25353
|
945 |
val cert_vars = prep_vars (K I) true;
|
wenzelm@18187
|
946 |
|
wenzelm@18187
|
947 |
end;
|
wenzelm@18187
|
948 |
|
wenzelm@18187
|
949 |
|
wenzelm@21744
|
950 |
(* notation *)
|
wenzelm@21744
|
951 |
|
wenzelm@24949
|
952 |
local
|
wenzelm@24949
|
953 |
|
wenzelm@35539
|
954 |
fun type_syntax (Type (c, args), mx) =
|
wenzelm@43162
|
955 |
SOME (Local_Syntax.Type, (Lexicon.mark_type c, Mixfix.make_type (length args), mx))
|
wenzelm@35417
|
956 |
| type_syntax _ = NONE;
|
wenzelm@35417
|
957 |
|
wenzelm@35417
|
958 |
fun const_syntax _ (Free (x, T), mx) = SOME (Local_Syntax.Fixed, (x, T, mx))
|
wenzelm@24949
|
959 |
| const_syntax ctxt (Const (c, _), mx) =
|
wenzelm@35255
|
960 |
(case try (Consts.type_scheme (consts_of ctxt)) c of
|
wenzelm@43162
|
961 |
SOME T => SOME (Local_Syntax.Const, (Lexicon.mark_const c, T, mx))
|
wenzelm@35255
|
962 |
| NONE => NONE)
|
wenzelm@24949
|
963 |
| const_syntax _ _ = NONE;
|
wenzelm@24949
|
964 |
|
wenzelm@35417
|
965 |
fun gen_notation syntax add mode args ctxt =
|
wenzelm@35417
|
966 |
ctxt |> map_syntax
|
wenzelm@35417
|
967 |
(Local_Syntax.update_modesyntax (theory_of ctxt) add mode (map_filter (syntax ctxt) args));
|
wenzelm@35417
|
968 |
|
wenzelm@24949
|
969 |
in
|
wenzelm@24949
|
970 |
|
wenzelm@35417
|
971 |
val type_notation = gen_notation (K type_syntax);
|
wenzelm@35417
|
972 |
val notation = gen_notation const_syntax;
|
wenzelm@35417
|
973 |
|
wenzelm@38587
|
974 |
fun target_type_notation add mode args phi =
|
wenzelm@35417
|
975 |
let
|
wenzelm@35417
|
976 |
val args' = args |> map_filter (fn (T, mx) =>
|
wenzelm@35417
|
977 |
let
|
wenzelm@35417
|
978 |
val T' = Morphism.typ phi T;
|
wenzelm@35417
|
979 |
val similar = (case (T, T') of (Type (c, _), Type (c', _)) => c = c' | _ => false);
|
wenzelm@35417
|
980 |
in if similar then SOME (T', mx) else NONE end);
|
wenzelm@35417
|
981 |
in Context.mapping (Sign.type_notation add mode args') (type_notation add mode args') end;
|
wenzelm@21744
|
982 |
|
wenzelm@24949
|
983 |
fun target_notation add mode args phi =
|
wenzelm@33537
|
984 |
let
|
wenzelm@33537
|
985 |
val args' = args |> map_filter (fn (t, mx) =>
|
wenzelm@33537
|
986 |
let val t' = Morphism.term phi t
|
wenzelm@33537
|
987 |
in if Term.aconv_untyped (t, t') then SOME (t', mx) else NONE end);
|
wenzelm@24949
|
988 |
in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
|
wenzelm@24949
|
989 |
|
wenzelm@35680
|
990 |
end;
|
wenzelm@35417
|
991 |
|
wenzelm@35680
|
992 |
|
wenzelm@35680
|
993 |
(* aliases *)
|
wenzelm@35680
|
994 |
|
wenzelm@36450
|
995 |
fun class_alias b c ctxt = (map_tsig o apfst) (Type.class_alias (naming_of ctxt) b c) ctxt;
|
wenzelm@36450
|
996 |
fun type_alias b c ctxt = (map_tsig o apfst) (Type.type_alias (naming_of ctxt) b c) ctxt;
|
wenzelm@35680
|
997 |
fun const_alias b c ctxt = (map_consts o apfst) (Consts.alias (naming_of ctxt) b c) ctxt;
|
wenzelm@21744
|
998 |
|
wenzelm@21744
|
999 |
|
wenzelm@24767
|
1000 |
(* local constants *)
|
wenzelm@24767
|
1001 |
|
wenzelm@24767
|
1002 |
fun add_const_constraint (c, opt_T) ctxt =
|
wenzelm@24767
|
1003 |
let
|
wenzelm@24767
|
1004 |
fun prepT raw_T =
|
wenzelm@24767
|
1005 |
let val T = cert_typ ctxt raw_T
|
wenzelm@24767
|
1006 |
in cert_term ctxt (Const (c, T)); T end;
|
haftmann@25039
|
1007 |
in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
|
wenzelm@19001
|
1008 |
|
wenzelm@33173
|
1009 |
fun add_abbrev mode (b, raw_t) ctxt =
|
wenzelm@19001
|
1010 |
let
|
wenzelm@24675
|
1011 |
val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
|
wenzelm@43252
|
1012 |
handle ERROR msg => cat_error msg ("in constant abbreviation " ^ Binding.print b);
|
wenzelm@20008
|
1013 |
val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
|
wenzelm@21807
|
1014 |
val ((lhs, rhs), consts') = consts_of ctxt
|
wenzelm@43246
|
1015 |
|> Consts.abbreviate ctxt (tsig_of ctxt) (naming_of ctxt) mode (b, t);
|
wenzelm@19001
|
1016 |
in
|
wenzelm@19001
|
1017 |
ctxt
|
haftmann@25039
|
1018 |
|> (map_consts o apfst) (K consts')
|
wenzelm@21803
|
1019 |
|> Variable.declare_term rhs
|
wenzelm@21803
|
1020 |
|> pair (lhs, rhs)
|
wenzelm@21704
|
1021 |
end;
|
wenzelm@19001
|
1022 |
|
wenzelm@25052
|
1023 |
fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
|
wenzelm@25052
|
1024 |
|
wenzelm@19001
|
1025 |
|
wenzelm@18672
|
1026 |
(* fixes *)
|
wenzelm@18187
|
1027 |
|
wenzelm@30770
|
1028 |
fun add_fixes raw_vars ctxt =
|
wenzelm@18672
|
1029 |
let
|
wenzelm@43363
|
1030 |
val thy = theory_of ctxt;
|
wenzelm@43363
|
1031 |
val vars = #1 (cert_vars raw_vars ctxt);
|
wenzelm@43363
|
1032 |
in
|
wenzelm@43363
|
1033 |
ctxt
|
wenzelm@43363
|
1034 |
|> Variable.add_fixes_binding (map #1 vars)
|
wenzelm@43363
|
1035 |
|-> (fn xs =>
|
wenzelm@43363
|
1036 |
fold_map declare_var (map2 (fn x => fn (_, T, mx) => (x, T, mx)) xs vars)
|
wenzelm@43363
|
1037 |
#-> (map_syntax o Local_Syntax.add_syntax thy o map (pair Local_Syntax.Fixed))
|
wenzelm@43363
|
1038 |
#> pair xs)
|
wenzelm@43363
|
1039 |
end;
|
wenzelm@18187
|
1040 |
|
wenzelm@18672
|
1041 |
|
wenzelm@18672
|
1042 |
(* fixes vs. frees *)
|
wenzelm@18672
|
1043 |
|
wenzelm@32791
|
1044 |
fun auto_fixes (ctxt, (propss, x)) =
|
wenzelm@21370
|
1045 |
((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
|
wenzelm@18187
|
1046 |
|
wenzelm@18672
|
1047 |
fun bind_fixes xs ctxt =
|
wenzelm@18187
|
1048 |
let
|
wenzelm@30770
|
1049 |
val (_, ctxt') = ctxt |> add_fixes (map (fn x => (Binding.name x, NONE, NoSyn)) xs);
|
wenzelm@18187
|
1050 |
fun bind (t as Free (x, T)) =
|
wenzelm@18340
|
1051 |
if member (op =) xs x then
|
wenzelm@43360
|
1052 |
(case Variable.lookup_fixed ctxt' x of SOME x' => Free (x', T) | NONE => t)
|
wenzelm@18187
|
1053 |
else t
|
wenzelm@18187
|
1054 |
| bind (t $ u) = bind t $ bind u
|
wenzelm@18187
|
1055 |
| bind (Abs (x, T, t)) = Abs (x, T, bind t)
|
wenzelm@18187
|
1056 |
| bind a = a;
|
wenzelm@18672
|
1057 |
in (bind, ctxt') end;
|
wenzelm@18187
|
1058 |
|
wenzelm@18187
|
1059 |
|
wenzelm@11918
|
1060 |
|
wenzelm@18672
|
1061 |
(** assumptions **)
|
wenzelm@11918
|
1062 |
|
wenzelm@20209
|
1063 |
local
|
wenzelm@20209
|
1064 |
|
wenzelm@20209
|
1065 |
fun gen_assms prepp exp args ctxt =
|
wenzelm@20209
|
1066 |
let
|
wenzelm@20234
|
1067 |
val cert = Thm.cterm_of (theory_of ctxt);
|
wenzelm@20209
|
1068 |
val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
|
wenzelm@20234
|
1069 |
val _ = Variable.warn_extra_tfrees ctxt ctxt1;
|
wenzelm@20234
|
1070 |
val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
|
wenzelm@20234
|
1071 |
in
|
wenzelm@20234
|
1072 |
ctxt2
|
wenzelm@20234
|
1073 |
|> auto_bind_facts (flat propss)
|
wenzelm@33644
|
1074 |
|> note_thmss "" (map fst args ~~ map (map (fn th => ([th], []))) premss)
|
wenzelm@20234
|
1075 |
end;
|
wenzelm@20209
|
1076 |
|
wenzelm@20209
|
1077 |
in
|
wenzelm@20209
|
1078 |
|
wenzelm@20209
|
1079 |
val add_assms = gen_assms (apsnd #1 o bind_propp);
|
wenzelm@20209
|
1080 |
val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
|
wenzelm@20209
|
1081 |
|
wenzelm@20209
|
1082 |
end;
|
wenzelm@20209
|
1083 |
|
wenzelm@20209
|
1084 |
|
wenzelm@10810
|
1085 |
|
wenzelm@10810
|
1086 |
(** cases **)
|
wenzelm@10810
|
1087 |
|
wenzelm@16147
|
1088 |
local
|
wenzelm@16147
|
1089 |
|
wenzelm@16668
|
1090 |
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
|
wenzelm@16147
|
1091 |
|
wenzelm@18476
|
1092 |
fun add_case _ ("", _) cases = cases
|
wenzelm@18476
|
1093 |
| add_case _ (name, NONE) cases = rem_case name cases
|
wenzelm@18476
|
1094 |
| add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
|
wenzelm@16147
|
1095 |
|
wenzelm@18678
|
1096 |
fun prep_case name fxs c =
|
wenzelm@18609
|
1097 |
let
|
wenzelm@18609
|
1098 |
fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
|
wenzelm@18609
|
1099 |
| replace [] ys = ys
|
wenzelm@18678
|
1100 |
| replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
|
wenzelm@33368
|
1101 |
val Rule_Cases.Case {fixes, assumes, binds, cases} = c;
|
wenzelm@18609
|
1102 |
val fixes' = replace fxs fixes;
|
wenzelm@18609
|
1103 |
val binds' = map drop_schematic binds;
|
wenzelm@18609
|
1104 |
in
|
wenzelm@18609
|
1105 |
if null (fold (Term.add_tvarsT o snd) fixes []) andalso
|
wenzelm@18609
|
1106 |
null (fold (fold Term.add_vars o snd) assumes []) then
|
wenzelm@33368
|
1107 |
Rule_Cases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
|
wenzelm@18678
|
1108 |
else error ("Illegal schematic variable(s) in case " ^ quote name)
|
wenzelm@18609
|
1109 |
end;
|
wenzelm@18609
|
1110 |
|
wenzelm@18672
|
1111 |
fun fix (x, T) ctxt =
|
wenzelm@18672
|
1112 |
let
|
wenzelm@18672
|
1113 |
val (bind, ctxt') = bind_fixes [x] ctxt;
|
wenzelm@18672
|
1114 |
val t = bind (Free (x, T));
|
wenzelm@20163
|
1115 |
in (t, ctxt' |> Variable.declare_constraints t) end;
|
wenzelm@18672
|
1116 |
|
wenzelm@16147
|
1117 |
in
|
wenzelm@16147
|
1118 |
|
wenzelm@18672
|
1119 |
fun add_cases is_proper = map_cases o fold (add_case is_proper);
|
wenzelm@18609
|
1120 |
|
wenzelm@18609
|
1121 |
fun case_result c ctxt =
|
wenzelm@18609
|
1122 |
let
|
wenzelm@33368
|
1123 |
val Rule_Cases.Case {fixes, ...} = c;
|
wenzelm@18672
|
1124 |
val (ts, ctxt') = ctxt |> fold_map fix fixes;
|
wenzelm@33368
|
1125 |
val Rule_Cases.Case {assumes, binds, cases, ...} = Rule_Cases.apply ts c;
|
wenzelm@18609
|
1126 |
in
|
wenzelm@18609
|
1127 |
ctxt'
|
wenzelm@30764
|
1128 |
|> bind_terms (map drop_schematic binds)
|
wenzelm@18609
|
1129 |
|> add_cases true (map (apsnd SOME) cases)
|
wenzelm@18609
|
1130 |
|> pair (assumes, (binds, cases))
|
wenzelm@18609
|
1131 |
end;
|
wenzelm@18609
|
1132 |
|
wenzelm@18609
|
1133 |
val apply_case = apfst fst oo case_result;
|
wenzelm@18609
|
1134 |
|
wenzelm@16540
|
1135 |
fun get_case ctxt name xs =
|
wenzelm@17184
|
1136 |
(case AList.lookup (op =) (cases_of ctxt) name of
|
wenzelm@18678
|
1137 |
NONE => error ("Unknown case: " ^ quote name)
|
wenzelm@18678
|
1138 |
| SOME (c, _) => prep_case name xs c);
|
wenzelm@10810
|
1139 |
|
wenzelm@16147
|
1140 |
end;
|
wenzelm@10810
|
1141 |
|
wenzelm@10810
|
1142 |
|
wenzelm@10810
|
1143 |
|
wenzelm@5819
|
1144 |
(** print context information **)
|
wenzelm@5819
|
1145 |
|
wenzelm@12072
|
1146 |
(* local syntax *)
|
wenzelm@12072
|
1147 |
|
wenzelm@12093
|
1148 |
val print_syntax = Syntax.print_syntax o syn_of;
|
wenzelm@12072
|
1149 |
|
wenzelm@12072
|
1150 |
|
wenzelm@21728
|
1151 |
(* abbreviations *)
|
wenzelm@18971
|
1152 |
|
wenzelm@21728
|
1153 |
fun pretty_abbrevs show_globals ctxt =
|
wenzelm@18971
|
1154 |
let
|
wenzelm@25052
|
1155 |
val ((space, consts), (_, globals)) =
|
wenzelm@19033
|
1156 |
pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
|
wenzelm@21803
|
1157 |
fun add_abbr (_, (_, NONE)) = I
|
wenzelm@25406
|
1158 |
| add_abbr (c, (T, SOME t)) =
|
wenzelm@21728
|
1159 |
if not show_globals andalso Symtab.defined globals c then I
|
wenzelm@21728
|
1160 |
else cons (c, Logic.mk_equals (Const (c, T), t));
|
wenzelm@43229
|
1161 |
val abbrevs =
|
wenzelm@43229
|
1162 |
Name_Space.extern_table ctxt (space, Symtab.make (Symtab.fold add_abbr consts []));
|
wenzelm@18971
|
1163 |
in
|
wenzelm@35146
|
1164 |
if null abbrevs then []
|
wenzelm@21728
|
1165 |
else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
|
wenzelm@18971
|
1166 |
end;
|
wenzelm@18971
|
1167 |
|
wenzelm@21728
|
1168 |
val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
|
wenzelm@21728
|
1169 |
|
wenzelm@18971
|
1170 |
|
wenzelm@5819
|
1171 |
(* term bindings *)
|
wenzelm@5819
|
1172 |
|
wenzelm@16540
|
1173 |
fun pretty_binds ctxt =
|
wenzelm@5819
|
1174 |
let
|
wenzelm@19897
|
1175 |
val binds = Variable.binds_of ctxt;
|
wenzelm@21728
|
1176 |
fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
|
wenzelm@6721
|
1177 |
in
|
wenzelm@35146
|
1178 |
if Vartab.is_empty binds then []
|
wenzelm@15758
|
1179 |
else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
|
wenzelm@6721
|
1180 |
end;
|
wenzelm@5819
|
1181 |
|
wenzelm@8462
|
1182 |
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
|
wenzelm@6847
|
1183 |
|
wenzelm@5819
|
1184 |
|
wenzelm@5819
|
1185 |
(* local theorems *)
|
wenzelm@5819
|
1186 |
|
wenzelm@16540
|
1187 |
fun pretty_lthms ctxt =
|
wenzelm@20012
|
1188 |
let
|
wenzelm@26284
|
1189 |
val local_facts = facts_of ctxt;
|
wenzelm@26284
|
1190 |
val props = Facts.props local_facts;
|
wenzelm@26673
|
1191 |
val facts =
|
wenzelm@35146
|
1192 |
(if null props then [] else [("<unnamed>", props)]) @
|
wenzelm@28212
|
1193 |
Facts.dest_static [] local_facts;
|
wenzelm@20012
|
1194 |
in
|
wenzelm@35146
|
1195 |
if null facts then []
|
wenzelm@28212
|
1196 |
else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
|
wenzelm@20012
|
1197 |
end;
|
wenzelm@6847
|
1198 |
|
wenzelm@12057
|
1199 |
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
|
wenzelm@5819
|
1200 |
|
wenzelm@5819
|
1201 |
|
wenzelm@8373
|
1202 |
(* local contexts *)
|
wenzelm@8373
|
1203 |
|
wenzelm@26722
|
1204 |
local
|
wenzelm@26722
|
1205 |
|
wenzelm@26722
|
1206 |
fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
|
wenzelm@8373
|
1207 |
let
|
wenzelm@24922
|
1208 |
val prt_term = Syntax.pretty_term ctxt;
|
wenzelm@12057
|
1209 |
|
wenzelm@10810
|
1210 |
fun prt_let (xi, t) = Pretty.block
|
wenzelm@10818
|
1211 |
[Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
|
wenzelm@10810
|
1212 |
Pretty.quote (prt_term t)];
|
wenzelm@8373
|
1213 |
|
wenzelm@13425
|
1214 |
fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
|
wenzelm@13425
|
1215 |
((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
|
wenzelm@13425
|
1216 |
|
wenzelm@10810
|
1217 |
fun prt_sect _ _ _ [] = []
|
wenzelm@35146
|
1218 |
| prt_sect s sep prt xs =
|
wenzelm@35146
|
1219 |
[Pretty.block (Pretty.breaks (Pretty.str s ::
|
wenzelm@35146
|
1220 |
flat (separate sep (map (single o prt) xs))))];
|
wenzelm@26722
|
1221 |
in
|
wenzelm@26722
|
1222 |
Pretty.block (Pretty.fbreaks
|
wenzelm@8373
|
1223 |
(Pretty.str (name ^ ":") ::
|
wenzelm@11915
|
1224 |
prt_sect "fix" [] (Pretty.str o fst) fixes @
|
wenzelm@10810
|
1225 |
prt_sect "let" [Pretty.str "and"] prt_let
|
wenzelm@19482
|
1226 |
(map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
|
wenzelm@13425
|
1227 |
(if forall (null o #2) asms then []
|
wenzelm@18609
|
1228 |
else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
|
wenzelm@26722
|
1229 |
prt_sect "subcases:" [] (Pretty.str o fst) cs))
|
wenzelm@26722
|
1230 |
end;
|
wenzelm@16540
|
1231 |
|
wenzelm@26722
|
1232 |
in
|
wenzelm@26722
|
1233 |
|
wenzelm@26722
|
1234 |
fun pretty_cases ctxt =
|
wenzelm@26722
|
1235 |
let
|
wenzelm@18476
|
1236 |
fun add_case (_, (_, false)) = I
|
wenzelm@33368
|
1237 |
| add_case (name, (c as Rule_Cases.Case {fixes, ...}, true)) =
|
wenzelm@26722
|
1238 |
cons (name, (fixes, case_result c ctxt));
|
wenzelm@18476
|
1239 |
val cases = fold add_case (cases_of ctxt) [];
|
wenzelm@8373
|
1240 |
in
|
wenzelm@35146
|
1241 |
if null cases then []
|
wenzelm@26722
|
1242 |
else [Pretty.big_list "cases:" (map pretty_case cases)]
|
wenzelm@8373
|
1243 |
end;
|
wenzelm@8373
|
1244 |
|
wenzelm@8462
|
1245 |
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
|
wenzelm@8373
|
1246 |
|
wenzelm@26722
|
1247 |
end;
|
wenzelm@26722
|
1248 |
|
wenzelm@8373
|
1249 |
|
wenzelm@12057
|
1250 |
(* core context *)
|
wenzelm@9733
|
1251 |
|
wenzelm@35146
|
1252 |
val debug = Unsynchronized.ref false;
|
wenzelm@35146
|
1253 |
val verbose = Unsynchronized.ref false;
|
wenzelm@5819
|
1254 |
|
wenzelm@18672
|
1255 |
fun pretty_ctxt ctxt =
|
wenzelm@39411
|
1256 |
if not (! debug) then []
|
wenzelm@20310
|
1257 |
else
|
wenzelm@20310
|
1258 |
let
|
wenzelm@24922
|
1259 |
val prt_term = Syntax.pretty_term ctxt;
|
wenzelm@12057
|
1260 |
|
wenzelm@20310
|
1261 |
(*structures*)
|
wenzelm@35539
|
1262 |
val {structs, ...} = Local_Syntax.idents_of (syntax_of ctxt);
|
wenzelm@35144
|
1263 |
val prt_structs =
|
wenzelm@35144
|
1264 |
if null structs then []
|
wenzelm@20310
|
1265 |
else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
|
wenzelm@20310
|
1266 |
Pretty.commas (map Pretty.str structs))];
|
wenzelm@12093
|
1267 |
|
wenzelm@20310
|
1268 |
(*fixes*)
|
wenzelm@20310
|
1269 |
fun prt_fix (x, x') =
|
wenzelm@20310
|
1270 |
if x = x' then Pretty.str x
|
wenzelm@20310
|
1271 |
else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
|
wenzelm@20310
|
1272 |
val fixes =
|
wenzelm@43360
|
1273 |
filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
|
wenzelm@43360
|
1274 |
(Variable.dest_fixes ctxt);
|
wenzelm@35144
|
1275 |
val prt_fixes =
|
wenzelm@35144
|
1276 |
if null fixes then []
|
wenzelm@20310
|
1277 |
else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
|
wenzelm@20310
|
1278 |
Pretty.commas (map prt_fix fixes))];
|
wenzelm@12057
|
1279 |
|
wenzelm@20310
|
1280 |
(*prems*)
|
wenzelm@30479
|
1281 |
val prems = Assumption.all_prems_of ctxt;
|
wenzelm@35144
|
1282 |
val prt_prems =
|
wenzelm@35144
|
1283 |
if null prems then []
|
wenzelm@39411
|
1284 |
else [Pretty.big_list "prems:" (map (Display.pretty_thm ctxt) prems)];
|
wenzelm@20310
|
1285 |
in prt_structs @ prt_fixes @ prt_prems end;
|
wenzelm@9733
|
1286 |
|
wenzelm@9733
|
1287 |
|
wenzelm@9733
|
1288 |
(* main context *)
|
wenzelm@7575
|
1289 |
|
wenzelm@16540
|
1290 |
fun pretty_context ctxt =
|
wenzelm@5819
|
1291 |
let
|
wenzelm@35146
|
1292 |
val is_verbose = ! verbose;
|
wenzelm@35146
|
1293 |
fun verb f x = if is_verbose then f (x ()) else [];
|
wenzelm@35146
|
1294 |
|
wenzelm@24922
|
1295 |
val prt_term = Syntax.pretty_term ctxt;
|
wenzelm@24922
|
1296 |
val prt_typ = Syntax.pretty_typ ctxt;
|
wenzelm@24922
|
1297 |
val prt_sort = Syntax.pretty_sort ctxt;
|
wenzelm@5819
|
1298 |
|
wenzelm@5819
|
1299 |
(*theory*)
|
wenzelm@12057
|
1300 |
val pretty_thy = Pretty.block
|
wenzelm@17384
|
1301 |
[Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
|
wenzelm@7200
|
1302 |
|
wenzelm@8373
|
1303 |
(*defaults*)
|
wenzelm@5819
|
1304 |
fun prt_atom prt prtT (x, X) = Pretty.block
|
wenzelm@5819
|
1305 |
[prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
|
wenzelm@5819
|
1306 |
|
wenzelm@5819
|
1307 |
fun prt_var (x, ~1) = prt_term (Syntax.free x)
|
wenzelm@5819
|
1308 |
| prt_var xi = prt_term (Syntax.var xi);
|
wenzelm@5819
|
1309 |
|
wenzelm@5819
|
1310 |
fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
|
wenzelm@5819
|
1311 |
| prt_varT xi = prt_typ (TVar (xi, []));
|
wenzelm@5819
|
1312 |
|
wenzelm@5819
|
1313 |
val prt_defT = prt_atom prt_var prt_typ;
|
wenzelm@5819
|
1314 |
val prt_defS = prt_atom prt_varT prt_sort;
|
wenzelm@16540
|
1315 |
|
wenzelm@20163
|
1316 |
val (types, sorts) = Variable.constraints_of ctxt;
|
wenzelm@5819
|
1317 |
in
|
wenzelm@18609
|
1318 |
verb single (K pretty_thy) @
|
wenzelm@18672
|
1319 |
pretty_ctxt ctxt @
|
wenzelm@21728
|
1320 |
verb (pretty_abbrevs false) (K ctxt) @
|
wenzelm@8462
|
1321 |
verb pretty_binds (K ctxt) @
|
wenzelm@12057
|
1322 |
verb pretty_lthms (K ctxt) @
|
wenzelm@8462
|
1323 |
verb pretty_cases (K ctxt) @
|
wenzelm@18609
|
1324 |
verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
|
wenzelm@20163
|
1325 |
verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
|
wenzelm@5819
|
1326 |
end;
|
wenzelm@5819
|
1327 |
|
wenzelm@5819
|
1328 |
end;
|
wenzelm@35539
|
1329 |
|
wenzelm@43231
|
1330 |
val show_abbrevs = Proof_Context.show_abbrevs;
|
wenzelm@41137
|
1331 |
|