src/Pure/pure_thy.ML
author wenzelm
Sat Mar 29 19:14:10 2008 +0100 (2008-03-29)
changeset 26488 b497e3187ec7
parent 26471 f4c956461353
child 26553 748631e95425
permissions -rw-r--r--
eliminated destructive/critical theorem database;
simplified store_thm(s);
removed obsolete smart_store_thm(s);
tuned;
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@26430
     5
Theorem storage.  Pure theory syntax and logical content.
wenzelm@3987
     6
*)
wenzelm@3987
     7
wenzelm@3987
     8
signature PURE_THY =
wenzelm@3987
     9
sig
wenzelm@23657
    10
  val tag_rule: Markup.property -> thm -> thm
wenzelm@18801
    11
  val untag_rule: string -> thm -> thm
wenzelm@23657
    12
  val tag: Markup.property -> attribute
wenzelm@18801
    13
  val untag: string -> attribute
wenzelm@21964
    14
  val has_name_hint: thm -> bool
wenzelm@21646
    15
  val get_name_hint: thm -> string
wenzelm@21646
    16
  val put_name_hint: string -> thm -> thm
wenzelm@25981
    17
  val get_group: thm -> string option
wenzelm@25981
    18
  val put_group: string -> thm -> thm
wenzelm@25981
    19
  val group: string -> attribute
wenzelm@22251
    20
  val has_kind: thm -> bool
wenzelm@18801
    21
  val get_kind: thm -> string
wenzelm@18801
    22
  val kind_rule: string -> thm -> thm
wenzelm@18801
    23
  val kind: string -> attribute
wenzelm@18801
    24
  val kind_internal: attribute
wenzelm@23657
    25
  val has_internal: Markup.property list -> bool
wenzelm@18801
    26
  val is_internal: thm -> bool
wenzelm@26344
    27
  val get_fact: theory -> Facts.ref -> thm list
wenzelm@26344
    28
  val get_fact_silent: theory -> Facts.ref -> thm list
wenzelm@26344
    29
  val get_thms: theory -> xstring -> thm list
wenzelm@26344
    30
  val get_thm: theory -> xstring -> thm
wenzelm@17162
    31
  val theorems_of: theory -> thm list NameSpace.table
wenzelm@26282
    32
  val all_facts_of: theory -> Facts.T
wenzelm@16336
    33
  val thms_of: theory -> (string * thm) list
wenzelm@16336
    34
  val all_thms_of: theory -> (string * thm) list
wenzelm@12695
    35
  val hide_thms: bool -> string list -> theory -> theory
wenzelm@21580
    36
  val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
wenzelm@21567
    37
  val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
wenzelm@21580
    38
  val burrow_facts: ('a list -> 'b list) ->
wenzelm@21580
    39
    ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
wenzelm@21580
    40
  val name_multi: string -> 'a list -> (string * 'a) list
wenzelm@21646
    41
  val name_thm: bool -> bool -> string -> thm -> thm
wenzelm@21646
    42
  val name_thms: bool -> bool -> string -> thm list -> thm list
wenzelm@21646
    43
  val name_thmss: bool -> string -> (thm list * 'a) list -> (thm list * 'a) list
wenzelm@26488
    44
  val store_thms: bstring * thm list -> theory -> thm list * theory
wenzelm@26488
    45
  val store_thm: bstring * thm -> theory -> thm * theory
wenzelm@26488
    46
  val store_thm_open: bstring * thm -> theory -> thm * theory
wenzelm@18728
    47
  val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory
wenzelm@24965
    48
  val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory
wenzelm@26488
    49
  val add_thms_dynamic: bstring * (Context.generic -> thm list) -> theory -> theory
haftmann@25598
    50
  val note: string -> string * thm -> theory -> thm * theory
wenzelm@18801
    51
  val note_thmss: string -> ((bstring * attribute list) *
wenzelm@26336
    52
    (Facts.ref * attribute list) list) list -> theory -> (bstring * thm list) list * theory
