src/Pure/sign.ML
author wenzelm
Sat Apr 16 15:25:25 2011 +0200 (2011-04-16)
changeset 42359 6ca5407863ed
parent 42358 b47d41d9f4b5
child 42360 da8817d01e7c
permissions -rw-r--r--
prefer local name spaces;
tuned signatures;
tuned;
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@36449
    28
  val set_defsort: sort -> theory -> theory
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@39290
    32
  val inter_sort: theory -> sort * sort -> sort
wenzelm@31946
    33
  val witness_sorts: theory -> (typ * 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@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@33095
    49
  val class_space: theory -> Name_Space.T
wenzelm@33095
    50
  val type_space: theory -> Name_Space.T
wenzelm@33095
    51
  val const_space: theory -> Name_Space.T
wenzelm@42359
    52
  val intern_class: theory -> xstring -> string
wenzelm@42359
    53
  val intern_type: theory -> xstring -> string
wenzelm@42359
    54
  val intern_const: theory -> xstring -> string
wenzelm@35680
    55
  val class_alias: binding -> class -> theory -> theory
wenzelm@35680
    56
  val type_alias: binding -> string -> theory -> theory
wenzelm@35680
    57
  val const_alias: binding -> string -> theory -> theory
wenzelm@19462
    58
  val arity_number: theory -> string -> int
wenzelm@19462
    59
  val arity_sorts: theory -> string -> sort -> sort list
wenzelm@16442
    60
  val certify_class: theory -> class -> class
wenzelm@16442
    61
  val certify_sort: theory -> sort -> sort
wenzelm@16442
    62
  val certify_typ: theory -> typ -> typ
wenzelm@24273
    63
  val certify_typ_mode: Type.mode -> theory -> typ -> typ
wenzelm@24674
    64
  val certify': bool -> Pretty.pp -> bool -> Consts.T -> theory -> term -> term * typ * int
wenzelm@18967
    65
  val certify_term: theory -> term -> term * typ * int
wenzelm@16494
    66
  val cert_term: theory -> term -> term
wenzelm@16494
    67
  val cert_prop: theory -> term -> term
wenzelm@39133
    68
  val no_frees: Proof.context -> term -> term
wenzelm@39133
    69
  val no_vars: Proof.context -> term -> term
wenzelm@30343
    70
  val add_types: (binding * int * mixfix) list -> theory -> theory
wenzelm@30343
    71
  val add_nonterminals: binding list -> theory -> theory
wenzelm@36179
    72
  val add_type_abbrev: binding * string list * typ -> theory -> theory
wenzelm@30343
    73
  val add_syntax: (string * string * mixfix) list -> theory -> theory
wenzelm@30343
    74
  val add_syntax_i: (string * typ * mixfix) list -> theory -> theory
wenzelm@30343
    75
  val add_modesyntax: Syntax.mode -> (string * string * mixfix) list -> theory -> theory
wenzelm@30343
    76
  val add_modesyntax_i: Syntax.mode -> (string * typ * mixfix) list -> theory -> theory
wenzelm@30343
    77
  val del_modesyntax: Syntax.mode -> (string * string * mixfix) list -> theory -> theory
wenzelm@30343
    78
  val del_modesyntax_i: Syntax.mode -> (string * typ * mixfix) list -> theory -> theory
wenzelm@35412
    79
  val type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> theory -> theory
wenzelm@26667
    80
  val notation: bool -> Syntax.mode -> (term * mixfix) list -> theory -> theory
wenzelm@33173
    81
  val declare_const: (binding * typ) * mixfix -> theory -> term * theory
wenzelm@30343
    82
  val add_consts: (binding * string * mixfix) list -> theory -> theory
wenzelm@30343
    83
  val add_consts_i: (binding * typ * mixfix) list -> theory -> theory
wenzelm@33173
    84
  val add_abbrev: string -> binding * term -> theory -> (term * term) * theory
wenzelm@25049
    85
  val revert_abbrev: string -> string -> theory -> theory
wenzelm@24761
    86
  val add_const_constraint: string * typ option -> theory -> theory
wenzelm@30343
    87
  val primitive_class: binding * class list -> theory -> theory
wenzelm@22811
    88
  val primitive_classrel: class * class -> theory -> theory
wenzelm@22811
    89
  val primitive_arity: arity -> theory -> theory
wenzelm@26667
    90
  val add_trfuns:
wenzelm@42224
    91
    (string * (Ast.ast list -> Ast.ast)) list *
wenzelm@26667
    92
    (string * (term list -> term)) list *
wenzelm@26667
    93
    (string * (term list -> term)) list *
wenzelm@42224
    94
    (string * (Ast.ast list -> Ast.ast)) list -> theory -> theory
wenzelm@42247
    95
  val add_trfunsT: (string * (typ -> term list -> term)) list -> theory -> theory
wenzelm@26667
    96
  val add_advanced_trfuns:
wenzelm@42224
    97
    (string * (Proof.context -> Ast.ast list -> Ast.ast)) list *
wenzelm@26667
    98
    (string * (Proof.context -> term list -> term)) list *
wenzelm@26667
    99
    (string * (Proof.context -> term list -> term)) list *
wenzelm@42224
   100
    (string * (Proof.context -> Ast.ast list -> Ast.ast)) list -> theory -> theory
wenzelm@26667
   101
  val add_advanced_trfunsT:
wenzelm@42247
   102
    (string * (Proof.context -> typ -> term list -> term)) list -> theory -> theory
wenzelm@42224
   103
  val add_trrules: Ast.ast Syntax.trrule list -> theory -> theory
wenzelm@42224
   104
  val del_trrules: Ast.ast Syntax.trrule list -> theory -> theory
wenzelm@33724
   105
  val new_group: theory -> theory
wenzelm@33724
   106
  val reset_group: theory -> theory
wenzelm@26667
   107
  val add_path: string -> theory -> theory
wenzelm@30421
   108
  val root_path: theory -> theory
wenzelm@26667
   109
  val parent_path: theory -> theory
wenzelm@30469
   110
  val mandatory_path: string -> theory -> theory
wenzelm@35200
   111
  val qualified_path: bool -> binding -> theory -> theory
wenzelm@26667
   112
  val local_path: theory -> theory
wenzelm@26667
   113
  val restore_naming: theory -> theory -> theory
wenzelm@26667
   114
  val hide_class: bool -> string -> theory -> theory
wenzelm@26667
   115
  val hide_type: bool -> string -> theory -> theory
wenzelm@26667
   116
  val hide_const: bool -> string -> theory -> theory
wenzelm@16442
   117
end
wenzelm@5642
   118
wenzelm@16442
   119
structure Sign: SIGN =
wenzelm@143
   120
struct
clasohm@0
   121
wenzelm@16442
   122
(** datatype sign **)
wenzelm@16337
   123
wenzelm@16442
   124
datatype sign = Sign of
wenzelm@33095
   125
 {naming: Name_Space.naming,    (*common naming conventions*)
wenzelm@18062
   126
  syn: Syntax.syntax,           (*concrete syntax for terms, types, sorts*)
wenzelm@18062
   127
  tsig: Type.tsig,              (*order-sorted signature of types*)
wenzelm@18062
   128
  consts: Consts.T};            (*polymorphic constants*)
wenzelm@16442
   129
wenzelm@16442
   130
fun make_sign (naming, syn, tsig, consts) =
wenzelm@16442
   131
  Sign {naming = naming, syn = syn, tsig = tsig, consts = consts};
wenzelm@16442
   132
wenzelm@35801
   133
structure Data = Theory_Data_PP
wenzelm@22846
   134
(
wenzelm@16442
   135
  type T = sign;
wenzelm@17405
   136
  fun extend (Sign {syn, tsig, consts, ...}) =
wenzelm@33095
   137
    make_sign (Name_Space.default_naming, syn, tsig, consts);
wenzelm@16442
   138
wenzelm@18062
   139
  val empty =
wenzelm@42294
   140
    make_sign (Name_Space.default_naming, Syntax.empty_syntax, Type.empty_tsig, Consts.empty);
wenzelm@16442
   141
wenzelm@16442
   142
  fun merge pp (sign1, sign2) =
wenzelm@16442
   143
    let
wenzelm@18062
   144
      val Sign {naming = _, syn = syn1, tsig = tsig1, consts = consts1} = sign1;
wenzelm@18062
   145
      val Sign {naming = _, syn = syn2, tsig = tsig2, consts = consts2} = sign2;
wenzelm@16442
   146
wenzelm@33095
   147
      val naming = Name_Space.default_naming;
wenzelm@16597
   148
      val syn = Syntax.merge_syntaxes syn1 syn2;
wenzelm@36450
   149
      val tsig = Type.merge_tsig pp (tsig1, tsig2);
wenzelm@18062
   150
      val consts = Consts.merge (consts1, consts2);
wenzelm@18062
   151
    in make_sign (naming, syn, tsig, consts) end;
wenzelm@22846
   152
);
wenzelm@16442
   153
wenzelm@35801
   154
fun rep_sg thy = Data.get thy |> (fn Sign args => args);
wenzelm@16442
   155
wenzelm@35801
   156
fun map_sign f = Data.map (fn Sign {naming, syn, tsig, consts} =>
wenzelm@16442
   157
  make_sign (f (naming, syn, tsig, consts)));
wenzelm@16442
   158
wenzelm@16442
   159
fun map_naming f = map_sign (fn (naming, syn, tsig, consts) => (f naming, syn, tsig, consts));
wenzelm@16442
   160
fun map_syn f = map_sign (fn (naming, syn, tsig, consts) => (naming, f syn, tsig, consts));
wenzelm@16442
   161
fun map_tsig f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, f tsig, consts));
wenzelm@16442
   162
