src/Pure/pure_thy.ML
author wenzelm
Mon Jun 08 15:58:56 1998 +0200 (1998-06-08)
changeset 5005 4486d53a6438
parent 5000 9271b89c7e2c
child 5022 b4bd7e6402fe
permissions -rw-r--r--
use type-safe theory data interface;
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@4963
     5
Theorem database, derived theory operations, and the Pure theories.
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@4022
    14
  val thms_of: theory -> (string * thm) list
wenzelm@4963
    15
  val global_names: bool ref
wenzelm@4853
    16
end;
wenzelm@4022
    17
wenzelm@3987
    18
signature PURE_THY =
wenzelm@3987
    19
sig
wenzelm@4022
    20
  include BASIC_PURE_THY
wenzelm@4922
    21
  val thms_closure: theory -> xstring -> tthm list option
wenzelm@4783
    22
  val get_tthm: theory -> xstring -> tthm
wenzelm@4783
    23
  val get_tthms: theory -> xstring -> tthm list
wenzelm@4022
    24
  val thms_containing: theory -> string list -> (string * thm) list
wenzelm@4022
    25
  val smart_store_thm: (bstring * thm) -> thm
wenzelm@4853
    26
  val add_tthms: ((bstring * tthm) * theory attribute list) list -> theory -> theory
wenzelm@4853
    27
  val add_tthmss: ((bstring * tthm list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    28
  val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory
wenzelm@4853
    29
  val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory
wenzelm@4933
    30
  val add_axioms_x: ((bstring * string) * tag list) list -> theory -> theory
wenzelm@4853
    31
  val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    32
  val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    33
  val add_defs: ((bstring * string) * theory attribute list) list -> theory -> theory
wenzelm@4853
    34
  val add_defs_i: ((bstring * term) * theory attribute list) list -> theory -> theory
wenzelm@4933
    35
  val add_defs_x: ((bstring * string) * tag list) list -> theory -> theory
wenzelm@4853
    36
  val add_defss: ((bstring * string list) * theory attribute list) list -> theory -> theory
wenzelm@4853
    37
  val add_defss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory
wenzelm@4963
    38
  val get_name: theory -> string
wenzelm@4963
    39
  val put_name: string -> theory -> theory
wenzelm@4963
    40
  val global_path: theory -> theory
wenzelm@4963
    41
  val local_path: theory -> theory
wenzelm@4963
    42
  val begin_theory: string -> theory list -> theory
wenzelm@4963
    43
  val end_theory: theory -> theory
wenzelm@5000
    44
  val transaction: (theory -> theory) -> theory -> theory * bool * exn option
wenzelm@4922
    45
  val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
wenzelm@3987
    46
  val proto_pure: theory
wenzelm@3987
    47
  val pure: theory
wenzelm@3987
    48
  val cpure: theory
wenzelm@3987
    49
end;
wenzelm@3987
    50
wenzelm@3987
    51
structure PureThy: PURE_THY =
wenzelm@3987
    52
struct
wenzelm@3987
    53
wenzelm@3987
    54
wenzelm@4922
    55
(*** theorem database ***)
wenzelm@3987
    56
wenzelm@4922
    57
(** data kind 'Pure/theorems' **)
wenzelm@3987
    58
wenzelm@5005
    59
structure TheoremsDataArgs =
wenzelm@5005
    60
struct
wenzelm@5005
    61
  val name = "Pure/theorems";
wenzelm@3987
    62
wenzelm@5005
    63
  type T =
wenzelm@5005
    64
    {space: NameSpace.T,
wenzelm@5005
    65
      thms_tab: tthm list Symtab.table,
wenzelm@5005
    66
      const_idx: int * (int * tthm) list Symtab.table} ref;
wenzelm@3987
    67
wenzelm@4853
    68
  fun mk_empty _ =
wenzelm@5005
    69
    ref {space = NameSpace.empty, thms_tab = Symtab.empty, const_idx = (0, Symtab.empty)} : T;
wenzelm@3987
    70
wenzelm@5005
    71
  val empty = mk_empty ();
wenzelm@5005
    72
  val prep_ext = mk_empty;
wenzelm@5005
    73
  val merge = mk_empty;
wenzelm@5005
    74
wenzelm@5005
    75
  fun print sg (ref {space, thms_tab, const_idx = _}) =
wenzelm@4853
    76
    let
wenzelm@4853
    77
      val prt_thm = Attribute.pretty_tthm o apfst (Thm.transfer_sg sg);
wenzelm@4853
    78
      fun prt_thms (name, [th]) =
wenzelm@4853
    79
            Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th]
wenzelm@4853
    80
        | prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths);
