author | kleing |
Mon, 21 Jun 2004 10:25:57 +0200 | |
changeset 14981 | e73f8140af78 |
parent 14974 | b1ecb7859c99 |
child 15452 | e2a721567f67 |
permissions | -rw-r--r-- |
5819 | 1 |
(* Title: Pure/Isar/proof_context.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
5 |
Proof context information. |
|
6 |
*) |
|
7 |
||
14707 | 8 |
val show_structs = ref false; |
9 |
||
5819 | 10 |
signature PROOF_CONTEXT = |
11 |
sig |
|
12 |
type context |
|
9470 | 13 |
type exporter |
5819 | 14 |
exception CONTEXT of string * context |
15 |
val theory_of: context -> theory |
|
16 |
val sign_of: context -> Sign.sg |
|
14828 | 17 |
val is_fixed: context -> string -> bool |
12057 | 18 |
val fixed_names_of: context -> string list |
19 |
val assumptions_of: context -> (cterm list * exporter) list |
|
7557 | 20 |
val prems_of: context -> thm list |
5819 | 21 |
val print_proof_data: theory -> unit |
5874 | 22 |
val init: theory -> context |
14828 | 23 |
val pretty_term: context -> term -> Pretty.T |
24 |
val pretty_typ: context -> typ -> Pretty.T |
|
25 |
val pretty_sort: context -> sort -> Pretty.T |
|
26 |
val pp: context -> Pretty.pp |
|
27 |
val pretty_thm: context -> thm -> Pretty.T |
|
28 |
val pretty_thms: context -> thm list -> Pretty.T |
|
29 |
val pretty_fact: context -> string * thm list -> Pretty.T |
|
30 |
val string_of_term: context -> term -> string |
|
12414 | 31 |
val default_type: context -> string -> typ option |
12504 | 32 |
val used_types: context -> string list |
5819 | 33 |
val read_typ: context -> string -> typ |
14780 | 34 |
val read_typ_raw: context -> string -> typ |
5819 | 35 |
val cert_typ: context -> typ -> typ |
14780 | 36 |
val cert_typ_raw: context -> typ -> typ |
10583 | 37 |
val get_skolem: context -> string -> string |
9133 | 38 |
val extern_skolem: context -> term -> term |
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
39 |
val read_termTs: context -> (string -> bool) -> (indexname -> typ option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
40 |
-> (indexname -> sort option) -> string list -> (string * typ) list |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
41 |
-> term list * (indexname * typ) list |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
42 |
val read_termTs_schematic: context -> (string -> bool) -> (indexname -> typ option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
43 |
-> (indexname -> sort option) -> string list -> (string * typ) list |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
44 |
-> term list * (indexname * typ) list |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
45 |
val read_term_liberal: context -> string -> term |
5819 | 46 |
val read_term: context -> string -> term |
47 |
val read_prop: context -> string -> term |
|
11925 | 48 |
val read_prop_schematic: context -> string -> term |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
49 |
val read_terms: context -> string list -> term list |
8096 | 50 |
val read_term_pats: typ -> context -> string list -> term list |
51 |
val read_prop_pats: context -> string list -> term list |
|
5819 | 52 |
val cert_term: context -> term -> term |
53 |
val cert_prop: context -> term -> term |
|
8096 | 54 |
val cert_term_pats: typ -> context -> term list -> term list |
55 |
val cert_prop_pats: context -> term list -> term list |
|
5819 | 56 |
val declare_term: term -> context -> context |
57 |
val declare_terms: term list -> context -> context |
|
7925 | 58 |
val warn_extra_tfrees: context -> context -> context |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
59 |
val generalize: context -> context -> term list -> term list |
9470 | 60 |
val find_free: term -> string -> term option |
12008 | 61 |
val export: bool -> context -> context -> thm -> thm Seq.seq |
13415 | 62 |
val export_standard: cterm list -> context -> context -> thm -> thm |
10810 | 63 |
val drop_schematic: indexname * term option -> indexname * term option |
64 |
val add_binds: (indexname * string option) list -> context -> context |
|
65 |
val add_binds_i: (indexname * term option) list -> context -> context |
|
12147 | 66 |
val auto_bind_goal: term list -> context -> context |
67 |
val auto_bind_facts: term list -> context -> context |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
68 |
val match_bind: bool -> (string list * string) list -> context -> context |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
69 |
val match_bind_i: bool -> (term list * term) list -> context -> context |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
70 |
val read_propp: context * (string * (string list * string list)) list list |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
71 |
-> context * (term * (term list * term list)) list list |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
72 |
val cert_propp: context * (term * (term list * term list)) list list |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
73 |
-> context * (term * (term list * term list)) list list |
10554 | 74 |
val read_propp_schematic: context * (string * (string list * string list)) list list |
75 |
-> context * (term * (term list * term list)) list list |
|
76 |
val cert_propp_schematic: context * (term * (term list * term list)) list list |
|
77 |
-> context * (term * (term list * term list)) list list |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
78 |
val bind_propp: context * (string * (string list * string list)) list list |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
79 |
-> context * (term list list * (context -> context)) |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
80 |
val bind_propp_i: context * (term * (term list * term list)) list list |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
81 |
-> context * (term list list * (context -> context)) |
10554 | 82 |
val bind_propp_schematic: context * (string * (string list * string list)) list list |
83 |
-> context * (term list list * (context -> context)) |
|
84 |
val bind_propp_schematic_i: context * (term * (term list * term list)) list list |
|
85 |
-> context * (term list list * (context -> context)) |
|
6091 | 86 |
val get_thm: context -> string -> thm |
9566 | 87 |
val get_thm_closure: context -> string -> thm |
6091 | 88 |
val get_thms: context -> string -> thm list |
9566 | 89 |
val get_thms_closure: context -> string -> thm list |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
90 |
val cond_extern: context -> string -> xstring |
13399
c136276dc847
support locale ``views'' (for cumulative predicates);
wenzelm
parents:
13378
diff
changeset
|
91 |
val qualified: bool -> context -> context |
c136276dc847
support locale ``views'' (for cumulative predicates);
wenzelm
parents:
13378
diff
changeset
|
92 |
val restore_qualified: context -> context -> context |
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
93 |
val hide_thms: bool -> string list -> context -> context |
6091 | 94 |
val put_thm: string * thm -> context -> context |
95 |
val put_thms: string * thm list -> context -> context |
|
96 |
val put_thmss: (string * thm list) list -> context -> context |
|
7606 | 97 |
val reset_thms: string -> context -> context |
14564 | 98 |
val note_thmss: |
12711 | 99 |
((bstring * context attribute list) * (xstring * context attribute list) list) list -> |
100 |
context -> context * (bstring * thm list) list |
|
14564 | 101 |
val note_thmss_i: |
12711 | 102 |
((bstring * context attribute list) * (thm list * context attribute list) list) list -> |
103 |
context -> context * (bstring * thm list) list |
|
11918
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
104 |
val export_assume: exporter |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
105 |
val export_presume: exporter |
12086 | 106 |
val cert_def: context -> term -> string * term |
11918
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
107 |
val export_def: exporter |
9470 | 108 |
val assume: exporter |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
109 |
-> ((string * context attribute list) * (string * (string list * string list)) list) list |
12835 | 110 |
-> context -> context * (bstring * thm list) list |
9470 | 111 |
val assume_i: exporter |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
112 |
-> ((string * context attribute list) * (term * (term list * term list)) list) list |
12835 | 113 |
-> context -> context * (bstring * thm list) list |
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
114 |
val read_vars: context * (string list * string option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
115 |
-> context * (string list * typ option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
116 |
val cert_vars: context * (string list * typ option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
117 |
-> context * (string list * typ option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
118 |
val read_vars_liberal: context * (string list * string option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
119 |
-> context * (string list * typ option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
120 |
val cert_vars_liberal: context * (string list * typ option) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
121 |
-> context * (string list * typ option) |
7411 | 122 |
val fix: (string list * string option) list -> context -> context |
7663 | 123 |
val fix_i: (string list * typ option) list -> context -> context |
14643 | 124 |
val add_fixes: (string * typ option * Syntax.mixfix option) list -> context -> context |
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
125 |
val add_fixes_liberal: (string * typ option * Syntax.mixfix option) list -> context -> context |
12016 | 126 |
val fix_frees: term list -> context -> context |
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
127 |
val bind_skolem: context -> string list -> term -> term |
11793
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
128 |
val get_case: context -> string -> string option list -> RuleCases.T |
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
129 |
val add_cases: (string * RuleCases.T) list -> context -> context |
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
130 |
val apply_case: RuleCases.T -> context |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
131 |
-> context * ((indexname * term option) list * (string * term list) list) |
10810 | 132 |
val verbose: bool ref |
133 |
val setmp_verbose: ('a -> 'b) -> 'a -> 'b |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
134 |
val print_syntax: context -> unit |
10810 | 135 |
val print_binds: context -> unit |
12057 | 136 |
val print_lthms: context -> unit |
10810 | 137 |
val print_cases: context -> unit |
138 |
val prems_limit: int ref |
|
12057 | 139 |
val pretty_asms: context -> Pretty.T list |
10810 | 140 |
val pretty_context: context -> Pretty.T list |
13284 | 141 |
val thms_containing_limit: int ref |
142 |
val print_thms_containing: context -> int option -> string list -> unit |
|
5819 | 143 |
val setup: (theory -> theory) list |
144 |
end; |
|
145 |
||
8151 | 146 |
signature PRIVATE_PROOF_CONTEXT = |
5819 | 147 |
sig |
148 |
include PROOF_CONTEXT |
|
149 |
val init_data: Object.kind -> (theory -> Object.T) * (context -> Object.T -> unit) |
|
150 |
-> theory -> theory |
|
151 |
val print_data: Object.kind -> context -> unit |
|
152 |
val get_data: Object.kind -> (Object.T -> 'a) -> context -> 'a |
|
153 |
val put_data: Object.kind -> ('a -> Object.T) -> 'a -> context -> context |
|
154 |
end; |
|
155 |
||
8151 | 156 |
structure ProofContext: PRIVATE_PROOF_CONTEXT = |
5819 | 157 |
struct |
158 |
||
159 |
||
160 |
(** datatype context **) |
|
161 |
||
11816 | 162 |
type exporter = bool -> cterm list -> thm -> thm Seq.seq; |
9470 | 163 |
|
5819 | 164 |
datatype context = |
165 |
Context of |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
166 |
{thy: theory, (*current theory*) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
167 |
syntax: Syntax.syntax * string list * string list, (*syntax with structs and mixfixed*) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
168 |
data: Object.T Symtab.table, (*user data*) |
5819 | 169 |
asms: |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
170 |
((cterm list * exporter) list * (*assumes: A ==> _*) |
14697 | 171 |
(string * thm list) list) * (*prems: A |- A *) |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
172 |
(string * string) list, (*fixes: !!x. _*) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
173 |
binds: (term * typ) option Vartab.table, (*term bindings*) |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
174 |
thms: bool * NameSpace.T * thm list option Symtab.table |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
175 |
* FactIndex.T, (*local thms*) |
14697 | 176 |
(*thms is of the form (q, n, t, i) where |
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14287
diff
changeset
|
177 |
q: indicates whether theorems with qualified names may be stored; |
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14287
diff
changeset
|
178 |
this is initially forbidden (false); flag may be changed with |
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14287
diff
changeset
|
179 |
qualified and restore_qualified; |
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14287
diff
changeset
|
180 |
n: theorem namespace; |
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14287
diff
changeset
|
181 |
t: table of theorems; |
14697 | 182 |
i: index for theorem lookup (cf. thms_containing) *) |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
183 |
cases: (string * RuleCases.T) list, (*local contexts*) |
5819 | 184 |
defs: |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
185 |
typ Vartab.table * (*type constraints*) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
186 |
sort Vartab.table * (*default sorts*) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
187 |
string list * (*used type variables*) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
188 |
term list Symtab.table}; (*type variable occurrences*) |
5819 | 189 |
|
190 |
exception CONTEXT of string * context; |
|
191 |
||
192 |
||
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
193 |
fun make_context (thy, syntax, data, asms, binds, thms, cases, defs) = |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
194 |
Context {thy = thy, syntax = syntax, data = data, asms = asms, binds = binds, |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
195 |
thms = thms, cases = cases, defs = defs}; |
5819 | 196 |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
197 |
fun map_context f (Context {thy, syntax, data, asms, binds, thms, cases, defs}) = |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
198 |
make_context (f (thy, syntax, data, asms, binds, thms, cases, defs)); |
5819 | 199 |
|
200 |
fun theory_of (Context {thy, ...}) = thy; |
|
201 |
val sign_of = Theory.sign_of o theory_of; |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
202 |
fun syntax_of (Context {syntax, ...}) = syntax; |
5819 | 203 |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
204 |
fun fixes_of (Context {asms = (_, fixes), ...}) = fixes; |
12057 | 205 |
val fixed_names_of = map #2 o fixes_of; |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
206 |
fun is_fixed ctxt x = exists (equal x o #2) (fixes_of ctxt); |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
207 |
fun is_known (ctxt as Context {defs = (types, _, _, _), ...}) x = |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
208 |
is_some (Vartab.lookup (types, (x, ~1))) orelse is_fixed ctxt x; |
12291 | 209 |
fun type_occs (Context {defs = (_, _, _, tab), ...}) = tab; |
12057 | 210 |
|
211 |
fun assumptions_of (Context {asms = ((asms, _), _), ...}) = asms; |
|
212 |
fun prems_of (Context {asms = ((_, prems), _), ...}) = flat (map #2 prems); |
|
213 |
||
7270 | 214 |
|
5819 | 215 |
|
216 |
(** user data **) |
|
217 |
||
218 |
(* errors *) |
|
219 |
||
220 |
fun of_theory thy = "\nof theory " ^ Sign.str_of_sg (Theory.sign_of thy); |
|
221 |
||
222 |
fun err_inconsistent kinds = |
|
223 |
error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " proof data"); |
|
224 |
||
225 |
fun err_dup_init thy kind = |
|
226 |
error ("Duplicate initialization of " ^ quote kind ^ " proof data" ^ of_theory thy); |
|
227 |
||
228 |
fun err_undef ctxt kind = |
|
229 |
raise CONTEXT ("Tried to access undefined " ^ quote kind ^ " proof data", ctxt); |
|
230 |
||
231 |
fun err_uninit ctxt kind = |
|
232 |
raise CONTEXT ("Tried to access uninitialized " ^ quote kind ^ " proof data" ^ |
|
233 |
of_theory (theory_of ctxt), ctxt); |
|
234 |
||
235 |
fun err_access ctxt kind = |
|
236 |
raise CONTEXT ("Unauthorized access to " ^ quote kind ^ " proof data" ^ |
|
237 |
of_theory (theory_of ctxt), ctxt); |
|
238 |
||
239 |
||
240 |
(* data kind 'Isar/proof_data' *) |
|
241 |
||
242 |
structure ProofDataDataArgs = |
|
243 |
struct |
|
244 |
val name = "Isar/proof_data"; |
|
245 |
type T = (Object.kind * ((theory -> Object.T) * (context -> Object.T -> unit))) Symtab.table; |
|
246 |
||
247 |
val empty = Symtab.empty; |
|
6550 | 248 |
val copy = I; |
5819 | 249 |
val prep_ext = I; |
250 |
fun merge tabs = Symtab.merge (Object.eq_kind o pairself fst) tabs |
|
251 |
handle Symtab.DUPS kinds => err_inconsistent kinds; |
|
252 |
fun print _ tab = Pretty.writeln (Pretty.strs (map #1 (Symtab.dest tab))); |
|
253 |
end; |
|
254 |
||
255 |
structure ProofDataData = TheoryDataFun(ProofDataDataArgs); |
|
256 |
val print_proof_data = ProofDataData.print; |
|
257 |
||
258 |
||
259 |
(* init proof data *) |
|
260 |
||
261 |
fun init_data kind meths thy = |
|
262 |
let |
|
263 |
val name = Object.name_of_kind kind; |
|
264 |
val tab = Symtab.update_new ((name, (kind, meths)), ProofDataData.get thy) |
|
265 |
handle Symtab.DUP _ => err_dup_init thy name; |
|
266 |
in thy |> ProofDataData.put tab end; |
|
267 |
||
268 |
||
269 |
(* access data *) |
|
270 |
||
271 |
fun lookup_data (ctxt as Context {data, ...}) kind = |
|
272 |
let |
|
273 |
val thy = theory_of ctxt; |
|
274 |
val name = Object.name_of_kind kind; |
|
275 |
in |
|
276 |
(case Symtab.lookup (ProofDataData.get thy, name) of |
|
277 |
Some (k, meths) => |
|
278 |
if Object.eq_kind (kind, k) then |
|
279 |
(case Symtab.lookup (data, name) of |
|
280 |
Some x => (x, meths) |
|
281 |
| None => err_undef ctxt name) |
|
282 |
else err_access ctxt name |
|
283 |
| None => err_uninit ctxt name) |
|
284 |
end; |
|
285 |
||
286 |
fun get_data kind f ctxt = |
|
287 |
let val (x, _) = lookup_data ctxt kind |
|
288 |
in f x handle Match => Object.kind_error kind end; |
|
289 |
||
290 |
fun print_data kind ctxt = |
|
291 |
let val (x, (_, prt)) = lookup_data ctxt kind |
|
292 |
in prt ctxt x end; |
|
293 |
||
294 |
fun put_data kind f x ctxt = |
|
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
295 |
(lookup_data ctxt kind; |
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
296 |
map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) => |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
297 |
(thy, syntax, Symtab.update ((Object.name_of_kind kind, f x), data), |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
298 |
asms, binds, thms, cases, defs)) ctxt); |
5819 | 299 |
|
300 |
||
301 |
(* init context *) |
|
302 |
||
5874 | 303 |
fun init thy = |
304 |
let val data = Symtab.map (fn (_, (f, _)) => f thy) (ProofDataData.get thy) in |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
305 |
make_context (thy, (Theory.syn_of thy, [], []), data, (([], []), []), Vartab.empty, |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
306 |
(false, NameSpace.empty, Symtab.empty, FactIndex.empty), [], |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
307 |
(Vartab.empty, Vartab.empty, [], Symtab.empty)) |
5819 | 308 |
end; |
309 |
||
310 |
||
8096 | 311 |
|
12093 | 312 |
(** local syntax **) |
313 |
||
314 |
val fixedN = "\\<^fixed>"; |
|
315 |
val structN = "\\<^struct>"; |
|
316 |
||
12100 | 317 |
|
14697 | 318 |
(* translation functions *) |
14665
d2e5df3d1201
index syntax: support for general expressions (input only);
wenzelm
parents:
14643
diff
changeset
|
319 |
|
d2e5df3d1201
index syntax: support for general expressions (input only);
wenzelm
parents:
14643
diff
changeset
|
320 |
fun fixed_tr x = (fixedN ^ x, curry Term.list_comb (Syntax.free x)); |
d2e5df3d1201
index syntax: support for general expressions (input only);
wenzelm
parents:
14643
diff
changeset
|
321 |
|
12100 | 322 |
fun context_tr' ctxt = |
323 |
let |
|
324 |
val (_, structs, mixfixed) = syntax_of ctxt; |
|
325 |
||
326 |
fun tr' (t $ u) = tr' t $ tr' u |
|
327 |
| tr' (Abs (x, T, t)) = Abs (x, T, tr' t) |
|
328 |
| tr' (t as Free (x, T)) = |
|
14697 | 329 |
let val i = Library.find_index_eq x structs + 1 in |
330 |
if i = 0 andalso x mem_string mixfixed then Const (fixedN ^ x, T) |
|
14707 | 331 |
else if i = 1 andalso not (! show_structs) then |
332 |
Syntax.const "_struct" $ Syntax.const "_indexdefault" |
|
12100 | 333 |
else t |
334 |
end |
|
335 |
| tr' a = a; |
|
336 |
in tr' end; |
|
337 |
||
338 |
||
12576
9fd10052c3f7
added add_fixes: derives mssing type scheme from mixfix;
wenzelm
parents:
12550
diff
changeset
|
339 |
(* add syntax *) |
9fd10052c3f7
added add_fixes: derives mssing type scheme from mixfix;
wenzelm
parents:
12550
diff
changeset
|
340 |
|
9fd10052c3f7
added add_fixes: derives mssing type scheme from mixfix;
wenzelm
parents:
12550
diff
changeset
|
341 |
fun mixfix_type mx = replicate (Syntax.mixfix_args mx) TypeInfer.logicT ---> TypeInfer.logicT; |
12093 | 342 |
|
343 |
local |
|
344 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
345 |
fun mixfix x None mx = (fixedN ^ x, mixfix_type mx, Syntax.fix_mixfix x mx) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
346 |
| mixfix x (Some T) mx = (fixedN ^ x, T, Syntax.fix_mixfix x mx); |
12093 | 347 |
|
348 |
fun prep_mixfix (_, _, None) = None |
|
349 |
| prep_mixfix (x, opt_T, Some mx) = Some (mixfix x opt_T mx); |
|
350 |
||
351 |
fun prep_mixfix' (_, _, None) = None |
|
352 |
| prep_mixfix' (x, _, Some Syntax.NoSyn) = None |
|
12863 | 353 |
| prep_mixfix' (x, opt_T, _) = Some (x, mixfix x opt_T (Syntax.literal x)); |
12093 | 354 |
|
355 |
fun prep_struct (x, _, None) = Some x |
|
356 |
| prep_struct _ = None; |
|
357 |
||
358 |
in |
|
359 |
||
360 |
fun add_syntax decls = |
|
361 |
map_context (fn (thy, (syn, structs, mixfixed), data, asms, binds, thms, cases, defs) => |
|
362 |
let |
|
14901 | 363 |
val is_logtype = Sign.is_logtype (Theory.sign_of thy); |
12093 | 364 |
val structs' = structs @ mapfilter prep_struct decls; |
365 |
val mxs = mapfilter prep_mixfix decls; |
|
366 |
val (fixed, mxs_output) = Library.split_list (mapfilter prep_mixfix' decls); |
|
367 |
val trs = map fixed_tr fixed; |
|
368 |
val syn' = syn |
|
14901 | 369 |
|> Syntax.extend_const_gram is_logtype ("", false) mxs_output |
370 |
|> Syntax.extend_const_gram is_logtype ("", true) mxs |
|
12093 | 371 |
|> Syntax.extend_trfuns ([], trs, [], []); |
372 |
in (thy, (syn', structs', fixed @ mixfixed), data, asms, binds, thms, cases, defs) end) |
|
373 |
||
374 |
fun syn_of (Context {syntax = (syn, structs, _), ...}) = |
|
14697 | 375 |
syn |> Syntax.extend_trfuns (Syntax.struct_trfuns structs); |
376 |
||
12093 | 377 |
end; |
378 |
||
379 |
||
380 |
||
14828 | 381 |
(** pretty printing **) |
382 |
||
14974
b1ecb7859c99
avoid premature evaluation of syn_of (wastes time in conjunction with pp);
wenzelm
parents:
14901
diff
changeset
|
383 |
fun pretty_term ctxt t = Sign.pretty_term' (syn_of ctxt) (sign_of ctxt) (context_tr' ctxt t); |
b1ecb7859c99
avoid premature evaluation of syn_of (wastes time in conjunction with pp);
wenzelm
parents:
14901
diff
changeset
|
384 |
fun pretty_typ ctxt T = Sign.pretty_typ (sign_of ctxt) T; |
b1ecb7859c99
avoid premature evaluation of syn_of (wastes time in conjunction with pp);
wenzelm
parents:
14901
diff
changeset
|
385 |
fun pretty_sort ctxt S = Sign.pretty_sort (sign_of ctxt) S; |
b1ecb7859c99
avoid premature evaluation of syn_of (wastes time in conjunction with pp);
wenzelm
parents:
14901
diff
changeset
|
386 |
fun pretty_classrel ctxt cs = Sign.pretty_classrel (sign_of ctxt) cs; |
b1ecb7859c99
avoid premature evaluation of syn_of (wastes time in conjunction with pp);
wenzelm
parents:
14901
diff
changeset
|
387 |
fun pretty_arity ctxt ar = Sign.pretty_arity (sign_of ctxt) ar; |
14828 | 388 |
|
14974
b1ecb7859c99
avoid premature evaluation of syn_of (wastes time in conjunction with pp);
wenzelm
parents:
14901
diff
changeset
|
389 |
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
|
390 |
pretty_classrel ctxt, pretty_arity ctxt); |
14828 | 391 |
|
392 |
val string_of_term = Pretty.string_of oo pretty_term; |
|
393 |
||
394 |
fun pretty_thm ctxt thm = |
|
395 |
if ! Display.show_hyps then |
|
14876 | 396 |
Display.pretty_thm_aux (pp ctxt) false thm |
14828 | 397 |
else pretty_term ctxt (Thm.prop_of thm); |
398 |
||
399 |
fun pretty_thms ctxt [th] = pretty_thm ctxt th |
|
400 |
| pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths)); |
|
401 |
||
402 |
fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths |
|
403 |
| pretty_fact ctxt (a, [th]) = |
|
404 |
Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, pretty_thm ctxt th] |
|
405 |
| pretty_fact ctxt (a, ths) = |
|
406 |
Pretty.block (Pretty.fbreaks (Pretty.str (a ^ ":") :: map (pretty_thm ctxt) ths)); |
|
407 |
||
408 |
||
409 |
||
7663 | 410 |
(** default sorts and types **) |
411 |
||
12291 | 412 |
fun def_sort (Context {defs = (_, sorts, _, _), ...}) xi = Vartab.lookup (sorts, xi); |
7663 | 413 |
|
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
414 |
fun def_type (Context {binds, defs = (types, _, _, _), ...}) pattern xi = |
7663 | 415 |
(case Vartab.lookup (types, xi) of |
416 |
None => |
|
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
417 |
if pattern then None else |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
418 |
(case Vartab.lookup (binds, xi) of |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
419 |
Some (Some (_, T)) => Some (TypeInfer.polymorphicT T) |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
420 |
| _ => None) |
7663 | 421 |
| some => some); |
422 |
||
12504 | 423 |
fun default_type (Context {defs = (types, _, _, _), ...}) x = Vartab.lookup (types, (x, ~1)); |
424 |
fun used_types (Context {defs = (_, _, used, _), ...}) = used; |
|
12414 | 425 |
|
7663 | 426 |
|
5819 | 427 |
|
428 |
(** prepare types **) |
|
429 |
||
9504 | 430 |
local |
431 |
||
432 |
fun read_typ_aux read ctxt s = |
|
12093 | 433 |
transform_error (read (syn_of ctxt) (sign_of ctxt, def_sort ctxt)) s |
7663 | 434 |
handle ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt); |
5819 | 435 |
|
10554 | 436 |
fun cert_typ_aux cert ctxt raw_T = |
437 |
cert (sign_of ctxt) raw_T |
|
438 |
handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt); |
|
9504 | 439 |
|
440 |
in |
|
441 |
||
14287
f630017ed01c
Isar: where attribute supports instantiation of type variables.
ballarin
parents:
14257
diff
changeset
|
442 |
(* Read/certify type, using default sort information from context. *) |
f630017ed01c
Isar: where attribute supports instantiation of type variables.
ballarin
parents:
14257
diff
changeset
|
443 |
|
14780 | 444 |
val read_typ = read_typ_aux Sign.read_typ'; |
445 |
val read_typ_raw = read_typ_aux Sign.read_typ_raw'; |
|
446 |
val cert_typ = cert_typ_aux Sign.certify_typ; |
|
447 |
val cert_typ_raw = cert_typ_aux Sign.certify_typ_raw; |
|
9504 | 448 |
|
449 |
end; |
|
450 |
||
5819 | 451 |
|
7679 | 452 |
(* internalize Skolem constants *) |
453 |
||
10583 | 454 |
fun lookup_skolem ctxt x = assoc (fixes_of ctxt, x); |
455 |
fun get_skolem ctxt x = if_none (lookup_skolem ctxt x) x; |
|
7679 | 456 |
|
12504 | 457 |
fun no_skolem internal ctxt x = |
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
458 |
if can Syntax.dest_skolem x then |
7679 | 459 |
raise CONTEXT ("Illegal reference to internal Skolem constant: " ^ quote x, ctxt) |
12504 | 460 |
else if not internal andalso can Syntax.dest_internal x then |
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
461 |
raise CONTEXT ("Illegal reference to internal variable: " ^ quote x, ctxt) |
7679 | 462 |
else x; |
463 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
464 |
fun intern_skolem ctxt internal = |
7679 | 465 |
let |
466 |
fun intern (t as Free (x, T)) = |
|
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
467 |
if internal x then t |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
468 |
else |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
469 |
(case lookup_skolem ctxt (no_skolem false ctxt x) of |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
470 |
Some x' => Free (x', T) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
471 |
| None => t) |
7679 | 472 |
| intern (t $ u) = intern t $ intern u |
473 |
| intern (Abs (x, T, t)) = Abs (x, T, intern t) |
|
474 |
| intern a = a; |
|
475 |
in intern end; |
|
476 |
||
477 |
||
9133 | 478 |
(* externalize Skolem constants -- for printing purposes only *) |
479 |
||
480 |
fun extern_skolem ctxt = |
|
481 |
let |
|
482 |
val rev_fixes = map Library.swap (fixes_of ctxt); |
|
483 |
||
484 |
fun extern (t as Free (x, T)) = |
|
485 |
(case assoc (rev_fixes, x) of |
|
10583 | 486 |
Some x' => Free (if lookup_skolem ctxt x' = Some x then x' else NameSpace.hidden x', T) |
9133 | 487 |
| None => t) |
488 |
| extern (t $ u) = extern t $ extern u |
|
489 |
| extern (Abs (x, T, t)) = Abs (x, T, extern t) |
|
490 |
| extern a = a; |
|
491 |
in extern end |
|
492 |
||
8096 | 493 |
|
5819 | 494 |
(** prepare terms and propositions **) |
495 |
||
496 |
(* |
|
497 |
(1) read / certify wrt. signature of context |
|
498 |
(2) intern Skolem constants |
|
499 |
(3) expand term bindings |
|
500 |
*) |
|
501 |
||
502 |
||
503 |
(* read / certify wrt. signature *) (*exception ERROR*) (*exception TERM*) |
|
504 |
||
14828 | 505 |
fun read_def_termTs freeze pp syn sg (types, sorts, used) sTs = |
14901 | 506 |
Sign.read_def_terms' pp (Sign.is_logtype sg) syn (sg, types, sorts) used freeze sTs; |
5874 | 507 |
|
14828 | 508 |
fun read_def_termT freeze pp syn sg defs sT = |
509 |
apfst hd (read_def_termTs freeze pp syn sg defs [sT]); |
|
510 |
||
511 |
fun read_term_sg freeze pp syn sg defs s = |
|
512 |
#1 (read_def_termT freeze pp syn sg defs (s, TypeInfer.logicT)); |
|
5874 | 513 |
|
14828 | 514 |
fun read_prop_sg freeze pp syn sg defs s = |
515 |
#1 (read_def_termT freeze pp syn sg defs (s, propT)); |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
516 |
|
14828 | 517 |
fun read_terms_sg freeze pp syn sg defs = |
518 |
#1 o read_def_termTs freeze pp syn sg defs o map (rpair TypeInfer.logicT); |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
519 |
|
14828 | 520 |
fun read_props_sg freeze pp syn sg defs = |
521 |
#1 o read_def_termTs freeze pp syn sg defs o map (rpair propT); |
|
5819 | 522 |
|
523 |
||
14828 | 524 |
fun cert_term_sg pp sg t = #1 (Sign.certify_term pp sg t); |
5819 | 525 |
|
14828 | 526 |
fun cert_prop_sg pp sg tm = |
527 |
let val (t, T, _) = Sign.certify_term pp sg tm |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
528 |
in if T = propT then t else raise TERM ("Term not of type prop", [t]) end; |
5819 | 529 |
|
530 |
||
531 |
(* norm_term *) |
|
532 |
||
533 |
(*beta normal form for terms (not eta normal form), chase variables in |
|
534 |
bindings environment (code taken from Pure/envir.ML)*) |
|
535 |
||
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
536 |
fun unifyT ctxt (T, U) = |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
537 |
let val maxidx = Int.max (Term.maxidx_of_typ T, Term.maxidx_of_typ U) |
12530 | 538 |
in #1 (Type.unify (Sign.tsig_of (sign_of ctxt)) (Vartab.empty, maxidx) (T, U)) end; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
539 |
|
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
540 |
fun norm_term (ctxt as Context {binds, ...}) schematic = |
5819 | 541 |
let |
542 |
(*raised when norm has no effect on a term, to do sharing instead of copying*) |
|
543 |
exception SAME; |
|
544 |
||
545 |
fun norm (t as Var (xi, T)) = |
|
546 |
(case Vartab.lookup (binds, xi) of |
|
7606 | 547 |
Some (Some (u, U)) => |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
548 |
let |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
549 |
val env = unifyT ctxt (T, U) handle Type.TUNIFY => |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13629
diff
changeset
|
550 |
raise TYPE ("norm_term: ill-typed variable assignment", [T, U], [t, u]); |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
551 |
val u' = Term.subst_TVars_Vartab env u; |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
552 |
in norm u' handle SAME => u' end |
10554 | 553 |
| _ => |
554 |
if schematic then raise SAME |
|
555 |
else raise CONTEXT ("Unbound schematic variable: " ^ Syntax.string_of_vname xi, ctxt)) |
|
5819 | 556 |
| norm (Abs (a, T, body)) = Abs (a, T, norm body) |
557 |
| norm (Abs (_, _, body) $ t) = normh (subst_bound (t, body)) |
|
558 |
| norm (f $ t) = |
|
559 |
((case norm f of |
|
560 |
Abs (_, _, body) => normh (subst_bound (t, body)) |
|
561 |
| nf => nf $ (norm t handle SAME => t)) handle SAME => f $ norm t) |
|
562 |
| norm _ = raise SAME |
|
563 |
and normh t = norm t handle SAME => t |
|
564 |
in normh end; |
|
565 |
||
566 |
||
6550 | 567 |
(* dummy patterns *) |
568 |
||
9540 | 569 |
fun prepare_dummies t = #2 (Term.replace_dummy_patterns (1, t)); |
6762 | 570 |
|
9540 | 571 |
fun reject_dummies ctxt t = Term.no_dummy_patterns t |
572 |
handle TERM _ => raise CONTEXT ("Illegal dummy pattern(s) in term", ctxt); |
|
6550 | 573 |
|
574 |
||
5819 | 575 |
(* read terms *) |
576 |
||
10554 | 577 |
local |
578 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
579 |
fun append_env e1 e2 x = (case e2 x of None => e1 x | some => some); |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
580 |
|
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
581 |
fun gen_read' read app pattern dummies schematic |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
582 |
ctxt internal more_types more_sorts more_used s = |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13629
diff
changeset
|
583 |
let |
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
584 |
val types = append_env (def_type ctxt pattern) more_types; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
585 |
val sorts = append_env (def_sort ctxt) more_sorts; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
586 |
val used = used_types ctxt @ more_used; |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13629
diff
changeset
|
587 |
in |
14828 | 588 |
(transform_error (read (pp ctxt) (syn_of ctxt) (sign_of ctxt) (types, sorts, used)) s |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13629
diff
changeset
|
589 |
handle TERM (msg, _) => raise CONTEXT (msg, ctxt) |
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
590 |
| ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt)) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
591 |
|> app (intern_skolem ctxt internal) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
592 |
|> app (if pattern then I else norm_term ctxt schematic) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
593 |
|> app (if pattern then prepare_dummies else if dummies then I else reject_dummies ctxt) |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
594 |
end; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
595 |
|
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
596 |
fun gen_read read app pattern dummies schematic ctxt = |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
597 |
gen_read' read app pattern dummies schematic ctxt (K false) (K None) (K None) []; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
598 |
|
10554 | 599 |
in |
600 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
601 |
val read_termTs = gen_read' (read_def_termTs false) (apfst o map) false false false; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
602 |
val read_termTs_schematic = gen_read' (read_def_termTs false) (apfst o map) false false true; |
8096 | 603 |
|
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
604 |
fun read_term_pats T ctxt = |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
605 |
#1 o gen_read (read_def_termTs false) (apfst o map) true false false ctxt o map (rpair T); |
8096 | 606 |
val read_prop_pats = read_term_pats propT; |
607 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
608 |
fun read_term_liberal ctxt = |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
609 |
gen_read' (read_term_sg true) I false false false ctxt (K true) (K None) (K None) []; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
610 |
|
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
611 |
val read_term = gen_read (read_term_sg true) I false false false; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
612 |
val read_term_dummies = gen_read (read_term_sg true) I false true false; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
613 |
val read_prop = gen_read (read_prop_sg true) I false false false; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
614 |
val read_prop_schematic = gen_read (read_prop_sg true) I false false true; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
615 |
val read_terms = gen_read (read_terms_sg true) map false false false; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
616 |
fun read_props schematic = gen_read (read_props_sg true) map false false schematic; |
5819 | 617 |
|
10554 | 618 |
end; |
619 |
||
5819 | 620 |
|
621 |
(* certify terms *) |
|
622 |
||
10554 | 623 |
local |
624 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
625 |
fun gen_cert cert pattern schematic ctxt t = t |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
626 |
|> (if pattern then I else norm_term ctxt schematic) |
14828 | 627 |
|> (fn t' => cert (pp ctxt) (sign_of ctxt) t' |
628 |
handle TERM (msg, _) => raise CONTEXT (msg, ctxt)); |
|
5819 | 629 |
|
10554 | 630 |
in |
8096 | 631 |
|
10554 | 632 |
val cert_term = gen_cert cert_term_sg false false; |
633 |
val cert_prop = gen_cert cert_prop_sg false false; |
|
634 |
val cert_props = map oo gen_cert cert_prop_sg false; |
|
635 |
||
636 |
fun cert_term_pats _ = map o gen_cert cert_term_sg true false; |
|
637 |
val cert_prop_pats = map o gen_cert cert_prop_sg true false; |
|
638 |
||
639 |
end; |
|
5819 | 640 |
|
641 |
||
642 |
(* declare terms *) |
|
643 |
||
10381 | 644 |
local |
645 |
||
5819 | 646 |
val ins_types = foldl_aterms |
647 |
(fn (types, Free (x, T)) => Vartab.update (((x, ~1), T), types) |
|
648 |
| (types, Var v) => Vartab.update (v, types) |
|
649 |
| (types, _) => types); |
|
650 |
||
651 |
val ins_sorts = foldl_types (foldl_atyps |
|
652 |
(fn (sorts, TFree (x, S)) => Vartab.update (((x, ~1), S), sorts) |
|
653 |
| (sorts, TVar v) => Vartab.update (v, sorts) |
|
654 |
| (sorts, _) => sorts)); |
|
655 |
||
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
656 |
val ins_used = foldl_term_types (fn t => foldl_atyps |
12504 | 657 |
(fn (used, TFree (x, _)) => x ins_string used |
658 |
| (used, _) => used)); |
|
12291 | 659 |
|
660 |
val ins_occs = foldl_term_types (fn t => foldl_atyps |
|
661 |
(fn (tab, TFree (x, _)) => Symtab.update_multi ((x, t), tab) | (tab, _) => tab)); |
|
5819 | 662 |
|
7663 | 663 |
fun ins_skolem def_ty = foldr |
5994 | 664 |
(fn ((x, x'), types) => |
7663 | 665 |
(case def_ty x' of |
5994 | 666 |
Some T => Vartab.update (((x, ~1), T), types) |
667 |
| None => types)); |
|
668 |
||
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
669 |
fun map_defaults f = map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) => |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
670 |
(thy, syntax, data, asms, binds, thms, cases, f defs)); |
5819 | 671 |
|
10381 | 672 |
fun declare_syn (ctxt, t) = |
5819 | 673 |
ctxt |
12291 | 674 |
|> map_defaults (fn (types, sorts, used, occ) => (ins_types (types, t), sorts, used, occ)) |
675 |
|> map_defaults (fn (types, sorts, used, occ) => (types, ins_sorts (sorts, t), used, occ)) |
|
676 |
|> map_defaults (fn (types, sorts, used, occ) => (types, sorts, ins_used (used, t), occ)); |
|
10381 | 677 |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
678 |
fun declare_occ (ctxt as Context {asms = (_, fixes), ...}, t) = |
10381 | 679 |
declare_syn (ctxt, t) |
12291 | 680 |
|> map_defaults (fn (types, sorts, used, occ) => (types, sorts, used, ins_occs (occ, t))) |
681 |
|> map_defaults (fn (types, sorts, used, occ) => |
|
682 |
(ins_skolem (fn x => Vartab.lookup (types, (x, ~1))) (fixes, types), sorts, used, occ)); |
|
5819 | 683 |
|
10381 | 684 |
in |
5819 | 685 |
|
10381 | 686 |
fun declare_term t ctxt = declare_occ (ctxt, t); |
687 |
fun declare_terms ts ctxt = foldl declare_occ (ctxt, ts); |
|
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
688 |
fun declare_terms_syntax ts ctxt = foldl declare_syn (ctxt, ts); |
10381 | 689 |
|
690 |
end; |
|
5819 | 691 |
|
692 |
||
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
693 |
|
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
694 |
(** Hindley-Milner polymorphism **) |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
695 |
|
7925 | 696 |
(* warn_extra_tfrees *) |
697 |
||
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
698 |
fun warn_extra_tfrees |
12291 | 699 |
(ctxt1 as Context {defs = (_, _, _, occ1), ...}) |
700 |
(ctxt2 as Context {defs = (_, _, _, occ2), ...}) = |
|
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
701 |
let |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
702 |
fun known_tfree a (Type (_, Ts)) = exists (known_tfree a) Ts |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
703 |
| known_tfree a (TFree (a', _)) = a = a' |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
704 |
| known_tfree _ _ = false; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
705 |
|
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
706 |
val extras = |
12291 | 707 |
Library.gen_rems Library.eq_fst (Symtab.dest occ2, Symtab.dest occ1) |
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
708 |
|> map (fn (a, ts) => map (pair a) (mapfilter (try (#1 o Term.dest_Free)) ts)) |> flat |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
709 |
|> mapfilter (fn (a, x) => |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
710 |
(case def_type ctxt1 false (x, ~1) of None => Some (a, x) |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
711 |
| Some T => if known_tfree a T then None else Some (a, x))); |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
712 |
val tfrees = map #1 extras |> Library.sort_strings |> Library.unique_strings; |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
713 |
val frees = map #2 extras |> Library.sort_strings |> Library.unique_strings; |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
714 |
in |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
715 |
if null extras then () |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
716 |
else warning ("Just introduced free type variable(s): " ^ commas tfrees ^ " in " ^ |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
717 |
space_implode " or " frees); |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
718 |
ctxt2 |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
719 |
end; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
720 |
|
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
721 |
|
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
722 |
(* generalize type variables *) |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
723 |
|
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
724 |
fun generalize_tfrees inner outer = |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
725 |
let |
12057 | 726 |
val extra_fixes = fixed_names_of inner \\ fixed_names_of outer; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
727 |
fun still_fixed (Free (x, _)) = not (x mem_string extra_fixes) |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
728 |
| still_fixed _ = false; |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
729 |
val occs_inner = type_occs inner; |
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
730 |
val occs_outer = type_occs outer; |
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
731 |
fun add (gen, a) = |
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
732 |
if is_some (Symtab.lookup (occs_outer, a)) orelse |
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
733 |
exists still_fixed (Symtab.lookup_multi (occs_inner, a)) |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
734 |
then gen else a :: gen; |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
735 |
in fn tfrees => foldl add ([], tfrees) end; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
736 |
|
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
737 |
fun generalize inner outer ts = |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
738 |
let |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
739 |
val tfrees = generalize_tfrees inner outer (foldr Term.add_term_tfree_names (ts, [])); |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
740 |
fun gen (x, S) = if x mem_string tfrees then TVar ((x, 0), S) else TFree (x, S); |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
741 |
in map (Term.map_term_types (Term.map_type_tfree gen)) ts end; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
742 |
|
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
743 |
|
9553 | 744 |
|
745 |
(** export theorems **) |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
746 |
|
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
747 |
fun get_free x (None, t as Free (y, _)) = if x = y then Some t else None |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
748 |
| get_free _ (opt, _) = opt; |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
749 |
|
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
750 |
fun find_free t x = foldl_aterms (get_free x) (None, t); |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
751 |
|
13415 | 752 |
fun export_view view is_goal inner outer = |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
753 |
let |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
754 |
val gen = generalize_tfrees inner outer; |
12057 | 755 |
val fixes = fixed_names_of inner \\ fixed_names_of outer; |
756 |
val asms = Library.drop (length (assumptions_of outer), assumptions_of inner); |
|
11816 | 757 |
val exp_asms = map (fn (cprops, exp) => exp is_goal cprops) asms; |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
758 |
in fn thm => thm |
12804 | 759 |
|> Tactic.norm_hhf_rule |
11816 | 760 |
|> Seq.EVERY (rev exp_asms) |
13415 | 761 |
|> Seq.map (Drule.implies_intr_list view) |
11816 | 762 |
|> Seq.map (fn rule => |
763 |
let |
|
764 |
val {sign, prop, ...} = Thm.rep_thm rule; |
|
765 |
val frees = map (Thm.cterm_of sign) (mapfilter (find_free prop) fixes); |
|
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
766 |
val tfrees = gen (Term.add_term_tfree_names (prop, [])); |
11816 | 767 |
in |
768 |
rule |
|
769 |
|> Drule.forall_intr_list frees |
|
12804 | 770 |
|> Tactic.norm_hhf_rule |
12504 | 771 |
|> (#1 o Drule.tvars_intr_list tfrees) |
11816 | 772 |
end) |
773 |
end; |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
774 |
|
13415 | 775 |
val export = export_view []; |
13399
c136276dc847
support locale ``views'' (for cumulative predicates);
wenzelm
parents:
13378
diff
changeset
|
776 |
|
c136276dc847
support locale ``views'' (for cumulative predicates);
wenzelm
parents:
13378
diff
changeset
|
777 |
fun export_standard view inner outer = |
13415 | 778 |
let val exp = export_view view false inner outer in |
13378 | 779 |
fn th => |
780 |
(case Seq.pull (exp th) of |
|
781 |
Some (th', _) => th' |> Drule.local_standard |
|
782 |
| None => raise CONTEXT ("Internal failure while exporting theorem", inner)) |
|
783 |
end; |
|
12704 | 784 |
|
7925 | 785 |
|
5819 | 786 |
|
787 |
(** bindings **) |
|
788 |
||
789 |
(* update_binds *) |
|
790 |
||
7606 | 791 |
fun del_bind (ctxt, xi) = |
792 |
ctxt |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
793 |
|> map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) => |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
794 |
(thy, syntax, data, asms, Vartab.update ((xi, None), binds), thms, cases, defs)); |
7606 | 795 |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
796 |
fun upd_bind (ctxt, ((x, i), t)) = |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
797 |
let |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
798 |
val T = Term.fastype_of t; |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
799 |
val t' = |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
800 |
if null (Term.term_tvars t \\ Term.typ_tvars T) then t |
8637 | 801 |
else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T); |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
802 |
in |
5819 | 803 |
ctxt |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
804 |
|> declare_term t' |
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
805 |
|> map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) => |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
806 |
(thy, syntax, data, asms, Vartab.update (((x, i), Some (t', T)), binds), thms, cases, defs)) |
5819 | 807 |
end; |
808 |
||
7606 | 809 |
fun del_upd_bind (ctxt, (xi, None)) = del_bind (ctxt, xi) |
810 |
| del_upd_bind (ctxt, (xi, Some t)) = upd_bind (ctxt, (xi, t)); |
|
811 |
||
5819 | 812 |
fun update_binds bs ctxt = foldl upd_bind (ctxt, bs); |
7606 | 813 |
fun delete_update_binds bs ctxt = foldl del_upd_bind (ctxt, bs); |
814 |
||
5819 | 815 |
|
8096 | 816 |
(* simult_matches *) |
817 |
||
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
818 |
fun simult_matches ctxt [] = [] |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
819 |
| simult_matches ctxt pairs = |
8096 | 820 |
let |
10554 | 821 |
fun fail () = raise CONTEXT ("Pattern match failed!", ctxt); |
822 |
||
8096 | 823 |
val maxidx = foldl (fn (i, (t1, t2)) => |
824 |
Int.max (i, Int.max (Term.maxidx_of_term t1, Term.maxidx_of_term t2))) (~1, pairs); |
|
10554 | 825 |
val envs = Unify.smash_unifiers (sign_of ctxt, Envir.empty maxidx, |
826 |
map swap pairs); (*prefer assignment of variables from patterns*) |
|
827 |
val env = |
|
8096 | 828 |
(case Seq.pull envs of |
10554 | 829 |
None => fail () |
830 |
| Some (env, _) => env); (*ignore further results*) |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
831 |
val domain = |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
832 |
filter_out Term.is_replaced_dummy_pattern (map #1 (Drule.vars_of_terms (map #1 pairs))); |
10554 | 833 |
val _ = (*may not assign variables from text*) |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
834 |
if null (map #1 (Envir.alist_of env) inter (map #1 (Drule.vars_of_terms (map #2 pairs)))) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
835 |
then () else fail (); |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
836 |
fun norm_bind (xi, t) = if xi mem domain then Some (xi, Envir.norm_term env t) else None; |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
837 |
in mapfilter norm_bind (Envir.alist_of env) end; |
8096 | 838 |
|
839 |
||
840 |
(* add_binds(_i) *) |
|
5819 | 841 |
|
7925 | 842 |
local |
843 |
||
5819 | 844 |
fun gen_bind prep (ctxt, (xi as (x, _), raw_t)) = |
7606 | 845 |
ctxt |> delete_update_binds [(xi, apsome (prep ctxt) raw_t)]; |
5819 | 846 |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
847 |
fun gen_binds prep binds ctxt = foldl (gen_bind prep) (ctxt, binds); |
7925 | 848 |
|
10810 | 849 |
in |
850 |
||
10554 | 851 |
fun drop_schematic (b as (xi, Some t)) = if null (Term.term_vars t) then b else (xi, None) |
852 |
| drop_schematic b = b; |
|
853 |
||
5819 | 854 |
val add_binds = gen_binds read_term; |
855 |
val add_binds_i = gen_binds cert_term; |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
856 |
|
12147 | 857 |
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (sign_of ctxt) ts)); |
858 |
val auto_bind_goal = auto_bind AutoBind.goal; |
|
859 |
val auto_bind_facts = auto_bind AutoBind.facts; |
|
7925 | 860 |
|
861 |
end; |
|
5819 | 862 |
|
863 |
||
8096 | 864 |
(* match_bind(_i) *) |
5819 | 865 |
|
8096 | 866 |
local |
867 |
||
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
868 |
fun prep_bind prep_pats (ctxt, (raw_pats, t)) = |
5819 | 869 |
let |
8096 | 870 |
val ctxt' = declare_term t ctxt; |
871 |
val pats = prep_pats (fastype_of t) ctxt' raw_pats; |
|
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
872 |
val binds = simult_matches ctxt' (map (rpair t) pats); |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
873 |
in (ctxt', binds) end; |
7670 | 874 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
875 |
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
|
876 |
let |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
877 |
val ts = prep_terms ctxt (map snd raw_binds); |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
878 |
val (ctxt', binds) = |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
879 |
apsnd flat (foldl_map (prep_bind prep_pats) (ctxt, map fst raw_binds ~~ ts)); |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
880 |
val binds' = |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
881 |
if gen then map #1 binds ~~ generalize ctxt' ctxt (map #2 binds) |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
882 |
else binds; |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
883 |
val binds'' = map (apsnd Some) binds'; |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
884 |
in |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
885 |
warn_extra_tfrees ctxt |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
886 |
(if gen then ctxt (*sic!*) |> declare_terms (map #2 binds') |> add_binds_i binds'' |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
887 |
else ctxt' |> add_binds_i binds'') |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
888 |
end; |
8096 | 889 |
|
890 |
in |
|
5935 | 891 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
892 |
val match_bind = gen_binds read_terms read_term_pats; |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
893 |
val match_bind_i = gen_binds (map o cert_term) cert_term_pats; |
8096 | 894 |
|
895 |
end; |
|
5935 | 896 |
|
897 |
||
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
898 |
(* propositions with patterns *) |
5935 | 899 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
900 |
local |
8096 | 901 |
|
10554 | 902 |
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
|
903 |
let |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
904 |
fun prep ((ctxt, prop :: props), (_, (raw_pats1, raw_pats2))) = |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
905 |
let |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
906 |
val ctxt' = declare_term prop ctxt; |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
907 |
val pats = prep_pats ctxt' (raw_pats1 @ raw_pats2); (*simultaneous type inference!*) |
13629 | 908 |
in ((ctxt', props), (prop, splitAt(length raw_pats1, pats))) end |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
909 |
| prep _ = sys_error "prep_propp"; |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
910 |
val ((context', _), propp) = foldl_map (foldl_map prep) |
10554 | 911 |
((context, prep_props schematic context (flat (map (map fst) args))), args); |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
912 |
in (context', propp) end; |
5935 | 913 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
914 |
fun matches ctxt (prop, (pats1, pats2)) = |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
915 |
simult_matches ctxt (map (rpair prop) pats1 @ map (rpair (Logic.strip_imp_concl prop)) pats2); |
8096 | 916 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
917 |
fun gen_bind_propp prepp (ctxt, raw_args) = |
8096 | 918 |
let |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
919 |
val (ctxt', args) = prepp (ctxt, raw_args); |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
920 |
val binds = flat (flat (map (map (matches ctxt')) args)); |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
921 |
val propss = map (map #1) args; |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
922 |
|
10554 | 923 |
(*generalize result: context evaluated now, binds added later*) |
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
924 |
val gen = generalize ctxt' ctxt; |
12550
32843ad8160a
generalize type variables properly: start with occurrences in objects
wenzelm
parents:
12530
diff
changeset
|
925 |
fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map Some (gen (map #2 binds))); |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
926 |
in (ctxt' |> add_binds_i (map (apsnd Some) binds), (propss, gen_binds)) end; |
8096 | 927 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
928 |
in |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
929 |
|
11925 | 930 |
val read_propp = prep_propp false read_props read_prop_pats; |
931 |
val cert_propp = prep_propp false cert_props cert_prop_pats; |
|
10554 | 932 |
val read_propp_schematic = prep_propp true read_props read_prop_pats; |
933 |
val cert_propp_schematic = prep_propp true cert_props cert_prop_pats; |
|
934 |
||
11925 | 935 |
val bind_propp = gen_bind_propp read_propp; |
936 |
val bind_propp_i = gen_bind_propp cert_propp; |
|
937 |
val bind_propp_schematic = gen_bind_propp read_propp_schematic; |
|
10554 | 938 |
val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic; |
6789 | 939 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
940 |
end; |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
941 |
|
6789 | 942 |
|
5819 | 943 |
|
944 |
(** theorems **) |
|
945 |
||
6091 | 946 |
(* get_thm(s) *) |
5819 | 947 |
|
9566 | 948 |
(*beware of proper order of evaluation!*) |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
949 |
fun retrieve_thms f g (ctxt as Context {thy, thms = (_, space, tab, _), ...}) = |
9566 | 950 |
let |
951 |
val sg_ref = Sign.self_ref (Theory.sign_of thy); |
|
952 |
val get_from_thy = f thy; |
|
953 |
in |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
954 |
fn xname => |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
955 |
(case Symtab.lookup (tab, NameSpace.intern space xname) of |
9566 | 956 |
Some (Some ths) => map (Thm.transfer_sg (Sign.deref sg_ref)) ths |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
957 |
| _ => get_from_thy xname) |> g xname |
9566 | 958 |
end; |
5819 | 959 |
|
9566 | 960 |
val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm; |
961 |
val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm; |
|
962 |
val get_thms = retrieve_thms PureThy.get_thms (K I); |
|
963 |
val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I); |
|
5819 | 964 |
|
965 |
||
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
966 |
(* name space operations *) |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
967 |
|
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
968 |
fun cond_extern (Context {thms = (_, space, _, _), ...}) = NameSpace.cond_extern space; |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
969 |
|
13399
c136276dc847
support locale ``views'' (for cumulative predicates);
wenzelm
parents:
13378
diff
changeset
|
970 |
fun qualified q = map_context (fn (thy, syntax, data, asms, binds, |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
971 |
(_, space, tab, index), cases, defs) => |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
972 |
(thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs)); |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
973 |
|
13399
c136276dc847
support locale ``views'' (for cumulative predicates);
wenzelm
parents:
13378
diff
changeset
|
974 |
fun restore_qualified (Context {thms, ...}) = qualified (#1 thms); |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
975 |
|
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
976 |
fun hide_thms fully names = |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
977 |
map_context (fn (thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs) => |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
978 |
(thy, syntax, data, asms, binds, (q, NameSpace.hide fully (space, names), tab, index), |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
979 |
cases, defs)); |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
980 |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
981 |
|
6091 | 982 |
(* put_thm(s) *) |
5819 | 983 |
|
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
984 |
fun put_thms ("", _) ctxt = ctxt |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
985 |
| put_thms (name, ths) ctxt = ctxt |> map_context |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
986 |
(fn (thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs) => |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
987 |
if not q andalso NameSpace.is_qualified name then |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
988 |
raise CONTEXT ("Attempt to declare qualified name " ^ quote name, ctxt) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
989 |
else (thy, syntax, data, asms, binds, (q, NameSpace.extend (space, [name]), |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
990 |
Symtab.update ((name, Some ths), tab), |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
991 |
FactIndex.add (is_known ctxt) (index, (name, ths))), cases, defs)); |
5819 | 992 |
|
6091 | 993 |
fun put_thm (name, th) = put_thms (name, [th]); |
5819 | 994 |
|
6091 | 995 |
fun put_thmss [] ctxt = ctxt |
996 |
| put_thmss (th :: ths) ctxt = ctxt |> put_thms th |> put_thmss ths; |
|
5819 | 997 |
|
998 |
||
7606 | 999 |
(* reset_thms *) |
1000 |
||
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1001 |
fun reset_thms name = |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1002 |
map_context (fn (thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs) => |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1003 |
(thy, syntax, data, asms, binds, (q, space, Symtab.update ((name, None), tab), index), |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1004 |
cases, defs)); |
7606 | 1005 |
|
1006 |
||
14564 | 1007 |
(* note_thmss *) |
5819 | 1008 |
|
12711 | 1009 |
local |
1010 |
||
14564 | 1011 |
fun gen_note_thss get (ctxt, ((name, more_attrs), ths_attrs)) = |
5819 | 1012 |
let |
1013 |
fun app ((ct, ths), (th, attrs)) = |
|
12711 | 1014 |
let val (ct', th') = Thm.applys_attributes ((ct, get ctxt th), attrs @ more_attrs) |
1015 |
in (ct', th' :: ths) end; |
|
5819 | 1016 |
val (ctxt', rev_thms) = foldl app ((ctxt, []), ths_attrs); |
9196 | 1017 |
val thms = flat (rev rev_thms); |
6091 | 1018 |
in (ctxt' |> put_thms (name, thms), (name, thms)) end; |
5819 | 1019 |
|
14564 | 1020 |
fun gen_note_thmss get args ctxt = foldl_map (gen_note_thss get) (ctxt, args); |
12711 | 1021 |
|
1022 |
in |
|
1023 |
||
14564 | 1024 |
val note_thmss = gen_note_thmss get_thms; |
1025 |
val note_thmss_i = gen_note_thmss (K I); |
|
12711 | 1026 |
|
1027 |
end; |
|
9196 | 1028 |
|
5819 | 1029 |
|
1030 |
||
1031 |
(** assumptions **) |
|
1032 |
||
11918
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1033 |
(* basic exporters *) |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1034 |
|
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1035 |
fun export_assume true = Seq.single oo Drule.implies_intr_goals |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1036 |
| export_assume false = Seq.single oo Drule.implies_intr_list; |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1037 |
|
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1038 |
fun export_presume _ = export_assume false; |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1039 |
|
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1040 |
|
12057 | 1041 |
(* defs *) |
1042 |
||
12066 | 1043 |
fun cert_def ctxt eq = |
12016 | 1044 |
let |
12057 | 1045 |
fun err msg = raise CONTEXT (msg ^ |
1046 |
"\nThe error(s) above occurred in local definition: " ^ string_of_term ctxt eq, ctxt); |
|
1047 |
val (lhs, rhs) = Logic.dest_equals (Term.strip_all_body eq) |
|
1048 |
handle TERM _ => err "Not a meta-equality (==)"; |
|
12086 | 1049 |
val (f, xs) = Term.strip_comb lhs; |
1050 |
val (c, _) = Term.dest_Free f handle TERM _ => |
|
13430 | 1051 |
err "Head of lhs must be a free/fixed variable"; |
12057 | 1052 |
|
12086 | 1053 |
fun is_free (Free (x, _)) = not (is_fixed ctxt x) |
1054 |
| is_free _ = false; |
|
1055 |
val extra_frees = filter is_free (term_frees rhs) \\ xs; |
|
12016 | 1056 |
in |
12086 | 1057 |
conditional (not (forall (is_Bound orf is_free) xs andalso null (duplicates xs))) (fn () => |
13430 | 1058 |
err "Arguments of lhs must be distinct free/bound variables"); |
12086 | 1059 |
conditional (f mem Term.term_frees rhs) (fn () => |
1060 |
err "Element to be defined occurs on rhs"); |
|
1061 |
conditional (not (null extra_frees)) (fn () => |
|
1062 |
err ("Extra free variables on rhs: " ^ commas_quote (map (#1 o dest_Free) extra_frees))); |
|
1063 |
(c, Term.list_all_free (mapfilter (try Term.dest_Free) xs, eq)) |
|
12057 | 1064 |
end; |
1065 |
||
1066 |
fun head_of_def cprop = |
|
1067 |
#1 (Term.strip_comb (#1 (Logic.dest_equals (Term.strip_all_body (Thm.term_of cprop))))) |
|
1068 |
|> Thm.cterm_of (Thm.sign_of_cterm cprop); |
|
11918
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1069 |
|
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1070 |
fun export_def _ cprops thm = |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1071 |
thm |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1072 |
|> Drule.implies_intr_list cprops |
12057 | 1073 |
|> Drule.forall_intr_list (map head_of_def cprops) |
11918
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1074 |
|> Drule.forall_elim_vars 0 |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1075 |
|> RANGE (replicate (length cprops) (Tactic.rtac Drule.reflexive_thm)) 1; |
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1076 |
|
dfdf0798d7b8
added export_assume, export_presume, export_def (from proof.ML);
wenzelm
parents:
11915
diff
changeset
|
1077 |
|
5819 | 1078 |
(* assume *) |
1079 |
||
7270 | 1080 |
local |
6797 | 1081 |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1082 |
fun add_assm (ctxt, ((name, attrs), props)) = |
5819 | 1083 |
let |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1084 |
val cprops = map (Thm.cterm_of (sign_of ctxt)) props; |
12804 | 1085 |
val asms = map (Tactic.norm_hhf_rule o Thm.assume) cprops; |
5919 | 1086 |
|
1087 |
val ths = map (fn th => ([th], [])) asms; |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1088 |
val (ctxt', [(_, thms)]) = |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1089 |
ctxt |
12147 | 1090 |
|> auto_bind_facts props |
14564 | 1091 |
|> note_thmss_i [((name, attrs), ths)]; |
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1092 |
in (ctxt', (cprops, (name, asms), (name, thms))) end; |
5819 | 1093 |
|
9470 | 1094 |
fun gen_assms prepp exp args ctxt = |
1095 |
let |
|
10465
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1096 |
val (ctxt1, propss) = prepp (ctxt, map snd args); |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1097 |
val (ctxt2, results) = foldl_map add_assm (ctxt1, map fst args ~~ propss); |
4aa6f8b5cdc4
added read_terms, read_props (simulataneous type-inference);
wenzelm
parents:
10381
diff
changeset
|
1098 |
|
9470 | 1099 |
val cprops = flat (map #1 results); |
1100 |
val asmss = map #2 results; |
|
1101 |
val thmss = map #3 results; |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1102 |
val ctxt3 = ctxt2 |> map_context |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1103 |
(fn (thy, syntax, data, ((asms_ct, asms_th), fixes), binds, thms, cases, defs) => |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1104 |
(thy, syntax, data, ((asms_ct @ [(cprops, exp)], asms_th @ asmss), fixes), binds, thms, |
9470 | 1105 |
cases, defs)); |
11925 | 1106 |
val ctxt4 = ctxt3 |> put_thms ("prems", prems_of ctxt3); |
1107 |
in (warn_extra_tfrees ctxt ctxt4, thmss) end; |
|
5819 | 1108 |
|
7270 | 1109 |
in |
1110 |
||
8616
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
1111 |
val assume = gen_assms (apsnd #1 o bind_propp); |
90d2fed59be1
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8462
diff
changeset
|
1112 |
val assume_i = gen_assms (apsnd #1 o bind_propp_i); |
7270 | 1113 |
|
1114 |
end; |
|
5819 | 1115 |
|
1116 |
||
8096 | 1117 |
(* variables *) |
1118 |
||
10381 | 1119 |
local |
1120 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1121 |
fun prep_vars prep_typ internal liberal (ctxt, (xs, raw_T)) = |
8096 | 1122 |
let |
12504 | 1123 |
fun cond_tvars T = |
1124 |
if internal then T |
|
1125 |
else Type.no_tvars T handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt); |
|
1126 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1127 |
val _ = if liberal then () else |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1128 |
(case filter (not o Syntax.is_identifier) (map (no_skolem internal ctxt) xs) of |
8096 | 1129 |
[] => () | bads => raise CONTEXT ("Bad variable name(s): " ^ commas_quote bads, ctxt)); |
1130 |
||
12504 | 1131 |
val opt_T = apsome (cond_tvars o prep_typ ctxt) raw_T; |
8096 | 1132 |
val T = if_none opt_T TypeInfer.logicT; |
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1133 |
val ctxt' = ctxt |> declare_terms_syntax (map (fn x => Free (x, T)) xs); |
8096 | 1134 |
in (ctxt', (xs, opt_T)) end; |
1135 |
||
10381 | 1136 |
in |
1137 |
||
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1138 |
val read_vars = prep_vars read_typ false false; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1139 |
val cert_vars = prep_vars cert_typ true false; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1140 |
val read_vars_liberal = prep_vars read_typ false true; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1141 |
val cert_vars_liberal = prep_vars cert_typ true true; |
8096 | 1142 |
|
10381 | 1143 |
end; |
1144 |
||
8096 | 1145 |
|
5819 | 1146 |
(* fix *) |
1147 |
||
8096 | 1148 |
local |
1149 |
||
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1150 |
fun map_fixes f = |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1151 |
map_context (fn (thy, syntax, data, (assumes, fixes), binds, thms, cases, defs) => |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1152 |
(thy, syntax, data, (assumes, f fixes), binds, thms, cases, defs)); |
5819 | 1153 |
|
11925 | 1154 |
fun err_dups ctxt xs = raise CONTEXT ("Duplicate variable(s): " ^ commas_quote xs, ctxt); |
1155 |
||
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1156 |
val declare = |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1157 |
declare_terms_syntax o mapfilter (fn (_, None) => None | (x, Some T) => Some (Free (x, T))); |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1158 |
|
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1159 |
fun add_vars xs Ts ctxt = |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1160 |
let val xs' = Term.variantlist (map Syntax.skolem xs, map #2 (fixes_of ctxt)) in |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1161 |
ctxt |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1162 |
|> declare (xs' ~~ Ts) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1163 |
|> map_fixes (fn fixes => (xs ~~ xs') @ fixes) |
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1164 |
end; |
11925 | 1165 |
|
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1166 |
fun add_vars_direct xs Ts ctxt = |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1167 |
ctxt |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1168 |
|> declare (xs ~~ Ts) |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1169 |
|> map_fixes (fn fixes => |
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1170 |
(case xs inter_string map #1 fixes of |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1171 |
[] => (xs ~~ xs) @ fixes |
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1172 |
| dups => err_dups ctxt dups)); |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1173 |
|
11925 | 1174 |
|
1175 |
fun gen_fix prep add raw_vars ctxt = |
|
8096 | 1176 |
let |
1177 |
val (ctxt', varss) = foldl_map prep (ctxt, raw_vars); |
|
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1178 |
val vars = rev (flat (map (fn (xs, T) => map (rpair T) xs) varss)); |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1179 |
val xs = map #1 vars; |
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1180 |
val Ts = map #2 vars; |
8096 | 1181 |
in |
11925 | 1182 |
(case Library.duplicates xs of [] => () | dups => err_dups ctxt dups); |
12130
30d9143aff7e
syntactic declaration of external *and* internal versions of fixes;
wenzelm
parents:
12123
diff
changeset
|
1183 |
ctxt' |> add xs Ts |
8096 | 1184 |
end; |
5819 | 1185 |
|
12576
9fd10052c3f7
added add_fixes: derives mssing type scheme from mixfix;
wenzelm
parents:
12550
diff
changeset
|
1186 |
fun prep_type (x, None, Some mx) = ([x], Some (mixfix_type mx)) |
9fd10052c3f7
added add_fixes: derives mssing type scheme from mixfix;
wenzelm
parents:
12550
diff
changeset
|
1187 |
| prep_type (x, opt_T, _) = ([x], opt_T); |
9fd10052c3f7
added add_fixes: derives mssing type scheme from mixfix;
wenzelm
parents:
12550
diff
changeset
|
1188 |
|
8096 | 1189 |
in |
7679 | 1190 |
|
11925 | 1191 |
val fix = gen_fix read_vars add_vars; |
1192 |
val fix_i = gen_fix cert_vars add_vars; |
|
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1193 |
|
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1194 |
fun fix_direct liberal = |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1195 |
gen_fix (if liberal then cert_vars_liberal else cert_vars) add_vars_direct; |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1196 |
|
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1197 |
fun add_fixes decls = add_syntax decls o fix_direct false (map prep_type decls); |
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1198 |
fun add_fixes_liberal decls = add_syntax decls o fix_direct true (map prep_type decls); |
8096 | 1199 |
|
1200 |
end; |
|
5819 | 1201 |
|
12048 | 1202 |
fun fix_frees ts ctxt = |
1203 |
let |
|
12504 | 1204 |
val frees = foldl Term.add_frees ([], ts); |
12057 | 1205 |
fun new (x, T) = if is_fixed ctxt x then None else Some ([x], Some T); |
14720
ceff6d4fb836
cleanup up read functions, include liberal versions;
wenzelm
parents:
14707
diff
changeset
|
1206 |
in fix_direct false (rev (mapfilter new frees)) ctxt end; |
12016 | 1207 |
|
6895 | 1208 |
|
9291
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1209 |
(*Note: improper use may result in variable capture / dynamic scoping!*) |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1210 |
fun bind_skolem ctxt xs = |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1211 |
let |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1212 |
val ctxt' = ctxt |> fix_i [(xs, None)]; |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1213 |
fun bind (t as Free (x, T)) = |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1214 |
if x mem_string xs then |
10583 | 1215 |
(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
|
1216 |
else t |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1217 |
| bind (t $ u) = bind t $ bind u |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1218 |
| 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
|
1219 |
| bind a = a; |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1220 |
in bind end; |
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1221 |
|
23705d14be8f
"_i" arguments now expected to have skolems already internalized;
wenzelm
parents:
9274
diff
changeset
|
1222 |
|
5819 | 1223 |
|
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1224 |
(** cases **) |
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1225 |
|
11793
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1226 |
fun prep_case ctxt name xs {fixes, assumes, binds} = |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1227 |
let |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1228 |
fun replace (opt_x :: xs) ((y, T) :: ys) = (if_none opt_x y, T) :: replace xs ys |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1229 |
| replace [] ys = ys |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1230 |
| replace (_ :: _) [] = raise CONTEXT ("Too many parameters for case " ^ quote name, ctxt); |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1231 |
in |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1232 |
if null (foldr Term.add_typ_tvars (map snd fixes, [])) andalso |
13426 | 1233 |
null (foldr Term.add_term_vars (flat (map snd assumes), [])) then |
11793
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1234 |
{fixes = replace xs fixes, assumes = assumes, binds = map drop_schematic binds} |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1235 |
else raise CONTEXT ("Illegal schematic variable(s) in case " ^ quote name, ctxt) |
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1236 |
end; |
8403 | 1237 |
|
11793
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1238 |
fun get_case (ctxt as Context {cases, ...}) name xs = |
8426 | 1239 |
(case assoc (cases, name) of |
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1240 |
None => raise CONTEXT ("Unknown case: " ^ quote name, ctxt) |
11793
5f0ab6f5c280
support impromptu terminology of cases parameters;
wenzelm
parents:
11764
diff
changeset
|
1241 |
| Some c => prep_case ctxt name xs c); |
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1242 |
|
8384 | 1243 |
|
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1244 |
fun add_cases xs = map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) => |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1245 |
(thy, syntax, data, asms, binds, thms, rev (filter_out (equal "" o #1) xs) @ cases, defs)); |
8373
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1246 |
|
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1247 |
|
e7237c8fe29e
handling of local contexts: print_cases, get_case, add_cases;
wenzelm
parents:
8186
diff
changeset
|
1248 |
|
10810 | 1249 |
(** print context information **) |
1250 |
||
1251 |
val verbose = ref false; |
|
1252 |
fun verb f x = if ! verbose then f (x ()) else []; |
|
1253 |
fun verb_single x = verb Library.single x; |
|
1254 |
||
1255 |
fun setmp_verbose f x = Library.setmp verbose true f x; |
|
1256 |
||
1257 |
fun pretty_items prt name items = |
|
1258 |
let |
|
1259 |
fun prt_itms (name, [x]) = Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt x] |
|
1260 |
| prt_itms (name, xs) = Pretty.big_list (name ^ ":") (map prt xs); |
|
1261 |
in |
|
1262 |
if null items andalso not (! verbose) then [] |
|
1263 |
else [Pretty.big_list name (map prt_itms items)] |
|
1264 |
end; |
|
1265 |
||
1266 |
||
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1267 |
(* local syntax *) |
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1268 |
|
12093 | 1269 |
val print_syntax = Syntax.print_syntax o syn_of; |
12072
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1270 |
|
4281198fb8cd
local syntax: add_syntax, proper read/pretty functions;
wenzelm
parents:
12066
diff
changeset
|
1271 |
|
10810 | 1272 |
(* term bindings *) |
1273 |
||
1274 |
val smash_option = fn (_, None) => None | (xi, Some b) => Some (xi, b); |
|
1275 |
||
1276 |
fun pretty_binds (ctxt as Context {binds, ...}) = |
|
1277 |
let |
|
12057 | 1278 |
fun prt_bind (xi, (t, T)) = pretty_term ctxt (Logic.mk_equals (Var (xi, T), t)); |
10810 | 1279 |
val bs = mapfilter smash_option (Vartab.dest binds); |
1280 |
in |
|
1281 |
if null bs andalso not (! verbose) then [] |
|
1282 |
else [Pretty.big_list "term bindings:" (map prt_bind bs)] |
|
1283 |
end; |
|
1284 |
||
1285 |
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds; |
|
1286 |
||
1287 |
||
1288 |
(* local theorems *) |
|
1289 |
||
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1290 |
fun pretty_lthms (ctxt as Context {thms = (_, space, tab, _), ...}) = |
12309
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1291 |
pretty_items (pretty_thm ctxt) "facts:" |
03e9287be350
name space for local thms (export cond_extern, qualified);
wenzelm
parents:
12291
diff
changeset
|
1292 |
(mapfilter smash_option (NameSpace.cond_extern_table space tab)); |
10810 | 1293 |
|
12057 | 1294 |
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms; |
10810 | 1295 |
|
1296 |
||
1297 |
(* local contexts *) |
|
1298 |
||
10830 | 1299 |
fun apply_case ({fixes, assumes, binds}: RuleCases.T) ctxt = |
10810 | 1300 |
let |
10830 | 1301 |
fun bind (c, (x, T)) = (c |> fix_i [([x], Some T)], bind_skolem c [x] (Free (x, T))); |
1302 |
val (ctxt', xs) = foldl_map bind (ctxt, fixes); |
|
10810 | 1303 |
fun app t = foldl Term.betapply (t, xs); |
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1304 |
in (ctxt', (map (apsnd (apsome app)) binds, map (apsnd (map app)) assumes)) end; |
10810 | 1305 |
|
1306 |
fun pretty_cases (ctxt as Context {cases, ...}) = |
|
1307 |
let |
|
12057 | 1308 |
val prt_term = pretty_term ctxt; |
1309 |
||
10810 | 1310 |
fun prt_let (xi, t) = Pretty.block |
10818 | 1311 |
[Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1, |
10810 | 1312 |
Pretty.quote (prt_term t)]; |
1313 |
||
13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1314 |
fun prt_asm (a, ts) = Pretty.block (Pretty.breaks |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1315 |
((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
|
1316 |
|
10810 | 1317 |
fun prt_sect _ _ _ [] = [] |
1318 |
| prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s :: |
|
1319 |
flat (Library.separate sep (map (Library.single o prt) xs))))]; |
|
1320 |
||
10830 | 1321 |
fun prt_case (name, (fixes, (lets, asms))) = Pretty.block (Pretty.fbreaks |
10810 | 1322 |
(Pretty.str (name ^ ":") :: |
11915 | 1323 |
prt_sect "fix" [] (Pretty.str o fst) fixes @ |
10810 | 1324 |
prt_sect "let" [Pretty.str "and"] prt_let |
1325 |
(mapfilter (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
|
1326 |
(if forall (null o #2) asms then [] |
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13415
diff
changeset
|
1327 |
else prt_sect "assume" [Pretty.str "and"] prt_asm asms))); |
10810 | 1328 |
|
1329 |
val cases' = rev (Library.gen_distinct Library.eq_fst cases); |
|
1330 |
in |
|
1331 |
if null cases andalso not (! verbose) then [] |
|
10830 | 1332 |
else [Pretty.big_list "cases:" |
1333 |
(map (prt_case o apsnd (fn c => (#fixes c, #2 (apply_case c ctxt)))) cases')] |
|
10810 | 1334 |
end; |
1335 |
||
1336 |
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases; |
|
1337 |
||
1338 |
||
12057 | 1339 |
(* core context *) |
10810 | 1340 |
|
1341 |
val prems_limit = ref 10; |
|
1342 |
||
12057 | 1343 |
fun pretty_asms ctxt = |
10810 | 1344 |
let |
12057 | 1345 |
val prt_term = pretty_term ctxt; |
1346 |
||
12093 | 1347 |
(*structures*) |
1348 |
val (_, structs, _) = syntax_of ctxt; |
|
1349 |
val prt_structs = if null structs then [] |
|
1350 |
else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 :: |
|
1351 |
Pretty.commas (map Pretty.str structs))]; |
|
1352 |
||
12057 | 1353 |
(*fixes*) |
1354 |
fun prt_fix (x, x') = |
|
1355 |
if x = x' then Pretty.str x |
|
1356 |
else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')]; |
|
12093 | 1357 |
val fixes = rev (filter_out |
1358 |
((can Syntax.dest_internal o #1) orf (fn (_, x') => x' mem_string structs)) (fixes_of ctxt)); |
|
1359 |
val prt_fixes = if null fixes then [] |
|
1360 |
else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 :: |
|
1361 |
Pretty.commas (map prt_fix fixes))]; |
|
12057 | 1362 |
|
1363 |
(*prems*) |
|
10810 | 1364 |
val limit = ! prems_limit; |
1365 |
val prems = prems_of ctxt; |
|
1366 |
val len = length prems; |
|
12093 | 1367 |
val prt_prems = if null prems then [] |
1368 |
else [Pretty.big_list "prems:" ((if len <= limit then [] else [Pretty.str "..."]) @ |
|
1369 |
map (pretty_thm ctxt) (Library.drop (len - limit, prems)))]; |
|
1370 |
||
1371 |
in prt_structs @ prt_fixes @ prt_prems end; |
|
10810 | 1372 |
|
1373 |
||
1374 |
(* main context *) |
|
1375 |
||
12291 | 1376 |
fun pretty_context (ctxt as Context {cases, defs = (types, sorts, used, _), ...}) = |
10810 | 1377 |
let |
12057 | 1378 |
val prt_term = pretty_term ctxt; |
1379 |
val prt_typ = pretty_typ ctxt; |
|
1380 |
val prt_sort = pretty_sort ctxt; |
|
10810 | 1381 |
|
1382 |
(*theory*) |
|
12057 | 1383 |
val pretty_thy = Pretty.block |
1384 |
[Pretty.str "Theory:", Pretty.brk 1, Sign.pretty_sg (sign_of ctxt)]; |
|
10810 | 1385 |
|
1386 |
(*defaults*) |
|
1387 |
fun prt_atom prt prtT (x, X) = Pretty.block |
|
1388 |
[prt x, Pretty.str " ::", Pretty.brk 1, prtT X]; |
|
1389 |
||
1390 |
fun prt_var (x, ~1) = prt_term (Syntax.free x) |
|
1391 |
| prt_var xi = prt_term (Syntax.var xi); |
|
1392 |
||
1393 |
fun prt_varT (x, ~1) = prt_typ (TFree (x, [])) |
|
1394 |
| prt_varT xi = prt_typ (TVar (xi, [])); |
|
1395 |
||
1396 |
val prt_defT = prt_atom prt_var prt_typ; |
|
1397 |
val prt_defS = prt_atom prt_varT prt_sort; |
|
1398 |
in |
|
1399 |
verb_single (K pretty_thy) @ |
|
12057 | 1400 |
pretty_asms ctxt @ |
10810 | 1401 |
verb pretty_binds (K ctxt) @ |
12057 | 1402 |
verb pretty_lthms (K ctxt) @ |
10810 | 1403 |
verb pretty_cases (K ctxt) @ |
1404 |
verb_single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @ |
|
1405 |
verb_single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) @ |
|
1406 |
verb_single (fn () => Pretty.strs ("used type variable names:" :: used)) |
|
1407 |
end; |
|
1408 |
||
1409 |
||
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1410 |
(* print_thms_containing *) |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1411 |
|
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1412 |
fun lthms_containing (ctxt as Context {thms = (_, _, _, index), ...}) idx = |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1413 |
let |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1414 |
fun valid (name, ths) = |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1415 |
(case try (transform_error (fn () => get_thms ctxt name)) () of |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1416 |
None => false |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1417 |
| Some ths' => Library.equal_lists Thm.eq_thm (ths, ths')); |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1418 |
in gen_distinct eq_fst (filter valid (FactIndex.find idx index)) end; |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1419 |
|
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1420 |
|
13284 | 1421 |
val thms_containing_limit = ref 40; |
1422 |
||
1423 |
fun print_thms_containing ctxt opt_limit ss = |
|
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1424 |
let |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1425 |
val prt_term = pretty_term ctxt; |
13282 | 1426 |
val prt_fact = pretty_fact ctxt; |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1427 |
fun prt_consts [] = [] |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1428 |
| prt_consts cs = [Pretty.block (Pretty.breaks (Pretty.str "constants" :: |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1429 |
map (Pretty.quote o prt_term o Syntax.const) cs))]; |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1430 |
fun prt_frees [] = [] |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1431 |
| prt_frees xs = [Pretty.block (Pretty.breaks (Pretty.str "variables" :: |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1432 |
map (Pretty.quote o prt_term o Syntax.free) xs))]; |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1433 |
|
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1434 |
val (cs, xs) = foldl (FactIndex.index_term (is_known ctxt)) |
13542 | 1435 |
(([], []), map (read_term_dummies ctxt) ss); |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1436 |
val empty_idx = Library.null cs andalso Library.null xs; |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1437 |
|
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1438 |
val header = |
13378 | 1439 |
if empty_idx then [Pretty.block [Pretty.str "Known facts:", Pretty.fbrk]] |
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1440 |
else [Pretty.block (Pretty.breaks (Pretty.str "Facts containing" :: |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1441 |
separate (Pretty.str "and") (prt_consts cs @ prt_frees xs)) @ |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1442 |
[Pretty.str ":", Pretty.fbrk])] |
13284 | 1443 |
val facts = |
1444 |
PureThy.thms_containing (theory_of ctxt) (cs, xs) @ lthms_containing ctxt (cs, xs) |
|
1445 |
|> sort_wrt #1; |
|
1446 |
val len = length facts; |
|
1447 |
val limit = if_none opt_limit (! thms_containing_limit); |
|
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1448 |
in |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1449 |
if empty_idx andalso not (Library.null ss) then |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1450 |
warning "thms_containing: no consts/frees in specification" |
13284 | 1451 |
else (header @ (if len <= limit then [] else [Pretty.str "..."]) @ |
1452 |
map prt_fact (Library.drop (len - limit, facts))) |> Pretty.chunks |> Pretty.writeln |
|
13278
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1453 |
end; |
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1454 |
|
b62514fcbcab
print_thms_containing: index variables, refer to local facts as well;
wenzelm
parents:
12863
diff
changeset
|
1455 |
|
10810 | 1456 |
|
5819 | 1457 |
(** theory setup **) |
1458 |
||
1459 |
val setup = [ProofDataData.init]; |
|
1460 |
||
1461 |
end; |