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