src/Pure/pure_thy.ML
author wenzelm
Wed Mar 17 13:31:19 1999 +0100 (1999-03-17)
changeset 6367 7f36b6fd3eb3
parent 6350 b5f1f861155d
child 6547 5ba27aade76f
permissions -rw-r--r--
added cond_extern_thm_sg;
have_thmss: name made optional;
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@6091
    28
  val thms_closure: theory -> xstring -> thm list option
wenzelm@4022
    29
  val thms_containing: theory -> string list -> (string * thm) list
wenzelm@5907
    30
  val default_name: string -> string
wenzelm@6091
    31
  val store_thm: (bstring * thm) * theory attribute list -> theory -> theory * thm
wenzelm@4022
    32
  val smart_store_thm: (bstring * thm) -> thm
wenzelm@6091
    33
  val add_thms: ((bstring * thm) * theory attribute list) list -> theory -> theory
wenzelm@6091
    34
  val add_thmss: ((bstring * thm list) * theory attribute list) list -> theory -> theory
wenzelm@6367
    35
  val have_thmss: bstring option -> theory attribute list ->
wenzelm@6091
    36
    (thm list * theory attribute list) list -> theory -> theory * thm list
wenzelm@4853
    37
  val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory
wenzelm@4853
    38
  val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory
wenzelm@4853
    39
  val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    40
  val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    41
  val add_defs: ((bstring * string) * theory attribute list) list -> theory -> theory
wenzelm@4853
    42
  val add_defs_i: ((bstring * term) * theory attribute list) list -> theory -> theory
wenzelm@4853
    43
  val add_defss: ((bstring * string list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    44
  val add_defss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory
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@5091
    51
  exception ROLLBACK of theory * exn option
wenzelm@5091
    52
  val transaction: (theory -> theory) -> theory -> theory
wenzelm@4922
    53
  val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
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@5005
    77
  val prep_ext = mk_empty;
wenzelm@5005
    78
  val merge = mk_empty;
wenzelm@5005
    79
wenzelm@5005
    80
  fun print sg (ref {space, thms_tab, const_idx = _}) =
wenzelm@4853
    81
    let
wenzelm@6091
    82
      val prt_thm = Display.pretty_thm o Thm.transfer_sg sg;
wenzelm@4853
    83
      fun prt_thms (name, [th]) =
wenzelm@4853
    84
            Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th]
wenzelm@4853
    85
        | prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths);
wenzelm@3987
    86
wenzelm@5175
    87
      val thmss = sort_wrt fst (map (apfst (NameSpace.cond_extern space)) (Symtab.dest thms_tab));
wenzelm@4853
    88
    in
wenzelm@4853
    89
      Pretty.writeln (Display.pretty_name_space ("theorem name space", space));
wenzelm@4853
    90
      Pretty.writeln (Pretty.big_list "theorems:" (map prt_thms thmss))
wenzelm@4853
    91
    end;
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@5000
   104
fun print_theory thy =
wenzelm@5000
   105
  (Display.print_theory thy; print_theorems thy);
wenzelm@4022
   106
wenzelm@3987
   107
wenzelm@3987
   108
wenzelm@4022
   109
(** retrieve theorems **)
wenzelm@3987
   110
wenzelm@4922
   111
(* thms_closure *)
wenzelm@4922
   112
wenzelm@4922
   113
(*note: we avoid life references to the theory, so users may safely
wenzelm@5000
   114
  keep thms_closure with moderate space consumption*)
wenzelm@4022
   115
wenzelm@4922
   116
fun thms_closure_aux thy =
wenzelm@4922
   117
  let val ref {space, thms_tab, ...} = get_theorems thy
wenzelm@4922
   118
  in fn name => Symtab.lookup (thms_tab, NameSpace.intern space name) end;
wenzelm@4922
   119
wenzelm@4922
   120
fun thms_closure thy =
wenzelm@4922
   121
  let val closures = map thms_closure_aux (thy :: Theory.ancestors_of thy)
wenzelm@4922
   122
  in fn name => get_first (fn f => f name) closures end;
wenzelm@4022
   123
wenzelm@3987
   124
wenzelm@4783
   125
