src/Pure/sign.ML
author wenzelm
Sun Sep 30 16:20:38 2007 +0200 (2007-09-30)
changeset 24776 38afb780f622
parent 24761 d762ab297a07
child 24921 708b2f887a42
permissions -rw-r--r--
add_consts_authentic/add_abbrev: tags (Markup.property list);
tuned signature;
wenzelm@19
     1
(*  Title:      Pure/sign.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@251
     3
    Author:     Lawrence C Paulson and Markus Wenzel
clasohm@0
     4
wenzelm@16442
     5
Logical signature content: naming conventions, concrete syntax, type
wenzelm@18062
     6
signature, polymorphic constants.
clasohm@0
     7
*)
clasohm@0
     8
wenzelm@16442
     9
signature SIGN_THEORY =
wenzelm@3791
    10
sig
wenzelm@16442
    11
  val add_defsort: string -> theory -> theory
wenzelm@16442
    12
  val add_defsort_i: sort -> theory -> theory
wenzelm@16442
    13
  val add_types: (bstring * int * mixfix) list -> theory -> theory
wenzelm@16442
    14
  val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
wenzelm@16442
    15
  val add_nonterminals: bstring list -> theory -> theory
wenzelm@16442
    16
  val add_tyabbrs: (bstring * string list * string * mixfix) list -> theory -> theory
wenzelm@16442
    17
  val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> theory -> theory
wenzelm@16442
    18
  val add_syntax: (bstring * string * mixfix) list -> theory -> theory
wenzelm@16442
    19
  val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@20784
    20
  val add_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@20784
    21
  val add_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@20784
    22
  val del_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@20784
    23
  val del_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@16442
    24
  val add_consts: (bstring * string * mixfix) list -> theory -> theory
wenzelm@16442
    25
  val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
paulson@1501
    26
  val add_trfuns:
wenzelm@4344
    27
    (string * (ast list -> ast)) list *
wenzelm@4344
    28
    (string * (term list -> term)) list *
wenzelm@4344
    29
    (string * (term list -> term)) list *
wenzelm@16442
    30
    (string * (ast list -> ast)) list -> theory -> theory
wenzelm@2385
    31
  val add_trfunsT:
