src/Pure/pure_thy.ML
author wenzelm
Wed Apr 29 11:29:00 1998 +0200 (1998-04-29)
changeset 4853 67bcbb03c235
parent 4792 8e3c2dddb9c8
child 4922 03b81b6e1baa
permissions -rw-r--r--
tuned names of (add_)store_XXX functions;
added attributes to add_thms, add_axioms, add_defs functions;
wenzelm@3987
     1
(*  Title:      Pure/pure_thy.ML
wenzelm@3987
     2
    ID:         $Id$
wenzelm@3987
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@3987
     4
wenzelm@4783
     5
The Pure theories.
wenzelm@3987
     6
*)
wenzelm@3987
     7
wenzelm@4022
     8
signature BASIC_PURE_THY =
wenzelm@4022
     9
sig
wenzelm@4022
    10
  val get_thm: theory -> xstring -> thm
wenzelm@4022
    11
  val get_thms: theory -> xstring -> thm list
wenzelm@4022
    12
  val thms_of: theory -> (string * thm) list
wenzelm@4853
    13
end;
wenzelm@4022
    14
wenzelm@3987
    15
signature PURE_THY =
wenzelm@3987
    16
sig
wenzelm@4022
    17
  include BASIC_PURE_THY
wenzelm@4783
    18
  val get_tthm: theory -> xstring -> tthm
wenzelm@4783
    19
  val get_tthms: theory -> xstring -> tthm list
wenzelm@4022
    20
  val thms_containing: theory -> string list -> (string * thm) list
wenzelm@4022
    21
  val smart_store_thm: (bstring * thm) -> thm
wenzelm@4853
    22
  val add_tthms: ((bstring * tthm) * theory attribute list) list -> theory -> theory