(* get_thms etc. *)
wenzelm@4037
   126
wenzelm@4922
   127
fun lookup_thms name thy = thms_closure_aux thy name;
wenzelm@4922
   128
wenzelm@6091
   129
fun get_thms thy name =
wenzelm@4922
   130
  (case get_first (lookup_thms name) (thy :: Theory.ancestors_of thy) of
wenzelm@4590
   131
    None => raise THEORY ("Unknown theorem(s) " ^ quote name, [thy])
wenzelm@4022
   132
  | Some thms => thms);
wenzelm@3987
   133
wenzelm@6091
   134
fun get_thm thy name =
wenzelm@6091
   135
  (case get_thms thy name of
wenzelm@3987
   136
    [thm] => thm
wenzelm@4590
   137
  | _ => raise THEORY ("Single theorem expected " ^ quote name, [thy]));
wenzelm@4022
   138
wenzelm@6091
   139
fun get_thmss thy names = flat (map (get_thms thy) names);
wenzelm@4783
   140
wenzelm@4022
   141
wenzelm@4022
   142
(* thms_of *)
wenzelm@4022
   143
wenzelm@6091
   144
fun attach_name thm = (Thm.name_of_thm thm, thm);
wenzelm@4022
   145
wenzelm@4022
   146
fun thms_of thy =
wenzelm@4022
   147
  let val ref {thms_tab, ...} = get_theorems thy in
wenzelm@4022
   148
    map attach_name (flat (map snd (Symtab.dest thms_tab)))
wenzelm@4022
   149
  end;
wenzelm@4022
   150
wenzelm@3987
   151
wenzelm@3987
   152
wenzelm@4022
   153
(** theorems indexed by constants **)
wenzelm@4022
   154
wenzelm@4022
   155
(* make index *)
wenzelm@4022
   156
wenzelm@4037
   157
val ignore = ["Trueprop", "all", "==>", "=="];
wenzelm@4022
   158
wenzelm@6091
   159
fun add_const_idx ((next, table), thm) =
wenzelm@4022
   160
  let
wenzelm@4022
   161
    val {hyps, prop, ...} = Thm.rep_thm thm;
wenzelm@4022
   162
    val consts =
wenzelm@4037
   163
      foldr add_term_consts (hyps, add_term_consts (prop, [])) \\ ignore;
wenzelm@4022
   164
wenzelm@4022
   165
    fun add (tab, c) =
wenzelm@6091
   166
      Symtab.update ((c, (next, thm) :: Symtab.lookup_multi (tab, c)), tab);
wenzelm@4022
   167
  in (next + 1, foldl add (table, consts)) end;
wenzelm@4022
   168
wenzelm@4022
   169
fun make_const_idx thm_tab =
wenzelm@5686
   170
  Symtab.foldl (fn (x, (_, ths)) => foldl add_const_idx (x, ths)) ((0, Symtab.empty), thm_tab);
wenzelm@4022
   171
wenzelm@4022
   172
wenzelm@4022
   173
(* lookup index *)
wenzelm@3987
   174
wenzelm@4022
   175
(*search locally*)
wenzelm@4022
   176
fun containing [] thy = thms_of thy
wenzelm@4022
   177
  | containing consts thy =
wenzelm@4022
   178
      let
wenzelm@4037
   179
        fun int ([], _) = []
wenzelm@4037
   180
          | int (_, []) = []
wenzelm@4037
   181
          | int (xxs as ((x as (i:int, _)) :: xs), yys as ((y as (j, _)) :: ys)) =
wenzelm@4037
   182
              if i = j then x :: int (xs, ys)
wenzelm@4037
   183
              else if i > j then int (xs, yys)
wenzelm@4037
   184
              else int (xxs, ys);
wenzelm@4022
   185
wenzelm@4037
   186
        fun ints [xs] = xs
wenzelm@4037
   187
          | ints xss = if exists null xss then [] else foldl int (hd xss, tl xss);
wenzelm@4022
   188
wenzelm@4022
   189
        val ref {const_idx = (_, ctab), ...} = get_theorems thy;
wenzelm@4022
   190
        val ithmss = map (fn c => Symtab.lookup_multi (ctab, c)) consts;
