src/Pure/pure_thy.ML
author wenzelm
Thu Jul 13 23:14:49 2000 +0200 (2000-07-13)
changeset 9318 4c3fb0786022
parent 9238 ad37b21c0dc6
child 9534 0d14a9e7930c
permissions -rw-r--r--
add_defs(_i): overloaded option;
wenzelm@3987
     1
(*  Title:      Pure/pure_thy.ML
wenzelm@3987
     2
    ID:         $Id$
wenzelm@3987
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@9318
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@3987
     5
wenzelm@5091
     6
Theorem database, derived theory operations, and the ProtoPure theory.
wenzelm@3987
     7
*)
wenzelm@3987
     8
wenzelm@4022
     9
signature BASIC_PURE_THY =
wenzelm@4022
    10
sig
wenzelm@5000
    11
  val print_theorems: theory -> unit
wenzelm@5000
    12
  val print_theory: theory -> unit
wenzelm@4022
    13
  val get_thm: theory -> xstring -> thm
wenzelm@4022
    14
  val get_thms: theory -> xstring -> thm list
wenzelm@6094
    15
  val get_thmss: theory -> xstring list -> thm list
wenzelm@4022
    16
  val thms_of: theory -> (string * thm) list
wenzelm@5091
    17
  structure ProtoPure:
wenzelm@5091
    18
    sig
wenzelm@5091
    19
      val thy: theory
wenzelm@5091
    20
      val flexpair_def: thm
wenzelm@5091
    21
      val Goal_def: thm
wenzelm@5091
    22
    end
wenzelm@4853
    23
end;
wenzelm@4022
    24
wenzelm@3987
    25
signature PURE_THY =
wenzelm@3987
    26
sig
wenzelm@4022
    27
  include BASIC_PURE_THY
wenzelm@6367
    28
  val cond_extern_thm_sg: Sign.sg -> string -> xstring
wenzelm@4022
    29
  val thms_containing: theory -> string list -> (string * thm) list
wenzelm@6091
    30
  val store_thm: (bstring * thm) * theory attribute list -> theory -> theory * thm
wenzelm@7405
    31
  val smart_store_thms: (bstring * thm list) -> thm list
wenzelm@7899
    32
  val forall_elim_var: int -> thm -> thm
wenzelm@7899
    33
  val forall_elim_vars: int -> thm -> thm
