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