fun map_consts f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, tsig, f consts));
wenzelm@16442
   163
wenzelm@16337
   164
wenzelm@16337
   165
(* naming *)
wenzelm@16337
   166
wenzelm@16442
   167
val naming_of = #naming o rep_sg;
haftmann@28792
   168
wenzelm@33095
   169
val full_name = Name_Space.full_name o naming_of;
wenzelm@33095
   170
fun full_name_path thy path = Name_Space.full_name (Name_Space.add_path path (naming_of thy));
wenzelm@30343
   171
wenzelm@33095
   172
fun full_bname thy = Name_Space.full_name (naming_of thy) o Binding.name;
wenzelm@30343
   173
fun full_bname_path thy path = full_name_path thy path o Binding.name;
wenzelm@14645
   174
wenzelm@14645
   175
wenzelm@14645
   176
(* syntax *)
wenzelm@14645
   177
wenzelm@16597
   178
val syn_of = #syn o rep_sg;
wenzelm@14645
   179
clasohm@0
   180
wenzelm@16337
   181
(* type signature *)
wenzelm@16337
   182
wenzelm@16337
   183
val tsig_of = #tsig o rep_sg;
wenzelm@24732
   184
wenzelm@19642
   185
val classes_of = #2 o #classes o Type.rep_tsig o tsig_of;
wenzelm@21932
   186
