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