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