val all_classes = Sorts.all_classes o classes_of;
wenzelm@19642
   187
val super_classes = Sorts.super_classes o classes_of;
wenzelm@24732
   188
val minimize_sort = Sorts.minimize_sort o classes_of;
wenzelm@24732
   189
val complete_sort = Sorts.complete_sort o classes_of;
wenzelm@24732
   190
wenzelm@36449
   191
val set_defsort = map_tsig o Type.set_defsort;
wenzelm@4844
   192
val defaultS = Type.defaultS o tsig_of;
wenzelm@4568
   193
val subsort = Type.subsort o tsig_of;
wenzelm@7640
   194
val of_sort = Type.of_sort o tsig_of;
wenzelm@39290
   195
val inter_sort = Type.inter_sort o tsig_of;
wenzelm@7640
   196
val witness_sorts = Type.witness_sorts o tsig_of;
wenzelm@24732
   197
val is_logtype = member (op =) o Type.logical_types o tsig_of;
wenzelm@24732
   198
wenzelm@14784
   199
val typ_instance = Type.typ_instance o tsig_of;
wenzelm@19427
   200
fun typ_equiv thy (T, U) = typ_instance thy (T, U) andalso typ_instance thy (U, T);
wenzelm@16941
   201
val typ_match = Type.typ_match o tsig_of;
wenzelm@16941
   202
val typ_unify = Type.unify o tsig_of;
wenzelm@4256
   203
