1 (* Title: Pure/pure_thy.ML
2 Author: Markus Wenzel, TU Muenchen
4 Theorem storage. Pure theory syntax and logical content.
9 val facts_of: theory -> Facts.T
10 val intern_fact: theory -> xstring -> string
11 val defined_fact: theory -> string -> bool
12 val hide_fact: bool -> string -> theory -> theory
13 val join_proofs: theory -> exn list
14 val cancel_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: binding * thm list -> theory -> thm list * theory
28 val store_thm: binding * thm -> theory -> thm * theory
29 val store_thm_open: binding * thm -> theory -> thm * theory
30 val add_thms: ((binding * thm) * attribute list) list -> theory -> thm list * theory
31 val add_thm: (binding * thm) * attribute list -> theory -> thm * theory
32 val add_thmss: ((binding * thm list) * attribute list) list -> theory -> thm list list * theory
33 val add_thms_dynamic: binding * (Context.generic -> thm list) -> theory -> theory
34 val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list
35 -> theory -> (string * thm list) list * theory
36 val note_thmss_grouped: string -> string -> (Thm.binding * (thm list * attribute list) list) list
37 -> theory -> (string * thm list) list * theory
38 val add_axioms: ((binding * term) * attribute list) list -> theory -> thm list * theory
39 val add_axioms_cmd: ((binding * string) * attribute list) list -> theory -> thm list * theory
40 val add_defs: bool -> ((binding * term) * attribute list) list ->
41 theory -> thm list * theory
42 val add_defs_unchecked: bool -> ((binding * term) * attribute list) list ->
43 theory -> thm list * theory
44 val add_defs_cmd: bool -> ((binding * string) * attribute list) list ->
45 theory -> thm list * theory
46 val add_defs_unchecked_cmd: bool -> ((binding * 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 list * Task_Queue.group 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.join_proof thm);
85 map_filter (Exn.get_exn o Lazy.force_result) (rev (#1 (#2 (FactsData.get thy))));
87 fun cancel_proofs thy = List.app Future.cancel_group (#2 (#2 (FactsData.get thy)));
91 (** retrieve theorems **)
93 fun get_fact context thy xthmref =
95 val xname = Facts.name_of_ref xthmref;
96 val pos = Facts.pos_of_ref xthmref;
98 val name = intern_fact thy xname;
99 val res = Facts.lookup context (facts_of thy) name;
100 val _ = Theory.check_thy thy;
103 NONE => error ("Unknown fact " ^ quote name ^ Position.str_of pos)
104 | SOME (static, ths) =>
105 (Position.report ((if static then Markup.fact else Markup.dynamic_fact) name) pos;
106 Facts.select xthmref (map (Thm.transfer thy) ths)))
109 fun get_thms thy = get_fact (Context.Theory thy) thy o Facts.named;
110 fun get_thm thy name = Facts.the_single name (get_thms thy name);
112 fun all_thms_of thy =
113 Facts.fold_static (fn (_, ths) => append (map (`(Thm.get_name_hint)) ths)) (facts_of thy) [];
117 (** store theorems **)
119 (* fact specifications *)
121 fun map_facts f = map (apsnd (map (apfst (map f))));
122 fun burrow_fact f = split_list #>> burrow f #> op ~~;
123 fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
128 fun name_multi name [x] = [(name, x)]
129 | name_multi "" xs = map (pair "") xs
130 | name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
132 fun name_thm pre official pos name thm = thm
133 |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
134 |> (if Thm.has_name_hint thm andalso pre orelse name = "" then I else Thm.put_name_hint name)
135 |> Thm.default_position pos
136 |> Thm.default_position (Position.thread_data ());
138 fun name_thms pre official pos name xs =
139 map (uncurry (name_thm pre official pos)) (name_multi name xs);
141 fun name_thmss official pos name fact =
142 burrow_fact (name_thms true official pos name) fact;
147 fun enter_proofs (thy, thms) =
148 (FactsData.map (apsnd (fn (proofs, groups) =>
149 (fold (cons o lazy_proof) thms proofs, fold Thm.pending_groups thms groups))) thy, thms);
151 fun enter_thms pre_name post_name app_att (b, thms) thy =
152 if Binding.is_empty b
153 then swap (enter_proofs (app_att (thy, thms)))
156 val naming = Sign.naming_of thy;
157 val name = NameSpace.full_name naming b;
159 enter_proofs (apsnd (post_name name) (app_att (thy, pre_name name thms)));
160 val thms'' = map (Thm.transfer thy') thms';
161 val thy'' = thy' |> (FactsData.map o apfst) (Facts.add_global naming (b, thms'') #> snd);
162 in (thms'', thy'') end;
167 fun store_thms (b, thms) = enter_thms (name_thms true true Position.none)
168 (name_thms false true Position.none) I (b, thms);
170 fun store_thm (b, th) = store_thms (b, [th]) #>> the_single;
172 fun store_thm_open (b, th) =
173 enter_thms (name_thms true false Position.none) (name_thms false false Position.none) I
174 (b, [th]) #>> the_single;
179 fun add_thms_atts pre_name ((b, thms), atts) =
180 enter_thms pre_name (name_thms false true Position.none)
181 (Library.foldl_map (Thm.theory_attributes atts)) (b, thms);
183 fun gen_add_thmss pre_name =
184 fold_map (add_thms_atts pre_name);
186 fun gen_add_thms pre_name args =
187 apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
189 val add_thmss = gen_add_thmss (name_thms true true Position.none);
190 val add_thms = gen_add_thms (name_thms true true Position.none);
191 val add_thm = yield_singleton add_thms;
194 (* add_thms_dynamic *)
196 fun add_thms_dynamic (b, f) thy = thy
197 |> (FactsData.map o apfst)
198 (Facts.add_dynamic (Sign.naming_of thy) (b, f) #> snd);
205 fun gen_note_thmss tag = fold_map (fn ((b, more_atts), ths_atts) => fn thy =>
207 val pos = Binding.pos_of b;
208 val name = Sign.full_name thy b;
209 val _ = Position.report (Markup.fact_decl name) pos;
211 fun app (x, (ths, atts)) = Library.foldl_map (Thm.theory_attributes atts) (x, ths);
212 val (thms, thy') = thy |> enter_thms
213 (name_thmss true pos) (name_thms false true pos) (apsnd flat o Library.foldl_map app)
214 (b, map (fn (ths, atts) => (ths, surround tag (atts @ more_atts))) ths_atts);
215 in ((name, thms), thy') end);
219 fun note_thmss k = gen_note_thmss (Thm.kind k);
220 fun note_thmss_grouped k g = gen_note_thmss (Thm.kind k #> Thm.group g);
225 (* store axioms as theorems *)
228 fun get_ax thy (b, _) = Thm.axiom thy (Sign.full_name thy b);
229 fun get_axs thy named_axs = map (Thm.forall_elim_vars 0 o get_ax thy) named_axs;
230 fun add_axm add = fold_map (fn ((b, ax), atts) => fn thy =>
232 val named_ax = [(b, ax)];
233 val thy' = add named_ax thy;
234 val thm = hd (get_axs thy' named_ax);
235 in apfst hd (gen_add_thms (K I) [((b, thm), atts)] thy') end);
237 val add_defs = add_axm o Theory.add_defs_i false;
238 val add_defs_unchecked = add_axm o Theory.add_defs_i true;
239 val add_axioms = add_axm Theory.add_axioms_i;
240 val add_defs_cmd = add_axm o Theory.add_defs false;
241 val add_defs_unchecked_cmd = add_axm o Theory.add_defs true;
242 val add_axioms_cmd = add_axm Theory.add_axioms;
247 (*** Pure theory syntax and logical content ***)
249 val typ = SimpleSyntax.read_typ;
250 val term = SimpleSyntax.read_term;
251 val prop = SimpleSyntax.read_prop;
253 val typeT = Syntax.typeT;
254 val spropT = Syntax.spropT;
257 (* application syntax variants *)
260 [("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
261 ("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
264 [("", typ "'a => cargs", Delimfix "_"),
265 ("_cargs", typ "'a => cargs => cargs", Mixfix ("_/ _", [1000, 1000], 1000)),
266 ("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
267 ("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
269 structure OldApplSyntax = TheoryDataFun
275 fun merge _ (b1, b2) : T =
277 else error "Cannot merge theories with different application syntax";
280 val old_appl_syntax = OldApplSyntax.get;
282 val old_appl_syntax_setup =
283 OldApplSyntax.put true #>
284 Sign.del_modesyntax_i Syntax.mode_default applC_syntax #>
285 Sign.add_syntax_i appl_syntax;
290 val _ = Context.>> (Context.map_theory
291 (OldApplSyntax.init #>
293 [(Binding.name "fun", 2, NoSyn),
294 (Binding.name "prop", 0, NoSyn),
295 (Binding.name "itself", 1, NoSyn),
296 (Binding.name "dummy", 0, NoSyn)]
297 #> Sign.add_nonterminals (map Binding.name Syntax.basic_nonterms)
299 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3%_./ _)", [0, 3], 3)),
300 ("_abs", typ "'a", NoSyn),
301 ("", typ "'a => args", Delimfix "_"),
302 ("_args", typ "'a => args => args", Delimfix "_,/ _"),
303 ("", typ "id => idt", Delimfix "_"),
304 ("_idtdummy", typ "idt", Delimfix "'_"),
305 ("_idtyp", typ "id => type => idt", Mixfix ("_::_", [], 0)),
306 ("_idtypdummy", typ "type => idt", Mixfix ("'_()::_", [], 0)),
307 ("", typ "idt => idt", Delimfix "'(_')"),
308 ("", typ "idt => idts", Delimfix "_"),
309 ("_idts", typ "idt => idts => idts", Mixfix ("_/ _", [1, 0], 0)),
310 ("", typ "idt => pttrn", Delimfix "_"),
311 ("", typ "pttrn => pttrns", Delimfix "_"),
312 ("_pttrns", typ "pttrn => pttrns => pttrns", Mixfix ("_/ _", [1, 0], 0)),
313 ("", typ "aprop => aprop", Delimfix "'(_')"),
314 ("", typ "id => aprop", Delimfix "_"),
315 ("", typ "longid => aprop", Delimfix "_"),
316 ("", typ "var => aprop", Delimfix "_"),
317 ("_DDDOT", typ "aprop", Delimfix "..."),
318 ("_aprop", typ "aprop => prop", Delimfix "PROP _"),
319 ("_asm", typ "prop => asms", Delimfix "_"),
320 ("_asms", typ "prop => asms => asms", Delimfix "_;/ _"),
321 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
322 ("_ofclass", typ "type => logic => prop", Delimfix "(1OFCLASS/(1'(_,/ _')))"),
323 ("_mk_ofclass", typ "dummy", NoSyn),
324 ("_TYPE", typ "type => logic", Delimfix "(1TYPE/(1'(_')))"),
325 ("", typ "id => logic", Delimfix "_"),
326 ("", typ "longid => logic", Delimfix "_"),
327 ("", typ "var => logic", Delimfix "_"),
328 ("_DDDOT", typ "logic", Delimfix "..."),
329 ("_constify", typ "num => num_const", Delimfix "_"),
330 ("_constify", typ "float_token => float_const", Delimfix "_"),
331 ("_indexnum", typ "num_const => index", Delimfix "\\<^sub>_"),
332 ("_index", typ "logic => index", Delimfix "(00\\<^bsub>_\\<^esub>)"),
333 ("_indexdefault", typ "index", Delimfix ""),
334 ("_indexvar", typ "index", Delimfix "'\\<index>"),
335 ("_struct", typ "index => logic", Mixfix ("\\<struct>_", [1000], 1000)),
336 ("==>", typ "prop => prop => prop", Delimfix "op ==>"),
337 (Term.dummy_patternN, typ "aprop", Delimfix "'_"),
338 ("_sort_constraint", typ "type => prop", Delimfix "(1SORT'_CONSTRAINT/(1'(_')))"),
339 ("Pure.term", typ "logic => prop", Delimfix "TERM _"),
340 ("Pure.conjunction", typ "prop => prop => prop", InfixrName ("&&&", 2))]
341 #> Sign.add_syntax_i applC_syntax
342 #> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
343 [("fun", typ "type => type => type", Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
344 ("_bracket", typ "types => type => type", Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
345 ("_ofsort", typ "tid => sort => type", Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
346 ("_constrain", typ "logic => type => logic", Mixfix ("_\\<Colon>_", [4, 0], 3)),
347 ("_constrain", [spropT, typeT] ---> spropT, Mixfix ("_\\<Colon>_", [4, 0], 3)),
348 ("_idtyp", typ "id => type => idt", Mixfix ("_\\<Colon>_", [], 0)),
349 ("_idtypdummy", typ "type => idt", Mixfix ("'_()\\<Colon>_", [], 0)),
350 ("_type_constraint_", typ "'a", NoSyn),
351 ("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
352 ("==", typ "'a => 'a => prop", InfixrName ("\\<equiv>", 2)),
353 ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
354 ("==>", typ "prop => prop => prop", InfixrName ("\\<Longrightarrow>", 1)),
355 ("_DDDOT", typ "aprop", Delimfix "\\<dots>"),
356 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
357 ("_DDDOT", typ "logic", Delimfix "\\<dots>")]
358 #> Sign.add_modesyntax_i ("", false)
359 [("prop", typ "prop => prop", Mixfix ("_", [0], 0))]
360 #> Sign.add_modesyntax_i ("HTML", false)
361 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
363 [(Binding.name "==", typ "'a => 'a => prop", InfixrName ("==", 2)),
364 (Binding.name "==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
365 (Binding.name "all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
366 (Binding.name "prop", typ "prop => prop", NoSyn),
367 (Binding.name "TYPE", typ "'a itself", NoSyn),
368 (Binding.name Term.dummy_patternN, typ "'a", Delimfix "'_")]
369 #> Theory.add_deps "==" ("==", typ "'a => 'a => prop") []
370 #> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") []
371 #> Theory.add_deps "all" ("all", typ "('a => prop) => prop") []
372 #> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") []
373 #> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") []
374 #> Sign.add_trfuns Syntax.pure_trfuns
375 #> Sign.add_trfunsT Syntax.pure_trfunsT
378 [(Binding.name "term", typ "'a => prop", NoSyn),
379 (Binding.name "sort_constraint", typ "'a itself => prop", NoSyn),
380 (Binding.name "conjunction", typ "prop => prop => prop", NoSyn)]
381 #> (add_defs false o map Thm.no_attributes)
382 [(Binding.name "prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
383 (Binding.name "term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
384 (Binding.name "sort_constraint_def",
385 prop "(CONST Pure.sort_constraint :: 'a itself => prop) (CONST TYPE :: 'a itself) ==\
386 \ (CONST Pure.term :: 'a itself => prop) (CONST TYPE :: 'a itself)"),
387 (Binding.name "conjunction_def", prop "(A &&& B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
388 #> Sign.hide_const false "Pure.term"
389 #> Sign.hide_const false "Pure.sort_constraint"
390 #> Sign.hide_const false "Pure.conjunction"
391 #> add_thmss [((Binding.name "nothing", []), [])] #> snd
392 #> Theory.add_axioms_i (map (apfst Binding.name) Proofterm.equality_axms)));