wenzelm@3987
    81
wenzelm@4853
    82
      fun extrn name =
wenzelm@4853
    83
        if ! long_names then name else NameSpace.extern space name;
wenzelm@4853
    84
      val thmss = sort_wrt fst (map (apfst extrn) (Symtab.dest thms_tab));
wenzelm@4853
    85
    in
wenzelm@4853
    86
      Pretty.writeln (Display.pretty_name_space ("theorem name space", space));
wenzelm@4853
    87
      Pretty.writeln (Pretty.big_list "theorems:" (map prt_thms thmss))
wenzelm@4853
    88
    end;
wenzelm@3987
    89
end;
wenzelm@3987
    90
wenzelm@5005
    91
structure TheoremsData = TheoryDataFun(TheoremsDataArgs);
wenzelm@5005
    92
val get_theorems_sg = TheoremsData.get_sg;
wenzelm@5005
    93
val get_theorems = TheoremsData.get;
wenzelm@5005
    94
wenzelm@3987
    95
wenzelm@5000
    96
(* print theory *)
wenzelm@3987
    97
wenzelm@5005
    98
val print_theorems = TheoremsData.print;
wenzelm@5000
    99
fun print_theory thy =
wenzelm@5000
   100
  (Display.print_theory thy; print_theorems thy);
wenzelm@4022
   101
wenzelm@3987
   102
wenzelm@3987
   103
wenzelm@4022
   104
(** retrieve theorems **)
wenzelm@3987
   105
wenzelm@4922
   106
(* thms_closure *)
wenzelm@4922
   107
wenzelm@4922
   108
(*note: we avoid life references to the theory, so users may safely
wenzelm@5000
   109
  keep thms_closure with moderate space consumption*)
wenzelm@4022
   110
wenzelm@4922
   111
fun thms_closure_aux thy =
wenzelm@4922
   112
  let val ref {space, thms_tab, ...} = get_theorems thy
wenzelm@4922
   113
  in fn name => Symtab.lookup (thms_tab, NameSpace.intern space name) end;
wenzelm@4922
   114
wenzelm@4922
   115
fun thms_closure thy =
wenzelm@4922
   116
  let val closures = map thms_closure_aux (thy :: Theory.ancestors_of thy)
wenzelm@4922
   117
  in fn name => get_first (fn f => f name) closures end;
wenzelm@4022
   118
wenzelm@3987
   119
wenzelm@4783
   120
(* get_thms etc. *)
wenzelm@4037
   121
wenzelm@4922
   122
fun lookup_thms name thy = thms_closure_aux thy name;
wenzelm@4922
   123
wenzelm@4783
   124
fun get_tthms thy name =
wenzelm@4922
   125
  (case get_first (lookup_thms name) (thy :: Theory.ancestors_of thy) of
wenzelm@4590
   126
    None => raise THEORY ("Unknown theorem(s) " ^ quote name, [thy])
wenzelm@4022
   127
  | Some thms => thms);
wenzelm@3987
   128
wenzelm@4783
   129
fun get_tthm thy name =
wenzelm@4783
   130
  (case get_tthms thy name of
wenzelm@3987
   131
    [thm] => thm
wenzelm@4590
   132
  | _ => raise THEORY ("Single theorem expected " ^ quote name, [thy]));