wenzelm@4256
   204
wenzelm@18062
   205
(* polymorphic constants *)
wenzelm@16941
   206
wenzelm@18062
   207
val consts_of = #consts o rep_sg;
wenzelm@21722
   208
val the_const_constraint = Consts.the_constraint o consts_of;
wenzelm@25042
   209
val the_const_type = Consts.the_type o consts_of;
wenzelm@18062
   210
val const_type = try o the_const_type;
wenzelm@21722
   211
val const_monomorphic = Consts.is_monomorphic o consts_of;
wenzelm@18062
   212
val const_typargs = Consts.typargs o consts_of;
wenzelm@18164
   213
val const_instance = Consts.instance o consts_of;
wenzelm@4256
   214
haftmann@26268
   215
fun mk_const thy (c, Ts) = Const (c, const_instance thy (c, Ts));
haftmann@26268
   216
wenzelm@16894
   217
val declared_tyname = Symtab.defined o #2 o #types o Type.rep_tsig o tsig_of;
wenzelm@24761
   218
val declared_const = can o the_const_constraint;
wenzelm@620
   219
wenzelm@402
   220
clasohm@0
   221
wenzelm@42359
   222
(** name spaces **)
wenzelm@16337
   223
wenzelm@35669
   224
val class_space = Type.class_space o tsig_of;
wenzelm@35669
   225
val type_space = Type.type_space o tsig_of;
wenzelm@18967
   226
val const_space = Consts.space_of o consts_of;
wenzelm@14645
   227
wenzelm@42359
   228
val intern_class = Name_Space.intern o class_space;
wenzelm@42359
   229
val intern_type = Name_Space.intern o type_space;
wenzelm@42359
   230
val intern_const = Name_Space.intern o const_space;
wenzelm@42359
   231
wenzelm@35680
   232
fun class_alias b c thy = map_tsig (Type.class_alias (naming_of thy) b c) thy;
wenzelm@35680
   233
fun type_alias b c thy = map_tsig (Type.type_alias (naming_of thy) b c) thy;
wenzelm@35680
   234
fun const_alias b c thy = map_consts (Consts.alias (naming_of thy) b c) thy;
wenzelm@35680
   235
wenzelm@14645
   236
wenzelm@14645
   237
wenzelm@16337
   238
(** certify entities **)    (*exception TYPE*)
wenzelm@8898
   239
wenzelm@16337
   240
(* certify wrt. type signature *)
wenzelm@8898
   241
wenzelm@19462
   242
val arity_number = Type.arity_number o tsig_of;
wenzelm@26939
   243
fun arity_sorts thy = Type.arity_sorts (Syntax.pp_global thy) (tsig_of thy);
wenzelm@19462
   244
wenzelm@24273
   245
val certify_class         = Type.cert_class o tsig_of;
wenzelm@24273
   246
val certify_sort          = Type.cert_sort o tsig_of;
wenzelm@24273
   247
val certify_typ           = Type.cert_typ o tsig_of;
wenzelm@24273
   248
fun certify_typ_mode mode = Type.cert_typ_mode mode o tsig_of;
wenzelm@10443
   249
wenzelm@4961
   250
wenzelm@18967
   251
(* certify term/prop *)
wenzelm@4961
   252
wenzelm@14987
   253
local
nipkow@1494
   254
wenzelm@16337
   255
fun type_check pp tm =
wenzelm@4961
   256
  let
wenzelm@39289
   257
    fun err_appl bs t T u U =
wenzelm@4961
   258
      let
wenzelm@10404
   259
        val xs = map Free bs;           (*we do not rename here*)
wenzelm@4961
   260
        val t' = subst_bounds (xs, t);
wenzelm@4961
   261
        val u' = subst_bounds (xs, u);
wenzelm@39289
   262
        val msg = Type.appl_error pp t' T u' U;
wenzelm@16337
   263
      in raise TYPE (msg, [T, U], [t', u']) end;
wenzelm@4961
   264
wenzelm@4961
   265
    fun typ_of (_, Const (_, T)) = T
wenzelm@4961
   266
      | typ_of (_, Free  (_, T)) = T
wenzelm@4961
   267
      | typ_of (_, Var (_, T)) = T
