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