src/Pure/pure_thy.ML
author wenzelm
Mon Oct 01 15:14:55 2007 +0200 (2007-10-01)
changeset 24793 cbe63f2193b6
parent 24770 695a8e087b9f
child 24817 636b23afee76
permissions -rw-r--r--
NameSelection: more interval checks;
wenzelm@3987
     1
(*  Title:      Pure/pure_thy.ML
wenzelm@3987
     2
    ID:         $Id$
wenzelm@3987
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@3987
     4
wenzelm@16441
     5
Theorem storage.  The ProtoPure theory.
wenzelm@3987
     6
*)
wenzelm@3987
     7
wenzelm@4022
     8
signature BASIC_PURE_THY =
wenzelm@4022
     9
sig
wenzelm@16493
    10
  datatype interval = FromTo of int * int | From of int | Single of int
wenzelm@18031
    11
  datatype thmref =
wenzelm@18031
    12
    Name of string |
wenzelm@18031
    13
    NameSelection of string * interval list |
wenzelm@18031
    14
    Fact of string
berghofe@15456
    15
  val get_thm: theory -> thmref -> thm
berghofe@15456
    16
  val get_thms: theory -> thmref -> thm list
berghofe@15456
    17
  val get_thmss: theory -> thmref list -> thm list
wenzelm@5091
    18
  structure ProtoPure:
wenzelm@5091
    19
    sig
wenzelm@5091
    20
      val thy: theory
wenzelm@18031
    21
      val prop_def: thm
wenzelm@19775
    22
      val term_def: thm
wenzelm@19125
    23
      val conjunction_def: thm
wenzelm@5091
    24
    end
wenzelm@4853
    25
end;
wenzelm@4022
    26
wenzelm@3987
    27
signature PURE_THY =
wenzelm@3987
    28
sig
wenzelm@4022
    29
  include BASIC_PURE_THY
wenzelm@23657
    30
  val tag_rule: Markup.property -> thm -> thm
wenzelm@18801
    31
  val untag_rule: string -> thm -> thm
wenzelm@23657
    32
  val tag: Markup.property -> attribute
wenzelm@18801
    33
  val untag: string -> attribute
wenzelm@21964
    34
  val has_name_hint: thm -> bool
wenzelm@21646
    35
  val get_name_hint: thm -> string
wenzelm@21646
    36
  val put_name_hint: string -> thm -> thm
wenzelm@22251
    37
  val has_kind: thm -> bool
wenzelm@18801
    38
  val get_kind: thm -> string
wenzelm@18801
    39
  val kind_rule: string -> thm -> thm
wenzelm@18801
    40
  val kind: string -> attribute
wenzelm@18801
    41
  val kind_internal: attribute
wenzelm@23657
    42
  val has_internal: Markup.property list -> bool
wenzelm@18801
    43
  val is_internal: thm -> bool
wenzelm@16023
    44
  val string_of_thmref: thmref -> string
berghofe@15456
    45
  val get_thm_closure: theory -> thmref -> thm
berghofe@15456
    46
  val get_thms_closure: theory -> thmref -> thm list
wenzelm@9564
    47
  val single_thm: string -> thm list -> thm
wenzelm@16493
    48
  val name_of_thmref: thmref -> string
wenzelm@16493
    49
  val map_name_of_thmref: (string -> string) -> thmref -> thmref
berghofe@15456
    50
  val select_thm: thmref -> thm list -> thm list
wenzelm@16023
    51
  val selections: string * thm list -> (thmref * thm) list
wenzelm@17162
    52
  val theorems_of: theory -> thm list NameSpace.table
wenzelm@16023
    53
  val fact_index_of: theory -> FactIndex.T
wenzelm@16023
    54
  val valid_thms: theory -> thmref * thm list -> bool
wenzelm@16023
    55
  val thms_containing: theory -> FactIndex.spec -> (string * thm list) list
nipkow@13646
    56
  val thms_containing_consts: theory -> string list -> (string * thm) list
wenzelm@16336
    57
  val thms_of: theory -> (string * thm) list
wenzelm@16336
    58
  val all_thms_of: theory -> (string * thm) list
wenzelm@12695
    59
  val hide_thms: bool -> string list -> theory -> theory
wenzelm@21580
    60
  val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
wenzelm@21567
    61
  val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
wenzelm@21580
    62
  val burrow_facts: ('a list -> 'b list) ->
wenzelm@21580
    63
    ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
wenzelm@21580
    64
  val name_multi: string -> 'a list -> (string * 'a) list
wenzelm@21646
    65
  val name_thm: bool -> bool -> string -> thm -> thm
wenzelm@21646
    66
  val name_thms: bool -> bool -> string -> thm list -> thm list
wenzelm@21646
    67
  val name_thmss: bool -> string -> (thm list * 'a) list -> (thm list * 'a) list
wenzelm@18728
    68
  val store_thm: (bstring * thm) * attribute list -> theory -> thm * theory
wenzelm@7405
    69
  val smart_store_thms: (bstring * thm list) -> thm list
wenzelm@12138
    70
  val smart_store_thms_open: (bstring * thm list) -> thm list
wenzelm@7899
    71
  val forall_elim_var: int -> thm -> thm
wenzelm@7899
    72
  val forall_elim_vars: int -> thm -> thm
wenzelm@18728
    73
  val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory
wenzelm@18728
    74
  val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory 
wenzelm@18801
    75
  val note_thmss: string -> ((bstring * attribute list) *
wenzelm@18728
    76
    (thmref * attribute list) list) list -> theory -> (bstring * thm list) list * theory
