Theory target distinguishes old and new locales.
1 (* Title: Pure/Isar/theory_target.ML
6 Common theory/locale/class/instantiation/overloading targets.
9 signature THEORY_TARGET =
11 val peek: local_theory -> {target: string, new_locale: bool, is_locale: bool,
12 is_class: bool, instantiation: string list * (string * sort) list * sort,
13 overloading: (string * (string * typ) * bool) list}
14 val init: string option -> theory -> local_theory
15 val begin: string -> Proof.context -> local_theory
16 val context: xstring -> theory -> local_theory
17 val instantiation: string list * (string * sort) list * sort -> theory -> local_theory
18 val overloading: (string * (string * typ) * bool) list -> theory -> local_theory
19 val overloading_cmd: (string * string * bool) list -> theory -> local_theory
22 structure TheoryTarget: THEORY_TARGET =
27 fun locale_extern new_locale x =
28 if !new_locales andalso new_locale then NewLocale.extern x else Locale.extern x;
29 fun locale_add_type_syntax new_locale x =
30 if !new_locales andalso new_locale then NewLocale.add_type_syntax x else Locale.add_type_syntax x;
31 fun locale_add_term_syntax new_locale x =
32 if !new_locales andalso new_locale then NewLocale.add_term_syntax x else Locale.add_term_syntax x;
33 fun locale_add_declaration new_locale x =
34 if !new_locales andalso new_locale then NewLocale.add_declaration x else Locale.add_declaration x;
35 fun locale_add_thmss new_locale x =
36 if !new_locales andalso new_locale then NewLocale.add_thmss x else Locale.add_thmss x;
37 fun locale_init new_locale x =
38 if !new_locales andalso new_locale then NewLocale.init x else Locale.init x;
39 fun locale_intern new_locale x =
40 if !new_locales andalso new_locale then NewLocale.intern x else Locale.intern x;
44 datatype target = Target of {target: string, new_locale: bool, is_locale: bool,
45 is_class: bool, instantiation: string list * (string * sort) list * sort,
46 overloading: (string * (string * typ) * bool) list};
48 fun make_target target new_locale is_locale is_class instantiation overloading =
49 Target {target = target, new_locale = new_locale, is_locale = is_locale,
50 is_class = is_class, instantiation = instantiation, overloading = overloading};
52 val global_target = make_target "" false false false ([], [], []) [];
54 structure Data = ProofDataFun
57 fun init _ = global_target;
60 val peek = (fn Target args => args) o Data.get;
65 fun pretty_thy ctxt target is_locale is_class =
67 val thy = ProofContext.theory_of ctxt;
68 val target_name = (if is_class then "class " else "locale ") ^ locale_extern is_class thy target;
69 val fixes = map (fn (x, T) => (Binding.name x, SOME T, NoSyn))
70 (#1 (ProofContext.inferred_fixes ctxt));
71 val assumes = map (fn A => (Attrib.empty_binding, [(Thm.term_of A, [])]))
72 (Assumption.assms_of ctxt);
74 (if null fixes then [] else [Element.Fixes fixes]) @
75 (if null assumes then [] else [Element.Assumes assumes]);
77 if target = "" then []
78 else if null elems then [Pretty.str target_name]
79 else [Pretty.big_list (target_name ^ " =")
80 (map (Pretty.chunks o Element.pretty_ctxt ctxt) elems)]
83 fun pretty (Target {target, is_locale, is_class, instantiation, overloading, ...}) ctxt =
84 Pretty.block [Pretty.str "theory", Pretty.brk 1,
85 Pretty.str (Context.theory_name (ProofContext.theory_of ctxt))] ::
86 (if not (null overloading) then [Overloading.pretty ctxt]
87 else if not (null (#1 instantiation)) then [Class.pretty_instantiation ctxt]
88 else pretty_thy ctxt target is_locale is_class);
91 (* target declarations *)
93 fun target_decl add (Target {target, new_locale, ...}) d lthy =
95 val d' = Morphism.transform (LocalTheory.target_morphism lthy) d;
96 val d0 = Morphism.form d';
100 |> LocalTheory.theory (Context.theory_map d0)
101 |> LocalTheory.target (Context.proof_map d0)
104 |> LocalTheory.target (add new_locale target d')
107 val type_syntax = target_decl locale_add_type_syntax;
108 val term_syntax = target_decl locale_add_term_syntax;
109 val declaration = target_decl locale_add_declaration;
111 fun class_target (Target {target, ...}) f =
112 LocalTheory.raw_theory f #>
113 LocalTheory.target (Class.refresh_syntax target);
118 fun import_export_proof ctxt (name, raw_th) =
120 val thy = ProofContext.theory_of ctxt;
121 val thy_ctxt = ProofContext.init thy;
122 val certT = Thm.ctyp_of thy;
123 val cert = Thm.cterm_of thy;
125 (*export assumes/defines*)
126 val th = Goal.norm_result raw_th;
127 val (defs, th') = LocalDefs.export ctxt thy_ctxt th;
128 val concl_conv = MetaSimplifier.rewrite true defs (Thm.cprop_of th);
129 val assms = map (MetaSimplifier.rewrite_rule defs o Thm.assume) (Assumption.assms_of ctxt);
130 val nprems = Thm.nprems_of th' - Thm.nprems_of th;
133 val tfrees = map TFree (Thm.fold_terms Term.add_tfrees th' []);
134 val frees = map Free (Thm.fold_terms Term.add_frees th' []);
135 val (th'' :: vs) = (th' :: map (Drule.mk_term o cert) (map Logic.mk_type tfrees @ frees))
136 |> Variable.export ctxt thy_ctxt
137 |> Drule.zero_var_indexes_list;
140 val result = PureThy.name_thm true true Position.none name th'';
144 chop (length tfrees) (map (Thm.term_of o Drule.dest_term) vs)
145 |>> map Logic.dest_type;
147 val instT = map_filter (fn (TVar v, T) => SOME (v, T) | _ => NONE) (tvars ~~ tfrees);
148 val inst = filter (is_Var o fst) (vars ~~ frees);
149 val cinstT = map (pairself certT o apfst TVar) instT;
150 val cinst = map (pairself (cert o Term.map_types (TermSubst.instantiateT instT))) inst;
151 val result' = Thm.instantiate (cinstT, cinst) result;
153 (*import assumes/defines*)
154 val assm_tac = FIRST' (map (fn assm => Tactic.compose_tac (false, assm, 0)) assms);
156 (case SINGLE (Seq.INTERVAL assm_tac 1 nprems) result' of
157 NONE => raise THM ("Failed to re-import result", 0, [result'])
158 | SOME res => LocalDefs.trans_props ctxt [res, Thm.symmetric concl_conv])
160 |> PureThy.name_thm false false Position.none name;
162 in (result'', result) end;
164 fun note_local kind facts ctxt =
166 |> ProofContext.qualified_names
167 |> ProofContext.note_thmss_i kind facts
168 ||> ProofContext.restore_naming ctxt;
170 fun notes (Target {target, is_locale, new_locale, ...}) kind facts lthy =
172 val thy = ProofContext.theory_of lthy;
174 |> map (fn (a, bs) => (a, PureThy.burrow_fact (PureThy.name_multi
175 (LocalTheory.full_name lthy (fst a))) bs))
176 |> PureThy.map_facts (import_export_proof lthy);
177 val local_facts = PureThy.map_facts #1 facts'
178 |> Attrib.map_facts (Attrib.attribute_i thy);
179 val target_facts = PureThy.map_facts #1 facts'
180 |> is_locale ? Element.facts_map (Element.morph_ctxt (LocalTheory.target_morphism lthy));
181 val global_facts = PureThy.map_facts #2 facts'
182 |> Attrib.map_facts (if is_locale then K I else Attrib.attribute_i thy);
184 lthy |> LocalTheory.theory
185 (Sign.qualified_names
186 #> PureThy.note_thmss_grouped kind (LocalTheory.group_of lthy) global_facts #> snd
187 #> Sign.restore_naming thy)
188 |> not is_locale ? LocalTheory.target (note_local kind global_facts #> snd)
189 |> is_locale ? LocalTheory.target (locale_add_thmss new_locale target kind target_facts)
190 |> note_local kind local_facts
196 fun fork_mixfix (Target {is_locale, is_class, ...}) mx =
197 if not is_locale then (NoSyn, NoSyn, mx)
198 else if not is_class then (NoSyn, mx, NoSyn)
199 else (mx, NoSyn, NoSyn);
201 fun locale_const (Target {target, is_class, ...}) (prmode as (mode, _)) tags ((b, mx), rhs) phi =
203 val b' = Morphism.binding phi b;
204 val rhs' = Morphism.term phi rhs;
205 val legacy_arg = (b', Term.close_schematic_term (Logic.legacy_varify rhs'));
206 val arg = (b', Term.close_schematic_term rhs');
207 val similar_body = Type.similar_types (rhs, rhs');
208 (* FIXME workaround based on educated guess *)
209 val (prefix', _) = Binding.dest b';
210 val class_global = Binding.base_name b = Binding.base_name b'
211 andalso not (null prefix')
212 andalso (fst o snd o split_last) prefix' = Class.class_prefix target;
214 not (is_class andalso (similar_body orelse class_global)) ?
215 (Context.mapping_result
218 |> Sign.add_abbrev PrintMode.internal tags legacy_arg
219 ||> Sign.restore_naming thy)
220 (ProofContext.add_abbrev PrintMode.internal tags arg)
221 #-> (fn (lhs' as Const (d, _), _) =>
223 (Context.mapping (Sign.revert_abbrev mode d) (ProofContext.revert_abbrev mode d) #>
224 Morphism.form (ProofContext.target_notation true prmode [(lhs', mx)]))))
227 fun declare_const (ta as Target {target, is_locale, is_class, ...}) depends ((b, T), mx) lthy =
229 val c = Binding.base_name b;
230 val tags = LocalTheory.group_position_of lthy;
231 val xs = filter depends (#1 (ProofContext.inferred_fixes (LocalTheory.target_of lthy)));
232 val U = map #2 xs ---> T;
233 val (mx1, mx2, mx3) = fork_mixfix ta mx;
234 fun syntax_error c = error ("Illegal mixfix syntax for overloaded constant " ^ quote c);
236 (case Class.instantiation_param lthy c of
238 if mx3 <> NoSyn then syntax_error c'
239 else LocalTheory.theory_result (AxClass.declare_overloaded (c', U))
240 ##> Class.confirm_declaration c
242 (case Overloading.operation lthy c of
244 if mx3 <> NoSyn then syntax_error c'
245 else LocalTheory.theory_result (Overloading.declare (c', U))
246 ##> Overloading.confirm c
247 | NONE => LocalTheory.theory_result (Sign.declare_const tags ((b, U), mx3))));
248 val (const, lthy') = lthy |> declare_const;
249 val t = Term.list_comb (const, map Free xs);
252 |> is_locale ? term_syntax ta (locale_const ta Syntax.mode_default tags ((b, mx2), t))
253 |> is_class ? class_target ta (Class.declare target tags ((c, mx1), t))
254 |> LocalDefs.add_def ((b, NoSyn), t)
260 fun abbrev (ta as Target {target, is_locale, is_class, ...}) prmode ((b, mx), t) lthy =
262 val c = Binding.base_name b;
263 val tags = LocalTheory.group_position_of lthy;
264 val thy_ctxt = ProofContext.init (ProofContext.theory_of lthy);
265 val target_ctxt = LocalTheory.target_of lthy;
267 val (mx1, mx2, mx3) = fork_mixfix ta mx;
268 val t' = Assumption.export_term lthy target_ctxt t;
269 val xs = map Free (rev (Variable.add_fixed target_ctxt t' []));
270 val u = fold_rev lambda xs t';
272 singleton (Variable.export_terms (Variable.declare_term u target_ctxt) thy_ctxt) u;
276 LocalTheory.theory_result (Sign.add_abbrev PrintMode.internal tags (b, global_rhs))
278 let val lhs' = Term.list_comb (Logic.unvarify lhs, xs) in
279 term_syntax ta (locale_const ta prmode tags ((b, mx2), lhs')) #>
280 is_class ? class_target ta (Class.abbrev target prmode tags ((c, mx1), t'))
284 (Sign.add_abbrev (#1 prmode) tags (b, global_rhs) #-> (fn (lhs, _) =>
285 Sign.notation true prmode [(lhs, mx3)])))
286 |> ProofContext.add_abbrev PrintMode.internal tags (b, t) |> snd
287 |> LocalDefs.fixed_abbrev ((b, NoSyn), t)
293 fun define (ta as Target {target, is_locale, is_class, ...})
294 kind ((b, mx), ((name, atts), rhs)) lthy =
296 val thy = ProofContext.theory_of lthy;
297 val thy_ctxt = ProofContext.init thy;
299 val c = Binding.base_name b;
300 val name' = Binding.map_base (Thm.def_name_optional c) name;
301 val (rhs', rhs_conv) =
302 LocalDefs.export_cterm lthy thy_ctxt (Thm.cterm_of thy rhs) |>> Thm.term_of;
303 val xs = Variable.add_fixed (LocalTheory.target_of lthy) rhs' [];
304 val T = Term.fastype_of rhs;
307 val ((lhs, local_def), lthy2) = lthy |> declare_const ta (member (op =) xs) ((b, T), mx);
308 val (_, lhs') = Logic.dest_equals (Thm.prop_of local_def);
312 (case Overloading.operation lthy c of
314 (fn name => fn (Const (c, _), rhs) => Overloading.define checked name (c, rhs))
316 if is_none (Class.instantiation_param lthy c)
317 then (fn name => fn eq => Thm.add_def false false (name, Logic.mk_equals eq))
318 else (fn name => fn (Const (c, _), rhs) => AxClass.define_overloaded name (c, rhs)));
319 val (global_def, lthy3) = lthy2
320 |> LocalTheory.theory_result (define_const (Binding.base_name name') (lhs', rhs'));
321 val def = LocalDefs.trans_terms lthy3
322 [(*c == global.c xs*) local_def,
323 (*global.c xs == rhs'*) global_def,
324 (*rhs' == rhs*) Thm.symmetric rhs_conv];
327 val ([(res_name, [res])], lthy4) = lthy3
328 |> notes ta kind [((name', atts), [([def], [])])];
329 in ((lhs, (res_name, res)), lthy4) end;
336 fun init_target _ NONE = global_target
337 | init_target thy (SOME target) =
338 make_target target (NewLocale.test_locale thy (NewLocale.intern thy target))
339 true (Class.is_class thy target) ([], [], []) [];
341 fun init_ctxt (Target {target, new_locale, is_locale, is_class, instantiation, overloading}) =
342 if not (null (#1 instantiation)) then Class.init_instantiation instantiation
343 else if not (null overloading) then Overloading.init overloading
344 else if not is_locale then ProofContext.init
345 else if not is_class then locale_init new_locale target
346 else Class.init target;
348 fun init_lthy (ta as Target {target, instantiation, overloading, ...}) =
350 LocalTheory.init (NameSpace.base target)
355 type_syntax = type_syntax ta,
356 term_syntax = term_syntax ta,
357 declaration = declaration ta,
358 reinit = fn lthy => init_lthy_ctxt ta (ProofContext.theory_of lthy),
359 exit = LocalTheory.target_of o
360 (if not (null (#1 instantiation)) then Class.conclude_instantiation
361 else if not (null overloading) then Overloading.conclude
363 and init_lthy_ctxt ta = init_lthy ta o init_ctxt ta;
365 fun gen_overloading prep_const raw_ops thy =
367 val ctxt = ProofContext.init thy;
368 val ops = raw_ops |> map (fn (name, const, checked) =>
369 (name, Term.dest_Const (prep_const ctxt const), checked));
370 in thy |> init_lthy_ctxt (make_target "" false false false ([], [], []) ops) end;
374 fun init target thy = init_lthy_ctxt (init_target thy target) thy;
375 fun begin target ctxt = init_lthy (init_target (ProofContext.theory_of ctxt) (SOME target)) ctxt;
377 fun context "-" thy = init NONE thy
378 | context target thy = init (SOME (locale_intern
379 (NewLocale.test_locale thy (NewLocale.intern thy target)) thy target)) thy;
381 fun instantiation arities = init_lthy_ctxt (make_target "" false false false arities []);
383 val overloading = gen_overloading (fn ctxt => Syntax.check_term ctxt o Const);
384 val overloading_cmd = gen_overloading Syntax.read_term;