wenzelm@4022
   133
wenzelm@4783
   134
fun get_thms thy = map Attribute.thm_of o get_tthms thy;
wenzelm@4783
   135
fun get_thm thy = Attribute.thm_of o get_tthm thy;
wenzelm@4783
   136
wenzelm@4022
   137
wenzelm@4022
   138
(* thms_of *)
wenzelm@4022
   139
wenzelm@4783
   140
fun attach_name (thm, _) = (Thm.name_of_thm thm, thm);
wenzelm@4022
   141
wenzelm@4022
   142
fun thms_of thy =
wenzelm@4022
   143
  let val ref {thms_tab, ...} = get_theorems thy in
wenzelm@4022
   144
    map attach_name (flat (map snd (Symtab.dest thms_tab)))
wenzelm@4022
   145
  end;
wenzelm@4022
   146
wenzelm@3987
   147
wenzelm@3987
   148
wenzelm@4022
   149
(** theorems indexed by constants **)
wenzelm@4022
   150
wenzelm@4022
   151
(* make index *)
wenzelm@4022
   152
wenzelm@4037
   153
val ignore = ["Trueprop", "all", "==>", "=="];
wenzelm@4022
   154
wenzelm@4783
   155
fun add_const_idx ((next, table), tthm as (thm, _)) =
wenzelm@4022
   156
  let
wenzelm@4022
   157
    val {hyps, prop, ...} = Thm.rep_thm thm;
wenzelm@4022
   158
    val consts =
wenzelm@4037
   159
      foldr add_term_consts (hyps, add_term_consts (prop, [])) \\ ignore;
wenzelm@4022
   160
wenzelm@4022
   161
    fun add (tab, c) =
wenzelm@4783
   162
      Symtab.update ((c, (next, tthm) :: Symtab.lookup_multi (tab, c)), tab);
wenzelm@4022
   163
  in (next + 1, foldl add (table, consts)) end;
wenzelm@4022
   164
wenzelm@4022
   165
fun make_const_idx thm_tab =
wenzelm@4487
   166
  foldl (foldl add_const_idx) ((0, Symtab.empty), map snd (Symtab.dest thm_tab));
wenzelm@4022
   167
wenzelm@4022
   168
wenzelm@4022
   169
(* lookup index *)
wenzelm@3987
   170
wenzelm@4022
   171
(*search locally*)
wenzelm@4022
   172
fun containing [] thy = thms_of thy
wenzelm@4022
   173
  | containing consts thy =
wenzelm@4022
   174
      let
wenzelm@4037
   175
        fun int ([], _) = []
wenzelm@4037
   176
          | int (_, []) = []
wenzelm@4037
   177
          | int (xxs as ((x as (i:int, _)) :: xs), yys as ((y as (j, _)) :: ys)) =
wenzelm@4037
   178
              if i = j then x :: int (xs, ys)
wenzelm@4037
   179
              else if i > j then int (xs, yys)
wenzelm@4037
   180
              else int (xxs, ys);
wenzelm@4022
   181
wenzelm@4037
   182
        fun ints [xs] = xs
wenzelm@4037
   183
          | ints xss = if exists null xss then [] else foldl int (hd xss, tl xss);
wenzelm@4022
   184
wenzelm@4022
   185
        val ref {const_idx = (_, ctab), ...} = get_theorems thy;
wenzelm@4022
   186
        val ithmss = map (fn c => Symtab.lookup_multi (ctab, c)) consts;
wenzelm@4022
   187
      in
wenzelm@4037
   188
        map (attach_name o snd) (ints ithmss)
wenzelm@4022
   189
      end;
wenzelm@4022
   190
wenzelm@4022
   191
(*search globally*)
wenzelm@4022
   192
fun thms_containing thy consts =
wenzelm@4037
   193
  flat (map (containing (consts \\ ignore)) (thy :: Theory.ancestors_of thy));
wenzelm@4022
   194
wenzelm@4022
   195
wenzelm@4022
   196
wenzelm@4022
   197