wenzelm@18801
    77
  val note_thmss_i: string -> ((bstring * attribute list) *
wenzelm@18801
    78
    (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
wenzelm@18801
    79
  val note_thmss_qualified: string -> string -> ((bstring * attribute list) *
wenzelm@18728
    80
    (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
wenzelm@18728
    81
  val add_axioms: ((bstring * string) * attribute list) list -> theory -> thm list * theory
wenzelm@18728
    82
  val add_axioms_i: ((bstring * term) * attribute list) list -> theory -> thm list * theory
wenzelm@18728
    83
  val add_axiomss: ((bstring * string list) * attribute list) list ->
wenzelm@18728
    84
    theory -> thm list list * theory
wenzelm@18728
    85
  val add_axiomss_i: ((bstring * term list) * attribute list) list ->
wenzelm@18728
    86
    theory -> thm list list * theory
haftmann@24434
    87
  val simple_def: bstring * attribute list ->
haftmann@24434
    88
    ((bstring * typ * mixfix) * term list) * term -> theory -> (string * thm) * theory
wenzelm@18728
    89
  val add_defs: bool -> ((bstring * string) * attribute list) list ->
haftmann@18377
    90
    theory -> thm list * theory
wenzelm@18728
    91
  val add_defs_i: bool -> ((bstring * term) * attribute list) list ->
haftmann@18377
    92
    theory -> thm list * theory
wenzelm@19629
    93
  val add_defs_unchecked: bool -> ((bstring * string) * attribute list) list ->
wenzelm@19629
    94
    theory -> thm list * theory
wenzelm@19629
    95
  val add_defs_unchecked_i: bool -> ((bstring * term) * attribute list) list ->
wenzelm@19629
    96
    theory -> thm list * theory
wenzelm@18728
    97
  val add_defss: bool -> ((bstring * string list) * attribute list) list ->
haftmann@18377
    98
    theory -> thm list list * theory
wenzelm@18728
    99
  val add_defss_i: bool -> ((bstring * term list) * attribute list) list ->
haftmann@18358
   100
    theory -> thm list list * theory
wenzelm@24243
   101
  val appl_syntax: (string * typ * mixfix) list
wenzelm@24243
   102
  val applC_syntax: (string * typ * mixfix) list
wenzelm@3987
   103
end;
wenzelm@3987
   104
wenzelm@3987
   105
structure PureThy: PURE_THY =
wenzelm@3987
   106
struct
wenzelm@3987
   107
wenzelm@3987
   108
wenzelm@18801
   109
(*** theorem tags ***)
wenzelm@18801
   110
wenzelm@18801
   111
(* add / delete tags *)
wenzelm@18801
   112
wenzelm@21646
   113
fun tag_rule tg = Thm.map_tags (insert (op =) tg);
wenzelm@21646
   114
fun untag_rule s = Thm.map_tags (filter_out (fn (s', _) => s = s'));
wenzelm@18801
   115
wenzelm@18801
   116
fun tag tg x = Thm.rule_attribute (K (tag_rule tg)) x;
wenzelm@18801
   117
fun untag s x = Thm.rule_attribute (K (untag_rule s)) x;
wenzelm@18801
   118
wenzelm@18801
   119
wenzelm@21646
   120
(* unofficial theorem names *)
wenzelm@21646
   121
wenzelm@23657
   122
fun the_name_hint thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.nameN);
wenzelm@22251
   123
wenzelm@22251
   124
val has_name_hint = can the_name_hint;
wenzelm@22251
   125
val get_name_hint = the_default "??.unknown" o try the_name_hint;
wenzelm@21646
   126
wenzelm@23657
   127
fun put_name_hint name = untag_rule Markup.nameN #> tag_rule (Markup.nameN, name);
wenzelm@21964
   128
wenzelm@21646
   129
wenzelm@18801
   130
(* theorem kinds *)
wenzelm@18801
   131
wenzelm@23657
   132
fun the_kind thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.kindN);
wenzelm@22251
   133
wenzelm@22251
   134
val has_kind = can the_kind;
wenzelm@22251
   135
val get_kind = the_default "??.unknown" o try the_kind;
wenzelm@18801
   136
wenzelm@23657
   137
fun kind_rule k = tag_rule (Markup.kindN, k) o untag_rule Markup.kindN;
wenzelm@18801
   138
fun kind k x = if k = "" then x else Thm.rule_attribute (K (kind_rule k)) x;
wenzelm@22363
   139
fun kind_internal x = kind Thm.internalK x;
wenzelm@23657
   140
fun has_internal tags = exists (fn tg => tg = (Markup.kindN, Thm.internalK)) tags;
wenzelm@21646
   141
val is_internal = has_internal o Thm.get_tags;
wenzelm@18801
   142
wenzelm@18801
   143
wenzelm@18801
   144
wenzelm@4922
   145
(*** theorem database ***)
wenzelm@3987
   146
wenzelm@16441
   147
(** dataype theorems **)
wenzelm@3987
   148
wenzelm@16441
   149
structure TheoremsData = TheoryDataFun
wenzelm@24713
   150
(
wenzelm@5005
   151
  type T =
wenzelm@16441
   152
   {theorems: thm list NameSpace.table,
wenzelm@16441
   153
    index: FactIndex.T} ref;
wenzelm@3987
   154
wenzelm@4853
   155
  fun mk_empty _ =
wenzelm@16336
   156
    ref {theorems = NameSpace.empty_table, index = FactIndex.empty}: T;
wenzelm@3987
   157
wenzelm@5005
   158
  val empty = mk_empty ();
wenzelm@6547
   159
  fun copy (ref x) = ref x;
wenzelm@16441
   160
  val extend = mk_empty;
wenzelm@16441
   161
  fun merge _ = mk_empty;
wenzelm@24713
   162
);
wenzelm@3987
   163
wenzelm@16493
   164
val get_theorems_ref = TheoremsData.get;
wenzelm@16493
   165
val get_theorems = ! o get_theorems_ref;
wenzelm@17162
   166
val theorems_of = #theorems o get_theorems;
wenzelm@16493
   167
val fact_index_of = #index o get_theorems;
wenzelm@16023
   168
wenzelm@6367
   169
wenzelm@3987
   170
wenzelm@4022
   171
(** retrieve theorems **)
wenzelm@3987
   172
skalberg@15531
   173
fun the_thms _ (SOME thms) = thms
skalberg@15531
   174
  | the_thms name NONE = error ("Unknown theorem(s) " ^ quote name);
wenzelm@4037
   175
wenzelm@9564
   176
fun single_thm _ [thm] = thm
wenzelm@9564
   177
  | single_thm name _ = error ("Single theorem expected " ^ quote name);
wenzelm@9564
   178
wenzelm@15703
   179
wenzelm@16023
   180
(* datatype interval *)
wenzelm@15703
   181
wenzelm@15703
   182
datatype interval =
wenzelm@15703
   183
  FromTo of int * int |
wenzelm@15703
   184
  From of int |
wenzelm@15703
   185
  Single of int;
wenzelm@15703
   186
wenzelm@16023
   187
fun string_of_interval (FromTo (i, j)) = string_of_int i ^ "-" ^ string_of_int j
wenzelm@16023
   188
  | string_of_interval (From i) = string_of_int i ^ "-"
wenzelm@16023
   189
  | string_of_interval (Single i) = string_of_int i;
wenzelm@16023
   190
wenzelm@24793
   191
fun interval n iv =
wenzelm@24793
   192
  let fun err () = raise Fail ("Bad interval specification " ^ string_of_interval iv) in
wenzelm@24793
   193
    (case iv of
wenzelm@24793
   194
      FromTo (i, j) => if i <= j then i upto j else err ()
wenzelm@24793
   195
    | From i => if i <= n then i upto n else err ()
wenzelm@24793
   196
    | Single i => [i])
wenzelm@24793
   197
  end;
wenzelm@24793
   198
wenzelm@16023
   199
wenzelm@16493
   200
(* datatype thmref *)
wenzelm@16493
   201
wenzelm@16493
   202
datatype thmref =
wenzelm@16493
   203
  Name of string |
wenzelm@18031
   204
  NameSelection of string * interval list |
wenzelm@18031
   205
  Fact of string;
wenzelm@15703
   206
wenzelm@16493
   207
fun name_of_thmref (Name name) = name
wenzelm@18031
   208
  | name_of_thmref (NameSelection (name, _)) = name
wenzelm@18678
   209
  | name_of_thmref (Fact _) = error "Illegal literal fact";
wenzelm@16023
   210
wenzelm@16493
   211
fun map_name_of_thmref f (Name name) = Name (f name)
wenzelm@18031
   212
  | map_name_of_thmref f (NameSelection (name, is)) = NameSelection (f name, is)
wenzelm@18031
   213
  | map_name_of_thmref _ thmref = thmref;
wenzelm@16493
   214
wenzelm@16493
   215
fun string_of_thmref (Name name) = name
wenzelm@16493
   216
  | string_of_thmref (NameSelection (name, is)) =
wenzelm@18031
   217
      name ^ enclose "(" ")" (commas (map string_of_interval is))
wenzelm@18678
   218
  | string_of_thmref (Fact _) = error "Illegal literal fact";
wenzelm@16023
   219
wenzelm@16023
   220
wenzelm@16023
   221
(* select_thm *)
wenzelm@15703
   222
wenzelm@16493
   223
fun select_thm (Name _) thms = thms
wenzelm@18031
   224
  | select_thm (Fact _) thms = thms
wenzelm@24793
   225
  | select_thm (NameSelection (name, ivs)) thms =
wenzelm@16023
   226
      let
wenzelm@16023
   227
        val n = length thms;
wenzelm@24793
   228
        fun err msg = error (msg ^ " for " ^ quote name ^ " (length " ^ string_of_int n ^ ")");
wenzelm@16023
   229
        fun select i =
wenzelm@24793
   230
          if i < 1 orelse i > n then err ("Bad subscript " ^ string_of_int i)
wenzelm@24793
   231
          else nth thms (i - 1);
wenzelm@24793
   232
        val is = maps (interval n) ivs handle Fail msg => err msg;
wenzelm@24793
   233
      in map select is end;
wenzelm@15703
   234
wenzelm@16023
   235
wenzelm@16023
   236
(* selections *)
wenzelm@16023
   237
wenzelm@16493
   238
fun selections (name, [thm]) = [(Name name, thm)]
wenzelm@16023
   239
  | selections (name, thms) = (1 upto length thms, thms) |> ListPair.map (fn (i, thm) =>
wenzelm@16493
   240
      (NameSelection (name, [Single i]), thm));
berghofe@15456
   241
wenzelm@9564
   242
wenzelm@9808
   243
(* get_thm(s)_closure -- statically scoped versions *)
wenzelm@9564
   244
wenzelm@9564
   245
(*beware of proper order of evaluation!*)
wenzelm@4922
   246
wenzelm@9564
   247
fun lookup_thms thy =
wenzelm@9564
   248
  let
wenzelm@16493
   249
    val (space, thms) = #theorems (get_theorems thy);
wenzelm@24137
   250
    val thy_ref = Theory.check_thy thy;
wenzelm@9564
   251
  in
wenzelm@9564
   252
    fn name =>
wenzelm@17221
   253
      Option.map (map (Thm.transfer (Theory.deref thy_ref)))     (*dynamic identity*)
wenzelm@17418
   254
      (Symtab.lookup thms (NameSpace.intern space name)) (*static content*)
wenzelm@9564
   255
  end;
wenzelm@3987
   256
wenzelm@9564
   257
fun get_thms_closure thy =
wenzelm@16441
   258
  let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) in
wenzelm@16493
   259
    fn thmref =>
wenzelm@18031
   260
      let val name = name_of_thmref thmref;
wenzelm@16493
   261
      in select_thm thmref (the_thms name (get_first (fn f => f name) closures)) end
berghofe@15456
   262
  end;
wenzelm@9564
   263
wenzelm@9808
   264
fun get_thm_closure thy =
wenzelm@9808
   265
  let val get = get_thms_closure thy
wenzelm@16493
   266
  in fn thmref => single_thm (name_of_thmref thmref) (get thmref) end;
wenzelm@9808
   267
wenzelm@9564
   268
wenzelm@16441
   269
(* get_thms etc. *)
wenzelm@9564
   270
wenzelm@16493
   271
fun get_thms theory thmref =
wenzelm@16493
   272
  let val name = name_of_thmref thmref in
wenzelm@16493
   273
    get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory)
wenzelm@16493
   274
    |> the_thms name |> select_thm thmref |> map (Thm.transfer theory)
wenzelm@16493
   275
  end;
wenzelm@4022
   276
wenzelm@19482
   277
fun get_thmss thy thmrefs = maps (get_thms thy) thmrefs;
wenzelm@16493
   278
fun get_thm thy thmref = single_thm (name_of_thmref thmref) (get_thms thy thmref);
wenzelm@4783
   279
wenzelm@4022
   280
wenzelm@16023
   281
(* thms_containing etc. *)
wenzelm@4022
   282
wenzelm@16023
   283
fun valid_thms thy (thmref, ths) =
wenzelm@18678
   284
  (case try (get_thms thy) thmref of
wenzelm@16023
   285
    NONE => false
wenzelm@16132
   286
  | SOME ths' => Thm.eq_thms (ths, ths'));
