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