wenzelm@4022
   191
      in
wenzelm@4037
   192
        map (attach_name o snd) (ints ithmss)
wenzelm@4022
   193
      end;
wenzelm@4022
   194
wenzelm@4022
   195
(*search globally*)
wenzelm@4022
   196
fun thms_containing thy consts =
wenzelm@4037
   197
  flat (map (containing (consts \\ ignore)) (thy :: Theory.ancestors_of thy));
wenzelm@4022
   198
wenzelm@4022
   199
wenzelm@4022
   200
wenzelm@4022
   201
(** store theorems **)                    (*DESTRUCTIVE*)
wenzelm@3987
   202
wenzelm@4853
   203
(* naming *)
wenzelm@4853
   204
wenzelm@5933
   205
val defaultN = "it";
wenzelm@5933
   206
val default_name = fn "" => defaultN | name => name;
wenzelm@5907
   207
wenzelm@4853
   208
fun gen_names len name =
wenzelm@4853
   209
  map (fn i => name ^ "_" ^ string_of_int i) (1 upto len);
wenzelm@4853
   210
wenzelm@5907
   211
fun name_single name x = [(default_name name, x)];
wenzelm@5907
   212
fun name_multi name xs = gen_names (length xs) (default_name name) ~~ xs;
wenzelm@4853
   213
wenzelm@4853
   214
wenzelm@6091
   215
(* enter_thmx *)
wenzelm@4853
   216
wenzelm@5933
   217
fun cond_warning name msg = if Sign.base_name name = defaultN then () else warning msg;
wenzelm@5933
   218
wenzelm@3987
   219
fun warn_overwrite name =
wenzelm@5933
   220
  cond_warning name ("Replaced old copy of theorems " ^ quote name);
wenzelm@3987
   221
wenzelm@3987
   222
fun warn_same name =
wenzelm@5933
   223
  cond_warning name ("Theorem database already contains a copy of " ^ quote name);
wenzelm@3987
   224
wenzelm@6091
   225
fun enter_thmx sg app_name (bname, thmx) =
wenzelm@3987
   226
  let
wenzelm@6350
   227
    val name = Sign.full_name sg (default_name bname);
wenzelm@6091
   228
    val named_thms = map Thm.name_thm (app_name name thmx);
wenzelm@4022
   229
wenzelm@4022
   230
    val r as ref {space, thms_tab, const_idx} = get_theorems_sg sg;
wenzelm@4022
   231
wenzelm@4022
   232
    val overwrite =
wenzelm@4022
   233
      (case Symtab.lookup (thms_tab, name) of
wenzelm@4022
   234
        None => false
wenzelm@6091
   235
      | Some thms' =>
wenzelm@6091
   236
          if length thms' = length named_thms andalso forall2 Thm.eq_thm (thms', named_thms) then
wenzelm@4022
   237
            (warn_same name; false)
wenzelm@4022
   238
          else (warn_overwrite name; true));
wenzelm@4022
   239
wenzelm@4487
   240
    val space' = NameSpace.extend (space, [name]);
wenzelm@6091
   241
    val thms_tab' = Symtab.update ((name, named_thms), thms_tab);
wenzelm@4022
   242
    val const_idx' =
wenzelm@4022
   243
      if overwrite then make_const_idx thms_tab'
wenzelm@6091
   244
      else foldl add_const_idx (const_idx, named_thms);
wenzelm@3987
   245
  in
