1 (* Title: Pure/pure_thy.ML
3 Author: Markus Wenzel, TU Muenchen
5 Theorem storage. Pure theory syntax and logical content.
10 val facts_of: theory -> Facts.T
11 val intern_fact: theory -> xstring -> string
12 val defined_fact: theory -> string -> bool
13 val hide_fact: bool -> string -> theory -> theory
14 val force_proofs: theory -> unit
15 val get_fact: Context.generic -> theory -> Facts.ref -> thm list
16 val get_thms: theory -> xstring -> thm list
17 val get_thm: theory -> xstring -> thm
18 val all_thms_of: theory -> (string * thm) list
19 val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
20 val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
21 val burrow_facts: ('a list -> 'b list) ->
22 ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
23 val name_multi: string -> 'a list -> (string * 'a) list
24 val name_thm: bool -> bool -> Position.T -> string -> thm -> thm
25 val name_thms: bool -> bool -> Position.T -> string -> thm list -> thm list
26 val name_thmss: bool -> Position.T -> string -> (thm list * 'a) list -> (thm list * 'a) list
27 val store_thms: bstring * thm list -> theory -> thm list * theory
28 val store_thm: bstring * thm -> theory -> thm * theory
29 val store_thm_open: bstring * thm -> theory -> thm * theory
30 val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory
31 val add_thm: (bstring * thm) * attribute list -> theory -> thm * theory
32 val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory
33 val add_thms_dynamic: bstring * (Context.generic -> thm list) -> theory -> theory
34 val note_thmss: string -> ((Binding.T * attribute list) *
35 (thm list * attribute list) list) list -> theory -> (string * thm list) list * theory
36 val note_thmss_grouped: string -> string -> ((Binding.T * attribute list) *
37 (thm list * attribute list) list) list -> theory -> (string * thm list) list * theory
38 val add_axioms: ((bstring * term) * attribute list) list -> theory -> thm list * theory
39 val add_axioms_cmd: ((bstring * string) * attribute list) list -> theory -> thm list * theory
40 val add_defs: bool -> ((bstring * term) * attribute list) list ->
41 theory -> thm list * theory
42 val add_defs_unchecked: bool -> ((bstring * term) * attribute list) list ->
43 theory -> thm list * theory
44 val add_defs_unchecked_cmd: bool -> ((bstring * string) * attribute list) list ->
45 theory -> thm list * theory
46 val add_defs_cmd: bool -> ((bstring * string) * attribute list) list ->
47 theory -> thm list * theory
48 val old_appl_syntax: theory -> bool
49 val old_appl_syntax_setup: theory -> theory
52 structure PureThy: PURE_THY =
56 (*** stored facts ***)
60 structure FactsData = TheoryDataFun
62 type T = Facts.T * unit Lazy.T list;
63 val empty = (Facts.empty, []);
65 fun extend (facts, _) = (facts, []);
66 fun merge _ ((facts1, _), (facts2, _)) = (Facts.merge (facts1, facts2), []);
72 val facts_of = #1 o FactsData.get;
74 val intern_fact = Facts.intern o facts_of;
75 val defined_fact = Facts.defined o facts_of;
77 fun hide_fact fully name = FactsData.map (apfst (Facts.hide fully name));
82 fun lazy_proof thm = Lazy.lazy (fn () => Thm.force_proof thm);
83 val force_proofs = List.app Lazy.force o #2 o FactsData.get;
87 (** retrieve theorems **)
89 fun get_fact context thy xthmref =
91 val xname = Facts.name_of_ref xthmref;
92 val pos = Facts.pos_of_ref xthmref;
94 val name = intern_fact thy xname;
95 val res = Facts.lookup context (facts_of thy) name;
96 val _ = Theory.check_thy thy;
99 NONE => error ("Unknown fact " ^ quote name ^ Position.str_of pos)
100 | SOME (static, ths) =>
101 (Position.report ((if static then Markup.fact else Markup.dynamic_fact) name) pos;
102 Facts.select xthmref (map (Thm.transfer thy) ths)))
105 fun get_thms thy = get_fact (Context.Theory thy) thy o Facts.named;
106 fun get_thm thy name = Facts.the_single name (get_thms thy name);
108 fun all_thms_of thy =
109 Facts.fold_static (fn (_, ths) => append (map (`(Thm.get_name_hint)) ths)) (facts_of thy) [];
113 (** store theorems **)
115 (* fact specifications *)
117 fun map_facts f = map (apsnd (map (apfst (map f))));
118 fun burrow_fact f = split_list #>> burrow f #> op ~~;
119 fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
124 fun name_multi name [x] = [(name, x)]
125 | name_multi "" xs = map (pair "") xs
126 | name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
128 fun name_thm pre official pos name thm = thm
129 |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
130 |> (if Thm.has_name_hint thm andalso pre orelse name = "" then I else Thm.put_name_hint name)
131 |> Thm.default_position pos
132 |> Thm.default_position (Position.thread_data ());
134 fun name_thms pre official pos name xs =
135 map (uncurry (name_thm pre official pos)) (name_multi name xs);
137 fun name_thmss official pos name fact =
138 burrow_fact (name_thms true official pos name) fact;
143 fun enter_proofs (thy, thms) =
144 (FactsData.map (apsnd (fold (cons o lazy_proof) thms)) thy, thms);
146 fun enter_thms pre_name post_name app_att (b, thms) thy =
147 if Binding.is_empty b
148 then swap (enter_proofs (app_att (thy, thms)))
150 val naming = Sign.naming_of thy;
151 val name = NameSpace.full_name naming b;
153 enter_proofs (apsnd (post_name name) (app_att (thy, pre_name name thms)));
154 val thms'' = map (Thm.transfer thy') thms';
155 val thy'' = thy' |> (FactsData.map o apfst) (Facts.add_global naming (b, thms'') #> snd);
156 in (thms'', thy'') end;
161 fun store_thms (bname, thms) = enter_thms (name_thms true true Position.none)
162 (name_thms false true Position.none) I (Binding.name bname, thms);
164 fun store_thm (bname, th) = store_thms (bname, [th]) #>> the_single;
166 fun store_thm_open (bname, th) =
167 enter_thms (name_thms true false Position.none) (name_thms false false Position.none) I
168 (Binding.name bname, [th]) #>> the_single;
173 fun add_thms_atts pre_name ((bname, thms), atts) =
174 enter_thms pre_name (name_thms false true Position.none)
175 (foldl_map (Thm.theory_attributes atts)) (Binding.name bname, thms);
177 fun gen_add_thmss pre_name =
178 fold_map (add_thms_atts pre_name);
180 fun gen_add_thms pre_name args =
181 apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
183 val add_thmss = gen_add_thmss (name_thms true true Position.none);
184 val add_thms = gen_add_thms (name_thms true true Position.none);
185 val add_thm = yield_singleton add_thms;
188 (* add_thms_dynamic *)
190 fun add_thms_dynamic (bname, f) thy = thy
191 |> (FactsData.map o apfst)
192 (Facts.add_dynamic (Sign.naming_of thy) (Binding.name bname, f) #> snd);
199 fun gen_note_thmss tag = fold_map (fn ((b, more_atts), ths_atts) => fn thy =>
201 val pos = Binding.pos_of b;
202 val name = Sign.full_name thy b;
203 val _ = Position.report (Markup.fact_decl name) pos;
205 fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
206 val (thms, thy') = thy |> enter_thms
207 (name_thmss true pos) (name_thms false true pos) (apsnd flat o foldl_map app)
208 (b, map (fn (ths, atts) => (ths, surround tag (atts @ more_atts))) ths_atts);
209 in ((name, thms), thy') end);
213 fun note_thmss k = gen_note_thmss (Thm.kind k);
214 fun note_thmss_grouped k g = gen_note_thmss (Thm.kind k #> Thm.group g);
219 (* store axioms as theorems *)
222 fun get_ax thy (name, _) = Thm.axiom thy (Sign.full_bname thy name);
223 fun get_axs thy named_axs = map (Thm.forall_elim_vars 0 o get_ax thy) named_axs;
224 fun add_axm add = fold_map (fn ((name, ax), atts) => fn thy =>
226 val named_ax = [(name, ax)];
227 val thy' = add named_ax thy;
228 val thm = hd (get_axs thy' named_ax);
229 in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end);
231 val add_defs = add_axm o Theory.add_defs_i false;
232 val add_defs_unchecked = add_axm o Theory.add_defs_i true;
233 val add_axioms = add_axm Theory.add_axioms_i;
234 val add_defs_cmd = add_axm o Theory.add_defs false;
235 val add_defs_unchecked_cmd = add_axm o Theory.add_defs true;
236 val add_axioms_cmd = add_axm Theory.add_axioms;
241 (*** Pure theory syntax and logical content ***)
243 val typ = SimpleSyntax.read_typ;
244 val term = SimpleSyntax.read_term;
245 val prop = SimpleSyntax.read_prop;
247 val typeT = Syntax.typeT;
248 val spropT = Syntax.spropT;
251 (* application syntax variants *)
254 [("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
255 ("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
258 [("", typ "'a => cargs", Delimfix "_"),
259 ("_cargs", typ "'a => cargs => cargs", Mixfix ("_/ _", [1000, 1000], 1000)),
260 ("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
261 ("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
263 structure OldApplSyntax = TheoryDataFun
269 fun merge _ (b1, b2) : T =
271 else error "Cannot merge theories with different application syntax";
274 val old_appl_syntax = OldApplSyntax.get;
276 val old_appl_syntax_setup =
277 OldApplSyntax.put true #>
278 Sign.del_modesyntax_i Syntax.mode_default applC_syntax #>
279 Sign.add_syntax_i appl_syntax;
284 val _ = Context.>> (Context.map_theory
285 (OldApplSyntax.init #>
289 ("itself", 1, NoSyn),
291 #> Sign.add_nonterminals Syntax.basic_nonterms
293 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3%_./ _)", [0, 3], 3)),
294 ("_abs", typ "'a", NoSyn),
295 ("", typ "'a => args", Delimfix "_"),
296 ("_args", typ "'a => args => args", Delimfix "_,/ _"),
297 ("", typ "id => idt", Delimfix "_"),
298 ("_idtdummy", typ "idt", Delimfix "'_"),
299 ("_idtyp", typ "id => type => idt", Mixfix ("_::_", [], 0)),
300 ("_idtypdummy", typ "type => idt", Mixfix ("'_()::_", [], 0)),
301 ("", typ "idt => idt", Delimfix "'(_')"),
302 ("", typ "idt => idts", Delimfix "_"),
303 ("_idts", typ "idt => idts => idts", Mixfix ("_/ _", [1, 0], 0)),
304 ("", typ "idt => pttrn", Delimfix "_"),
305 ("", typ "pttrn => pttrns", Delimfix "_"),
306 ("_pttrns", typ "pttrn => pttrns => pttrns", Mixfix ("_/ _", [1, 0], 0)),
307 ("", typ "aprop => aprop", Delimfix "'(_')"),
308 ("", typ "id => aprop", Delimfix "_"),
309 ("", typ "longid => aprop", Delimfix "_"),
310 ("", typ "var => aprop", Delimfix "_"),
311 ("_DDDOT", typ "aprop", Delimfix "..."),
312 ("_aprop", typ "aprop => prop", Delimfix "PROP _"),
313 ("_asm", typ "prop => asms", Delimfix "_"),
314 ("_asms", typ "prop => asms => asms", Delimfix "_;/ _"),
315 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
316 ("_ofclass", typ "type => logic => prop", Delimfix "(1OFCLASS/(1'(_,/ _')))"),
317 ("_mk_ofclass", typ "dummy", NoSyn),
318 ("_TYPE", typ "type => logic", Delimfix "(1TYPE/(1'(_')))"),
319 ("", typ "id => logic", Delimfix "_"),
320 ("", typ "longid => logic", Delimfix "_"),
321 ("", typ "var => logic", Delimfix "_"),
322 ("_DDDOT", typ "logic", Delimfix "..."),
323 ("_constify", typ "num => num_const", Delimfix "_"),
324 ("_constify", typ "float => float_const", Delimfix "_"),
325 ("_indexnum", typ "num_const => index", Delimfix "\\<^sub>_"),
326 ("_index", typ "logic => index", Delimfix "(00\\<^bsub>_\\<^esub>)"),
327 ("_indexdefault", typ "index", Delimfix ""),
328 ("_indexvar", typ "index", Delimfix "'\\<index>"),
329 ("_struct", typ "index => logic", Mixfix ("\\<struct>_", [1000], 1000)),
330 ("==>", typ "prop => prop => prop", Delimfix "op ==>"),
331 (Term.dummy_patternN, typ "aprop", Delimfix "'_"),
332 ("_sort_constraint", typ "type => prop", Delimfix "(1SORT'_CONSTRAINT/(1'(_')))"),
333 ("Pure.term", typ "logic => prop", Delimfix "TERM _"),
334 ("Pure.conjunction", typ "prop => prop => prop", InfixrName ("&&&", 2))]
335 #> Sign.add_syntax_i applC_syntax
336 #> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
337 [("fun", typ "type => type => type", Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
338 ("_bracket", typ "types => type => type", Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
339 ("_ofsort", typ "tid => sort => type", Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
340 ("_constrain", typ "logic => type => logic", Mixfix ("_\\<Colon>_", [4, 0], 3)),
341 ("_constrain", [spropT, typeT] ---> spropT, Mixfix ("_\\<Colon>_", [4, 0], 3)),
342 ("_idtyp", typ "id => type => idt", Mixfix ("_\\<Colon>_", [], 0)),
343 ("_idtypdummy", typ "type => idt", Mixfix ("'_()\\<Colon>_", [], 0)),
344 ("_type_constraint_", typ "'a", NoSyn),
345 ("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
346 ("==", typ "'a => 'a => prop", InfixrName ("\\<equiv>", 2)),
347 ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
348 ("==>", typ "prop => prop => prop", InfixrName ("\\<Longrightarrow>", 1)),
349 ("_DDDOT", typ "aprop", Delimfix "\\<dots>"),
350 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
351 ("_DDDOT", typ "logic", Delimfix "\\<dots>")]
352 #> Sign.add_modesyntax_i ("", false)
353 [("prop", typ "prop => prop", Mixfix ("_", [0], 0))]
354 #> Sign.add_modesyntax_i ("HTML", false)
355 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
357 [("==", typ "'a => 'a => prop", InfixrName ("==", 2)),
358 ("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
359 ("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
360 ("prop", typ "prop => prop", NoSyn),
361 ("TYPE", typ "'a itself", NoSyn),
362 (Term.dummy_patternN, typ "'a", Delimfix "'_")]
363 #> Theory.add_deps "==" ("==", typ "'a => 'a => prop") []
364 #> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") []
365 #> Theory.add_deps "all" ("all", typ "('a => prop) => prop") []
366 #> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") []
367 #> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") []
368 #> Sign.add_trfuns Syntax.pure_trfuns
369 #> Sign.add_trfunsT Syntax.pure_trfunsT
372 [("term", typ "'a => prop", NoSyn),
373 ("sort_constraint", typ "'a itself => prop", NoSyn),
374 ("conjunction", typ "prop => prop => prop", NoSyn)]
375 #> (add_defs false o map Thm.no_attributes)
376 [("prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
377 ("term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
378 ("sort_constraint_def",
379 prop "(CONST Pure.sort_constraint :: 'a itself => prop) (CONST TYPE :: 'a itself) ==\
380 \ (CONST Pure.term :: 'a itself => prop) (CONST TYPE :: 'a itself)"),
381 ("conjunction_def", prop "(A &&& B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
382 #> Sign.hide_const false "Pure.term"
383 #> Sign.hide_const false "Pure.sort_constraint"
384 #> Sign.hide_const false "Pure.conjunction"
385 #> add_thmss [(("nothing", []), [])] #> snd
386 #> Theory.add_axioms_i Proofterm.equality_axms));