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