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