src/Pure/pure_thy.ML
author berghofe
Thu Feb 07 11:07:03 2002 +0100 (2002-02-07)
changeset 12872 0855c3ab2047
parent 12711 6a9412dd7d24
child 13274 191419fac368
permissions -rw-r--r--
Theorems are only "pre-named" if the do not already have names.
wenzelm@3987
     1
(*  Title:      Pure/pure_thy.ML
wenzelm@3987
     2
    ID:         $Id$
wenzelm@3987
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@9318
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@3987
     5
wenzelm@5091
     6
Theorem database, derived theory operations, and the ProtoPure theory.
wenzelm@3987
     7
*)
wenzelm@3987
     8
wenzelm@4022
     9
signature BASIC_PURE_THY =
wenzelm@4022
    10
sig
wenzelm@5000
    11
  val print_theorems: theory -> unit
wenzelm@5000
    12
  val print_theory: theory -> unit
wenzelm@4022
    13
  val get_thm: theory -> xstring -> thm
wenzelm@4022
    14
  val get_thms: theory -> xstring -> thm list
wenzelm@6094
    15
  val get_thmss: theory -> xstring list -> thm list
wenzelm@4022
    16
  val thms_of: theory -> (string * thm) list
wenzelm@5091
    17
  structure ProtoPure:
wenzelm@5091
    18
    sig
wenzelm@5091
    19
      val thy: theory
wenzelm@5091
    20
      val flexpair_def: thm
wenzelm@5091
    21
      val Goal_def: thm
wenzelm@5091
    22
    end
wenzelm@4853
    23
end;
wenzelm@4022
    24
wenzelm@3987
    25
signature PURE_THY =
wenzelm@3987
    26
sig
wenzelm@4022
    27
  include BASIC_PURE_THY
wenzelm@9808
    28
  val get_thm_closure: theory -> xstring -> thm
wenzelm@9564
    29
  val get_thms_closure: theory -> xstring -> thm list
wenzelm@9564
    30
  val single_thm: string -> thm list -> thm
wenzelm@6367
    31
  val cond_extern_thm_sg: Sign.sg -> string -> xstring
wenzelm@4022
    32
  val thms_containing: theory -> string list -> (string * thm) list
wenzelm@12695
    33
  val hide_thms: bool -> string list -> theory -> theory
wenzelm@6091
    34
  val store_thm: (bstring * thm) * theory attribute list -> theory -> theory * thm
wenzelm@7405
    35
  val smart_store_thms: (bstring * thm list) -> thm list
wenzelm@12138
    36
  val smart_store_thms_open: (bstring * thm list) -> thm list
wenzelm@7899
    37
  val forall_elim_var: int -> thm -> thm
wenzelm@7899
    38
  val forall_elim_vars: int -> thm -> thm
wenzelm@8419
    39
  val add_thms: ((bstring * thm) * theory attribute list) list -> theory -> theory * thm list
wenzelm@12711
    40
  val add_thmss: ((bstring * thm list) * theory attribute list) list -> theory
wenzelm@12711
    41
    -> theory * thm list list
wenzelm@12711
    42
  val have_thmss: theory attribute -> ((bstring * theory attribute list) *
wenzelm@12711
    43
    (xstring * theory attribute list) list) list -> theory -> theory * (bstring * thm list) list
wenzelm@12711
    44
  val have_thmss_i: theory attribute -> ((bstring * theory attribute list) *
wenzelm@12711
    45
    (thm list * theory attribute list) list) list -> theory -> theory * (bstring * thm list) list
wenzelm@8419
    46
  val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    47
  val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory * thm list
wenzelm@12711
    48
  val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory
wenzelm@12711
    49
    -> theory * thm list list
wenzelm@12711
    50
  val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory
wenzelm@12711
    51
    -> theory * thm list list
wenzelm@9318
    52
  val add_defs: bool -> ((bstring * string) * theory attribute list) list
wenzelm@9318
    53
    -> theory -> theory * thm list
wenzelm@9318
    54
  val add_defs_i: bool -> ((bstring * term) * theory attribute list) list
wenzelm@9318
    55
    -> theory -> theory * thm list
wenzelm@9318
    56
  val add_defss: bool -> ((bstring * string list) * theory attribute list) list
wenzelm@9318
    57
    -> theory -> theory * thm list list
