src/Pure/pure_thy.ML
author wenzelm
Mon Nov 02 20:34:59 2009 +0100 (2009-11-02)
changeset 33384 1b5ba4e6a953
parent 33365 4db1b31b246e
child 33522 737589bb9bb8
permissions -rw-r--r--
modernized structure Simple_Syntax;
wenzelm@3987
     1
(*  Title:      Pure/pure_thy.ML
wenzelm@3987
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@3987
     3
wenzelm@26430
     4
Theorem storage.  Pure theory syntax and logical content.
wenzelm@3987
     5
*)
wenzelm@3987
     6
wenzelm@3987
     7
signature PURE_THY =
wenzelm@3987
     8
sig
wenzelm@27198
     9
  val facts_of: theory -> Facts.T
wenzelm@26666
    10
  val intern_fact: theory -> xstring -> string
wenzelm@26693
    11
  val defined_fact: theory -> string -> bool
wenzelm@27198
    12
  val hide_fact: bool -> string -> theory -> theory
wenzelm@32105
    13
  val join_proofs: theory -> unit
wenzelm@26683
    14
  val get_fact: Context.generic -> theory -> Facts.ref -> thm list
wenzelm@26344
    15
  val get_thms: theory -> xstring -> thm list
wenzelm@26344
    16
  val get_thm: theory -> xstring -> thm
wenzelm@16336
    17
  val all_thms_of: theory -> (string * thm) list
wenzelm@21580
    18
  val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
wenzelm@21567
    19
  val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
wenzelm@21580
    20
  val burrow_facts: ('a list -> 'b list) ->
wenzelm@21580
    21
    ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
wenzelm@21580
    22
  val name_multi: string -> 'a list -> (string * 'a) list
wenzelm@28076
    23
  val name_thm: bool -> bool -> Position.T -> string -> thm -> thm
wenzelm@28076
    24
  val name_thms: bool -> bool -> Position.T -> string -> thm list -> thm list
wenzelm@28076
    25
  val name_thmss: bool -> Position.T -> string -> (thm list * 'a) list -> (thm list * 'a) list
haftmann@29579
    26
  val store_thms: binding * thm list -> theory -> thm list * theory
haftmann@29579
    27
  val store_thm: binding * thm -> theory -> thm * theory
haftmann@29579
    28
  val store_thm_open: binding * thm -> theory -> thm * theory
haftmann@29579
    29
  val add_thms: ((binding * thm) * attribute list) list -> theory -> thm list * theory
haftmann@29579
    30
  val add_thm: (binding * thm) * attribute list -> theory -> thm * theory
haftmann@29579
    31
  val add_thmss: ((binding * thm list) * attribute list) list -> theory -> thm list list * theory
haftmann@29579
    32
  val add_thms_dynamic: binding * (Context.generic -> thm list) -> theory -> theory
wenzelm@30853
    33
  val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list
wenzelm@30853
    34
    -> theory -> (string * thm list) list * theory
haftmann@29579
    35
  val add_axioms: ((binding * term) * attribute list) list -> theory -> thm list * theory
wenzelm@30337
    36
  val add_axioms_cmd: ((binding * string) * attribute list) list -> theory -> thm list * theory
haftmann@29579
    37
  val add_defs: bool -> ((binding * term) * attribute list) list ->
haftmann@18377
    38
    theory -> thm list * theory
haftmann@29579
    39
  val add_defs_unchecked: bool -> ((binding * term) * attribute list) list ->
haftmann@29579
    40
    theory -> thm list * theory
wenzelm@30337
    41
  val add_defs_cmd: bool -> ((binding * string) * attribute list) list ->
haftmann@18377
    42
    theory -> thm list * theory
wenzelm@30337
    43
  val add_defs_unchecked_cmd: bool -> ((binding * string) * attribute list) list ->
wenzelm@19629
    44
    theory -> thm list * theory
wenzelm@26959
    45
  val old_appl_syntax: theory -> bool
wenzelm@26959
    46
  val old_appl_syntax_setup: theory -> theory
wenzelm@3987
    47