wenzelm@4022
   246
    r := {space = space', thms_tab = thms_tab', const_idx = const_idx'};
wenzelm@6091
   247
    named_thms
wenzelm@3987
   248
  end;
wenzelm@3987
   249
wenzelm@4853
   250
wenzelm@6091
   251
(* add_thms(s) *)
wenzelm@4853
   252
wenzelm@6091
   253
fun add_thmx app_name app_att ((bname, thmx), atts) thy =
wenzelm@5280
   254
  let
wenzelm@6091
   255
    val (thy', thmx') = app_att ((thy, thmx), atts);
wenzelm@6091
   256
    val thms'' = enter_thmx (Theory.sign_of thy') app_name (bname, thmx');
wenzelm@6091
   257
  in (thy', thms'') end;
wenzelm@4853
   258
wenzelm@6091
   259
fun add_thmxs name app = Library.apply o map (fst oo add_thmx name app);
wenzelm@5907
   260
wenzelm@6091
   261
val add_thms = add_thmxs name_single Thm.apply_attributes;
wenzelm@6091
   262
val add_thmss = add_thmxs name_multi Thm.applys_attributes;
wenzelm@5907
   263
wenzelm@5907
   264
wenzelm@6091
   265
(* have_thmss *)
wenzelm@5907
   266
wenzelm@6367
   267
fun have_thmss opt_bname more_atts ths_atts thy =
wenzelm@5907
   268
  let
wenzelm@6091
   269
    fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts);
wenzelm@6091
   270
    val (thy', thmss') =
wenzelm@5907
   271
      foldl_map app (thy, map (fn (ths, atts) => (ths, atts @ more_atts)) ths_atts);
wenzelm@6367
   272
    val thms' = flat thmss';
wenzelm@6367
   273
    val thms'' =
wenzelm@6367
   274
      (case opt_bname of
wenzelm@6367
   275
        None => thms'
wenzelm@6367
   276
      | Some bname => enter_thmx (Theory.sign_of thy') name_multi (bname, thms'));
wenzelm@6091
   277
  in (thy, thms'') end;
wenzelm@5280
   278
wenzelm@5280
   279
wenzelm@6091
   280
(* store_thm *)
wenzelm@5280
   281
wenzelm@6091
   282
fun store_thm th_atts thy =
wenzelm@6091
   283
  let val (thy', [th']) = add_thmx name_single Thm.apply_attributes th_atts thy
wenzelm@5280
   284
  in (thy', th') end;
wenzelm@3987
   285
wenzelm@3987
   286
wenzelm@4853
   287
(* smart_store_thm *)
wenzelm@3987
   288
wenzelm@4012
   289
fun smart_store_thm (name, thm) =
wenzelm@6091
   290
  hd (enter_thmx (Thm.sign_of_thm thm) name_single (name, thm));
wenzelm@3987
   291
wenzelm@3987
   292
wenzelm@4022
   293
(* store axioms as theorems *)
wenzelm@4022
   294
wenzelm@4853
   295
local
wenzelm@4853
   296
  fun add_ax app_name add ((name, axs), atts) thy =
wenzelm@4853
   297
    let
wenzelm@4853
   298
      val named_axs = app_name name axs;
wenzelm@4853
   299
      val thy' = add named_axs thy;
wenzelm@6091
   300
      val thms = map (Thm.get_axiom thy' o fst) named_axs;
wenzelm@6091
   301
    in add_thmss [((name, thms), atts)] thy' end;
wenzelm@4022
   302
wenzelm@5907
   303
  fun add_axs app_name add = Library.apply o map (add_ax app_name add);
wenzelm@4853
   304
in
wenzelm@4853
   305
  val add_axioms    = add_axs name_single Theory.add_axioms;
wenzelm@4853
   306
  val add_axioms_i  = add_axs name_single Theory.add_axioms_i;
wenzelm@4853
   307
  val add_axiomss   = add_axs name_multi Theory.add_axioms;
wenzelm@4853
   308
  val add_axiomss_i = add_axs name_multi Theory.add_axioms_i;
wenzelm@4853
   309
  val add_defs      = add_axs name_single Theory.add_defs;
wenzelm@4853
   310
  val add_defs_i    = add_axs name_single Theory.add_defs_i;
wenzelm@4853
   311
  val add_defss     = add_axs name_multi Theory.add_defs;
wenzelm@4853
   312
  val add_defss_i   = add_axs name_multi Theory.add_defs_i;
wenzelm@4853
   313
end;
wenzelm@4022
   314
wenzelm@4022
   315
wenzelm@3987
   316
wenzelm@4963
   317
(*** derived theory operations ***)
wenzelm@4963
   318
wenzelm@4963
   319
(** theory management **)
wenzelm@4963
   320
wenzelm@5005
   321
(* data kind 'Pure/theory_management' *)
wenzelm@4963
   322
wenzelm@5005
   323
structure TheoryManagementDataArgs =
wenzelm@5005
   324
struct
wenzelm@5005
   325
  val name = "Pure/theory_management";
wenzelm@5005
   326
  type T = {name: string, generation: int};
wenzelm@5000
   327
wenzelm@5005
   328
  val empty = {name = "", generation = 0};
wenzelm@5005
   329
  val prep_ext  = I;
wenzelm@5000
   330
  fun merge _ = empty;
wenzelm@5005
   331
  fun print _ _ = ();
wenzelm@4963
   332
end;
wenzelm@4963
   333
wenzelm@5005
   334
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs);
wenzelm@5005
   335
