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