wenzelm@18801
    53
  val note_thmss_i: string -> ((bstring * attribute list) *
wenzelm@18801
    54
    (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
wenzelm@25981
    55
  val note_thmss_grouped: string -> string -> ((bstring * attribute list) *
wenzelm@25981
    56
    (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
wenzelm@18801
    57
  val note_thmss_qualified: string -> string -> ((bstring * attribute list) *
wenzelm@18728
    58
    (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
wenzelm@26488
    59
  val forall_elim_var: int -> thm -> thm
wenzelm@26488
    60
  val forall_elim_vars: int -> thm -> thm
wenzelm@18728
    61
  val add_axioms: ((bstring * string) * attribute list) list -> theory -> thm list * theory
wenzelm@18728
    62
  val add_axioms_i: ((bstring * term) * attribute list) list -> theory -> thm list * theory
wenzelm@18728
    63
  val add_axiomss: ((bstring * string list) * attribute list) list ->
wenzelm@18728
    64
    theory -> thm list list * theory
wenzelm@18728
    65
  val add_axiomss_i: ((bstring * term list) * attribute list) list ->
wenzelm@18728
    66
    theory -> thm list list * theory
wenzelm@18728
    67
  val add_defs: bool -> ((bstring * string) * attribute list) list ->
haftmann@18377
    68
    theory -> thm list * theory
wenzelm@18728
    69
  val add_defs_i: bool -> ((bstring * term) * attribute list) list ->
haftmann@18377
    70
    theory -> thm list * theory
wenzelm@19629
    71
  val add_defs_unchecked: bool -> ((bstring * string) * attribute list) list ->
wenzelm@19629
    72
    theory -> thm list * theory
wenzelm@19629
    73
  val add_defs_unchecked_i: bool -> ((bstring * term) * attribute list) list ->
wenzelm@19629
    74
    theory -> thm list * theory
wenzelm@3987
    75
end;
wenzelm@3987
    76
wenzelm@3987
    77
structure PureThy: PURE_THY =
wenzelm@3987
    78
struct
wenzelm@3987
    79
wenzelm@3987
    80
wenzelm@18801
    81
(*** theorem tags ***)
wenzelm@18801
    82
wenzelm@18801
    83
(* add / delete tags *)
wenzelm@18801
    84
wenzelm@21646
    85
fun tag_rule tg = Thm.map_tags (insert (op =) tg);
wenzelm@21646
    86
fun untag_rule s = Thm.map_tags (filter_out (fn (s', _) => s = s'));
wenzelm@18801
    87
wenzelm@18801
    88
fun tag tg x = Thm.rule_attribute (K (tag_rule tg)) x;
wenzelm@18801
    89
fun untag s x = Thm.rule_attribute (K (untag_rule s)) x;
wenzelm@18801
    90
wenzelm@18801
    91
wenzelm@21646
    92
(* unofficial theorem names *)
wenzelm@21646
    93
wenzelm@23657
    94
fun the_name_hint thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.nameN);
wenzelm@22251
    95
wenzelm@22251
    96
val has_name_hint = can the_name_hint;
wenzelm@22251
    97
val get_name_hint = the_default "??.unknown" o try the_name_hint;
wenzelm@21646
    98
wenzelm@23657
    99
fun put_name_hint name = untag_rule Markup.nameN #> tag_rule (Markup.nameN, name);
wenzelm@21964
   100
wenzelm@21646
   101
wenzelm@25981
   102
(* theorem groups *)
wenzelm@25981
   103
wenzelm@25981
   104
fun get_group thm = AList.lookup (op =) (Thm.get_tags thm) Markup.groupN;
wenzelm@25981
   105
wenzelm@25981
   106
fun put_group name =
wenzelm@25981
   107
  if name = "" then I else Thm.map_tags (AList.update (op =) (Markup.groupN, name));
wenzelm@25981
   108
wenzelm@25981
   109
fun group name = Thm.rule_attribute (K (put_group name));
wenzelm@25981
   110
wenzelm@25981
   111
wenzelm@18801
   112
(* theorem kinds *)
wenzelm@18801
   113
wenzelm@23657
   114
fun the_kind thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.kindN);
wenzelm@22251
   115
wenzelm@22251
   116
val has_kind = can the_kind;
wenzelm@25981
   117
val get_kind = the_default "" o try the_kind;
wenzelm@18801
   118
wenzelm@23657
   119
fun kind_rule k = tag_rule (Markup.kindN, k) o untag_rule Markup.kindN;
wenzelm@18801
   120
fun kind k x = if k = "" then x else Thm.rule_attribute (K (kind_rule k)) x;
wenzelm@22363
   121
fun kind_internal x = kind Thm.internalK x;
wenzelm@23657
   122
fun has_internal tags = exists (fn tg => tg = (Markup.kindN, Thm.internalK)) tags;
wenzelm@21646
   123
val is_internal = has_internal o Thm.get_tags;
wenzelm@18801
   124
wenzelm@18801
   125
wenzelm@18801
   126
wenzelm@4922
   127
(*** theorem database ***)
wenzelm@3987
   128
wenzelm@16441
   129
(** dataype theorems **)
wenzelm@3987
   130
wenzelm@26282
   131
datatype thms = Thms of
wenzelm@26282
   132
 {theorems: thm list NameSpace.table,   (* FIXME legacy *)
wenzelm@26282
   133
  all_facts: Facts.T};
wenzelm@26282
   134
wenzelm@26488
   135
fun make_thms (theorems, all_facts) = Thms {theorems = theorems, all_facts = all_facts};
wenzelm@26282
   136
wenzelm@16441
   137
structure TheoremsData = TheoryDataFun
wenzelm@24713
   138
(
wenzelm@26488
   139
  type T = thms;
wenzelm@26488
   140
  val empty = make_thms (NameSpace.empty_table, Facts.empty);
wenzelm@26488
   141
  val copy = I;
wenzelm@26488
   142
  fun extend (Thms {theorems = _, all_facts}) = make_thms (NameSpace.empty_table, all_facts);
wenzelm@26282
   143
  fun merge _
wenzelm@26488
   144
     (Thms {theorems = _, all_facts = all_facts1},
wenzelm@26488
   145
      Thms {theorems = _, all_facts = all_facts2}) =
wenzelm@26488
   146
    make_thms (NameSpace.empty_table, Facts.merge (all_facts1, all_facts2));
wenzelm@24713
   147
);
wenzelm@3987
   148
wenzelm@26488
   149
fun map_theorems f =
wenzelm@26488
   150
  TheoremsData.map (fn Thms {theorems, all_facts} => make_thms (f (theorems, all_facts)));
wenzelm@26430
   151
wenzelm@26488
   152
val get_theorems = (fn Thms args => args) o TheoremsData.get;
wenzelm@17162
   153
val theorems_of = #theorems o get_theorems;
wenzelm@26282
   154
val all_facts_of = #all_facts o get_theorems;
wenzelm@16023
   155
wenzelm@6367
   156
wenzelm@3987
   157
wenzelm@4022
   158
(** retrieve theorems **)
wenzelm@3987
   159
wenzelm@26292
   160
local
wenzelm@26292
   161
wenzelm@26292
   162
fun lookup_thms thy xname =
wenzelm@9564
   163
  let
wenzelm@16493
   164
    val (space, thms) = #theorems (get_theorems thy);
wenzelm@26292
   165
    val name = NameSpace.intern space xname;
wenzelm@26292
   166
  in Option.map (pair name) (Symtab.lookup thms name) end;
wenzelm@26292
   167
wenzelm@26292
   168
fun lookup_fact thy xname =
wenzelm@26292
   169
  let
wenzelm@26292
   170
    val facts = all_facts_of thy;
wenzelm@26292
   171
    val name = NameSpace.intern (Facts.space_of facts) xname;
wenzelm@26393
   172
  in Option.map (pair name) (Facts.lookup (Context.Theory thy) facts name) end;
wenzelm@26292
   173
wenzelm@26292
   174
fun show_result NONE = "none"
wenzelm@26292
   175
  | show_result (SOME (name, _)) = quote name;
wenzelm@26292
   176
wenzelm@26344
   177
fun get silent theory thmref =
wenzelm@26292
   178
  let
wenzelm@26336
   179
    val name = Facts.name_of_ref thmref;
wenzelm@26367
   180
    val pos = Facts.pos_of_ref thmref;
wenzelm@26292
   181
    val new_res = lookup_fact theory name;
wenzelm@26292
   182
    val old_res = get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory);
wenzelm@26488
   183
    val _ = Theory.check_thy theory;
wenzelm@26292
   184
    val is_same =
wenzelm@26292
   185
      (case (new_res, old_res) of
wenzelm@26292
   186
        (NONE, NONE) => true
wenzelm@26395
   187
      | (SOME (_, ths1), SOME (_, ths2)) => Thm.eq_thms (ths1, ths2)
wenzelm@26292
   188
      | _ => false);
wenzelm@26292
   189
    val _ =
wenzelm@26320
   190
      if is_same orelse silent then ()
wenzelm@26292
   191
      else legacy_feature ("Fact lookup differs from old-style thm database:\n" ^
wenzelm@26367
   192
        show_result new_res ^ " vs " ^ show_result old_res ^ Position.str_of pos);
wenzelm@26367
   193
  in
wenzelm@26367
   194
    (case old_res of
wenzelm@26367
   195
      NONE => error ("Unknown theorem(s) " ^ quote name ^ Position.str_of pos)
wenzelm@26367
   196
    | SOME (_, ths) => Facts.select thmref (map (Thm.transfer theory) ths))
wenzelm@26367
   197
  end;
wenzelm@4022
   198
wenzelm@26320
   199
in
wenzelm@26320
   200
wenzelm@26344
   201
val get_fact_silent = get true;
wenzelm@26344
   202
val get_fact = get false;
wenzelm@26344
   203
wenzelm@26361
   204
fun get_thms thy = get_fact thy o Facts.named;
wenzelm@26344
   205
fun get_thm thy name = Facts.the_single name (get_thms thy name);
wenzelm@4783
   206
wenzelm@26292
   207
end;
wenzelm@26292
   208
wenzelm@4022
   209
wenzelm@16336
   210
(* thms_of etc. *)
kleing@15882
   211
wenzelm@16023
   212
fun thms_of thy =
wenzelm@17162
   213
  let val thms = #2 (theorems_of thy)
wenzelm@21646
   214
  in map (`(get_name_hint)) (maps snd (Symtab.dest thms)) end;
wenzelm@15703
   215
wenzelm@19482
   216
fun all_thms_of thy = maps thms_of (thy :: Theory.ancestors_of thy);
wenzelm@16336
   217
wenzelm@4022
   218
wenzelm@4022
   219
wenzelm@26488
   220
(** store theorems **)
wenzelm@3987
   221
wenzelm@16441
   222
(* hiding -- affects current theory node only *)
wenzelm@12695
   223
wenzelm@26488
   224
fun hide_thms fully names =
wenzelm@26488
   225
  map_theorems (fn ((space, thms), all_facts) =>
wenzelm@26488
   226
    let val space' = fold (NameSpace.hide fully) names space
wenzelm@26488
   227
    in ((space', thms), all_facts) end);
wenzelm@12695
   228
wenzelm@12695
   229
wenzelm@21580
   230
(* fact specifications *)
wenzelm@21580
   231
wenzelm@21580
   232
fun map_facts f = map (apsnd (map (apfst (map f))));
wenzelm@21580
   233
fun burrow_fact f = split_list #>> burrow f #> op ~~;
wenzelm@21580
   234
fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
wenzelm@21580
   235
wenzelm@21580
   236
wenzelm@4853
   237
(* naming *)
wenzelm@4853
   238
wenzelm@18801
   239
fun name_multi name [x] = [(name, x)]
wenzelm@26457
   240
  | name_multi "" xs = map (pair "") xs
wenzelm@26457
   241
  | name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
berghofe@12235
   242
wenzelm@21646
   243
fun name_thm pre official name thm = thm
wenzelm@21646
   244
  |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
wenzelm@26050
   245
  |> (if has_name_hint thm andalso pre orelse name = "" then I else put_name_hint name)
wenzelm@26050
   246
  |> Thm.map_tags (Position.default_properties (Position.thread_data ()));
berghofe@12872
   247
wenzelm@21646
   248
fun name_thms pre official name xs =
wenzelm@21646
   249
  map (uncurry (name_thm pre official)) (name_multi name xs);
berghofe@12235
   250
wenzelm@21646
   251
fun name_thmss official name fact =
wenzelm@21646
   252
  burrow_fact (name_thms true official name) fact;
wenzelm@4853
   253
wenzelm@4853
   254
berghofe@11998
   255
(* enter_thms *)
wenzelm@4853
   256
haftmann@18418
   257
fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) |> swap
wenzelm@26488
   258
  | enter_thms pre_name post_name app_att (bname, thms) thy =
wenzelm@7470
   259
      let
wenzelm@26488
   260
        val naming = Sign.naming_of thy;
wenzelm@26488
   261
        val name = NameSpace.full naming bname;
wenzelm@16441
   262
        val (thy', thms') = apsnd (post_name name) (app_att (thy, pre_name name thms));
wenzelm@26488
   263
        val thms'' = map (Thm.transfer thy') thms';
wenzelm@26488
   264
        val thy'' = thy' |> map_theorems (fn ((space, theorems), all_facts) =>
wenzelm@26488
   265
          let
wenzelm@26488
   266
            val space' = NameSpace.declare naming name space;
wenzelm@26488
   267
            val theorems' = Symtab.update (name, thms'') theorems;
wenzelm@26488
   268
            val all_facts' = Facts.add_global naming (name, thms'') all_facts;
wenzelm@26488
   269
          in ((space', theorems'), all_facts') end);
wenzelm@26488
   270
      in (thms'', thy'') end;
wenzelm@26488
   271
wenzelm@26488
   272
wenzelm@26488
   273
(* store_thm(s) *)
wenzelm@26488
   274
wenzelm@26488
   275
val store_thms = enter_thms (name_thms true true) (name_thms false true) I;
wenzelm@26488
   276
fun store_thm (name, th) = store_thms (name, [th]) #>> the_single;
wenzelm@26488
   277
wenzelm@26488
   278
fun store_thm_open (name, th) =
wenzelm@26488
   279
  enter_thms (name_thms true false) (name_thms false false) I (name, [th]) #>> the_single;
wenzelm@3987
   280
wenzelm@16023
   281
wenzelm@6091
   282
(* add_thms(s) *)
wenzelm@4853
   283
wenzelm@16441
   284
fun add_thms_atts pre_name ((bname, thms), atts) =
wenzelm@21646
   285
  enter_thms pre_name (name_thms false true)
wenzelm@21646
   286
    (foldl_map (Thm.theory_attributes atts)) (bname, thms);
wenzelm@4853
   287
haftmann@18377
   288
fun gen_add_thmss pre_name =
haftmann@18377
   289
  fold_map (add_thms_atts pre_name);
wenzelm@5907
   290
berghofe@12235
   291
fun gen_add_thms pre_name args =
haftmann@18377
   292
  apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
berghofe@12235
   293
wenzelm@21646
   294
val add_thmss = gen_add_thmss (name_thms true true);
wenzelm@21646
   295
val add_thms = gen_add_thms (name_thms true true);
wenzelm@5907
   296
wenzelm@5907
   297
wenzelm@26488
   298
(* add_thms_dynamic *)
wenzelm@26488
   299
wenzelm@26488
   300
fun add_thms_dynamic (bname, f) thy =
wenzelm@26488
   301
  let
wenzelm@26488
   302
    val name = Sign.full_name thy bname;
wenzelm@26488
   303
    val thy' = thy |> map_theorems (fn (theorems, all_facts) =>
wenzelm@26488
   304
      (theorems, Facts.add_dynamic (Sign.naming_of thy) (name, f) all_facts));
wenzelm@26488
   305
  in thy' end;
wenzelm@26488
   306
wenzelm@26488
   307
wenzelm@14564
   308
(* note_thmss(_i) *)
wenzelm@5907
   309
wenzelm@9192
   310
local
wenzelm@12711
   311
wenzelm@25981
   312
fun gen_note_thmss get tag = fold_map (fn ((bname, more_atts), ths_atts) => fn thy =>
wenzelm@12711
   313
  let
wenzelm@18728
   314
    fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
haftmann@18418
   315
    val (thms, thy') = thy |> enter_thms
wenzelm@21646
   316
      (name_thmss true) (name_thms false true) (apsnd flat o foldl_map app)
wenzelm@25981
   317
      (bname, map (fn (ths, atts) => (get thy ths, surround tag (atts @ more_atts))) ths_atts);
wenzelm@18801
   318
  in ((bname, thms), thy') end);
wenzelm@12711
   319
wenzelm@9192
   320
in
wenzelm@12711
   321
wenzelm@26344
   322
fun note_thmss k = gen_note_thmss get_fact (kind k);
wenzelm@25981
   323
fun note_thmss_i k = gen_note_thmss (K I) (kind k);
wenzelm@25981
   324
fun note_thmss_grouped k g = gen_note_thmss (K I) (kind k #> group g);
wenzelm@12711
   325
wenzelm@21438
   326
end;
wenzelm@21438
   327
haftmann@25598
   328
fun note kind (name, thm) =
haftmann@25598
   329
  note_thmss_i kind [((name, []), [([thm], [])])]
haftmann@25598
   330
  #>> (fn [(_, [thm])] => thm);
haftmann@25598
   331
wenzelm@18801
   332
fun note_thmss_qualified k path facts thy =
wenzelm@18801
   333
  thy
wenzelm@22796
   334
  |> Sign.add_path path
wenzelm@22796
   335
  |> Sign.no_base_names
wenzelm@18801
   336
  |> note_thmss_i k facts
wenzelm@22796
   337
  ||> Sign.restore_naming thy;
wenzelm@18801
   338
wenzelm@5280
   339
wenzelm@16722
   340
(* forall_elim_var(s) -- belongs to drule.ML *)
wenzelm@7899
   341
wenzelm@16722
   342
fun forall_elim_vars_aux strip_vars i th =
wenzelm@16722
   343
  let
wenzelm@16722
   344
    val {thy, tpairs, prop, ...} = Thm.rep_thm th;
haftmann@16787
   345
    val add_used = Term.fold_aterms
haftmann@20853
   346
      (fn Var ((x, j), _) => if i = j then insert (op =) x else I | _ => I);
wenzelm@16722
   347
    val used = fold (fn (t, u) => add_used t o add_used u) tpairs (add_used prop []);
wenzelm@16722
   348
    val vars = strip_vars prop;
wenzelm@20071
   349
    val cvars = (Name.variant_list used (map #1 vars), vars)
wenzelm@16722
   350
      |> ListPair.map (fn (x, (_, T)) => Thm.cterm_of thy (Var ((x, i), T)));
wenzelm@16722
   351
  in fold Thm.forall_elim cvars th end;
wenzelm@7899
   352
wenzelm@16722
   353
val forall_elim_vars = forall_elim_vars_aux Term.strip_all_vars;
wenzelm@16722
   354
wenzelm@16722
   355
fun forall_elim_var i th = forall_elim_vars_aux
wenzelm@16722
   356
  (fn Const ("all", _) $ Abs (a, T, _) => [(a, T)]
wenzelm@16722
   357
  | _ => raise THM ("forall_elim_vars", i, [th])) i th;
wenzelm@7899
   358
wenzelm@7899
   359
wenzelm@4022
   360
(* store axioms as theorems *)
wenzelm@4022
   361
wenzelm@4853
   362
local
wenzelm@17418
   363
  fun get_ax thy (name, _) = Thm.get_axiom_i thy (Sign.full_name thy name);
wenzelm@17418
   364
  fun get_axs thy named_axs = map (forall_elim_vars 0 o get_ax thy) named_axs;
haftmann@18377
   365
  fun add_single add ((name, ax), atts) thy =
wenzelm@4853
   366
    let
berghofe@11998
   367
      val named_ax = [(name, ax)];
wenzelm@7753
   368
      val thy' = add named_ax thy;
wenzelm@7753
   369
      val thm = hd (get_axs thy' named_ax);
haftmann@18377
   370
    in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end;
haftmann@18377
   371
  fun add_multi add ((name, axs), atts) thy =
wenzelm@7753
   372
    let
wenzelm@7753
   373
      val named_axs = name_multi name axs;
wenzelm@4853
   374
      val thy' = add named_axs thy;
wenzelm@7753
   375
      val thms = get_axs thy' named_axs;
haftmann@18377
   376
    in apfst hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end;
haftmann@18377
   377
  fun add_singles add = fold_map (add_single add);
haftmann@18377
   378
  fun add_multis add = fold_map (add_multi add);
wenzelm@4853
   379
in
wenzelm@19629
   380
  val add_axioms           = add_singles Theory.add_axioms;
wenzelm@19629
   381
  val add_axioms_i         = add_singles Theory.add_axioms_i;
wenzelm@19629
   382
  val add_axiomss          = add_multis Theory.add_axioms;
wenzelm@19629
   383
  val add_axiomss_i        = add_multis Theory.add_axioms_i;
wenzelm@22796
   384
  val add_defs             = add_singles o Theory.add_defs false;
wenzelm@22796
   385
  val add_defs_i           = add_singles o Theory.add_defs_i false;
wenzelm@22796
   386
  val add_defs_unchecked   = add_singles o Theory.add_defs true;
wenzelm@22796
   387
  val add_defs_unchecked_i = add_singles o Theory.add_defs_i true;
wenzelm@4853
   388
end;
wenzelm@4022
   389
wenzelm@4022
   390
wenzelm@3987
   391
wenzelm@26430
   392
(*** Pure theory syntax and logical content ***)
wenzelm@3987
   393
wenzelm@24243
   394
val typ = SimpleSyntax.read_typ;
wenzelm@24243
   395
val term = SimpleSyntax.read_term;
wenzelm@24243
   396
val prop = SimpleSyntax.read_prop;
wenzelm@24243
   397
wenzelm@26463
   398
val _ = Context.>> (Context.map_theory
wenzelm@26430
   399
  (Sign.add_types
wenzelm@4922
   400
   [("fun", 2, NoSyn),
wenzelm@4922
   401
    ("prop", 0, NoSyn),
wenzelm@4922
   402
    ("itself", 1, NoSyn),
wenzelm@4922
   403
    ("dummy", 0, NoSyn)]
wenzelm@26430
   404
  #> Sign.add_nonterminals Syntax.basic_nonterms
wenzelm@26430
   405
  #> Sign.add_syntax_i
wenzelm@26436
   406
   [("_lambda",     typ "pttrns => 'a => logic",       Mixfix ("(3%_./ _)", [0, 3], 3)),
wenzelm@26436
   407
    ("_abs",        typ "'a",                          NoSyn),
wenzelm@26436
   408
    ("",            typ "'a => args",                  Delimfix "_"),
wenzelm@26436
   409
    ("_args",       typ "'a => args => args",          Delimfix "_,/ _"),
wenzelm@26436
   410
    ("",            typ "id => idt",                   Delimfix "_"),
wenzelm@26436
   411
    ("_idtdummy",   typ "idt",                         Delimfix "'_"),
wenzelm@26436
   412
    ("_idtyp",      typ "id => type => idt",           Mixfix ("_::_", [], 0)),
wenzelm@26436
   413
    ("_idtypdummy", typ "type => idt",                 Mixfix ("'_()::_", [], 0)),
wenzelm@26436
   414
    ("",            typ "idt => idt",                  Delimfix "'(_')"),
wenzelm@26436
   415
    ("",            typ "idt => idts",                 Delimfix "_"),
wenzelm@26436
   416
    ("_idts",       typ "idt => idts => idts",         Mixfix ("_/ _", [1, 0], 0)),
wenzelm@26436
   417
    ("",            typ "idt => pttrn",                Delimfix "_"),
wenzelm@26436
   418
    ("",            typ "pttrn => pttrns",             Delimfix "_"),
wenzelm@26436
   419
    ("_pttrns",     typ "pttrn => pttrns => pttrns",   Mixfix ("_/ _", [1, 0], 0)),
wenzelm@26436
   420
    ("",            typ "id => aprop",                 Delimfix "_"),
wenzelm@26436
   421
    ("",            typ "longid => aprop",             Delimfix "_"),
wenzelm@26436
   422
    ("",            typ "var => aprop",                Delimfix "_"),
wenzelm@26436
   423
    ("_DDDOT",      typ "aprop",                       Delimfix "..."),
wenzelm@26436
   424
    ("_aprop",      typ "aprop => prop",               Delimfix "PROP _"),
wenzelm@26436
   425
    ("_asm",        typ "prop => asms",                Delimfix "_"),
wenzelm@26436
   426
    ("_asms",       typ "prop => asms => asms",        Delimfix "_;/ _"),
wenzelm@26436
   427
    ("_bigimpl",    typ "asms => prop => prop",        Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
wenzelm@26436
   428
    ("_ofclass",    typ "type => logic => prop",       Delimfix "(1OFCLASS/(1'(_,/ _')))"),
wenzelm@26436
   429
    ("_mk_ofclass", typ "dummy",                       NoSyn),
wenzelm@26436
   430
    ("_TYPE",       typ "type => logic",               Delimfix "(1TYPE/(1'(_')))"),
wenzelm@26436
   431
    ("",            typ "id => logic",                 Delimfix "_"),
wenzelm@26436
   432
    ("",            typ "longid => logic",             Delimfix "_"),
wenzelm@26436
   433
    ("",            typ "var => logic",                Delimfix "_"),
wenzelm@26436
   434
    ("_DDDOT",      typ "logic",                       Delimfix "..."),
wenzelm@26436
   435
    ("_constify",   typ "num => num_const",            Delimfix "_"),
wenzelm@26436
   436
    ("_indexnum",   typ "num_const => index",          Delimfix "\\<^sub>_"),
wenzelm@26436
   437
    ("_index",      typ "logic => index",              Delimfix "(00\\<^bsub>_\\<^esub>)"),
wenzelm@26436
   438
    ("_indexdefault", typ "index",                     Delimfix ""),
wenzelm@26436
   439
    ("_indexvar",   typ "index",                       Delimfix "'\\<index>"),
wenzelm@26436
   440
    ("_struct",     typ "index => logic",              Mixfix ("\\<struct>_", [1000], 1000)),
wenzelm@26436
   441
    ("==>",         typ "prop => prop => prop",        Delimfix "op ==>"),
wenzelm@26436
   442
    (Term.dummy_patternN, typ "aprop",                 Delimfix "'_"),
wenzelm@26436
   443
    ("_appl",       typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
wenzelm@26436
   444
    ("_appl",       typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))]
wenzelm@26430
   445
  #> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
wenzelm@24243
   446
   [("fun",      typ "type => type => type",   Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
wenzelm@24243
   447
    ("_bracket", typ "types => type => type",  Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
wenzelm@24243
   448
    ("_ofsort",  typ "tid => sort => type",    Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
wenzelm@24243
   449
    ("_constrain", typ "'a => type => 'a",     Mixfix ("_\\<Colon>_", [4, 0], 3)),
wenzelm@24243
   450
    ("_idtyp",    typ "id => type => idt",     Mixfix ("_\\<Colon>_", [], 0)),
wenzelm@24243
   451
    ("_idtypdummy", typ "type => idt",         Mixfix ("'_()\\<Colon>_", [], 0)),
wenzelm@24243
   452
    ("_type_constraint_", typ "'a",            NoSyn),
wenzelm@24243
   453
    ("_lambda",  typ "pttrns => 'a => logic",  Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
wenzelm@24243
   454
    ("==",       typ "'a => 'a => prop",       InfixrName ("\\<equiv>", 2)),
wenzelm@24243
   455
    ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
wenzelm@24243
   456
    ("==>",      typ "prop => prop => prop",   InfixrName ("\\<Longrightarrow>", 1)),
wenzelm@24243
   457
    ("_DDDOT",   typ "aprop",                  Delimfix "\\<dots>"),
wenzelm@24243
   458
    ("_bigimpl", typ "asms => prop => prop",   Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
wenzelm@24243
   459
    ("_DDDOT",   typ "logic",                  Delimfix "\\<dots>")]
wenzelm@26430
   460
  #> Sign.add_modesyntax_i ("", false)
wenzelm@24243
   461
   [("prop", typ "prop => prop", Mixfix ("_", [0], 0)),
wenzelm@26430
   462
    ("Pure.term", typ "'a => prop", Delimfix "TERM _"),
wenzelm@26430
   463
    ("Pure.conjunction", typ "prop => prop => prop", InfixrName ("&&", 2))]
wenzelm@26430
   464
  #> Sign.add_modesyntax_i ("HTML", false)
wenzelm@24243
   465
   [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
wenzelm@26430
   466
  #> Sign.add_consts_i
wenzelm@24243
   467
   [("==", typ "'a => 'a => prop", InfixrName ("==", 2)),
wenzelm@24243
   468
    ("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@24243
   469
    ("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@24243
   470
    ("prop", typ "prop => prop", NoSyn),
wenzelm@24243
   471
    ("TYPE", typ "'a itself", NoSyn),
wenzelm@24243
   472
    (Term.dummy_patternN, typ "'a", Delimfix "'_")]
wenzelm@26430
   473
  #> Theory.add_deps "==" ("==", typ "'a => 'a => prop") []
wenzelm@26430
   474
  #> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") []
wenzelm@26430
   475
  #> Theory.add_deps "all" ("all", typ "('a => prop) => prop") []
wenzelm@26430
   476
  #> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") []
wenzelm@26430
   477
  #> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") []
wenzelm@26430
   478
  #> Sign.add_trfuns Syntax.pure_trfuns
wenzelm@26430
   479
  #> Sign.add_trfunsT Syntax.pure_trfunsT
wenzelm@26430
   480
  #> Sign.local_path
wenzelm@26430
   481
  #> Sign.add_consts_i
wenzelm@24243
   482
   [("term", typ "'a => prop", NoSyn),
wenzelm@24243
   483
    ("conjunction", typ "prop => prop => prop", NoSyn)]
wenzelm@26430
   484
  #> (add_defs_i false o map Thm.no_attributes)
wenzelm@24243
   485
   [("prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
wenzelm@26430
   486
    ("term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
wenzelm@26430
   487
    ("conjunction_def", prop "(A && B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
wenzelm@26430
   488
  #> Sign.hide_consts false ["conjunction", "term"]
wenzelm@26430
   489
  #> add_thmss [(("nothing", []), [])] #> snd
wenzelm@26463
   490
  #> Theory.add_axioms_i Proofterm.equality_axms));
wenzelm@3987
   491
wenzelm@3987
   492
end;
wenzelm@3987
   493