wenzelm@3987
   287
wenzelm@16023
   288
fun thms_containing theory spec =
wenzelm@16023
   289
  (theory :: Theory.ancestors_of theory)
wenzelm@19482
   290
  |> maps (fn thy =>
wenzelm@16023
   291
      FactIndex.find (fact_index_of thy) spec
wenzelm@16493
   292
      |> List.filter (fn (name, ths) => valid_thms theory (Name name, ths))
wenzelm@19482
   293
      |> distinct (eq_fst (op =)));
wenzelm@4022
   294
nipkow@13646
   295
fun thms_containing_consts thy consts =
wenzelm@19482
   296
  thms_containing thy (consts, []) |> maps #2
wenzelm@21646
   297
  |> map (`(get_name_hint));
nipkow@13646
   298
kleing@15882
   299
wenzelm@16336
   300
(* thms_of etc. *)
kleing@15882
   301
wenzelm@16023
   302
fun thms_of thy =
wenzelm@17162
   303
  let val thms = #2 (theorems_of thy)
wenzelm@21646
   304
  in map (`(get_name_hint)) (maps snd (Symtab.dest thms)) end;
wenzelm@15703
   305
wenzelm@19482
   306
fun all_thms_of thy = maps thms_of (thy :: Theory.ancestors_of thy);
wenzelm@16336
   307
