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