val get_info = TheoryManagementData.get;
wenzelm@5005
   336
val put_info = TheoryManagementData.put;
wenzelm@5005
   337
wenzelm@4963
   338
wenzelm@4963
   339
(* get / put name *)
wenzelm@4963
   340
wenzelm@5000
   341
val get_name = #name o get_info;
wenzelm@5000
   342
fun put_name name = put_info {name = name, generation = 0};
wenzelm@4963
   343
wenzelm@4963
   344
wenzelm@4963
   345
(* control prefixing of theory name *)
wenzelm@4963
   346
wenzelm@5210
   347
val global_path = Theory.root_path;
wenzelm@4963
   348
wenzelm@4963
   349
fun local_path thy =
wenzelm@5210
   350
  thy |> Theory.root_path |> Theory.add_path (get_name thy);
wenzelm@4963
   351
wenzelm@4963
   352
wenzelm@4963
   353
(* begin / end theory *)
wenzelm@4963
   354
wenzelm@4963
   355
fun begin_theory name thys =
wenzelm@4963
   356
  Theory.prep_ext_merge thys
wenzelm@4963
   357
  |> put_name name
wenzelm@4963
   358
  |> local_path;
wenzelm@4963
   359
wenzelm@4963
   360
fun end_theory thy = Theory.add_name (get_name thy) thy;
wenzelm@4963
   361
wenzelm@4963
   362
wenzelm@5000
   363
(* atomic transactions *)
wenzelm@5000
   364
wenzelm@5091
   365
exception ROLLBACK of theory * exn option;
wenzelm@5091
   366
wenzelm@5000
   367
fun transaction f thy =
wenzelm@5000
   368
  let
wenzelm@5000
   369
    val {name, generation} = get_info thy;
wenzelm@5000
   370
    val copy_thy =
wenzelm@5000
   371
      thy
wenzelm@5000
   372
      |> Theory.prep_ext
wenzelm@5005
   373
      |> Theory.add_name ("#" ^ name ^ ":" ^ string_of_int generation)  (* FIXME !!?? *)
wenzelm@5000
   374
      |> put_info {name = name, generation = generation + 1};