wenzelm@4022
   308
wenzelm@4022
   309
wenzelm@4022
   310
(** store theorems **)                    (*DESTRUCTIVE*)
wenzelm@3987
   311
wenzelm@16441
   312
(* hiding -- affects current theory node only *)
wenzelm@12695
   313
wenzelm@23933
   314
fun hide_thms fully names thy = CRITICAL (fn () =>
wenzelm@12695
   315
  let
wenzelm@16493
   316
    val r as ref {theorems = (space, thms), index} = get_theorems_ref thy;
wenzelm@16132
   317
    val space' = fold (NameSpace.hide fully) names space;
wenzelm@23933
   318
  in r := {theorems = (space', thms), index = index}; thy end);
wenzelm@12695
   319
wenzelm@12695
   320
wenzelm@21580
   321
(* fact specifications *)
wenzelm@21580
   322
wenzelm@21580
   323
fun map_facts f = map (apsnd (map (apfst (map f))));
wenzelm@21580
   324
fun burrow_fact f = split_list #>> burrow f #> op ~~;
wenzelm@21580
   325
fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
wenzelm@21580
   326
wenzelm@21580
   327
wenzelm@4853
   328
(* naming *)
wenzelm@4853
   329
wenzelm@18614
   330
fun gen_names _ len "" = replicate len ""
wenzelm@18614
   331
  | gen_names j len name = map (fn i => name ^ "_" ^ string_of_int i) (j + 1 upto j + len);
wenzelm@4853
   332
wenzelm@18801
   333
fun name_multi name [x] = [(name, x)]
wenzelm@18801
   334
  | name_multi name xs = gen_names 0 (length xs) name ~~ xs;
berghofe@12235
   335
wenzelm@21646
   336
fun name_thm pre official name thm = thm
wenzelm@21646
   337
  |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
wenzelm@21964
   338
  |> (if has_name_hint thm andalso pre orelse name = "" then I else put_name_hint name);
berghofe@12872
   339
wenzelm@21646
   340
fun name_thms pre official name xs =
wenzelm@21646
   341
  map (uncurry (name_thm pre official)) (name_multi name xs);
berghofe@12235
   342
wenzelm@21646
   343
fun name_thmss official name fact =
wenzelm@21646
   344
  burrow_fact (name_thms true official name) fact;
wenzelm@4853
   345
wenzelm@4853
   346
berghofe@11998
   347
(* enter_thms *)
wenzelm@4853
   348
wenzelm@7470
   349
fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name);
wenzelm@7470
   350
fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name);
wenzelm@3987
   351
haftmann@18418
   352
fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) |> swap
wenzelm@23933
   353
  | enter_thms pre_name post_name app_att (bname, thms) thy = CRITICAL (fn () =>
wenzelm@7470
   354
      let
wenzelm@16441
   355
        val name = Sign.full_name thy bname;
wenzelm@16441
   356
        val (thy', thms') = apsnd (post_name name) (app_att (thy, pre_name name thms));
wenzelm@16513
   357
        val r as ref {theorems = (space, theorems), index} = get_theorems_ref thy';
wenzelm@16513
   358
        val space' = Sign.declare_name thy' name space;
wenzelm@17418
   359
        val theorems' = Symtab.update (name, thms') theorems;