wenzelm@9318
    58
  val add_defss_i: bool -> ((bstring * term list) * theory attribute list) list
wenzelm@9318
    59
    -> theory -> theory * thm list list
wenzelm@4963
    60
  val get_name: theory -> string
wenzelm@4963
    61
  val put_name: string -> theory -> theory
wenzelm@4963
    62
  val global_path: theory -> theory
wenzelm@4963
    63
  val local_path: theory -> theory
wenzelm@4963
    64
  val begin_theory: string -> theory list -> theory
wenzelm@4963
    65
  val end_theory: theory -> theory
wenzelm@6682
    66
  val checkpoint: theory -> theory
wenzelm@4922
    67
  val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
wenzelm@3987
    68
end;
wenzelm@3987
    69
wenzelm@3987
    70
structure PureThy: PURE_THY =
wenzelm@3987
    71
struct
wenzelm@3987
    72
wenzelm@3987
    73
wenzelm@4922
    74
(*** theorem database ***)
wenzelm@3987
    75
wenzelm@4922
    76
(** data kind 'Pure/theorems' **)
wenzelm@3987
    77
wenzelm@5005
    78
structure TheoremsDataArgs =
wenzelm@5005
    79
struct
wenzelm@5005
    80
  val name = "Pure/theorems";
wenzelm@3987
    81
wenzelm@5005
    82
  type T =
wenzelm@5005
    83
    {space: NameSpace.T,
wenzelm@6091
    84
      thms_tab: thm list Symtab.table,
wenzelm@6091
    85
      const_idx: int * (int * thm) list Symtab.table} ref;
wenzelm@3987
    86
wenzelm@4853
    87
  fun mk_empty _ =
wenzelm@5005
    88
    ref {space = NameSpace.empty, thms_tab = Symtab.empty, const_idx = (0, Symtab.empty)} : T;
wenzelm@3987
    89
wenzelm@5005
    90
  val empty = mk_empty ();
wenzelm@6547
    91
  fun copy (ref x) = ref x;
wenzelm@5005
    92
  val prep_ext = mk_empty;
wenzelm@5005
    93
  val merge = mk_empty;
wenzelm@5005
    94
wenzelm@8720
    95
  fun pretty sg (ref {space, thms_tab, const_idx = _}) =
wenzelm@4853
    96
    let
wenzelm@10008
    97
      val prt_thm = Display.pretty_thm_sg sg;
wenzelm@4853
    98
      fun prt_thms (name, [th]) =
wenzelm@4853
    99
            Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th]
wenzelm@4853
   100
        | prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths);
wenzelm@3987
   101
wenzelm@6846
   102
      val thmss = NameSpace.cond_extern_table space thms_tab;
wenzelm@9215
   103
    in Pretty.big_list "theorems:" (map prt_thms thmss) end;
wenzelm@8720
   104
wenzelm@9215
   105
  fun print sg data = Pretty.writeln (pretty sg data);
wenzelm@3987
   106
end;
wenzelm@3987
   107
wenzelm@5005
   108
structure TheoremsData = TheoryDataFun(TheoremsDataArgs);
wenzelm@5005
   109
val get_theorems_sg = TheoremsData.get_sg;
wenzelm@5005
   110
val get_theorems = TheoremsData.get;
wenzelm@5005
   111
wenzelm@6367
   112
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg;
wenzelm@6367
   113
wenzelm@3987
   114
wenzelm@5000
   115
(* print theory *)
wenzelm@3987
   116
wenzelm@5005
   117
val print_theorems = TheoremsData.print;
wenzelm@8720
   118
wenzelm@5000
   119
fun print_theory thy =
wenzelm@9215
   120
  Display.pretty_full_theory thy @
wenzelm@9215
   121
  [TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)]
wenzelm@8720
   122
  |> Pretty.chunks |> Pretty.writeln;
wenzelm@4022
   123
wenzelm@3987
   124
wenzelm@3987
   125
wenzelm@4022
   126
(** retrieve theorems **)
wenzelm@3987
   127
wenzelm@9564
   128
(* selections *)
wenzelm@9564
   129
wenzelm@9564
   130
fun the_thms _ (Some thms) = thms
wenzelm@9564
   131
  | the_thms name None = error ("Unknown theorem(s) " ^ quote name);
wenzelm@4037
   132
wenzelm@9564
   133