wenzelm@4853
    23
  val add_tthmss: ((bstring * tthm list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    24
  val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory
wenzelm@4853
    25
  val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory
wenzelm@4853
    26
  val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    27
  val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    28
  val add_defs: ((bstring * string) * theory attribute list) list -> theory -> theory
wenzelm@4853
    29
  val add_defs_i: ((bstring * term) * theory attribute list) list -> theory -> theory
wenzelm@4853
    30
  val add_defss: ((bstring * string list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    31
  val add_defss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory
wenzelm@3987
    32
  val proto_pure: theory
wenzelm@3987
    33
  val pure: theory
wenzelm@3987
    34
  val cpure: theory
wenzelm@3987
    35
end;
wenzelm@3987
    36
wenzelm@3987
    37
structure PureThy: PURE_THY =
wenzelm@3987
    38
struct
wenzelm@3987
    39
wenzelm@3987
    40
wenzelm@4022
    41
(*** init theorems data ***)
wenzelm@3987
    42
wenzelm@4783
    43
(** data kind 'theorems' **)
wenzelm@3987
    44
wenzelm@4783
    45
val theoremsK = "Pure/theorems";
wenzelm@3987
    46
wenzelm@3987
    47
exception Theorems of
wenzelm@4022
    48
 {space: NameSpace.T,
wenzelm@4783
    49
  thms_tab: tthm list Symtab.table,
wenzelm@4783
    50
  const_idx: int * (int * tthm) list Symtab.table} ref;
wenzelm@3987
    51
wenzelm@3987
    52
wenzelm@3987
    53
(* methods *)
wenzelm@3987
    54
wenzelm@3987
    55
local
wenzelm@4853
    56
  fun mk_empty _ =
wenzelm@4853
    57
    Theorems (ref {space = NameSpace.empty,
wenzelm@4853
    58
      thms_tab = Symtab.empty, const_idx = (0, Symtab.empty)});
wenzelm@3987
    59
wenzelm@4853
    60
  fun print sg (Theorems (ref {space, thms_tab, const_idx = _})) =
wenzelm@4853
    61
    let
wenzelm@4853
    62
      val prt_thm = Attribute.pretty_tthm o apfst (Thm.transfer_sg sg);
wenzelm@4853
    63
      fun prt_thms (name, [th]) =
wenzelm@4853
    64
            Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th]
wenzelm@4853
    65
        | prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths);
wenzelm@3987
    66
wenzelm@4853
    67
      fun extrn name =
wenzelm@4853
    68
        if ! long_names then name else NameSpace.extern space name;
wenzelm@4853
    69
      val thmss = sort_wrt fst (map (apfst extrn) (Symtab.dest thms_tab));
wenzelm@4853
    70
    in
wenzelm@4853
    71
      Pretty.writeln (Display.pretty_name_space ("theorem name space", space));
wenzelm@4853
    72
      Pretty.writeln (Pretty.big_list "theorems:" (map prt_thms thmss))
wenzelm@4853
    73
    end;
wenzelm@3987
    74
in
wenzelm@4853
    75
  val theorems_setup = Theory.init_data [(theoremsK, (mk_empty (), mk_empty, mk_empty, print))];
wenzelm@3987
    76
end;
wenzelm@3987
    77
wenzelm@3987
    78
wenzelm@3987
    79
(* get data record *)
wenzelm@3987
    80
wenzelm@4022
    81
fun get_theorems_sg sg =
wenzelm@4049
    82
  (case Sign.get_data sg theoremsK of
wenzelm@3987
    83
    Theorems r => r
wenzelm@4792
    84
  | _ => type_error theoremsK);
wenzelm@4022
    85
wenzelm@4783
    86
val get_theorems = get_theorems_sg o Theory.sign_of;
wenzelm@4022
    87
wenzelm@3987
    88
wenzelm@3987
    89
wenzelm@4022
    90
(** retrieve theorems **)
wenzelm@3987
    91
wenzelm@4022
    92
fun local_thms thy name =
wenzelm@3987
    93
  let
wenzelm@4022
    94
    val ref {space, thms_tab, ...} = get_theorems thy;
wenzelm@4022
    95
    val full_name = NameSpace.intern space name;
wenzelm@4022
    96
  in Symtab.lookup (thms_tab, full_name) end;
wenzelm@4022
    97
wenzelm@4022
    98
fun all_local_thms [] _ = None
wenzelm@4022
    99
  | all_local_thms (thy :: thys) name =
wenzelm@4022
   100
      (case local_thms thy name of
wenzelm@4022
   101
        None => all_local_thms thys name
wenzelm@4022
   102
      | some => some);
wenzelm@4022
   103
wenzelm@3987
   104
wenzelm@4783
   105
(* get_thms etc. *)
wenzelm@4037
   106
wenzelm@4783
   107
fun get_tthms thy name =
wenzelm@4022
   108
  (case all_local_thms (thy :: Theory.ancestors_of thy) name of
wenzelm@4590
   109
    None => raise THEORY ("Unknown theorem(s) " ^ quote name, [thy])
wenzelm@4022
   110
  | Some thms => thms);
wenzelm@3987
   111
wenzelm@4783
   112
fun get_tthm thy name =
wenzelm@4783
   113
  (case get_tthms thy name of
wenzelm@3987
   114
    [thm] => thm
wenzelm@4590
   115
  | _ => raise THEORY ("Single theorem expected " ^ quote name, [thy]));
wenzelm@4022
   116
wenzelm@4783
   117
fun get_thms thy = map Attribute.thm_of o get_tthms thy;
wenzelm@4783
   118
fun get_thm thy = Attribute.thm_of o get_tthm thy;
wenzelm@4783
   119
wenzelm@4022
   120
wenzelm@4022
   121
(* thms_of *)
wenzelm@4022
   122
wenzelm@4783
   123
fun attach_name (thm, _) = (Thm.name_of_thm thm, thm);
wenzelm@4022
   124
wenzelm@4022
   125
fun thms_of thy =
wenzelm@4022
   126
  let val ref {thms_tab, ...} = get_theorems thy in
wenzelm@4022
   127
    map attach_name (flat (map snd (Symtab.dest thms_tab)))
wenzelm@4022
   128
  end;
wenzelm@4022
   129
wenzelm@3987
   130
wenzelm@3987
   131
wenzelm@4022
   132
(** theorems indexed by constants **)
wenzelm@4022
   133
wenzelm@4022
   134
(* make index *)
wenzelm@4022
   135
wenzelm@4037
   136
val ignore = ["Trueprop", "all", "==>", "=="];
wenzelm@4022
   137
wenzelm@4783
   138
fun add_const_idx ((next, table), tthm as (thm, _)) =
wenzelm@4022
   139
  let
wenzelm@4022
   140
    val {hyps, prop, ...} = Thm.rep_thm thm;
wenzelm@4022
   141
    val consts =
wenzelm@4037
   142
      foldr add_term_consts (hyps, add_term_consts (prop, [])) \\ ignore;
wenzelm@4022
   143
wenzelm@4022
   144
    fun add (tab, c) =
wenzelm@4783
   145
      Symtab.update ((c, (next, tthm) :: Symtab.lookup_multi (tab, c)), tab);
wenzelm@4022
   146
  in (next + 1, foldl add (table, consts)) end;
wenzelm@4022
   147
wenzelm@4022
   148
fun make_const_idx thm_tab =
wenzelm@4487
   149
  foldl (foldl add_const_idx) ((0, Symtab.empty), map snd (Symtab.dest thm_tab));
wenzelm@4022
   150
wenzelm@4022
   151
wenzelm@4022
   152
(* lookup index *)
wenzelm@3987
   153
wenzelm@4022
   154
(*search locally*)
wenzelm@4022
   155
fun containing [] thy = thms_of thy
wenzelm@4022
   156
  | containing consts thy =
wenzelm@4022
   157
      let
wenzelm@4037
   158
        fun int ([], _) = []
wenzelm@4037
   159
          | int (_, []) = []
wenzelm@4037
   160
          | int (xxs as ((x as (i:int, _)) :: xs), yys as ((y as (j, _)) :: ys)) =
wenzelm@4037
   161
              if i = j then x :: int (xs, ys)
wenzelm@4037
   162
              else if i > j then int (xs, yys)
wenzelm@4037
   163
              else int (xxs, ys);
wenzelm@4022
   164
wenzelm@4037
   165
        fun ints [xs] = xs
wenzelm@4037
   166
          | ints xss = if exists null xss then [] else foldl int (hd xss, tl xss);
wenzelm@4022
   167
wenzelm@4022
   168
        val ref {const_idx = (_, ctab), ...} = get_theorems thy;
wenzelm@4022
   169
        val ithmss = map (fn c => Symtab.lookup_multi (ctab, c)) consts;
wenzelm@4022
   170
      in
wenzelm@4037
   171
        map (attach_name o snd) (ints ithmss)
wenzelm@4022
   172
      end;
wenzelm@4022
   173
wenzelm@4022
   174
(*search globally*)
wenzelm@4022
   175
fun thms_containing thy consts =
wenzelm@4037
   176
  flat (map (containing (consts \\ ignore)) (thy :: Theory.ancestors_of thy));
wenzelm@4022
   177
wenzelm@4022
   178
wenzelm@4022
   179
wenzelm@4022
   180
(** store theorems **)                    (*DESTRUCTIVE*)
wenzelm@3987
   181
wenzelm@4853
   182
(* naming *)
wenzelm@4853
   183
wenzelm@4853
   184
fun gen_names len name =
wenzelm@4853
   185
  map (fn i => name ^ "_" ^ string_of_int i) (1 upto len);
wenzelm@4853
   186
wenzelm@4853
   187
fun name_single name x = [(name, x)];
wenzelm@4853
   188
fun name_multi name xs = gen_names (length xs) name ~~ xs;
wenzelm@4853
   189
wenzelm@4853
   190
wenzelm@4853
   191
(* enter_tthmx *)
wenzelm@4853
   192
wenzelm@3987
   193
fun warn_overwrite name =
wenzelm@3987
   194
  warning ("Replaced old copy of theorems " ^ quote name);
wenzelm@3987
   195
wenzelm@3987
   196
fun warn_same name =
wenzelm@4853
   197
  warning ("Theorem database already contains a copy of " ^ quote name);  
wenzelm@3987
   198
wenzelm@4853
   199
fun enter_tthmx sg app_name (bname, tthmx) =
wenzelm@3987
   200
  let
wenzelm@4853
   201
    val name = Sign.full_name sg bname;
wenzelm@4853
   202
    fun name_tthm (nm, (thm, tgs)) = (Thm.name_thm (nm, thm), tgs);
wenzelm@4853
   203
    val named_tthms = map name_tthm (app_name name tthmx);
wenzelm@3987
   204
wenzelm@4783
   205
    fun eq_tthm ((th1, _), (th2, _)) = Thm.eq_thm (th1, th2);
wenzelm@4022
   206
wenzelm@4022
   207
    val r as ref {space, thms_tab, const_idx} = get_theorems_sg sg;
wenzelm@4022
   208
wenzelm@4022
   209
    val overwrite =
wenzelm@4022
   210
      (case Symtab.lookup (thms_tab, name) of
wenzelm@4022
   211
        None => false
wenzelm@4783
   212
      | Some tthms' =>
wenzelm@4853
   213
          if length tthms' = length named_tthms andalso forall2 eq_tthm (tthms', named_tthms) then
wenzelm@4022
   214
            (warn_same name; false)
wenzelm@4022
   215
          else (warn_overwrite name; true));
wenzelm@4022
   216
wenzelm@4487
   217
    val space' = NameSpace.extend (space, [name]);
wenzelm@4783
   218
    val thms_tab' = Symtab.update ((name, named_tthms), thms_tab);
wenzelm@4022
   219
    val const_idx' =
wenzelm@4022
   220
      if overwrite then make_const_idx thms_tab'
wenzelm@4783
   221
      else foldl add_const_idx (const_idx, named_tthms);
wenzelm@3987
   222
  in
wenzelm@4022
   223
    r := {space = space', thms_tab = thms_tab', const_idx = const_idx'};
wenzelm@4783
   224
    named_tthms
wenzelm@3987
   225
  end;
wenzelm@3987
   226
wenzelm@4853
   227
wenzelm@4853
   228
(* add_tthms(s) *)
wenzelm@4853
   229
wenzelm@4853
   230
fun add_tthmx app_name app_att ((bname, tthmx), atts) thy =
wenzelm@4853
   231
  let val (thy', tthmx') = app_att ((thy, tthmx), atts)
wenzelm@4853
   232
  in enter_tthmx (Theory.sign_of thy') app_name (bname, tthmx'); thy' end;
wenzelm@4853
   233
wenzelm@4853
   234
val add_tthms = Theory.apply o map (add_tthmx name_single Attribute.apply);
wenzelm@4853
   235
val add_tthmss = Theory.apply o map (add_tthmx name_multi Attribute.applys);
wenzelm@3987
   236
wenzelm@3987
   237
wenzelm@4853
   238
(* smart_store_thm *)
wenzelm@3987
   239
wenzelm@4012
   240
fun smart_store_thm (name, thm) =
wenzelm@4853
   241
  let val [(thm', _)] = enter_tthmx (Thm.sign_of_thm thm) name_single (name, Attribute.tthm_of thm)
wenzelm@4783
   242
  in thm' end;
wenzelm@3987
   243
wenzelm@3987
   244
wenzelm@4022
   245
(* store axioms as theorems *)
wenzelm@4022
   246
wenzelm@4853
   247
local
wenzelm@4853
   248
  fun add_ax app_name add ((name, axs), atts) thy =
wenzelm@4853
   249
    let
wenzelm@4853
   250
      val named_axs = app_name name axs;
wenzelm@4853
   251
      val thy' = add named_axs thy;
wenzelm@4853
   252
      val tthms = map (Attribute.tthm_of o Thm.get_axiom thy' o fst) named_axs;
wenzelm@4853
   253
    in add_tthmss [((name, tthms), atts)] thy' end;
wenzelm@4022
   254
wenzelm@4853
   255
  fun add_axs app_name add = Theory.apply o map (add_ax app_name add);
wenzelm@4853
   256
in
wenzelm@4853
   257
  val add_axioms    = add_axs name_single Theory.add_axioms;
wenzelm@4853
   258
  val add_axioms_i  = add_axs name_single Theory.add_axioms_i;
wenzelm@4853
   259
  val add_axiomss   = add_axs name_multi Theory.add_axioms;
wenzelm@4853
   260
  val add_axiomss_i = add_axs name_multi Theory.add_axioms_i;
wenzelm@4853
   261
  val add_defs      = add_axs name_single Theory.add_defs;
wenzelm@4853
   262
  val add_defs_i    = add_axs name_single Theory.add_defs_i;
wenzelm@4853
   263
  val add_defss     = add_axs name_multi Theory.add_defs;
wenzelm@4853
   264
  val add_defss_i   = add_axs name_multi Theory.add_defs_i;
wenzelm@4853
   265
end;
wenzelm@4022
   266
wenzelm@4022
   267
wenzelm@3987
   268
wenzelm@3987
   269
(** the Pure theories **)
wenzelm@3987
   270
wenzelm@3987
   271
val proto_pure =
wenzelm@3987
   272
  Theory.pre_pure
wenzelm@4853
   273
  |> Theory.apply [Attribute.setup, theorems_setup]
wenzelm@3987
   274
  |> Theory.add_types
wenzelm@3987
   275
   (("fun", 2, NoSyn) ::
wenzelm@3987
   276
    ("prop", 0, NoSyn) ::
wenzelm@3987
   277
    ("itself", 1, NoSyn) ::
wenzelm@3987
   278
    Syntax.pure_types)
wenzelm@3987
   279
  |> Theory.add_classes_i [(logicC, [])]
wenzelm@3987
   280
  |> Theory.add_defsort_i logicS
wenzelm@3987
   281
  |> Theory.add_arities_i
wenzelm@3987
   282
   [("fun", [logicS, logicS], logicS),
wenzelm@3987
   283
    ("prop", [], logicS),
wenzelm@3987
   284
    ("itself", [logicS], logicS)]
wenzelm@3987
   285
  |> Theory.add_syntax Syntax.pure_syntax
wenzelm@3987
   286
  |> Theory.add_modesyntax ("symbols", true) Syntax.pure_sym_syntax
wenzelm@3987
   287
  |> Theory.add_trfuns Syntax.pure_trfuns
wenzelm@3987
   288
  |> Theory.add_trfunsT Syntax.pure_trfunsT
wenzelm@3987
   289
  |> Theory.add_syntax
wenzelm@3987
   290
   [("==>", "[prop, prop] => prop", Delimfix "op ==>")]
wenzelm@3987
   291
  |> Theory.add_consts
wenzelm@3987
   292
   [("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)),
wenzelm@3987
   293
    ("=?=", "['a::{}, 'a] => prop", InfixrName ("=?=", 2)),
wenzelm@3987
   294
    ("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@3987
   295
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@4788
   296
    ("Goal", "prop => prop", Mixfix ("GOAL _", [999], 1000)),
wenzelm@3987
   297
    ("TYPE", "'a itself", NoSyn)]
wenzelm@4022
   298
  |> Theory.add_path "ProtoPure"
wenzelm@4853
   299
  |> (add_defs o map Attribute.none)
wenzelm@4788
   300
   [("flexpair_def", "(t =?= u) == (t == u::'a::{})"),
wenzelm@4788
   301
    ("Goal_def", "GOAL (PROP A) == PROP A")]
wenzelm@3987
   302
  |> Theory.add_name "ProtoPure";
wenzelm@3987
   303
wenzelm@4022
   304
val pure =
wenzelm@4022
   305
  Theory.prep_ext_merge [proto_pure]
wenzelm@3987
   306
  |> Theory.add_syntax Syntax.pure_appl_syntax
wenzelm@4022
   307
  |> Theory.add_path "Pure"
wenzelm@3987
   308
  |> Theory.add_name "Pure";
wenzelm@3987
   309
wenzelm@4022
   310
val cpure =
wenzelm@4022
   311
  Theory.prep_ext_merge [proto_pure]
wenzelm@3987
   312
  |> Theory.add_syntax Syntax.pure_applC_syntax
wenzelm@4022
   313
  |> Theory.add_path "CPure"
wenzelm@3987
   314
  |> Theory.add_name "CPure";
wenzelm@3987
   315
wenzelm@3987
   316
wenzelm@3987
   317
end;
wenzelm@3987
   318
wenzelm@3987
   319
wenzelm@4022
   320
structure BasicPureThy: BASIC_PURE_THY = PureThy;
wenzelm@4022
   321
open BasicPureThy;
wenzelm@4022
   322
wenzelm@4022
   323
wenzelm@3987
   324
wenzelm@3987
   325
(** theory structures **)
wenzelm@3987
   326
wenzelm@3987
   327
structure ProtoPure =
wenzelm@3987
   328
struct
wenzelm@3987
   329
  val thy = PureThy.proto_pure;
wenzelm@3987
   330
  val flexpair_def = get_axiom thy "flexpair_def";
wenzelm@4788
   331
  val Goal_def = get_axiom thy "Goal_def";
wenzelm@3987
   332
end;
wenzelm@3987
   333
wenzelm@3987
   334
structure Pure = struct val thy = PureThy.pure end;
wenzelm@3987
   335
structure CPure = struct val thy = PureThy.cpure end;