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