fun single_thm _ [thm] = thm
wenzelm@9564
   134
  | single_thm name _ = error ("Single theorem expected " ^ quote name);
wenzelm@9564
   135
wenzelm@9564
   136
wenzelm@9808
   137
(* get_thm(s)_closure -- statically scoped versions *)
wenzelm@9564
   138
wenzelm@9564
   139
(*beware of proper order of evaluation!*)
wenzelm@4922
   140
wenzelm@9564
   141
fun lookup_thms thy =
wenzelm@9564
   142
  let
wenzelm@9564
   143
    val sg_ref = Sign.self_ref (Theory.sign_of thy);
wenzelm@9564
   144
    val ref {space, thms_tab, ...} = get_theorems thy;
wenzelm@9564
   145
  in
wenzelm@9564
   146
    fn name =>
wenzelm@10667
   147
      apsome (map (Thm.transfer_sg (Sign.deref sg_ref)))        (*semi-dynamic identity*)
wenzelm@9564
   148
      (Symtab.lookup (thms_tab, NameSpace.intern space name))   (*static content*)
wenzelm@9564
   149
  end;
wenzelm@3987
   150
wenzelm@9564
   151
fun get_thms_closure thy =
wenzelm@9564
   152
  let val closures = map lookup_thms (thy :: Theory.ancestors_of thy)
wenzelm@9564
   153
  in fn name => the_thms name (get_first (fn f => f name) closures) end;
wenzelm@9564
   154
wenzelm@9808
   155
fun get_thm_closure thy =
wenzelm@9808
   156
  let val get = get_thms_closure thy
wenzelm@9808
   157
  in fn name => single_thm name (get name) end;
wenzelm@9808
   158
wenzelm@9564
   159
wenzelm@9564
   160
(* get_thm etc. *)
wenzelm@9564
   161
wenzelm@9564
   162
fun get_thms theory name =
wenzelm@9564
   163
  get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory)
wenzelm@9564
   164
  |> the_thms name |> map (Thm.transfer theory);
wenzelm@4022
   165
wenzelm@6091
   166
fun get_thmss thy names = flat (map (get_thms thy) names);
wenzelm@9564
   167
fun get_thm thy name = single_thm name (get_thms thy name);
wenzelm@4783
   168
wenzelm@4022
   169
wenzelm@4022
   170
(* thms_of *)
wenzelm@4022
   171
wenzelm@6091
   172
fun attach_name thm = (Thm.name_of_thm thm, thm);
wenzelm@4022
   173
wenzelm@4022
   174
fun thms_of thy =
wenzelm@4022
   175
  let val ref {thms_tab, ...} = get_theorems thy in
wenzelm@4022
   176
    map attach_name (flat (map snd (Symtab.dest thms_tab)))
wenzelm@4022
   177
  end;
wenzelm@4022
   178
wenzelm@3987
   179
wenzelm@3987
   180
wenzelm@4022
   181
(** theorems indexed by constants **)
wenzelm@4022
   182
wenzelm@4022
   183
(* make index *)
wenzelm@4022
   184
wenzelm@6091
   185
fun add_const_idx ((next, table), thm) =
wenzelm@4022
   186
  let
wenzelm@4022
   187
    val {hyps, prop, ...} = Thm.rep_thm thm;
wenzelm@4022
   188
    val consts =
wenzelm@7805
   189
      foldr add_term_consts (hyps, add_term_consts (prop, []));
wenzelm@4022
   190
wenzelm@4022
   191
    fun add (tab, c) =
wenzelm@6091
   192
      Symtab.update ((c, (next, thm) :: Symtab.lookup_multi (tab, c)), tab);
wenzelm@4022
   193
  in (next + 1, foldl add (table, consts)) end;
wenzelm@4022
   194
wenzelm@4022
   195
fun make_const_idx thm_tab =
wenzelm@5686
   196
  Symtab.foldl (fn (x, (_, ths)) => foldl add_const_idx (x, ths)) ((0, Symtab.empty), thm_tab);
wenzelm@4022
   197
wenzelm@4022
   198
wenzelm@4022
   199
(* lookup index *)
wenzelm@3987
   200
wenzelm@4022
   201
(*search locally*)
wenzelm@4022
   202
fun containing [] thy = thms_of thy
wenzelm@4022
   203
  | containing consts thy =
wenzelm@4022
   204
      let
