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