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