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