wenzelm@16442
    32
    (string * (bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@14645
    33
  val add_advanced_trfuns:
wenzelm@21772
    34
    (string * (Proof.context -> ast list -> ast)) list *
wenzelm@21772
    35
    (string * (Proof.context -> term list -> term)) list *
wenzelm@21772
    36
    (string * (Proof.context -> term list -> term)) list *
wenzelm@21772
    37
    (string * (Proof.context -> ast list -> ast)) list -> theory -> theory
wenzelm@14645
    38
  val add_advanced_trfunsT:
wenzelm@21772
    39
    (string * (Proof.context -> bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@2693
    40
  val add_tokentrfuns:
wenzelm@23660
    41
    (string * string * (string -> output * int)) list -> theory -> theory
wenzelm@23660
    42
  val add_mode_tokentrfuns: string -> (string * (string -> output * int)) list
wenzelm@16442
    43
    -> theory -> theory
wenzelm@16442
    44
  val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@19258
    45
  val del_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@16442
    46
  val add_trrules_i: ast Syntax.trrule list -> theory -> theory
wenzelm@19258
    47
  val del_trrules_i: ast Syntax.trrule list -> theory -> theory
wenzelm@16442
    48
  val add_path: string -> theory -> theory
wenzelm@16442
    49
  val parent_path: theory -> theory
wenzelm@16442
    50
  val root_path: theory -> theory
wenzelm@16442
    51
  val absolute_path: theory -> theory
wenzelm@16442
    52
  val local_path: theory -> theory
wenzelm@19013
    53
  val no_base_names: theory -> theory
wenzelm@16442
    54
  val qualified_names: theory -> theory
wenzelm@19054
    55
  val sticky_prefix: string -> theory -> theory
wenzelm@16442
    56
  val set_policy: (string -> bstring -> string) * (string list -> string list list) ->
wenzelm@16442
    57
    theory -> theory
wenzelm@16442
    58
  val restore_naming: theory -> theory -> theory
wenzelm@16442
    59
end
clasohm@0
    60
wenzelm@16442
    61
signature SIGN =
wenzelm@5642
    62
sig
wenzelm@16442
    63
  val rep_sg: theory ->
wenzelm@16442
    64
   {naming: NameSpace.naming,
wenzelm@16597
    65
    syn: Syntax.syntax,
wenzelm@16442
    66
    tsig: Type.tsig,
wenzelm@18062
    67
    consts: Consts.T}
wenzelm@16442
    68
  val naming_of: theory -> NameSpace.naming
wenzelm@16442
    69
  val base_name: string -> bstring
wenzelm@16442
    70
  val full_name: theory -> bstring -> string
wenzelm@16442
    71
  val full_name_path: theory -> string -> bstring -> string
wenzelm@16442
    72
  val declare_name: theory -> string -> NameSpace.T -> NameSpace.T
wenzelm@16442
    73
  val syn_of: theory -> Syntax.syntax
wenzelm@16442
    74
  val tsig_of: theory -> Type.tsig
wenzelm@19642
    75
  val classes_of: theory -> Sorts.algebra
wenzelm@21932
    76
  val all_classes: theory -> class list
wenzelm@19407
    77
  val super_classes: theory -> class -> class list
wenzelm@24732
    78
  val minimize_sort: theory -> sort -> sort
wenzelm@24732
    79
  val complete_sort: theory -> sort -> sort
wenzelm@16442
    80
  val defaultS: theory -> sort
wenzelm@16442
    81
  val subsort: theory -> sort * sort -> bool
wenzelm@16442
    82
  val of_sort: theory -> typ * sort -> bool
wenzelm@16442
    83
  val witness_sorts: theory -> sort list -> sort list -> (typ * sort) list
wenzelm@16442
    84
  val universal_witness: theory -> (typ * sort) option
wenzelm@16655
    85
  val all_sorts_nonempty: theory -> bool
wenzelm@24732
    86
  val is_logtype: theory -> string -> bool
wenzelm@16442
    87
  val typ_instance: theory -> typ * typ -> bool
wenzelm@19427
    88
  val typ_equiv: theory -> typ * typ -> bool
wenzelm@16941
    89
  val typ_match: theory -> typ * typ -> Type.tyenv -> Type.tyenv
wenzelm@16941
    90
  val typ_unify: theory -> typ * typ -> Type.tyenv * int -> Type.tyenv * int
wenzelm@18967
    91
  val consts_of: theory -> Consts.T
haftmann@17037
    92
  val the_const_constraint: theory -> string -> typ
wenzelm@16442
    93
  val const_type: theory -> string -> typ option
wenzelm@16442
    94
  val the_const_type: theory -> string -> typ
wenzelm@16442
    95
  val declared_tyname: theory -> string -> bool
wenzelm@16442
    96
  val declared_const: theory -> string -> bool
wenzelm@18062
    97
  val const_monomorphic: theory -> string -> bool
wenzelm@21183
    98
  val const_syntax_name: theory -> string -> string
wenzelm@18146
    99
  val const_typargs: theory -> string * typ -> typ list
wenzelm@18164
   100
  val const_instance: theory -> string * typ list -> typ
wenzelm@16442
   101
  val class_space: theory -> NameSpace.T
wenzelm@16442
   102
  val type_space: theory -> NameSpace.T
wenzelm@16442
   103
  val const_space: theory -> NameSpace.T
wenzelm@16442
   104
  val intern_class: theory -> xstring -> string
wenzelm@16442
   105
  val extern_class: theory -> string -> xstring
wenzelm@16442
   106
  val intern_type: theory -> xstring -> string
wenzelm@16442
   107
  val extern_type: theory -> string -> xstring
wenzelm@16442
   108
  val intern_const: theory -> xstring -> string
wenzelm@16442
   109
  val extern_const: theory -> string -> xstring
wenzelm@16442
   110
  val intern_sort: theory -> sort -> sort
wenzelm@16442
   111
  val extern_sort: theory -> sort -> sort
wenzelm@16442
   112
  val intern_typ: theory -> typ -> typ
wenzelm@16442
   113
  val extern_typ: theory -> typ -> typ
wenzelm@16442
   114
  val intern_term: theory -> term -> term
wenzelm@18994
   115
  val extern_term: (string -> xstring) -> theory -> term -> term
wenzelm@16442
   116
  val intern_tycons: theory -> typ -> typ
wenzelm@21772
   117
  val pretty_term': Proof.context -> Syntax.syntax -> (string -> xstring) -> term -> Pretty.T
wenzelm@16442
   118
  val pretty_term: theory -> term -> Pretty.T
wenzelm@16442
   119
  val pretty_typ: theory -> typ -> Pretty.T
wenzelm@16442
   120
  val pretty_sort: theory -> sort -> Pretty.T
wenzelm@16442
   121
  val pretty_classrel: theory -> class list -> Pretty.T
wenzelm@16442
   122
  val pretty_arity: theory -> arity -> Pretty.T
wenzelm@16442
   123
  val string_of_term: theory -> term -> string
wenzelm@16442
   124
  val string_of_typ: theory -> typ -> string
wenzelm@16442
   125
  val string_of_sort: theory -> sort -> string
wenzelm@16442
   126
  val string_of_classrel: theory -> class list -> string
wenzelm@16442
   127
  val string_of_arity: theory -> arity -> string
wenzelm@16442
   128
  val pp: theory -> Pretty.pp
wenzelm@19462
   129
  val arity_number: theory -> string -> int
wenzelm@19462
   130
  val arity_sorts: theory -> string -> sort -> sort list
wenzelm@16442
   131
  val certify_class: theory -> class -> class
wenzelm@16442
   132
  val certify_sort: theory -> sort -> sort
wenzelm@16442
   133
  val certify_typ: theory -> typ -> typ
wenzelm@24273
   134
  val certify_typ_mode: Type.mode -> theory -> typ -> typ
wenzelm@24674
   135
  val certify': bool -> Pretty.pp -> bool -> Consts.T -> theory -> term -> term * typ * int
wenzelm@18967
   136
  val certify_term: theory -> term -> term * typ * int
wenzelm@18967
   137
  val certify_prop: theory -> term -> term * typ * int
wenzelm@16494
   138
  val cert_term: theory -> term -> term
wenzelm@16494
   139
  val cert_prop: theory -> term -> term
wenzelm@21741
   140
  val no_frees: Pretty.pp -> term -> term
wenzelm@18941
   141
  val no_vars: Pretty.pp -> term -> term
wenzelm@18941
   142
  val cert_def: Pretty.pp -> term -> (string * typ) * term
wenzelm@19244
   143
  val read_class: theory -> xstring -> class
wenzelm@19244
   144
  val read_arity: theory -> xstring * string list * string -> arity
wenzelm@19244
   145
  val cert_arity: theory -> arity -> arity
wenzelm@22765
   146
  val get_sort: theory ->
wenzelm@22765
   147
    (indexname -> sort option) -> (indexname * sort) list -> indexname -> sort
wenzelm@22683
   148
  val read_def_typ: theory * (indexname -> sort option) -> string -> typ
wenzelm@22683
   149
  val read_typ: theory -> string -> typ
wenzelm@22683
   150
  val read_typ_syntax: theory -> string -> typ
wenzelm@22683
   151
  val read_typ_abbrev: theory -> string -> typ
wenzelm@16442
   152
  val read_tyname: theory -> string -> typ
wenzelm@16442
   153
  val read_const: theory -> string -> term
wenzelm@18967
   154
  val read_def_terms': Pretty.pp -> (string -> bool) -> Syntax.syntax -> Consts.T ->
wenzelm@22696
   155
    (string -> string option) -> Proof.context ->
wenzelm@22696
   156
    (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@20155
   157
    Name.context -> bool -> (string * typ) list -> term list * (indexname * typ) list
wenzelm@16442
   158
  val read_def_terms:
wenzelm@16442
   159
    theory * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@16442
   160
    string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
wenzelm@16442
   161
  val simple_read_term: theory -> typ -> string -> term
wenzelm@16494
   162
  val read_term: theory -> string -> term
wenzelm@16494
   163
  val read_prop: theory -> string -> term
wenzelm@24776
   164
  val add_consts_authentic: Markup.property list ->
wenzelm@24776
   165
    (bstring * typ * mixfix) list -> theory -> theory
wenzelm@21206
   166
  val add_notation: Syntax.mode -> (term * mixfix) list -> theory -> theory
wenzelm@24776
   167
  val add_abbrev: string -> Markup.property list ->
wenzelm@24776
   168
    bstring * term -> theory -> (term * term) * theory
wenzelm@16442
   169
  include SIGN_THEORY
wenzelm@24761
   170
  val add_const_constraint: string * typ option -> theory -> theory
wenzelm@22811
   171
  val primitive_class: string * class list -> theory -> theory
wenzelm@22811
   172
  val primitive_classrel: class * class -> theory -> theory
wenzelm@22811
   173
  val primitive_arity: arity -> theory -> theory
wenzelm@22796
   174
  val hide_classes: bool -> xstring list -> theory -> theory
wenzelm@22796
   175
  val hide_classes_i: bool -> string list -> theory -> theory
wenzelm@22796
   176
  val hide_types: bool -> xstring list -> theory -> theory
wenzelm@22796
   177
  val hide_types_i: bool -> string list -> theory -> theory
wenzelm@22796
   178
  val hide_consts: bool -> xstring list -> theory -> theory
wenzelm@22796
   179
  val hide_consts_i: bool -> string list -> theory -> theory
wenzelm@22796
   180
  val hide_names: bool -> string * xstring list -> theory -> theory
wenzelm@22796
   181
  val hide_names_i: bool -> string * string list -> theory -> theory
wenzelm@16442
   182
end
wenzelm@5642
   183
wenzelm@16442
   184
structure Sign: SIGN =
wenzelm@143
   185
struct
clasohm@0
   186
wenzelm@16442
   187
(** datatype sign **)
wenzelm@16337
   188
wenzelm@16442
   189
datatype sign = Sign of
wenzelm@18062
   190
 {naming: NameSpace.naming,     (*common naming conventions*)
wenzelm@18062
   191
  syn: Syntax.syntax,           (*concrete syntax for terms, types, sorts*)
wenzelm@18062
   192
  tsig: Type.tsig,              (*order-sorted signature of types*)
wenzelm@18062
   193
  consts: Consts.T};            (*polymorphic constants*)
wenzelm@16442
   194
wenzelm@16442
   195
fun make_sign (naming, syn, tsig, consts) =
wenzelm@16442
   196
  Sign {naming = naming, syn = syn, tsig = tsig, consts = consts};
wenzelm@16442
   197
wenzelm@16442
   198
structure SignData = TheoryDataFun
wenzelm@22846
   199
(
wenzelm@16442
   200
  type T = sign;
wenzelm@16442
   201
  val copy = I;
wenzelm@17405
   202
  fun extend (Sign {syn, tsig, consts, ...}) =
wenzelm@17405
   203
    make_sign (NameSpace.default_naming, syn, tsig, consts);
wenzelm@16442
   204
wenzelm@18062
   205
  val empty =
wenzelm@18714
   206
    make_sign (NameSpace.default_naming, Syntax.basic_syn, Type.empty_tsig, Consts.empty);
wenzelm@16442
   207
wenzelm@16442
   208
  fun merge pp (sign1, sign2) =
wenzelm@16442
   209
    let
wenzelm@18062
   210
      val Sign {naming = _, syn = syn1, tsig = tsig1, consts = consts1} = sign1;
wenzelm@18062
   211
      val Sign {naming = _, syn = syn2, tsig = tsig2, consts = consts2} = sign2;
wenzelm@16442
   212
wenzelm@16442
   213
      val naming = NameSpace.default_naming;
wenzelm@16597
   214
      val syn = Syntax.merge_syntaxes syn1 syn2;
wenzelm@16442
   215
      val tsig = Type.merge_tsigs pp (tsig1, tsig2);
wenzelm@18062
   216
      val consts = Consts.merge (consts1, consts2);
wenzelm@18062
   217
    in make_sign (naming, syn, tsig, consts) end;
wenzelm@22846
   218
);
wenzelm@16442
   219
wenzelm@16442
   220
fun rep_sg thy = SignData.get thy |> (fn Sign args => args);
wenzelm@16442
   221
wenzelm@16442
   222
fun map_sign f = SignData.map (fn Sign {naming, syn, tsig, consts} =>
wenzelm@16442
   223
  make_sign (f (naming, syn, tsig, consts)));
wenzelm@16442
   224
wenzelm@16442
   225
fun map_naming f = map_sign (fn (naming, syn, tsig, consts) => (f naming, syn, tsig, consts));
wenzelm@16442
   226
fun map_syn f = map_sign (fn (naming, syn, tsig, consts) => (naming, f syn, tsig, consts));
wenzelm@16442
   227
fun map_tsig f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, f tsig, consts));
wenzelm@16442
   228
fun map_consts f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, tsig, f consts));
wenzelm@16442
   229
wenzelm@16337
   230
wenzelm@16337
   231
(* naming *)
wenzelm@16337
   232
wenzelm@16442
   233
val naming_of = #naming o rep_sg;
wenzelm@16337
   234
val base_name = NameSpace.base;
wenzelm@16337
   235
val full_name = NameSpace.full o naming_of;
wenzelm@16442
   236
fun full_name_path thy elems = NameSpace.full (NameSpace.add_path elems (naming_of thy));
wenzelm@16337
   237
val declare_name = NameSpace.declare o naming_of;
wenzelm@14645
   238
wenzelm@14645
   239
wenzelm@14645
   240
(* syntax *)
wenzelm@14645
   241
wenzelm@16597
   242
val syn_of = #syn o rep_sg;
wenzelm@14645
   243
clasohm@0
   244
wenzelm@16337
   245
(* type signature *)
wenzelm@16337
   246
wenzelm@16337
   247
val tsig_of = #tsig o rep_sg;
wenzelm@24732
   248
wenzelm@19642
   249
val classes_of = #2 o #classes o Type.rep_tsig o tsig_of;
wenzelm@21932
   250
val all_classes = Sorts.all_classes o classes_of;
wenzelm@21932
   251
val minimal_classes = Sorts.minimal_classes o classes_of;
wenzelm@19642
   252
val super_classes = Sorts.super_classes o classes_of;
wenzelm@24732
   253
val minimize_sort = Sorts.minimize_sort o classes_of;
wenzelm@24732
   254
val complete_sort = Sorts.complete_sort o classes_of;
wenzelm@24732
   255
wenzelm@4844
   256
val defaultS = Type.defaultS o tsig_of;
wenzelm@4568
   257
val subsort = Type.subsort o tsig_of;
wenzelm@7640
   258
val of_sort = Type.of_sort o tsig_of;
wenzelm@7640
   259
val witness_sorts = Type.witness_sorts o tsig_of;
wenzelm@14784
   260
val universal_witness = Type.universal_witness o tsig_of;
wenzelm@16655
   261
val all_sorts_nonempty = is_some o universal_witness;
wenzelm@24732
   262
val is_logtype = member (op =) o Type.logical_types o tsig_of;
wenzelm@24732
   263
wenzelm@14784
   264
val typ_instance = Type.typ_instance o tsig_of;
wenzelm@19427
   265
fun typ_equiv thy (T, U) = typ_instance thy (T, U) andalso typ_instance thy (U, T);
wenzelm@16941
   266
val typ_match = Type.typ_match o tsig_of;
wenzelm@16941
   267
val typ_unify = Type.unify o tsig_of;
wenzelm@4256
   268
wenzelm@4256
   269
wenzelm@18062
   270
(* polymorphic constants *)
wenzelm@16941
   271
wenzelm@18062
   272
val consts_of = #consts o rep_sg;
wenzelm@21722
   273
val the_const_constraint = Consts.the_constraint o consts_of;
wenzelm@21722
   274
val the_const_type = Consts.the_declaration o consts_of;
wenzelm@18062
   275
val const_type = try o the_const_type;
wenzelm@21722
   276
val const_monomorphic = Consts.is_monomorphic o consts_of;
wenzelm@21183
   277
val const_syntax_name = Consts.syntax_name o consts_of;
wenzelm@18062
   278
val const_typargs = Consts.typargs o consts_of;
wenzelm@18164
   279
val const_instance = Consts.instance o consts_of;
wenzelm@4256
   280
wenzelm@16894
   281
val declared_tyname = Symtab.defined o #2 o #types o Type.rep_tsig o tsig_of;
wenzelm@24761
   282
val declared_const = can o the_const_constraint;
wenzelm@620
   283
wenzelm@402
   284
clasohm@0
   285
wenzelm@16337
   286
(** intern / extern names **)
wenzelm@16337
   287
wenzelm@16368
   288
val class_space = #1 o #classes o Type.rep_tsig o tsig_of;
wenzelm@16368
   289
val type_space = #1 o #types o Type.rep_tsig o tsig_of;
wenzelm@18967
   290
val const_space = Consts.space_of o consts_of;
wenzelm@14645
   291
wenzelm@16368
   292
val intern_class = NameSpace.intern o class_space;
wenzelm@16368
   293
val extern_class = NameSpace.extern o class_space;
wenzelm@16368
   294
val intern_type = NameSpace.intern o type_space;
wenzelm@16368
   295
val extern_type = NameSpace.extern o type_space;
wenzelm@16368
   296
val intern_const = NameSpace.intern o const_space;
wenzelm@16368
   297
val extern_const = NameSpace.extern o const_space;
wenzelm@16337
   298
wenzelm@16337
   299
val intern_sort = map o intern_class;
wenzelm@16337
   300
val extern_sort = map o extern_class;
wenzelm@16337
   301
wenzelm@16337
   302
local
wenzelm@14645
   303
wenzelm@18892
   304
fun map_typ f g (Type (c, Ts)) = Type (g c, map (map_typ f g) Ts)
wenzelm@18892
   305
  | map_typ f _ (TFree (x, S)) = TFree (x, map f S)
wenzelm@18892
   306
  | map_typ f _ (TVar (xi, S)) = TVar (xi, map f S);
wenzelm@18892
   307
wenzelm@18892
   308
fun map_term f g h (Const (c, T)) = Const (h c, map_typ f g T)
wenzelm@18892
   309
  | map_term f g _ (Free (x, T)) = Free (x, map_typ f g T)
wenzelm@18892
   310
  | map_term f g _ (Var (xi, T)) = Var (xi, map_typ f g T)
wenzelm@18892
   311
  | map_term _ _ _ (t as Bound _) = t
wenzelm@18892
   312
  | map_term f g h (Abs (x, T, t)) = Abs (x, map_typ f g T, map_term f g h t)
wenzelm@18892
   313
  | map_term f g h (t $ u) = map_term f g h t $ map_term f g h u;
wenzelm@18892
   314
wenzelm@18994
   315
val add_classesT = Term.fold_atyps
wenzelm@18994
   316
  (fn TFree (_, S) => fold (insert (op =)) S
wenzelm@18994
   317
    | TVar (_, S) => fold (insert (op =)) S
wenzelm@18994
   318
    | _ => I);
wenzelm@18994
   319
wenzelm@18994
   320
fun add_tyconsT (Type (c, Ts)) = insert (op =) c #> fold add_tyconsT Ts
wenzelm@18994
   321
  | add_tyconsT _ = I;
wenzelm@18994
   322
wenzelm@18994
   323
val add_consts = Term.fold_aterms (fn Const (c, _) => insert (op =) c | _ => I);
wenzelm@18994
   324
wenzelm@16337
   325
fun mapping add_names f t =
wenzelm@16337
   326
  let
wenzelm@20664
   327
    fun f' (x: string) = let val y = f x in if x = y then NONE else SOME (x, y) end;
wenzelm@19482
   328
    val tab = map_filter f' (add_names t []);
wenzelm@18941
   329
    fun get x = the_default x (AList.lookup (op =) tab x);
wenzelm@16337
   330
  in get end;
wenzelm@16337
   331
wenzelm@16442
   332
fun typ_mapping f g thy T =
wenzelm@18892
   333
  T |> map_typ
wenzelm@18994
   334
    (mapping add_classesT (f thy) T)
wenzelm@18994
   335
    (mapping add_tyconsT (g thy) T);
wenzelm@14645
   336
wenzelm@16442
   337
fun term_mapping f g h thy t =
wenzelm@18892
   338
  t |> map_term
wenzelm@18994
   339
    (mapping (Term.fold_types add_classesT) (f thy) t)
wenzelm@18994
   340
    (mapping (Term.fold_types add_tyconsT) (g thy) t)
wenzelm@18994
   341
    (mapping add_consts (h thy) t);
wenzelm@16337
   342
wenzelm@16337
   343
in
wenzelm@14645
   344
wenzelm@16368
   345
val intern_typ = typ_mapping intern_class intern_type;
wenzelm@16368
   346
val extern_typ = typ_mapping extern_class extern_type;
wenzelm@16368
   347
val intern_term = term_mapping intern_class intern_type intern_const;
wenzelm@18994
   348
fun extern_term h = term_mapping extern_class extern_type (K h);
wenzelm@16368
   349
val intern_tycons = typ_mapping (K I) intern_type;
wenzelm@16337
   350
wenzelm@16337
   351
end;
wenzelm@14645
   352
wenzelm@14645
   353
wenzelm@14645
   354
wenzelm@4249
   355
(** pretty printing of terms, types etc. **)
wenzelm@3937
   356
wenzelm@21772
   357
fun pretty_term' ctxt syn ext t =
wenzelm@21772
   358
  let val curried = Context.exists_name Context.CPureN (ProofContext.theory_of ctxt)
wenzelm@21772
   359
  in Syntax.pretty_term ext ctxt syn curried t end;
wenzelm@18857
   360
wenzelm@18994
   361
fun pretty_term thy t =
wenzelm@21772
   362
  pretty_term' (ProofContext.init thy) (syn_of thy) (Consts.extern (consts_of thy))
wenzelm@19366
   363
    (extern_term (Consts.extern_early (consts_of thy)) thy t);
wenzelm@18857
   364
wenzelm@21772
   365
fun pretty_typ thy T =
wenzelm@21772
   366
  Syntax.pretty_typ (ProofContext.init thy) (syn_of thy) (extern_typ thy T);
wenzelm@21772
   367
wenzelm@21772
   368
fun pretty_sort thy S =
wenzelm@21772
   369
  Syntax.pretty_sort (ProofContext.init thy) (syn_of thy) (extern_sort thy S);
wenzelm@3937
   370
wenzelm@19482
   371
fun pretty_classrel thy cs = Pretty.block (flat
wenzelm@16442
   372
  (separate [Pretty.str " <", Pretty.brk 1] (map (single o pretty_sort thy o single) cs)));
wenzelm@3937
   373
wenzelm@16442
   374
fun pretty_arity thy (a, Ss, S) =
wenzelm@3937
   375
  let
wenzelm@16442
   376
    val a' = extern_type thy a;
wenzelm@3937
   377
    val dom =
wenzelm@3937
   378
      if null Ss then []
wenzelm@16442
   379
      else [Pretty.list "(" ")" (map (pretty_sort thy) Ss), Pretty.brk 1];
wenzelm@16442
   380
  in Pretty.block ([Pretty.str (a' ^ " ::"), Pretty.brk 1] @ dom @ [pretty_sort thy S]) end;
wenzelm@3937
   381
wenzelm@14828
   382
val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@14828
   383
val string_of_typ = Pretty.string_of oo pretty_typ;
wenzelm@14828
   384
val string_of_sort = Pretty.string_of oo pretty_sort;
wenzelm@14828
   385
val string_of_classrel = Pretty.string_of oo pretty_classrel;
wenzelm@14828
   386
val string_of_arity = Pretty.string_of oo pretty_arity;
wenzelm@3937
   387
wenzelm@16442
   388
fun pp thy = Pretty.pp (pretty_term thy, pretty_typ thy, pretty_sort thy,
wenzelm@16442
   389
  pretty_classrel thy, pretty_arity thy);
wenzelm@14828
   390
wenzelm@3937
   391
wenzelm@3937
   392
wenzelm@16337
   393
(** certify entities **)    (*exception TYPE*)
wenzelm@8898
   394
wenzelm@16337
   395
(* certify wrt. type signature *)
wenzelm@8898
   396
wenzelm@19462
   397
val arity_number = Type.arity_number o tsig_of;
wenzelm@19462
   398
fun arity_sorts thy = Type.arity_sorts (pp thy) (tsig_of thy);
wenzelm@19462
   399
wenzelm@24273
   400
val certify_class         = Type.cert_class o tsig_of;
wenzelm@24273
   401
val certify_sort          = Type.cert_sort o tsig_of;
wenzelm@24273
   402
val certify_typ           = Type.cert_typ o tsig_of;
wenzelm@24273
   403
fun certify_typ_mode mode = Type.cert_typ_mode mode o tsig_of;
wenzelm@10443
   404
wenzelm@4961
   405
wenzelm@18967
   406
(* certify term/prop *)
wenzelm@4961
   407
wenzelm@14987
   408
local
nipkow@1494
   409
wenzelm@16337
   410
fun type_check pp tm =
wenzelm@4961
   411
  let
wenzelm@4961
   412
    fun err_appl why bs t T u U =
wenzelm@4961
   413
      let
wenzelm@10404
   414
        val xs = map Free bs;           (*we do not rename here*)
wenzelm@4961
   415
        val t' = subst_bounds (xs, t);
wenzelm@4961
   416
        val u' = subst_bounds (xs, u);
wenzelm@16337
   417
        val msg = cat_lines
wenzelm@14828
   418
          (TypeInfer.appl_error (Syntax.pp_show_brackets pp) why t' T u' U);
wenzelm@16337
   419
      in raise TYPE (msg, [T, U], [t', u']) end;
wenzelm@4961
   420
wenzelm@4961
   421
    fun typ_of (_, Const (_, T)) = T
wenzelm@4961
   422
      | typ_of (_, Free  (_, T)) = T
wenzelm@4961
   423
      | typ_of (_, Var (_, T)) = T
skalberg@15570
   424
      | typ_of (bs, Bound i) = snd (List.nth (bs, i) handle Subscript =>
wenzelm@4961
   425
          raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
wenzelm@4961
   426
      | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
wenzelm@4961
   427
      | typ_of (bs, t $ u) =
wenzelm@4961
   428
          let val T = typ_of (bs, t) and U = typ_of (bs, u) in
wenzelm@4961
   429
            (case T of
wenzelm@4961
   430
              Type ("fun", [T1, T2]) =>
wenzelm@14828
   431
                if T1 = U then T2 else err_appl "Incompatible operand type" bs t T u U
wenzelm@14828
   432
            | _ => err_appl "Operator not of function type" bs t T u U)
wenzelm@4961
   433
          end;
wenzelm@18967
   434
  in typ_of ([], tm) end;
wenzelm@4961
   435
wenzelm@18967
   436
fun err msg = raise TYPE (msg, [], []);
wenzelm@18967
   437
wenzelm@18967
   438
fun check_vars (t $ u) = (check_vars t; check_vars u)
wenzelm@18967
   439
  | check_vars (Abs (_, _, t)) = check_vars t
wenzelm@18967
   440
  | check_vars (Var (xi as (_, i), _)) =
wenzelm@18967
   441
      if i < 0 then err ("Malformed variable: " ^ quote (Term.string_of_vname xi)) else ()
wenzelm@18967
   442
  | check_vars _ = ();
clasohm@0
   443
wenzelm@14987
   444
in
wenzelm@14987
   445
wenzelm@24674
   446
fun certify' prop pp do_expand consts thy tm =
wenzelm@251
   447
  let
wenzelm@18967
   448
    val _ = check_vars tm;
wenzelm@20548
   449
    val tm' = Term.map_types (certify_typ thy) tm;
wenzelm@18967
   450
    val T = type_check pp tm';
wenzelm@18967
   451
    val _ = if prop andalso T <> propT then err "Term not of type prop" else ();
wenzelm@24674
   452
    val tm'' = Consts.certify pp (tsig_of thy) do_expand consts tm';
wenzelm@18967
   453
  in (if tm = tm'' then tm else tm'', T, Term.maxidx_of_term tm'') end;
wenzelm@169
   454
wenzelm@24674
   455
fun certify_term thy = certify' false (pp thy) true (consts_of thy) thy;
wenzelm@24674
   456
fun certify_prop thy = certify' true (pp thy) true (consts_of thy) thy;
wenzelm@18967
   457
wenzelm@24674
   458
fun cert_term_abbrev thy = #1 o certify' false (pp thy) false (consts_of thy) thy;
wenzelm@18967
   459
val cert_term = #1 oo certify_term;
wenzelm@18967
   460
val cert_prop = #1 oo certify_prop;
wenzelm@251
   461
wenzelm@14987
   462
end;
wenzelm@14987
   463
wenzelm@251
   464
wenzelm@18941
   465
(* specifications *)
wenzelm@18941
   466
wenzelm@21741
   467
fun no_variables kind add addT mk mkT pp tm =
wenzelm@21741
   468
  (case (add tm [], addT tm []) of
wenzelm@18941
   469
    ([], []) => tm
wenzelm@21741
   470
  | (frees, tfrees) => error (Pretty.string_of (Pretty.block (Pretty.breaks
wenzelm@21741
   471
      (Pretty.str ("Illegal " ^ kind ^ " variable(s) in term:") ::
wenzelm@21741
   472
       map (Pretty.term pp o mk) frees @ map (Pretty.typ pp o mkT) tfrees)))));
wenzelm@21741
   473
wenzelm@21741
   474
val no_frees = no_variables "free" Term.add_frees Term.add_tfrees Free TFree;
wenzelm@21741
   475
val no_vars = no_variables "schematic" Term.add_vars Term.add_tvars Var TVar;
wenzelm@18941
   476
wenzelm@18941
   477
fun cert_def pp tm =
wenzelm@18941
   478
  let val ((lhs, rhs), _) = tm
wenzelm@18941
   479
    |> no_vars pp
wenzelm@18941
   480
    |> Logic.strip_imp_concl
wenzelm@24260
   481
    |> PrimitiveDefs.dest_def pp Term.is_Const (K false) (K false)
wenzelm@18941
   482
  in (Term.dest_Const (Term.head_of lhs), rhs) end
wenzelm@18941
   483
  handle TERM (msg, _) => error msg;
wenzelm@18941
   484
wenzelm@18941
   485
wenzelm@16337
   486
wenzelm@16442
   487
(** read and certify entities **)    (*exception ERROR*)
wenzelm@16337
   488
wenzelm@24273
   489
(* classes *)
wenzelm@19244
   490
wenzelm@19427
   491
fun read_class thy c = certify_class thy (intern_class thy c)
wenzelm@19427
   492
  handle TYPE (msg, _, _) => error msg;
wenzelm@16337
   493
wenzelm@16337
   494
wenzelm@19244
   495
(* type arities *)
wenzelm@19244
   496
wenzelm@19244
   497
fun prep_arity prep_tycon prep_sort thy (t, Ss, S) =
wenzelm@19244
   498
  let val arity = (prep_tycon thy t, map (prep_sort thy) Ss, prep_sort thy S)
wenzelm@19513
   499
  in Type.add_arity (pp thy) arity (tsig_of thy); arity end;
wenzelm@19244
   500
wenzelm@24707
   501
val read_arity = prep_arity intern_type Syntax.read_sort_global;
wenzelm@19244
   502
val cert_arity = prep_arity (K I) certify_sort;
wenzelm@19244
   503
wenzelm@19244
   504
wenzelm@16337
   505
(* types *)
wenzelm@16337
   506
wenzelm@22765
   507
fun get_sort thy def_sort raw_env =
wenzelm@22696
   508
  let
wenzelm@22765
   509
    val tsig = tsig_of thy;
wenzelm@22765
   510
wenzelm@22696
   511
    fun eq ((xi, S), (xi', S')) =
wenzelm@22696
   512
      Term.eq_ix (xi, xi') andalso Type.eq_sort tsig (S, S');
wenzelm@22696
   513
    val env = distinct eq raw_env;
wenzelm@22696
   514
    val _ = (case duplicates (eq_fst (op =)) env of [] => ()
wenzelm@22696
   515
      | dups => error ("Inconsistent sort constraints for type variable(s) "
wenzelm@22696
   516
          ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
wenzelm@22696
   517
wenzelm@22696
   518
    fun get xi =
wenzelm@22696
   519
      (case (AList.lookup (op =) env xi, def_sort xi) of
wenzelm@22696
   520
        (NONE, NONE) => Type.defaultS tsig
wenzelm@22696
   521
      | (NONE, SOME S) => S
wenzelm@22696
   522
      | (SOME S, NONE) => S
wenzelm@22696
   523
      | (SOME S, SOME S') =>
wenzelm@22696
   524
          if Type.eq_sort tsig (S, S') then S'
wenzelm@22696
   525
          else error ("Sort constraint inconsistent with default for type variable " ^
wenzelm@22696
   526
            quote (Term.string_of_vname' xi)));
wenzelm@22696
   527
  in get end;
wenzelm@22696
   528
wenzelm@16337
   529
local
wenzelm@16337
   530
wenzelm@24273
   531
fun gen_read_typ mode (thy, def_sort) str =
wenzelm@16337
   532
  let
wenzelm@24273
   533
    val ctxt = ProofContext.init thy;
wenzelm@24273
   534
    val syn = syn_of thy;
wenzelm@22696
   535
    val T = intern_tycons thy
wenzelm@24273
   536
      (Syntax.standard_parse_typ ctxt syn (get_sort thy def_sort) (intern_sort thy) str);
wenzelm@24273
   537
  in certify_typ_mode mode thy T handle TYPE (msg, _, _) => error msg end
wenzelm@18678
   538
  handle ERROR msg => cat_error msg ("The error(s) above occurred in type " ^ quote str);
wenzelm@16337
   539
wenzelm@16337
   540
in
wenzelm@16337
   541
wenzelm@16442
   542
fun no_def_sort thy = (thy: theory, K NONE);
wenzelm@16337
   543
wenzelm@24273
   544
val read_def_typ     = gen_read_typ Type.mode_default;
wenzelm@24273
   545
val read_typ         = gen_read_typ Type.mode_default o no_def_sort;
wenzelm@24273
   546
val read_typ_syntax  = gen_read_typ Type.mode_syntax o no_def_sort;
wenzelm@24273
   547
val read_typ_abbrev  = gen_read_typ Type.mode_abbrev o no_def_sort;
wenzelm@16337
   548
wenzelm@16337
   549
end;
wenzelm@16337
   550
wenzelm@16337
   551
wenzelm@16368
   552
(* type and constant names *)
wenzelm@15703
   553
wenzelm@16442
   554
fun read_tyname thy raw_c =
wenzelm@19462
   555
  let val c = intern_type thy raw_c
wenzelm@19462
   556
  in Type (c, replicate (arity_number thy c) dummyT) end;
wenzelm@15703
   557
wenzelm@18967
   558
val read_const = Consts.read_const o consts_of;
wenzelm@15703
   559
wenzelm@15703
   560
wenzelm@251
   561
wenzelm@22696
   562
(* read_def_terms -- read terms and infer types *)    (*exception ERROR*)
wenzelm@251
   563
wenzelm@2979
   564
(*
wenzelm@16337
   565
  def_type: partial map from indexnames to types (constrains Frees and Vars)
wenzelm@16337
   566
  def_sort: partial map from indexnames to sorts (constrains TFrees and TVars)
wenzelm@20155
   567
  used: context of already used type variables
wenzelm@2979
   568
  freeze: if true then generated parameters are turned into TFrees, else TVars
wenzelm@2979
   569
*)
wenzelm@2979
   570
wenzelm@24233
   571
fun read_def_terms'
wenzelm@24233
   572
    pp is_logtype syn consts map_free ctxt (def_type, def_sort) used freeze raw_args =
wenzelm@251
   573
  let
wenzelm@22696
   574
    val thy = ProofContext.theory_of ctxt;
wenzelm@24517
   575
    fun check_typs Ts = map (certify_typ thy) Ts
wenzelm@24517
   576
      handle TYPE (msg, _, _) => error msg;
wenzelm@22696
   577
wenzelm@24485
   578
    fun infer args = TypeInfer.infer_types pp (tsig_of thy) check_typs
wenzelm@24761
   579
        (try (Consts.the_constraint consts)) def_type used ~1 (SOME freeze) args |>> map fst
wenzelm@24233
   580
      handle TYPE (msg, _, _) => error msg;
wenzelm@22696
   581
wenzelm@24370
   582
    fun check T t = Exn.Result (singleton (fst o infer) (t, T))
wenzelm@24370
   583
      handle ERROR msg => Exn.Exn (ERROR msg);
wenzelm@24233
   584
    val map_const = try (#1 o Term.dest_Const o Consts.read_const consts);
wenzelm@24370
   585
    fun read T = Syntax.standard_parse_term pp (check T) (get_sort thy def_sort) map_const map_free
wenzelm@24233
   586
        (intern_tycons thy) (intern_sort thy) ctxt is_logtype syn T;
wenzelm@4249
   587
  in
wenzelm@24233
   588
    raw_args
wenzelm@24233
   589
    |> map (fn (s, raw_T) =>
wenzelm@24233
   590
      let val T = certify_typ thy raw_T handle TYPE (msg, _, _) => error msg
wenzelm@24233
   591
      in (read (#1 (TypeInfer.paramify_dummies T 0)) s, T) end)
wenzelm@24233
   592
    |> infer
wenzelm@4249
   593
  end;
clasohm@623
   594
wenzelm@20230
   595
fun read_def_terms (thy, types, sorts) used freeze sTs =
wenzelm@20230
   596
  let
wenzelm@20230
   597
    val pp = pp thy;
wenzelm@20230
   598
    val consts = consts_of thy;
wenzelm@24674
   599
    val cert_consts = Consts.certify pp (tsig_of thy) true consts;
wenzelm@22765
   600
    fun map_free x = if is_some (types (x, ~1)) then SOME x else NONE;
wenzelm@20230
   601
    val (ts, inst) =
wenzelm@22765
   602
      read_def_terms' pp (is_logtype thy) (syn_of thy) consts map_free
wenzelm@21772
   603
        (ProofContext.init thy) (types, sorts) (Name.make_context used) freeze sTs;
wenzelm@20230
   604
  in (map cert_consts ts, inst) end;
wenzelm@12068
   605
wenzelm@16442
   606
fun simple_read_term thy T s =
wenzelm@16442
   607
  let val ([t], _) = read_def_terms (thy, K NONE, K NONE) [] true [(s, T)]
wenzelm@20230
   608
  in t end handle ERROR msg => cat_error msg ("The error(s) above occurred for term " ^ s);
wenzelm@8802
   609
wenzelm@22709
   610
fun read_term thy = simple_read_term thy dummyT;
wenzelm@16494
   611
fun read_prop thy = simple_read_term thy propT;
wenzelm@16494
   612
wenzelm@8607
   613
wenzelm@2979
   614
wenzelm@16337
   615
(** signature extension functions **)  (*exception ERROR/TYPE*)
wenzelm@386
   616
wenzelm@386
   617
(* add default sort *)
wenzelm@386
   618
wenzelm@16442
   619
fun gen_add_defsort prep_sort s thy =
wenzelm@16442
   620
  thy |> map_tsig (Type.set_defsort (prep_sort thy s));
wenzelm@8898
   621
wenzelm@24707
   622
val add_defsort = gen_add_defsort Syntax.read_sort_global;
wenzelm@16337
   623
val add_defsort_i = gen_add_defsort certify_sort;
wenzelm@386
   624
wenzelm@386
   625
wenzelm@386
   626
(* add type constructors *)
wenzelm@386
   627
wenzelm@16442
   628
fun add_types types thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@14856
   629
  let
wenzelm@16597
   630
    val syn' = Syntax.extend_type_gram types syn;
wenzelm@16368
   631
    val decls = map (fn (a, n, mx) => (Syntax.type_name a mx, n)) types;
wenzelm@16442
   632
    val tsig' = Type.add_types naming decls tsig;
wenzelm@16442
   633
  in (naming, syn', tsig', consts) end);
wenzelm@16442
   634
wenzelm@16442
   635
fun add_typedecls decls thy =
wenzelm@16442
   636
  let
wenzelm@20664
   637
    fun type_of (a, vs: string list, mx) =
haftmann@18928
   638
      if not (has_duplicates (op =) vs) then (a, length vs, mx)
wenzelm@16442
   639
      else error ("Duplicate parameters in type declaration: " ^ quote a);
wenzelm@16442
   640
  in add_types (map type_of decls) thy end;
wenzelm@16337
   641
wenzelm@16337
   642
wenzelm@16337
   643
(* add nonterminals *)
wenzelm@16337
   644
wenzelm@16442
   645
fun add_nonterminals ns thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337
   646
  let
wenzelm@16597
   647
    val syn' = Syntax.extend_consts ns syn;
wenzelm@16442
   648
    val tsig' = Type.add_nonterminals naming ns tsig;
wenzelm@16442
   649
  in (naming, syn', tsig', consts) end);
wenzelm@386
   650
wenzelm@386
   651
wenzelm@386
   652
(* add type abbreviations *)
wenzelm@386
   653
wenzelm@16442
   654
fun gen_add_tyabbr prep_typ (a, vs, rhs, mx) thy =
wenzelm@16442
   655
  thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337
   656
    let
wenzelm@16597
   657
      val syn' = Syntax.extend_type_gram [(a, length vs, mx)] syn;
wenzelm@16368
   658
      val a' = Syntax.type_name a mx;
wenzelm@24707
   659
      val abbr = (a', vs,
wenzelm@24707
   660
          certify_typ_mode Type.mode_syntax thy (prep_typ (ProofContext.init thy) rhs))
wenzelm@18678
   661
        handle ERROR msg => cat_error msg ("in type abbreviation " ^ quote a');
wenzelm@16442
   662
      val tsig' = Type.add_abbrevs naming [abbr] tsig;
wenzelm@16442
   663
    in (naming, syn', tsig', consts) end);
wenzelm@386
   664
wenzelm@24707
   665
val add_tyabbrs = fold (gen_add_tyabbr Syntax.parse_typ);
wenzelm@24273
   666
val add_tyabbrs_i = fold (gen_add_tyabbr (K I));
wenzelm@14784
   667
wenzelm@14784
   668
wenzelm@16337
   669
(* modify syntax *)
wenzelm@16337
   670
wenzelm@20784
   671
fun gen_syntax change_gram prep_typ mode args thy =
wenzelm@16337
   672
  let
wenzelm@24707
   673
    fun prep (c, T, mx) = (c,
wenzelm@24707
   674
        certify_typ_mode Type.mode_syntax thy (prep_typ (ProofContext.init thy) T), mx)
wenzelm@24273
   675
      handle ERROR msg =>
wenzelm@24273
   676
        cat_error msg ("in syntax declaration " ^ quote (Syntax.const_name c mx));
wenzelm@20784
   677
  in thy |> map_syn (change_gram (is_logtype thy) mode (map prep args)) end;
wenzelm@16337
   678
wenzelm@16337
   679
fun gen_add_syntax x = gen_syntax Syntax.extend_const_gram x;
wenzelm@386
   680
wenzelm@24707
   681
val add_modesyntax = gen_add_syntax Syntax.parse_typ;
wenzelm@24273
   682
val add_modesyntax_i = gen_add_syntax (K I);
wenzelm@16442
   683
val add_syntax = add_modesyntax Syntax.default_mode;
wenzelm@16442
   684
val add_syntax_i = add_modesyntax_i Syntax.default_mode;
wenzelm@24707
   685
val del_modesyntax = gen_syntax Syntax.remove_const_gram Syntax.parse_typ;
wenzelm@24273
   686
val del_modesyntax_i = gen_syntax Syntax.remove_const_gram (K I);
wenzelm@3805
   687
wenzelm@21661
   688
fun const_syntax thy (Const (c, _), mx) = try (Consts.syntax (consts_of thy)) (c, mx)
wenzelm@21206
   689
  | const_syntax _ _ = NONE;
wenzelm@21206
   690
wenzelm@21206
   691
fun add_notation mode args thy =
wenzelm@21206
   692
  thy |> add_modesyntax_i mode (map_filter (const_syntax thy) args);
wenzelm@19658
   693
wenzelm@16337
   694
wenzelm@16337
   695
(* add constants *)
wenzelm@386
   696
wenzelm@17995
   697
local
wenzelm@17995
   698
wenzelm@24776
   699
fun gen_add_consts prep_typ authentic tags raw_args thy =
wenzelm@386
   700
  let
wenzelm@19806
   701
    val prepT = Compress.typ thy o Logic.varifyT o Type.no_tvars o Term.no_dummyT o prep_typ thy;
wenzelm@19658
   702
    fun prep (raw_c, raw_T, raw_mx) =
wenzelm@19658
   703
      let
wenzelm@19658
   704
        val (c, mx) = Syntax.const_mixfix raw_c raw_mx;
wenzelm@19679
   705
        val c' = if authentic then Syntax.constN ^ full_name thy c else c;
wenzelm@19658
   706
        val T = (prepT raw_T handle TYPE (msg, _, _) => error msg) handle ERROR msg =>
wenzelm@19658
   707
          cat_error msg ("in declaration of constant " ^ quote c);
wenzelm@24776
   708
      in ((c, T), (c', T, mx)) end;
wenzelm@16337
   709
    val args = map prep raw_args;
wenzelm@16442
   710
  in
wenzelm@16442
   711
    thy
wenzelm@24776
   712
    |> map_consts (fold (Consts.declare authentic (naming_of thy) tags o #1) args)
wenzelm@19658
   713
    |> add_syntax_i (map #2 args)
wenzelm@16442
   714
  end;
wenzelm@386
   715
wenzelm@17995
   716
in
wenzelm@17995
   717
wenzelm@24776
   718
val add_consts = gen_add_consts read_typ false [];
wenzelm@24776
   719
val add_consts_i = gen_add_consts certify_typ false [];
wenzelm@19679
   720
val add_consts_authentic = gen_add_consts certify_typ true;
wenzelm@386
   721
wenzelm@17995
   722
end;
wenzelm@17995
   723
wenzelm@386
   724
wenzelm@21696
   725
(* add abbreviations *)
wenzelm@18941
   726
wenzelm@24776
   727
fun add_abbrev mode tags (c, raw_t) thy =
wenzelm@18941
   728
  let
wenzelm@21741
   729
    val pp = pp thy;
wenzelm@21741
   730
    val prep_tm = Compress.term thy o no_frees pp o
wenzelm@21741
   731
      map_types Logic.legacy_varifyT (* FIXME tmp *) o
wenzelm@21741
   732
      Term.no_dummy_patterns o cert_term_abbrev thy;
wenzelm@19806
   733
    val t = (prep_tm raw_t handle TYPE (msg, _, _) => error msg | TERM (msg, _) => error msg)
wenzelm@19366
   734
      handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c);
wenzelm@21696
   735
    val (res, consts') = consts_of thy
wenzelm@24776
   736
      |> Consts.abbreviate pp (tsig_of thy) (naming_of thy) mode tags (c, t);
wenzelm@21704
   737
  in (res, thy |> map_consts (K consts')) end;
wenzelm@18941
   738
wenzelm@18941
   739
wenzelm@16941
   740
(* add constraints *)
wenzelm@16941
   741
wenzelm@24761
   742
fun add_const_constraint (c, opt_T) thy =
wenzelm@16941
   743
  let
wenzelm@19099
   744
    fun prepT raw_T =
wenzelm@24761
   745
      let val T = Logic.varifyT (Type.no_tvars (Term.no_dummyT (certify_typ thy raw_T)))
wenzelm@19099
   746
      in cert_term thy (Const (c, T)); T end
wenzelm@16941
   747
      handle TYPE (msg, _, _) => error msg;
wenzelm@19099
   748
  in thy |> map_consts (Consts.constrain (c, Option.map prepT opt_T)) end;
wenzelm@16941
   749
wenzelm@16941
   750
wenzelm@19513
   751
(* primitive classes and arities *)
wenzelm@386
   752
wenzelm@19513
   753
fun primitive_class (bclass, classes) thy =
wenzelm@16442
   754
  thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337
   755
    let
wenzelm@16597
   756
      val syn' = Syntax.extend_consts [bclass] syn;
wenzelm@19513
   757
      val tsig' = Type.add_class (pp thy) naming (bclass, classes) tsig;
wenzelm@16442
   758
    in (naming, syn', tsig', consts) end)
wenzelm@19391
   759
  |> add_consts_i [(Logic.const_of_class bclass, Term.a_itselfT --> propT, NoSyn)];
wenzelm@3791
   760
wenzelm@19513
   761
fun primitive_classrel arg thy = thy |> map_tsig (Type.add_classrel (pp thy) arg);
wenzelm@19513
   762
fun primitive_arity arg thy = thy |> map_tsig (Type.add_arity (pp thy) arg);
wenzelm@421
   763
wenzelm@421
   764
wenzelm@14645
   765
(* add translation functions *)
wenzelm@14645
   766
wenzelm@15746
   767
local
wenzelm@15746
   768
wenzelm@15746
   769
fun mk trs = map Syntax.mk_trfun trs;
wenzelm@15746
   770
wenzelm@16597
   771
fun gen_add_trfuns ext non_typed (atrs, trs, tr's, atr's) =
wenzelm@16597
   772
  map_syn (ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's));
wenzelm@14645
   773
wenzelm@16597
   774
fun gen_add_trfunsT ext tr's = map_syn (ext ([], [], mk tr's, []));
wenzelm@14645
   775
wenzelm@15746
   776
in
wenzelm@15746
   777
wenzelm@16597
   778
val add_trfuns = gen_add_trfuns Syntax.extend_trfuns Syntax.non_typed_tr';
wenzelm@16597
   779
val add_trfunsT = gen_add_trfunsT Syntax.extend_trfuns;
wenzelm@16597
   780
val add_advanced_trfuns = gen_add_trfuns Syntax.extend_advanced_trfuns Syntax.non_typed_tr'';
wenzelm@16597
   781
val add_advanced_trfunsT = gen_add_trfunsT Syntax.extend_advanced_trfuns;
wenzelm@14645
   782
wenzelm@15746
   783
end;
wenzelm@15746
   784
wenzelm@16597
   785
val add_tokentrfuns = map_syn o Syntax.extend_tokentrfuns;
wenzelm@16442
   786
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
wenzelm@14645
   787
wenzelm@14645
   788
wenzelm@19258
   789
(* translation rules *)
wenzelm@4619
   790
wenzelm@19258
   791
fun gen_trrules f args thy = thy |> map_syn (fn syn =>
wenzelm@16442
   792
  let val rules = map (Syntax.map_trrule (apfst (intern_type thy))) args
wenzelm@21772
   793
  in f (ProofContext.init thy) (is_logtype thy) syn rules syn end);
wenzelm@8725
   794
wenzelm@19258
   795
val add_trrules = gen_trrules Syntax.extend_trrules;
wenzelm@19258
   796
val del_trrules = gen_trrules Syntax.remove_trrules;
wenzelm@16597
   797
val add_trrules_i = map_syn o Syntax.extend_trrules_i;
wenzelm@19258
   798
val del_trrules_i = map_syn o Syntax.remove_trrules_i;
wenzelm@386
   799
wenzelm@386
   800
wenzelm@16337
   801
(* modify naming *)
wenzelm@6546
   802
wenzelm@19054
   803
val add_path        = map_naming o NameSpace.add_path;
wenzelm@19054
   804
val no_base_names   = map_naming NameSpace.no_base_names;
wenzelm@19054
   805
val qualified_names = map_naming NameSpace.qualified_names;
wenzelm@19054
   806
val sticky_prefix   = map_naming o NameSpace.sticky_prefix;
wenzelm@19054
   807
val set_policy      = map_naming o NameSpace.set_policy;
wenzelm@19054
   808
val restore_naming  = map_naming o K o naming_of;
wenzelm@6546
   809
wenzelm@19013
   810
val parent_path   = add_path "..";
wenzelm@19013
   811
val root_path     = add_path "/";
wenzelm@19013
   812
val absolute_path = add_path "//";
wenzelm@16442
   813
wenzelm@16442
   814
fun local_path thy = thy |> root_path |> add_path (Context.theory_name thy);
wenzelm@16442
   815
wenzelm@6546
   816
wenzelm@16337
   817
(* hide names *)
wenzelm@386
   818
wenzelm@16442
   819
fun hide_classes b xs thy = thy |> map_tsig (Type.hide_classes b (map (intern_class thy) xs));
wenzelm@16368
   820
val hide_classes_i = map_tsig oo Type.hide_classes;
wenzelm@16442
   821
fun hide_types b xs thy = thy |> map_tsig (Type.hide_types b (map (intern_type thy) xs));
wenzelm@16368
   822
val hide_types_i = map_tsig oo Type.hide_types;
wenzelm@18062
   823
fun hide_consts b xs thy = thy |> map_consts (fold (Consts.hide b o intern_const thy) xs);
wenzelm@18062
   824
val hide_consts_i = map_consts oo (fold o Consts.hide);
wenzelm@386
   825
wenzelm@17343
   826
local
wenzelm@17343
   827
wenzelm@17343
   828
val kinds =
wenzelm@17343
   829
 [("class", (intern_class, can o certify_class, hide_classes_i)),
wenzelm@17343
   830
  ("type", (intern_type, declared_tyname, hide_types_i)),
wenzelm@17343
   831
  ("const", (intern_const, declared_const, hide_consts_i))];
wenzelm@17343
   832
wenzelm@17343
   833
fun gen_hide int b (kind, xnames) thy =
wenzelm@17343
   834
  (case AList.lookup (op =) kinds kind of
wenzelm@17343
   835
    SOME (intern, check, hide) =>
wenzelm@17343
   836
      let
wenzelm@17343
   837
        val names = if int then map (intern thy) xnames else xnames;
wenzelm@17343
   838
        val bads = filter_out (check thy) names;
wenzelm@17343
   839
      in
wenzelm@17343
   840
        if null bads then hide b names thy
wenzelm@17343
   841
        else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
wenzelm@17343
   842
      end
wenzelm@17343
   843
  | NONE => error ("Bad name space specification: " ^ quote kind));
wenzelm@17343
   844
wenzelm@17343
   845
in
wenzelm@17343
   846
wenzelm@17343
   847
val hide_names = gen_hide true;
wenzelm@17343
   848
val hide_names_i = gen_hide false;
wenzelm@17343
   849
clasohm@0
   850
end;
wenzelm@17343
   851
wenzelm@17343
   852
end;