author | wenzelm |
Sat, 17 May 2008 14:27:02 +0200 | |
changeset 26930 | 64e50d783276 |
parent 26731 | 48df747c8543 |
child 26939 | 1035c89b4c02 |
permissions | -rw-r--r-- |
5819 | 1 |
(* Title: Pure/Isar/proof_context.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
19001 | 5 |
The key concept of Isar proof contexts: elevates primitive local |
6 |
reasoning Gamma |- phi to a structured concept, with generic context |
|
20234
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
7 |
elements. See also structure Variable and Assumption. |
5819 | 8 |
*) |
9 |
||
10 |
signature PROOF_CONTEXT = |
|
11 |
sig |
|
20310 | 12 |
val theory_of: Proof.context -> theory |
13 |
val init: theory -> Proof.context |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
14 |
type mode |
24501 | 15 |
val mode_default: mode |
16 |
val mode_stmt: mode |
|
17 |
val mode_pattern: mode |
|
18 |
val mode_schematic: mode |
|
19 |
val mode_abbrev: mode |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
20 |
val set_mode: mode -> Proof.context -> Proof.context |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
21 |
val get_mode: Proof.context -> mode |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
22 |
val restore_mode: Proof.context -> Proof.context -> Proof.context |
26731 | 23 |
val is_abbrev_mode: Proof.context -> bool |
21667
ce813b82c88b
add_notation: permissive about undeclared consts;
wenzelm
parents:
21648
diff
changeset
|
24 |
val set_stmt: bool -> Proof.context -> Proof.context |
ce813b82c88b
add_notation: permissive about undeclared consts;
wenzelm
parents:
21648
diff
changeset
|
25 |
val naming_of: Proof.context -> NameSpace.naming |
20310 | 26 |
val full_name: Proof.context -> bstring -> string |
27 |
val consts_of: Proof.context -> Consts.T |
|
21183 | 28 |
val const_syntax_name: Proof.context -> string -> string |
24752 | 29 |
val the_const_constraint: Proof.context -> string -> typ |
26268 | 30 |
val mk_const: Proof.context -> string * typ list -> term |
20784 | 31 |
val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context |
20310 | 32 |
val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context |
26284 | 33 |
val facts_of: Proof.context -> Facts.T |
20310 | 34 |
val transfer: theory -> Proof.context -> Proof.context |
20367 | 35 |
val theory: (theory -> theory) -> Proof.context -> Proof.context |
36 |
val theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context |
|
21728 | 37 |
val pretty_term_abbrev: Proof.context -> term -> Pretty.T |
22874 | 38 |
val pretty_thm_legacy: thm -> Pretty.T |
20310 | 39 |
val pretty_thm: Proof.context -> thm -> Pretty.T |
40 |
val pretty_thms: Proof.context -> thm list -> Pretty.T |
|
41 |
val pretty_fact: Proof.context -> string * thm list -> Pretty.T |
|
42 |
val pretty_proof: Proof.context -> Proofterm.proof -> Pretty.T |
|
43 |
val pretty_proof_of: Proof.context -> bool -> thm -> Pretty.T |
|
44 |
val string_of_thm: Proof.context -> thm -> string |
|
45 |
val read_typ: Proof.context -> string -> typ |
|
46 |
val read_typ_syntax: Proof.context -> string -> typ |
|
47 |
val read_typ_abbrev: Proof.context -> string -> typ |
|
48 |
val cert_typ: Proof.context -> typ -> typ |
|
49 |
val cert_typ_syntax: Proof.context -> typ -> typ |
|
50 |
val cert_typ_abbrev: Proof.context -> typ -> typ |
|
51 |
val get_skolem: Proof.context -> string -> string |
|
52 |
val revert_skolem: Proof.context -> string -> string |
|
25328 | 53 |
val infer_type: Proof.context -> string -> typ |
54 |
val inferred_param: string -> Proof.context -> (string * typ) * Proof.context |
|
55 |
val inferred_fixes: Proof.context -> (string * typ) list * Proof.context |
|
56 |
val read_tyname: Proof.context -> string -> typ |
|
25345
dd5b851f8ef0
renamed ProofContext.read_const' to ProofContext.read_const_proper;
wenzelm
parents:
25332
diff
changeset
|
57 |
val read_const_proper: Proof.context -> string -> term |
25328 | 58 |
val read_const: Proof.context -> string -> term |
22763 | 59 |
val decode_term: Proof.context -> term -> term |
25406 | 60 |
val standard_infer_types: Proof.context -> term list -> term list |
24684 | 61 |
val read_term_pattern: Proof.context -> string -> term |
62 |
val read_term_schematic: Proof.context -> string -> term |
|
63 |
val read_term_abbrev: Proof.context -> string -> term |
|
25345
dd5b851f8ef0
renamed ProofContext.read_const' to ProofContext.read_const_proper;
wenzelm
parents:
25332
diff
changeset
|
64 |
val expand_abbrevs: Proof.context -> term -> term |
20310 | 65 |
val cert_term: Proof.context -> term -> term |
66 |
val cert_prop: Proof.context -> term -> term |
|
67 |
val goal_export: Proof.context -> Proof.context -> thm list -> thm list |
|
68 |
val export: Proof.context -> Proof.context -> thm list -> thm list |
|
21531 | 69 |
val export_morphism: Proof.context -> Proof.context -> morphism |
20310 | 70 |
val add_binds: (indexname * string option) list -> Proof.context -> Proof.context |
71 |
val add_binds_i: (indexname * term option) list -> Proof.context -> Proof.context |
|
72 |
val auto_bind_goal: term list -> Proof.context -> Proof.context |
|
73 |
val auto_bind_facts: term list -> Proof.context -> Proof.context |
|
74 |
val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context |
|
75 |
val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context |
|
76 |
val read_propp: Proof.context * (string * string list) list list |
|
77 |
-> Proof.context * (term * term list) list list |
|
78 |
val cert_propp: Proof.context * (term * term list) list list |
|
79 |
-> Proof.context * (term * term list) list list |
|
80 |
val read_propp_schematic: Proof.context * (string * string list) list list |
|
81 |
-> Proof.context * (term * term list) list list |
|
82 |
val cert_propp_schematic: Proof.context * (term * term list) list list |
|
83 |
-> Proof.context * (term * term list) list list |
|
84 |
val bind_propp: Proof.context * (string * string list) list list |
|
85 |
-> Proof.context * (term list list * (Proof.context -> Proof.context)) |
|
86 |
val bind_propp_i: Proof.context * (term * term list) list list |
|
87 |
-> Proof.context * (term list list * (Proof.context -> Proof.context)) |
|
88 |
val bind_propp_schematic: Proof.context * (string * string list) list list |
|
89 |
-> Proof.context * (term list list * (Proof.context -> Proof.context)) |
|
90 |
val bind_propp_schematic_i: Proof.context * (term * term list) list list |
|
91 |
-> Proof.context * (term list list * (Proof.context -> Proof.context)) |
|
18042 | 92 |
val fact_tac: thm list -> int -> tactic |
20310 | 93 |
val some_fact_tac: Proof.context -> int -> tactic |
26346
17debd2fff8e
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
94 |
val get_fact: Proof.context -> Facts.ref -> thm list |
17debd2fff8e
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
95 |
val get_fact_single: Proof.context -> Facts.ref -> thm |
17debd2fff8e
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
96 |
val get_thms: Proof.context -> xstring -> thm list |
17debd2fff8e
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
97 |
val get_thm: Proof.context -> xstring -> thm |
22352 | 98 |
val add_path: string -> Proof.context -> Proof.context |
20310 | 99 |
val no_base_names: Proof.context -> Proof.context |
100 |
val qualified_names: Proof.context -> Proof.context |
|
101 |
val sticky_prefix: string -> Proof.context -> Proof.context |
|
102 |
val restore_naming: Proof.context -> Proof.context -> Proof.context |
|
21728 | 103 |
val reset_naming: Proof.context -> Proof.context |
26250 | 104 |
val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context |
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
105 |
val note_thmss: string -> |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26321
diff
changeset
|
106 |
((bstring * attribute list) * (Facts.ref * attribute list) list) list -> |
20310 | 107 |
Proof.context -> (bstring * thm list) list * Proof.context |
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
108 |
val note_thmss_i: string -> |
18728 | 109 |
((bstring * attribute list) * (thm list * attribute list) list) list -> |
20310 | 110 |
Proof.context -> (bstring * thm list) list * Proof.context |
111 |
val read_vars: (string * string option * mixfix) list -> Proof.context -> |
|
112 |
(string * typ option * mixfix) list * Proof.context |
|
113 |
val cert_vars: (string * typ option * mixfix) list -> Proof.context -> |
|
114 |
(string * typ option * mixfix) list * Proof.context |
|
115 |
val add_fixes: (string * string option * mixfix) list -> |
|
116 |
Proof.context -> string list * Proof.context |
|
117 |
val add_fixes_i: (string * typ option * mixfix) list -> |
|
118 |
Proof.context -> string list * Proof.context |
|
119 |
val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a) |
|
120 |
val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context |
|
20234
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
121 |
val add_assms: Assumption.export -> |
19585 | 122 |
((string * attribute list) * (string * string list) list) list -> |
20310 | 123 |
Proof.context -> (bstring * thm list) list * Proof.context |
20234
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
124 |
val add_assms_i: Assumption.export -> |
19585 | 125 |
((string * attribute list) * (term * term list) list) list -> |
20310 | 126 |
Proof.context -> (bstring * thm list) list * Proof.context |
127 |
val add_cases: bool -> (string * RuleCases.T option) list -> Proof.context -> Proof.context |
|
128 |
val apply_case: RuleCases.T -> Proof.context -> (string * term list) list * Proof.context |
|
129 |
val get_case: Proof.context -> string -> string option list -> RuleCases.T |
|
24949 | 130 |
val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context |
131 |
val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism -> |
|
21744 | 132 |
Context.generic -> Context.generic |
24767 | 133 |
val add_const_constraint: string * typ option -> Proof.context -> Proof.context |
24778 | 134 |
val add_abbrev: string -> Markup.property list -> |
135 |
bstring * term -> Proof.context -> (term * term) * Proof.context |
|
25052 | 136 |
val revert_abbrev: string -> string -> Proof.context -> Proof.context |
10810 | 137 |
val verbose: bool ref |
138 |
val setmp_verbose: ('a -> 'b) -> 'a -> 'b |
|
20310 | 139 |
val print_syntax: Proof.context -> unit |
21728 | 140 |
val print_abbrevs: Proof.context -> unit |
20310 | 141 |
val print_binds: Proof.context -> unit |
142 |
val print_lthms: Proof.context -> unit |
|
143 |
val print_cases: Proof.context -> unit |
|
144 |
val debug: bool ref |
|
10810 | 145 |
val prems_limit: int ref |
20310 | 146 |
val pretty_ctxt: Proof.context -> Pretty.T list |
147 |
val pretty_context: Proof.context -> Pretty.T list |
|
5819 | 148 |
end; |
149 |
||
16540 | 150 |
structure ProofContext: PROOF_CONTEXT = |
5819 | 151 |
struct |
152 |
||
16540 | 153 |
val theory_of = Context.theory_of_proof; |
154 |
val init = Context.init_proof; |
|
12057 | 155 |
|
7270 | 156 |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
157 |
(** inner syntax mode **) |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
158 |
|
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
159 |
datatype mode = |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
160 |
Mode of |
24486 | 161 |
{stmt: bool, (*inner statement mode*) |
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
162 |
pattern: bool, (*pattern binding schematic variables*) |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
163 |
schematic: bool, (*term referencing loose schematic variables*) |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
164 |
abbrev: bool}; (*abbrev mode -- no normalization*) |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
165 |
|
24486 | 166 |
fun make_mode (stmt, pattern, schematic, abbrev) = |
167 |
Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev}; |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
168 |
|
26731 | 169 |
fun dest_mode (Mode mode) = mode; |
170 |
||
24486 | 171 |
val mode_default = make_mode (false, false, false, false); |
172 |
val mode_stmt = make_mode (true, false, false, false); |
|
173 |
val mode_pattern = make_mode (false, true, false, false); |
|
174 |
val mode_schematic = make_mode (false, false, true, false); |
|
175 |
val mode_abbrev = make_mode (false, false, false, true); |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
176 |
|
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
177 |
|
5819 | 178 |
|
16540 | 179 |
(** Isar proof context information **) |
5819 | 180 |
|
16540 | 181 |
datatype ctxt = |
182 |
Ctxt of |
|
24675
2be1253a20d3
removed obsolete set_expand_abbrevs (superceded by mode_abbrev);
wenzelm
parents:
24612
diff
changeset
|
183 |
{mode: mode, (*inner syntax mode*) |
2be1253a20d3
removed obsolete set_expand_abbrevs (superceded by mode_abbrev);
wenzelm
parents:
24612
diff
changeset
|
184 |
naming: NameSpace.naming, (*local naming conventions*) |
2be1253a20d3
removed obsolete set_expand_abbrevs (superceded by mode_abbrev);
wenzelm
parents:
24612
diff
changeset
|
185 |
syntax: LocalSyntax.T, (*local syntax*) |
25039 | 186 |
consts: Consts.T * Consts.T, (*local/global consts*) |
26284 | 187 |
facts: Facts.T, (*local facts*) |
188 |
cases: (string * (RuleCases.T * bool)) list}; (*named case contexts*) |
|
5819 | 189 |
|
26284 | 190 |
fun make_ctxt (mode, naming, syntax, consts, facts, cases) = |
26240 | 191 |
Ctxt {mode = mode, naming = naming, syntax = syntax, |
26284 | 192 |
consts = consts, facts = facts, cases = cases}; |
5819 | 193 |
|
19079
9a7678a0736d
added put_thms_internal: local_naming, no fact index;
wenzelm
parents:
19062
diff
changeset
|
194 |
val local_naming = NameSpace.default_naming |> NameSpace.add_path "local"; |
9a7678a0736d
added put_thms_internal: local_naming, no fact index;
wenzelm
parents:
19062
diff
changeset
|
195 |
|
16540 | 196 |
structure ContextData = ProofDataFun |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
197 |
( |
16540 | 198 |
type T = ctxt; |
199 |
fun init thy = |
|
26240 | 200 |
make_ctxt (mode_default, local_naming, LocalSyntax.init thy, |
26284 | 201 |
(Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []); |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
202 |
); |
5819 | 203 |
|
16540 | 204 |
fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args); |
5819 | 205 |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
206 |
fun map_context f = |
26284 | 207 |
ContextData.map (fn Ctxt {mode, naming, syntax, consts, facts, cases} => |
208 |
make_ctxt (f (mode, naming, syntax, consts, facts, cases))); |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
209 |
|
26284 | 210 |
fun set_mode mode = map_context (fn (_, naming, syntax, consts, facts, cases) => |
211 |
(mode, naming, syntax, consts, facts, cases)); |
|
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
212 |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
213 |
fun map_mode f = |
26284 | 214 |
map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, consts, facts, cases) => |
215 |
(make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, consts, facts, cases)); |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
216 |
|
19001 | 217 |
fun map_naming f = |
26284 | 218 |
map_context (fn (mode, naming, syntax, consts, facts, cases) => |
219 |
(mode, f naming, syntax, consts, facts, cases)); |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
220 |
|
19001 | 221 |
fun map_syntax f = |
26284 | 222 |
map_context (fn (mode, naming, syntax, consts, facts, cases) => |
223 |
(mode, naming, f syntax, consts, facts, cases)); |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
224 |
|
19001 | 225 |
fun map_consts f = |
26284 | 226 |
map_context (fn (mode, naming, syntax, consts, facts, cases) => |
227 |
(mode, naming, syntax, f consts, facts, cases)); |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
228 |
|
26284 | 229 |
fun map_facts f = |
230 |
map_context (fn (mode, naming, syntax, consts, facts, cases) => |
|
231 |
(mode, naming, syntax, consts, f facts, cases)); |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
232 |
|
19001 | 233 |
fun map_cases f = |
26284 | 234 |
map_context (fn (mode, naming, syntax, consts, facts, cases) => |
235 |
(mode, naming, syntax, consts, facts, f cases)); |
|
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
236 |
|
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
237 |
val get_mode = #mode o rep_context; |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
238 |
fun restore_mode ctxt = set_mode (get_mode ctxt); |
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
239 |
|
24486 | 240 |
fun set_stmt stmt = |
241 |
map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev)); |
|
19001 | 242 |
|
243 |
val naming_of = #naming o rep_context; |
|
19387 | 244 |
val full_name = NameSpace.full o naming_of; |
5819 | 245 |
|
16540 | 246 |
val syntax_of = #syntax o rep_context; |
19001 | 247 |
val syn_of = LocalSyntax.syn_of o syntax_of; |
19543 | 248 |
val set_syntax_mode = map_syntax o LocalSyntax.set_mode; |
249 |
val restore_syntax_mode = map_syntax o LocalSyntax.restore_mode o syntax_of; |
|
19001 | 250 |
|
25052 | 251 |
val consts_of = #1 o #consts o rep_context; |
21183 | 252 |
val const_syntax_name = Consts.syntax_name o consts_of; |
24752 | 253 |
val the_const_constraint = Consts.the_constraint o consts_of; |
5819 | 254 |
|
26268 | 255 |
fun mk_const ctxt (c, Ts) = Const (c, Consts.instance (consts_of ctxt) (c, Ts)); |
256 |
||
26284 | 257 |
val facts_of = #facts o rep_context; |
16540 | 258 |
val cases_of = #cases o rep_context; |
5819 | 259 |
|
260 |
||
20367 | 261 |
(* theory transfer *) |
12093 | 262 |
|
19001 | 263 |
fun transfer_syntax thy = |
264 |
map_syntax (LocalSyntax.rebuild thy) #> |
|
25039 | 265 |
map_consts (fn consts as (local_consts, global_consts) => |
19033
24e251657e56
consts: maintain thy version for efficient transfer;
wenzelm
parents:
19019
diff
changeset
|
266 |
let val thy_consts = Sign.consts_of thy in |
24e251657e56
consts: maintain thy version for efficient transfer;
wenzelm
parents:
19019
diff
changeset
|
267 |
if Consts.eq_consts (thy_consts, global_consts) then consts |
25039 | 268 |
else (Consts.merge (local_consts, thy_consts), thy_consts) |
19033
24e251657e56
consts: maintain thy version for efficient transfer;
wenzelm
parents:
19019
diff
changeset
|
269 |
end); |
17072 | 270 |
|
19001 | 271 |
fun transfer thy = Context.transfer_proof thy #> transfer_syntax thy; |
17072 | 272 |
|
20367 | 273 |
fun theory f ctxt = transfer (f (theory_of ctxt)) ctxt; |
274 |
||
275 |
fun theory_result f ctxt = |
|
276 |
let val (res, thy') = f (theory_of ctxt) |
|
277 |
in (res, ctxt |> transfer thy') end; |
|
19019 | 278 |
|
12093 | 279 |
|
280 |
||
14828 | 281 |
(** pretty printing **) |
282 |
||
24922 | 283 |
fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt); |
14828 | 284 |
|
22874 | 285 |
fun pretty_thm_legacy th = |
286 |
let val thy = Thm.theory_of_thm th |
|
24961 | 287 |
in Display.pretty_thm_aux (Syntax.pp (init thy)) true false [] th end; |
20234
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
288 |
|
17451 | 289 |
fun pretty_thm ctxt th = |
22874 | 290 |
let val asms = map Thm.term_of (Assumption.assms_of ctxt) |
24961 | 291 |
in Display.pretty_thm_aux (Syntax.pp ctxt) false true asms th end; |
14828 | 292 |
|
293 |
fun pretty_thms ctxt [th] = pretty_thm ctxt th |
|
294 |
| pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths)); |
|
295 |
||
296 |
fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths |
|
297 |
| pretty_fact ctxt (a, [th]) = |
|
298 |
Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, pretty_thm ctxt th] |
|
299 |
| pretty_fact ctxt (a, ths) = |
|
300 |
Pretty.block (Pretty.fbreaks (Pretty.str (a ^ ":") :: map (pretty_thm ctxt) ths)); |
|
301 |
||
17072 | 302 |
fun pretty_proof ctxt prf = |
21728 | 303 |
pretty_term_abbrev (ctxt |> transfer_syntax (ProofSyntax.proof_syntax prf (theory_of ctxt))) |
17072 | 304 |
(ProofSyntax.term_of_proof prf); |
305 |
||
306 |
fun pretty_proof_of ctxt full th = |
|
307 |
pretty_proof ctxt (ProofSyntax.proof_of full th); |
|
308 |
||
17860
b4cf247ea0d2
note_thmss, read/cert_vars etc.: natural argument order;
wenzelm
parents:
17756
diff
changeset
|
309 |
val string_of_thm = Pretty.string_of oo pretty_thm; |
b4cf247ea0d2
note_thmss, read/cert_vars etc.: natural argument order;
wenzelm
parents:
17756
diff
changeset
|
310 |
|
14828 | 311 |
|
312 |
||
5819 | 313 |
(** prepare types **) |
314 |
||
24277 | 315 |
(* read_typ *) |
316 |
||
317 |
fun read_typ_mode mode ctxt s = |
|
24486 | 318 |
Syntax.read_typ (Type.set_mode mode ctxt) s; |
24277 | 319 |
|
320 |
val read_typ = read_typ_mode Type.mode_default; |
|
321 |
val read_typ_syntax = read_typ_mode Type.mode_syntax; |
|
322 |
val read_typ_abbrev = read_typ_mode Type.mode_abbrev; |
|
323 |
||
324 |
||
325 |
(* cert_typ *) |
|
326 |
||
327 |
fun cert_typ_mode mode ctxt T = |
|
328 |
Sign.certify_typ_mode mode (theory_of ctxt) T |
|
329 |
handle TYPE (msg, _, _) => error msg; |
|
330 |
||
331 |
val cert_typ = cert_typ_mode Type.mode_default; |
|
332 |
val cert_typ_syntax = cert_typ_mode Type.mode_syntax; |
|
333 |
val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev; |
|
334 |
||
335 |
||
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
336 |
|
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
337 |
(** prepare variables **) |
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
338 |
|
7679 | 339 |
(* internalize Skolem constants *) |
340 |
||
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
341 |
val lookup_skolem = AList.lookup (op =) o Variable.fixes_of; |
18187 | 342 |
fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x); |
7679 | 343 |
|
18678 | 344 |
fun no_skolem internal x = |
20086
94ca946fb689
adapted to more efficient Name/Variable implementation;
wenzelm
parents:
20049
diff
changeset
|
345 |
if can Name.dest_skolem x then |
18678 | 346 |
error ("Illegal reference to internal Skolem constant: " ^ quote x) |
20086
94ca946fb689
adapted to more efficient Name/Variable implementation;
wenzelm
parents:
20049
diff
changeset
|
347 |
else if not internal andalso can Name.dest_internal x then |
18678 | 348 |
error ("Illegal reference to internal variable: " ^ quote x) |
7679 | 349 |
else x; |
350 |
||
351 |
||
26717
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
352 |
(* revert Skolem constants -- if possible *) |
18255 | 353 |
|
26717
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
354 |
fun revert_skolem ctxt x = |
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
355 |
(case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of |
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
356 |
SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x |
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
357 |
| NONE => x); |
9133 | 358 |
|
8096 | 359 |
|
26705 | 360 |
(* default token translations *) |
361 |
||
362 |
local |
|
363 |
||
26717
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
364 |
fun free_or_skolem ctxt x = |
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
365 |
(if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x)) |
2e1c3a0e7308
revert_skolem: do not change non-reversible names;
wenzelm
parents:
26705
diff
changeset
|
366 |
else Pretty.mark Markup.free (Pretty.str x)) |
26930
64e50d783276
default token translations: observe Sign.is_pretty_global for fixed variables;
wenzelm
parents:
26731
diff
changeset
|
367 |
|> Pretty.mark |
64e50d783276
default token translations: observe Sign.is_pretty_global for fixed variables;
wenzelm
parents:
26731
diff
changeset
|
368 |
(if Variable.is_fixed ctxt x orelse Sign.is_pretty_global ctxt then Markup.fixed x |
64e50d783276
default token translations: observe Sign.is_pretty_global for fixed variables;
wenzelm
parents:
26731
diff
changeset
|
369 |
else Markup.hilite); |
26705 | 370 |
|
371 |
fun var_or_skolem _ s = |
|
372 |
(case Lexicon.read_variable s of |
|
373 |
SOME (x, i) => |
|
374 |
(case try Name.dest_skolem x of |
|
375 |
NONE => Pretty.mark Markup.var (Pretty.str s) |
|
376 |
| SOME x' => Pretty.mark Markup.skolem |
|
377 |
(Pretty.str (setmp show_question_marks true Term.string_of_vname (x', i)))) |
|
378 |
| NONE => Pretty.mark Markup.var (Pretty.str s)); |
|
379 |
||
380 |
fun class_markup _ c = (* FIXME authentic name *) |
|
381 |
Pretty.mark (Markup.classN, []) (Pretty.str c); |
|
382 |
||
383 |
fun plain_markup m _ s = Pretty.mark m (Pretty.str s); |
|
384 |
||
385 |
val token_trans = |
|
386 |
Syntax.tokentrans_mode "" |
|
387 |
[("class", class_markup), |
|
388 |
("tfree", plain_markup Markup.tfree), |
|
389 |
("tvar", plain_markup Markup.tvar), |
|
390 |
("free", free_or_skolem), |
|
391 |
("bound", plain_markup Markup.bound), |
|
392 |
("var", var_or_skolem), |
|
393 |
("num", plain_markup Markup.num), |
|
394 |
("xnum", plain_markup Markup.xnum), |
|
395 |
("xstr", plain_markup Markup.xstr)]; |
|
396 |
||
397 |
in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end; |
|
398 |
||
399 |
||
18187 | 400 |
|
5819 | 401 |
(** prepare terms and propositions **) |
402 |
||
25328 | 403 |
(* inferred types of parameters *) |
404 |
||
405 |
fun infer_type ctxt x = |
|
406 |
Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt)) |
|
407 |
(Free (x, dummyT))); |
|
408 |
||
409 |
fun inferred_param x ctxt = |
|
410 |
let val T = infer_type ctxt x |
|
411 |
in ((x, T), ctxt |> Variable.declare_term (Free (x, T))) end; |
|
412 |
||
413 |
fun inferred_fixes ctxt = |
|
414 |
fold_map inferred_param (rev (map #2 (Variable.fixes_of ctxt))) ctxt; |
|
415 |
||
416 |
||
417 |
(* type and constant names *) |
|
418 |
||
419 |
fun read_tyname ctxt c = |
|
420 |
if Syntax.is_tid c then |
|
421 |
TFree (c, the_default (Sign.defaultS (theory_of ctxt)) (Variable.def_sort ctxt (c, ~1))) |
|
422 |
else |
|
423 |
let |
|
424 |
val thy = theory_of ctxt; |
|
425 |
val d = Sign.intern_type thy c; |
|
426 |
in Type (d, replicate (Sign.arity_number thy d) dummyT) end; |
|
427 |
||
25345
dd5b851f8ef0
renamed ProofContext.read_const' to ProofContext.read_const_proper;
wenzelm
parents:
25332
diff
changeset
|
428 |
fun read_const_proper ctxt c = |
25328 | 429 |
(case Variable.lookup_const ctxt c of |
430 |
SOME d => Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => error msg) |
|
431 |
| NONE => Consts.read_const (consts_of ctxt) c); |
|
432 |
||
433 |
fun read_const ctxt c = |
|
434 |
(case (lookup_skolem ctxt c, Variable.is_const ctxt c) of |
|
435 |
(SOME x, false) => Free (x, infer_type ctxt x) |
|
25345
dd5b851f8ef0
renamed ProofContext.read_const' to ProofContext.read_const_proper;
wenzelm
parents:
25332
diff
changeset
|
436 |
| _ => read_const_proper ctxt c); |
25328 | 437 |
|
438 |
||
24684 | 439 |
(* read_term *) |
440 |
||
441 |
fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt); |
|
442 |
||
443 |
val read_term_pattern = read_term_mode mode_pattern; |
|
444 |
val read_term_schematic = read_term_mode mode_schematic; |
|
445 |
val read_term_abbrev = read_term_mode mode_abbrev; |
|
446 |
||
447 |
||
19001 | 448 |
(* local abbreviations *) |
5819 | 449 |
|
26240 | 450 |
val tsig_of = Sign.tsig_of o ProofContext.theory_of; |
451 |
||
26731 | 452 |
val is_abbrev_mode = #abbrev o dest_mode o get_mode; |
453 |
||
24501 | 454 |
local |
455 |
||
26731 | 456 |
fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt) |
457 |
(not (is_abbrev_mode ctxt)) (consts_of ctxt); |
|
19001 | 458 |
|
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
459 |
fun reject_schematic (Var (xi, _)) = |
22678 | 460 |
error ("Unbound schematic variable: " ^ Term.string_of_vname xi) |
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
461 |
| reject_schematic (Abs (_, _, t)) = reject_schematic t |
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
462 |
| reject_schematic (t $ u) = (reject_schematic t; reject_schematic u) |
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
463 |
| reject_schematic _ = (); |
5819 | 464 |
|
24495 | 465 |
fun expand_binds ctxt = |
466 |
let val Mode {pattern, schematic, ...} = get_mode ctxt in |
|
467 |
if pattern then I |
|
468 |
else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic) |
|
469 |
end; |
|
5819 | 470 |
|
24501 | 471 |
in |
472 |
||
473 |
fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt; |
|
474 |
||
475 |
end; |
|
476 |
||
5819 | 477 |
|
24922 | 478 |
fun contract_abbrevs ctxt t = |
479 |
let |
|
480 |
val thy = theory_of ctxt; |
|
481 |
val consts = consts_of ctxt; |
|
482 |
val Mode {abbrev, ...} = get_mode ctxt; |
|
483 |
in |
|
25052 | 484 |
if abbrev orelse print_mode_active "no_abbrevs" orelse not (can Term.type_of t) then t |
485 |
else t |> Pattern.rewrite_term thy (Consts.abbrevs_of consts (print_mode_value () @ [""])) [] |
|
24922 | 486 |
end; |
487 |
||
488 |
||
24518 | 489 |
(* patterns *) |
490 |
||
491 |
fun prepare_patternT ctxt = |
|
492 |
let val Mode {pattern, schematic, ...} = get_mode ctxt in |
|
493 |
if pattern orelse schematic then I |
|
494 |
else Term.map_atyps |
|
495 |
(fn T as TVar (xi, _) => |
|
496 |
if not (TypeInfer.is_param xi) |
|
497 |
then error ("Illegal schematic type variable: " ^ Term.string_of_vname xi) |
|
498 |
else T |
|
499 |
| T => T) |
|
500 |
end; |
|
501 |
||
22712 | 502 |
|
24505 | 503 |
local |
6550 | 504 |
|
24767 | 505 |
fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1); |
6762 | 506 |
|
18678 | 507 |
fun reject_dummies t = Term.no_dummy_patterns t |
508 |
handle TERM _ => error "Illegal dummy pattern(s) in term"; |
|
6550 | 509 |
|
24505 | 510 |
in |
511 |
||
24684 | 512 |
fun prepare_patterns ctxt = |
24518 | 513 |
let val Mode {pattern, ...} = get_mode ctxt in |
24767 | 514 |
TypeInfer.fixate_params (Variable.names_of ctxt) #> |
515 |
pattern ? Variable.polymorphic ctxt #> |
|
24684 | 516 |
(map o Term.map_types) (prepare_patternT ctxt) #> |
24767 | 517 |
(if pattern then prepare_dummies else map reject_dummies) |
24505 | 518 |
end; |
519 |
||
520 |
end; |
|
521 |
||
6550 | 522 |
|
22763 | 523 |
(* decoding raw terms (syntax trees) *) |
524 |
||
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
525 |
local |
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
526 |
|
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
527 |
fun intern_skolem ctxt def_type x = |
22763 | 528 |
let |
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
529 |
val _ = no_skolem false x; |
22763 | 530 |
val sko = lookup_skolem ctxt x; |
25452 | 531 |
val is_const = can (read_const_proper ctxt) x orelse NameSpace.is_qualified x; |
22763 | 532 |
val is_declared = is_some (def_type (x, ~1)); |
25319
074d41176558
read_const/legacy_intern_skolem: cover consts within the local scope;
wenzelm
parents:
25168
diff
changeset
|
533 |
in |
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
534 |
if Variable.is_const ctxt x then NONE |
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
535 |
else if is_some sko then sko |
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
536 |
else if not is_const orelse is_declared then SOME x |
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
537 |
else NONE |
25319
074d41176558
read_const/legacy_intern_skolem: cover consts within the local scope;
wenzelm
parents:
25168
diff
changeset
|
538 |
end; |
22763 | 539 |
|
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
540 |
in |
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
541 |
|
24371 | 542 |
fun term_context ctxt = |
543 |
let val thy = theory_of ctxt in |
|
544 |
{get_sort = Sign.get_sort thy (Variable.def_sort ctxt), |
|
25345
dd5b851f8ef0
renamed ProofContext.read_const' to ProofContext.read_const_proper;
wenzelm
parents:
25332
diff
changeset
|
545 |
map_const = try (#1 o Term.dest_Const o read_const_proper ctxt), |
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
546 |
map_free = intern_skolem ctxt (Variable.def_type ctxt false), |
24371 | 547 |
map_type = Sign.intern_tycons thy, |
548 |
map_sort = Sign.intern_sort thy} |
|
549 |
end; |
|
550 |
||
22763 | 551 |
fun decode_term ctxt = |
24371 | 552 |
let val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt |
22763 | 553 |
in Syntax.decode_term get_sort map_const map_free map_type map_sort end; |
554 |
||
10554 | 555 |
end; |
556 |
||
5819 | 557 |
|
558 |
(* certify terms *) |
|
559 |
||
10554 | 560 |
local |
561 |
||
24684 | 562 |
fun gen_cert prop ctxt t = |
563 |
t |
|
564 |
|> expand_abbrevs ctxt |
|
24961 | 565 |
|> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t') |
24684 | 566 |
handle TYPE (msg, _, _) => error msg |
567 |
| TERM (msg, _) => error msg); |
|
16501 | 568 |
|
10554 | 569 |
in |
8096 | 570 |
|
24684 | 571 |
val cert_term = gen_cert false; |
572 |
val cert_prop = gen_cert true; |
|
10554 | 573 |
|
574 |
end; |
|
5819 | 575 |
|
576 |
||
24495 | 577 |
(* type checking/inference *) |
22701 | 578 |
|
24495 | 579 |
fun standard_infer_types ctxt ts = |
580 |
let val Mode {pattern, ...} = get_mode ctxt in |
|
24961 | 581 |
TypeInfer.infer_types (Syntax.pp ctxt) (tsig_of ctxt) (Syntax.check_typs ctxt) |
24495 | 582 |
(try (Consts.the_constraint (consts_of ctxt))) (Variable.def_type ctxt pattern) |
24767 | 583 |
(Variable.names_of ctxt) (Variable.maxidx_of ctxt) NONE (map (rpair dummyT) ts) |
24495 | 584 |
|> #1 |> map #1 |
585 |
handle TYPE (msg, _, _) => error msg |
|
586 |
end; |
|
24486 | 587 |
|
25406 | 588 |
local |
589 |
||
24518 | 590 |
fun standard_typ_check ctxt = |
591 |
map (cert_typ_mode (Type.get_mode ctxt) ctxt) #> |
|
592 |
map (prepare_patternT ctxt); |
|
593 |
||
24769
1372969969e0
standard_term_check: include expand_abbrevs (back again);
wenzelm
parents:
24767
diff
changeset
|
594 |
fun standard_term_check ctxt = |
1372969969e0
standard_term_check: include expand_abbrevs (back again);
wenzelm
parents:
24767
diff
changeset
|
595 |
standard_infer_types ctxt #> |
1372969969e0
standard_term_check: include expand_abbrevs (back again);
wenzelm
parents:
24767
diff
changeset
|
596 |
map (expand_abbrevs ctxt); |
24922 | 597 |
|
598 |
fun standard_term_uncheck ctxt = |
|
599 |
map (contract_abbrevs ctxt); |
|
600 |
||
26463 | 601 |
fun add eq what f = Context.>> (what (fn xs => fn ctxt => |
602 |
let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end)); |
|
24767 | 603 |
|
24518 | 604 |
in |
605 |
||
25060 | 606 |
val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check; |
607 |
val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check; |
|
608 |
val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns; |
|
24922 | 609 |
|
25060 | 610 |
val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck; |
22701 | 611 |
|
24518 | 612 |
end; |
22701 | 613 |
|
614 |
||
9553 | 615 |
|
24767 | 616 |
(** inner syntax operations **) |
24371 | 617 |
|
618 |
local |
|
619 |
||
620 |
fun parse_sort ctxt str = |
|
621 |
Syntax.standard_parse_sort ctxt (syn_of ctxt) (Sign.intern_sort (theory_of ctxt)) str; |
|
622 |
||
623 |
fun parse_typ ctxt str = |
|
624 |
let |
|
625 |
val thy = ProofContext.theory_of ctxt; |
|
626 |
val get_sort = Sign.get_sort thy (Variable.def_sort ctxt); |
|
627 |
val T = Sign.intern_tycons thy |
|
628 |
(Syntax.standard_parse_typ ctxt (syn_of ctxt) get_sort (Sign.intern_sort thy) str); |
|
629 |
in T end |
|
630 |
handle ERROR msg => cat_error msg ("The error(s) above occurred in type " ^ quote str); |
|
631 |
||
632 |
fun parse_term T ctxt str = |
|
633 |
let |
|
634 |
val thy = theory_of ctxt; |
|
25168
2650a4a6ad3e
parse_term: invoke full Syntax.check_term, not just standard_infer_types;
wenzelm
parents:
25159
diff
changeset
|
635 |
val (T', _) = TypeInfer.paramify_dummies T 0; |
25476
03da46cfab9e
standard_parse_term: check ambiguous results without changing the result yet;
wenzelm
parents:
25461
diff
changeset
|
636 |
fun check t = (Syntax.check_term ctxt (TypeInfer.constrain T' t); NONE) |
03da46cfab9e
standard_parse_term: check ambiguous results without changing the result yet;
wenzelm
parents:
25461
diff
changeset
|
637 |
handle ERROR msg => SOME msg; |
24371 | 638 |
val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt; |
24961 | 639 |
val read = Syntax.standard_parse_term (Syntax.pp ctxt) check get_sort |
25168
2650a4a6ad3e
parse_term: invoke full Syntax.check_term, not just standard_infer_types;
wenzelm
parents:
25159
diff
changeset
|
640 |
map_const map_free map_type map_sort ctxt (Sign.is_logtype thy) (syn_of ctxt) T'; |
24371 | 641 |
in read str end; |
642 |
||
24922 | 643 |
|
644 |
fun unparse_sort ctxt S = |
|
645 |
Syntax.standard_unparse_sort ctxt (syn_of ctxt) (Sign.extern_sort (theory_of ctxt) S); |
|
646 |
||
647 |
fun unparse_typ ctxt T = |
|
648 |
Syntax.standard_unparse_typ ctxt (syn_of ctxt) (Sign.extern_typ (theory_of ctxt) T); |
|
649 |
||
650 |
fun unparse_term ctxt t = |
|
651 |
let |
|
652 |
val thy = theory_of ctxt; |
|
653 |
val syntax = syntax_of ctxt; |
|
654 |
val consts = consts_of ctxt; |
|
655 |
in |
|
656 |
t |
|
657 |
|> Sign.extern_term (Consts.extern_early consts) thy |
|
658 |
|> LocalSyntax.extern_term syntax |
|
659 |
|> Syntax.standard_unparse_term (Consts.extern consts) ctxt (LocalSyntax.syn_of syntax) |
|
660 |
(Context.exists_name Context.CPureN thy) |
|
661 |
end; |
|
662 |
||
24371 | 663 |
in |
664 |
||
24767 | 665 |
val _ = Syntax.install_operations |
666 |
{parse_sort = parse_sort, |
|
667 |
parse_typ = parse_typ, |
|
668 |
parse_term = parse_term dummyT, |
|
669 |
parse_prop = parse_term propT, |
|
24922 | 670 |
unparse_sort = unparse_sort, |
671 |
unparse_typ = unparse_typ, |
|
672 |
unparse_term = unparse_term}; |
|
24371 | 673 |
|
674 |
end; |
|
675 |
||
676 |
||
677 |
||
21610 | 678 |
(** export results **) |
21531 | 679 |
|
20310 | 680 |
fun common_export is_goal inner outer = |
681 |
map (Assumption.export is_goal inner outer) #> |
|
682 |
Variable.export inner outer; |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
683 |
|
20310 | 684 |
val goal_export = common_export true; |
685 |
val export = common_export false; |
|
12704 | 686 |
|
21531 | 687 |
fun export_morphism inner outer = |
688 |
Assumption.export_morphism inner outer $> |
|
689 |
Variable.export_morphism inner outer; |
|
690 |
||
691 |
||
15758
07e382399a96
binds/thms: do not store options, but delete from table;
wenzelm
parents:
15750
diff
changeset
|
692 |
|
5819 | 693 |
(** bindings **) |
694 |
||
8096 | 695 |
(* simult_matches *) |
696 |
||
19867 | 697 |
fun simult_matches ctxt (t, pats) = |
698 |
(case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of |
|
699 |
NONE => error "Pattern match failed!" |
|
700 |
| SOME (env, _) => map (apsnd snd) (Envir.alist_of env)); |
|
8096 | 701 |
|
702 |
||
703 |
(* add_binds(_i) *) |
|
5819 | 704 |
|
7925 | 705 |
local |
706 |
||
16031
fbf3471214d6
moved everything related to thms_containing to find_theorems.ML;
wenzelm
parents:
15979
diff
changeset
|
707 |
fun gen_bind prep (xi as (x, _), raw_t) ctxt = |
24511
69d270cc7e4f
removed obsolete read/cert variations (cf. Syntax.read/check);
wenzelm
parents:
24505
diff
changeset
|
708 |
ctxt |
24675
2be1253a20d3
removed obsolete set_expand_abbrevs (superceded by mode_abbrev);
wenzelm
parents:
24612
diff
changeset
|
709 |
|> Variable.add_binds [(xi, Option.map (prep (set_mode mode_default ctxt)) raw_t)]; |
5819 | 710 |
|
10810 | 711 |
in |
712 |
||
20330 | 713 |
fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b |
10554 | 714 |
| drop_schematic b = b; |
715 |
||
24511
69d270cc7e4f
removed obsolete read/cert variations (cf. Syntax.read/check);
wenzelm
parents:
24505
diff
changeset
|
716 |
val add_binds = fold (gen_bind Syntax.read_term); |
16031
fbf3471214d6
moved everything related to thms_containing to find_theorems.ML;
wenzelm
parents:
15979
diff
changeset
|
717 |
val add_binds_i = fold (gen_bind cert_term); |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
718 |
|
16458 | 719 |
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts)); |
12147 | 720 |
val auto_bind_goal = auto_bind AutoBind.goal; |
721 |
val auto_bind_facts = auto_bind AutoBind.facts; |
|
7925 | 722 |
|
723 |
end; |
|
5819 | 724 |
|
725 |
||
8096 | 726 |
(* match_bind(_i) *) |
5819 | 727 |
|
8096 | 728 |
local |
729 |
||
24684 | 730 |
fun gen_bind prep_terms gen raw_binds ctxt = |
5819 | 731 |
let |
24684 | 732 |
fun prep_bind (raw_pats, t) ctxt1 = |
733 |
let |
|
734 |
val T = Term.fastype_of t; |
|
735 |
val ctxt2 = Variable.declare_term t ctxt1; |
|
736 |
val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats; |
|
737 |
val binds = simult_matches ctxt2 (t, pats); |
|
738 |
in (binds, ctxt2) end; |
|
7670 | 739 |
|
24686 | 740 |
val ts = prep_terms ctxt dummyT (map snd raw_binds); |
741 |
val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt); |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
742 |
val binds' = |
19916
3bbb9cc5d4f1
export: simultaneous facts, refer to Variable.export;
wenzelm
parents:
19897
diff
changeset
|
743 |
if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds) |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
744 |
else binds; |
15531 | 745 |
val binds'' = map (apsnd SOME) binds'; |
18310 | 746 |
val ctxt'' = |
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
747 |
tap (Variable.warn_extra_tfrees ctxt) |
18310 | 748 |
(if gen then |
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
749 |
ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> add_binds_i binds'' |
18310 | 750 |
else ctxt' |> add_binds_i binds''); |
751 |
in (ts, ctxt'') end; |
|
8096 | 752 |
|
753 |
in |
|
5935 | 754 |
|
24684 | 755 |
fun read_terms ctxt T = |
756 |
map (Syntax.parse_term ctxt #> TypeInfer.constrain T) #> Syntax.check_terms ctxt; |
|
757 |
||
758 |
val match_bind = gen_bind read_terms; |
|
759 |
val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt)); |
|
8096 | 760 |
|
761 |
end; |
|
5935 | 762 |
|
763 |
||
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
764 |
(* propositions with patterns *) |
5935 | 765 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
766 |
local |
8096 | 767 |
|
24684 | 768 |
fun prep_propp mode prep_props (context, args) = |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
769 |
let |
19585 | 770 |
fun prep (_, raw_pats) (ctxt, prop :: props) = |
24684 | 771 |
let val ctxt' = Variable.declare_term prop ctxt |
772 |
in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end; |
|
773 |
||
17860
b4cf247ea0d2
note_thmss, read/cert_vars etc.: natural argument order;
wenzelm
parents:
17756
diff
changeset
|
774 |
val (propp, (context', _)) = (fold_map o fold_map) prep args |
24684 | 775 |
(context, prep_props (set_mode mode context) (maps (map fst) args)); |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
776 |
in (context', propp) end; |
5935 | 777 |
|
24684 | 778 |
fun gen_bind_propp mode parse_prop (ctxt, raw_args) = |
8096 | 779 |
let |
24684 | 780 |
val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args); |
19585 | 781 |
val binds = flat (flat (map (map (simult_matches ctxt')) args)); |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
782 |
val propss = map (map #1) args; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
783 |
|
10554 | 784 |
(*generalize result: context evaluated now, binds added later*) |
19916
3bbb9cc5d4f1
export: simultaneous facts, refer to Variable.export;
wenzelm
parents:
19897
diff
changeset
|
785 |
val gen = Variable.exportT_terms ctxt' ctxt; |
15531 | 786 |
fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds))); |
787 |
in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end; |
|
8096 | 788 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
789 |
in |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
790 |
|
24684 | 791 |
val read_propp = prep_propp mode_default Syntax.read_props; |
792 |
val cert_propp = prep_propp mode_default (map o cert_prop); |
|
793 |
val read_propp_schematic = prep_propp mode_schematic Syntax.read_props; |
|
794 |
val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop); |
|
10554 | 795 |
|
24684 | 796 |
val bind_propp = gen_bind_propp mode_default Syntax.read_props; |
797 |
val bind_propp_i = gen_bind_propp mode_default (map o cert_prop); |
|
798 |
val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props; |
|
799 |
val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop); |
|
6789 | 800 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
801 |
end; |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
802 |
|
6789 | 803 |
|
5819 | 804 |
|
805 |
(** theorems **) |
|
806 |
||
18042 | 807 |
(* fact_tac *) |
808 |
||
18122 | 809 |
fun comp_incr_tac [] _ st = no_tac st |
810 |
| comp_incr_tac (th :: ths) i st = |
|
811 |
(Goal.compose_hhf_tac (Drule.incr_indexes st th) i APPEND comp_incr_tac ths i) st; |
|
18042 | 812 |
|
21687 | 813 |
fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts; |
18122 | 814 |
|
815 |
fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => |
|
26284 | 816 |
fact_tac (Facts.could_unify (facts_of ctxt) (Term.strip_all_body goal)) i); |
18042 | 817 |
|
818 |
||
6091 | 819 |
(* get_thm(s) *) |
5819 | 820 |
|
26361 | 821 |
local |
822 |
||
26687 | 823 |
fun retrieve_thms pick ctxt (Facts.Fact s) = |
16501 | 824 |
let |
24511
69d270cc7e4f
removed obsolete read/cert variations (cf. Syntax.read/check);
wenzelm
parents:
24505
diff
changeset
|
825 |
val prop = Syntax.read_prop (set_mode mode_default ctxt) s |
69d270cc7e4f
removed obsolete read/cert variations (cf. Syntax.read/check);
wenzelm
parents:
24505
diff
changeset
|
826 |
|> singleton (Variable.polymorphic ctxt); |
69d270cc7e4f
removed obsolete read/cert variations (cf. Syntax.read/check);
wenzelm
parents:
24505
diff
changeset
|
827 |
val th = Goal.prove ctxt [] [] prop (K (ALLGOALS (some_fact_tac ctxt))) |
18678 | 828 |
handle ERROR msg => cat_error msg "Failed to retrieve literal fact."; |
18042 | 829 |
in pick "" [th] end |
26687 | 830 |
| retrieve_thms pick ctxt xthmref = |
18042 | 831 |
let |
832 |
val thy = theory_of ctxt; |
|
26284 | 833 |
val local_facts = facts_of ctxt; |
26673 | 834 |
val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref; |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26321
diff
changeset
|
835 |
val name = Facts.name_of_ref thmref; |
24012 | 836 |
val thms = |
837 |
if name = "" then [Thm.transfer thy Drule.dummy_thm] |
|
838 |
else |
|
26393 | 839 |
(case Facts.lookup (Context.Proof ctxt) local_facts name of |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26321
diff
changeset
|
840 |
SOME ths => map (Thm.transfer thy) (Facts.select thmref ths) |
26687 | 841 |
| NONE => PureThy.get_fact (Context.Proof ctxt) thy xthmref); |
24012 | 842 |
in pick name thms end; |
5819 | 843 |
|
26361 | 844 |
in |
26346
17debd2fff8e
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
845 |
|
26687 | 846 |
val get_fact = retrieve_thms (K I); |
847 |
val get_fact_single = retrieve_thms Facts.the_single; |
|
26346
17debd2fff8e
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
848 |
|
26361 | 849 |
fun get_thms ctxt = get_fact ctxt o Facts.named; |
850 |
fun get_thm ctxt = get_fact_single ctxt o Facts.named; |
|
851 |
||
852 |
end; |
|
5819 | 853 |
|
854 |
||
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
855 |
(* name space operations *) |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
856 |
|
22352 | 857 |
val add_path = map_naming o NameSpace.add_path; |
19062
0fd52e819c24
replaced qualified_force_prefix to sticky_prefix;
wenzelm
parents:
19033
diff
changeset
|
858 |
val no_base_names = map_naming NameSpace.no_base_names; |
16147 | 859 |
val qualified_names = map_naming NameSpace.qualified_names; |
19062
0fd52e819c24
replaced qualified_force_prefix to sticky_prefix;
wenzelm
parents:
19033
diff
changeset
|
860 |
val sticky_prefix = map_naming o NameSpace.sticky_prefix; |
0fd52e819c24
replaced qualified_force_prefix to sticky_prefix;
wenzelm
parents:
19033
diff
changeset
|
861 |
val restore_naming = map_naming o K o naming_of; |
21728 | 862 |
val reset_naming = map_naming (K local_naming); |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
863 |
|
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
864 |
|
26284 | 865 |
(* facts *) |
5819 | 866 |
|
26284 | 867 |
fun update_thms _ (bname, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt bname)) |
868 |
| update_thms do_props (bname, SOME ths) ctxt = ctxt |> map_facts |
|
26309 | 869 |
(Facts.add_local do_props (naming_of ctxt) (full_name ctxt bname, ths)); |
5819 | 870 |
|
26250 | 871 |
fun put_thms do_props thms ctxt = |
26284 | 872 |
ctxt |> map_naming (K local_naming) |> update_thms do_props thms |> restore_naming ctxt; |
5819 | 873 |
|
12711 | 874 |
local |
16147 | 875 |
|
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
876 |
fun gen_note_thmss get k = fold_map (fn ((bname, more_attrs), raw_facts) => fn ctxt => |
5819 | 877 |
let |
21643
bdf3e74727df
note_thmss: added kind tag and non-official name;
wenzelm
parents:
21622
diff
changeset
|
878 |
val name = full_name ctxt bname; |
bdf3e74727df
note_thmss: added kind tag and non-official name;
wenzelm
parents:
21622
diff
changeset
|
879 |
val facts = PureThy.name_thmss false name (map (apfst (get ctxt)) raw_facts); |
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
880 |
fun app (th, attrs) x = |
21643
bdf3e74727df
note_thmss: added kind tag and non-official name;
wenzelm
parents:
21622
diff
changeset
|
881 |
swap (foldl_map (Thm.proof_attributes (attrs @ more_attrs @ [PureThy.kind k])) (x, th)); |
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
882 |
val (res, ctxt') = fold_map app facts ctxt; |
21643
bdf3e74727df
note_thmss: added kind tag and non-official name;
wenzelm
parents:
21622
diff
changeset
|
883 |
val thms = PureThy.name_thms false false name (flat res); |
24388
cf24894b81ff
added inner syntax mode, includes former type_mode and is_stmt;
wenzelm
parents:
24371
diff
changeset
|
884 |
val Mode {stmt, ...} = get_mode ctxt; |
26284 | 885 |
in ((bname, thms), ctxt' |> update_thms stmt (bname, SOME thms)) end); |
12711 | 886 |
|
887 |
in |
|
888 |
||
26346
17debd2fff8e
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
889 |
fun note_thmss k = gen_note_thmss get_fact k; |
21622 | 890 |
fun note_thmss_i k = gen_note_thmss (K I) k; |
15696 | 891 |
|
12711 | 892 |
end; |
9196 | 893 |
|
5819 | 894 |
|
895 |
||
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
896 |
(** parameters **) |
17360
fa1f262dbc4e
added add_view, export_view (supercedes adhoc view arguments);
wenzelm
parents:
17221
diff
changeset
|
897 |
|
8096 | 898 |
(* variables *) |
899 |
||
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
900 |
fun declare_var (x, opt_T, mx) ctxt = |
22701 | 901 |
let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx) |
20163 | 902 |
in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end; |
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
903 |
|
10381 | 904 |
local |
905 |
||
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
906 |
fun prep_vars prep_typ internal = |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
907 |
fold_map (fn (raw_x, raw_T, raw_mx) => fn ctxt => |
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
908 |
let |
19371 | 909 |
val (x, mx) = Syntax.const_mixfix raw_x raw_mx; |
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
910 |
val _ = Syntax.is_identifier (no_skolem internal x) orelse |
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
911 |
error ("Illegal variable name: " ^ quote x); |
12504 | 912 |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
913 |
fun cond_tvars T = |
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
914 |
if internal then T |
18678 | 915 |
else Type.no_tvars T handle TYPE (msg, _, _) => error msg; |
24277 | 916 |
val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T; |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
917 |
val var = (x, opt_T, mx); |
19001 | 918 |
in (var, ctxt |> declare_var var |> #2) end); |
8096 | 919 |
|
10381 | 920 |
in |
921 |
||
25353
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
922 |
val read_vars = prep_vars Syntax.parse_typ false; |
17f04d987f37
removed unused read_termTs_schematic, read/cert_vars_legacy, add_fixes_legacy;
wenzelm
parents:
25345
diff
changeset
|
923 |
val cert_vars = prep_vars (K I) true; |
8096 | 924 |
|
10381 | 925 |
end; |
926 |
||
8096 | 927 |
|
19681 | 928 |
(* authentic constants *) |
19663 | 929 |
|
25159
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
930 |
local |
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
931 |
|
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
932 |
fun const_ast_tr intern ctxt [Syntax.Variable c] = |
19681 | 933 |
let |
25345
dd5b851f8ef0
renamed ProofContext.read_const' to ProofContext.read_const_proper;
wenzelm
parents:
25332
diff
changeset
|
934 |
val Const (c', _) = read_const_proper ctxt c; |
25159
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
935 |
val d = if intern then const_syntax_name ctxt c' else c; |
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
936 |
in Syntax.Constant d end |
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
937 |
| const_ast_tr _ _ asts = raise Syntax.AST ("const_ast_tr", asts); |
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
938 |
|
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
939 |
in |
19681 | 940 |
|
26463 | 941 |
val _ = Context.>> (Context.map_theory |
19681 | 942 |
(Sign.add_syntax |
943 |
[("_context_const", "id => 'a", Delimfix "CONST _"), |
|
25159
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
944 |
("_context_const", "longid => 'a", Delimfix "CONST _"), |
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
945 |
("_context_xconst", "id => 'a", Delimfix "XCONST _"), |
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
946 |
("_context_xconst", "longid => 'a", Delimfix "XCONST _")] #> |
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
947 |
Sign.add_advanced_trfuns |
26463 | 948 |
([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], []))); |
25159
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
949 |
|
1822da5446bc
added XCONST syntax (keeps original spelling of const);
wenzelm
parents:
25133
diff
changeset
|
950 |
end; |
19681 | 951 |
|
19663 | 952 |
|
21744 | 953 |
(* notation *) |
954 |
||
24949 | 955 |
local |
956 |
||
957 |
fun const_syntax ctxt (Free (x, T), mx) = SOME (true, (x, T, mx)) |
|
958 |
| const_syntax ctxt (Const (c, _), mx) = |
|
959 |
Option.map (pair false) (try (Consts.syntax (consts_of ctxt)) (c, mx)) |
|
960 |
| const_syntax _ _ = NONE; |
|
961 |
||
962 |
in |
|
21744 | 963 |
|
24949 | 964 |
fun notation add mode args ctxt = |
965 |
ctxt |> map_syntax |
|
966 |
(LocalSyntax.update_modesyntax (theory_of ctxt) add mode (map_filter (const_syntax ctxt) args)); |
|
967 |
||
968 |
fun target_notation add mode args phi = |
|
24982 | 969 |
let val args' = filter (fn (t, _) => Type.similar_types (t, Morphism.term phi t)) args; |
24949 | 970 |
in Context.mapping (Sign.notation add mode args') (notation add mode args') end; |
971 |
||
972 |
end; |
|
21744 | 973 |
|
974 |
||
24767 | 975 |
(* local constants *) |
976 |
||
977 |
fun add_const_constraint (c, opt_T) ctxt = |
|
978 |
let |
|
979 |
fun prepT raw_T = |
|
980 |
let val T = cert_typ ctxt raw_T |
|
981 |
in cert_term ctxt (Const (c, T)); T end; |
|
25039 | 982 |
in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end; |
19001 | 983 |
|
24778 | 984 |
fun add_abbrev mode tags (c, raw_t) ctxt = |
19001 | 985 |
let |
24675
2be1253a20d3
removed obsolete set_expand_abbrevs (superceded by mode_abbrev);
wenzelm
parents:
24612
diff
changeset
|
986 |
val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t |
21681 | 987 |
handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c); |
20008
8d9d770e1f06
add_abbrevs/polymorphic: Variable.exportT_terms avoids over-generalization;
wenzelm
parents:
19916
diff
changeset
|
988 |
val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0]; |
21807
a59f083632a7
add_abbrev: removed Assumption.add_assms (danger of inconsistent naming);
wenzelm
parents:
21803
diff
changeset
|
989 |
val ((lhs, rhs), consts') = consts_of ctxt |
24961 | 990 |
|> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode tags (c, t); |
19001 | 991 |
in |
992 |
ctxt |
|
25039 | 993 |
|> (map_consts o apfst) (K consts') |
21803 | 994 |
|> Variable.declare_term rhs |
995 |
|> pair (lhs, rhs) |
|
21704 | 996 |
end; |
19001 | 997 |
|
25052 | 998 |
fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c); |
999 |
||
19001 | 1000 |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1001 |
(* fixes *) |
5819 | 1002 |
|
8096 | 1003 |
local |
1004 |
||
19001 | 1005 |
fun prep_mixfix (x, T, mx) = |
19019 | 1006 |
if mx <> NoSyn andalso mx <> Structure andalso |
20086
94ca946fb689
adapted to more efficient Name/Variable implementation;
wenzelm
parents:
20049
diff
changeset
|
1007 |
(can Name.dest_internal x orelse can Name.dest_skolem x) then |
19001 | 1008 |
error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x) |
1009 |
else (true, (x, T, mx)); |
|
1010 |
||
18844 | 1011 |
fun gen_fixes prep raw_vars ctxt = |
8096 | 1012 |
let |
22712 | 1013 |
val (vars, _) = prep raw_vars ctxt; |
1014 |
val (xs', ctxt') = Variable.add_fixes (map #1 vars) ctxt; |
|
8096 | 1015 |
in |
22712 | 1016 |
ctxt' |
19001 | 1017 |
|> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars) |
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
1018 |
|-> (map_syntax o LocalSyntax.add_syntax (theory_of ctxt) o map prep_mixfix) |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1019 |
|> pair xs' |
8096 | 1020 |
end; |
5819 | 1021 |
|
8096 | 1022 |
in |
7679 | 1023 |
|
18844 | 1024 |
val add_fixes = gen_fixes read_vars; |
1025 |
val add_fixes_i = gen_fixes cert_vars; |
|
8096 | 1026 |
|
1027 |
end; |
|
5819 | 1028 |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1029 |
|
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1030 |
(* fixes vs. frees *) |
12016 | 1031 |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1032 |
fun auto_fixes (arg as (ctxt, (propss, x))) = |
21370
d9dd7b4e5e69
replaced Variable.fix_frees by Variable.auto_fixes (depends on body mode);
wenzelm
parents:
21269
diff
changeset
|
1033 |
((fold o fold) Variable.auto_fixes propss ctxt, (propss, x)); |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1034 |
|
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1035 |
fun bind_fixes xs ctxt = |
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1036 |
let |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1037 |
val (_, ctxt') = ctxt |> add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs); |
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1038 |
fun bind (t as Free (x, T)) = |
18340 | 1039 |
if member (op =) xs x then |
15531 | 1040 |
(case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t) |
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1041 |
else t |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1042 |
| bind (t $ u) = bind t $ bind u |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1043 |
| bind (Abs (x, T, t)) = Abs (x, T, bind t) |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1044 |
| bind a = a; |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1045 |
in (bind, ctxt') end; |
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1046 |
|
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1047 |
|
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1048 |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1049 |
(** assumptions **) |
18187 | 1050 |
|
20209 | 1051 |
local |
1052 |
||
1053 |
fun gen_assms prepp exp args ctxt = |
|
1054 |
let |
|
20234
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
1055 |
val cert = Thm.cterm_of (theory_of ctxt); |
20209 | 1056 |
val (propss, ctxt1) = swap (prepp (ctxt, map snd args)); |
20234
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
1057 |
val _ = Variable.warn_extra_tfrees ctxt ctxt1; |
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
1058 |
val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1; |
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
1059 |
in |
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
1060 |
ctxt2 |
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
1061 |
|> auto_bind_facts (flat propss) |
21443
cc5095d57da4
added stmt mode, which affects naming/indexing of local facts;
wenzelm
parents:
21370
diff
changeset
|
1062 |
|> note_thmss_i Thm.assumptionK (map fst args ~~ map (map (fn th => ([th], []))) premss) |
20234
7e0693474bcd
added legacy_pretty_thm (with fall-back on ProtoPure.thy);
wenzelm
parents:
20209
diff
changeset
|
1063 |
end; |
20209 | 1064 |
|
1065 |
in |
|
1066 |
||
1067 |
val add_assms = gen_assms (apsnd #1 o bind_propp); |
|
1068 |
val add_assms_i = gen_assms (apsnd #1 o bind_propp_i); |
|
1069 |
||
1070 |
end; |
|
1071 |
||
1072 |
||
5819 | 1073 |
|
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1074 |
(** cases **) |
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1075 |
|
16147 | 1076 |
local |
1077 |
||
16668 | 1078 |
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name; |
16147 | 1079 |
|
18476 | 1080 |
fun add_case _ ("", _) cases = cases |
1081 |
| add_case _ (name, NONE) cases = rem_case name cases |
|
1082 |
| add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases; |
|
16147 | 1083 |
|
18678 | 1084 |
fun prep_case name fxs c = |
18609 | 1085 |
let |
1086 |
fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys |
|
1087 |
| replace [] ys = ys |
|
18678 | 1088 |
| replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name); |
18609 | 1089 |
val RuleCases.Case {fixes, assumes, binds, cases} = c; |
1090 |
val fixes' = replace fxs fixes; |
|
1091 |
val binds' = map drop_schematic binds; |
|
1092 |
in |
|
1093 |
if null (fold (Term.add_tvarsT o snd) fixes []) andalso |
|
1094 |
null (fold (fold Term.add_vars o snd) assumes []) then |
|
1095 |
RuleCases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases} |
|
18678 | 1096 |
else error ("Illegal schematic variable(s) in case " ^ quote name) |
18609 | 1097 |
end; |
1098 |
||
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1099 |
fun fix (x, T) ctxt = |
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1100 |
let |
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1101 |
val (bind, ctxt') = bind_fixes [x] ctxt; |
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1102 |
val t = bind (Free (x, T)); |
20163 | 1103 |
in (t, ctxt' |> Variable.declare_constraints t) end; |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1104 |
|
16147 | 1105 |
in |
1106 |
||
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1107 |
fun add_cases is_proper = map_cases o fold (add_case is_proper); |
18609 | 1108 |
|
1109 |
fun case_result c ctxt = |
|
1110 |
let |
|
1111 |
val RuleCases.Case {fixes, ...} = c; |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1112 |
val (ts, ctxt') = ctxt |> fold_map fix fixes; |
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1113 |
val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c; |
18609 | 1114 |
in |
1115 |
ctxt' |
|
18699
f3bfe81b6e58
case_result: drop_schematic, i.e. be permissive about illegal binds;
wenzelm
parents:
18678
diff
changeset
|
1116 |
|> add_binds_i (map drop_schematic binds) |
18609 | 1117 |
|> add_cases true (map (apsnd SOME) cases) |
1118 |
|> pair (assumes, (binds, cases)) |
|
1119 |
end; |
|
1120 |
||
1121 |
val apply_case = apfst fst oo case_result; |
|
1122 |
||
16540 | 1123 |
fun get_case ctxt name xs = |
17184 | 1124 |
(case AList.lookup (op =) (cases_of ctxt) name of |
18678 | 1125 |
NONE => error ("Unknown case: " ^ quote name) |
1126 |
| SOME (c, _) => prep_case name xs c); |
|
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1127 |
|
16147 | 1128 |
end; |
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1129 |
|
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1130 |
|
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1131 |
|
10810 | 1132 |
(** print context information **) |
1133 |
||
20310 | 1134 |
val debug = ref false; |
1135 |
||
10810 | 1136 |
val verbose = ref false; |
1137 |
fun verb f x = if ! verbose then f (x ()) else []; |
|
1138 |
||
1139 |
fun setmp_verbose f x = Library.setmp verbose true f x; |
|
1140 |
||
1141 |
||
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1142 |
(* local syntax *) |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1143 |
|
12093 | 1144 |
val print_syntax = Syntax.print_syntax o syn_of; |
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1145 |
|
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1146 |
|
21728 | 1147 |
(* abbreviations *) |
18971 | 1148 |
|
21728 | 1149 |
fun pretty_abbrevs show_globals ctxt = |
18971 | 1150 |
let |
25052 | 1151 |
val ((space, consts), (_, globals)) = |
19033
24e251657e56
consts: maintain thy version for efficient transfer;
wenzelm
parents:
19019
diff
changeset
|
1152 |
pairself (#constants o Consts.dest) (#consts (rep_context ctxt)); |
21803 | 1153 |
fun add_abbr (_, (_, NONE)) = I |
25406 | 1154 |
| add_abbr (c, (T, SOME t)) = |
21728 | 1155 |
if not show_globals andalso Symtab.defined globals c then I |
1156 |
else cons (c, Logic.mk_equals (Const (c, T), t)); |
|
21803 | 1157 |
val abbrevs = NameSpace.extern_table (space, Symtab.make (Symtab.fold add_abbr consts [])); |
18971 | 1158 |
in |
1159 |
if null abbrevs andalso not (! verbose) then [] |
|
21728 | 1160 |
else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)] |
18971 | 1161 |
end; |
1162 |
||
21728 | 1163 |
val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true; |
1164 |
||
18971 | 1165 |
|
10810 | 1166 |
(* term bindings *) |
1167 |
||
16540 | 1168 |
fun pretty_binds ctxt = |
10810 | 1169 |
let |
19897
fe661eb3b0e7
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19882
diff
changeset
|
1170 |
val binds = Variable.binds_of ctxt; |
21728 | 1171 |
fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t)); |
10810 | 1172 |
in |
15758
07e382399a96
binds/thms: do not store options, but delete from table;
wenzelm
parents:
15750
diff
changeset
|
1173 |
if Vartab.is_empty binds andalso not (! verbose) then [] |
07e382399a96
binds/thms: do not store options, but delete from table;
wenzelm
parents:
15750
diff
changeset
|
1174 |
else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))] |
10810 | 1175 |
end; |
1176 |
||
1177 |
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds; |
|
1178 |
||
1179 |
||
1180 |
(* local theorems *) |
|
1181 |
||
16540 | 1182 |
fun pretty_lthms ctxt = |
20012 | 1183 |
let |
26284 | 1184 |
val local_facts = facts_of ctxt; |
1185 |
val props = Facts.props local_facts; |
|
26673 | 1186 |
val facts = |
26695 | 1187 |
(if null props then [] else [("unnamed", props)]) @ Facts.extern_static local_facts; |
20012 | 1188 |
in |
1189 |
if null facts andalso not (! verbose) then [] |
|
1190 |
else [Pretty.big_list "facts:" (map (pretty_fact ctxt) facts)] |
|
1191 |
end; |
|
10810 | 1192 |
|
12057 | 1193 |
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms; |
10810 | 1194 |
|
1195 |
||
1196 |
(* local contexts *) |
|
1197 |
||
26722 | 1198 |
local |
1199 |
||
1200 |
fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) = |
|
10810 | 1201 |
let |
24922 | 1202 |
val prt_term = Syntax.pretty_term ctxt; |
12057 | 1203 |
|
10810 | 1204 |
fun prt_let (xi, t) = Pretty.block |
10818 | 1205 |
[Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1, |
10810 | 1206 |
Pretty.quote (prt_term t)]; |
1207 |
||
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1208 |
fun prt_asm (a, ts) = Pretty.block (Pretty.breaks |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1209 |
((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts)); |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1210 |
|
10810 | 1211 |
fun prt_sect _ _ _ [] = [] |
1212 |
| prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s :: |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19422
diff
changeset
|
1213 |
flat (Library.separate sep (map (Library.single o prt) xs))))]; |
26722 | 1214 |
in |
1215 |
Pretty.block (Pretty.fbreaks |
|
10810 | 1216 |
(Pretty.str (name ^ ":") :: |
11915 | 1217 |
prt_sect "fix" [] (Pretty.str o fst) fixes @ |
10810 | 1218 |
prt_sect "let" [Pretty.str "and"] prt_let |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19422
diff
changeset
|
1219 |
(map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @ |
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1220 |
(if forall (null o #2) asms then [] |
18609 | 1221 |
else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @ |
26722 | 1222 |
prt_sect "subcases:" [] (Pretty.str o fst) cs)) |
1223 |
end; |
|
16540 | 1224 |
|
26722 | 1225 |
in |
1226 |
||
1227 |
fun pretty_cases ctxt = |
|
1228 |
let |
|
18476 | 1229 |
fun add_case (_, (_, false)) = I |
18609 | 1230 |
| add_case (name, (c as RuleCases.Case {fixes, ...}, true)) = |
26722 | 1231 |
cons (name, (fixes, case_result c ctxt)); |
18476 | 1232 |
val cases = fold add_case (cases_of ctxt) []; |
10810 | 1233 |
in |
1234 |
if null cases andalso not (! verbose) then [] |
|
26722 | 1235 |
else [Pretty.big_list "cases:" (map pretty_case cases)] |
10810 | 1236 |
end; |
1237 |
||
1238 |
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases; |
|
1239 |
||
26722 | 1240 |
end; |
1241 |
||
10810 | 1242 |
|
12057 | 1243 |
(* core context *) |
10810 | 1244 |
|
20367 | 1245 |
val prems_limit = ref ~1; |
10810 | 1246 |
|
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1247 |
fun pretty_ctxt ctxt = |
20310 | 1248 |
if ! prems_limit < 0 andalso not (! debug) then [] |
1249 |
else |
|
1250 |
let |
|
24922 | 1251 |
val prt_term = Syntax.pretty_term ctxt; |
12057 | 1252 |
|
20310 | 1253 |
(*structures*) |
1254 |
val structs = LocalSyntax.structs_of (syntax_of ctxt); |
|
1255 |
val prt_structs = if null structs then [] |
|
1256 |
else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 :: |
|
1257 |
Pretty.commas (map Pretty.str structs))]; |
|
12093 | 1258 |
|
20310 | 1259 |
(*fixes*) |
1260 |
fun prt_fix (x, x') = |
|
1261 |
if x = x' then Pretty.str x |
|
1262 |
else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')]; |
|
1263 |
val fixes = |
|
1264 |
rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1) |
|
1265 |
(Variable.fixes_of ctxt)); |
|
1266 |
val prt_fixes = if null fixes then [] |
|
1267 |
else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 :: |
|
1268 |
Pretty.commas (map prt_fix fixes))]; |
|
12057 | 1269 |
|
20310 | 1270 |
(*prems*) |
1271 |
val prems = Assumption.prems_of ctxt; |
|
1272 |
val len = length prems; |
|
20367 | 1273 |
val suppressed = len - ! prems_limit; |
20310 | 1274 |
val prt_prems = if null prems then [] |
20367 | 1275 |
else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @ |
1276 |
map (pretty_thm ctxt) (Library.drop (suppressed, prems)))]; |
|
20310 | 1277 |
in prt_structs @ prt_fixes @ prt_prems end; |
10810 | 1278 |
|
1279 |
||
1280 |
(* main context *) |
|
1281 |
||
16540 | 1282 |
fun pretty_context ctxt = |
10810 | 1283 |
let |
24922 | 1284 |
val prt_term = Syntax.pretty_term ctxt; |
1285 |
val prt_typ = Syntax.pretty_typ ctxt; |
|
1286 |
val prt_sort = Syntax.pretty_sort ctxt; |
|
10810 | 1287 |
|
1288 |
(*theory*) |
|
12057 | 1289 |
val pretty_thy = Pretty.block |
17384 | 1290 |
[Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)]; |
10810 | 1291 |
|
1292 |
(*defaults*) |
|
1293 |
fun prt_atom prt prtT (x, X) = Pretty.block |
|
1294 |
[prt x, Pretty.str " ::", Pretty.brk 1, prtT X]; |
|
1295 |
||
1296 |
fun prt_var (x, ~1) = prt_term (Syntax.free x) |
|
1297 |
| prt_var xi = prt_term (Syntax.var xi); |
|
1298 |
||
1299 |
fun prt_varT (x, ~1) = prt_typ (TFree (x, [])) |
|
1300 |
| prt_varT xi = prt_typ (TVar (xi, [])); |
|
1301 |
||
1302 |
val prt_defT = prt_atom prt_var prt_typ; |
|
1303 |
val prt_defS = prt_atom prt_varT prt_sort; |
|
16540 | 1304 |
|
20163 | 1305 |
val (types, sorts) = Variable.constraints_of ctxt; |
10810 | 1306 |
in |
18609 | 1307 |
verb single (K pretty_thy) @ |
18672
ac1a048ca7dd
uniform handling of fixes: read/cert_vars, add_fixes(_i), body flag;
wenzelm
parents:
18619
diff
changeset
|
1308 |
pretty_ctxt ctxt @ |
21728 | 1309 |
verb (pretty_abbrevs false) (K ctxt) @ |
10810 | 1310 |
verb pretty_binds (K ctxt) @ |
12057 | 1311 |
verb pretty_lthms (K ctxt) @ |
10810 | 1312 |
verb pretty_cases (K ctxt) @ |
18609 | 1313 |
verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @ |
20163 | 1314 |
verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) |
10810 | 1315 |
end; |
1316 |
||
5819 | 1317 |
end; |