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