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