wenzelm@30146
   268
      | typ_of (bs, Bound i) = snd (nth bs i handle Subscript =>
wenzelm@4961
   269
          raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
wenzelm@4961
   270
      | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
wenzelm@4961
   271
      | typ_of (bs, t $ u) =
wenzelm@4961
   272
          let val T = typ_of (bs, t) and U = typ_of (bs, u) in
wenzelm@4961
   273
            (case T of
wenzelm@4961
   274
              Type ("fun", [T1, T2]) =>
wenzelm@39289
   275
                if T1 = U then T2 else err_appl bs t T u U
wenzelm@39289
   276
            | _ => err_appl bs t T u U)
wenzelm@4961
   277
          end;
wenzelm@18967
   278
  in typ_of ([], tm) end;
wenzelm@4961
   279
wenzelm@18967
   280
fun err msg = raise TYPE (msg, [], []);
wenzelm@18967
   281
wenzelm@18967
   282
fun check_vars (t $ u) = (check_vars t; check_vars u)
wenzelm@18967
   283
  | check_vars (Abs (_, _, t)) = check_vars t
wenzelm@27205
   284
  | check_vars (Free (x, _)) =
wenzelm@30364
   285
      if Long_Name.is_qualified x then err ("Malformed variable: " ^ quote x) else ()
wenzelm@18967
   286
  | check_vars (Var (xi as (_, i), _)) =
wenzelm@18967
   287
      if i < 0 then err ("Malformed variable: " ^ quote (Term.string_of_vname xi)) else ()
wenzelm@18967
   288
  | check_vars _ = ();
clasohm@0
   289
wenzelm@14987
   290
in
wenzelm@14987
   291
wenzelm@24674
   292
fun certify' prop pp do_expand consts thy tm =
wenzelm@251
   293
  let
wenzelm@18967
   294
    val _ = check_vars tm;
wenzelm@20548
   295
    val tm' = Term.map_types (certify_typ thy) tm;
wenzelm@18967
   296
    val T = type_check pp tm';
wenzelm@18967
   297
    val _ = if prop andalso T <> propT then err "Term not of type prop" else ();
wenzelm@24674
   298
    val tm'' = Consts.certify pp (tsig_of thy) do_expand consts tm';
wenzelm@18967
   299
  in (if tm = tm'' then tm else tm'', T, Term.maxidx_of_term tm'') end;
wenzelm@169
   300
wenzelm@26939
   301
fun certify_term thy = certify' false (Syntax.pp_global thy) true (consts_of thy) thy;
wenzelm@26939
   302
fun cert_term_abbrev thy = #1 o certify' false (Syntax.pp_global thy) false (consts_of thy) thy;
wenzelm@18967
   303
val cert_term = #1 oo certify_term;
wenzelm@32789
   304
fun cert_prop thy = #1 o certify' true (Syntax.pp_global thy) true (consts_of thy) thy;
wenzelm@251
   305
wenzelm@14987
   306
end;
wenzelm@14987
   307
wenzelm@251
   308
wenzelm@18941
   309
(* specifications *)
wenzelm@18941
   310
wenzelm@39133
   311
fun no_variables kind add addT mk mkT ctxt tm =
wenzelm@21741
   312
  (case (add tm [], addT tm []) of
wenzelm@18941
   313
    ([], []) => tm
wenzelm@25117
   314
  | (frees, tfrees) => error (Pretty.string_of (Pretty.block
wenzelm@25117
   315
      (Pretty.str ("Illegal " ^ kind ^ " variable(s) in term:") :: Pretty.brk 1 ::
wenzelm@39133
   316
       Pretty.commas
wenzelm@39133
   317
        (map (Syntax.pretty_term ctxt o mk) frees @ map (Syntax.pretty_typ ctxt o mkT) tfrees)))));
wenzelm@21741
   318
wenzelm@21741
   319
val no_frees = no_variables "free" Term.add_frees Term.add_tfrees Free TFree;
wenzelm@21741
   320
val no_vars = no_variables "schematic" Term.add_vars Term.add_tvars Var TVar;
wenzelm@18941
   321
wenzelm@18941
   322
wenzelm@16337
   323
wenzelm@16337
   324
(** signature extension functions **)  (*exception ERROR/TYPE*)
wenzelm@386
   325
wenzelm@386
   326
(* add type constructors *)
wenzelm@386
   327
wenzelm@16442
   328
fun add_types types thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@14856
   329
  let
wenzelm@36179
   330
    fun type_syntax (b, n, mx) =
wenzelm@42290
   331
      (Lexicon.mark_type (Name_Space.full_name naming b), Mixfix.make_type n, mx);
wenzelm@36179
   332
    val syn' = Syntax.update_type_gram true Syntax.mode_default (map type_syntax types) syn;
wenzelm@36157
   333
    val tsig' = fold (fn (a, n, _) => Type.add_type naming (a, n)) types tsig;
wenzelm@16442
   334
  in (naming, syn', tsig', consts) end);