wenzelm@18031
   360
        val index' = FactIndex.add_global (name, thms') index;
wenzelm@13274
   361
      in
wenzelm@17418
   362
        (case Symtab.lookup theorems name of
skalberg@15531
   363
          NONE => ()
wenzelm@16441
   364
        | SOME thms'' =>
wenzelm@16441
   365
            if Thm.eq_thms (thms', thms'') then warn_same name
wenzelm@13274
   366
            else warn_overwrite name);
wenzelm@16336
   367
        r := {theorems = (space', theorems'), index = index'};
haftmann@18418
   368
        (thms', thy')
wenzelm@23933
   369
      end);
wenzelm@3987
   370
wenzelm@16023
   371
wenzelm@6091
   372
(* add_thms(s) *)
wenzelm@4853
   373
wenzelm@16441
   374
fun add_thms_atts pre_name ((bname, thms), atts) =
wenzelm@21646
   375
  enter_thms pre_name (name_thms false true)
wenzelm@21646
   376
    (foldl_map (Thm.theory_attributes atts)) (bname, thms);
wenzelm@4853
   377
haftmann@18377
   378
fun gen_add_thmss pre_name =
haftmann@18377
   379
  fold_map (add_thms_atts pre_name);
wenzelm@5907
   380
berghofe@12235
   381
fun gen_add_thms pre_name args =
haftmann@18377
   382
  apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
berghofe@12235
   383
wenzelm@21646
   384
val add_thmss = gen_add_thmss (name_thms true true);
wenzelm@21646
   385
val add_thms = gen_add_thms (name_thms true true);
wenzelm@5907
   386
wenzelm@5907
   387
wenzelm@14564
   388
(* note_thmss(_i) *)
wenzelm@5907
   389
wenzelm@9192
   390
local
wenzelm@12711
   391
wenzelm@18801
   392
fun gen_note_thmss get k = fold_map (fn ((bname, more_atts), ths_atts) => fn thy =>
wenzelm@12711
   393
  let
wenzelm@18728
   394
    fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
haftmann@18418
   395
    val (thms, thy') = thy |> enter_thms
wenzelm@21646
   396
      (name_thmss true) (name_thms false true) (apsnd flat o foldl_map app)
wenzelm@18801
   397
      (bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind k])) ths_atts);
