wenzelm@19899
|
1 |
(* Title: Pure/variable.ML
|
wenzelm@19899
|
2 |
ID: $Id$
|
wenzelm@19899
|
3 |
Author: Makarius
|
wenzelm@19899
|
4 |
|
wenzelm@19899
|
5 |
Fixed type/term variables and polymorphic term abbreviations.
|
wenzelm@19899
|
6 |
*)
|
wenzelm@19899
|
7 |
|
wenzelm@19899
|
8 |
signature VARIABLE =
|
wenzelm@19899
|
9 |
sig
|
wenzelm@20303
|
10 |
val is_body: Proof.context -> bool
|
wenzelm@20303
|
11 |
val set_body: bool -> Proof.context -> Proof.context
|
wenzelm@20303
|
12 |
val restore_body: Proof.context -> Proof.context -> Proof.context
|
wenzelm@20303
|
13 |
val names_of: Proof.context -> Name.context
|
wenzelm@20303
|
14 |
val fixes_of: Proof.context -> (string * string) list
|
wenzelm@20303
|
15 |
val binds_of: Proof.context -> (typ * term) Vartab.table
|
wenzelm@20303
|
16 |
val constraints_of: Proof.context -> typ Vartab.table * sort Vartab.table
|
wenzelm@20303
|
17 |
val is_declared: Proof.context -> string -> bool
|
wenzelm@20303
|
18 |
val is_fixed: Proof.context -> string -> bool
|
wenzelm@20303
|
19 |
val newly_fixed: Proof.context -> Proof.context -> string -> bool
|
wenzelm@21571
|
20 |
val add_fixed: Proof.context -> term -> (string * typ) list -> (string * typ) list
|
wenzelm@20303
|
21 |
val default_type: Proof.context -> string -> typ option
|
wenzelm@20303
|
22 |
val def_type: Proof.context -> bool -> indexname -> typ option
|
wenzelm@20303
|
23 |
val def_sort: Proof.context -> indexname -> sort option
|
wenzelm@20303
|
24 |
val declare_constraints: term -> Proof.context -> Proof.context
|
wenzelm@20303
|
25 |
val declare_internal: term -> Proof.context -> Proof.context
|
wenzelm@20303
|
26 |
val declare_term: term -> Proof.context -> Proof.context
|
wenzelm@20303
|
27 |
val declare_prf: Proofterm.proof -> Proof.context -> Proof.context
|
wenzelm@20303
|
28 |
val declare_thm: thm -> Proof.context -> Proof.context
|
wenzelm@20303
|
29 |
val thm_context: thm -> Proof.context
|
wenzelm@20303
|
30 |
val variant_frees: Proof.context -> term list -> (string * 'a) list -> (string * 'a) list
|
wenzelm@20303
|
31 |
val add_binds: (indexname * term option) list -> Proof.context -> Proof.context
|
wenzelm@20303
|
32 |
val expand_binds: Proof.context -> term -> term
|
wenzelm@20303
|
33 |
val add_fixes: string list -> Proof.context -> string list * Proof.context
|
wenzelm@20303
|
34 |
val add_fixes_direct: string list -> Proof.context -> Proof.context
|
wenzelm@21369
|
35 |
val auto_fixes: term -> Proof.context -> Proof.context
|
wenzelm@20797
|
36 |
val variant_fixes: string list -> Proof.context -> string list * Proof.context
|
wenzelm@20303
|
37 |
val invent_types: sort list -> Proof.context -> (string * sort) list * Proof.context
|
wenzelm@20303
|
38 |
val export_terms: Proof.context -> Proof.context -> term list -> term list
|
wenzelm@20303
|
39 |
val exportT_terms: Proof.context -> Proof.context -> term list -> term list
|
wenzelm@20303
|
40 |
val exportT: Proof.context -> Proof.context -> thm list -> thm list
|
wenzelm@20303
|
41 |
val export_prf: Proof.context -> Proof.context -> Proofterm.proof -> Proofterm.proof
|
wenzelm@20303
|
42 |
val export: Proof.context -> Proof.context -> thm list -> thm list
|
wenzelm@21522
|
43 |
val export_morphism: Proof.context -> Proof.context -> morphism
|
wenzelm@20303
|
44 |
val importT_inst: term list -> Proof.context -> ((indexname * sort) * typ) list * Proof.context
|
wenzelm@20303
|
45 |
val import_inst: bool -> term list -> Proof.context ->
|
wenzelm@20303
|
46 |
(((indexname * sort) * typ) list * ((indexname * typ) * term) list) * Proof.context
|
wenzelm@20303
|
47 |
val importT_terms: term list -> Proof.context -> term list * Proof.context
|
wenzelm@20303
|
48 |
val import_terms: bool -> term list -> Proof.context -> term list * Proof.context
|
wenzelm@22601
|
49 |
val importT_thms: thm list -> Proof.context -> (ctyp list * thm list) * Proof.context
|
wenzelm@20303
|
50 |
val import_prf: bool -> Proofterm.proof -> Proof.context -> Proofterm.proof * Proof.context
|
wenzelm@22568
|
51 |
val import_thms: bool -> thm list -> Proof.context ->
|
wenzelm@20303
|
52 |
((ctyp list * cterm list) * thm list) * Proof.context
|
wenzelm@21287
|
53 |
val tradeT: (Proof.context -> thm list -> thm list) -> Proof.context -> thm list -> thm list
|
wenzelm@21287
|
54 |
val trade: (Proof.context -> thm list -> thm list) -> Proof.context -> thm list -> thm list
|
wenzelm@20303
|
55 |
val focus: cterm -> Proof.context -> (cterm list * cterm) * Proof.context
|
wenzelm@20303
|
56 |
val focus_subgoal: int -> thm -> Proof.context -> (cterm list * cterm) * Proof.context
|
wenzelm@20303
|
57 |
val warn_extra_tfrees: Proof.context -> Proof.context -> unit
|
wenzelm@20303
|
58 |
val polymorphic: Proof.context -> term list -> term list
|
wenzelm@19899
|
59 |
end;
|
wenzelm@19899
|
60 |
|
wenzelm@19899
|
61 |
structure Variable: VARIABLE =
|
wenzelm@19899
|
62 |
struct
|
wenzelm@19899
|
63 |
|
wenzelm@19899
|
64 |
(** local context data **)
|
wenzelm@19899
|
65 |
|
wenzelm@19899
|
66 |
datatype data = Data of
|
wenzelm@20102
|
67 |
{is_body: bool, (*inner body mode*)
|
wenzelm@20162
|
68 |
names: Name.context, (*type/term variable names*)
|
wenzelm@20162
|
69 |
fixes: (string * string) list, (*term fixes -- extern/intern*)
|
wenzelm@20102
|
70 |
binds: (typ * term) Vartab.table, (*term bindings*)
|
wenzelm@20162
|
71 |
type_occs: string list Symtab.table, (*type variables -- possibly within term variables*)
|
wenzelm@20162
|
72 |
constraints:
|
wenzelm@20102
|
73 |
typ Vartab.table * (*type constraints*)
|
wenzelm@20162
|
74 |
sort Vartab.table}; (*default sorts*)
|
wenzelm@19899
|
75 |
|
wenzelm@20162
|
76 |
fun make_data (is_body, names, fixes, binds, type_occs, constraints) =
|
wenzelm@20162
|
77 |
Data {is_body = is_body, names = names, fixes = fixes, binds = binds,
|
wenzelm@20162
|
78 |
type_occs = type_occs, constraints = constraints};
|
wenzelm@19899
|
79 |
|
wenzelm@19899
|
80 |
structure Data = ProofDataFun
|
wenzelm@19899
|
81 |
(
|
wenzelm@19899
|
82 |
val name = "Pure/variable";
|
wenzelm@19899
|
83 |
type T = data;
|
wenzelm@19899
|
84 |
fun init thy =
|
wenzelm@20162
|
85 |
make_data (false, Name.context, [], Vartab.empty, Symtab.empty, (Vartab.empty, Vartab.empty));
|
wenzelm@19899
|
86 |
fun print _ _ = ();
|
wenzelm@19899
|
87 |
);
|
wenzelm@19899
|
88 |
|
wenzelm@19899
|
89 |
val _ = Context.add_setup Data.init;
|
wenzelm@19899
|
90 |
|
wenzelm@19899
|
91 |
fun map_data f =
|
wenzelm@20162
|
92 |
Data.map (fn Data {is_body, names, fixes, binds, type_occs, constraints} =>
|
wenzelm@20162
|
93 |
make_data (f (is_body, names, fixes, binds, type_occs, constraints)));
|
wenzelm@19899
|
94 |
|
wenzelm@20162
|
95 |
fun map_names f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
|
wenzelm@20162
|
96 |
(is_body, f names, fixes, binds, type_occs, constraints));
|
wenzelm@19899
|
97 |
|
wenzelm@20162
|
98 |
fun map_fixes f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
|
wenzelm@20162
|
99 |
(is_body, names, f fixes, binds, type_occs, constraints));
|
wenzelm@19899
|
100 |
|
wenzelm@20162
|
101 |
fun map_binds f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
|
wenzelm@20162
|
102 |
(is_body, names, fixes, f binds, type_occs, constraints));
|
wenzelm@20102
|
103 |
|
wenzelm@20162
|
104 |
fun map_type_occs f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
|
wenzelm@20162
|
105 |
(is_body, names, fixes, binds, f type_occs, constraints));
|
wenzelm@20162
|
106 |
|
wenzelm@20162
|
107 |
fun map_constraints f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
|
wenzelm@20162
|
108 |
(is_body, names, fixes, binds, type_occs, f constraints));
|
wenzelm@19899
|
109 |
|
wenzelm@19899
|
110 |
fun rep_data ctxt = Data.get ctxt |> (fn Data args => args);
|
wenzelm@19899
|
111 |
|
wenzelm@19899
|
112 |
val is_body = #is_body o rep_data;
|
wenzelm@20162
|
113 |
fun set_body b = map_data (fn (_, names, fixes, binds, type_occs, constraints) =>
|
wenzelm@20162
|
114 |
(b, names, fixes, binds, type_occs, constraints));
|
wenzelm@19899
|
115 |
fun restore_body ctxt = set_body (is_body ctxt);
|
wenzelm@19899
|
116 |
|
wenzelm@20102
|
117 |
val names_of = #names o rep_data;
|
wenzelm@20102
|
118 |
val fixes_of = #fixes o rep_data;
|
wenzelm@19899
|
119 |
val binds_of = #binds o rep_data;
|
wenzelm@20162
|
120 |
val type_occs_of = #type_occs o rep_data;
|
wenzelm@20162
|
121 |
val constraints_of = #constraints o rep_data;
|
wenzelm@19899
|
122 |
|
wenzelm@20162
|
123 |
val is_declared = Name.is_declared o names_of;
|
wenzelm@19899
|
124 |
fun is_fixed ctxt x = exists (fn (_, y) => x = y) (fixes_of ctxt);
|
wenzelm@20149
|
125 |
fun newly_fixed inner outer x = is_fixed inner x andalso not (is_fixed outer x);
|
wenzelm@19899
|
126 |
|
wenzelm@21571
|
127 |
fun add_fixed ctxt = Term.fold_aterms
|
wenzelm@21571
|
128 |
(fn Free (x, T) => if is_fixed ctxt x then insert (op =) (x, T) else I | _ => I);
|
wenzelm@21571
|
129 |
|
wenzelm@19899
|
130 |
|
wenzelm@19899
|
131 |
|
wenzelm@19899
|
132 |
(** declarations **)
|
wenzelm@19899
|
133 |
|
wenzelm@19899
|
134 |
(* default sorts and types *)
|
wenzelm@19899
|
135 |
|
wenzelm@20162
|
136 |
fun default_type ctxt x = Vartab.lookup (#1 (constraints_of ctxt)) (x, ~1);
|
wenzelm@19899
|
137 |
|
wenzelm@19899
|
138 |
fun def_type ctxt pattern xi =
|
wenzelm@20162
|
139 |
let val {binds, constraints = (types, _), ...} = rep_data ctxt in
|
wenzelm@19899
|
140 |
(case Vartab.lookup types xi of
|
wenzelm@19899
|
141 |
NONE =>
|
wenzelm@19899
|
142 |
if pattern then NONE
|
wenzelm@19899
|
143 |
else Vartab.lookup binds xi |> Option.map (TypeInfer.polymorphicT o #1)
|
wenzelm@19899
|
144 |
| some => some)
|
wenzelm@19899
|
145 |
end;
|
wenzelm@19899
|
146 |
|
wenzelm@20162
|
147 |
val def_sort = Vartab.lookup o #2 o constraints_of;
|
wenzelm@19899
|
148 |
|
wenzelm@19899
|
149 |
|
wenzelm@20162
|
150 |
(* names *)
|
wenzelm@19899
|
151 |
|
wenzelm@20162
|
152 |
val declare_type_names = map_names o
|
wenzelm@20162
|
153 |
fold_types (fold_atyps (fn TFree (a, _) => Name.declare a | _ => I));
|
wenzelm@19899
|
154 |
|
wenzelm@20162
|
155 |
fun declare_names t =
|
wenzelm@20162
|
156 |
declare_type_names t #>
|
wenzelm@20162
|
157 |
map_names (fold_aterms (fn Free (x, _) => Name.declare x | _ => I) t);
|
wenzelm@19899
|
158 |
|
wenzelm@19899
|
159 |
|
wenzelm@20162
|
160 |
(* type occurrences *)
|
wenzelm@19899
|
161 |
|
wenzelm@22671
|
162 |
val decl_type_occs = fold_term_types
|
wenzelm@20162
|
163 |
(fn Free (x, _) => fold_atyps (fn TFree (a, _) => Symtab.insert_list (op =) (a, x) | _ => I)
|
wenzelm@20162
|
164 |
| _ => fold_atyps (fn TFree (a, _) => Symtab.default (a, []) | _ => I));
|
wenzelm@19899
|
165 |
|
wenzelm@22671
|
166 |
val declare_type_occs = map_type_occs o decl_type_occs;
|
wenzelm@22671
|
167 |
|
wenzelm@19899
|
168 |
|
wenzelm@20162
|
169 |
(* constraints *)
|
wenzelm@20084
|
170 |
|
wenzelm@21355
|
171 |
fun constrain_tvar (xi, S) =
|
wenzelm@21355
|
172 |
if S = dummyS then Vartab.delete_safe xi else Vartab.update (xi, S);
|
wenzelm@21355
|
173 |
|
wenzelm@20162
|
174 |
fun declare_constraints t = map_constraints (fn (types, sorts) =>
|
wenzelm@20162
|
175 |
let
|
wenzelm@20162
|
176 |
val types' = fold_aterms
|
wenzelm@20162
|
177 |
(fn Free (x, T) => Vartab.update ((x, ~1), T)
|
wenzelm@20162
|
178 |
| Var v => Vartab.update v
|
wenzelm@20162
|
179 |
| _ => I) t types;
|
wenzelm@20162
|
180 |
val sorts' = fold_types (fold_atyps
|
wenzelm@21355
|
181 |
(fn TFree (x, S) => constrain_tvar ((x, ~1), S)
|
wenzelm@21355
|
182 |
| TVar v => constrain_tvar v
|
wenzelm@20162
|
183 |
| _ => I)) t sorts;
|
wenzelm@20162
|
184 |
in (types', sorts') end)
|
wenzelm@22711
|
185 |
#> declare_type_names t;
|
wenzelm@19899
|
186 |
|
wenzelm@19899
|
187 |
|
wenzelm@20162
|
188 |
(* common declarations *)
|
wenzelm@19899
|
189 |
|
wenzelm@20162
|
190 |
fun declare_internal t =
|
wenzelm@20162
|
191 |
declare_names t #>
|
wenzelm@20162
|
192 |
declare_type_occs t;
|
wenzelm@19911
|
193 |
|
wenzelm@20162
|
194 |
fun declare_term t =
|
wenzelm@20162
|
195 |
declare_internal t #>
|
wenzelm@20162
|
196 |
declare_constraints t;
|
wenzelm@19899
|
197 |
|
wenzelm@20303
|
198 |
val declare_prf = Proofterm.fold_proof_terms declare_internal (declare_internal o Logic.mk_type);
|
wenzelm@20303
|
199 |
|
wenzelm@22691
|
200 |
val declare_thm = Thm.fold_terms declare_internal;
|
wenzelm@21522
|
201 |
fun thm_context th = declare_thm th (ProofContext.init (Thm.theory_of_thm th));
|
wenzelm@19899
|
202 |
|
wenzelm@19899
|
203 |
|
wenzelm@19899
|
204 |
(* renaming term/type frees *)
|
wenzelm@19899
|
205 |
|
wenzelm@20162
|
206 |
fun variant_frees ctxt ts frees =
|
wenzelm@19899
|
207 |
let
|
wenzelm@20162
|
208 |
val names = names_of (fold declare_names ts ctxt);
|
wenzelm@20084
|
209 |
val xs = fst (Name.variants (map #1 frees) names);
|
wenzelm@20084
|
210 |
in xs ~~ map snd frees end;
|
wenzelm@19899
|
211 |
|
wenzelm@19899
|
212 |
|
wenzelm@19899
|
213 |
|
wenzelm@20303
|
214 |
(** term bindings **)
|
wenzelm@20303
|
215 |
|
wenzelm@20303
|
216 |
fun add_bind (xi, NONE) = map_binds (Vartab.delete_safe xi)
|
wenzelm@20303
|
217 |
| add_bind ((x, i), SOME t) =
|
wenzelm@20303
|
218 |
let
|
wenzelm@20303
|
219 |
val T = Term.fastype_of t;
|
wenzelm@20303
|
220 |
val t' =
|
wenzelm@21683
|
221 |
if null (Term.hidden_polymorphism t T) then t
|
wenzelm@20303
|
222 |
else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
|
wenzelm@20303
|
223 |
in declare_term t' #> map_binds (Vartab.update ((x, i), (T, t'))) end;
|
wenzelm@20303
|
224 |
|
wenzelm@20303
|
225 |
val add_binds = fold add_bind;
|
wenzelm@20303
|
226 |
|
wenzelm@20303
|
227 |
fun expand_binds ctxt =
|
wenzelm@20303
|
228 |
let
|
wenzelm@20303
|
229 |
val binds = binds_of ctxt;
|
wenzelm@21799
|
230 |
val get = fn Var (xi, _) => Vartab.lookup binds xi | _ => NONE;
|
wenzelm@21799
|
231 |
in Envir.beta_norm o Envir.expand_term get end;
|
wenzelm@20303
|
232 |
|
wenzelm@20303
|
233 |
|
wenzelm@20303
|
234 |
|
wenzelm@19911
|
235 |
(** fixes **)
|
wenzelm@19911
|
236 |
|
wenzelm@20084
|
237 |
local
|
wenzelm@20084
|
238 |
|
wenzelm@19911
|
239 |
fun no_dups [] = ()
|
wenzelm@19911
|
240 |
| no_dups dups = error ("Duplicate fixed variable(s): " ^ commas_quote dups);
|
wenzelm@19911
|
241 |
|
wenzelm@20102
|
242 |
fun new_fixes names' xs xs' =
|
wenzelm@20102
|
243 |
map_names (K names') #>
|
wenzelm@20102
|
244 |
map_fixes (fn fixes => (rev (xs ~~ xs') @ fixes)) #>
|
wenzelm@20162
|
245 |
fold (declare_constraints o Syntax.free) xs' #>
|
wenzelm@20084
|
246 |
pair xs';
|
wenzelm@20084
|
247 |
|
wenzelm@20084
|
248 |
in
|
wenzelm@20084
|
249 |
|
wenzelm@19911
|
250 |
fun add_fixes xs ctxt =
|
wenzelm@19911
|
251 |
let
|
wenzelm@20084
|
252 |
val _ =
|
wenzelm@20084
|
253 |
(case filter (can Name.dest_skolem) xs of [] => ()
|
wenzelm@20084
|
254 |
| bads => error ("Illegal internal Skolem constant(s): " ^ commas_quote bads));
|
wenzelm@20084
|
255 |
val _ = no_dups (duplicates (op =) xs);
|
wenzelm@19911
|
256 |
val (ys, zs) = split_list (fixes_of ctxt);
|
wenzelm@20102
|
257 |
val names = names_of ctxt;
|
wenzelm@20084
|
258 |
val (xs', names') =
|
wenzelm@20149
|
259 |
if is_body ctxt then Name.variants xs names |>> map Name.skolem
|
wenzelm@20084
|
260 |
else (no_dups (xs inter_string ys); no_dups (xs inter_string zs);
|
wenzelm@20084
|
261 |
(xs, fold Name.declare xs names));
|
wenzelm@20102
|
262 |
in ctxt |> new_fixes names' xs xs' end;
|
wenzelm@19911
|
263 |
|
wenzelm@20797
|
264 |
fun variant_fixes raw_xs ctxt =
|
wenzelm@20084
|
265 |
let
|
wenzelm@20102
|
266 |
val names = names_of ctxt;
|
wenzelm@20149
|
267 |
val xs = map Name.clean raw_xs;
|
wenzelm@20149
|
268 |
val (xs', names') = Name.variants xs names |>> map Name.skolem;
|
wenzelm@20102
|
269 |
in ctxt |> new_fixes names' xs xs' end;
|
wenzelm@20084
|
270 |
|
wenzelm@20084
|
271 |
end;
|
wenzelm@19911
|
272 |
|
wenzelm@20251
|
273 |
|
wenzelm@20251
|
274 |
fun add_fixes_direct xs ctxt = ctxt
|
wenzelm@20251
|
275 |
|> set_body false
|
wenzelm@20251
|
276 |
|> (snd o add_fixes xs)
|
wenzelm@20251
|
277 |
|> restore_body ctxt;
|
wenzelm@20251
|
278 |
|
wenzelm@20251
|
279 |
fun fix_frees t ctxt = ctxt
|
wenzelm@20251
|
280 |
|> add_fixes_direct
|
wenzelm@20251
|
281 |
(rev (fold_aterms (fn Free (x, _) =>
|
wenzelm@21369
|
282 |
if is_fixed ctxt x then I else insert (op =) x | _ => I) t []));
|
wenzelm@21369
|
283 |
|
wenzelm@21369
|
284 |
fun auto_fixes t ctxt =
|
wenzelm@21369
|
285 |
(if is_body ctxt then ctxt else fix_frees t ctxt)
|
wenzelm@20251
|
286 |
|> declare_term t;
|
wenzelm@20251
|
287 |
|
wenzelm@19911
|
288 |
fun invent_types Ss ctxt =
|
wenzelm@19911
|
289 |
let
|
wenzelm@20102
|
290 |
val tfrees = Name.invents (names_of ctxt) "'a" (length Ss) ~~ Ss;
|
wenzelm@20162
|
291 |
val ctxt' = fold (declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
|
wenzelm@19911
|
292 |
in (tfrees, ctxt') end;
|
wenzelm@19911
|
293 |
|
wenzelm@19911
|
294 |
|
wenzelm@19911
|
295 |
|
wenzelm@22671
|
296 |
(** export -- generalize type/term variables (beware of closure sizes) **)
|
wenzelm@19911
|
297 |
|
wenzelm@19911
|
298 |
fun export_inst inner outer =
|
wenzelm@19911
|
299 |
let
|
wenzelm@20162
|
300 |
val declared_outer = is_declared outer;
|
wenzelm@19911
|
301 |
val fixes_inner = fixes_of inner;
|
wenzelm@19911
|
302 |
val fixes_outer = fixes_of outer;
|
wenzelm@19911
|
303 |
|
wenzelm@19911
|
304 |
val gen_fixes = map #2 (Library.take (length fixes_inner - length fixes_outer, fixes_inner));
|
wenzelm@20162
|
305 |
val still_fixed = not o member (op =) gen_fixes;
|
wenzelm@22671
|
306 |
|
wenzelm@22671
|
307 |
val type_occs_inner = type_occs_of inner;
|
wenzelm@22671
|
308 |
fun gen_fixesT ts =
|
wenzelm@19911
|
309 |
Symtab.fold (fn (a, xs) =>
|
wenzelm@20162
|
310 |
if declared_outer a orelse exists still_fixed xs
|
wenzelm@22671
|
311 |
then I else cons a) (fold decl_type_occs ts type_occs_inner) [];
|
wenzelm@19911
|
312 |
in (gen_fixesT, gen_fixes) end;
|
wenzelm@19911
|
313 |
|
wenzelm@19911
|
314 |
fun exportT_inst inner outer = #1 (export_inst inner outer);
|
wenzelm@19911
|
315 |
|
wenzelm@22671
|
316 |
fun exportT_terms inner outer =
|
wenzelm@22671
|
317 |
let val mk_tfrees = exportT_inst inner outer in
|
wenzelm@22671
|
318 |
fn ts => ts |> map
|
wenzelm@22671
|
319 |
(TermSubst.generalize (mk_tfrees ts, [])
|
wenzelm@22671
|
320 |
(fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1))
|
wenzelm@22671
|
321 |
end;
|
wenzelm@19911
|
322 |
|
wenzelm@22671
|
323 |
fun export_terms inner outer =
|
wenzelm@22671
|
324 |
let val (mk_tfrees, tfrees) = export_inst inner outer in
|
wenzelm@22671
|
325 |
fn ts => ts |> map
|
wenzelm@22671
|
326 |
(TermSubst.generalize (mk_tfrees ts, tfrees)
|
wenzelm@22671
|
327 |
(fold Term.maxidx_term ts ~1 + 1))
|
wenzelm@22671
|
328 |
end;
|
wenzelm@19911
|
329 |
|
wenzelm@20303
|
330 |
fun export_prf inner outer prf =
|
wenzelm@20303
|
331 |
let
|
wenzelm@22671
|
332 |
val (mk_tfrees, frees) = export_inst (declare_prf prf inner) outer;
|
wenzelm@22671
|
333 |
val tfrees = mk_tfrees [];
|
wenzelm@20303
|
334 |
val idx = Proofterm.maxidx_proof prf ~1 + 1;
|
wenzelm@22671
|
335 |
val gen_term = TermSubst.generalize_option (tfrees, frees) idx;
|
wenzelm@22671
|
336 |
val gen_typ = TermSubst.generalizeT_option tfrees idx;
|
wenzelm@20303
|
337 |
in Proofterm.map_proof_terms_option gen_term gen_typ prf end;
|
wenzelm@20303
|
338 |
|
wenzelm@22671
|
339 |
|
wenzelm@22671
|
340 |
fun gen_export (mk_tfrees, frees) ths =
|
wenzelm@19911
|
341 |
let
|
wenzelm@22671
|
342 |
val tfrees = mk_tfrees (map Thm.full_prop_of ths);
|
wenzelm@22671
|
343 |
val maxidx = fold Thm.maxidx_thm ths ~1;
|
wenzelm@22671
|
344 |
in map (Thm.generalize (tfrees, frees) (maxidx + 1)) ths end;
|
wenzelm@19911
|
345 |
|
wenzelm@22671
|
346 |
fun exportT inner outer = gen_export (exportT_inst inner outer, []);
|
wenzelm@22671
|
347 |
fun export inner outer = gen_export (export_inst inner outer);
|
wenzelm@19911
|
348 |
|
wenzelm@21522
|
349 |
fun export_morphism inner outer =
|
wenzelm@21522
|
350 |
let
|
wenzelm@21522
|
351 |
val fact = export inner outer;
|
wenzelm@21522
|
352 |
val term = singleton (export_terms inner outer);
|
wenzelm@21522
|
353 |
val typ = Logic.type_map term;
|
wenzelm@21522
|
354 |
in Morphism.morphism {name = I, var = I, typ = typ, term = term, fact = fact} end;
|
wenzelm@19911
|
355 |
|
wenzelm@19911
|
356 |
|
wenzelm@19911
|
357 |
(** import -- fix schematic type/term variables **)
|
wenzelm@19911
|
358 |
|
wenzelm@19911
|
359 |
fun importT_inst ts ctxt =
|
wenzelm@19911
|
360 |
let
|
wenzelm@19911
|
361 |
val tvars = rev (fold Term.add_tvars ts []);
|
wenzelm@19911
|
362 |
val (tfrees, ctxt') = invent_types (map #2 tvars) ctxt;
|
wenzelm@19911
|
363 |
in (tvars ~~ map TFree tfrees, ctxt') end;
|
wenzelm@19911
|
364 |
|
wenzelm@19911
|
365 |
fun import_inst is_open ts ctxt =
|
wenzelm@19911
|
366 |
let
|
wenzelm@20198
|
367 |
val ren = if is_open then I else Name.internal;
|
wenzelm@19911
|
368 |
val (instT, ctxt') = importT_inst ts ctxt;
|
wenzelm@20509
|
369 |
val vars = map (apsnd (TermSubst.instantiateT instT)) (rev (fold Term.add_vars ts []));
|
wenzelm@20797
|
370 |
val (xs, ctxt'') = variant_fixes (map (ren o #1 o #1) vars) ctxt';
|
wenzelm@19911
|
371 |
val inst = vars ~~ map Free (xs ~~ map #2 vars);
|
wenzelm@19911
|
372 |
in ((instT, inst), ctxt'') end;
|
wenzelm@19911
|
373 |
|
wenzelm@19911
|
374 |
fun importT_terms ts ctxt =
|
wenzelm@19911
|
375 |
let val (instT, ctxt') = importT_inst ts ctxt
|
wenzelm@20509
|
376 |
in (map (TermSubst.instantiate (instT, [])) ts, ctxt') end;
|
wenzelm@19911
|
377 |
|
wenzelm@19911
|
378 |
fun import_terms is_open ts ctxt =
|
wenzelm@19911
|
379 |
let val (inst, ctxt') = import_inst is_open ts ctxt
|
wenzelm@20509
|
380 |
in (map (TermSubst.instantiate inst) ts, ctxt') end;
|
wenzelm@19911
|
381 |
|
wenzelm@22601
|
382 |
fun importT_thms ths ctxt =
|
wenzelm@19911
|
383 |
let
|
wenzelm@21522
|
384 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@19911
|
385 |
val certT = Thm.ctyp_of thy;
|
wenzelm@19911
|
386 |
val (instT, ctxt') = importT_inst (map Thm.full_prop_of ths) ctxt;
|
wenzelm@19911
|
387 |
val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
|
wenzelm@19911
|
388 |
val ths' = map (Thm.instantiate (instT', [])) ths;
|
wenzelm@20220
|
389 |
in ((map #2 instT', ths'), ctxt') end;
|
wenzelm@19911
|
390 |
|
wenzelm@20303
|
391 |
fun import_prf is_open prf ctxt =
|
wenzelm@20303
|
392 |
let
|
wenzelm@20303
|
393 |
val ts = rev (Proofterm.fold_proof_terms cons (cons o Logic.mk_type) prf []);
|
wenzelm@20303
|
394 |
val (insts, ctxt') = import_inst is_open ts ctxt;
|
wenzelm@20303
|
395 |
in (Proofterm.instantiate insts prf, ctxt') end;
|
wenzelm@20303
|
396 |
|
wenzelm@22568
|
397 |
fun import_thms is_open ths ctxt =
|
wenzelm@19911
|
398 |
let
|
wenzelm@21522
|
399 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@19911
|
400 |
val cert = Thm.cterm_of thy;
|
wenzelm@19911
|
401 |
val certT = Thm.ctyp_of thy;
|
wenzelm@19911
|
402 |
val ((instT, inst), ctxt') = import_inst is_open (map Thm.full_prop_of ths) ctxt;
|
wenzelm@19911
|
403 |
val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
|
wenzelm@19911
|
404 |
val inst' = map (fn (v, t) => (cert (Var v), cert t)) inst;
|
wenzelm@19911
|
405 |
val ths' = map (Thm.instantiate (instT', inst')) ths;
|
wenzelm@20220
|
406 |
in (((map #2 instT', map #2 inst'), ths'), ctxt') end;
|
wenzelm@19911
|
407 |
|
wenzelm@19911
|
408 |
|
wenzelm@19926
|
409 |
(* import/export *)
|
wenzelm@19926
|
410 |
|
wenzelm@21287
|
411 |
fun gen_trade imp exp f ctxt ths =
|
wenzelm@20220
|
412 |
let val ((_, ths'), ctxt') = imp ths ctxt
|
wenzelm@21287
|
413 |
in exp ctxt' ctxt (f ctxt' ths') end;
|
wenzelm@19926
|
414 |
|
wenzelm@22601
|
415 |
val tradeT = gen_trade importT_thms exportT;
|
wenzelm@22568
|
416 |
val trade = gen_trade (import_thms true) export;
|
wenzelm@19926
|
417 |
|
wenzelm@19926
|
418 |
|
wenzelm@20162
|
419 |
(* focus on outermost parameters *)
|
wenzelm@20149
|
420 |
|
wenzelm@20149
|
421 |
fun forall_elim_prop t prop =
|
wenzelm@20579
|
422 |
Thm.beta_conversion false (Thm.capply (Thm.dest_arg prop) t)
|
wenzelm@20579
|
423 |
|> Thm.cprop_of |> Thm.dest_arg;
|
wenzelm@20149
|
424 |
|
wenzelm@20149
|
425 |
fun focus goal ctxt =
|
wenzelm@20149
|
426 |
let
|
wenzelm@20149
|
427 |
val cert = Thm.cterm_of (Thm.theory_of_cterm goal);
|
wenzelm@20149
|
428 |
val t = Thm.term_of goal;
|
wenzelm@20162
|
429 |
val ps = Term.variant_frees t (Term.strip_all_vars t); (*as they are printed :-*)
|
wenzelm@20149
|
430 |
val (xs, Ts) = split_list ps;
|
wenzelm@20797
|
431 |
val (xs', ctxt') = variant_fixes xs ctxt;
|
wenzelm@20220
|
432 |
val ps' = ListPair.map (cert o Free) (xs', Ts);
|
wenzelm@20220
|
433 |
val goal' = fold forall_elim_prop ps' goal;
|
wenzelm@20149
|
434 |
in ((ps', goal'), ctxt') end;
|
wenzelm@20149
|
435 |
|
wenzelm@20303
|
436 |
fun focus_subgoal i st =
|
wenzelm@20303
|
437 |
let
|
wenzelm@22691
|
438 |
val all_vars = Thm.fold_terms Term.add_vars st [];
|
wenzelm@20303
|
439 |
val no_binds = map (fn (xi, _) => (xi, NONE)) all_vars;
|
wenzelm@20303
|
440 |
in
|
wenzelm@20303
|
441 |
add_binds no_binds #>
|
wenzelm@20303
|
442 |
fold (declare_constraints o Var) all_vars #>
|
wenzelm@20303
|
443 |
focus (Thm.cprem_of st i)
|
wenzelm@20303
|
444 |
end;
|
wenzelm@20303
|
445 |
|
wenzelm@20303
|
446 |
|
wenzelm@19911
|
447 |
|
wenzelm@19911
|
448 |
(** implicit polymorphism **)
|
wenzelm@19899
|
449 |
|
wenzelm@19899
|
450 |
(* warn_extra_tfrees *)
|
wenzelm@19899
|
451 |
|
wenzelm@19899
|
452 |
fun warn_extra_tfrees ctxt1 ctxt2 =
|
wenzelm@19899
|
453 |
let
|
wenzelm@19911
|
454 |
fun occs_typ a = Term.exists_subtype (fn TFree (b, _) => a = b | _ => false);
|
wenzelm@20162
|
455 |
fun occs_free a x =
|
wenzelm@20162
|
456 |
(case def_type ctxt1 false (x, ~1) of
|
wenzelm@20162
|
457 |
SOME T => if occs_typ a T then I else cons (a, x)
|
wenzelm@20162
|
458 |
| NONE => cons (a, x));
|
wenzelm@19899
|
459 |
|
wenzelm@20162
|
460 |
val occs1 = type_occs_of ctxt1;
|
wenzelm@20162
|
461 |
val occs2 = type_occs_of ctxt2;
|
wenzelm@19911
|
462 |
val extras = Symtab.fold (fn (a, xs) =>
|
wenzelm@19911
|
463 |
if Symtab.defined occs1 a then I else fold (occs_free a) xs) occs2 [];
|
wenzelm@19899
|
464 |
val tfrees = map #1 extras |> sort_distinct string_ord;
|
wenzelm@19899
|
465 |
val frees = map #2 extras |> sort_distinct string_ord;
|
wenzelm@19899
|
466 |
in
|
wenzelm@19899
|
467 |
if null extras then ()
|
wenzelm@19899
|
468 |
else warning ("Introduced fixed type variable(s): " ^ commas tfrees ^ " in " ^
|
wenzelm@19899
|
469 |
space_implode " or " (map quote frees))
|
wenzelm@19899
|
470 |
end;
|
wenzelm@19899
|
471 |
|
wenzelm@19899
|
472 |
|
wenzelm@20149
|
473 |
(* polymorphic terms *)
|
wenzelm@19899
|
474 |
|
wenzelm@19899
|
475 |
fun polymorphic ctxt ts =
|
wenzelm@20003
|
476 |
let
|
wenzelm@20003
|
477 |
val ctxt' = fold declare_term ts ctxt;
|
wenzelm@20162
|
478 |
val occs = type_occs_of ctxt;
|
wenzelm@20162
|
479 |
val occs' = type_occs_of ctxt';
|
wenzelm@20162
|
480 |
val types = Symtab.fold (fn (a, _) => if Symtab.defined occs a then I else cons a) occs' [];
|
wenzelm@20003
|
481 |
val idx = fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1;
|
wenzelm@20509
|
482 |
in map (TermSubst.generalize (types, []) idx) ts end;
|
wenzelm@20003
|
483 |
|
wenzelm@19899
|
484 |
end;
|