src/Pure/pure_thy.ML

 (*  Title:      Pure/pure_thy.ML
     Author:     Markus Wenzel, TU Muenchen
 
-Theorem storage.  Pure theory syntax and logical content.
+Pure theory syntax and further logical content.
 *)
 
 signature PURE_THY =
 sig
-  val facts_of: theory -> Facts.T
-  val intern_fact: theory -> xstring -> string
-  val defined_fact: theory -> string -> bool
-  val hide_fact: bool -> string -> theory -> theory
-  val join_proofs: theory -> unit
-  val get_fact: Context.generic -> theory -> Facts.ref -> thm list
-  val get_thms: theory -> xstring -> thm list
-  val get_thm: theory -> xstring -> thm
-  val all_thms_of: theory -> (string * thm) list
-  val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
-  val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
-  val burrow_facts: ('a list -> 'b list) ->
-    ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
-  val name_multi: string -> 'a list -> (string * 'a) list
-  val name_thm: bool -> bool -> string -> thm -> thm
-  val name_thms: bool -> bool -> string -> thm list -> thm list
-  val name_thmss: bool -> string -> (thm list * 'a) list -> (thm list * 'a) list
-  val store_thms: binding * thm list -> theory -> thm list * theory
-  val store_thm: binding * thm -> theory -> thm * theory
-  val store_thm_open: binding * thm -> theory -> thm * theory
-  val add_thms: ((binding * thm) * attribute list) list -> theory -> thm list * theory
-  val add_thm: (binding * thm) * attribute list -> theory -> thm * theory
-  val add_thmss: ((binding * thm list) * attribute list) list -> theory -> thm list list * theory
-  val add_thms_dynamic: binding * (Context.generic -> thm list) -> theory -> theory
-  val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list
-    -> theory -> (string * thm list) list * theory
-  val add_defs: bool -> ((binding * term) * attribute list) list ->
-    theory -> thm list * theory
-  val add_defs_unchecked: bool -> ((binding * term) * attribute list) list ->
-    theory -> thm list * theory
-  val add_defs_cmd: bool -> ((binding * string) * attribute list) list ->
-    theory -> thm list * theory
-  val add_defs_unchecked_cmd: bool -> ((binding * string) * attribute list) list ->
-    theory -> thm list * theory
   val old_appl_syntax: theory -> bool
   val old_appl_syntax_setup: theory -> theory
 end;
 
-structure PureThy: PURE_THY =
+structure Pure_Thy: PURE_THY =
 struct
