src/Pure/sign.ML
author wenzelm
Wed Jun 18 18:55:05 2008 +0200 (2008-06-18)
changeset 27257 ddc00dbad26b
parent 27205 56c96c02ab79
child 27284 2ddb6a2db65c
permissions -rw-r--r--
removed obsolete term reading operations (cf. old_goals.ML for legacy emulations);
wenzelm@19
     1
(*  Title:      Pure/sign.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@251
     3
    Author:     Lawrence C Paulson and Markus Wenzel
clasohm@0
     4
wenzelm@16442
     5
Logical signature content: naming conventions, concrete syntax, type
wenzelm@18062
     6
signature, polymorphic constants.
clasohm@0
     7
*)
clasohm@0
     8
wenzelm@16442
     9
signature SIGN =
wenzelm@5642
    10
sig
wenzelm@16442
    11
  val rep_sg: theory ->
wenzelm@16442
    12
   {naming: NameSpace.naming,
wenzelm@16597
    13
    syn: Syntax.syntax,
wenzelm@16442
    14
    tsig: Type.tsig,
wenzelm@18062
    15
    consts: Consts.T}
wenzelm@16442
    16
  val naming_of: theory -> NameSpace.naming
wenzelm@16442
    17
  val base_name: string -> bstring
wenzelm@16442
    18
  val full_name: theory -> bstring -> string
wenzelm@16442
    19
  val full_name_path: theory -> string -> bstring -> string
wenzelm@16442
    20
  val declare_name: theory -> string -> NameSpace.T -> NameSpace.T
wenzelm@16442
    21
  val syn_of: theory -> Syntax.syntax
wenzelm@16442
    22
  val tsig_of: theory -> Type.tsig
wenzelm@19642
    23
  val classes_of: theory -> Sorts.algebra
wenzelm@21932
    24
  val all_classes: theory -> class list
wenzelm@19407
    25
  val super_classes: theory -> class -> class list
wenzelm@24732
    26
  val minimize_sort: theory -> sort -> sort
wenzelm@24732
    27
  val complete_sort: theory -> sort -> sort
wenzelm@16442
    28
  val defaultS: theory -> sort
wenzelm@16442
    29
  val subsort: theory -> sort * sort -> bool
wenzelm@16442
    30
  val of_sort: theory -> typ * sort -> bool
wenzelm@16442
    31
  val witness_sorts: theory -> sort list -> sort list -> (typ * sort) list
wenzelm@24732
    32
  val is_logtype: theory -> string -> bool
wenzelm@16442
    33
  val typ_instance: theory -> typ * typ -> bool
wenzelm@19427
    34
  val typ_equiv: theory -> typ * typ -> bool
wenzelm@16941
    35
  val typ_match: theory -> typ * typ -> Type.tyenv -> Type.tyenv
wenzelm@16941
    36
  val typ_unify: theory -> typ * typ -> Type.tyenv * int -> Type.tyenv * int
wenzelm@18967
    37
  val consts_of: theory -> Consts.T
haftmann@17037
    38
  val the_const_constraint: theory -> string -> typ
wenzelm@16442
    39
  val const_type: theory -> string -> typ option
wenzelm@16442
    40
  val the_const_type: theory -> string -> typ
wenzelm@16442
    41
  val declared_tyname: theory -> string -> bool
wenzelm@16442
    42
  val declared_const: theory -> string -> bool
wenzelm@18062
    43
  val const_monomorphic: theory -> string -> bool
wenzelm@21183
    44
  val const_syntax_name: theory -> string -> string
wenzelm@18146
    45
  val const_typargs: theory -> string * typ -> typ list
wenzelm@18164
    46
  val const_instance: theory -> string * typ list -> typ
haftmann@26268
    47
  val mk_const: theory -> string * typ list -> term
wenzelm@16442
    48
  val class_space: theory -> NameSpace.T
wenzelm@16442
    49
  val type_space: theory -> NameSpace.T
wenzelm@16442
    50
  val const_space: theory -> NameSpace.T
wenzelm@16442
    51
  val intern_class: theory -> xstring -> string
wenzelm@16442
    52
  val extern_class: theory -> string -> xstring
wenzelm@16442
    53
  val intern_type: theory -> xstring -> string
wenzelm@16442
    54
  val extern_type: theory -> string -> xstring
wenzelm@16442
    55
  val intern_const: theory -> xstring -> string
wenzelm@16442
    56
  val extern_const: theory -> string -> xstring
wenzelm@16442
    57
  val intern_sort: theory -> sort -> sort
wenzelm@16442
    58
  val extern_sort: theory -> sort -> sort
wenzelm@16442
    59
  val intern_typ: theory -> typ -> typ
wenzelm@16442
    60
  val extern_typ: theory -> typ -> typ
wenzelm@16442
    61
  val intern_term: theory -> term -> term
wenzelm@18994
    62
  val extern_term: (string -> xstring) -> theory -> term -> term
wenzelm@16442
    63
  val intern_tycons: theory -> typ -> typ
wenzelm@19462
    64
  val arity_number: theory -> string -> int
wenzelm@19462
    65
  val arity_sorts: theory -> string -> sort -> sort list
wenzelm@16442
    66
  val certify_class: theory -> class -> class
wenzelm@16442
    67
  val certify_sort: theory -> sort -> sort
wenzelm@16442
    68
  val certify_typ: theory -> typ -> typ
wenzelm@24273
    69
  val certify_typ_mode: Type.mode -> theory -> typ -> typ
wenzelm@24674
    70
  val certify': bool -> Pretty.pp -> bool -> Consts.T -> theory -> term -> term * typ * int
wenzelm@18967
    71
  val certify_term: theory -> term -> term * typ * int
wenzelm@18967
    72
  val certify_prop: theory -> term -> term * typ * int
wenzelm@16494
    73
  val cert_term: theory -> term -> term
wenzelm@16494
    74
  val cert_prop: theory -> term -> term
wenzelm@21741
    75
  val no_frees: Pretty.pp -> term -> term
wenzelm@18941
    76
  val no_vars: Pretty.pp -> term -> term
