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