-
-
-(*** stored facts ***)
-
-(** theory data **)
-
-structure Global_Facts = Theory_Data
-(
-  type T = Facts.T * thm list;
-  val empty = (Facts.empty, []);
-  fun extend (facts, _) = (facts, []);
-  fun merge ((facts1, _), (facts2, _)) = (Facts.merge (facts1, facts2), []);
-);
-
-
-(* facts *)
-
-val facts_of = #1 o Global_Facts.get;
-
-val intern_fact = Facts.intern o facts_of;
-val defined_fact = Facts.defined o facts_of;
-
-fun hide_fact fully name = Global_Facts.map (apfst (Facts.hide fully name));
-
-
-(* proofs *)
-
-fun register_proofs (thy, thms) = (Global_Facts.map (apsnd (append thms)) thy, thms);
-
-fun join_proofs thy = Thm.join_proofs (rev (#2 (Global_Facts.get thy)));
-
-
-
-(** retrieve theorems **)
-
-fun get_fact context thy xthmref =
-  let
-    val xname = Facts.name_of_ref xthmref;
-    val pos = Facts.pos_of_ref xthmref;
-
-    val name = intern_fact thy xname;
-    val res = Facts.lookup context (facts_of thy) name;
-    val _ = Theory.check_thy thy;
-  in
-    (case res of
-      NONE => error ("Unknown fact " ^ quote name ^ Position.str_of pos)
-    | SOME (static, ths) =>
-        (Position.report pos ((if static then Markup.fact else Markup.dynamic_fact) name);
-         Facts.select xthmref (map (Thm.transfer thy) ths)))
-  end;
-
-fun get_thms thy = get_fact (Context.Theory thy) thy o Facts.named;
-fun get_thm thy name = Facts.the_single name (get_thms thy name);
-
-fun all_thms_of thy =
-  Facts.fold_static (fn (_, ths) => append (map (`(Thm.get_name_hint)) ths)) (facts_of thy) [];
-
-
-
-(** store theorems **)
-
-(* fact specifications *)
-
-fun map_facts f = map (apsnd (map (apfst (map f))));
-fun burrow_fact f = split_list #>> burrow f #> op ~~;
-fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
-
-
-(* naming *)
-
-fun name_multi name [x] = [(name, x)]
-  | name_multi "" xs = map (pair "") xs
-  | name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
-
-fun name_thm pre official name thm = thm
-  |> not (Thm.derivation_name thm <> "" andalso pre orelse not official) ? Thm.name_derivation name
-  |> (if Thm.has_name_hint thm andalso pre orelse name = "" then I else Thm.put_name_hint name);
-
-fun name_thms pre official name xs =
-  map (uncurry (name_thm pre official)) (name_multi name xs);
-
-fun name_thmss official name fact =
-  burrow_fact (name_thms true official name) fact;
-
-
-(* enter_thms *)
-
-fun enter_thms pre_name post_name app_att (b, thms) thy =
-  if Binding.is_empty b
-  then swap (register_proofs (app_att (thy, thms)))
-  else
-    let
-      val naming = Sign.naming_of thy;
-      val name = Name_Space.full_name naming b;
-      val (thy', thms') =
-        register_proofs (apsnd (post_name name) (app_att (thy, pre_name name thms)));
-      val thms'' = map (Thm.transfer thy') thms';
-      val thy'' = thy' |> (Global_Facts.map o apfst) (Facts.add_global naming (b, thms'') #> snd);
-    in (thms'', thy'') end;
-
-
-(* store_thm(s) *)
-
-fun store_thms (b, thms) =
-  enter_thms (name_thms true true) (name_thms false true) I (b, thms);
-
-fun store_thm (b, th) = store_thms (b, [th]) #>> the_single;
-
-fun store_thm_open (b, th) =
-  enter_thms (name_thms true false) (name_thms false false) I (b, [th]) #>> the_single;
-
-
-(* add_thms(s) *)
-
-fun add_thms_atts pre_name ((b, thms), atts) =
-  enter_thms pre_name (name_thms false true)
-    (Library.foldl_map (Thm.theory_attributes atts)) (b, thms);
-
-fun gen_add_thmss pre_name =
-  fold_map (add_thms_atts pre_name);
-
-fun gen_add_thms pre_name args =
-  apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
-
-val add_thmss = gen_add_thmss (name_thms true true);
-val add_thms = gen_add_thms (name_thms true true);
-val add_thm = yield_singleton add_thms;
-
-
-(* add_thms_dynamic *)
-
-fun add_thms_dynamic (b, f) thy = thy
-  |> (Global_Facts.map o apfst)
-      (Facts.add_dynamic (Sign.naming_of thy) (b, f) #> snd);
-
-
-(* note_thmss *)
-
-fun note_thmss kind = fold_map (fn ((b, more_atts), ths_atts) => fn thy =>
-  let
-    val pos = Binding.pos_of b;
-    val name = Sign.full_name thy b;
-    val _ = Position.report pos (Markup.fact_decl name);
-
-    fun app (x, (ths, atts)) = Library.foldl_map (Thm.theory_attributes atts) (x, ths);
-    val (thms, thy') = thy |> enter_thms
-      (name_thmss true) (name_thms false true) (apsnd flat o Library.foldl_map app)
-      (b, map (fn (ths, atts) => (ths, surround (Thm.kind kind) (atts @ more_atts))) ths_atts);
-  in ((name, thms), thy') end);
-
-
-(* store axioms as theorems *)
-
-local
-
-fun no_read _ (_, t) = t;
-
-fun read thy (b, str) =
-  Syntax.read_prop_global thy str handle ERROR msg =>
-    cat_error msg ("The error(s) above occurred in definition " ^ quote (Binding.str_of b));
-
-fun add prep unchecked overloaded = fold_map (fn ((b, raw_prop), atts) => fn thy =>
-  let
-    val prop = prep thy (b, raw_prop);
-    val ((_, def), thy') = Thm.add_def unchecked overloaded (b, prop) thy;
-    val thm = def
-      |> Thm.forall_intr_frees
-      |> Thm.forall_elim_vars 0
-      |> Thm.varifyT_global;
-  in yield_singleton (gen_add_thms (K I)) ((b, thm), atts) thy' end);
-
-in
-
-val add_defs = add no_read false;
-val add_defs_unchecked = add no_read true;
-val add_defs_cmd = add read false;
-val add_defs_unchecked_cmd = add read true;
-
-end;
-
-
-
-(*** Pure theory syntax and logical content ***)
 
 val typ = Simple_Syntax.read_typ;
 val prop = Simple_Syntax.read_prop;
 
 val tycon = Syntax.mark_type;

   #> Sign.local_path
   #> Sign.add_consts_i
    [(Binding.name "term", typ "'a => prop", NoSyn),
     (Binding.name "sort_constraint", typ "'a itself => prop", NoSyn),
     (Binding.name "conjunction", typ "prop => prop => prop", NoSyn)]
-  #> (add_defs false o map Thm.no_attributes)
+  #> (Global_Theory.add_defs false o map Thm.no_attributes)
    [(Binding.name "prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
     (Binding.name "term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
     (Binding.name "sort_constraint_def",
       prop "(CONST Pure.sort_constraint :: 'a itself => prop) (CONST TYPE :: 'a itself) ==\
       \ (CONST Pure.term :: 'a itself => prop) (CONST TYPE :: 'a itself)"),
     (Binding.name "conjunction_def", prop "(A &&& B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
   #> Sign.hide_const false "Pure.term"
   #> Sign.hide_const false "Pure.sort_constraint"
   #> Sign.hide_const false "Pure.conjunction"
-  #> add_thmss [((Binding.name "nothing", []), [])] #> snd
+  #> Global_Theory.add_thmss [((Binding.name "nothing", []), [])] #> snd
   #> fold (fn (a, prop) => snd o Thm.add_axiom (Binding.name a, prop)) Proofterm.equality_axms));
 
 end;