wenzelm@18801
   398
  in ((bname, thms), thy') end);
wenzelm@12711
   399
wenzelm@9192
   400
in
wenzelm@12711
   401
haftmann@18418
   402
val note_thmss = gen_note_thmss get_thms;
haftmann@18418
   403
val note_thmss_i = gen_note_thmss (K I);
wenzelm@12711
   404
wenzelm@21438
   405
end;
wenzelm@21438
   406
wenzelm@18801
   407
fun note_thmss_qualified k path facts thy =
wenzelm@18801
   408
  thy
wenzelm@22796
   409
  |> Sign.add_path path
wenzelm@22796
   410
  |> Sign.no_base_names
wenzelm@18801
   411
  |> note_thmss_i k facts
wenzelm@22796
   412
  ||> Sign.restore_naming thy;
wenzelm@18801
   413
wenzelm@5280
   414
wenzelm@6091
   415
(* store_thm *)
wenzelm@5280
   416
berghofe@11998
   417
fun store_thm ((bname, thm), atts) thy =
wenzelm@21646
   418
  let val ([th'], thy') = add_thms_atts (name_thms true true) ((bname, [thm]), atts) thy
haftmann@18358
   419
  in (th', thy') end;
wenzelm@3987
   420
wenzelm@3987
   421
wenzelm@16441
   422
(* smart_store_thms(_open) *)
wenzelm@3987
   423
wenzelm@16441
   424
local
wenzelm@16441
   425
wenzelm@16441
   426
fun smart_store _ (name, []) =
berghofe@11516
   427
      error ("Cannot store empty list of theorems: " ^ quote name)
wenzelm@21646
   428
  | smart_store official (name, [thm]) =
wenzelm@21646
   429
      fst (enter_thms (name_thms true official) (name_thms false official) I (name, [thm])
wenzelm@21646
   430
        (Thm.theory_of_thm thm))
wenzelm@21646
   431
  | smart_store official (name, thms) =
wenzelm@21646
   432
      let val thy = Theory.merge_list (map Thm.theory_of_thm thms) in
wenzelm@21646
   433
        fst (enter_thms (name_thms true official) (name_thms false official) I (name, thms) thy)
wenzelm@21646
   434
      end;
berghofe@11516
   435
wenzelm@16441
   436
in
wenzelm@16441
   437
wenzelm@21646
   438
val smart_store_thms = smart_store true;
wenzelm@21646
   439
val smart_store_thms_open = smart_store false;
wenzelm@16441
   440
wenzelm@16441
   441
end;
wenzelm@3987
   442
wenzelm@3987
   443
wenzelm@16722
   444
(* forall_elim_var(s) -- belongs to drule.ML *)
wenzelm@7899
   445
wenzelm@16722
   446
fun forall_elim_vars_aux strip_vars i th =
wenzelm@16722
   447
  let
wenzelm@16722
   448
    val {thy, tpairs, prop, ...} = Thm.rep_thm th;
haftmann@16787
   449
    val add_used = Term.fold_aterms
haftmann@20853
   450
      (fn Var ((x, j), _) => if i = j then insert (op =) x else I | _ => I);
wenzelm@16722
   451
    val used = fold (fn (t, u) => add_used t o add_used u) tpairs (add_used prop []);
wenzelm@16722
   452
    val vars = strip_vars prop;
wenzelm@20071
   453
    val cvars = (Name.variant_list used (map #1 vars), vars)
wenzelm@16722
   454
      |> ListPair.map (fn (x, (_, T)) => Thm.cterm_of thy (Var ((x, i), T)));
wenzelm@16722
   455
  in fold Thm.forall_elim cvars th end;
wenzelm@7899
   456
wenzelm@16722
   457
val forall_elim_vars = forall_elim_vars_aux Term.strip_all_vars;
wenzelm@16722
   458
wenzelm@16722
   459
fun forall_elim_var i th = forall_elim_vars_aux
wenzelm@16722
   460
  (fn Const ("all", _) $ Abs (a, T, _) => [(a, T)]
wenzelm@16722
   461
  | _ => raise THM ("forall_elim_vars", i, [th])) i th;
wenzelm@7899
   462
wenzelm@7899
   463
wenzelm@4022
   464
(* store axioms as theorems *)
wenzelm@4022
   465
wenzelm@4853
   466
local
wenzelm@17418
   467
  fun get_ax thy (name, _) = Thm.get_axiom_i thy (Sign.full_name thy name);
wenzelm@17418
   468
  fun get_axs thy named_axs = map (forall_elim_vars 0 o get_ax thy) named_axs;
haftmann@18377
   469
  fun add_single add ((name, ax), atts) thy =
wenzelm@4853
   470
    let
berghofe@11998
   471
      val named_ax = [(name, ax)];
wenzelm@7753
   472
      val thy' = add named_ax thy;
wenzelm@7753
   473
      val thm = hd (get_axs thy' named_ax);
haftmann@18377
   474
    in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end;
haftmann@18377
   475
  fun add_multi add ((name, axs), atts) thy =
wenzelm@7753
   476
    let
wenzelm@7753
   477
      val named_axs = name_multi name axs;
wenzelm@4853
   478
      val thy' = add named_axs thy;
wenzelm@7753
   479
      val thms = get_axs thy' named_axs;
haftmann@18377
   480
    in apfst hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end;
haftmann@18377
   481
  fun add_singles add = fold_map (add_single add);
haftmann@18377
   482
  fun add_multis add = fold_map (add_multi add);
wenzelm@4853
   483
in
wenzelm@19629
   484
  val add_axioms           = add_singles Theory.add_axioms;
wenzelm@19629
   485
  val add_axioms_i         = add_singles Theory.add_axioms_i;
wenzelm@19629
   486
  val add_axiomss          = add_multis Theory.add_axioms;
wenzelm@19629
   487
  val add_axiomss_i        = add_multis Theory.add_axioms_i;
wenzelm@22796
   488
  val add_defs             = add_singles o Theory.add_defs false;
wenzelm@22796
   489
  val add_defs_i           = add_singles o Theory.add_defs_i false;
wenzelm@22796
   490
  val add_defs_unchecked   = add_singles o Theory.add_defs true;
wenzelm@22796
   491
  val add_defs_unchecked_i = add_singles o Theory.add_defs_i true;
wenzelm@22796
   492
  val add_defss            = add_multis o Theory.add_defs false;
wenzelm@22796
   493
  val add_defss_i          = add_multis o Theory.add_defs_i false;
wenzelm@4853
   494
end;
wenzelm@4022
   495
wenzelm@4022
   496
haftmann@24434
   497
(* simple interface for simple definitions *)
haftmann@24434
   498
haftmann@24434
   499
fun simple_def (raw_name, atts) (((raw_c, ty, syn), ts), t) thy =
haftmann@24434
   500
  let
haftmann@24434
   501
    val c = Sign.full_name thy raw_c;
haftmann@24434
   502
    val name = if raw_name = "" then Thm.def_name raw_c else raw_name;
haftmann@24434
   503
    val def = Logic.mk_equals (list_comb (Const (c, ty), ts), t);
haftmann@24434
   504
  in
haftmann@24434
   505
    thy
wenzelm@24770
   506
    |> Sign.add_consts_authentic [] [(raw_c, ty, syn)]
haftmann@24434
   507
    |> add_defs_i false [((name, def), atts)]
haftmann@24434
   508
    |-> (fn [thm] => pair (c, thm))
haftmann@24434
   509
  end;
haftmann@24434
   510
haftmann@24434
   511
wenzelm@3987
   512
wenzelm@5091
   513
(*** the ProtoPure theory ***)
wenzelm@3987
   514
wenzelm@24243
   515
val typ = SimpleSyntax.read_typ;
wenzelm@24243
   516
val term = SimpleSyntax.read_term;
wenzelm@24243
   517
val prop = SimpleSyntax.read_prop;
wenzelm@24243
   518
wenzelm@24243
   519
val appl_syntax =
wenzelm@24243
   520
 [("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
wenzelm@24243
   521
  ("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
wenzelm@24243
   522
wenzelm@24243
   523
val applC_syntax =
wenzelm@24243
   524
 [("",       typ "'a => cargs",                  Delimfix "_"),
wenzelm@24243
   525
  ("_cargs", typ "'a => cargs => cargs",         Mixfix ("_/ _", [1000, 1000], 1000)),
wenzelm@24243
   526
  ("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
wenzelm@24243
   527
  ("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
wenzelm@16441
   528
wenzelm@3987
   529
val proto_pure =
wenzelm@16493
   530
  Context.pre_pure_thy
wenzelm@16987
   531
  |> Compress.init_data
wenzelm@16023
   532
  |> TheoremsData.init
wenzelm@22796
   533
  |> Sign.add_types
wenzelm@4922
   534
   [("fun", 2, NoSyn),
wenzelm@4922
   535
    ("prop", 0, NoSyn),
wenzelm@4922
   536
    ("itself", 1, NoSyn),
wenzelm@4922
   537
    ("dummy", 0, NoSyn)]
wenzelm@22796
   538
  |> Sign.add_nonterminals Syntax.basic_nonterms
wenzelm@24243
   539
  |> Sign.add_syntax_i
wenzelm@24243
   540
   [("_lambda",     typ "pttrns => 'a => logic",     Mixfix ("(3%_./ _)", [0, 3], 3)),
wenzelm@24243
   541
    ("_abs",        typ "'a",                        NoSyn),
wenzelm@24243
   542
    ("",            typ "'a => args",                Delimfix "_"),
wenzelm@24243
   543
    ("_args",       typ "'a => args => args",        Delimfix "_,/ _"),
wenzelm@24243
   544
    ("",            typ "id => idt",                 Delimfix "_"),
wenzelm@24243
   545
    ("_idtdummy",   typ "idt",                       Delimfix "'_"),
wenzelm@24243
   546
    ("_idtyp",      typ "id => type => idt",         Mixfix ("_::_", [], 0)),
wenzelm@24243
   547
    ("_idtypdummy", typ "type => idt",               Mixfix ("'_()::_", [], 0)),
wenzelm@24243
   548
    ("",            typ "idt => idt",                Delimfix "'(_')"),
wenzelm@24243
   549
    ("",            typ "idt => idts",               Delimfix "_"),
wenzelm@24243
   550
    ("_idts",       typ "idt => idts => idts",       Mixfix ("_/ _", [1, 0], 0)),
wenzelm@24243
   551
    ("",            typ "idt => pttrn",              Delimfix "_"),
wenzelm@24243
   552
    ("",            typ "pttrn => pttrns",           Delimfix "_"),
wenzelm@24243
   553
    ("_pttrns",     typ "pttrn => pttrns => pttrns", Mixfix ("_/ _", [1, 0], 0)),
wenzelm@24243
   554
    ("",            typ "id => aprop",               Delimfix "_"),
wenzelm@24243
   555
    ("",            typ "longid => aprop",           Delimfix "_"),
wenzelm@24243
   556
    ("",            typ "var => aprop",              Delimfix "_"),
wenzelm@24243
   557
    ("_DDDOT",      typ "aprop",                     Delimfix "..."),
wenzelm@24243
   558
    ("_aprop",      typ "aprop => prop",             Delimfix "PROP _"),
wenzelm@24243
   559
    ("_asm",        typ "prop => asms",              Delimfix "_"),
wenzelm@24243
   560
    ("_asms",       typ "prop => asms => asms",      Delimfix "_;/ _"),
wenzelm@24243
   561
    ("_bigimpl",    typ "asms => prop => prop",      Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
wenzelm@24243
   562
    ("_ofclass",    typ "type => logic => prop",     Delimfix "(1OFCLASS/(1'(_,/ _')))"),
wenzelm@24243
   563
    ("_mk_ofclass", typ "dummy",                     NoSyn),
wenzelm@24243
   564
    ("_TYPE",       typ "type => logic",             Delimfix "(1TYPE/(1'(_')))"),
wenzelm@24243
   565
    ("",            typ "id => logic",               Delimfix "_"),
wenzelm@24243
   566
    ("",            typ "longid => logic",           Delimfix "_"),
wenzelm@24243
   567
    ("",            typ "var => logic",              Delimfix "_"),
wenzelm@24243
   568
    ("_DDDOT",      typ "logic",                     Delimfix "..."),
wenzelm@24243
   569
    ("_constify",   typ "num => num_const",          Delimfix "_"),
wenzelm@24243
   570
    ("_indexnum",   typ "num_const => index",        Delimfix "\\<^sub>_"),
wenzelm@24243
   571
    ("_index",      typ "logic => index",            Delimfix "(00\\<^bsub>_\\<^esub>)"),
wenzelm@24243
   572
    ("_indexdefault", typ "index",                   Delimfix ""),
wenzelm@24243
   573
    ("_indexvar",   typ "index",                     Delimfix "'\\<index>"),
wenzelm@24243
   574
    ("_struct",     typ "index => logic",            Mixfix ("\\<struct>_", [1000], 1000)),
wenzelm@24243
   575
    ("==>",         typ "prop => prop => prop",      Delimfix "op ==>"),
wenzelm@24243
   576
    (Term.dummy_patternN, typ "aprop",               Delimfix "'_")]
wenzelm@24243
   577
  |> Sign.add_syntax_i appl_syntax
wenzelm@24243
   578
  |> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
wenzelm@24243
   579
   [("fun",      typ "type => type => type",   Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
wenzelm@24243
   580
    ("_bracket", typ "types => type => type",  Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
wenzelm@24243
   581
    ("_ofsort",  typ "tid => sort => type",    Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
wenzelm@24243
   582
    ("_constrain", typ "'a => type => 'a",     Mixfix ("_\\<Colon>_", [4, 0], 3)),
wenzelm@24243
   583
    ("_idtyp",    typ "id => type => idt",     Mixfix ("_\\<Colon>_", [], 0)),
wenzelm@24243
   584
    ("_idtypdummy", typ "type => idt",         Mixfix ("'_()\\<Colon>_", [], 0)),
wenzelm@24243
   585
    ("_type_constraint_", typ "'a",            NoSyn),
wenzelm@24243
   586
    ("_lambda",  typ "pttrns => 'a => logic",  Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
wenzelm@24243
   587
    ("==",       typ "'a => 'a => prop",       InfixrName ("\\<equiv>", 2)),
wenzelm@24243
   588
    ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
wenzelm@24243
   589
    ("==>",      typ "prop => prop => prop",   InfixrName ("\\<Longrightarrow>", 1)),
wenzelm@24243
   590
    ("_DDDOT",   typ "aprop",                  Delimfix "\\<dots>"),
wenzelm@24243
   591
    ("_bigimpl", typ "asms => prop => prop",   Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
wenzelm@24243
   592
    ("_DDDOT",   typ "logic",                  Delimfix "\\<dots>")]
wenzelm@24243
   593
  |> Sign.add_modesyntax_i ("", false)
wenzelm@24243
   594
   [("prop", typ "prop => prop", Mixfix ("_", [0], 0)),
wenzelm@24243
   595
    ("ProtoPure.term", typ "'a => prop", Delimfix "TERM _"),
wenzelm@24243
   596
    ("ProtoPure.conjunction", typ "prop => prop => prop", InfixrName ("&&", 2))]
wenzelm@24243
   597
  |> Sign.add_modesyntax_i ("HTML", false)
wenzelm@24243
   598
   [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
wenzelm@24243
   599
  |> Sign.add_consts_i
wenzelm@24243
   600
   [("==", typ "'a => 'a => prop", InfixrName ("==", 2)),
wenzelm@24243
   601
    ("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@24243
   602
    ("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@24243
   603
    ("prop", typ "prop => prop", NoSyn),
wenzelm@24243
   604
    ("TYPE", typ "'a itself", NoSyn),
wenzelm@24243
   605
    (Term.dummy_patternN, typ "'a", Delimfix "'_")]
skalberg@14223
   606
  |> Theory.add_finals_i false
wenzelm@24243
   607
    [Const ("==", typ "'a => 'a => prop"),
wenzelm@24243
   608
     Const ("==>", typ "prop => prop => prop"),
wenzelm@24243
   609
     Const ("all", typ "('a => prop) => prop"),
wenzelm@24243
   610
     Const ("TYPE", typ "'a itself"),
wenzelm@24243
   611
     Const (Term.dummy_patternN, typ "'a")]
wenzelm@22796
   612
  |> Sign.add_trfuns Syntax.pure_trfuns
wenzelm@22796
   613
  |> Sign.add_trfunsT Syntax.pure_trfunsT
wenzelm@16441
   614
  |> Sign.local_path
wenzelm@24243
   615
  |> Sign.add_consts_i
wenzelm@24243
   616
   [("term", typ "'a => prop", NoSyn),
wenzelm@24243
   617
    ("conjunction", typ "prop => prop => prop", NoSyn)]
wenzelm@24243
   618
  |> (add_defs_i false o map Thm.no_attributes)
wenzelm@24243
   619
   [("prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
wenzelm@24243
   620
    ("term_def", prop "(CONST ProtoPure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
wenzelm@24243
   621
    ("conjunction_def", prop "(A && B) == (!!C::prop. (A ==> B ==> C) ==> C)")] |> snd
wenzelm@19775
   622
  |> Sign.hide_consts false ["conjunction", "term"]
haftmann@18377
   623
  |> add_thmss [(("nothing", []), [])] |> snd
berghofe@11516
   624
  |> Theory.add_axioms_i Proofterm.equality_axms
wenzelm@16493
   625
  |> Theory.end_theory;
wenzelm@3987
   626
wenzelm@5091
   627
structure ProtoPure =
wenzelm@5091
   628
struct
wenzelm@5091
   629
  val thy = proto_pure;
wenzelm@18031
   630
  val prop_def = get_axiom thy "prop_def";
wenzelm@19775
   631
  val term_def = get_axiom thy "term_def";
wenzelm@19125
   632
  val conjunction_def = get_axiom thy "conjunction_def";
wenzelm@5091
   633
end;
wenzelm@3987
   634
wenzelm@3987
   635
end;
wenzelm@3987
   636
wenzelm@4022
   637
structure BasicPureThy: BASIC_PURE_THY = PureThy;
wenzelm@4022
   638
open BasicPureThy;