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