wenzelm@4037
   205
        fun int ([], _) = []
wenzelm@4037
   206
          | int (_, []) = []
wenzelm@4037
   207
          | int (xxs as ((x as (i:int, _)) :: xs), yys as ((y as (j, _)) :: ys)) =
wenzelm@4037
   208
              if i = j then x :: int (xs, ys)
wenzelm@4037
   209
              else if i > j then int (xs, yys)
wenzelm@4037
   210
              else int (xxs, ys);
wenzelm@4022
   211
wenzelm@4037
   212
        fun ints [xs] = xs
wenzelm@4037
   213
          | ints xss = if exists null xss then [] else foldl int (hd xss, tl xss);
wenzelm@4022
   214
wenzelm@4022
   215
        val ref {const_idx = (_, ctab), ...} = get_theorems thy;
wenzelm@4022
   216
        val ithmss = map (fn c => Symtab.lookup_multi (ctab, c)) consts;
wenzelm@6977
   217
      in map (attach_name o snd) (ints ithmss) end;
wenzelm@4022
   218
wenzelm@4022
   219
(*search globally*)
wenzelm@4022
   220
fun thms_containing thy consts =
wenzelm@6977
   221
  (case filter (is_none o Sign.const_type (Theory.sign_of thy)) consts of
wenzelm@7805
   222
    [] => flat (map (containing consts) (thy :: Theory.ancestors_of thy))
wenzelm@10008
   223
  | cs => raise THEORY ("thms_containing: undeclared consts " ^ commas_quote cs, [thy]))
wenzelm@10008
   224
  |> map (apsnd (Thm.transfer thy));
wenzelm@4022
   225
wenzelm@4022
   226
wenzelm@4022
   227
wenzelm@4022
   228
(** store theorems **)                    (*DESTRUCTIVE*)
wenzelm@3987
   229
wenzelm@12695
   230
(* hiding -- affects current theory node only! *)
wenzelm@12695
   231
wenzelm@12695
   232
fun hide_thms b names thy =
wenzelm@12695
   233
  let
wenzelm@12695
   234
    val r as ref {space, thms_tab, const_idx} = get_theorems thy;
wenzelm@12695
   235
    val space' = NameSpace.hide b (space, names);
wenzelm@12695
   236
  in r := {space = space', thms_tab = thms_tab, const_idx = const_idx}; thy end;
wenzelm@12695
   237
wenzelm@12695
   238
wenzelm@4853
   239
(* naming *)
wenzelm@4853
   240
berghofe@11998
   241
fun gen_names j len name =
berghofe@11998
   242
  map (fn i => name ^ "_" ^ string_of_int i) (j+1 upto j+len);
wenzelm@4853
   243
berghofe@11998
   244
fun name_multi name xs = gen_names 0 (length xs) name ~~ xs;
berghofe@12235
   245
berghofe@12872
   246
fun name_thm pre (p as (_, thm)) =
berghofe@12872
   247
  if Thm.name_of_thm thm <> "" andalso pre then thm else Thm.name_thm p;
berghofe@12872
   248
berghofe@12872
   249
fun name_thms pre name [x] = [name_thm pre (name, x)]
berghofe@12872
   250
  | name_thms pre name xs = map (name_thm pre) (name_multi name xs);
berghofe@12235
   251
berghofe@12235
   252
fun name_thmss name xs = (case filter_out (null o fst) xs of
berghofe@12872
   253
    [([x], z)] => [([name_thm true (name, x)], z)]
berghofe@12235
   254
  | _ => snd (foldl_map (fn (i, (ys, z)) => (i + length ys,
berghofe@12872
   255
  (map (name_thm true) (gen_names i (length ys) name ~~ ys), z))) (0, xs)));
wenzelm@4853
   256
wenzelm@4853
   257
berghofe@11998
   258
(* enter_thms *)
wenzelm@4853
   259
wenzelm@7470
   260
fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name);
wenzelm@7470
   261
fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name);
wenzelm@3987
   262
berghofe@11998
   263
fun enter_thms _ _ _ app_att thy ("", thms) = app_att (thy, thms)
berghofe@11998
   264
  | enter_thms sg pre_name post_name app_att thy (bname, thms) =
wenzelm@7470
   265
      let
wenzelm@7470
   266
        val name = Sign.full_name sg bname;
