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