src/Pure/pure_thy.ML
author wenzelm
Thu Jun 29 22:29:46 2000 +0200 (2000-06-29)
changeset 9192 df32cd0881b9
parent 9007 135c998d2b46
child 9215 50de4abb987c
permissions -rw-r--r--
have_thmss: handle multiple lists of arguments;
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 flexpair_def: thm
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@6367
    27
  val cond_extern_thm_sg: Sign.sg -> string -> xstring
wenzelm@4022
    28
  val thms_containing: theory -> string list -> (string * thm) list
wenzelm@6091
    29
  val store_thm: (bstring * thm) * theory attribute list -> theory -> theory * thm
wenzelm@7405
    30
  val smart_store_thms: (bstring * thm list) -> thm list
wenzelm@7899
    31
  val forall_elim_var: int -> thm -> thm
wenzelm@7899
    32
  val forall_elim_vars: int -> thm -> thm
wenzelm@8419
    33
  val add_thms: ((bstring * thm) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    34
  val add_thmss: ((bstring * thm list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@9192
    35
  val have_thmss: theory attribute list -> ((bstring * theory attribute list) *
wenzelm@9192
    36
    (thm list * theory attribute list) list) list -> theory -> theory * (string * thm list) list
wenzelm@8419
    37
  val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    38
  val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    39
  val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@8419
    40
  val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@8419
    41
  val add_defs: ((bstring * string) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    42
  val add_defs_i: ((bstring * term) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    43
  val add_defss: ((bstring * string list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@8419
    44
  val add_defss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@4963
    45
  val get_name: theory -> string
wenzelm@4963
    46
  val put_name: string -> theory -> theory
wenzelm@4963
    47
  val global_path: theory -> theory
wenzelm@4963
    48
  val local_path: theory -> theory
wenzelm@4963
    49
  val begin_theory: string -> theory list -> theory
wenzelm@4963
    50
  val end_theory: theory -> theory
wenzelm@6682
    51
  val checkpoint: theory -> theory
wenzelm@4922
    52
  val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
wenzelm@6560
    53
  val dummy_patternN: string
wenzelm@3987
    54
end;
wenzelm@3987
    55
wenzelm@3987
    56
structure PureThy: PURE_THY =
wenzelm@3987
    57
struct
wenzelm@3987
    58
wenzelm@3987
    59
wenzelm@4922
    60
(*** theorem database ***)
wenzelm@3987
    61
wenzelm@4922
    62
(** data kind 'Pure/theorems' **)
wenzelm@3987
    63
wenzelm@5005
    64
structure TheoremsDataArgs =
wenzelm@5005
    65
struct
wenzelm@5005
    66
  val name = "Pure/theorems";
wenzelm@3987
    67
wenzelm@5005
    68
  type T =
wenzelm@5005
    69
    {space: NameSpace.T,
wenzelm@6091
    70
      thms_tab: thm list Symtab.table,
wenzelm@6091
    71
      const_idx: int * (int * thm) list Symtab.table} ref;
wenzelm@3987
    72
wenzelm@4853
    73
  fun mk_empty _ =
wenzelm@5005
    74
    ref {space = NameSpace.empty, thms_tab = Symtab.empty, const_idx = (0, Symtab.empty)} : T;
wenzelm@3987
    75
wenzelm@5005
    76
  val empty = mk_empty ();
wenzelm@6547
    77
  fun copy (ref x) = ref x;
wenzelm@5005
    78
  val prep_ext = mk_empty;
wenzelm@5005
    79
  val merge = mk_empty;
wenzelm@5005
    80
wenzelm@8720
    81
  fun pretty sg (ref {space, thms_tab, const_idx = _}) =
wenzelm@4853
    82
    let
wenzelm@6091
    83
      val prt_thm = Display.pretty_thm o Thm.transfer_sg sg;
wenzelm@4853
    84
      fun prt_thms (name, [th]) =
wenzelm@4853
    85
            Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th]
wenzelm@4853
    86
        | prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths);
wenzelm@3987
    87
wenzelm@6846
    88
      val thmss = NameSpace.cond_extern_table space thms_tab;
wenzelm@4853
    89
    in
wenzelm@8720
    90
      [Display.pretty_name_space ("theorem name space", space),
wenzelm@8720
    91
        Pretty.big_list "theorems:" (map prt_thms thmss)]
wenzelm@4853
    92
    end;
wenzelm@8720
    93
wenzelm@8720
    94
  fun print sg data = Pretty.writeln (Pretty.chunks (pretty sg data));
wenzelm@3987
    95
end;
wenzelm@3987
    96
wenzelm@5005
    97
structure TheoremsData = TheoryDataFun(TheoremsDataArgs);
wenzelm@5005
    98
val get_theorems_sg = TheoremsData.get_sg;
wenzelm@5005
    99
val get_theorems = TheoremsData.get;
wenzelm@5005
   100
wenzelm@6367
   101
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg;
wenzelm@6367
   102
wenzelm@3987
   103
wenzelm@5000
   104
(* print theory *)
wenzelm@3987
   105
wenzelm@5005
   106
val print_theorems = TheoremsData.print;
wenzelm@8720
   107
wenzelm@5000
   108
fun print_theory thy =
wenzelm@8720
   109
  Display.pretty_full_theory thy @ TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)
wenzelm@8720
   110
  |> Pretty.chunks |> Pretty.writeln;
wenzelm@4022
   111
wenzelm@3987
   112
wenzelm@3987
   113
wenzelm@4022
   114
(** retrieve theorems **)
wenzelm@3987
   115
wenzelm@4783
   116
(* get_thms etc. *)
wenzelm@4037
   117
wenzelm@7485
   118
fun lookup_thms name thy =
wenzelm@7485
   119
  let val ref {space, thms_tab, ...} = get_theorems thy
wenzelm@7485
   120
  in Symtab.lookup (thms_tab, NameSpace.intern space name) end;
wenzelm@4922
   121
wenzelm@6091
   122
fun get_thms thy name =
wenzelm@4922
   123
  (case get_first (lookup_thms name) (thy :: Theory.ancestors_of thy) of
wenzelm@4590
   124
    None => raise THEORY ("Unknown theorem(s) " ^ quote name, [thy])
wenzelm@9007
   125
  | Some thms => map (Thm.transfer thy) thms);
wenzelm@3987
   126
wenzelm@6091
   127
fun get_thm thy name =
wenzelm@6091
   128
  (case get_thms thy name of
wenzelm@3987
   129
    [thm] => thm
wenzelm@4590
   130
  | _ => raise THEORY ("Single theorem expected " ^ quote name, [thy]));
wenzelm@4022
   131
wenzelm@6091
   132
fun get_thmss thy names = flat (map (get_thms thy) names);
wenzelm@4783
   133
wenzelm@4022
   134
wenzelm@4022
   135
(* thms_of *)
wenzelm@4022
   136
wenzelm@6091
   137
fun attach_name thm = (Thm.name_of_thm thm, thm);
wenzelm@4022
   138
wenzelm@4022
   139
fun thms_of thy =
wenzelm@4022
   140
  let val ref {thms_tab, ...} = get_theorems thy in
wenzelm@4022
   141
    map attach_name (flat (map snd (Symtab.dest thms_tab)))
wenzelm@4022
   142
  end;
wenzelm@4022
   143
wenzelm@3987
   144
wenzelm@3987
   145
wenzelm@4022
   146
(** theorems indexed by constants **)
wenzelm@4022
   147
wenzelm@4022
   148
(* make index *)
wenzelm@4022
   149
wenzelm@6091
   150
fun add_const_idx ((next, table), thm) =
wenzelm@4022
   151
  let
wenzelm@4022
   152
    val {hyps, prop, ...} = Thm.rep_thm thm;
wenzelm@4022
   153
    val consts =
wenzelm@7805
   154
      foldr add_term_consts (hyps, add_term_consts (prop, []));
wenzelm@4022
   155
wenzelm@4022
   156
    fun add (tab, c) =
wenzelm@6091
   157
      Symtab.update ((c, (next, thm) :: Symtab.lookup_multi (tab, c)), tab);
wenzelm@4022
   158
  in (next + 1, foldl add (table, consts)) end;
wenzelm@4022
   159
wenzelm@4022
   160
fun make_const_idx thm_tab =
wenzelm@5686
   161
  Symtab.foldl (fn (x, (_, ths)) => foldl add_const_idx (x, ths)) ((0, Symtab.empty), thm_tab);
wenzelm@4022
   162
wenzelm@4022
   163
wenzelm@4022
   164
(* lookup index *)
wenzelm@3987
   165
wenzelm@4022
   166
(*search locally*)
wenzelm@4022
   167
fun containing [] thy = thms_of thy
wenzelm@4022
   168
  | containing consts thy =
wenzelm@4022
   169
      let
wenzelm@4037
   170
        fun int ([], _) = []
wenzelm@4037
   171
          | int (_, []) = []
wenzelm@4037
   172
          | int (xxs as ((x as (i:int, _)) :: xs), yys as ((y as (j, _)) :: ys)) =
wenzelm@4037
   173
              if i = j then x :: int (xs, ys)
wenzelm@4037
   174
              else if i > j then int (xs, yys)
wenzelm@4037
   175
              else int (xxs, ys);
wenzelm@4022
   176
wenzelm@4037
   177
        fun ints [xs] = xs
wenzelm@4037
   178
          | ints xss = if exists null xss then [] else foldl int (hd xss, tl xss);
wenzelm@4022
   179
wenzelm@4022
   180
        val ref {const_idx = (_, ctab), ...} = get_theorems thy;
wenzelm@4022
   181
        val ithmss = map (fn c => Symtab.lookup_multi (ctab, c)) consts;
wenzelm@6977
   182
      in map (attach_name o snd) (ints ithmss) end;
wenzelm@4022
   183
wenzelm@4022
   184
(*search globally*)
wenzelm@4022
   185
fun thms_containing thy consts =
wenzelm@6977
   186
  (case filter (is_none o Sign.const_type (Theory.sign_of thy)) consts of
wenzelm@7805
   187
    [] => flat (map (containing consts) (thy :: Theory.ancestors_of thy))
wenzelm@6977
   188
  | cs => raise THEORY ("thms_containing: undeclared consts " ^ commas_quote cs, [thy]));
wenzelm@4022
   189
wenzelm@4022
   190
wenzelm@4022
   191
wenzelm@4022
   192
(** store theorems **)                    (*DESTRUCTIVE*)
wenzelm@3987
   193
wenzelm@4853
   194
(* naming *)
wenzelm@4853
   195
wenzelm@4853
   196
fun gen_names len name =
wenzelm@4853
   197
  map (fn i => name ^ "_" ^ string_of_int i) (1 upto len);
wenzelm@4853
   198
wenzelm@7470
   199
fun name_single name x = [(name, x)];
wenzelm@7470
   200
fun name_multi name xs = gen_names (length xs) name ~~ xs;
wenzelm@4853
   201
wenzelm@4853
   202
wenzelm@6091
   203
(* enter_thmx *)
wenzelm@4853
   204
wenzelm@7470
   205
fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name);
wenzelm@7470
   206
fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name);
wenzelm@3987
   207
wenzelm@7470
   208
fun enter_thmx _ app_name ("", thmx) = map #2 (app_name "" thmx)
wenzelm@7470
   209
  | enter_thmx sg app_name (bname, thmx) =
wenzelm@7470
   210
      let
wenzelm@7470
   211
        val name = Sign.full_name sg bname;
wenzelm@7470
   212
        val named_thms = map Thm.name_thm (app_name name thmx);
wenzelm@3987
   213
wenzelm@7470
   214
        val r as ref {space, thms_tab, const_idx} = get_theorems_sg sg;
wenzelm@4022
   215
wenzelm@7470
   216
        val overwrite =
wenzelm@7470
   217
          (case Symtab.lookup (thms_tab, name) of
wenzelm@7470
   218
            None => false
wenzelm@7470
   219
          | Some thms' =>
wenzelm@7470
   220
              if Library.equal_lists Thm.eq_thm (thms', named_thms) then (warn_same name; false)
wenzelm@7470
   221
              else (warn_overwrite name; true));
wenzelm@4022
   222
wenzelm@7470
   223
        val space' = NameSpace.extend (space, [name]);
wenzelm@7470
   224
        val thms_tab' = Symtab.update ((name, named_thms), thms_tab);
wenzelm@7470
   225
        val const_idx' =
wenzelm@7470
   226
          if overwrite then make_const_idx thms_tab'
wenzelm@7470
   227
          else foldl add_const_idx (const_idx, named_thms);
wenzelm@7470
   228
      in r := {space = space', thms_tab = thms_tab', const_idx = const_idx'}; named_thms end;
wenzelm@3987
   229
wenzelm@4853
   230
wenzelm@6091
   231
(* add_thms(s) *)
wenzelm@4853
   232
wenzelm@6091
   233
fun add_thmx app_name app_att ((bname, thmx), atts) thy =
wenzelm@5280
   234
  let
wenzelm@6091
   235
    val (thy', thmx') = app_att ((thy, thmx), atts);
wenzelm@6091
   236
    val thms'' = enter_thmx (Theory.sign_of thy') app_name (bname, thmx');
wenzelm@6091
   237
  in (thy', thms'') end;
wenzelm@4853
   238
wenzelm@8419
   239
fun add_thms args theory =
wenzelm@8419
   240
  (theory, args)
wenzelm@8419
   241
  |> foldl_map (fn (thy, arg) => add_thmx name_single Thm.apply_attributes arg thy)
wenzelm@8419
   242
  |> apsnd (map hd);
wenzelm@5907
   243
wenzelm@8419
   244
fun add_thmss args theory =
wenzelm@8419
   245
  (theory, args)
wenzelm@8419
   246
  |> foldl_map (fn (thy, arg) => add_thmx name_multi Thm.applys_attributes arg thy);
wenzelm@5907
   247
wenzelm@5907
   248
wenzelm@6091
   249
(* have_thmss *)
wenzelm@5907
   250
wenzelm@9192
   251
local
wenzelm@9192
   252
  fun have_thss kind_atts (thy, ((bname, more_atts), ths_atts)) =
wenzelm@9192
   253
    let
wenzelm@9192
   254
      fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts);
wenzelm@9192
   255
      val (thy', thmss') =
wenzelm@9192
   256
        foldl_map app (thy, map (fn (ths, atts) => (ths, atts @ more_atts @ kind_atts)) ths_atts);
wenzelm@9192
   257
      val thms' = flat thmss';
wenzelm@9192
   258
      val thms'' = enter_thmx (Theory.sign_of thy') name_multi (bname, thms');
wenzelm@9192
   259
    in (thy', (bname, thms'')) end;
wenzelm@9192
   260
in
wenzelm@9192
   261
  fun have_thmss kind_atts args thy = foldl_map (have_thss kind_atts) (thy, args);
wenzelm@9192
   262
end;
wenzelm@5280
   263
wenzelm@5280
   264
wenzelm@6091
   265
(* store_thm *)
wenzelm@5280
   266
wenzelm@6091
   267
fun store_thm th_atts thy =
wenzelm@6091
   268
  let val (thy', [th']) = add_thmx name_single Thm.apply_attributes th_atts thy
wenzelm@5280
   269
  in (thy', th') end;
wenzelm@3987
   270
wenzelm@3987
   271
wenzelm@7405
   272
(* smart_store_thms *)
wenzelm@3987
   273
wenzelm@7405
   274
fun smart_store_thms (name, []) = error ("Cannot store empty list of theorems: " ^ quote name)
wenzelm@7405
   275
  | smart_store_thms (name, [thm]) = enter_thmx (Thm.sign_of_thm thm) name_single (name, thm)
wenzelm@7405
   276
  | smart_store_thms (name, thms) =
wenzelm@7405
   277
      let
wenzelm@7405
   278
        val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm);
wenzelm@7405
   279
        val sg_ref = foldl merge_sg (Sign.self_ref (Thm.sign_of_thm (hd thms)), tl thms);
wenzelm@7405
   280
      in enter_thmx (Sign.deref sg_ref) name_multi (name, thms) end;
wenzelm@3987
   281
wenzelm@3987
   282
wenzelm@7899
   283
(* forall_elim_vars (belongs to drule.ML) *)
wenzelm@7899
   284
wenzelm@7899
   285
(*Replace outermost quantified variable by Var of given index.
wenzelm@7899
   286
    Could clash with Vars already present.*)
wenzelm@7899
   287
fun forall_elim_var i th =
wenzelm@7899
   288
    let val {prop,sign,...} = rep_thm th
wenzelm@7899
   289
    in case prop of
wenzelm@7899
   290
          Const("all",_) $ Abs(a,T,_) =>
wenzelm@7899
   291
              forall_elim (cterm_of sign (Var((a,i), T)))  th
wenzelm@7899
   292
        | _ => raise THM("forall_elim_var", i, [th])
wenzelm@7899
   293
    end;
wenzelm@7899
   294
wenzelm@7899
   295
(*Repeat forall_elim_var until all outer quantifiers are removed*)
wenzelm@7899
   296
fun forall_elim_vars i th =
wenzelm@7899
   297
    forall_elim_vars i (forall_elim_var i th)
wenzelm@7899
   298
        handle THM _ => th;
wenzelm@7899
   299
wenzelm@7899
   300
wenzelm@4022
   301
(* store axioms as theorems *)
wenzelm@4022
   302
wenzelm@4853
   303
local
wenzelm@7899
   304
  fun get_axs thy named_axs =
wenzelm@7899
   305
    map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs;
wenzelm@7753
   306
wenzelm@8419
   307
  fun add_single add (thy, ((name, ax), atts)) =
wenzelm@4853
   308
    let
wenzelm@7753
   309
      val named_ax = name_single name ax;
wenzelm@7753
   310
      val thy' = add named_ax thy;
wenzelm@7753
   311
      val thm = hd (get_axs thy' named_ax);
wenzelm@8419
   312
    in apsnd hd (add_thms [((name, thm), atts)] thy') end;
wenzelm@7753
   313
wenzelm@8419
   314
  fun add_multi add (thy, ((name, axs), atts)) =
wenzelm@7753
   315
    let
wenzelm@7753
   316
      val named_axs = name_multi name axs;
wenzelm@4853
   317
      val thy' = add named_axs thy;
wenzelm@7753
   318
      val thms = get_axs thy' named_axs;
wenzelm@8419
   319
    in apsnd hd (add_thmss [((name, thms), atts)] thy') end;
wenzelm@4022
   320
wenzelm@8419
   321
  fun add_singles add args thy = foldl_map (add_single add) (thy, args);
wenzelm@8419
   322
  fun add_multis add args thy = foldl_map (add_multi add) (thy, args);
wenzelm@4853
   323
in
wenzelm@7753
   324
  val add_axioms    = add_singles Theory.add_axioms;
wenzelm@7753
   325
  val add_axioms_i  = add_singles Theory.add_axioms_i;
wenzelm@7753
   326
  val add_axiomss   = add_multis Theory.add_axioms;
wenzelm@7753
   327
  val add_axiomss_i = add_multis Theory.add_axioms_i;
wenzelm@7753
   328
  val add_defs      = add_singles Theory.add_defs;
wenzelm@7753
   329
  val add_defs_i    = add_singles Theory.add_defs_i;
wenzelm@7753
   330
  val add_defss     = add_multis Theory.add_defs;
wenzelm@7753
   331
  val add_defss_i   = add_multis Theory.add_defs_i;
wenzelm@4853
   332
end;
wenzelm@4022
   333
wenzelm@4022
   334
wenzelm@3987
   335
wenzelm@4963
   336
(*** derived theory operations ***)
wenzelm@4963
   337
wenzelm@4963
   338
(** theory management **)
wenzelm@4963
   339
wenzelm@5005
   340
(* data kind 'Pure/theory_management' *)
wenzelm@4963
   341
wenzelm@5005
   342
structure TheoryManagementDataArgs =
wenzelm@5005
   343
struct
wenzelm@5005
   344
  val name = "Pure/theory_management";
wenzelm@6660
   345
  type T = {name: string, version: int};
wenzelm@5000
   346
wenzelm@6660
   347
  val empty = {name = "", version = 0};
wenzelm@6547
   348
  val copy = I;
wenzelm@5005
   349
  val prep_ext  = I;
wenzelm@5000
   350
  fun merge _ = empty;
wenzelm@5005
   351
  fun print _ _ = ();
wenzelm@4963
   352
end;
wenzelm@4963
   353
wenzelm@5005
   354
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs);
wenzelm@5005
   355
val get_info = TheoryManagementData.get;
wenzelm@5005
   356
val put_info = TheoryManagementData.put;
wenzelm@5005
   357
wenzelm@4963
   358
wenzelm@4963
   359
(* get / put name *)
wenzelm@4963
   360
wenzelm@5000
   361
val get_name = #name o get_info;
wenzelm@6660
   362
fun put_name name = put_info {name = name, version = 0};
wenzelm@4963
   363
wenzelm@4963
   364
wenzelm@4963
   365
(* control prefixing of theory name *)
wenzelm@4963
   366
wenzelm@5210
   367
val global_path = Theory.root_path;
wenzelm@4963
   368
wenzelm@4963
   369
fun local_path thy =
wenzelm@5210
   370
  thy |> Theory.root_path |> Theory.add_path (get_name thy);
wenzelm@4963
   371
wenzelm@4963
   372
wenzelm@4963
   373
(* begin / end theory *)
wenzelm@4963
   374
wenzelm@4963
   375
fun begin_theory name thys =
wenzelm@4963
   376
  Theory.prep_ext_merge thys
wenzelm@4963
   377
  |> put_name name
wenzelm@4963
   378
  |> local_path;
wenzelm@4963
   379
wenzelm@4963
   380
fun end_theory thy = Theory.add_name (get_name thy) thy;
wenzelm@4963
   381
wenzelm@6682
   382
fun checkpoint thy =
wenzelm@6682
   383
  if is_draft thy then
wenzelm@6682
   384
    let val {name, version} = get_info thy in
wenzelm@6682
   385
      thy
wenzelm@6682
   386
      |> Theory.add_name (name ^ ":" ^ string_of_int version)
wenzelm@6682
   387
      |> put_info {name = name, version = version + 1}
wenzelm@6682
   388
    end
wenzelm@6682
   389
  else thy;
wenzelm@5000
   390
wenzelm@5000
   391
wenzelm@4963
   392
wenzelm@4963
   393
(** add logical types **)
wenzelm@4922
   394
wenzelm@4922
   395
fun add_typedecls decls thy =
wenzelm@4922
   396
  let
wenzelm@4922
   397
    val full = Sign.full_name (Theory.sign_of thy);
wenzelm@4922
   398
wenzelm@4922
   399
    fun type_of (raw_name, vs, mx) =
wenzelm@4922
   400
      if null (duplicates vs) then (raw_name, length vs, mx)
wenzelm@4922
   401
      else error ("Duplicate parameters in type declaration: " ^ quote raw_name);
wenzelm@4922
   402
wenzelm@4922
   403
    fun arity_of (raw_name, len, mx) =
wenzelm@4922
   404
      (full (Syntax.type_name raw_name mx), replicate len logicS, logicS);
wenzelm@4922
   405
wenzelm@4922
   406
    val types = map type_of decls;
wenzelm@4922
   407
    val arities = map arity_of types;
wenzelm@4922
   408
  in
wenzelm@4922
   409
    thy
wenzelm@4922
   410
    |> Theory.add_types types
wenzelm@4922
   411
    |> Theory.add_arities_i arities
wenzelm@4922
   412
  end;
wenzelm@4922
   413
wenzelm@4922
   414
wenzelm@4922
   415
wenzelm@5091
   416
(*** the ProtoPure theory ***)
wenzelm@3987
   417
wenzelm@6560
   418
val dummy_patternN = "dummy_pattern";
wenzelm@6560
   419
wenzelm@3987
   420
val proto_pure =
wenzelm@3987
   421
  Theory.pre_pure
wenzelm@5907
   422
  |> Library.apply [TheoremsData.init, TheoryManagementData.init]
wenzelm@4963
   423
  |> put_name "ProtoPure"
wenzelm@4963
   424
  |> global_path
wenzelm@3987
   425
  |> Theory.add_types
wenzelm@4922
   426
   [("fun", 2, NoSyn),
wenzelm@4922
   427
    ("prop", 0, NoSyn),
wenzelm@4922
   428
    ("itself", 1, NoSyn),
wenzelm@4922
   429
    ("dummy", 0, NoSyn)]
wenzelm@3987
   430
  |> Theory.add_classes_i [(logicC, [])]
wenzelm@3987
   431
  |> Theory.add_defsort_i logicS
wenzelm@3987
   432
  |> Theory.add_arities_i
wenzelm@3987
   433
   [("fun", [logicS, logicS], logicS),
wenzelm@3987
   434
    ("prop", [], logicS),
wenzelm@3987
   435
    ("itself", [logicS], logicS)]
wenzelm@4922
   436
  |> Theory.add_nonterminals Syntax.pure_nonterms
wenzelm@3987
   437
  |> Theory.add_syntax Syntax.pure_syntax
wenzelm@6692
   438
  |> Theory.add_modesyntax (Symbol.symbolsN, true) Syntax.pure_sym_syntax
wenzelm@6692
   439
  |> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax
wenzelm@3987
   440
  |> Theory.add_trfuns Syntax.pure_trfuns
wenzelm@3987
   441
  |> Theory.add_trfunsT Syntax.pure_trfunsT
wenzelm@3987
   442
  |> Theory.add_syntax
wenzelm@7949
   443
   [("==>", "[prop, prop] => prop", Delimfix "op ==>"),
wenzelm@7949
   444
    (dummy_patternN, "aprop", Delimfix "'_")]
wenzelm@3987
   445
  |> Theory.add_consts
wenzelm@3987
   446
   [("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)),
wenzelm@3987
   447
    ("=?=", "['a::{}, 'a] => prop", InfixrName ("=?=", 2)),
wenzelm@3987
   448
    ("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@3987
   449
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@8039
   450
    ("Goal", "prop => prop", Mixfix ("GOAL _", [1000], 999)),
wenzelm@6547
   451
    ("TYPE", "'a itself", NoSyn),
wenzelm@6560
   452
    (dummy_patternN, "'a", Delimfix "'_")]
nipkow@5041
   453
  |> Theory.add_modesyntax ("", false)
wenzelm@8039
   454
    [("Goal", "prop => prop", Mixfix ("_", [0], 0))]
wenzelm@4963
   455
  |> local_path
wenzelm@8419
   456
  |> (#1 oo (add_defs o map Thm.no_attributes))
wenzelm@4788
   457
   [("flexpair_def", "(t =?= u) == (t == u::'a::{})"),
wenzelm@4788
   458
    ("Goal_def", "GOAL (PROP A) == PROP A")]
wenzelm@4963
   459
  |> end_theory;
wenzelm@3987
   460
wenzelm@5091
   461
structure ProtoPure =
wenzelm@5091
   462
struct
wenzelm@5091
   463
  val thy = proto_pure;
wenzelm@5091
   464
  val flexpair_def = get_axiom thy "flexpair_def";
wenzelm@5091
   465
  val Goal_def = get_axiom thy "Goal_def";
wenzelm@5091
   466
end;
wenzelm@3987
   467
wenzelm@3987
   468
wenzelm@3987
   469
end;
wenzelm@3987
   470
wenzelm@3987
   471
wenzelm@4022
   472
structure BasicPureThy: BASIC_PURE_THY = PureThy;
wenzelm@4022
   473
open BasicPureThy;