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