1 (* Title: Pure/pure_thy.ML
3 Author: Markus Wenzel, TU Muenchen
5 Theorem storage. Pure theory syntax and logical content.
10 val tag_rule: Markup.property -> thm -> thm
11 val untag_rule: string -> thm -> thm
12 val tag: Markup.property -> attribute
13 val untag: string -> attribute
14 val has_name_hint: thm -> bool
15 val get_name_hint: thm -> string
16 val put_name_hint: string -> thm -> thm
17 val get_group: thm -> string option
18 val put_group: string -> thm -> thm
19 val group: string -> attribute
20 val has_kind: thm -> bool
21 val get_kind: thm -> string
22 val kind_rule: string -> thm -> thm
23 val kind: string -> attribute
24 val kind_internal: attribute
25 val has_internal: Markup.property list -> bool
26 val is_internal: thm -> bool
27 val facts_of: theory -> Facts.T
28 val intern_fact: theory -> xstring -> string
29 val defined_fact: theory -> string -> bool
30 val hide_fact: bool -> string -> theory -> theory
31 val get_fact: Context.generic -> theory -> Facts.ref -> thm list
32 val get_thms: theory -> xstring -> thm list
33 val get_thm: theory -> xstring -> thm
34 val all_thms_of: theory -> (string * thm) list
35 val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
36 val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
37 val burrow_facts: ('a list -> 'b list) ->
38 ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
39 val name_multi: string -> 'a list -> (string * 'a) list
40 val name_thm: bool -> bool -> string -> thm -> thm
41 val name_thms: bool -> bool -> string -> thm list -> thm list
42 val name_thmss: bool -> string -> (thm list * 'a) list -> (thm list * 'a) list
43 val store_thms: bstring * thm list -> theory -> thm list * theory
44 val store_thm: bstring * thm -> theory -> thm * theory
45 val store_thm_open: bstring * thm -> theory -> thm * theory
46 val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory
47 val add_thm: (bstring * thm) * attribute list -> theory -> thm * theory
48 val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory
49 val add_thms_dynamic: bstring * (Context.generic -> thm list) -> theory -> theory
50 val note_thmss: string -> ((bstring * attribute list) *
51 (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
52 val note_thmss_grouped: string -> string -> ((bstring * attribute list) *
53 (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
54 val note_thmss_cmd: string -> ((bstring * attribute list) *
55 (Facts.ref * attribute list) list) list -> theory -> (bstring * thm list) list * theory
56 val add_axioms: ((bstring * term) * attribute list) list -> theory -> thm list * theory
57 val add_axioms_cmd: ((bstring * string) * attribute list) list -> theory -> thm list * theory
58 val add_defs: bool -> ((bstring * term) * attribute list) list ->
59 theory -> thm list * theory
60 val add_defs_unchecked: bool -> ((bstring * term) * attribute list) list ->
61 theory -> thm list * theory
62 val add_defs_unchecked_cmd: bool -> ((bstring * string) * attribute list) list ->
63 theory -> thm list * theory
64 val add_defs_cmd: bool -> ((bstring * string) * attribute list) list ->
65 theory -> thm list * theory
66 val old_appl_syntax: theory -> bool
67 val old_appl_syntax_setup: theory -> theory
70 structure PureThy: PURE_THY =
74 (*** theorem tags ***)
76 (* add / delete tags *)
78 fun tag_rule tg = Thm.map_tags (insert (op =) tg);
79 fun untag_rule s = Thm.map_tags (filter_out (fn (s', _) => s = s'));
81 fun tag tg x = Thm.rule_attribute (K (tag_rule tg)) x;
82 fun untag s x = Thm.rule_attribute (K (untag_rule s)) x;
85 (* unofficial theorem names *)
87 fun the_name_hint thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.nameN);
89 val has_name_hint = can the_name_hint;
90 val get_name_hint = the_default "??.unknown" o try the_name_hint;
92 fun put_name_hint name = untag_rule Markup.nameN #> tag_rule (Markup.nameN, name);
97 fun get_group thm = AList.lookup (op =) (Thm.get_tags thm) Markup.groupN;
100 if name = "" then I else Thm.map_tags (AList.update (op =) (Markup.groupN, name));
102 fun group name = Thm.rule_attribute (K (put_group name));
107 fun the_kind thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.kindN);
109 val has_kind = can the_kind;
110 val get_kind = the_default "" o try the_kind;
112 fun kind_rule k = tag_rule (Markup.kindN, k) o untag_rule Markup.kindN;
113 fun kind k x = if k = "" then x else Thm.rule_attribute (K (kind_rule k)) x;
114 fun kind_internal x = kind Thm.internalK x;
115 fun has_internal tags = exists (fn tg => tg = (Markup.kindN, Thm.internalK)) tags;
116 val is_internal = has_internal o Thm.get_tags;
120 (*** stored facts ***)
124 structure FactsData = TheoryDataFun
127 val empty = Facts.empty;
130 fun merge _ = Facts.merge;
133 val facts_of = FactsData.get;
135 val intern_fact = Facts.intern o facts_of;
136 val defined_fact = Facts.defined o facts_of;
138 fun hide_fact fully name = FactsData.map (Facts.hide fully name);
142 (** retrieve theorems **)
144 fun get_fact context thy xthmref =
146 val xname = Facts.name_of_ref xthmref;
147 val pos = Facts.pos_of_ref xthmref;
149 val name = intern_fact thy xname;
150 val res = Facts.lookup context (facts_of thy) name;
151 val _ = Theory.check_thy thy;
154 NONE => error ("Unknown fact " ^ quote name ^ Position.str_of pos)
155 | SOME ths => Facts.select xthmref (map (Thm.transfer thy) ths))
158 fun get_thms thy = get_fact (Context.Theory thy) thy o Facts.named;
159 fun get_thm thy name = Facts.the_single name (get_thms thy name);
161 fun all_thms_of thy =
162 Facts.fold_static (fn (_, ths) => append (map (`(get_name_hint)) ths)) (facts_of thy) [];
166 (** store theorems **)
168 (* fact specifications *)
170 fun map_facts f = map (apsnd (map (apfst (map f))));
171 fun burrow_fact f = split_list #>> burrow f #> op ~~;
172 fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
177 fun name_multi name [x] = [(name, x)]
178 | name_multi "" xs = map (pair "") xs
179 | name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
181 fun name_thm pre official name thm = thm
182 |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
183 |> (if has_name_hint thm andalso pre orelse name = "" then I else put_name_hint name)
184 |> Thm.map_tags (Position.default_properties (Position.thread_data ()));
186 fun name_thms pre official name xs =
187 map (uncurry (name_thm pre official)) (name_multi name xs);
189 fun name_thmss official name fact =
190 burrow_fact (name_thms true official name) fact;
195 fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) |> swap
196 | enter_thms pre_name post_name app_att (bname, thms) thy =
198 val naming = Sign.naming_of thy;
199 val name = NameSpace.full naming bname;
200 val (thy', thms') = apsnd (post_name name) (app_att (thy, pre_name name thms));
201 val thms'' = map (Thm.transfer thy') thms';
202 val thy'' = thy' |> FactsData.map (Facts.add_global naming (name, thms''));
203 in (thms'', thy'') end;
208 val store_thms = enter_thms (name_thms true true) (name_thms false true) I;
209 fun store_thm (name, th) = store_thms (name, [th]) #>> the_single;
211 fun store_thm_open (name, th) =
212 enter_thms (name_thms true false) (name_thms false false) I (name, [th]) #>> the_single;
217 fun add_thms_atts pre_name ((bname, thms), atts) =
218 enter_thms pre_name (name_thms false true)
219 (foldl_map (Thm.theory_attributes atts)) (bname, thms);
221 fun gen_add_thmss pre_name =
222 fold_map (add_thms_atts pre_name);
224 fun gen_add_thms pre_name args =
225 apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
227 val add_thmss = gen_add_thmss (name_thms true true);
228 val add_thms = gen_add_thms (name_thms true true);
229 val add_thm = yield_singleton add_thms;
232 (* add_thms_dynamic *)
234 fun add_thms_dynamic (bname, f) thy =
235 let val name = Sign.full_name thy bname
236 in thy |> FactsData.map (Facts.add_dynamic (Sign.naming_of thy) (name, f)) end;
243 fun gen_note_thmss get tag = fold_map (fn ((bname, more_atts), ths_atts) => fn thy =>
245 fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
246 val (thms, thy') = thy |> enter_thms
247 (name_thmss true) (name_thms false true) (apsnd flat o foldl_map app)
248 (bname, map (fn (ths, atts) => (get thy ths, surround tag (atts @ more_atts))) ths_atts);
249 in ((bname, thms), thy') end);
253 fun note_thmss k = gen_note_thmss (K I) (kind k);
254 fun note_thmss_grouped k g = gen_note_thmss (K I) (kind k #> group g);
255 fun note_thmss_cmd k = gen_note_thmss (fn thy => get_fact (Context.Theory thy) thy) (kind k);
260 (* store axioms as theorems *)
263 fun get_ax thy (name, _) = Thm.get_axiom_i thy (Sign.full_name thy name);
264 fun get_axs thy named_axs = map (Thm.forall_elim_vars 0 o get_ax thy) named_axs;
265 fun add_axm add = fold_map (fn ((name, ax), atts) => fn thy =>
267 val named_ax = [(name, ax)];
268 val thy' = add named_ax thy;
269 val thm = hd (get_axs thy' named_ax);
270 in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end);
272 val add_defs = add_axm o Theory.add_defs_i false;
273 val add_defs_unchecked = add_axm o Theory.add_defs_i true;
274 val add_axioms = add_axm Theory.add_axioms_i;
275 val add_defs_cmd = add_axm o Theory.add_defs false;
276 val add_defs_unchecked_cmd = add_axm o Theory.add_defs true;
277 val add_axioms_cmd = add_axm Theory.add_axioms;
282 (*** Pure theory syntax and logical content ***)
284 val typ = SimpleSyntax.read_typ;
285 val term = SimpleSyntax.read_term;
286 val prop = SimpleSyntax.read_prop;
289 (* application syntax variants *)
292 [("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
293 ("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
296 [("", typ "'a => cargs", Delimfix "_"),
297 ("_cargs", typ "'a => cargs => cargs", Mixfix ("_/ _", [1000, 1000], 1000)),
298 ("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
299 ("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
301 structure OldApplSyntax = TheoryDataFun
307 fun merge _ (b1, b2) : T =
309 else error "Cannot merge theories with different application syntax";
312 val old_appl_syntax = OldApplSyntax.get;
314 val old_appl_syntax_setup =
315 OldApplSyntax.put true #>
316 Sign.del_modesyntax_i Syntax.mode_default applC_syntax #>
317 Sign.add_syntax_i appl_syntax;
322 val _ = Context.>> (Context.map_theory
323 (OldApplSyntax.init #>
327 ("itself", 1, NoSyn),
329 #> Sign.add_nonterminals Syntax.basic_nonterms
331 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3%_./ _)", [0, 3], 3)),
332 ("_abs", typ "'a", NoSyn),
333 ("", typ "'a => args", Delimfix "_"),
334 ("_args", typ "'a => args => args", Delimfix "_,/ _"),
335 ("", typ "id => idt", Delimfix "_"),
336 ("_idtdummy", typ "idt", Delimfix "'_"),
337 ("_idtyp", typ "id => type => idt", Mixfix ("_::_", [], 0)),
338 ("_idtypdummy", typ "type => idt", Mixfix ("'_()::_", [], 0)),
339 ("", typ "idt => idt", Delimfix "'(_')"),
340 ("", typ "idt => idts", Delimfix "_"),
341 ("_idts", typ "idt => idts => idts", Mixfix ("_/ _", [1, 0], 0)),
342 ("", typ "idt => pttrn", Delimfix "_"),
343 ("", typ "pttrn => pttrns", Delimfix "_"),
344 ("_pttrns", typ "pttrn => pttrns => pttrns", Mixfix ("_/ _", [1, 0], 0)),
345 ("", typ "id => aprop", Delimfix "_"),
346 ("", typ "longid => aprop", Delimfix "_"),
347 ("", typ "var => aprop", Delimfix "_"),
348 ("_DDDOT", typ "aprop", Delimfix "..."),
349 ("_aprop", typ "aprop => prop", Delimfix "PROP _"),
350 ("_asm", typ "prop => asms", Delimfix "_"),
351 ("_asms", typ "prop => asms => asms", Delimfix "_;/ _"),
352 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
353 ("_ofclass", typ "type => logic => prop", Delimfix "(1OFCLASS/(1'(_,/ _')))"),
354 ("_mk_ofclass", typ "dummy", NoSyn),
355 ("_TYPE", typ "type => logic", Delimfix "(1TYPE/(1'(_')))"),
356 ("", typ "id => logic", Delimfix "_"),
357 ("", typ "longid => logic", Delimfix "_"),
358 ("", typ "var => logic", Delimfix "_"),
359 ("_DDDOT", typ "logic", Delimfix "..."),
360 ("_constify", typ "num => num_const", Delimfix "_"),
361 ("_indexnum", typ "num_const => index", Delimfix "\\<^sub>_"),
362 ("_index", typ "logic => index", Delimfix "(00\\<^bsub>_\\<^esub>)"),
363 ("_indexdefault", typ "index", Delimfix ""),
364 ("_indexvar", typ "index", Delimfix "'\\<index>"),
365 ("_struct", typ "index => logic", Mixfix ("\\<struct>_", [1000], 1000)),
366 ("==>", typ "prop => prop => prop", Delimfix "op ==>"),
367 (Term.dummy_patternN, typ "aprop", Delimfix "'_")]
368 #> Sign.add_syntax_i applC_syntax
369 #> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
370 [("fun", typ "type => type => type", Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
371 ("_bracket", typ "types => type => type", Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
372 ("_ofsort", typ "tid => sort => type", Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
373 ("_constrain", typ "'a => type => 'a", Mixfix ("_\\<Colon>_", [4, 0], 3)),
374 ("_idtyp", typ "id => type => idt", Mixfix ("_\\<Colon>_", [], 0)),
375 ("_idtypdummy", typ "type => idt", Mixfix ("'_()\\<Colon>_", [], 0)),
376 ("_type_constraint_", typ "'a", NoSyn),
377 ("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
378 ("==", typ "'a => 'a => prop", InfixrName ("\\<equiv>", 2)),
379 ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
380 ("==>", typ "prop => prop => prop", InfixrName ("\\<Longrightarrow>", 1)),
381 ("_DDDOT", typ "aprop", Delimfix "\\<dots>"),
382 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
383 ("_DDDOT", typ "logic", Delimfix "\\<dots>")]
384 #> Sign.add_modesyntax_i ("", false)
385 [("prop", typ "prop => prop", Mixfix ("_", [0], 0)),
386 ("Pure.term", typ "'a => prop", Delimfix "TERM _"),
387 ("Pure.conjunction", typ "prop => prop => prop", InfixrName ("&&", 2))]
388 #> Sign.add_modesyntax_i ("HTML", false)
389 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
391 [("==", typ "'a => 'a => prop", InfixrName ("==", 2)),
392 ("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
393 ("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
394 ("prop", typ "prop => prop", NoSyn),
395 ("TYPE", typ "'a itself", NoSyn),
396 (Term.dummy_patternN, typ "'a", Delimfix "'_")]
397 #> Theory.add_deps "==" ("==", typ "'a => 'a => prop") []
398 #> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") []
399 #> Theory.add_deps "all" ("all", typ "('a => prop) => prop") []
400 #> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") []
401 #> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") []
402 #> Sign.add_trfuns Syntax.pure_trfuns
403 #> Sign.add_trfunsT Syntax.pure_trfunsT
406 [("term", typ "'a => prop", NoSyn),
407 ("conjunction", typ "prop => prop => prop", NoSyn)]
408 #> (add_defs false o map Thm.no_attributes)
409 [("prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
410 ("term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
411 ("conjunction_def", prop "(A && B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
412 #> Sign.hide_const false "Pure.conjunction"
413 #> Sign.hide_const false "Pure.term"
414 #> add_thmss [(("nothing", []), [])] #> snd
415 #> Theory.add_axioms_i Proofterm.equality_axms));