wenzelm@16442
   335
wenzelm@16337
   336
wenzelm@16337
   337
(* add nonterminals *)
wenzelm@16337
   338
wenzelm@36179
   339
fun add_nonterminals ns = map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@36179
   340
  (naming, syn, fold (Type.add_nonterminal naming) ns tsig, consts));
wenzelm@386
   341
wenzelm@386
   342
wenzelm@386
   343
(* add type abbreviations *)
wenzelm@386
   344
wenzelm@36179
   345
fun add_type_abbrev abbr = map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@36179
   346
  (naming, syn, Type.add_abbrev naming abbr tsig, consts));
wenzelm@14784
   347
wenzelm@14784
   348
wenzelm@16337
   349
(* modify syntax *)
wenzelm@16337
   350
wenzelm@25366
   351
fun gen_syntax change_gram parse_typ mode args thy =
wenzelm@16337
   352
  let
wenzelm@36610
   353
    val ctxt = ProofContext.init_global thy;
wenzelm@25366
   354
    fun prep (c, T, mx) = (c, certify_typ_mode Type.mode_syntax thy (parse_typ ctxt T), mx)
wenzelm@35129
   355
      handle ERROR msg => cat_error msg ("in syntax declaration " ^ quote c);
wenzelm@20784
   356
  in thy |> map_syn (change_gram (is_logtype thy) mode (map prep args)) end;
wenzelm@16337
   357
wenzelm@35412
   358
fun gen_add_syntax x = gen_syntax (Syntax.update_const_gram true) x;
wenzelm@386
   359
wenzelm@24707
   360
val add_modesyntax = gen_add_syntax Syntax.parse_typ;
wenzelm@24273
   361
val add_modesyntax_i = gen_add_syntax (K I);
wenzelm@24959
   362
val add_syntax = add_modesyntax Syntax.mode_default;
wenzelm@24959
   363
val add_syntax_i = add_modesyntax_i Syntax.mode_default;
wenzelm@35412
   364
val del_modesyntax = gen_syntax (Syntax.update_const_gram false) Syntax.parse_typ;
wenzelm@35412
   365
val del_modesyntax_i = gen_syntax (Syntax.update_const_gram false) (K I);
wenzelm@35412
   366
wenzelm@35412
   367
fun type_notation add mode args =
wenzelm@35412
   368
  let
wenzelm@35429
   369
    fun type_syntax (Type (c, args), mx) =
wenzelm@42290
   370
          SOME (Lexicon.mark_type c, Mixfix.make_type (length args), mx)
wenzelm@35412
   371
      | type_syntax _ = NONE;
wenzelm@35412
   372
  in map_syn (Syntax.update_type_gram add mode (map_filter type_syntax args)) end;
wenzelm@3805
   373
wenzelm@25383
   374
fun notation add mode args thy =
wenzelm@25383
   375
  let
wenzelm@35255
   376
    fun const_syntax (Const (c, _), mx) =
wenzelm@35255
   377
          (case try (Consts.type_scheme (consts_of thy)) c of
wenzelm@42290
   378
            SOME T => SOME (Lexicon.mark_const c, T, mx)
wenzelm@35255
   379
          | NONE => NONE)
wenzelm@25383
   380
      | const_syntax _ = NONE;
wenzelm@35412
   381
  in gen_syntax (Syntax.update_const_gram add) (K I) mode (map_filter const_syntax args) thy end;
wenzelm@19658
   382
wenzelm@16337
   383