wenzelm@5026
   375
    val (thy', opt_exn) = (transform_error f thy, None) handle exn => (thy, Some exn);
wenzelm@5000
   376
  in
wenzelm@5091
   377
    if Sign.is_stale (Theory.sign_of thy') then raise ROLLBACK (copy_thy, opt_exn)
wenzelm@5091
   378
    else (case opt_exn of Some exn => raise exn | _ => thy')
wenzelm@5000
   379
  end;
wenzelm@5000
   380
wenzelm@5000
   381
wenzelm@4963
   382
wenzelm@4963
   383
(** add logical types **)
wenzelm@4922
   384
wenzelm@4922
   385
fun add_typedecls decls thy =
wenzelm@4922
   386
  let
wenzelm@4922
   387
    val full = Sign.full_name (Theory.sign_of thy);
wenzelm@4922
   388
wenzelm@4922
   389
    fun type_of (raw_name, vs, mx) =
wenzelm@4922
   390
      if null (duplicates vs) then (raw_name, length vs, mx)
wenzelm@4922
   391
      else error ("Duplicate parameters in type declaration: " ^ quote raw_name);
wenzelm@4922
   392
wenzelm@4922
   393
    fun arity_of (raw_name, len, mx) =
wenzelm@4922
   394
      (full (Syntax.type_name raw_name mx), replicate len logicS, logicS);
wenzelm@4922
   395
wenzelm@4922
   396
    val types = map type_of decls;
wenzelm@4922
   397
    val arities = map arity_of types;
wenzelm@4922
   398
  in
wenzelm@4922
   399
    thy
wenzelm@4922
   400
    |> Theory.add_types types
wenzelm@4922
   401
    |> Theory.add_arities_i arities
wenzelm@4922
   402
  end;
wenzelm@4922
   403
wenzelm@4922
   404
wenzelm@4922
   405
wenzelm@5091
   406
(*** the ProtoPure theory ***)
wenzelm@3987
   407
wenzelm@3987
   408
val proto_pure =
wenzelm@3987
   409
  Theory.pre_pure
wenzelm@5907
   410
  |> Library.apply [TheoremsData.init, TheoryManagementData.init]
wenzelm@4963
   411
  |> put_name "ProtoPure"
wenzelm@4963
   412
  |> global_path
wenzelm@3987
   413
  |> Theory.add_types
wenzelm@4922
   414
   [("fun", 2, NoSyn),
wenzelm@4922
   415
    ("prop", 0, NoSyn),
wenzelm@4922
   416
    ("itself", 1, NoSyn),
wenzelm@4922
   417
    ("dummy", 0, NoSyn)]
wenzelm@3987
   418
  |> Theory.add_classes_i [(logicC, [])]
wenzelm@3987
   419
  |> Theory.add_defsort_i logicS
wenzelm@3987
   420
  |> Theory.add_arities_i
wenzelm@3987
   421
   [("fun", [logicS, logicS], logicS),
wenzelm@3987
   422
    ("prop", [], logicS),
wenzelm@3987
   423
    ("itself", [logicS], logicS)]
wenzelm@4922
   424
  |> Theory.add_nonterminals Syntax.pure_nonterms
wenzelm@3987
   425
  |> Theory.add_syntax Syntax.pure_syntax
oheimb@6027
   426
  |> Theory.add_modesyntax ("symbols" , true) Syntax.pure_sym_syntax
oheimb@6027
   427
  |> Theory.add_modesyntax ("xsymbols", true) Syntax.pure_xsym_syntax
wenzelm@3987
   428
  |> Theory.add_trfuns Syntax.pure_trfuns
wenzelm@3987
   429
  |> Theory.add_trfunsT Syntax.pure_trfunsT
wenzelm@3987
   430
  |> Theory.add_syntax
wenzelm@3987
   431
   [("==>", "[prop, prop] => prop", Delimfix "op ==>")]
wenzelm@3987
   432
  |> Theory.add_consts
wenzelm@3987
   433
   [("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)),
wenzelm@3987
   434
    ("=?=", "['a::{}, 'a] => prop", InfixrName ("=?=", 2)),
wenzelm@3987
   435
    ("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@3987
   436
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@4788
   437
    ("Goal", "prop => prop", Mixfix ("GOAL _", [999], 1000)),
wenzelm@3987
   438
    ("TYPE", "'a itself", NoSyn)]
nipkow@5041
   439
  |> Theory.add_modesyntax ("", false)
nipkow@5041
   440
    [("Goal", "prop => prop", Mixfix ("_", [0], 0))]
wenzelm@4963
   441
  |> local_path
wenzelm@6091
   442
  |> (add_defs o map Thm.no_attributes)
wenzelm@4788
   443
   [("flexpair_def", "(t =?= u) == (t == u::'a::{})"),
wenzelm@4788
   444
    ("Goal_def", "GOAL (PROP A) == PROP A")]
wenzelm@4963
   445
  |> end_theory;
wenzelm@3987
   446
wenzelm@5091
   447
structure ProtoPure =
wenzelm@5091
   448
struct
wenzelm@5091
   449
  val thy = proto_pure;
wenzelm@5091
   450
  val flexpair_def = get_axiom thy "flexpair_def";
wenzelm@5091
   451
  val Goal_def = get_axiom thy "Goal_def";
wenzelm@5091
   452
end;
wenzelm@3987
   453
wenzelm@3987
   454
wenzelm@3987
   455
end;
wenzelm@3987
   456
wenzelm@3987
   457
wenzelm@4022
   458
structure BasicPureThy: BASIC_PURE_THY = PureThy;
wenzelm@4022
   459
open BasicPureThy;