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