wenzelm@8419
    34
  val add_thms: ((bstring * thm) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    35
  val add_thmss: ((bstring * thm list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@9192
    36
  val have_thmss: theory attribute list -> ((bstring * theory attribute list) *
wenzelm@9192
    37
    (thm list * theory attribute list) list) list -> theory -> theory * (string * thm list) list
wenzelm@8419
    38
  val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    39
  val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory * thm list
wenzelm@8419
    40
  val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@8419
    41
  val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory -> theory * thm list list
wenzelm@9318
    42
  val add_defs: bool -> ((bstring * string) * theory attribute list) list
wenzelm@9318
    43
    -> theory -> theory * thm list
wenzelm@9318
    44
  val add_defs_i: bool -> ((bstring * term) * theory attribute list) list
wenzelm@9318
    45
    -> theory -> theory * thm list
wenzelm@9318
    46
  val add_defss: bool -> ((bstring * string list) * theory attribute list) list
wenzelm@9318
    47
    -> theory -> theory * thm list list
wenzelm@9318
    48
  val add_defss_i: bool -> ((bstring * term list) * theory attribute list) list
wenzelm@9318
    49
    -> theory -> theory * thm list list
wenzelm@4963
    50
  val get_name: theory -> string
wenzelm@4963
    51
  val put_name: string -> theory -> theory
wenzelm@4963
    52
  val global_path: theory -> theory
wenzelm@4963
    53
  val local_path: theory -> theory
wenzelm@4963
    54
  val begin_theory: string -> theory list -> theory
wenzelm@4963
    55
  val end_theory: theory -> theory
wenzelm@6682
    56
  val checkpoint: theory -> theory
wenzelm@4922
    57
  val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
wenzelm@6560
    58
  val dummy_patternN: string
wenzelm@3987
    59
end;
wenzelm@3987
    60
wenzelm@3987
    61
structure PureThy: PURE_THY =
wenzelm@3987
    62
struct
wenzelm@3987
    63
wenzelm@3987
    64
wenzelm@4922
    65
(*** theorem database ***)
wenzelm@3987
    66
wenzelm@4922
    67
(** data kind 'Pure/theorems' **)
wenzelm@3987
    68
wenzelm@5005
    69
structure TheoremsDataArgs =
wenzelm@5005
    70
struct
wenzelm@5005
    71
  val name = "Pure/theorems";
wenzelm@3987
    72
wenzelm@5005
    73
  type T =
wenzelm@5005
    74
    {space: NameSpace.T,
wenzelm@6091
    75
      thms_tab: thm list Symtab.table,
wenzelm@6091
    76
      const_idx: int * (int * thm) list Symtab.table} ref;
wenzelm@3987
    77
wenzelm@4853
    78
  fun mk_empty _ =
wenzelm@5005
    79
    ref {space = NameSpace.empty, thms_tab = Symtab.empty, const_idx = (0, Symtab.empty)} : T;
wenzelm@3987
    80
wenzelm@5005
    81
  val empty = mk_empty ();
wenzelm@6547
    82
  fun copy (ref x) = ref x;
wenzelm@5005
    83
  val prep_ext = mk_empty;
wenzelm@5005
    84
  val merge = mk_empty;
wenzelm@5005
    85
wenzelm@8720
    86
  fun pretty sg (ref {space, thms_tab, const_idx = _}) =
wenzelm@4853
    87
    let
wenzelm@6091
    88
      val prt_thm = Display.pretty_thm o Thm.transfer_sg sg;
wenzelm@4853
    89
      fun prt_thms (name, [th]) =
wenzelm@4853
    90
            Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th]
wenzelm@4853
    91
        | prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths);
wenzelm@3987
    92
wenzelm@6846
    93
      val thmss = NameSpace.cond_extern_table space thms_tab;
wenzelm@9215
    94
    in Pretty.big_list "theorems:" (map prt_thms thmss) end;
wenzelm@8720
    95
wenzelm@9215
    96
  fun print sg data = Pretty.writeln (pretty sg data);
wenzelm@3987
    97
end;
wenzelm@3987
    98
wenzelm@5005
    99
structure TheoremsData = TheoryDataFun(TheoremsDataArgs);
wenzelm@5005
   100
val get_theorems_sg = TheoremsData.get_sg;
wenzelm@5005
   101
val get_theorems = TheoremsData.get;
wenzelm@5005
   102
wenzelm@6367
   103
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg;
wenzelm@6367
   104
wenzelm@3987
   105
wenzelm@5000
   106
(* print theory *)
wenzelm@3987
   107
wenzelm@5005
   108
val print_theorems = TheoremsData.print;
wenzelm@8720
   109
wenzelm@5000
   110
fun print_theory thy =
wenzelm@9215
   111
  Display.pretty_full_theory thy @
wenzelm@9215
   112
  [TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)]
wenzelm@8720
   113
  |> Pretty.chunks |> Pretty.writeln;
wenzelm@4022
   114
wenzelm@3987
   115
wenzelm@3987
   116
wenzelm@4022
   117
(** retrieve theorems **)
wenzelm@3987
   118
wenzelm@4783
   119
(* get_thms etc. *)
wenzelm@4037
   120
wenzelm@7485
   121
fun lookup_thms name thy =
wenzelm@7485
   122
  let val ref {space, thms_tab, ...} = get_theorems thy
wenzelm@7485
   123
  in Symtab.lookup (thms_tab, NameSpace.intern space name) end;
wenzelm@4922
   124
wenzelm@6091
   125
fun get_thms thy name =
wenzelm@4922
   126
  (case get_first (lookup_thms name) (thy :: Theory.ancestors_of thy) of
wenzelm@4590
   127
    None => raise THEORY ("Unknown theorem(s) " ^ quote name, [thy])
wenzelm@9007
   128
  | Some thms => map (Thm.transfer thy) thms);
wenzelm@3987
   129
wenzelm@6091
   130
fun get_thm thy name =
wenzelm@6091
   131
  (case get_thms thy name of
wenzelm@3987
   132
    [thm] => thm
wenzelm@4590
   133
  | _ => raise THEORY ("Single theorem expected " ^ quote name, [thy]));