wenzelm@24981
    77
  val cert_def: Proof.context -> term -> (string * typ) * term
wenzelm@19244
    78
  val read_class: theory -> xstring -> class
wenzelm@19244
    79
  val read_arity: theory -> xstring * string list * string -> arity
wenzelm@19244
    80
  val cert_arity: theory -> arity -> arity
wenzelm@22765
    81
  val get_sort: theory ->
wenzelm@22765
    82
    (indexname -> sort option) -> (indexname * sort) list -> indexname -> sort
wenzelm@22683
    83
  val read_def_typ: theory * (indexname -> sort option) -> string -> typ
wenzelm@22683
    84
  val read_typ: theory -> string -> typ
wenzelm@22683
    85
  val read_typ_syntax: theory -> string -> typ
wenzelm@22683
    86
  val read_typ_abbrev: theory -> string -> typ
wenzelm@26667
    87
  val add_defsort: string -> theory -> theory
wenzelm@26667
    88
  val add_defsort_i: sort -> theory -> theory
wenzelm@26667
    89
  val add_types: (bstring * int * mixfix) list -> theory -> theory
wenzelm@26667
    90
  val add_nonterminals: bstring list -> theory -> theory
wenzelm@26667
    91
  val add_tyabbrs: (bstring * string list * string * mixfix) list -> theory -> theory
wenzelm@26667
    92
  val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> theory -> theory