berghofe@11998
   267
        val (thy', thms') = app_att (thy, pre_name name thms);
berghofe@11998
   268
        val named_thms = post_name name thms';
wenzelm@3987
   269
wenzelm@7470
   270
        val r as ref {space, thms_tab, const_idx} = get_theorems_sg sg;
wenzelm@4022
   271
wenzelm@7470
   272
        val overwrite =
wenzelm@7470
   273
          (case Symtab.lookup (thms_tab, name) of
wenzelm@7470
   274
            None => false
wenzelm@7470
   275
          | Some thms' =>
wenzelm@7470
   276
              if Library.equal_lists Thm.eq_thm (thms', named_thms) then (warn_same name; false)
wenzelm@7470
   277
              else (warn_overwrite name; true));
wenzelm@4022
   278
wenzelm@7470
   279
        val space' = NameSpace.extend (space, [name]);
wenzelm@7470
   280
        val thms_tab' = Symtab.update ((name, named_thms), thms_tab);
wenzelm@7470
   281
        val const_idx' =
wenzelm@7470
   282
          if overwrite then make_const_idx thms_tab'
wenzelm@7470
   283
          else foldl add_const_idx (const_idx, named_thms);
berghofe@11998
   284
      in r := {space = space', thms_tab = thms_tab', const_idx = const_idx'};
berghofe@11998
   285
        (thy', named_thms)
berghofe@11998
   286
      end;
wenzelm@3987
   287
wenzelm@4853
   288
wenzelm@6091
   289
(* add_thms(s) *)
wenzelm@4853
   290
berghofe@12235
   291
fun add_thms_atts pre_name ((bname, thms), atts) thy =
berghofe@12872
   292
  enter_thms (Theory.sign_of thy) pre_name (name_thms false)
berghofe@11998
   293
    (Thm.applys_attributes o rpair atts) thy (bname, thms);
wenzelm@4853
   294
berghofe@12235
   295
fun gen_add_thmss pre_name args theory =
berghofe@12235
   296
  foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args);
wenzelm@5907
   297
berghofe@12235
   298
fun gen_add_thms pre_name args =
berghofe@12235
   299
  apsnd (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
berghofe@12235
   300
berghofe@12872
   301
val add_thmss = gen_add_thmss (name_thms true);
berghofe@12872
   302
val add_thms = gen_add_thms (name_thms true);
wenzelm@5907
   303
wenzelm@5907
   304
wenzelm@12711
   305
(* have_thmss(_i) *)
wenzelm@5907
   306
wenzelm@9192
   307
local
wenzelm@12711
   308
wenzelm@12711
   309
fun gen_have_thss get kind_att (thy, ((bname, more_atts), ths_atts)) =
wenzelm@12711
   310
  let
wenzelm@12711
   311
    fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts);
wenzelm@12711
   312
    val (thy', thms) = enter_thms (Theory.sign_of thy)
berghofe@12872
   313
      name_thmss (name_thms false) (apsnd flat o foldl_map app) thy
wenzelm@12711
   314
      (bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts);
wenzelm@12711
   315
  in (thy', (bname, thms)) end;
wenzelm@12711
   316
wenzelm@12711
   317
fun gen_have_thmss get kind_att args thy =
wenzelm@12711
   318
  foldl_map (gen_have_thss get kind_att) (thy, args);
wenzelm@12711
   319
wenzelm@9192
   320
in
wenzelm@12711
   321
wenzelm@12711
   322
val have_thmss = gen_have_thmss get_thms;
wenzelm@12711
   323
val have_thmss_i = gen_have_thmss (K I);
wenzelm@12711
   324
wenzelm@9192
   325
end;
wenzelm@5280
   326
wenzelm@5280
   327
wenzelm@6091
   328
(* store_thm *)
wenzelm@5280
   329
berghofe@11998
   330
fun store_thm ((bname, thm), atts) thy =
berghofe@12872
   331
  let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy
wenzelm@5280
   332
  in (thy', th') end;
wenzelm@3987
   333
wenzelm@3987
   334
wenzelm@7405
   335
(* smart_store_thms *)
wenzelm@3987
   336
berghofe@12235
   337
fun gen_smart_store_thms _ (name, []) =
berghofe@11516
   338
      error ("Cannot store empty list of theorems: " ^ quote name)
berghofe@12235
   339
  | gen_smart_store_thms name_thm (name, [thm]) =
berghofe@12872
   340
      snd (enter_thms (Thm.sign_of_thm thm) (name_thm true) (name_thm false)
berghofe@12872
   341
        I () (name, [thm]))
berghofe@12235
   342
  | gen_smart_store_thms name_thm (name, thms) =
wenzelm@7405
   343
      let
wenzelm@7405
   344
        val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm);
wenzelm@7405
   345
        val sg_ref = foldl merge_sg (Sign.self_ref (Thm.sign_of_thm (hd thms)), tl thms);
berghofe@12872
   346
      in snd (enter_thms (Sign.deref sg_ref) (name_thm true) (name_thm false)
berghofe@12872
   347
        I () (name, thms))
berghofe@12872
   348
      end;
berghofe@11516
   349
berghofe@12235
   350
val smart_store_thms = gen_smart_store_thms name_thms;
berghofe@12872
   351
val smart_store_thms_open = gen_smart_store_thms (K (K I));
wenzelm@3987
   352
wenzelm@3987
   353
wenzelm@7899
   354
(* forall_elim_vars (belongs to drule.ML) *)
wenzelm@7899
   355
wenzelm@7899
   356
(*Replace outermost quantified variable by Var of given index.
wenzelm@7899
   357
    Could clash with Vars already present.*)
wenzelm@7899
   358
fun forall_elim_var i th =
wenzelm@7899
   359
    let val {prop,sign,...} = rep_thm th
wenzelm@7899
   360
    in case prop of
wenzelm@7899
   361
          Const("all",_) $ Abs(a,T,_) =>
wenzelm@7899
   362
              forall_elim (cterm_of sign (Var((a,i), T)))  th
wenzelm@7899
   363
        | _ => raise THM("forall_elim_var", i, [th])
wenzelm@7899
   364
    end;
wenzelm@7899
   365
wenzelm@7899
   366
(*Repeat forall_elim_var until all outer quantifiers are removed*)
wenzelm@7899
   367
fun forall_elim_vars i th =
wenzelm@7899
   368
    forall_elim_vars i (forall_elim_var i th)
wenzelm@7899
   369
        handle THM _ => th;
wenzelm@7899
   370
wenzelm@7899
   371
wenzelm@4022
   372
(* store axioms as theorems *)
wenzelm@4022
   373
wenzelm@4853
   374
local
wenzelm@7899
   375
  fun get_axs thy named_axs =
wenzelm@7899
   376
    map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs;
wenzelm@7753
   377
wenzelm@8419
   378
  fun add_single add (thy, ((name, ax), atts)) =
wenzelm@4853
   379
    let
berghofe@11998
   380
      val named_ax = [(name, ax)];
wenzelm@7753
   381
      val thy' = add named_ax thy;
wenzelm@7753
   382
      val thm = hd (get_axs thy' named_ax);
berghofe@12235
   383
    in apsnd hd (gen_add_thms (K I) [((name, thm), atts)] thy') end;
wenzelm@7753
   384
wenzelm@8419
   385
  fun add_multi add (thy, ((name, axs), atts)) =
wenzelm@7753
   386
    let
wenzelm@7753
   387
      val named_axs = name_multi name axs;
wenzelm@4853
   388
      val thy' = add named_axs thy;
wenzelm@7753
   389
      val thms = get_axs thy' named_axs;
berghofe@12235
   390
    in apsnd hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end;
wenzelm@4022
   391
wenzelm@8419
   392
  fun add_singles add args thy = foldl_map (add_single add) (thy, args);
wenzelm@8419
   393
  fun add_multis add args thy = foldl_map (add_multi add) (thy, args);
wenzelm@4853
   394
in
wenzelm@7753
   395
  val add_axioms    = add_singles Theory.add_axioms;
wenzelm@7753
   396
  val add_axioms_i  = add_singles Theory.add_axioms_i;
wenzelm@7753
   397
  val add_axiomss   = add_multis Theory.add_axioms;
wenzelm@7753
   398
  val add_axiomss_i = add_multis Theory.add_axioms_i;
wenzelm@9318
   399
  val add_defs      = add_singles o Theory.add_defs;
wenzelm@9318
   400
  val add_defs_i    = add_singles o Theory.add_defs_i;
wenzelm@9318
   401
  val add_defss     = add_multis o Theory.add_defs;
wenzelm@9318
   402
  val add_defss_i   = add_multis o Theory.add_defs_i;
wenzelm@4853
   403
end;
wenzelm@4022
   404
wenzelm@4022
   405
wenzelm@3987
   406
wenzelm@4963
   407
(*** derived theory operations ***)
wenzelm@4963
   408
wenzelm@4963
   409
(** theory management **)
wenzelm@4963
   410
wenzelm@5005
   411
(* data kind 'Pure/theory_management' *)
wenzelm@4963
   412
wenzelm@5005
   413
structure TheoryManagementDataArgs =
wenzelm@5005
   414
struct
wenzelm@5005
   415
  val name = "Pure/theory_management";
wenzelm@6660
   416
  type T = {name: string, version: int};
wenzelm@5000
   417
wenzelm@6660
   418
  val empty = {name = "", version = 0};
wenzelm@6547
   419
  val copy = I;
wenzelm@5005
   420
  val prep_ext  = I;
wenzelm@5000
   421
  fun merge _ = empty;
wenzelm@5005
   422
  fun print _ _ = ();
wenzelm@4963
   423
end;
wenzelm@4963
   424
wenzelm@5005
   425
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs);
wenzelm@5005
   426
val get_info = TheoryManagementData.get;
wenzelm@5005
   427
val put_info = TheoryManagementData.put;
wenzelm@5005
   428
wenzelm@4963
   429
wenzelm@4963
   430
(* get / put name *)
wenzelm@4963
   431
wenzelm@5000
   432
val get_name = #name o get_info;
wenzelm@6660
   433
fun put_name name = put_info {name = name, version = 0};
wenzelm@4963
   434
wenzelm@4963
   435
wenzelm@4963
   436
(* control prefixing of theory name *)
wenzelm@4963
   437
wenzelm@5210
   438
val global_path = Theory.root_path;
wenzelm@4963
   439
wenzelm@4963
   440
fun local_path thy =
wenzelm@5210
   441
  thy |> Theory.root_path |> Theory.add_path (get_name thy);
wenzelm@4963
   442
wenzelm@4963
   443
wenzelm@4963
   444
(* begin / end theory *)
wenzelm@4963
   445
wenzelm@4963
   446
fun begin_theory name thys =
wenzelm@4963
   447
  Theory.prep_ext_merge thys
wenzelm@4963
   448
  |> put_name name
wenzelm@4963
   449
  |> local_path;
wenzelm@4963
   450
wenzelm@12123
   451
fun end_theory thy =
wenzelm@12123
   452
  thy
wenzelm@12123
   453
  |> Theory.add_name (get_name thy);
wenzelm@4963
   454
wenzelm@6682
   455
fun checkpoint thy =
wenzelm@6682
   456
  if is_draft thy then
wenzelm@6682
   457
    let val {name, version} = get_info thy in
wenzelm@6682
   458
      thy
wenzelm@6682
   459
      |> Theory.add_name (name ^ ":" ^ string_of_int version)
wenzelm@6682
   460
      |> put_info {name = name, version = version + 1}
wenzelm@6682
   461
    end
wenzelm@6682
   462
  else thy;
wenzelm@5000
   463
wenzelm@5000
   464
wenzelm@4963
   465
wenzelm@4963
   466
(** add logical types **)
wenzelm@4922
   467
wenzelm@4922
   468
fun add_typedecls decls thy =
wenzelm@4922
   469
  let
wenzelm@4922
   470
    val full = Sign.full_name (Theory.sign_of thy);
wenzelm@4922
   471
wenzelm@4922
   472
    fun type_of (raw_name, vs, mx) =
wenzelm@4922
   473
      if null (duplicates vs) then (raw_name, length vs, mx)
wenzelm@4922
   474
      else error ("Duplicate parameters in type declaration: " ^ quote raw_name);
wenzelm@4922
   475
wenzelm@4922
   476
    fun arity_of (raw_name, len, mx) =
wenzelm@4922
   477
      (full (Syntax.type_name raw_name mx), replicate len logicS, logicS);
wenzelm@4922
   478
wenzelm@4922
   479
    val types = map type_of decls;
wenzelm@4922
   480
    val arities = map arity_of types;
wenzelm@4922
   481
  in
wenzelm@4922
   482
    thy
wenzelm@4922
   483
    |> Theory.add_types types
wenzelm@4922
   484
    |> Theory.add_arities_i arities
wenzelm@4922
   485
  end;
wenzelm@4922
   486
wenzelm@4922
   487
wenzelm@4922
   488
wenzelm@5091
   489
(*** the ProtoPure theory ***)
wenzelm@3987
   490
wenzelm@3987
   491
val proto_pure =
wenzelm@3987
   492
  Theory.pre_pure
berghofe@11516
   493
  |> Library.apply [TheoremsData.init, TheoryManagementData.init, Proofterm.init]
wenzelm@4963
   494
  |> put_name "ProtoPure"
wenzelm@4963
   495
  |> global_path
wenzelm@3987
   496
  |> Theory.add_types
wenzelm@4922
   497
   [("fun", 2, NoSyn),
wenzelm@4922
   498
    ("prop", 0, NoSyn),
wenzelm@4922
   499
    ("itself", 1, NoSyn),
wenzelm@4922
   500
    ("dummy", 0, NoSyn)]
wenzelm@3987
   501
  |> Theory.add_classes_i [(logicC, [])]
wenzelm@3987
   502
  |> Theory.add_defsort_i logicS
wenzelm@3987
   503
  |> Theory.add_arities_i
wenzelm@3987
   504
   [("fun", [logicS, logicS], logicS),
wenzelm@3987
   505
    ("prop", [], logicS),
wenzelm@3987
   506
    ("itself", [logicS], logicS)]
wenzelm@4922
   507
  |> Theory.add_nonterminals Syntax.pure_nonterms
wenzelm@3987
   508
  |> Theory.add_syntax Syntax.pure_syntax
wenzelm@6692
   509
  |> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax
wenzelm@3987
   510
  |> Theory.add_syntax
wenzelm@7949
   511
   [("==>", "[prop, prop] => prop", Delimfix "op ==>"),
wenzelm@9534
   512
    (Term.dummy_patternN, "aprop", Delimfix "'_")]
wenzelm@3987
   513
  |> Theory.add_consts
wenzelm@3987
   514
   [("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)),
wenzelm@3987
   515
    ("=?=", "['a::{}, 'a] => prop", InfixrName ("=?=", 2)),
wenzelm@3987
   516
    ("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@3987
   517
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@10667
   518
    ("Goal", "prop => prop", NoSyn),
wenzelm@6547
   519
    ("TYPE", "'a itself", NoSyn),
wenzelm@9534
   520
    (Term.dummy_patternN, "'a", Delimfix "'_")]
nipkow@5041
   521
  |> Theory.add_modesyntax ("", false)
wenzelm@12138
   522
    (Syntax.pure_syntax_output @ Syntax.pure_appl_syntax)
wenzelm@12250
   523
  |> Theory.add_trfuns Syntax.pure_trfuns
wenzelm@12250
   524
  |> Theory.add_trfunsT Syntax.pure_trfunsT
wenzelm@4963
   525
  |> local_path
wenzelm@9318
   526
  |> (#1 oo (add_defs false o map Thm.no_attributes))
wenzelm@10667
   527
   [("flexpair_def", "(t =?= u) == (t == u::'a::{})")]
wenzelm@10667
   528
  |> (#1 oo (add_defs_i false o map Thm.no_attributes))
wenzelm@10667
   529
   [("Goal_def", let val A = Free ("A", propT) in Logic.mk_equals (Logic.mk_goal A, A) end)]
wenzelm@9238
   530
  |> (#1 o add_thmss [(("nothing", []), [])])
berghofe@11516
   531
  |> Theory.add_axioms_i Proofterm.equality_axms
wenzelm@4963
   532
  |> end_theory;
wenzelm@3987
   533
wenzelm@5091
   534
structure ProtoPure =
wenzelm@5091
   535
struct
wenzelm@5091
   536
  val thy = proto_pure;
wenzelm@5091
   537
  val flexpair_def = get_axiom thy "flexpair_def";
wenzelm@5091
   538
  val Goal_def = get_axiom thy "Goal_def";
wenzelm@5091
   539
end;
wenzelm@3987
   540
wenzelm@3987
   541
wenzelm@3987
   542
end;
wenzelm@3987
   543
wenzelm@3987
   544
wenzelm@4022
   545
structure BasicPureThy: BASIC_PURE_THY = PureThy;
wenzelm@4022
   546
open BasicPureThy;