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