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