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