end;
wenzelm@3987
    48
wenzelm@3987
    49
structure PureThy: PURE_THY =
wenzelm@3987
    50
struct
wenzelm@3987
    51
wenzelm@3987
    52
wenzelm@27198
    53
(*** stored facts ***)
wenzelm@3987
    54
wenzelm@27198
    55
(** theory data **)
wenzelm@26282
    56
wenzelm@27198
    57
structure FactsData = TheoryDataFun
wenzelm@24713
    58
(
wenzelm@32105
    59
  type T = Facts.T * thm list;
wenzelm@32105
    60
  val empty = (Facts.empty, []);
wenzelm@26488
    61
  val copy = I;
wenzelm@32105
    62
  fun extend (facts, _) = (facts, []);
wenzelm@32105
    63
  fun merge _ ((facts1, _), (facts2, _)) = (Facts.merge (facts1, facts2), []);
wenzelm@24713
    64
);
wenzelm@3987
    65
wenzelm@28841
    66
wenzelm@28841
    67
(* facts *)
wenzelm@28841
    68
wenzelm@28841
    69
val facts_of = #1 o FactsData.get;
wenzelm@26666
    70
wenzelm@26666
    71
val intern_fact = Facts.intern o facts_of;
wenzelm@26693
    72
val defined_fact = Facts.defined o facts_of;
wenzelm@16023
    73
wenzelm@28841
    74
fun hide_fact fully name = FactsData.map (apfst (Facts.hide fully name));
wenzelm@28841
    75
wenzelm@28841
    76
wenzelm@28841
    77
(* proofs *)
wenzelm@28841
    78
wenzelm@32105
    79
fun register_proofs (thy, thms) = (FactsData.map (apsnd (append thms)) thy, thms);
wenzelm@28977
    80
wenzelm@32105
    81
