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