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