(** store theorems **)                    (*DESTRUCTIVE*)
wenzelm@3987
   198
wenzelm@4853
   199
(* naming *)
wenzelm@4853
   200
wenzelm@4853
   201
fun gen_names len name =
wenzelm@4853
   202
  map (fn i => name ^ "_" ^ string_of_int i) (1 upto len);
wenzelm@4853
   203
wenzelm@4853
   204
fun name_single name x = [(name, x)];
wenzelm@4853
   205
fun name_multi name xs = gen_names (length xs) name ~~ xs;
wenzelm@4853
   206
wenzelm@4853
   207
wenzelm@4853
   208
(* enter_tthmx *)
wenzelm@4853
   209
wenzelm@3987
   210
fun warn_overwrite name =
wenzelm@3987
   211
  warning ("Replaced old copy of theorems " ^ quote name);
wenzelm@3987
   212
wenzelm@3987
   213
fun warn_same name =
wenzelm@5005
   214
  warning ("Theorem database already contains a copy of " ^ quote name);
wenzelm@3987
   215
wenzelm@4853
   216
fun enter_tthmx sg app_name (bname, tthmx) =
wenzelm@3987
   217
  let
wenzelm@4853
   218
    val name = Sign.full_name sg bname;
wenzelm@4853
   219
    fun name_tthm (nm, (thm, tgs)) = (Thm.name_thm (nm, thm), tgs);
wenzelm@4853
   220
    val named_tthms = map name_tthm (app_name name tthmx);
wenzelm@3987
   221
wenzelm@4783
   222
    fun eq_tthm ((th1, _), (th2, _)) = Thm.eq_thm (th1, th2);
wenzelm@4022
   223
wenzelm@4022
   224
    val r as ref {space, thms_tab, const_idx} = get_theorems_sg sg;
wenzelm@4022
   225
wenzelm@4022
   226
    val overwrite =
wenzelm@4022
   227
      (case Symtab.lookup (thms_tab, name) of
wenzelm@4022
   228
        None => false
wenzelm@4783
   229
      | Some tthms' =>
wenzelm@4853
   230
          if length tthms' = length named_tthms andalso forall2 eq_tthm (tthms', named_tthms) then
wenzelm@4022
   231
            (warn_same name; false)
wenzelm@4022
   232
          else (warn_overwrite name; true));
wenzelm@4022
   233
wenzelm@4487
   234
    val space' = NameSpace.extend (space, [name]);
wenzelm@4783
   235
    val thms_tab' = Symtab.update ((name, named_tthms), thms_tab);
wenzelm@4022
   236
    val const_idx' =
wenzelm@4022
   237
      if overwrite then make_const_idx thms_tab'
wenzelm@4783
   238
      else foldl add_const_idx (const_idx, named_tthms);
wenzelm@3987
   239
  in
