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