wenzelm@4022
   134
wenzelm@6091
   135
fun get_thmss thy names = flat (map (get_thms thy) names);
wenzelm@4783
   136
wenzelm@4022
   137
wenzelm@4022
   138
(* thms_of *)
wenzelm@4022
   139
wenzelm@6091
   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@6091
   153
fun add_const_idx ((next, table), thm) =
wenzelm@4022
   154
  let
wenzelm@4022
   155
    val {hyps, prop, ...} = Thm.rep_thm thm;
wenzelm@4022
   156
    val consts =
wenzelm@7805
   157
      foldr add_term_consts (hyps, add_term_consts (prop, []));
wenzelm@4022
   158
wenzelm@4022
   159
    fun add (tab, c) =
wenzelm@6091
   160
      Symtab.update ((c, (next, thm) :: Symtab.lookup_multi (tab, c)), tab);
wenzelm@4022
   161
  in (next + 1, foldl add (table, consts)) end;
wenzelm@4022
   162
wenzelm@4022
   163
fun make_const_idx thm_tab =
wenzelm@5686
   164
  Symtab.foldl (fn (x, (_, ths)) => foldl add_const_idx (x, ths)) ((0, Symtab.empty), thm_tab);
wenzelm@4022
   165
wenzelm@4022
   166
wenzelm@4022
   167
(* lookup index *)
wenzelm@3987
   168
wenzelm@4022
   169
(*search locally*)
wenzelm@4022
   170
fun containing [] thy = thms_of thy
wenzelm@4022
   171
  | containing consts thy =
wenzelm@4022
   172
      let
wenzelm@4037
   173
        fun int ([], _) = []
wenzelm@4037
   174
          | int (_, []) = []
wenzelm@4037
   175
          | int (xxs as ((x as (i:int, _)) :: xs), yys as ((y as (j, _)) :: ys)) =
wenzelm@4037
   176
              if i = j then x :: int (xs, ys)
wenzelm@4037
   177
              else if i > j then int (xs, yys)
wenzelm@4037
   178
              else int (xxs, ys);
wenzelm@4022
   179
wenzelm@4037
   180
        fun ints [xs] = xs
wenzelm@4037
   181
          | ints xss = if exists null xss then [] else foldl int (hd xss, tl xss);
wenzelm@4022
   182
wenzelm@4022
   183
        val ref {const_idx = (_, ctab), ...} = get_theorems thy;
wenzelm@4022
   184
        val ithmss = map (fn c => Symtab.lookup_multi (ctab, c)) consts;
wenzelm@6977
   185
      in map (attach_name o snd) (ints ithmss) end;
wenzelm@4022
   186
wenzelm@4022
   187
(*search globally*)
wenzelm@4022
   188
fun thms_containing thy consts =
wenzelm@6977
   189
  (case filter (is_none o Sign.const_type (Theory.sign_of thy)) consts of
wenzelm@7805
   190
    [] => flat (map (containing consts) (thy :: Theory.ancestors_of thy))
wenzelm@6977
   191
  | cs => raise THEORY ("thms_containing: undeclared consts " ^ commas_quote cs, [thy]));
wenzelm@4022
   192
wenzelm@4022
   193
wenzelm@4022
   194
wenzelm@4022
   195
(** store theorems **)                    (*DESTRUCTIVE*)
wenzelm@3987
   196
wenzelm@4853
   197
(* naming *)
wenzelm@4853
   198
wenzelm@4853
   199
fun gen_names len name =
wenzelm@4853
   200
  map (fn i => name ^ "_" ^ string_of_int i) (1 upto len);
wenzelm@4853
   201
wenzelm@7470
   202
fun name_single name x = [(name, x)];
wenzelm@7470
   203
fun name_multi name xs = gen_names (length xs) name ~~ xs;
wenzelm@4853
   204
wenzelm@4853
   205
wenzelm@6091
   206
(* enter_thmx *)
wenzelm@4853
   207
wenzelm@7470
   208
fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name);
wenzelm@7470
   209
fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name);
wenzelm@3987
   210
wenzelm@7470
   211
fun enter_thmx _ app_name ("", thmx) = map #2 (app_name "" thmx)
wenzelm@7470
   212
  | enter_thmx sg app_name (bname, thmx) =
