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