fun join_proofs thy = Thm.join_proofs (rev (#2 (FactsData.get thy)));
wenzelm@27198
    82
wenzelm@6367
    83
wenzelm@3987
    84
wenzelm@4022
    85
(** retrieve theorems **)
wenzelm@3987
    86
wenzelm@27198
    87
fun get_fact context thy xthmref =
wenzelm@26683
    88
  let
wenzelm@26683
    89
    val xname = Facts.name_of_ref xthmref;
wenzelm@26683
    90
    val pos = Facts.pos_of_ref xthmref;
wenzelm@27198
    91
wenzelm@27198
    92
    val name = intern_fact thy xname;
wenzelm@27198
    93
    val res = Facts.lookup context (facts_of thy) name;
wenzelm@27198
    94
    val _ = Theory.check_thy thy;
wenzelm@26683
    95
  in
wenzelm@27198
    96
    (case res of
wenzelm@27198
    97
      NONE => error ("Unknown fact " ^ quote name ^ Position.str_of pos)
wenzelm@27739
    98
    | SOME (static, ths) =>
wenzelm@27739
    99
        (Position.report ((if static then Markup.fact else Markup.dynamic_fact) name) pos;
wenzelm@27739
   100
         Facts.select xthmref (map (Thm.transfer thy) ths)))
wenzelm@26683
   101
  end;
wenzelm@26344
   102
wenzelm@26683
   103
fun get_thms thy = get_fact (Context.Theory thy) thy o Facts.named;
wenzelm@26344
   104
fun get_thm thy name = Facts.the_single name (get_thms thy name);
wenzelm@4783
   105
wenzelm@27198
   106
fun all_thms_of thy =
wenzelm@27865
   107
  Facts.fold_static (fn (_, ths) => append (map (`(Thm.get_name_hint)) ths)) (facts_of thy) [];
wenzelm@16336
   108
wenzelm@4022
   109
wenzelm@4022
   110
wenzelm@26488
   111
(** store theorems **)
wenzelm@3987
   112
wenzelm@21580
   113
(* fact specifications *)
wenzelm@21580
   114
wenzelm@21580
   115
fun map_facts f = map (apsnd (map (apfst (map f))));
wenzelm@21580
   116
fun burrow_fact f = split_list #>> burrow f #> op ~~;
wenzelm@21580
   117
fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
wenzelm@21580
   118
wenzelm@21580
   119
wenzelm@4853
   120
(* naming *)
wenzelm@4853
   121
wenzelm@18801
   122
fun name_multi name [x] = [(name, x)]
wenzelm@26457
   123
  | name_multi "" xs = map (pair "") xs
wenzelm@26457
   124
  | name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
berghofe@12235
   125
wenzelm@28076
   126
fun name_thm pre official pos name thm = thm
wenzelm@21646
   127
  |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
wenzelm@27865
   128
  |> (if Thm.has_name_hint thm andalso pre orelse name = "" then I else Thm.put_name_hint name)
wenzelm@28076
   129
  |> Thm.default_position pos
wenzelm@27865
   130
  |> Thm.default_position (Position.thread_data ());
berghofe@12872
   131
wenzelm@28076
   132
fun name_thms pre official pos name xs =
wenzelm@28076
   133
  map (uncurry (name_thm pre official pos)) (name_multi name xs);
berghofe@12235
   134
wenzelm@28076
   135
fun name_thmss official pos name fact =
wenzelm@28076
   136
  burrow_fact (name_thms true official pos name) fact;
wenzelm@4853
   137
wenzelm@4853
   138
berghofe@11998
   139
(* enter_thms *)
wenzelm@4853
   140
haftmann@28861
   141
fun enter_thms pre_name post_name app_att (b, thms) thy =
haftmann@28965
   142
  if Binding.is_empty b
wenzelm@32105
   143
  then swap (register_proofs (app_att (thy, thms)))
wenzelm@30211
   144
  else
wenzelm@30211
   145
    let
wenzelm@30211
   146
      val naming = Sign.naming_of thy;
wenzelm@33095
   147
      val name = Name_Space.full_name naming b;
wenzelm@30211
   148
      val (thy', thms') =
wenzelm@32105
   149
        register_proofs (apsnd (post_name name) (app_att (thy, pre_name name thms)));
wenzelm@30211
   150
      val thms'' = map (Thm.transfer thy') thms';
wenzelm@30211
   151
      val thy'' = thy' |> (FactsData.map o apfst) (Facts.add_global naming (b, thms'') #> snd);
wenzelm@30211
   152
    in (thms'', thy'') end;
wenzelm@26488
   153
wenzelm@26488
   154
wenzelm@26488
   155
(* store_thm(s) *)
wenzelm@26488
   156
haftmann@29579
   157
fun store_thms (b, thms) = enter_thms (name_thms true true Position.none)
haftmann@29579
   158
  (name_thms false true Position.none) I (b, thms);
wenzelm@28076
   159
haftmann@29579
   160
fun store_thm (b, th) = store_thms (b, [th]) #>> the_single;
wenzelm@26488
   161
haftmann@29579
   162
fun store_thm_open (b, th) =
wenzelm@28076
   163
  enter_thms (name_thms true false Position.none) (name_thms false false Position.none) I
haftmann@29579
   164
    (b, [th]) #>> the_single;
wenzelm@3987
   165
wenzelm@16023
   166
wenzelm@6091
   167
(* add_thms(s) *)
wenzelm@4853
   168
haftmann@29579
   169
fun add_thms_atts pre_name ((b, thms), atts) =
wenzelm@28076
   170
  enter_thms pre_name (name_thms false true Position.none)
wenzelm@30190
   171
    (Library.foldl_map (Thm.theory_attributes atts)) (b, thms);
wenzelm@4853
   172
haftmann@18377
   173
fun gen_add_thmss pre_name =
haftmann@18377
   174
  fold_map (add_thms_atts pre_name);
wenzelm@5907
   175
berghofe@12235
   176
fun gen_add_thms pre_name args =
haftmann@18377
   177
  apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
berghofe@12235
   178
wenzelm@28076
   179
val add_thmss = gen_add_thmss (name_thms true true Position.none);
wenzelm@28076
   180
val add_thms = gen_add_thms (name_thms true true Position.none);
haftmann@27683
   181
val add_thm = yield_singleton add_thms;
wenzelm@5907
   182
wenzelm@5907
   183
wenzelm@26488
   184
(* add_thms_dynamic *)
wenzelm@26488
   185
haftmann@29579
   186
fun add_thms_dynamic (b, f) thy = thy
haftmann@28864
   187
  |> (FactsData.map o apfst)
haftmann@29579
   188
      (Facts.add_dynamic (Sign.naming_of thy) (b, f) #> snd);
wenzelm@26488
   189
wenzelm@26488
   190
wenzelm@27728
   191
(* note_thmss *)
wenzelm@5907
   192
wenzelm@33167
   193
fun note_thmss kind = fold_map (fn ((b, more_atts), ths_atts) => fn thy =>
wenzelm@12711
   194
  let
haftmann@28941
   195
    val pos = Binding.pos_of b;
haftmann@28965
   196
    val name = Sign.full_name thy b;
wenzelm@28076
   197
    val _ = Position.report (Markup.fact_decl name) pos;
wenzelm@28076
   198
wenzelm@30190
   199
    fun app (x, (ths, atts)) = Library.foldl_map (Thm.theory_attributes atts) (x, ths);
haftmann@18418
   200
    val (thms, thy') = thy |> enter_thms
wenzelm@30190
   201
      (name_thmss true pos) (name_thms false true pos) (apsnd flat o Library.foldl_map app)
wenzelm@33167
   202
      (b, map (fn (ths, atts) => (ths, surround (Thm.kind kind) (atts @ more_atts))) ths_atts);
wenzelm@28076
   203
  in ((name, thms), thy') end);
wenzelm@12711
   204
wenzelm@5280
   205
wenzelm@4022
   206
(* store axioms as theorems *)
wenzelm@4022
   207
wenzelm@4853
   208
local
haftmann@29579
   209
  fun get_ax thy (b, _) = Thm.axiom thy (Sign.full_name thy b);
wenzelm@26655
   210
  fun get_axs thy named_axs = map (Thm.forall_elim_vars 0 o get_ax thy) named_axs;
wenzelm@30337
   211
  fun add_axm add = fold_map (fn ((b, ax), atts) => fn thy =>
wenzelm@4853
   212
    let
haftmann@29579
   213
      val named_ax = [(b, ax)];
wenzelm@7753
   214
      val thy' = add named_ax thy;
wenzelm@30337
   215
      val thm = hd (get_axs thy' named_ax);
wenzelm@30337
   216
    in apfst hd (gen_add_thms (K I) [((b, thm), atts)] thy') end);
wenzelm@4853
   217
in
wenzelm@30337
   218
  val add_defs               = add_axm o Theory.add_defs_i false;
wenzelm@30337
   219
  val add_defs_unchecked     = add_axm o Theory.add_defs_i true;
wenzelm@30337
   220
  val add_axioms             = add_axm Theory.add_axioms_i;
wenzelm@30337
   221
  val add_defs_cmd           = add_axm o Theory.add_defs false;
wenzelm@30337
   222
  val add_defs_unchecked_cmd = add_axm o Theory.add_defs true;
wenzelm@30337
   223
  val add_axioms_cmd         = add_axm Theory.add_axioms;
wenzelm@4853
   224
end;
wenzelm@4022
   225
wenzelm@4022
   226
wenzelm@3987
   227
wenzelm@26430
   228
(*** Pure theory syntax and logical content ***)
wenzelm@3987
   229
wenzelm@33384
   230
val typ = Simple_Syntax.read_typ;
wenzelm@33384
   231
val prop = Simple_Syntax.read_prop;
wenzelm@24243
   232
wenzelm@28856
   233
val typeT = Syntax.typeT;
wenzelm@28856
   234
val spropT = Syntax.spropT;
wenzelm@28856
   235
wenzelm@26959
   236
wenzelm@26959
   237
(* application syntax variants *)
wenzelm@26959
   238
wenzelm@26959
   239
val appl_syntax =
wenzelm@26959
   240
 [("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
wenzelm@26959
   241
  ("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
wenzelm@26959
   242
wenzelm@26959
   243
val applC_syntax =
wenzelm@26959
   244
 [("",       typ "'a => cargs",                  Delimfix "_"),
wenzelm@26959
   245
  ("_cargs", typ "'a => cargs => cargs",         Mixfix ("_/ _", [1000, 1000], 1000)),
wenzelm@26959
   246
  ("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
wenzelm@26959
   247
  ("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
wenzelm@26959
   248
wenzelm@26959
   249
structure OldApplSyntax = TheoryDataFun
wenzelm@26959
   250
(
wenzelm@26959
   251
  type T = bool;
wenzelm@26959
   252
  val empty = false;
wenzelm@26959
   253
  val copy = I;
wenzelm@26959
   254
  val extend = I;
wenzelm@26959
   255
  fun merge _ (b1, b2) : T =
wenzelm@26959
   256
    if b1 = b2 then b1
wenzelm@26959
   257
    else error "Cannot merge theories with different application syntax";
wenzelm@26959
   258
);
wenzelm@26959
   259
wenzelm@26959
   260
val old_appl_syntax = OldApplSyntax.get;
wenzelm@26959
   261
wenzelm@26959
   262
val old_appl_syntax_setup =
wenzelm@26959
   263
  OldApplSyntax.put true #>
wenzelm@26959
   264
  Sign.del_modesyntax_i Syntax.mode_default applC_syntax #>
wenzelm@26959
   265
  Sign.add_syntax_i appl_syntax;
wenzelm@26959
   266
wenzelm@26959
   267
wenzelm@26959
   268
(* main content *)
wenzelm@26959
   269
wenzelm@26463
   270
val _ = Context.>> (Context.map_theory
haftmann@33365
   271
  (Sign.map_naming (Name_Space.set_theory_name Context.PureN) #>
haftmann@33365
   272
   OldApplSyntax.init #>
wenzelm@26959
   273
   Sign.add_types
wenzelm@30344
   274
   [(Binding.name "fun", 2, NoSyn),
wenzelm@30344
   275
    (Binding.name "prop", 0, NoSyn),
wenzelm@30344
   276
    (Binding.name "itself", 1, NoSyn),
wenzelm@30344
   277
    (Binding.name "dummy", 0, NoSyn)]
wenzelm@30344
   278
  #> Sign.add_nonterminals (map Binding.name Syntax.basic_nonterms)
wenzelm@26430
   279
  #> Sign.add_syntax_i
wenzelm@26436
   280
   [("_lambda",     typ "pttrns => 'a => logic",       Mixfix ("(3%_./ _)", [0, 3], 3)),
wenzelm@26436
   281
    ("_abs",        typ "'a",                          NoSyn),
wenzelm@26436
   282
    ("",            typ "'a => args",                  Delimfix "_"),
wenzelm@26436
   283
    ("_args",       typ "'a => args => args",          Delimfix "_,/ _"),
wenzelm@26436
   284
    ("",            typ "id => idt",                   Delimfix "_"),
wenzelm@26436
   285
    ("_idtdummy",   typ "idt",                         Delimfix "'_"),
wenzelm@26436
   286
    ("_idtyp",      typ "id => type => idt",           Mixfix ("_::_", [], 0)),
wenzelm@26436
   287
    ("_idtypdummy", typ "type => idt",                 Mixfix ("'_()::_", [], 0)),
wenzelm@26436
   288
    ("",            typ "idt => idt",                  Delimfix "'(_')"),
wenzelm@26436
   289
    ("",            typ "idt => idts",                 Delimfix "_"),
wenzelm@26436
   290
    ("_idts",       typ "idt => idts => idts",         Mixfix ("_/ _", [1, 0], 0)),
wenzelm@26436
   291
    ("",            typ "idt => pttrn",                Delimfix "_"),
wenzelm@26436
   292
    ("",            typ "pttrn => pttrns",             Delimfix "_"),
wenzelm@26436
   293
    ("_pttrns",     typ "pttrn => pttrns => pttrns",   Mixfix ("_/ _", [1, 0], 0)),
wenzelm@28856
   294
    ("",            typ "aprop => aprop",              Delimfix "'(_')"),
wenzelm@26436
   295
    ("",            typ "id => aprop",                 Delimfix "_"),
wenzelm@26436
   296
    ("",            typ "longid => aprop",             Delimfix "_"),
wenzelm@26436
   297
    ("",            typ "var => aprop",                Delimfix "_"),
wenzelm@26436
   298
    ("_DDDOT",      typ "aprop",                       Delimfix "..."),
wenzelm@26436
   299
    ("_aprop",      typ "aprop => prop",               Delimfix "PROP _"),
wenzelm@26436
   300
    ("_asm",        typ "prop => asms",                Delimfix "_"),
wenzelm@26436
   301
    ("_asms",       typ "prop => asms => asms",        Delimfix "_;/ _"),
wenzelm@26436
   302
    ("_bigimpl",    typ "asms => prop => prop",        Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
wenzelm@26436
   303
    ("_ofclass",    typ "type => logic => prop",       Delimfix "(1OFCLASS/(1'(_,/ _')))"),
wenzelm@26436
   304
    ("_mk_ofclass", typ "dummy",                       NoSyn),
wenzelm@26436
   305
    ("_TYPE",       typ "type => logic",               Delimfix "(1TYPE/(1'(_')))"),
wenzelm@26436
   306
    ("",            typ "id => logic",                 Delimfix "_"),
wenzelm@26436
   307
    ("",            typ "longid => logic",             Delimfix "_"),
wenzelm@26436
   308
    ("",            typ "var => logic",                Delimfix "_"),
wenzelm@26436
   309
    ("_DDDOT",      typ "logic",                       Delimfix "..."),
wenzelm@26436
   310
    ("_constify",   typ "num => num_const",            Delimfix "_"),
wenzelm@29156
   311
    ("_constify",   typ "float_token => float_const",  Delimfix "_"),
wenzelm@26436
   312
    ("_indexnum",   typ "num_const => index",          Delimfix "\\<^sub>_"),
wenzelm@26436
   313
    ("_index",      typ "logic => index",              Delimfix "(00\\<^bsub>_\\<^esub>)"),
wenzelm@26436
   314
    ("_indexdefault", typ "index",                     Delimfix ""),
wenzelm@26436
   315
    ("_indexvar",   typ "index",                       Delimfix "'\\<index>"),
wenzelm@26436
   316
    ("_struct",     typ "index => logic",              Mixfix ("\\<struct>_", [1000], 1000)),
wenzelm@26436
   317
    ("==>",         typ "prop => prop => prop",        Delimfix "op ==>"),
wenzelm@28622
   318
    (Term.dummy_patternN, typ "aprop",                 Delimfix "'_"),
wenzelm@28856
   319
    ("_sort_constraint", typ "type => prop",           Delimfix "(1SORT'_CONSTRAINT/(1'(_')))"),
wenzelm@28856
   320
    ("Pure.term",   typ "logic => prop",               Delimfix "TERM _"),
wenzelm@28856
   321
    ("Pure.conjunction", typ "prop => prop => prop",   InfixrName ("&&&", 2))]
wenzelm@26959
   322
  #> Sign.add_syntax_i applC_syntax
wenzelm@26430
   323
  #> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
wenzelm@24243
   324
   [("fun",      typ "type => type => type",   Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
wenzelm@24243
   325
    ("_bracket", typ "types => type => type",  Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
wenzelm@24243
   326
    ("_ofsort",  typ "tid => sort => type",    Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
wenzelm@28856
   327
    ("_constrain", typ "logic => type => logic", Mixfix ("_\\<Colon>_", [4, 0], 3)),
wenzelm@28856
   328
    ("_constrain", [spropT, typeT] ---> spropT, Mixfix ("_\\<Colon>_", [4, 0], 3)),
wenzelm@24243
   329
    ("_idtyp",    typ "id => type => idt",     Mixfix ("_\\<Colon>_", [], 0)),
wenzelm@24243
   330
    ("_idtypdummy", typ "type => idt",         Mixfix ("'_()\\<Colon>_", [], 0)),
wenzelm@24243
   331
    ("_type_constraint_", typ "'a",            NoSyn),
wenzelm@24243
   332
    ("_lambda",  typ "pttrns => 'a => logic",  Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
wenzelm@24243
   333
    ("==",       typ "'a => 'a => prop",       InfixrName ("\\<equiv>", 2)),
wenzelm@24243
   334
    ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
wenzelm@24243
   335
    ("==>",      typ "prop => prop => prop",   InfixrName ("\\<Longrightarrow>", 1)),
wenzelm@24243
   336
    ("_DDDOT",   typ "aprop",                  Delimfix "\\<dots>"),
wenzelm@24243
   337
    ("_bigimpl", typ "asms => prop => prop",   Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
wenzelm@24243
   338
    ("_DDDOT",   typ "logic",                  Delimfix "\\<dots>")]
wenzelm@26430
   339
  #> Sign.add_modesyntax_i ("", false)
wenzelm@28856
   340
   [("prop", typ "prop => prop", Mixfix ("_", [0], 0))]
wenzelm@26430
   341
  #> Sign.add_modesyntax_i ("HTML", false)
wenzelm@24243
   342
   [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
wenzelm@26430
   343
  #> Sign.add_consts_i
wenzelm@30344
   344
   [(Binding.name "==", typ "'a => 'a => prop", InfixrName ("==", 2)),
wenzelm@30344
   345
    (Binding.name "==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
wenzelm@30344
   346
    (Binding.name "all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@30344
   347
    (Binding.name "prop", typ "prop => prop", NoSyn),
wenzelm@30344
   348
    (Binding.name "TYPE", typ "'a itself", NoSyn),
wenzelm@30344
   349
    (Binding.name Term.dummy_patternN, typ "'a", Delimfix "'_")]
wenzelm@26430
   350
  #> Theory.add_deps "==" ("==", typ "'a => 'a => prop") []
wenzelm@26430
   351
  #> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") []
wenzelm@26430
   352
  #> Theory.add_deps "all" ("all", typ "('a => prop) => prop") []
wenzelm@26430
   353
  #> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") []
wenzelm@26430
   354
  #> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") []
wenzelm@26430
   355
  #> Sign.add_trfuns Syntax.pure_trfuns
wenzelm@26430
   356
  #> Sign.add_trfunsT Syntax.pure_trfunsT
wenzelm@26430
   357
  #> Sign.local_path
wenzelm@26430
   358
  #> Sign.add_consts_i
wenzelm@30344
   359
   [(Binding.name "term", typ "'a => prop", NoSyn),
wenzelm@30344
   360
    (Binding.name "sort_constraint", typ "'a itself => prop", NoSyn),
wenzelm@30344
   361
    (Binding.name "conjunction", typ "prop => prop => prop", NoSyn)]
haftmann@27691
   362
  #> (add_defs false o map Thm.no_attributes)
haftmann@29579
   363
   [(Binding.name "prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
haftmann@29579
   364
    (Binding.name "term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
haftmann@29579
   365
    (Binding.name "sort_constraint_def",
wenzelm@28622
   366
      prop "(CONST Pure.sort_constraint :: 'a itself => prop) (CONST TYPE :: 'a itself) ==\
wenzelm@28622
   367
      \ (CONST Pure.term :: 'a itself => prop) (CONST TYPE :: 'a itself)"),
haftmann@29579
   368
    (Binding.name "conjunction_def", prop "(A &&& B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
wenzelm@28622
   369
  #> Sign.hide_const false "Pure.term"
wenzelm@28622
   370
  #> Sign.hide_const false "Pure.sort_constraint"
wenzelm@26666
   371
  #> Sign.hide_const false "Pure.conjunction"
haftmann@29579
   372
  #> add_thmss [((Binding.name "nothing", []), [])] #> snd
wenzelm@30337
   373
  #> Theory.add_axioms_i (map (apfst Binding.name) Proofterm.equality_axms)));
wenzelm@3987
   374
wenzelm@3987
   375
end;