wenzelm@7470
   213
      let
wenzelm@7470
   214
        val name = Sign.full_name sg bname;
wenzelm@7470
   215
        val named_thms = map Thm.name_thm (app_name name thmx);
wenzelm@3987
   216
wenzelm@7470
   217
        val r as ref {space, thms_tab, const_idx} = get_theorems_sg sg;
wenzelm@4022
   218
wenzelm@7470
   219
        val overwrite =
wenzelm@7470
   220
          (case Symtab.lookup (thms_tab, name) of
wenzelm@7470
   221
            None => false
wenzelm@7470
   222
          | Some thms' =>
wenzelm@7470
   223
              if Library.equal_lists Thm.eq_thm (thms', named_thms) then (warn_same name; false)
wenzelm@7470
   224
              else (warn_overwrite name; true));
wenzelm@4022
   225
wenzelm@7470
   226
        val space' = NameSpace.extend (space, [name]);
wenzelm@7470
   227
        val thms_tab' = Symtab.update ((name, named_thms), thms_tab);
wenzelm@7470
   228
        val const_idx' =
wenzelm@7470
   229
          if overwrite then make_const_idx thms_tab'
wenzelm@7470
   230
          else foldl add_const_idx (const_idx, named_thms);
wenzelm@7470
   231
      in r := {space = space', thms_tab = thms_tab', const_idx = const_idx'}; named_thms end;
wenzelm@3987
   232
wenzelm@4853
   233
wenzelm@6091
   234
(* add_thms(s) *)
wenzelm@4853
   235
wenzelm@6091
   236
fun add_thmx app_name app_att ((bname, thmx), atts) thy =
wenzelm@5280
   237
  let
wenzelm@6091
   238
    val (thy', thmx') = app_att ((thy, thmx), atts);
wenzelm@6091
   239
    val thms'' = enter_thmx (Theory.sign_of thy') app_name (bname, thmx');
wenzelm@6091
   240
  in (thy', thms'') end;
wenzelm@4853
   241
wenzelm@8419
   242
fun add_thms args theory =
wenzelm@8419
   243
  (theory, args)
wenzelm@8419
   244
  |> foldl_map (fn (thy, arg) => add_thmx name_single Thm.apply_attributes arg thy)
wenzelm@8419
   245
  |> apsnd (map hd);
wenzelm@5907
   246
wenzelm@8419
   247
fun add_thmss args theory =
wenzelm@8419
   248
  (theory, args)
wenzelm@8419
   249
  |> foldl_map (fn (thy, arg) => add_thmx name_multi Thm.applys_attributes arg thy);
wenzelm@5907
   250
wenzelm@5907
   251
wenzelm@6091
   252
(* have_thmss *)
wenzelm@5907
   253
wenzelm@9192
   254
local
wenzelm@9192
   255
  fun have_thss kind_atts (thy, ((bname, more_atts), ths_atts)) =
wenzelm@9192
   256
    let
wenzelm@9192
   257
      fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts);
wenzelm@9192
   258
      val (thy', thmss') =
wenzelm@9192
   259
        foldl_map app (thy, map (fn (ths, atts) => (ths, atts @ more_atts @ kind_atts)) ths_atts);
wenzelm@9192
   260
      val thms' = flat thmss';
wenzelm@9192
   261
      val thms'' = enter_thmx (Theory.sign_of thy') name_multi (bname, thms');
wenzelm@9192
   262
    in (thy', (bname, thms'')) end;
wenzelm@9192
   263
in
wenzelm@9192
   264
  fun have_thmss kind_atts args thy = foldl_map (have_thss kind_atts) (thy, args);
wenzelm@9192
   265
end;
wenzelm@5280
   266
wenzelm@5280
   267
wenzelm@6091
   268
(* store_thm *)
wenzelm@5280
   269
wenzelm@6091
   270
fun store_thm th_atts thy =
wenzelm@6091
   271
  let val (thy', [th']) = add_thmx name_single Thm.apply_attributes th_atts thy
wenzelm@5280
   272
  in (thy', th') end;
wenzelm@3987
   273
wenzelm@3987
   274
wenzelm@7405
   275
(* smart_store_thms *)
wenzelm@3987
   276
wenzelm@7405
   277
fun smart_store_thms (name, []) = error ("Cannot store empty list of theorems: " ^ quote name)
wenzelm@7405
   278
  | smart_store_thms (name, [thm]) = enter_thmx (Thm.sign_of_thm thm) name_single (name, thm)
wenzelm@7405
   279
  | smart_store_thms (name, thms) =
wenzelm@7405
   280
      let
wenzelm@7405
   281
        val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm);
wenzelm@7405
   282
        val sg_ref = foldl merge_sg (Sign.self_ref (Thm.sign_of_thm (hd thms)), tl thms);
wenzelm@7405
   283
      in enter_thmx (Sign.deref sg_ref) name_multi (name, thms) end;
wenzelm@3987
   284
wenzelm@3987
   285
wenzelm@7899
   286
(* forall_elim_vars (belongs to drule.ML) *)
wenzelm@7899
   287
wenzelm@7899
   288
(*Replace outermost quantified variable by Var of given index.
wenzelm@7899
   289
    Could clash with Vars already present.*)
wenzelm@7899
   290
fun forall_elim_var i th =
wenzelm@7899
   291
    let val {prop,sign,...} = rep_thm th
wenzelm@7899
   292
    in case prop of
wenzelm@7899
   293
          Const("all",_) $ Abs(a,T,_) =>
wenzelm@7899
   294
              forall_elim (cterm_of sign (Var((a,i), T)))  th
wenzelm@7899
   295
        | _ => raise THM("forall_elim_var", i, [th])
wenzelm@7899
   296
    end;
wenzelm@7899
   297
wenzelm@7899
   298
(*Repeat forall_elim_var until all outer quantifiers are removed*)
wenzelm@7899
   299
fun forall_elim_vars i th =
wenzelm@7899
   300
    forall_elim_vars i (forall_elim_var i th)
wenzelm@7899
   301
        handle THM _ => th;
wenzelm@7899
   302
wenzelm@7899
   303
wenzelm@4022
   304
(* store axioms as theorems *)
wenzelm@4022
   305
wenzelm@4853
   306
local
wenzelm@7899
   307
  fun get_axs thy named_axs =
wenzelm@7899
   308
    map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs;
wenzelm@7753
   309
wenzelm@8419
   310
  fun add_single add (thy, ((name, ax), atts)) =
wenzelm@4853
   311
    let
wenzelm@7753
   312
      val named_ax = name_single name ax;
wenzelm@7753
   313
      val thy' = add named_ax thy;
wenzelm@7753
   314
      val thm = hd (get_axs thy' named_ax);
wenzelm@8419
   315
    in apsnd hd (add_thms [((name, thm), atts)] thy') end;
wenzelm@7753
   316
wenzelm@8419
   317
  fun add_multi add (thy, ((name, axs), atts)) =
wenzelm@7753
   318
    let
wenzelm@7753
   319
      val named_axs = name_multi name axs;
wenzelm@4853
   320
      val thy' = add named_axs thy;
wenzelm@7753
   321
      val thms = get_axs thy' named_axs;
wenzelm@8419
   322
    in apsnd hd (add_thmss [((name, thms), atts)] thy') end;
wenzelm@4022
   323
wenzelm@8419
   324
  fun add_singles add args thy = foldl_map (add_single add) (thy, args);
wenzelm@8419
   325
  fun add_multis add args thy = foldl_map (add_multi add) (thy, args);
wenzelm@4853
   326
in
wenzelm@7753
   327
  val add_axioms    = add_singles Theory.add_axioms;
wenzelm@7753
   328
  val add_axioms_i  = add_singles Theory.add_axioms_i;
wenzelm@7753
   329
  val add_axiomss   = add_multis Theory.add_axioms;
wenzelm@7753
   330
  val add_axiomss_i = add_multis Theory.add_axioms_i;
wenzelm@9318
   331
  val add_defs      = add_singles o Theory.add_defs;
wenzelm@9318
   332
  val add_defs_i    = add_singles o Theory.add_defs_i;
wenzelm@9318
   333
  val add_defss     = add_multis o Theory.add_defs;
wenzelm@9318
   334
  val add_defss_i   = add_multis o Theory.add_defs_i;
wenzelm@4853
   335
end;
wenzelm@4022
   336
wenzelm@4022
   337
wenzelm@3987
   338
wenzelm@4963
   339
(*** derived theory operations ***)
wenzelm@4963
   340
wenzelm@4963
   341
(** theory management **)
wenzelm@4963
   342
wenzelm@5005
   343
(* data kind 'Pure/theory_management' *)
wenzelm@4963
   344
wenzelm@5005
   345
structure TheoryManagementDataArgs =
wenzelm@5005
   346
struct
wenzelm@5005
   347
  val name = "Pure/theory_management";
wenzelm@6660
   348
  type T = {name: string, version: int};
wenzelm@5000
   349
wenzelm@6660
   350
  val empty = {name = "", version = 0};
wenzelm@6547
   351
  val copy = I;
wenzelm@5005
   352
  val prep_ext  = I;
wenzelm@5000
   353
  fun merge _ = empty;
wenzelm@5005
   354
  fun print _ _ = ();
wenzelm@4963
   355
end;
wenzelm@4963
   356
wenzelm@5005
   357
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs);
wenzelm@5005
   358
val get_info = TheoryManagementData.get;
wenzelm@5005
   359
val put_info = TheoryManagementData.put;
wenzelm@5005
   360
wenzelm@4963
   361
wenzelm@4963
   362
(* get / put name *)
wenzelm@4963
   363
wenzelm@5000
   364
val get_name = #name o get_info;
wenzelm@6660
   365
fun put_name name = put_info {name = name, version = 0};
wenzelm@4963
   366
wenzelm@4963
   367
wenzelm@4963
   368
(* control prefixing of theory name *)
wenzelm@4963
   369
wenzelm@5210
   370
val global_path = Theory.root_path;
wenzelm@4963
   371
wenzelm@4963
   372
fun local_path thy =
wenzelm@5210
   373
  thy |> Theory.root_path |> Theory.add_path (get_name thy);
wenzelm@4963
   374
wenzelm@4963
   375
wenzelm@4963
   376
(* begin / end theory *)
wenzelm@4963
   377
wenzelm@4963
   378
fun begin_theory name thys =
wenzelm@4963
   379
  Theory.prep_ext_merge thys
wenzelm@4963
   380
  |> put_name name
wenzelm@4963
   381
  |> local_path;
wenzelm@4963
   382
wenzelm@4963
   383
fun end_theory thy = Theory.add_name (get_name thy) thy;
wenzelm@4963
   384
wenzelm@6682
   385
fun checkpoint thy =
wenzelm@6682
   386
  if is_draft thy then
wenzelm@6682
   387
    let val {name, version} = get_info thy in
wenzelm@6682
   388
      thy
wenzelm@6682
   389
      |> Theory.add_name (name ^ ":" ^ string_of_int version)
wenzelm@6682
   390
      |> put_info {name = name, version = version + 1}
wenzelm@6682
   391
    end
wenzelm@6682
   392
  else thy;
wenzelm@5000
   393
wenzelm@5000
   394
wenzelm@4963
   395
wenzelm@4963
   396
(** add logical types **)
wenzelm@4922
   397
wenzelm@4922
   398
fun add_typedecls decls thy =
wenzelm@4922
   399
  let
wenzelm@4922
   400
    val full = Sign.full_name (Theory.sign_of thy);
wenzelm@4922
   401
wenzelm@4922
   402
    fun type_of (raw_name, vs, mx) =
wenzelm@4922
   403
      if null (duplicates vs) then (raw_name, length vs, mx)
wenzelm@4922
   404
      else error ("Duplicate parameters in type declaration: " ^ quote raw_name);
wenzelm@4922
   405
wenzelm@4922
   406
    fun arity_of (raw_name, len, mx) =
wenzelm@4922
   407
      (full (Syntax.type_name raw_name mx), replicate len logicS, logicS);
wenzelm@4922
   408
wenzelm@4922
   409
    val types = map type_of decls;
wenzelm@4922
   410
    val arities = map arity_of types;
wenzelm@4922
   411
  in
wenzelm@4922
   412
    thy
wenzelm@4922
   413
    |> Theory.add_types types
wenzelm@4922
   414
    |> Theory.add_arities_i arities
wenzelm@4922
   415
  end;
wenzelm@4922
   416
wenzelm@4922
   417
wenzelm@4922
   418
wenzelm@5091
   419
(*** the ProtoPure theory ***)
wenzelm@3987
   420
wenzelm@6560
   421
val dummy_patternN = "dummy_pattern";
wenzelm@6560
   422
wenzelm@3987
   423
val proto_pure =
wenzelm@3987
   424
  Theory.pre_pure
wenzelm@5907
   425
  |> Library.apply [TheoremsData.init, TheoryManagementData.init]
wenzelm@4963
   426
  |> put_name "ProtoPure"
wenzelm@4963
   427
  |> global_path
wenzelm@3987
   428
  |> Theory.add_types
wenzelm@4922
   429
   [("fun", 2, NoSyn),
wenzelm@4922
   430
    ("prop", 0, NoSyn),
wenzelm@4922
   431
    ("itself", 1, NoSyn),
wenzelm@4922
   432
    ("dummy", 0, NoSyn)]
wenzelm@3987
   433
  |> Theory.add_classes_i [(logicC, [])]
wenzelm@3987
   434
  |> Theory.add_defsort_i logicS
wenzelm@3987
   435
  |> Theory.add_arities_i
wenzelm@3987
   436
   [("fun", [logicS, logicS], logicS),
wenzelm@3987
   437
    ("prop", [], logicS),
wenzelm@3987
   438
    ("itself", [logicS], logicS)]
wenzelm@4922
   439
  |> Theory.add_nonterminals Syntax.pure_nonterms
wenzelm@3987
   440
  |> Theory.add_syntax Syntax.pure_syntax
wenzelm@6692
   441
  |> Theory.add_modesyntax (Symbol.symbolsN, true) Syntax.pure_sym_syntax
wenzelm@6692
   442
  |> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax
wenzelm@3987
   443
  |> Theory.add_trfuns Syntax.pure_trfuns
wenzelm@3987
   444
  |> Theory.add_trfunsT Syntax.pure_trfunsT
wenzelm@3987
   445
  |> Theory.add_syntax
wenzelm@7949
   446
   [("==>", "[prop, prop] => prop", Delimfix "op ==>"),
wenzelm@7949
   447
    (dummy_patternN, "aprop", Delimfix "'_")]
wenzelm@3987
   448
  |> Theory.add_consts
wenzelm@3987
   449
   [("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)),
wenzelm@3987
   450
    ("=?=", "['a::{}, 'a] => prop", InfixrName ("=?=", 2)),
wenzelm@3987
   451
    ("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@3987
   452
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@8039
   453
    ("Goal", "prop => prop", Mixfix ("GOAL _", [1000], 999)),
wenzelm@6547
   454
    ("TYPE", "'a itself", NoSyn),
wenzelm@6560
   455
    (dummy_patternN, "'a", Delimfix "'_")]
nipkow@5041
   456
  |> Theory.add_modesyntax ("", false)
wenzelm@8039
   457
    [("Goal", "prop => prop", Mixfix ("_", [0], 0))]
wenzelm@4963
   458
  |> local_path
wenzelm@9318
   459
  |> (#1 oo (add_defs false o map Thm.no_attributes))
wenzelm@4788
   460
   [("flexpair_def", "(t =?= u) == (t == u::'a::{})"),
wenzelm@4788
   461
    ("Goal_def", "GOAL (PROP A) == PROP A")]
wenzelm@9238
   462
  |> (#1 o add_thmss [(("nothing", []), [])])
wenzelm@4963
   463
  |> end_theory;
wenzelm@3987
   464
wenzelm@5091
   465
structure ProtoPure =
wenzelm@5091
   466
struct
wenzelm@5091
   467
  val thy = proto_pure;
wenzelm@5091
   468
  val flexpair_def = get_axiom thy "flexpair_def";
wenzelm@5091
   469
  val Goal_def = get_axiom thy "Goal_def";
wenzelm@5091
   470
end;
wenzelm@3987
   471
wenzelm@3987
   472
wenzelm@3987
   473
end;
wenzelm@3987
   474
wenzelm@3987
   475
wenzelm@4022
   476
structure BasicPureThy: BASIC_PURE_THY = PureThy;
wenzelm@4022
   477
open BasicPureThy;