wenzelm@4022
   240
    r := {space = space', thms_tab = thms_tab', const_idx = const_idx'};
wenzelm@4783
   241
    named_tthms
wenzelm@3987
   242
  end;
wenzelm@3987
   243
wenzelm@4853
   244
wenzelm@4853
   245
(* add_tthms(s) *)
wenzelm@4853
   246
wenzelm@4853
   247
fun add_tthmx app_name app_att ((bname, tthmx), atts) thy =
wenzelm@4853
   248
  let val (thy', tthmx') = app_att ((thy, tthmx), atts)
wenzelm@4853
   249
  in enter_tthmx (Theory.sign_of thy') app_name (bname, tthmx'); thy' end;
wenzelm@4853
   250
wenzelm@4853
   251
val add_tthms = Theory.apply o map (add_tthmx name_single Attribute.apply);
wenzelm@4853
   252
val add_tthmss = Theory.apply o map (add_tthmx name_multi Attribute.applys);
wenzelm@3987
   253
wenzelm@3987
   254
wenzelm@4853
   255
(* smart_store_thm *)
wenzelm@3987
   256
wenzelm@4012
   257
fun smart_store_thm (name, thm) =
wenzelm@4853
   258
  let val [(thm', _)] = enter_tthmx (Thm.sign_of_thm thm) name_single (name, Attribute.tthm_of thm)
wenzelm@4783
   259
  in thm' end;
wenzelm@3987
   260
wenzelm@3987
   261
wenzelm@4022
   262
(* store axioms as theorems *)
wenzelm@4022
   263
wenzelm@4853
   264
local
wenzelm@4853
   265
  fun add_ax app_name add ((name, axs), atts) thy =
wenzelm@4853
   266
    let
wenzelm@4853
   267
      val named_axs = app_name name axs;
wenzelm@4853
   268
      val thy' = add named_axs thy;
wenzelm@4853
   269
      val tthms = map (Attribute.tthm_of o Thm.get_axiom thy' o fst) named_axs;
wenzelm@4853
   270
    in add_tthmss [((name, tthms), atts)] thy' end;
wenzelm@4022
   271
wenzelm@4853
   272
  fun add_axs app_name add = Theory.apply o map (add_ax app_name add);
wenzelm@4853
   273
in
wenzelm@4853
   274
  val add_axioms    = add_axs name_single Theory.add_axioms;
wenzelm@4853
   275
  val add_axioms_i  = add_axs name_single Theory.add_axioms_i;
wenzelm@4853
   276
  val add_axiomss   = add_axs name_multi Theory.add_axioms;
wenzelm@4853
   277
  val add_axiomss_i = add_axs name_multi Theory.add_axioms_i;
wenzelm@4853
   278
  val add_defs      = add_axs name_single Theory.add_defs;
wenzelm@4853
   279
  val add_defs_i    = add_axs name_single Theory.add_defs_i;
wenzelm@4853
   280
  val add_defss     = add_axs name_multi Theory.add_defs;
wenzelm@4853
   281
  val add_defss_i   = add_axs name_multi Theory.add_defs_i;
wenzelm@4853
   282
end;
wenzelm@4022
   283
wenzelm@4933
   284
fun add_axioms_x axms thy = add_axioms (map (apsnd (map (Attribute.global_attr thy))) axms) thy;
wenzelm@4933
   285
fun add_defs_x defs thy = add_defs (map (apsnd (map (Attribute.global_attr thy))) defs) thy;
wenzelm@4933
   286
wenzelm@4022
   287
wenzelm@3987
   288
wenzelm@4963
   289
(*** derived theory operations ***)
wenzelm@4963
   290
wenzelm@4963
   291
(** theory management **)
wenzelm@4963
   292
wenzelm@5005
   293
(* data kind 'Pure/theory_management' *)
wenzelm@4963
   294
wenzelm@5005
   295
structure TheoryManagementDataArgs =
wenzelm@5005
   296
struct
wenzelm@5005
   297
  val name = "Pure/theory_management";
wenzelm@5005
   298
  type T = {name: string, generation: int};
wenzelm@5000
   299
wenzelm@5005
   300
  val empty = {name = "", generation = 0};
wenzelm@5005
   301
  val prep_ext  = I;
wenzelm@5000
   302
  fun merge _ = empty;
wenzelm@5005
   303
  fun print _ _ = ();
wenzelm@4963
   304
end;
wenzelm@4963
   305
wenzelm@5005
   306
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs);
wenzelm@5005
   307
val get_info = TheoryManagementData.get;
wenzelm@5005
   308
val put_info = TheoryManagementData.put;
wenzelm@5005
   309
wenzelm@4963
   310
wenzelm@4963
   311
(* get / put name *)
wenzelm@4963
   312
wenzelm@5000
   313
val get_name = #name o get_info;
wenzelm@5000
   314
fun put_name name = put_info {name = name, generation = 0};
wenzelm@4963
   315
wenzelm@4963
   316
wenzelm@4963
   317
(* control prefixing of theory name *)
wenzelm@4963
   318
wenzelm@4963
   319
(*compatibility flag, likely to disappear someday*)
wenzelm@4963
   320
val global_names = ref false;
wenzelm@4963
   321
wenzelm@4963
   322
fun global_path thy =
wenzelm@4963
   323
  if ! global_names then thy else Theory.root_path thy;
wenzelm@4963
   324
wenzelm@4963
   325
fun local_path thy =
wenzelm@4963
   326
  if ! global_names then thy
wenzelm@4963
   327
  else thy |> Theory.root_path |> Theory.add_path (get_name thy);
wenzelm@4963
   328
wenzelm@4963
   329
wenzelm@4963
   330
(* begin / end theory *)
wenzelm@4963
   331
wenzelm@4963
   332
fun begin_theory name thys =
wenzelm@4963
   333
  Theory.prep_ext_merge thys
wenzelm@4963
   334
  |> put_name name
wenzelm@4963
   335
  |> local_path;
wenzelm@4963
   336
wenzelm@4963
   337
fun end_theory thy = Theory.add_name (get_name thy) thy;
wenzelm@4963
   338
wenzelm@4963
   339
wenzelm@5000
   340
(* atomic transactions *)
wenzelm@5000
   341
wenzelm@5000
   342
fun transaction f thy =
wenzelm@5000
   343
  let
wenzelm@5000
   344
    val {name, generation} = get_info thy;
wenzelm@5000
   345
    val copy_thy =
wenzelm@5000
   346
      thy
wenzelm@5000
   347
      |> Theory.prep_ext
wenzelm@5005
   348
      |> Theory.add_name ("#" ^ name ^ ":" ^ string_of_int generation)  (* FIXME !!?? *)
wenzelm@5000
   349
      |> put_info {name = name, generation = generation + 1};
wenzelm@5000
   350
  in
wenzelm@5000
   351
    (transform_error f thy, false, None) handle exn =>
wenzelm@5000
   352
      if Sign.is_stale (Theory.sign_of thy) then (copy_thy, true, Some exn)
wenzelm@5000
   353
      else (thy, false, Some exn)
wenzelm@5000
   354
  end;
wenzelm@5000
   355
wenzelm@5000
   356
wenzelm@4963
   357
wenzelm@4963
   358
(** add logical types **)
wenzelm@4922
   359
wenzelm@4922
   360
fun add_typedecls decls thy =
wenzelm@4922
   361
  let
wenzelm@4922
   362
    val full = Sign.full_name (Theory.sign_of thy);
wenzelm@4922
   363
wenzelm@4922
   364
    fun type_of (raw_name, vs, mx) =
wenzelm@4922
   365
      if null (duplicates vs) then (raw_name, length vs, mx)
wenzelm@4922
   366
      else error ("Duplicate parameters in type declaration: " ^ quote raw_name);
wenzelm@4922
   367
wenzelm@4922
   368
    fun arity_of (raw_name, len, mx) =
wenzelm@4922
   369
      (full (Syntax.type_name raw_name mx), replicate len logicS, logicS);
wenzelm@4922
   370
wenzelm@4922
   371
    val types = map type_of decls;
wenzelm@4922
   372
    val arities = map arity_of types;
wenzelm@4922
   373
  in
wenzelm@4922
   374
    thy
wenzelm@4922
   375
    |> Theory.add_types types
wenzelm@4922
   376
    |> Theory.add_arities_i arities
wenzelm@4922
   377
  end;
wenzelm@4922
   378
wenzelm@4922
   379
wenzelm@4922
   380
wenzelm@4922
   381
(*** the Pure theories ***)
wenzelm@3987
   382
wenzelm@3987
   383
val proto_pure =
wenzelm@3987
   384
  Theory.pre_pure
wenzelm@5005
   385
  |> Theory.apply (Attribute.setup @ [TheoremsData.init, TheoryManagementData.init])
wenzelm@4963
   386
  |> put_name "ProtoPure"
wenzelm@4963
   387
  |> global_path
wenzelm@3987
   388
  |> Theory.add_types
wenzelm@4922
   389
   [("fun", 2, NoSyn),
wenzelm@4922
   390
    ("prop", 0, NoSyn),
wenzelm@4922
   391
    ("itself", 1, NoSyn),
wenzelm@4922
   392
    ("dummy", 0, NoSyn)]
wenzelm@3987
   393
  |> Theory.add_classes_i [(logicC, [])]
wenzelm@3987
   394
  |> Theory.add_defsort_i logicS
wenzelm@3987
   395
  |> Theory.add_arities_i
wenzelm@3987
   396
   [("fun", [logicS, logicS], logicS),
wenzelm@3987
   397
    ("prop", [], logicS),
wenzelm@3987
   398
    ("itself", [logicS], logicS)]
wenzelm@4922
   399
  |> Theory.add_nonterminals Syntax.pure_nonterms
wenzelm@3987
   400
  |> Theory.add_syntax Syntax.pure_syntax
wenzelm@3987
   401
  |> Theory.add_modesyntax ("symbols", true) Syntax.pure_sym_syntax
wenzelm@3987
   402
  |> Theory.add_trfuns Syntax.pure_trfuns
wenzelm@3987
   403
  |> Theory.add_trfunsT Syntax.pure_trfunsT
wenzelm@3987
   404
  |> Theory.add_syntax
wenzelm@3987
   405
   [("==>", "[prop, prop] => prop", Delimfix "op ==>")]
wenzelm@3987
   406
  |> Theory.add_consts
wenzelm@3987
   407
   [("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)),
wenzelm@3987
   408
    ("=?=", "['a::{}, 'a] => prop", InfixrName ("=?=", 2)),
wenzelm@3987
   409
    ("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@3987
   410
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@4788
   411
    ("Goal", "prop => prop", Mixfix ("GOAL _", [999], 1000)),
wenzelm@3987
   412
    ("TYPE", "'a itself", NoSyn)]
wenzelm@4963
   413
  |> local_path
wenzelm@4853
   414
  |> (add_defs o map Attribute.none)
wenzelm@4788
   415
   [("flexpair_def", "(t =?= u) == (t == u::'a::{})"),
wenzelm@4788
   416
    ("Goal_def", "GOAL (PROP A) == PROP A")]
wenzelm@4963
   417
  |> end_theory;
wenzelm@3987
   418
wenzelm@4022
   419
val pure =
wenzelm@4963
   420
  begin_theory "Pure" [proto_pure]
wenzelm@3987
   421
  |> Theory.add_syntax Syntax.pure_appl_syntax
wenzelm@4963
   422
  |> end_theory;
wenzelm@3987
   423
wenzelm@4022
   424
val cpure =
wenzelm@4963
   425
  begin_theory "CPure" [proto_pure]
wenzelm@3987
   426
  |> Theory.add_syntax Syntax.pure_applC_syntax
wenzelm@4963
   427
  |> end_theory;
wenzelm@3987
   428
wenzelm@3987
   429
wenzelm@3987
   430
end;
wenzelm@3987
   431
wenzelm@3987
   432
wenzelm@4022
   433
structure BasicPureThy: BASIC_PURE_THY = PureThy;
wenzelm@4022
   434
open BasicPureThy;
wenzelm@4022
   435
wenzelm@4022
   436
wenzelm@3987
   437
wenzelm@4963
   438
(** Pure theory structures **)
wenzelm@3987
   439
wenzelm@3987
   440
structure ProtoPure =
wenzelm@3987
   441
struct
wenzelm@3987
   442
  val thy = PureThy.proto_pure;
wenzelm@3987
   443
  val flexpair_def = get_axiom thy "flexpair_def";
wenzelm@4788
   444
  val Goal_def = get_axiom thy "Goal_def";
wenzelm@3987
   445
end;
wenzelm@3987
   446
wenzelm@3987
   447
structure Pure = struct val thy = PureThy.pure end;
wenzelm@3987
   448
structure CPure = struct val thy = PureThy.cpure end;