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