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