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