wenzelm@26667
    93
  val add_syntax: (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667
    94
  val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@26667
    95
  val add_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667
    96
  val add_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@26667
    97
  val del_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667
    98
  val del_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@26667
    99
  val notation: bool -> Syntax.mode -> (term * mixfix) list -> theory -> theory
wenzelm@26667
   100
  val add_consts: (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667
   101
  val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@24973
   102
  val declare_const: Markup.property list -> bstring * typ * mixfix -> theory -> term * theory
wenzelm@24776
   103
  val add_abbrev: string -> Markup.property list ->
wenzelm@24776
   104
    bstring * term -> theory -> (term * term) * theory
wenzelm@25049
   105
  val revert_abbrev: string -> string -> theory -> theory
wenzelm@24761
   106
  val add_const_constraint: string * typ option -> theory -> theory
wenzelm@22811
   107
  val primitive_class: string * class list -> theory -> theory
wenzelm@22811
   108
  val primitive_classrel: class * class -> theory -> theory
wenzelm@22811
   109
  val primitive_arity: arity -> theory -> theory
wenzelm@26667
   110
  val add_trfuns:
wenzelm@26667
   111
    (string * (ast list -> ast)) list *
wenzelm@26667
   112
    (string * (term list -> term)) list *
wenzelm@26667
   113
    (string * (term list -> term)) list *
wenzelm@26667
   114
    (string * (ast list -> ast)) list -> theory -> theory
wenzelm@26667
   115
  val add_trfunsT:
wenzelm@26667
   116
    (string * (bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@26667
   117
  val add_advanced_trfuns:
wenzelm@26667
   118
    (string * (Proof.context -> ast list -> ast)) list *
wenzelm@26667
   119
    (string * (Proof.context -> term list -> term)) list *
wenzelm@26667
   120
    (string * (Proof.context -> term list -> term)) list *
wenzelm@26667
   121
    (string * (Proof.context -> ast list -> ast)) list -> theory -> theory
wenzelm@26667
   122
  val add_advanced_trfunsT:
wenzelm@26667
   123
    (string * (Proof.context -> bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@26667
   124
  val add_tokentrfuns:
wenzelm@26701
   125
    (string * string * (Proof.context -> string -> Pretty.T)) list -> theory -> theory
wenzelm@26701
   126
  val add_mode_tokentrfuns: string -> (string * (Proof.context -> string -> Pretty.T)) list
wenzelm@26667
   127
    -> theory -> theory
wenzelm@26667
   128
  val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@26667
   129
  val del_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@26667
   130
  val add_trrules_i: ast Syntax.trrule list -> theory -> theory
wenzelm@26667
   131
  val del_trrules_i: ast Syntax.trrule list -> theory -> theory
wenzelm@26667
   132
  val add_path: string -> theory -> theory
wenzelm@26667
   133
  val parent_path: theory -> theory
wenzelm@26667
   134
  val root_path: theory -> theory
wenzelm@26667
   135
  val absolute_path: theory -> theory
wenzelm@26667
   136
  val local_path: theory -> theory
wenzelm@26667
   137
  val no_base_names: theory -> theory
wenzelm@26667
   138
  val qualified_names: theory -> theory
wenzelm@26667
   139
  val sticky_prefix: string -> theory -> theory
wenzelm@26667
   140
  val restore_naming: theory -> theory -> theory
wenzelm@26667
   141
  val hide_class: bool -> string -> theory -> theory
wenzelm@26667
   142
  val hide_type: bool -> string -> theory -> theory
wenzelm@26667
   143
  val hide_const: bool -> string -> theory -> theory
wenzelm@16442
   144
end
wenzelm@5642
   145
wenzelm@16442
   146
structure Sign: SIGN =
wenzelm@143
   147
struct
clasohm@0
   148
wenzelm@16442
   149
(** datatype sign **)
wenzelm@16337
   150
wenzelm@16442
   151
datatype sign = Sign of
wenzelm@18062
   152
 {naming: NameSpace.naming,     (*common naming conventions*)
wenzelm@18062
   153
  syn: Syntax.syntax,           (*concrete syntax for terms, types, sorts*)
wenzelm@18062
   154
  tsig: Type.tsig,              (*order-sorted signature of types*)
wenzelm@18062
   155
  consts: Consts.T};            (*polymorphic constants*)
wenzelm@16442
   156
wenzelm@16442
   157
fun make_sign (naming, syn, tsig, consts) =
wenzelm@16442
   158
  Sign {naming = naming, syn = syn, tsig = tsig, consts = consts};
wenzelm@16442
   159
wenzelm@16442
   160
structure SignData = TheoryDataFun
wenzelm@22846
   161
(
wenzelm@16442
   162
  type T = sign;
wenzelm@16442
   163
  val copy = I;
wenzelm@17405
   164
  fun extend (Sign {syn, tsig, consts, ...}) =
wenzelm@17405
   165
    make_sign (NameSpace.default_naming, syn, tsig, consts);
wenzelm@16442
   166
wenzelm@18062
   167
  val empty =
wenzelm@18714
   168
    make_sign (NameSpace.default_naming, Syntax.basic_syn, Type.empty_tsig, Consts.empty);
wenzelm@16442
   169
wenzelm@16442
   170
  fun merge pp (sign1, sign2) =
wenzelm@16442
   171
    let
wenzelm@18062
   172
      val Sign {naming = _, syn = syn1, tsig = tsig1, consts = consts1} = sign1;
wenzelm@18062
   173
      val Sign {naming = _, syn = syn2, tsig = tsig2, consts = consts2} = sign2;
wenzelm@16442
   174
wenzelm@16442
   175
      val naming = NameSpace.default_naming;
wenzelm@16597
   176
      val syn = Syntax.merge_syntaxes syn1 syn2;
wenzelm@16442
   177
      val tsig = Type.merge_tsigs pp (tsig1, tsig2);
wenzelm@18062
   178
      val consts = Consts.merge (consts1, consts2);
wenzelm@18062
   179
    in make_sign (naming, syn, tsig, consts) end;
wenzelm@22846
   180
);
wenzelm@16442
   181
wenzelm@16442
   182
fun rep_sg thy = SignData.get thy |> (fn Sign args => args);
wenzelm@16442
   183
wenzelm@16442
   184
fun map_sign f = SignData.map (fn Sign {naming, syn, tsig, consts} =>
wenzelm@16442
   185
  make_sign (f (naming, syn, tsig, consts)));
wenzelm@16442
   186
wenzelm@16442
   187
fun map_naming f = map_sign (fn (naming, syn, tsig, consts) => (f naming, syn, tsig, consts));
wenzelm@16442
   188
fun map_syn f = map_sign (fn (naming, syn, tsig, consts) => (naming, f syn, tsig, consts));
wenzelm@16442
   189
fun map_tsig f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, f tsig, consts));
wenzelm@16442
   190
fun map_consts f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, tsig, f consts));
wenzelm@16442
   191
wenzelm@16337
   192
wenzelm@16337
   193
(* naming *)
wenzelm@16337
   194
wenzelm@16442
   195
val naming_of = #naming o rep_sg;
wenzelm@16337
   196
val base_name = NameSpace.base;
wenzelm@16337
   197
val full_name = NameSpace.full o naming_of;
wenzelm@16442
   198
fun full_name_path thy elems = NameSpace.full (NameSpace.add_path elems (naming_of thy));
wenzelm@16337
   199
val declare_name = NameSpace.declare o naming_of;
wenzelm@14645
   200
wenzelm@14645
   201
wenzelm@14645
   202
(* syntax *)
wenzelm@14645
   203
wenzelm@16597
   204
val syn_of = #syn o rep_sg;
wenzelm@14645
   205
clasohm@0
   206
wenzelm@16337
   207
(* type signature *)
wenzelm@16337
   208
wenzelm@16337
   209
val tsig_of = #tsig o rep_sg;
wenzelm@24732
   210
wenzelm@19642
   211
val classes_of = #2 o #classes o Type.rep_tsig o tsig_of;
wenzelm@21932
   212
val all_classes = Sorts.all_classes o classes_of;
wenzelm@19642
   213
val super_classes = Sorts.super_classes o classes_of;
wenzelm@24732
   214
val minimize_sort = Sorts.minimize_sort o classes_of;
wenzelm@24732
   215
val complete_sort = Sorts.complete_sort o classes_of;
wenzelm@24732
   216
wenzelm@4844
   217
val defaultS = Type.defaultS o tsig_of;
wenzelm@4568
   218
val subsort = Type.subsort o tsig_of;
wenzelm@7640
   219
val of_sort = Type.of_sort o tsig_of;
wenzelm@7640
   220
val witness_sorts = Type.witness_sorts o tsig_of;
wenzelm@24732
   221
val is_logtype = member (op =) o Type.logical_types o tsig_of;
wenzelm@24732
   222
wenzelm@14784
   223
val typ_instance = Type.typ_instance o tsig_of;
wenzelm@19427
   224
fun typ_equiv thy (T, U) = typ_instance thy (T, U) andalso typ_instance thy (U, T);
wenzelm@16941
   225
val typ_match = Type.typ_match o tsig_of;
wenzelm@16941
   226
val typ_unify = Type.unify o tsig_of;
wenzelm@4256
   227
wenzelm@4256
   228
wenzelm@18062
   229
(* polymorphic constants *)
wenzelm@16941
   230
wenzelm@18062
   231
val consts_of = #consts o rep_sg;
wenzelm@21722
   232
val the_const_constraint = Consts.the_constraint o consts_of;
wenzelm@25042
   233
val the_const_type = Consts.the_type o consts_of;
wenzelm@18062
   234
val const_type = try o the_const_type;
wenzelm@21722
   235
val const_monomorphic = Consts.is_monomorphic o consts_of;
wenzelm@21183
   236
val const_syntax_name = Consts.syntax_name o consts_of;
wenzelm@18062
   237
val const_typargs = Consts.typargs o consts_of;
wenzelm@18164
   238
val const_instance = Consts.instance o consts_of;
wenzelm@4256
   239
haftmann@26268
   240
fun mk_const thy (c, Ts) = Const (c, const_instance thy (c, Ts));
haftmann@26268
   241
wenzelm@16894
   242
val declared_tyname = Symtab.defined o #2 o #types o Type.rep_tsig o tsig_of;
wenzelm@24761
   243
val declared_const = can o the_const_constraint;
wenzelm@620
   244
wenzelm@402
   245
clasohm@0
   246
wenzelm@16337
   247
(** intern / extern names **)
wenzelm@16337
   248
wenzelm@16368
   249
val class_space = #1 o #classes o Type.rep_tsig o tsig_of;
wenzelm@16368
   250
val type_space = #1 o #types o Type.rep_tsig o tsig_of;
wenzelm@18967
   251
val const_space = Consts.space_of o consts_of;
wenzelm@14645
   252
wenzelm@16368
   253
val intern_class = NameSpace.intern o class_space;
wenzelm@16368
   254
val extern_class = NameSpace.extern o class_space;
wenzelm@16368
   255
val intern_type = NameSpace.intern o type_space;
wenzelm@16368
   256
val extern_type = NameSpace.extern o type_space;
wenzelm@16368
   257
val intern_const = NameSpace.intern o const_space;
wenzelm@16368
   258
val extern_const = NameSpace.extern o const_space;
wenzelm@16337
   259
wenzelm@16337
   260
val intern_sort = map o intern_class;
wenzelm@16337
   261
val extern_sort = map o extern_class;
wenzelm@16337
   262
wenzelm@16337
   263
local
wenzelm@14645
   264
wenzelm@18892
   265
fun map_typ f g (Type (c, Ts)) = Type (g c, map (map_typ f g) Ts)
wenzelm@18892
   266
  | map_typ f _ (TFree (x, S)) = TFree (x, map f S)
wenzelm@18892
   267
  | map_typ f _ (TVar (xi, S)) = TVar (xi, map f S);
wenzelm@18892
   268
wenzelm@18892
   269
fun map_term f g h (Const (c, T)) = Const (h c, map_typ f g T)
wenzelm@18892
   270
  | map_term f g _ (Free (x, T)) = Free (x, map_typ f g T)
wenzelm@18892
   271
  | map_term f g _ (Var (xi, T)) = Var (xi, map_typ f g T)
wenzelm@18892
   272
  | map_term _ _ _ (t as Bound _) = t
wenzelm@18892
   273
  | map_term f g h (Abs (x, T, t)) = Abs (x, map_typ f g T, map_term f g h t)
wenzelm@18892
   274
  | map_term f g h (t $ u) = map_term f g h t $ map_term f g h u;
wenzelm@18892
   275
wenzelm@18994
   276
val add_classesT = Term.fold_atyps
wenzelm@18994
   277
  (fn TFree (_, S) => fold (insert (op =)) S
wenzelm@18994
   278
    | TVar (_, S) => fold (insert (op =)) S
wenzelm@18994
   279
    | _ => I);
wenzelm@18994
   280
wenzelm@18994
   281
fun add_tyconsT (Type (c, Ts)) = insert (op =) c #> fold add_tyconsT Ts
wenzelm@18994
   282
  | add_tyconsT _ = I;
wenzelm@18994
   283
wenzelm@18994
   284
val add_consts = Term.fold_aterms (fn Const (c, _) => insert (op =) c | _ => I);
wenzelm@18994
   285
wenzelm@16337
   286
fun mapping add_names f t =
wenzelm@16337
   287
  let
wenzelm@20664
   288
    fun f' (x: string) = let val y = f x in if x = y then NONE else SOME (x, y) end;
wenzelm@19482
   289
    val tab = map_filter f' (add_names t []);
wenzelm@18941
   290
    fun get x = the_default x (AList.lookup (op =) tab x);
wenzelm@16337
   291
  in get end;
wenzelm@16337
   292
wenzelm@16442
   293
fun typ_mapping f g thy T =
wenzelm@18892
   294
  T |> map_typ
wenzelm@18994
   295
    (mapping add_classesT (f thy) T)
wenzelm@18994
   296
    (mapping add_tyconsT (g thy) T);
wenzelm@14645
   297
wenzelm@16442
   298
fun term_mapping f g h thy t =
wenzelm@18892
   299
  t |> map_term
wenzelm@18994
   300
    (mapping (Term.fold_types add_classesT) (f thy) t)
wenzelm@18994
   301
    (mapping (Term.fold_types add_tyconsT) (g thy) t)
wenzelm@18994
   302
    (mapping add_consts (h thy) t);
wenzelm@16337
   303
wenzelm@16337
   304
in
wenzelm@14645
   305
wenzelm@16368
   306
val intern_typ = typ_mapping intern_class intern_type;
wenzelm@16368
   307
val extern_typ = typ_mapping extern_class extern_type;
wenzelm@16368
   308
val intern_term = term_mapping intern_class intern_type intern_const;
wenzelm@18994
   309
fun extern_term h = term_mapping extern_class extern_type (K h);
wenzelm@16368
   310
val intern_tycons = typ_mapping (K I) intern_type;
wenzelm@16337
   311
wenzelm@16337
   312
end;
wenzelm@14645
   313
wenzelm@14645
   314
wenzelm@14645
   315
wenzelm@16337
   316
(** certify entities **)    (*exception TYPE*)
wenzelm@8898
   317
wenzelm@16337
   318
(* certify wrt. type signature *)
wenzelm@8898
   319
wenzelm@19462
   320
val arity_number = Type.arity_number o tsig_of;
wenzelm@26939
   321
fun arity_sorts thy = Type.arity_sorts (Syntax.pp_global thy) (tsig_of thy);
wenzelm@19462
   322
wenzelm@24273
   323
val certify_class         = Type.cert_class o tsig_of;
wenzelm@24273
   324
val certify_sort          = Type.cert_sort o tsig_of;
wenzelm@24273
   325
val certify_typ           = Type.cert_typ o tsig_of;
wenzelm@24273
   326
fun certify_typ_mode mode = Type.cert_typ_mode mode o tsig_of;
wenzelm@10443
   327
wenzelm@4961
   328
wenzelm@18967
   329
(* certify term/prop *)
wenzelm@4961
   330
wenzelm@14987
   331
local
nipkow@1494
   332
wenzelm@16337
   333
fun type_check pp tm =
wenzelm@4961
   334
  let
wenzelm@4961
   335
    fun err_appl why bs t T u U =
wenzelm@4961
   336
      let
wenzelm@10404
   337
        val xs = map Free bs;           (*we do not rename here*)
wenzelm@4961
   338
        val t' = subst_bounds (xs, t);
wenzelm@4961
   339
        val u' = subst_bounds (xs, u);
wenzelm@16337
   340
        val msg = cat_lines
wenzelm@14828
   341
          (TypeInfer.appl_error (Syntax.pp_show_brackets pp) why t' T u' U);
wenzelm@16337
   342
      in raise TYPE (msg, [T, U], [t', u']) end;
wenzelm@4961
   343
wenzelm@4961
   344
    fun typ_of (_, Const (_, T)) = T
wenzelm@4961
   345
      | typ_of (_, Free  (_, T)) = T
wenzelm@4961
   346
      | typ_of (_, Var (_, T)) = T
skalberg@15570
   347
      | typ_of (bs, Bound i) = snd (List.nth (bs, i) handle Subscript =>
wenzelm@4961
   348
          raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
wenzelm@4961
   349
      | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
wenzelm@4961
   350
      | typ_of (bs, t $ u) =
wenzelm@4961
   351
          let val T = typ_of (bs, t) and U = typ_of (bs, u) in
wenzelm@4961
   352
            (case T of
wenzelm@4961
   353
              Type ("fun", [T1, T2]) =>
wenzelm@14828
   354
                if T1 = U then T2 else err_appl "Incompatible operand type" bs t T u U
wenzelm@14828
   355
            | _ => err_appl "Operator not of function type" bs t T u U)
wenzelm@4961
   356
          end;
wenzelm@18967
   357
  in typ_of ([], tm) end;
wenzelm@4961
   358
wenzelm@18967
   359
fun err msg = raise TYPE (msg, [], []);
wenzelm@18967
   360
wenzelm@18967
   361
fun check_vars (t $ u) = (check_vars t; check_vars u)
wenzelm@18967
   362
  | check_vars (Abs (_, _, t)) = check_vars t
wenzelm@27205
   363
  | check_vars (Free (x, _)) =
wenzelm@27205
   364
      if NameSpace.is_qualified x then err ("Malformed variable: " ^ quote x) else ()
wenzelm@18967
   365
  | check_vars (Var (xi as (_, i), _)) =
wenzelm@18967
   366
      if i < 0 then err ("Malformed variable: " ^ quote (Term.string_of_vname xi)) else ()
wenzelm@18967
   367
  | check_vars _ = ();
clasohm@0
   368
wenzelm@14987
   369
in
wenzelm@14987
   370
wenzelm@24674
   371
fun certify' prop pp do_expand consts thy tm =
wenzelm@251
   372
  let
wenzelm@18967
   373
    val _ = check_vars tm;
wenzelm@20548
   374
    val tm' = Term.map_types (certify_typ thy) tm;
wenzelm@18967
   375
    val T = type_check pp tm';
wenzelm@18967
   376
    val _ = if prop andalso T <> propT then err "Term not of type prop" else ();
wenzelm@24674
   377
    val tm'' = Consts.certify pp (tsig_of thy) do_expand consts tm';
wenzelm@18967
   378
  in (if tm = tm'' then tm else tm'', T, Term.maxidx_of_term tm'') end;
wenzelm@169
   379
wenzelm@26939
   380
fun certify_term thy = certify' false (Syntax.pp_global thy) true (consts_of thy) thy;
wenzelm@26939
   381
fun certify_prop thy = certify' true (Syntax.pp_global thy) true (consts_of thy) thy;
wenzelm@18967
   382
wenzelm@26939
   383
fun cert_term_abbrev thy = #1 o certify' false (Syntax.pp_global thy) false (consts_of thy) thy;
wenzelm@18967
   384
val cert_term = #1 oo certify_term;
wenzelm@18967
   385
val cert_prop = #1 oo certify_prop;
wenzelm@251
   386
wenzelm@14987
   387
end;
wenzelm@14987
   388
wenzelm@251
   389
wenzelm@18941
   390
(* specifications *)
wenzelm@18941
   391
wenzelm@21741
   392
fun no_variables kind add addT mk mkT pp tm =
wenzelm@21741
   393
  (case (add tm [], addT tm []) of
wenzelm@18941
   394
    ([], []) => tm
wenzelm@25117
   395
  | (frees, tfrees) => error (Pretty.string_of (Pretty.block
wenzelm@25117
   396
      (Pretty.str ("Illegal " ^ kind ^ " variable(s) in term:") :: Pretty.brk 1 ::
wenzelm@25117
   397
       Pretty.commas (map (Pretty.term pp o mk) frees @ map (Pretty.typ pp o mkT) tfrees)))));
wenzelm@21741
   398
wenzelm@21741
   399
val no_frees = no_variables "free" Term.add_frees Term.add_tfrees Free TFree;
wenzelm@21741
   400
val no_vars = no_variables "schematic" Term.add_vars Term.add_tvars Var TVar;
wenzelm@18941
   401
wenzelm@24981
   402
fun cert_def ctxt tm =
wenzelm@18941
   403
  let val ((lhs, rhs), _) = tm
wenzelm@24981
   404
    |> no_vars (Syntax.pp ctxt)
wenzelm@18941
   405
    |> Logic.strip_imp_concl
wenzelm@24981
   406
    |> PrimitiveDefs.dest_def ctxt Term.is_Const (K false) (K false)
wenzelm@18941
   407
  in (Term.dest_Const (Term.head_of lhs), rhs) end
wenzelm@18941
   408
  handle TERM (msg, _) => error msg;
wenzelm@18941
   409
wenzelm@18941
   410
wenzelm@16337
   411
wenzelm@16442
   412
(** read and certify entities **)    (*exception ERROR*)
wenzelm@16337
   413
wenzelm@24273
   414
(* classes *)
wenzelm@19244
   415
wenzelm@19427
   416
fun read_class thy c = certify_class thy (intern_class thy c)
wenzelm@19427
   417
  handle TYPE (msg, _, _) => error msg;
wenzelm@16337
   418
wenzelm@16337
   419
wenzelm@19244
   420
(* type arities *)
wenzelm@19244
   421
wenzelm@19244
   422
fun prep_arity prep_tycon prep_sort thy (t, Ss, S) =
wenzelm@19244
   423
  let val arity = (prep_tycon thy t, map (prep_sort thy) Ss, prep_sort thy S)
wenzelm@26939
   424
  in Type.add_arity (Syntax.pp_global thy) arity (tsig_of thy); arity end;
wenzelm@19244
   425
wenzelm@24707
   426
val read_arity = prep_arity intern_type Syntax.read_sort_global;
wenzelm@19244
   427
val cert_arity = prep_arity (K I) certify_sort;
wenzelm@19244
   428
wenzelm@19244
   429
wenzelm@16337
   430
(* types *)
wenzelm@16337
   431
wenzelm@22765
   432
fun get_sort thy def_sort raw_env =
wenzelm@22696
   433
  let
wenzelm@22765
   434
    val tsig = tsig_of thy;
wenzelm@22765
   435
wenzelm@22696
   436
    fun eq ((xi, S), (xi', S')) =
wenzelm@22696
   437
      Term.eq_ix (xi, xi') andalso Type.eq_sort tsig (S, S');
wenzelm@22696
   438
    val env = distinct eq raw_env;
wenzelm@22696
   439
    val _ = (case duplicates (eq_fst (op =)) env of [] => ()
wenzelm@22696
   440
      | dups => error ("Inconsistent sort constraints for type variable(s) "
wenzelm@22696
   441
          ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
wenzelm@22696
   442
wenzelm@22696
   443
    fun get xi =
wenzelm@22696
   444
      (case (AList.lookup (op =) env xi, def_sort xi) of
wenzelm@22696
   445
        (NONE, NONE) => Type.defaultS tsig
wenzelm@22696
   446
      | (NONE, SOME S) => S
wenzelm@22696
   447
      | (SOME S, NONE) => S
wenzelm@22696
   448
      | (SOME S, SOME S') =>
wenzelm@22696
   449
          if Type.eq_sort tsig (S, S') then S'
wenzelm@22696
   450
          else error ("Sort constraint inconsistent with default for type variable " ^
wenzelm@22696
   451
            quote (Term.string_of_vname' xi)));
wenzelm@22696
   452
  in get end;
wenzelm@22696
   453
wenzelm@16337
   454
local
wenzelm@16337
   455
wenzelm@24273
   456
fun gen_read_typ mode (thy, def_sort) str =
wenzelm@16337
   457
  let
wenzelm@24273
   458
    val ctxt = ProofContext.init thy;
wenzelm@24273
   459
    val syn = syn_of thy;
wenzelm@22696
   460
    val T = intern_tycons thy
wenzelm@24273
   461
      (Syntax.standard_parse_typ ctxt syn (get_sort thy def_sort) (intern_sort thy) str);
wenzelm@24273
   462
  in certify_typ_mode mode thy T handle TYPE (msg, _, _) => error msg end
wenzelm@18678
   463
  handle ERROR msg => cat_error msg ("The error(s) above occurred in type " ^ quote str);
wenzelm@16337
   464
wenzelm@16337
   465
in
wenzelm@16337
   466
wenzelm@16442
   467
fun no_def_sort thy = (thy: theory, K NONE);
wenzelm@16337
   468
wenzelm@24273
   469
val read_def_typ     = gen_read_typ Type.mode_default;
wenzelm@24273
   470
val read_typ         = gen_read_typ Type.mode_default o no_def_sort;
wenzelm@24273
   471
val read_typ_syntax  = gen_read_typ Type.mode_syntax o no_def_sort;
wenzelm@24273
   472
val read_typ_abbrev  = gen_read_typ Type.mode_abbrev o no_def_sort;
wenzelm@16337
   473
wenzelm@16337
   474
end;
wenzelm@16337
   475
wenzelm@16337
   476
wenzelm@2979
   477
wenzelm@16337
   478
(** signature extension functions **)  (*exception ERROR/TYPE*)
wenzelm@386
   479
wenzelm@386
   480
(* add default sort *)
wenzelm@386
   481
wenzelm@16442
   482
fun gen_add_defsort prep_sort s thy =
wenzelm@16442
   483
  thy |> map_tsig (Type.set_defsort (prep_sort thy s));
wenzelm@8898
   484
wenzelm@24707
   485
val add_defsort = gen_add_defsort Syntax.read_sort_global;
wenzelm@16337
   486
val add_defsort_i = gen_add_defsort certify_sort;
wenzelm@386
   487
wenzelm@386
   488
wenzelm@386
   489
(* add type constructors *)
wenzelm@386
   490
wenzelm@16442
   491
fun add_types types thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@14856
   492
  let
wenzelm@25390
   493
    val syn' = Syntax.update_type_gram types syn;
wenzelm@16368
   494
    val decls = map (fn (a, n, mx) => (Syntax.type_name a mx, n)) types;
wenzelm@16442
   495
    val tsig' = Type.add_types naming decls tsig;
wenzelm@16442
   496
  in (naming, syn', tsig', consts) end);
wenzelm@16442
   497
wenzelm@16337
   498
wenzelm@16337
   499
(* add nonterminals *)
wenzelm@16337
   500
wenzelm@16442
   501
fun add_nonterminals ns thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337
   502
  let
wenzelm@25390
   503
    val syn' = Syntax.update_consts ns syn;
wenzelm@16442
   504
    val tsig' = Type.add_nonterminals naming ns tsig;
wenzelm@16442
   505
  in (naming, syn', tsig', consts) end);
wenzelm@386
   506
wenzelm@386
   507
wenzelm@386
   508
(* add type abbreviations *)
wenzelm@386
   509
wenzelm@25366
   510
fun gen_add_tyabbr parse_typ (a, vs, rhs, mx) thy =
wenzelm@16442
   511
  thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337
   512
    let
wenzelm@25366
   513
      val ctxt = ProofContext.init thy;
wenzelm@25390
   514
      val syn' = Syntax.update_type_gram [(a, length vs, mx)] syn;
wenzelm@16368
   515
      val a' = Syntax.type_name a mx;
wenzelm@25366
   516
      val abbr = (a', vs, certify_typ_mode Type.mode_syntax thy (parse_typ ctxt rhs))
wenzelm@18678
   517
        handle ERROR msg => cat_error msg ("in type abbreviation " ^ quote a');
wenzelm@16442
   518
      val tsig' = Type.add_abbrevs naming [abbr] tsig;
wenzelm@16442
   519
    in (naming, syn', tsig', consts) end);
wenzelm@386
   520
wenzelm@24707
   521
val add_tyabbrs = fold (gen_add_tyabbr Syntax.parse_typ);
wenzelm@24273
   522
val add_tyabbrs_i = fold (gen_add_tyabbr (K I));
wenzelm@14784
   523
wenzelm@14784
   524
wenzelm@16337
   525
(* modify syntax *)
wenzelm@16337
   526
wenzelm@25366
   527
fun gen_syntax change_gram parse_typ mode args thy =
wenzelm@16337
   528
  let
wenzelm@25366
   529
    val ctxt = ProofContext.init thy;
wenzelm@25366
   530
    fun prep (c, T, mx) = (c, certify_typ_mode Type.mode_syntax thy (parse_typ ctxt T), mx)
wenzelm@24273
   531
      handle ERROR msg =>
wenzelm@24273
   532
        cat_error msg ("in syntax declaration " ^ quote (Syntax.const_name c mx));
wenzelm@20784
   533
  in thy |> map_syn (change_gram (is_logtype thy) mode (map prep args)) end;
wenzelm@16337
   534
wenzelm@25390
   535
fun gen_add_syntax x = gen_syntax Syntax.update_const_gram x;
wenzelm@386
   536
wenzelm@24707
   537
val add_modesyntax = gen_add_syntax Syntax.parse_typ;
wenzelm@24273
   538
val add_modesyntax_i = gen_add_syntax (K I);
wenzelm@24959
   539
val add_syntax = add_modesyntax Syntax.mode_default;
wenzelm@24959
   540
val add_syntax_i = add_modesyntax_i Syntax.mode_default;
wenzelm@24707
   541
val del_modesyntax = gen_syntax Syntax.remove_const_gram Syntax.parse_typ;
wenzelm@24273
   542
val del_modesyntax_i = gen_syntax Syntax.remove_const_gram (K I);
wenzelm@3805
   543
wenzelm@25383
   544
fun notation add mode args thy =
wenzelm@25383
   545
  let
wenzelm@25383
   546
    val change_gram = if add then Syntax.update_const_gram else Syntax.remove_const_gram;
wenzelm@25383
   547
    fun const_syntax (Const (c, _), mx) = try (Consts.syntax (consts_of thy)) (c, mx)
wenzelm@25383
   548
      | const_syntax _ = NONE;
wenzelm@25383
   549
  in gen_syntax change_gram (K I) mode (map_filter const_syntax args) thy end;
wenzelm@19658
   550
wenzelm@16337
   551
wenzelm@16337
   552
(* add constants *)
wenzelm@386
   553
wenzelm@17995
   554
local
wenzelm@17995
   555
wenzelm@25366
   556
fun gen_add_consts parse_typ authentic tags raw_args thy =
wenzelm@386
   557
  let
wenzelm@25366
   558
    val ctxt = ProofContext.init thy;
wenzelm@25366
   559
    val prepT = Type.no_tvars o Term.no_dummyT o certify_typ thy o parse_typ ctxt;
wenzelm@19658
   560
    fun prep (raw_c, raw_T, raw_mx) =
wenzelm@19658
   561
      let
wenzelm@19658
   562
        val (c, mx) = Syntax.const_mixfix raw_c raw_mx;
wenzelm@24959
   563
        val full_c = full_name thy c;
wenzelm@24959
   564
        val c' = if authentic then Syntax.constN ^ full_c else c;
wenzelm@19658
   565
        val T = (prepT raw_T handle TYPE (msg, _, _) => error msg) handle ERROR msg =>
wenzelm@19658
   566
          cat_error msg ("in declaration of constant " ^ quote c);
wenzelm@26631
   567
        val T' = Logic.varifyT T;
wenzelm@24959
   568
      in ((c, T'), (c', T', mx), Const (full_c, T)) end;
wenzelm@16337
   569
    val args = map prep raw_args;
wenzelm@26978
   570
    val tags' = tags |> AList.update (op =) (Markup.theory_nameN, Context.theory_name thy);
wenzelm@16442
   571
  in
wenzelm@16442
   572
    thy
wenzelm@26978
   573
    |> map_consts (fold (Consts.declare authentic (naming_of thy) tags' o #1) args)
wenzelm@19658
   574
    |> add_syntax_i (map #2 args)
wenzelm@24959
   575
    |> pair (map #3 args)
wenzelm@16442
   576
  end;
wenzelm@386
   577
wenzelm@17995
   578
in
wenzelm@17995
   579
wenzelm@25366
   580
val add_consts = snd oo gen_add_consts Syntax.parse_typ false [];
wenzelm@25366
   581
val add_consts_i = snd oo gen_add_consts (K I) false [];
wenzelm@24959
   582
wenzelm@25366
   583
fun declare_const tags arg = gen_add_consts (K I) true tags [arg] #>> the_single;
wenzelm@386
   584
wenzelm@17995
   585
end;
wenzelm@17995
   586
wenzelm@386
   587
wenzelm@25049
   588
(* abbreviations *)
wenzelm@18941
   589
wenzelm@24776
   590
fun add_abbrev mode tags (c, raw_t) thy =
wenzelm@18941
   591
  let
wenzelm@26939
   592
    val pp = Syntax.pp_global thy;
wenzelm@26631
   593
    val prep_tm = no_frees pp o Term.no_dummy_patterns o cert_term_abbrev thy;
wenzelm@19806
   594
    val t = (prep_tm raw_t handle TYPE (msg, _, _) => error msg | TERM (msg, _) => error msg)
wenzelm@19366
   595
      handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c);
wenzelm@21696
   596
    val (res, consts') = consts_of thy
wenzelm@24776
   597
      |> Consts.abbreviate pp (tsig_of thy) (naming_of thy) mode tags (c, t);
wenzelm@25049
   598
  in (res, thy |> map_consts (K consts')) end;
wenzelm@25049
   599
wenzelm@25049
   600
fun revert_abbrev mode c = map_consts (Consts.revert_abbrev mode c);
wenzelm@18941
   601
wenzelm@18941
   602
wenzelm@16941
   603
(* add constraints *)
wenzelm@16941
   604
wenzelm@24761
   605
fun add_const_constraint (c, opt_T) thy =
wenzelm@16941
   606
  let
wenzelm@19099
   607
    fun prepT raw_T =
wenzelm@24761
   608
      let val T = Logic.varifyT (Type.no_tvars (Term.no_dummyT (certify_typ thy raw_T)))
wenzelm@19099
   609
      in cert_term thy (Const (c, T)); T end
wenzelm@16941
   610
      handle TYPE (msg, _, _) => error msg;
wenzelm@19099
   611
  in thy |> map_consts (Consts.constrain (c, Option.map prepT opt_T)) end;
wenzelm@16941
   612
wenzelm@16941
   613
wenzelm@19513
   614
(* primitive classes and arities *)
wenzelm@386
   615
wenzelm@19513
   616
fun primitive_class (bclass, classes) thy =
wenzelm@16442
   617
  thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337
   618
    let
wenzelm@25390
   619
      val syn' = Syntax.update_consts [bclass] syn;
wenzelm@26939
   620
      val tsig' = Type.add_class (Syntax.pp_global thy) naming (bclass, classes) tsig;
wenzelm@16442
   621
    in (naming, syn', tsig', consts) end)
wenzelm@19391
   622
  |> add_consts_i [(Logic.const_of_class bclass, Term.a_itselfT --> propT, NoSyn)];
wenzelm@3791
   623
wenzelm@26939
   624
fun primitive_classrel arg thy = thy |> map_tsig (Type.add_classrel (Syntax.pp_global thy) arg);
wenzelm@26939
   625
fun primitive_arity arg thy = thy |> map_tsig (Type.add_arity (Syntax.pp_global thy) arg);
wenzelm@421
   626
wenzelm@421
   627
wenzelm@14645
   628
(* add translation functions *)
wenzelm@14645
   629
wenzelm@15746
   630
local
wenzelm@15746
   631
wenzelm@15746
   632
fun mk trs = map Syntax.mk_trfun trs;
wenzelm@15746
   633
wenzelm@16597
   634
fun gen_add_trfuns ext non_typed (atrs, trs, tr's, atr's) =
wenzelm@16597
   635
  map_syn (ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's));
wenzelm@14645
   636
wenzelm@16597
   637
fun gen_add_trfunsT ext tr's = map_syn (ext ([], [], mk tr's, []));
wenzelm@14645
   638
wenzelm@15746
   639
in
wenzelm@15746
   640
wenzelm@25390
   641
val add_trfuns = gen_add_trfuns Syntax.update_trfuns Syntax.non_typed_tr';
wenzelm@25390
   642
val add_trfunsT = gen_add_trfunsT Syntax.update_trfuns;
wenzelm@25390
   643
val add_advanced_trfuns = gen_add_trfuns Syntax.update_advanced_trfuns Syntax.non_typed_tr'';
wenzelm@25390
   644
val add_advanced_trfunsT = gen_add_trfunsT Syntax.update_advanced_trfuns;
wenzelm@14645
   645
wenzelm@15746
   646
end;
wenzelm@15746
   647
wenzelm@16597
   648
val add_tokentrfuns = map_syn o Syntax.extend_tokentrfuns;
wenzelm@16442
   649
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
wenzelm@14645
   650
wenzelm@14645
   651
wenzelm@19258
   652
(* translation rules *)
wenzelm@4619
   653
wenzelm@19258
   654
fun gen_trrules f args thy = thy |> map_syn (fn syn =>
wenzelm@16442
   655
  let val rules = map (Syntax.map_trrule (apfst (intern_type thy))) args
wenzelm@21772
   656
  in f (ProofContext.init thy) (is_logtype thy) syn rules syn end);
wenzelm@8725
   657
wenzelm@25390
   658
val add_trrules = gen_trrules Syntax.update_trrules;
wenzelm@19258
   659
val del_trrules = gen_trrules Syntax.remove_trrules;
wenzelm@25390
   660
val add_trrules_i = map_syn o Syntax.update_trrules_i;
wenzelm@19258
   661
val del_trrules_i = map_syn o Syntax.remove_trrules_i;
wenzelm@386
   662
wenzelm@386
   663
wenzelm@26667
   664
(* naming *)
wenzelm@6546
   665
wenzelm@19054
   666
val add_path        = map_naming o NameSpace.add_path;
wenzelm@19054
   667
val no_base_names   = map_naming NameSpace.no_base_names;
wenzelm@19054
   668
val qualified_names = map_naming NameSpace.qualified_names;
wenzelm@19054
   669
val sticky_prefix   = map_naming o NameSpace.sticky_prefix;
wenzelm@19054
   670
val restore_naming  = map_naming o K o naming_of;
wenzelm@6546
   671
wenzelm@19013
   672
val parent_path   = add_path "..";
wenzelm@19013
   673
val root_path     = add_path "/";
wenzelm@19013
   674
val absolute_path = add_path "//";
wenzelm@16442
   675
wenzelm@16442
   676
fun local_path thy = thy |> root_path |> add_path (Context.theory_name thy);
wenzelm@16442
   677
wenzelm@6546
   678
wenzelm@16337
   679
(* hide names *)
wenzelm@386
   680
wenzelm@26667
   681
val hide_class = map_tsig oo Type.hide_class;
wenzelm@26667
   682
val hide_type = map_tsig oo Type.hide_type;
wenzelm@26667
   683
val hide_const = map_consts oo Consts.hide;
wenzelm@17343
   684
clasohm@0
   685
end;