wenzelm@20894
|
1 |
(* Title: Pure/Isar/theory_target.ML
|
wenzelm@20894
|
2 |
ID: $Id$
|
wenzelm@20894
|
3 |
Author: Makarius
|
wenzelm@20894
|
4 |
|
haftmann@25542
|
5 |
Common theory/locale/class/instantiation/overloading targets.
|
wenzelm@20894
|
6 |
*)
|
wenzelm@20894
|
7 |
|
wenzelm@20894
|
8 |
signature THEORY_TARGET =
|
wenzelm@20894
|
9 |
sig
|
haftmann@25462
|
10 |
val peek: local_theory -> {target: string, is_locale: bool,
|
haftmann@25864
|
11 |
is_class: bool, instantiation: string list * (string * sort) list * sort,
|
haftmann@25864
|
12 |
overloading: (string * (string * typ) * bool) list}
|
haftmann@25269
|
13 |
val init: string option -> theory -> local_theory
|
wenzelm@24935
|
14 |
val begin: string -> Proof.context -> local_theory
|
wenzelm@25291
|
15 |
val context: xstring -> theory -> local_theory
|
haftmann@25864
|
16 |
val instantiation: string list * (string * sort) list * sort -> theory -> local_theory
|
haftmann@25864
|
17 |
val overloading: (string * (string * typ) * bool) list -> theory -> local_theory
|
wenzelm@26049
|
18 |
val overloading_cmd: (string * string * bool) list -> theory -> local_theory
|
wenzelm@20894
|
19 |
end;
|
wenzelm@20894
|
20 |
|
wenzelm@20894
|
21 |
structure TheoryTarget: THEORY_TARGET =
|
wenzelm@20894
|
22 |
struct
|
wenzelm@20894
|
23 |
|
wenzelm@21006
|
24 |
(* context data *)
|
wenzelm@21006
|
25 |
|
haftmann@25462
|
26 |
datatype target = Target of {target: string, is_locale: bool,
|
haftmann@25864
|
27 |
is_class: bool, instantiation: string list * (string * sort) list * sort,
|
haftmann@25864
|
28 |
overloading: (string * (string * typ) * bool) list};
|
wenzelm@25012
|
29 |
|
haftmann@25519
|
30 |
fun make_target target is_locale is_class instantiation overloading =
|
haftmann@25462
|
31 |
Target {target = target, is_locale = is_locale,
|
haftmann@25519
|
32 |
is_class = is_class, instantiation = instantiation, overloading = overloading};
|
wenzelm@25291
|
33 |
|
haftmann@25542
|
34 |
val global_target = make_target "" false false ([], [], []) [];
|
wenzelm@25012
|
35 |
|
wenzelm@21006
|
36 |
structure Data = ProofDataFun
|
wenzelm@21006
|
37 |
(
|
wenzelm@25012
|
38 |
type T = target;
|
wenzelm@25291
|
39 |
fun init _ = global_target;
|
wenzelm@21006
|
40 |
);
|
wenzelm@21006
|
41 |
|
wenzelm@25012
|
42 |
val peek = (fn Target args => args) o Data.get;
|
wenzelm@21006
|
43 |
|
wenzelm@21006
|
44 |
|
wenzelm@20894
|
45 |
(* pretty *)
|
wenzelm@20894
|
46 |
|
haftmann@25607
|
47 |
fun pretty_thy ctxt target is_locale is_class =
|
wenzelm@20894
|
48 |
let
|
wenzelm@20894
|
49 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@25012
|
50 |
val target_name = (if is_class then "class " else "locale ") ^ Locale.extern thy target;
|
wenzelm@20894
|
51 |
val fixes = map (fn (x, T) => (x, SOME T, NoSyn)) (#1 (ProofContext.inferred_fixes ctxt));
|
wenzelm@21585
|
52 |
val assumes = map (fn A => (("", []), [(A, [])])) (map Thm.term_of (Assumption.assms_of ctxt));
|
wenzelm@20894
|
53 |
val elems =
|
wenzelm@20894
|
54 |
(if null fixes then [] else [Element.Fixes fixes]) @
|
wenzelm@20894
|
55 |
(if null assumes then [] else [Element.Assumes assumes]);
|
wenzelm@26049
|
56 |
in
|
wenzelm@26049
|
57 |
if target = "" then []
|
haftmann@25607
|
58 |
else if null elems then [Pretty.str target_name]
|
haftmann@25607
|
59 |
else [Pretty.big_list (target_name ^ " =")
|
haftmann@25607
|
60 |
(map (Pretty.chunks o Element.pretty_ctxt ctxt) elems)]
|
wenzelm@20894
|
61 |
end;
|
wenzelm@20894
|
62 |
|
haftmann@25607
|
63 |
fun pretty (Target {target, is_locale, is_class, instantiation, overloading}) ctxt =
|
haftmann@25607
|
64 |
Pretty.block [Pretty.str "theory", Pretty.brk 1,
|
haftmann@25607
|
65 |
Pretty.str (Context.theory_name (ProofContext.theory_of ctxt))] ::
|
haftmann@25607
|
66 |
(if not (null overloading) then [Overloading.pretty ctxt]
|
wenzelm@26049
|
67 |
else if not (null (#1 instantiation)) then [Class.pretty_instantiation ctxt]
|
wenzelm@26049
|
68 |
else pretty_thy ctxt target is_locale is_class);
|
haftmann@25607
|
69 |
|
wenzelm@20894
|
70 |
|
haftmann@24838
|
71 |
(* target declarations *)
|
haftmann@24838
|
72 |
|
wenzelm@25012
|
73 |
fun target_decl add (Target {target, ...}) d lthy =
|
haftmann@24838
|
74 |
let
|
wenzelm@24935
|
75 |
val d' = Morphism.transform (LocalTheory.target_morphism lthy) d;
|
haftmann@24838
|
76 |
val d0 = Morphism.form d';
|
haftmann@24838
|
77 |
in
|
wenzelm@25012
|
78 |
if target = "" then
|
haftmann@24838
|
79 |
lthy
|
haftmann@24838
|
80 |
|> LocalTheory.theory (Context.theory_map d0)
|
haftmann@24838
|
81 |
|> LocalTheory.target (Context.proof_map d0)
|
haftmann@24838
|
82 |
else
|
haftmann@24838
|
83 |
lthy
|
wenzelm@25012
|
84 |
|> LocalTheory.target (add target d')
|
haftmann@24838
|
85 |
end;
|
haftmann@24838
|
86 |
|
haftmann@24838
|
87 |
val type_syntax = target_decl Locale.add_type_syntax;
|
haftmann@24838
|
88 |
val term_syntax = target_decl Locale.add_term_syntax;
|
haftmann@24838
|
89 |
val declaration = target_decl Locale.add_declaration;
|
haftmann@24838
|
90 |
|
wenzelm@25105
|
91 |
fun class_target (Target {target, ...}) f =
|
wenzelm@25105
|
92 |
LocalTheory.raw_theory f #>
|
wenzelm@25105
|
93 |
LocalTheory.target (Class.refresh_syntax target);
|
haftmann@24838
|
94 |
|
wenzelm@21611
|
95 |
|
wenzelm@20894
|
96 |
(* notes *)
|
wenzelm@20894
|
97 |
|
wenzelm@21611
|
98 |
fun import_export_proof ctxt (name, raw_th) =
|
wenzelm@21594
|
99 |
let
|
wenzelm@21611
|
100 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@21611
|
101 |
val thy_ctxt = ProofContext.init thy;
|
wenzelm@21611
|
102 |
val certT = Thm.ctyp_of thy;
|
wenzelm@21611
|
103 |
val cert = Thm.cterm_of thy;
|
wenzelm@21585
|
104 |
|
wenzelm@21611
|
105 |
(*export assumes/defines*)
|
wenzelm@21611
|
106 |
val th = Goal.norm_result raw_th;
|
wenzelm@21611
|
107 |
val (defs, th') = LocalDefs.export ctxt thy_ctxt th;
|
wenzelm@21708
|
108 |
val concl_conv = MetaSimplifier.rewrite true defs (Thm.cprop_of th);
|
wenzelm@21708
|
109 |
val assms = map (MetaSimplifier.rewrite_rule defs o Thm.assume) (Assumption.assms_of ctxt);
|
wenzelm@21611
|
110 |
val nprems = Thm.nprems_of th' - Thm.nprems_of th;
|
wenzelm@21585
|
111 |
|
wenzelm@21611
|
112 |
(*export fixes*)
|
wenzelm@22692
|
113 |
val tfrees = map TFree (Thm.fold_terms Term.add_tfrees th' []);
|
wenzelm@22692
|
114 |
val frees = map Free (Thm.fold_terms Term.add_frees th' []);
|
wenzelm@21611
|
115 |
val (th'' :: vs) = (th' :: map (Drule.mk_term o cert) (map Logic.mk_type tfrees @ frees))
|
wenzelm@21611
|
116 |
|> Variable.export ctxt thy_ctxt
|
wenzelm@21611
|
117 |
|> Drule.zero_var_indexes_list;
|
wenzelm@21611
|
118 |
|
wenzelm@21611
|
119 |
(*thm definition*)
|
wenzelm@21644
|
120 |
val result = th''
|
wenzelm@21644
|
121 |
|> PureThy.name_thm true true ""
|
wenzelm@21644
|
122 |
|> Goal.close_result
|
wenzelm@25959
|
123 |
|> fold PureThy.tag_rule (Position.properties_of (Position.thread_data ()))
|
wenzelm@21644
|
124 |
|> PureThy.name_thm true true name;
|
wenzelm@21611
|
125 |
|
wenzelm@21611
|
126 |
(*import fixes*)
|
wenzelm@21611
|
127 |
val (tvars, vars) =
|
wenzelm@21611
|
128 |
chop (length tfrees) (map (Thm.term_of o Drule.dest_term) vs)
|
wenzelm@21611
|
129 |
|>> map Logic.dest_type;
|
wenzelm@21611
|
130 |
|
wenzelm@21611
|
131 |
val instT = map_filter (fn (TVar v, T) => SOME (v, T) | _ => NONE) (tvars ~~ tfrees);
|
wenzelm@21611
|
132 |
val inst = filter (is_Var o fst) (vars ~~ frees);
|
wenzelm@21611
|
133 |
val cinstT = map (pairself certT o apfst TVar) instT;
|
wenzelm@21611
|
134 |
val cinst = map (pairself (cert o Term.map_types (TermSubst.instantiateT instT))) inst;
|
wenzelm@21611
|
135 |
val result' = Thm.instantiate (cinstT, cinst) result;
|
wenzelm@21611
|
136 |
|
wenzelm@21611
|
137 |
(*import assumes/defines*)
|
wenzelm@21594
|
138 |
val assm_tac = FIRST' (map (fn assm => Tactic.compose_tac (false, assm, 0)) assms);
|
wenzelm@21611
|
139 |
val result'' =
|
wenzelm@21611
|
140 |
(case SINGLE (Seq.INTERVAL assm_tac 1 nprems) result' of
|
wenzelm@21611
|
141 |
NONE => raise THM ("Failed to re-import result", 0, [result'])
|
wenzelm@21845
|
142 |
| SOME res => LocalDefs.trans_props ctxt [res, Thm.symmetric concl_conv])
|
wenzelm@21644
|
143 |
|> Goal.norm_result
|
wenzelm@21644
|
144 |
|> PureThy.name_thm false false name;
|
wenzelm@21611
|
145 |
|
wenzelm@21611
|
146 |
in (result'', result) end;
|
wenzelm@21611
|
147 |
|
haftmann@25684
|
148 |
fun note_local kind facts ctxt =
|
haftmann@25684
|
149 |
ctxt
|
haftmann@25684
|
150 |
|> ProofContext.qualified_names
|
haftmann@25684
|
151 |
|> ProofContext.note_thmss_i kind facts
|
haftmann@25684
|
152 |
||> ProofContext.restore_naming ctxt;
|
haftmann@25684
|
153 |
|
wenzelm@26132
|
154 |
fun notes (Target {target, is_locale, ...}) kind facts lthy =
|
wenzelm@21585
|
155 |
let
|
wenzelm@21594
|
156 |
val thy = ProofContext.theory_of lthy;
|
wenzelm@21615
|
157 |
val full = LocalTheory.full_name lthy;
|
wenzelm@21585
|
158 |
|
wenzelm@21594
|
159 |
val facts' = facts
|
wenzelm@21615
|
160 |
|> map (fn (a, bs) => (a, PureThy.burrow_fact (PureThy.name_multi (full (fst a))) bs))
|
wenzelm@21615
|
161 |
|> PureThy.map_facts (import_export_proof lthy);
|
wenzelm@21611
|
162 |
val local_facts = PureThy.map_facts #1 facts'
|
wenzelm@21611
|
163 |
|> Attrib.map_facts (Attrib.attribute_i thy);
|
wenzelm@21611
|
164 |
val target_facts = PureThy.map_facts #1 facts'
|
wenzelm@25012
|
165 |
|> is_locale ? Element.facts_map (Element.morph_ctxt (LocalTheory.target_morphism lthy));
|
wenzelm@21611
|
166 |
val global_facts = PureThy.map_facts #2 facts'
|
wenzelm@25012
|
167 |
|> Attrib.map_facts (if is_locale then K I else Attrib.attribute_i thy);
|
wenzelm@21594
|
168 |
in
|
wenzelm@21611
|
169 |
lthy |> LocalTheory.theory
|
wenzelm@21611
|
170 |
(Sign.qualified_names
|
wenzelm@26132
|
171 |
#> PureThy.note_thmss_grouped kind (LocalTheory.group_of lthy) global_facts #> snd
|
wenzelm@21611
|
172 |
#> Sign.restore_naming thy)
|
wenzelm@21585
|
173 |
|
haftmann@25684
|
174 |
|> not is_locale ? LocalTheory.target (note_local kind global_facts #> snd)
|
wenzelm@25012
|
175 |
|> is_locale ? LocalTheory.target (Locale.add_thmss target kind target_facts)
|
wenzelm@21594
|
176 |
|
haftmann@25684
|
177 |
|> note_local kind local_facts
|
wenzelm@20894
|
178 |
end;
|
wenzelm@20894
|
179 |
|
wenzelm@20894
|
180 |
|
wenzelm@25105
|
181 |
(* declare_const *)
|
wenzelm@24939
|
182 |
|
wenzelm@25105
|
183 |
fun fork_mixfix (Target {is_locale, is_class, ...}) mx =
|
wenzelm@25105
|
184 |
if not is_locale then (NoSyn, NoSyn, mx)
|
wenzelm@25105
|
185 |
else if not is_class then (NoSyn, mx, NoSyn)
|
wenzelm@25105
|
186 |
else (mx, NoSyn, NoSyn);
|
wenzelm@25068
|
187 |
|
wenzelm@26132
|
188 |
fun locale_const (Target {target, is_class, ...}) (prmode as (mode, _)) tags ((c, mx), rhs) phi =
|
wenzelm@24939
|
189 |
let
|
wenzelm@24939
|
190 |
val c' = Morphism.name phi c;
|
wenzelm@24939
|
191 |
val rhs' = Morphism.term phi rhs;
|
wenzelm@25053
|
192 |
val legacy_arg = (c', Term.close_schematic_term (Logic.legacy_varify rhs'));
|
wenzelm@25053
|
193 |
val arg = (c', Term.close_schematic_term rhs');
|
wenzelm@25372
|
194 |
val similar_body = Type.similar_types (rhs, rhs');
|
wenzelm@25212
|
195 |
(* FIXME workaround based on educated guess *)
|
wenzelm@25372
|
196 |
val class_global = c' = NameSpace.qualified (Class.class_prefix target) c;
|
wenzelm@24939
|
197 |
in
|
wenzelm@25372
|
198 |
not (is_class andalso (similar_body orelse class_global)) ?
|
wenzelm@25212
|
199 |
(Context.mapping_result
|
wenzelm@26132
|
200 |
(Sign.add_abbrev PrintMode.internal tags legacy_arg)
|
wenzelm@26132
|
201 |
(ProofContext.add_abbrev PrintMode.internal tags arg)
|
wenzelm@25212
|
202 |
#-> (fn (lhs' as Const (d, _), _) =>
|
wenzelm@25372
|
203 |
similar_body ?
|
wenzelm@25212
|
204 |
(Context.mapping (Sign.revert_abbrev mode d) (ProofContext.revert_abbrev mode d) #>
|
wenzelm@25212
|
205 |
Morphism.form (ProofContext.target_notation true prmode [(lhs', mx)]))))
|
wenzelm@24939
|
206 |
end;
|
wenzelm@24939
|
207 |
|
haftmann@25485
|
208 |
fun declare_const (ta as Target {target, is_locale, is_class, ...}) depends ((c, T), mx) lthy =
|
wenzelm@24939
|
209 |
let
|
wenzelm@26132
|
210 |
val tags = LocalTheory.group_position_of lthy;
|
wenzelm@24939
|
211 |
val xs = filter depends (#1 (ProofContext.inferred_fixes (LocalTheory.target_of lthy)));
|
wenzelm@25105
|
212 |
val U = map #2 xs ---> T;
|
wenzelm@25105
|
213 |
val (mx1, mx2, mx3) = fork_mixfix ta mx;
|
haftmann@25519
|
214 |
fun syntax_error c = error ("Illegal mixfix syntax for overloaded constant " ^ quote c);
|
wenzelm@26049
|
215 |
val declare_const =
|
wenzelm@26049
|
216 |
(case Class.instantiation_param lthy c of
|
wenzelm@26049
|
217 |
SOME c' =>
|
wenzelm@26049
|
218 |
if mx3 <> NoSyn then syntax_error c'
|
haftmann@25597
|
219 |
else LocalTheory.theory_result (AxClass.declare_overloaded (c', U))
|
haftmann@25485
|
220 |
##> Class.confirm_declaration c
|
wenzelm@26049
|
221 |
| NONE =>
|
wenzelm@26049
|
222 |
(case Overloading.operation lthy c of
|
wenzelm@26049
|
223 |
SOME (c', _) =>
|
wenzelm@26049
|
224 |
if mx3 <> NoSyn then syntax_error c'
|
wenzelm@26049
|
225 |
else LocalTheory.theory_result (Overloading.declare (c', U))
|
wenzelm@26049
|
226 |
##> Overloading.confirm c
|
wenzelm@26132
|
227 |
| NONE => LocalTheory.theory_result (Sign.declare_const tags (c, U, mx3))));
|
haftmann@25485
|
228 |
val (const, lthy') = lthy |> declare_const;
|
wenzelm@25105
|
229 |
val t = Term.list_comb (const, map Free xs);
|
wenzelm@24939
|
230 |
in
|
wenzelm@24939
|
231 |
lthy'
|
wenzelm@26132
|
232 |
|> is_locale ? term_syntax ta (locale_const ta Syntax.mode_default tags ((c, mx2), t))
|
wenzelm@26132
|
233 |
|> is_class ? class_target ta (Class.declare target tags ((c, mx1), t))
|
wenzelm@25105
|
234 |
|> LocalDefs.add_def ((c, NoSyn), t)
|
wenzelm@24939
|
235 |
end;
|
wenzelm@24939
|
236 |
|
wenzelm@24939
|
237 |
|
wenzelm@24939
|
238 |
(* abbrev *)
|
wenzelm@24939
|
239 |
|
haftmann@25485
|
240 |
fun abbrev (ta as Target {target, is_locale, is_class, ...}) prmode ((c, mx), t) lthy =
|
wenzelm@24939
|
241 |
let
|
wenzelm@26132
|
242 |
val tags = LocalTheory.group_position_of lthy;
|
wenzelm@25053
|
243 |
val thy_ctxt = ProofContext.init (ProofContext.theory_of lthy);
|
wenzelm@25012
|
244 |
val target_ctxt = LocalTheory.target_of lthy;
|
wenzelm@25053
|
245 |
|
wenzelm@25105
|
246 |
val (mx1, mx2, mx3) = fork_mixfix ta mx;
|
wenzelm@25105
|
247 |
val t' = Assumption.export_term lthy target_ctxt t;
|
wenzelm@25105
|
248 |
val xs = map Free (rev (Variable.add_fixed target_ctxt t' []));
|
wenzelm@25105
|
249 |
val u = fold_rev lambda xs t';
|
wenzelm@25105
|
250 |
val global_rhs =
|
wenzelm@25105
|
251 |
singleton (Variable.export_terms (Variable.declare_term u target_ctxt) thy_ctxt) u;
|
wenzelm@25121
|
252 |
in
|
wenzelm@25121
|
253 |
lthy |>
|
wenzelm@25121
|
254 |
(if is_locale then
|
wenzelm@26132
|
255 |
LocalTheory.theory_result (Sign.add_abbrev PrintMode.internal tags (c, global_rhs))
|
wenzelm@25121
|
256 |
#-> (fn (lhs, _) =>
|
wenzelm@25105
|
257 |
let val lhs' = Term.list_comb (Logic.unvarify lhs, xs) in
|
wenzelm@26132
|
258 |
term_syntax ta (locale_const ta prmode tags ((c, mx2), lhs')) #>
|
wenzelm@26132
|
259 |
is_class ? class_target ta (Class.abbrev target prmode tags ((c, mx1), t'))
|
wenzelm@25105
|
260 |
end)
|
wenzelm@25105
|
261 |
else
|
wenzelm@25121
|
262 |
LocalTheory.theory
|
wenzelm@26132
|
263 |
(Sign.add_abbrev (#1 prmode) tags (c, global_rhs) #-> (fn (lhs, _) =>
|
wenzelm@25121
|
264 |
Sign.notation true prmode [(lhs, mx3)])))
|
wenzelm@26132
|
265 |
|> ProofContext.add_abbrev PrintMode.internal tags (c, t) |> snd
|
wenzelm@25121
|
266 |
|> LocalDefs.fixed_abbrev ((c, NoSyn), t)
|
wenzelm@25053
|
267 |
end;
|
haftmann@25040
|
268 |
|
wenzelm@24939
|
269 |
|
wenzelm@25022
|
270 |
(* define *)
|
wenzelm@24939
|
271 |
|
haftmann@25485
|
272 |
fun define (ta as Target {target, is_locale, is_class, ...})
|
wenzelm@26132
|
273 |
kind ((c, mx), ((name, atts), rhs)) lthy =
|
wenzelm@24987
|
274 |
let
|
wenzelm@24987
|
275 |
val thy = ProofContext.theory_of lthy;
|
wenzelm@24987
|
276 |
val thy_ctxt = ProofContext.init thy;
|
wenzelm@24939
|
277 |
|
wenzelm@25022
|
278 |
val name' = Thm.def_name_optional c name;
|
wenzelm@24987
|
279 |
val (rhs', rhs_conv) =
|
wenzelm@24987
|
280 |
LocalDefs.export_cterm lthy thy_ctxt (Thm.cterm_of thy rhs) |>> Thm.term_of;
|
wenzelm@24987
|
281 |
val xs = Variable.add_fixed (LocalTheory.target_of lthy) rhs' [];
|
wenzelm@24939
|
282 |
val T = Term.fastype_of rhs;
|
wenzelm@24939
|
283 |
|
wenzelm@25105
|
284 |
(*const*)
|
wenzelm@25105
|
285 |
val ((lhs, local_def), lthy2) = lthy |> declare_const ta (member (op =) xs) ((c, T), mx);
|
wenzelm@25022
|
286 |
val (_, lhs') = Logic.dest_equals (Thm.prop_of local_def);
|
wenzelm@24939
|
287 |
|
wenzelm@24939
|
288 |
(*def*)
|
wenzelm@26049
|
289 |
val define_const =
|
wenzelm@26049
|
290 |
(case Overloading.operation lthy c of
|
wenzelm@26049
|
291 |
SOME (_, checked) =>
|
haftmann@25519
|
292 |
(fn name => fn (Const (c, _), rhs) => Overloading.define checked name (c, rhs))
|
wenzelm@26049
|
293 |
| NONE =>
|
wenzelm@26049
|
294 |
if is_none (Class.instantiation_param lthy c)
|
haftmann@25519
|
295 |
then (fn name => fn eq => Thm.add_def false false (name, Logic.mk_equals eq))
|
wenzelm@26049
|
296 |
else (fn name => fn (Const (c, _), rhs) => AxClass.define_overloaded name (c, rhs)));
|
wenzelm@25022
|
297 |
val (global_def, lthy3) = lthy2
|
haftmann@25462
|
298 |
|> LocalTheory.theory_result (define_const name' (lhs', rhs'));
|
haftmann@25485
|
299 |
val def = LocalDefs.trans_terms lthy3
|
wenzelm@25022
|
300 |
[(*c == global.c xs*) local_def,
|
wenzelm@25022
|
301 |
(*global.c xs == rhs'*) global_def,
|
haftmann@25485
|
302 |
(*rhs' == rhs*) Thm.symmetric rhs_conv];
|
wenzelm@24939
|
303 |
|
wenzelm@25105
|
304 |
(*note*)
|
wenzelm@24939
|
305 |
val ([(res_name, [res])], lthy4) = lthy3
|
wenzelm@26132
|
306 |
|> notes ta kind [((name', atts), [([def], [])])];
|
wenzelm@24939
|
307 |
in ((lhs, (res_name, res)), lthy4) end;
|
wenzelm@24939
|
308 |
|
wenzelm@24939
|
309 |
|
wenzelm@24939
|
310 |
(* axioms *)
|
wenzelm@24939
|
311 |
|
wenzelm@26132
|
312 |
fun axioms ta kind (vars, specs) lthy =
|
wenzelm@24939
|
313 |
let
|
wenzelm@25022
|
314 |
val thy_ctxt = ProofContext.init (ProofContext.theory_of lthy);
|
wenzelm@25022
|
315 |
val expanded_props = map (Assumption.export_term lthy thy_ctxt) (maps snd specs);
|
wenzelm@25022
|
316 |
val xs = fold Term.add_frees expanded_props [];
|
wenzelm@24989
|
317 |
|
wenzelm@25022
|
318 |
(*consts*)
|
wenzelm@25105
|
319 |
val (consts, lthy') = fold_map (declare_const ta (member (op =) xs)) vars lthy;
|
wenzelm@25022
|
320 |
val global_consts = map (Term.dest_Const o Term.head_of o Thm.term_of o Thm.rhs_of o #2) consts;
|
wenzelm@25022
|
321 |
|
wenzelm@25022
|
322 |
(*axioms*)
|
haftmann@25514
|
323 |
val hyps = map Thm.term_of (Assumption.assms_of lthy');
|
wenzelm@24939
|
324 |
fun axiom ((name, atts), props) thy = thy
|
wenzelm@24983
|
325 |
|> fold_map (Thm.add_axiom hyps) (PureThy.name_multi name props)
|
wenzelm@24939
|
326 |
|-> (fn ths => pair ((name, atts), [(ths, [])]));
|
wenzelm@24939
|
327 |
in
|
wenzelm@24987
|
328 |
lthy'
|
wenzelm@25022
|
329 |
|> fold Variable.declare_term expanded_props
|
wenzelm@25022
|
330 |
|> LocalTheory.theory (fold (fn c => Theory.add_deps "" c []) global_consts)
|
wenzelm@24939
|
331 |
|> LocalTheory.theory_result (fold_map axiom specs)
|
wenzelm@26132
|
332 |
|-> notes ta kind
|
wenzelm@24987
|
333 |
|>> pair (map #1 consts)
|
wenzelm@24939
|
334 |
end;
|
wenzelm@24939
|
335 |
|
wenzelm@24939
|
336 |
|
wenzelm@25291
|
337 |
(* init *)
|
wenzelm@20894
|
338 |
|
wenzelm@25291
|
339 |
local
|
haftmann@25269
|
340 |
|
wenzelm@25291
|
341 |
fun init_target _ NONE = global_target
|
wenzelm@26049
|
342 |
| init_target thy (SOME target) =
|
wenzelm@26049
|
343 |
make_target target true (Class.is_class thy target) ([], [], []) [];
|
haftmann@25519
|
344 |
|
haftmann@25519
|
345 |
fun init_ctxt (Target {target, is_locale, is_class, instantiation, overloading}) =
|
wenzelm@26049
|
346 |
if not (null (#1 instantiation)) then Class.init_instantiation instantiation
|
haftmann@25519
|
347 |
else if not (null overloading) then Overloading.init overloading
|
haftmann@25485
|
348 |
else if not is_locale then ProofContext.init
|
haftmann@25485
|
349 |
else if not is_class then Locale.init target
|
haftmann@25485
|
350 |
else Class.init target;
|
haftmann@25462
|
351 |
|
haftmann@25542
|
352 |
fun init_lthy (ta as Target {target, instantiation, overloading, ...}) =
|
wenzelm@25291
|
353 |
Data.put ta #>
|
wenzelm@25291
|
354 |
LocalTheory.init (NameSpace.base target)
|
wenzelm@25291
|
355 |
{pretty = pretty ta,
|
wenzelm@25291
|
356 |
axioms = axioms ta,
|
wenzelm@25291
|
357 |
abbrev = abbrev ta,
|
wenzelm@25291
|
358 |
define = define ta,
|
wenzelm@25291
|
359 |
notes = notes ta,
|
wenzelm@25291
|
360 |
type_syntax = type_syntax ta,
|
wenzelm@25291
|
361 |
term_syntax = term_syntax ta,
|
wenzelm@25291
|
362 |
declaration = declaration ta,
|
wenzelm@25291
|
363 |
reinit = fn lthy => init_lthy_ctxt ta (ProofContext.theory_of lthy),
|
wenzelm@26049
|
364 |
exit = LocalTheory.target_of o
|
wenzelm@26049
|
365 |
(if not (null (#1 instantiation)) then Class.conclude_instantiation
|
wenzelm@26049
|
366 |
else if not (null overloading) then Overloading.conclude
|
wenzelm@26049
|
367 |
else I)}
|
wenzelm@25291
|
368 |
and init_lthy_ctxt ta = init_lthy ta o init_ctxt ta;
|
haftmann@25269
|
369 |
|
wenzelm@26049
|
370 |
fun gen_overloading prep_const raw_ops thy =
|
wenzelm@26049
|
371 |
let
|
wenzelm@26049
|
372 |
val ctxt = ProofContext.init thy;
|
wenzelm@26049
|
373 |
val ops = raw_ops |> map (fn (name, const, checked) =>
|
wenzelm@26049
|
374 |
(name, Term.dest_Const (prep_const ctxt const), checked));
|
wenzelm@26049
|
375 |
in thy |> init_lthy_ctxt (make_target "" false false ([], [], []) ops) end;
|
wenzelm@26049
|
376 |
|
wenzelm@25291
|
377 |
in
|
wenzelm@25291
|
378 |
|
wenzelm@25291
|
379 |
fun init target thy = init_lthy_ctxt (init_target thy target) thy;
|
wenzelm@26049
|
380 |
fun begin target ctxt = init_lthy (init_target (ProofContext.theory_of ctxt) (SOME target)) ctxt;
|
wenzelm@25291
|
381 |
|
wenzelm@25291
|
382 |
fun context "-" thy = init NONE thy
|
wenzelm@25291
|
383 |
| context target thy = init (SOME (Locale.intern thy target)) thy;
|
wenzelm@20894
|
384 |
|
wenzelm@26049
|
385 |
fun instantiation arities = init_lthy_ctxt (make_target "" false false arities []);
|
haftmann@25519
|
386 |
|
wenzelm@26049
|
387 |
val overloading = gen_overloading (fn ctxt => Syntax.check_term ctxt o Const);
|
wenzelm@26049
|
388 |
val overloading_cmd = gen_overloading Syntax.read_term;
|
haftmann@25462
|
389 |
|
wenzelm@20894
|
390 |
end;
|
wenzelm@25291
|
391 |
|
wenzelm@25291
|
392 |
end;
|
wenzelm@25291
|
393 |
|