wenzelm@16337
   384
(* add constants *)
wenzelm@386
   385
wenzelm@17995
   386
local
wenzelm@17995
   387
wenzelm@35255
   388
fun gen_add_consts parse_typ raw_args thy =
wenzelm@386
   389
  let
wenzelm@36610
   390
    val ctxt = ProofContext.init_global thy;
wenzelm@25366
   391
    val prepT = Type.no_tvars o Term.no_dummyT o certify_typ thy o parse_typ ctxt;
wenzelm@35129
   392
    fun prep (b, raw_T, mx) =
wenzelm@19658
   393
      let
haftmann@28965
   394
        val c = full_name thy b;
wenzelm@19658
   395
        val T = (prepT raw_T handle TYPE (msg, _, _) => error msg) handle ERROR msg =>
wenzelm@30218
   396
          cat_error msg ("in declaration of constant " ^ quote (Binding.str_of b));
wenzelm@35845
   397
        val T' = Logic.varifyT_global T;
wenzelm@42290
   398
      in ((b, T'), (Lexicon.mark_const c, T', mx), Const (c, T)) end;
wenzelm@16337
   399
    val args = map prep raw_args;
wenzelm@16442
   400
  in
wenzelm@16442
   401
    thy
wenzelm@35255
   402
    |> map_consts (fold (Consts.declare (naming_of thy) o #1) args)
wenzelm@19658
   403
    |> add_syntax_i (map #2 args)
wenzelm@24959
   404
    |> pair (map #3 args)
wenzelm@16442
   405
  end;
wenzelm@386
   406
wenzelm@17995
   407
in
wenzelm@17995
   408
wenzelm@35255
   409
fun add_consts args = snd o gen_add_consts Syntax.parse_typ args;
wenzelm@35255
   410
fun add_consts_i args = snd o gen_add_consts (K I) args;
wenzelm@24959
   411
wenzelm@33173
   412
fun declare_const ((b, T), mx) thy =
wenzelm@28111
   413
  let
haftmann@28941
   414
    val pos = Binding.pos_of b;
wenzelm@35255
   415
    val ([const as Const (c, _)], thy') = gen_add_consts (K I) [(b, T, mx)] thy;
wenzelm@39507
   416
    val _ = Position.report pos (Markup.const_decl c);
wenzelm@28111
   417
  in (const, thy') end;
wenzelm@386
   418
wenzelm@17995
   419
end;
wenzelm@17995
   420
wenzelm@386
   421
wenzelm@25049
   422
(* abbreviations *)
wenzelm@18941
   423
wenzelm@33173
   424
fun add_abbrev mode (b, raw_t) thy =
wenzelm@18941
   425
  let
wenzelm@39133
   426
    val ctxt = Syntax.init_pretty_global thy;
wenzelm@39133
   427
    val prep_tm = no_frees ctxt o Term.no_dummy_patterns o cert_term_abbrev thy;
wenzelm@19806
   428
    val t = (prep_tm raw_t handle TYPE (msg, _, _) => error msg | TERM (msg, _) => error msg)
wenzelm@30218
   429
      handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b));
wenzelm@21696
   430
    val (res, consts') = consts_of thy
wenzelm@39133
   431
      |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of thy) (naming_of thy) mode (b, t);
wenzelm@25049
   432
  in (res, thy |> map_consts (K consts')) end;
wenzelm@25049
   433
wenzelm@25049
   434
fun revert_abbrev mode c = map_consts (Consts.revert_abbrev mode c);
wenzelm@18941
   435
wenzelm@18941
   436
wenzelm@16941
   437
(* add constraints *)
wenzelm@16941
   438
wenzelm@24761
   439
fun add_const_constraint (c, opt_T) thy =
wenzelm@16941
   440
  let
wenzelm@19099
   441
    fun prepT raw_T =
wenzelm@35845
   442
      let val T = Logic.varifyT_global (Type.no_tvars (Term.no_dummyT (certify_typ thy raw_T)))
wenzelm@19099
   443
      in cert_term thy (Const (c, T)); T end
wenzelm@16941
   444
      handle TYPE (msg, _, _) => error msg;
wenzelm@19099
   445
  in thy |> map_consts (Consts.constrain (c, Option.map prepT opt_T)) end;
wenzelm@16941
   446
wenzelm@16941
   447
wenzelm@19513
   448
(* primitive classes and arities *)
wenzelm@386
   449
wenzelm@19513
   450
fun primitive_class (bclass, classes) thy =
wenzelm@16442
   451
  thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337
   452
    let
wenzelm@26939
   453
      val tsig' = Type.add_class (Syntax.pp_global thy) naming (bclass, classes) tsig;
wenzelm@35429
   454
    in (naming, syn, tsig', consts) end)
wenzelm@30343
   455
  |> add_consts_i [(Binding.map_name Logic.const_of_class bclass, Term.a_itselfT --> propT, NoSyn)];
wenzelm@3791
   456
wenzelm@26939
   457
fun primitive_classrel arg thy = thy |> map_tsig (Type.add_classrel (Syntax.pp_global thy) arg);
wenzelm@26939
   458
fun primitive_arity arg thy = thy |> map_tsig (Type.add_arity (Syntax.pp_global thy) arg);
wenzelm@421
   459
wenzelm@421
   460
wenzelm@14645
   461
(* add translation functions *)
wenzelm@14645
   462
wenzelm@15746
   463
local
wenzelm@15746
   464
wenzelm@42288
   465
fun mk trs = map Syntax_Ext.mk_trfun trs;
wenzelm@15746
   466
wenzelm@16597
   467
fun gen_add_trfuns ext non_typed (atrs, trs, tr's, atr's) =
wenzelm@16597
   468
  map_syn (ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's));
wenzelm@14645
   469
wenzelm@16597
   470
fun gen_add_trfunsT ext tr's = map_syn (ext ([], [], mk tr's, []));
wenzelm@14645
   471
wenzelm@15746
   472
in
wenzelm@15746
   473
wenzelm@42284
   474
val add_trfuns = gen_add_trfuns Syntax.update_trfuns Syntax_Trans.non_typed_tr';
wenzelm@25390
   475
val add_trfunsT = gen_add_trfunsT Syntax.update_trfuns;
wenzelm@42284
   476
val add_advanced_trfuns = gen_add_trfuns Syntax.update_advanced_trfuns Syntax_Trans.non_typed_tr'';
wenzelm@25390
   477
val add_advanced_trfunsT = gen_add_trfunsT Syntax.update_advanced_trfuns;
wenzelm@14645
   478
wenzelm@15746
   479
end;
wenzelm@15746
   480
wenzelm@14645
   481
wenzelm@19258
   482
(* translation rules *)
wenzelm@4619
   483
wenzelm@42204
   484
val add_trrules = map_syn o Syntax.update_trrules;
wenzelm@42204
   485
val del_trrules = map_syn o Syntax.remove_trrules;
wenzelm@386
   486
wenzelm@386
   487
wenzelm@26667
   488
(* naming *)
wenzelm@6546
   489
wenzelm@33724
   490
val new_group = map_naming Name_Space.new_group;
wenzelm@33724
   491
val reset_group = map_naming Name_Space.reset_group;
wenzelm@33724
   492
wenzelm@33095
   493
val add_path = map_naming o Name_Space.add_path;
wenzelm@33095
   494
val root_path = map_naming Name_Space.root_path;
wenzelm@33095
   495
val parent_path = map_naming Name_Space.parent_path;
wenzelm@33095
   496
val mandatory_path = map_naming o Name_Space.mandatory_path;
wenzelm@35200
   497
val qualified_path = map_naming oo Name_Space.qualified_path;
wenzelm@6546
   498
wenzelm@16442
   499
fun local_path thy = thy |> root_path |> add_path (Context.theory_name thy);
wenzelm@16442
   500
wenzelm@30522
   501
val restore_naming = map_naming o K o naming_of;
wenzelm@30421
   502
wenzelm@6546
   503
wenzelm@16337
   504
(* hide names *)
wenzelm@386
   505
wenzelm@26667
   506
val hide_class = map_tsig oo Type.hide_class;
wenzelm@26667
   507
val hide_type = map_tsig oo Type.hide_type;
wenzelm@26667
   508
val hide_const = map_consts oo Consts.hide;
wenzelm@17343
   509
clasohm@0
   510
end;