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