wenzelm@19: (*  Title:      Pure/sign.ML
wenzelm@251:     Author:     Lawrence C Paulson and Markus Wenzel
clasohm@0: 
wenzelm@16442: Logical signature content: naming conventions, concrete syntax, type
wenzelm@18062: signature, polymorphic constants.
clasohm@0: *)
clasohm@0: 
wenzelm@16442: signature SIGN =
wenzelm@5642: sig
wenzelm@16442:   val rep_sg: theory ->
wenzelm@16442:    {naming: NameSpace.naming,
wenzelm@16597:     syn: Syntax.syntax,
wenzelm@16442:     tsig: Type.tsig,
wenzelm@18062:     consts: Consts.T}
wenzelm@16442:   val naming_of: theory -> NameSpace.naming
haftmann@29581:   val full_name: theory -> binding -> string
wenzelm@16442:   val base_name: string -> bstring
haftmann@28965:   val full_bname: theory -> bstring -> string
haftmann@28965:   val full_bname_path: theory -> string -> bstring -> string
wenzelm@16442:   val syn_of: theory -> Syntax.syntax
wenzelm@16442:   val tsig_of: theory -> Type.tsig
wenzelm@19642:   val classes_of: theory -> Sorts.algebra
wenzelm@21932:   val all_classes: theory -> class list
wenzelm@19407:   val super_classes: theory -> class -> class list
wenzelm@24732:   val minimize_sort: theory -> sort -> sort
wenzelm@24732:   val complete_sort: theory -> sort -> sort
wenzelm@16442:   val defaultS: theory -> sort
wenzelm@16442:   val subsort: theory -> sort * sort -> bool
wenzelm@16442:   val of_sort: theory -> typ * sort -> bool
wenzelm@16442:   val witness_sorts: theory -> sort list -> sort list -> (typ * sort) list
wenzelm@24732:   val is_logtype: theory -> string -> bool
wenzelm@16442:   val typ_instance: theory -> typ * typ -> bool
wenzelm@19427:   val typ_equiv: theory -> typ * typ -> bool
wenzelm@16941:   val typ_match: theory -> typ * typ -> Type.tyenv -> Type.tyenv
wenzelm@16941:   val typ_unify: theory -> typ * typ -> Type.tyenv * int -> Type.tyenv * int
wenzelm@18967:   val consts_of: theory -> Consts.T
haftmann@17037:   val the_const_constraint: theory -> string -> typ
wenzelm@16442:   val const_type: theory -> string -> typ option
wenzelm@16442:   val the_const_type: theory -> string -> typ
wenzelm@16442:   val declared_tyname: theory -> string -> bool
wenzelm@16442:   val declared_const: theory -> string -> bool
wenzelm@18062:   val const_monomorphic: theory -> string -> bool
wenzelm@21183:   val const_syntax_name: theory -> string -> string
wenzelm@18146:   val const_typargs: theory -> string * typ -> typ list
wenzelm@18164:   val const_instance: theory -> string * typ list -> typ
haftmann@26268:   val mk_const: theory -> string * typ list -> term
wenzelm@16442:   val class_space: theory -> NameSpace.T
wenzelm@16442:   val type_space: theory -> NameSpace.T
wenzelm@16442:   val const_space: theory -> NameSpace.T
wenzelm@16442:   val intern_class: theory -> xstring -> string
wenzelm@16442:   val extern_class: theory -> string -> xstring
wenzelm@16442:   val intern_type: theory -> xstring -> string
wenzelm@16442:   val extern_type: theory -> string -> xstring
wenzelm@16442:   val intern_const: theory -> xstring -> string
wenzelm@16442:   val extern_const: theory -> string -> xstring
wenzelm@16442:   val intern_sort: theory -> sort -> sort
wenzelm@16442:   val extern_sort: theory -> sort -> sort
wenzelm@16442:   val intern_typ: theory -> typ -> typ
wenzelm@16442:   val extern_typ: theory -> typ -> typ
wenzelm@16442:   val intern_term: theory -> term -> term
wenzelm@18994:   val extern_term: (string -> xstring) -> theory -> term -> term
wenzelm@16442:   val intern_tycons: theory -> typ -> typ
wenzelm@19462:   val arity_number: theory -> string -> int
wenzelm@19462:   val arity_sorts: theory -> string -> sort -> sort list
wenzelm@16442:   val certify_class: theory -> class -> class
wenzelm@16442:   val certify_sort: theory -> sort -> sort
wenzelm@16442:   val certify_typ: theory -> typ -> typ
wenzelm@24273:   val certify_typ_mode: Type.mode -> theory -> typ -> typ
wenzelm@24674:   val certify': bool -> Pretty.pp -> bool -> Consts.T -> theory -> term -> term * typ * int
wenzelm@18967:   val certify_term: theory -> term -> term * typ * int
wenzelm@18967:   val certify_prop: theory -> term -> term * typ * int
wenzelm@16494:   val cert_term: theory -> term -> term
wenzelm@16494:   val cert_prop: theory -> term -> term
wenzelm@21741:   val no_frees: Pretty.pp -> term -> term
wenzelm@18941:   val no_vars: Pretty.pp -> term -> term
wenzelm@24981:   val cert_def: Proof.context -> term -> (string * typ) * term
wenzelm@19244:   val read_class: theory -> xstring -> class
wenzelm@19244:   val read_arity: theory -> xstring * string list * string -> arity
wenzelm@19244:   val cert_arity: theory -> arity -> arity
wenzelm@26667:   val add_defsort: string -> theory -> theory
wenzelm@26667:   val add_defsort_i: sort -> theory -> theory
wenzelm@26667:   val add_types: (bstring * int * mixfix) list -> theory -> theory
wenzelm@26667:   val add_nonterminals: bstring list -> theory -> theory
wenzelm@26667:   val add_tyabbrs: (bstring * string list * string * mixfix) list -> theory -> theory
wenzelm@26667:   val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> theory -> theory
wenzelm@26667:   val add_syntax: (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667:   val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@26667:   val add_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667:   val add_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@26667:   val del_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667:   val del_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@26667:   val notation: bool -> Syntax.mode -> (term * mixfix) list -> theory -> theory
haftmann@29581:   val declare_const: Properties.T -> (binding * typ) * mixfix -> theory -> term * theory
wenzelm@26667:   val add_consts: (bstring * string * mixfix) list -> theory -> theory
wenzelm@26667:   val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
haftmann@29581:   val add_abbrev: string -> Properties.T -> binding * term -> theory -> (term * term) * theory
wenzelm@25049:   val revert_abbrev: string -> string -> theory -> theory
wenzelm@24761:   val add_const_constraint: string * typ option -> theory -> theory
wenzelm@22811:   val primitive_class: string * class list -> theory -> theory
wenzelm@22811:   val primitive_classrel: class * class -> theory -> theory
wenzelm@22811:   val primitive_arity: arity -> theory -> theory
wenzelm@26667:   val add_trfuns:
wenzelm@26667:     (string * (ast list -> ast)) list *
wenzelm@26667:     (string * (term list -> term)) list *
wenzelm@26667:     (string * (term list -> term)) list *
wenzelm@26667:     (string * (ast list -> ast)) list -> theory -> theory
wenzelm@26667:   val add_trfunsT:
wenzelm@26667:     (string * (bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@26667:   val add_advanced_trfuns:
wenzelm@26667:     (string * (Proof.context -> ast list -> ast)) list *
wenzelm@26667:     (string * (Proof.context -> term list -> term)) list *
wenzelm@26667:     (string * (Proof.context -> term list -> term)) list *
wenzelm@26667:     (string * (Proof.context -> ast list -> ast)) list -> theory -> theory
wenzelm@26667:   val add_advanced_trfunsT:
wenzelm@26667:     (string * (Proof.context -> bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@26667:   val add_tokentrfuns:
wenzelm@26701:     (string * string * (Proof.context -> string -> Pretty.T)) list -> theory -> theory
wenzelm@26701:   val add_mode_tokentrfuns: string -> (string * (Proof.context -> string -> Pretty.T)) list
wenzelm@26667:     -> theory -> theory
wenzelm@26667:   val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@26667:   val del_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@26667:   val add_trrules_i: ast Syntax.trrule list -> theory -> theory
wenzelm@26667:   val del_trrules_i: ast Syntax.trrule list -> theory -> theory
wenzelm@26667:   val add_path: string -> theory -> theory
wenzelm@26667:   val parent_path: theory -> theory
wenzelm@26667:   val root_path: theory -> theory
wenzelm@26667:   val absolute_path: theory -> theory
wenzelm@26667:   val local_path: theory -> theory
wenzelm@26667:   val no_base_names: theory -> theory
wenzelm@26667:   val qualified_names: theory -> theory
wenzelm@26667:   val sticky_prefix: string -> theory -> theory
wenzelm@26667:   val restore_naming: theory -> theory -> theory
wenzelm@26667:   val hide_class: bool -> string -> theory -> theory
wenzelm@26667:   val hide_type: bool -> string -> theory -> theory
wenzelm@26667:   val hide_const: bool -> string -> theory -> theory
wenzelm@16442: end
wenzelm@5642: 
wenzelm@16442: structure Sign: SIGN =
wenzelm@143: struct
clasohm@0: 
wenzelm@16442: (** datatype sign **)
wenzelm@16337: 
wenzelm@16442: datatype sign = Sign of
wenzelm@18062:  {naming: NameSpace.naming,     (*common naming conventions*)
wenzelm@18062:   syn: Syntax.syntax,           (*concrete syntax for terms, types, sorts*)
wenzelm@18062:   tsig: Type.tsig,              (*order-sorted signature of types*)
wenzelm@18062:   consts: Consts.T};            (*polymorphic constants*)
wenzelm@16442: 
wenzelm@16442: fun make_sign (naming, syn, tsig, consts) =
wenzelm@16442:   Sign {naming = naming, syn = syn, tsig = tsig, consts = consts};
wenzelm@16442: 
wenzelm@16442: structure SignData = TheoryDataFun
wenzelm@22846: (
wenzelm@16442:   type T = sign;
wenzelm@16442:   val copy = I;
wenzelm@17405:   fun extend (Sign {syn, tsig, consts, ...}) =
wenzelm@17405:     make_sign (NameSpace.default_naming, syn, tsig, consts);
wenzelm@16442: 
wenzelm@18062:   val empty =
wenzelm@18714:     make_sign (NameSpace.default_naming, Syntax.basic_syn, Type.empty_tsig, Consts.empty);
wenzelm@16442: 
wenzelm@16442:   fun merge pp (sign1, sign2) =
wenzelm@16442:     let
wenzelm@18062:       val Sign {naming = _, syn = syn1, tsig = tsig1, consts = consts1} = sign1;
wenzelm@18062:       val Sign {naming = _, syn = syn2, tsig = tsig2, consts = consts2} = sign2;
wenzelm@16442: 
wenzelm@16442:       val naming = NameSpace.default_naming;
wenzelm@16597:       val syn = Syntax.merge_syntaxes syn1 syn2;
wenzelm@16442:       val tsig = Type.merge_tsigs pp (tsig1, tsig2);
wenzelm@18062:       val consts = Consts.merge (consts1, consts2);
wenzelm@18062:     in make_sign (naming, syn, tsig, consts) end;
wenzelm@22846: );
wenzelm@16442: 
wenzelm@16442: fun rep_sg thy = SignData.get thy |> (fn Sign args => args);
wenzelm@16442: 
wenzelm@16442: fun map_sign f = SignData.map (fn Sign {naming, syn, tsig, consts} =>
wenzelm@16442:   make_sign (f (naming, syn, tsig, consts)));
wenzelm@16442: 
wenzelm@16442: fun map_naming f = map_sign (fn (naming, syn, tsig, consts) => (f naming, syn, tsig, consts));
wenzelm@16442: fun map_syn f = map_sign (fn (naming, syn, tsig, consts) => (naming, f syn, tsig, consts));
wenzelm@16442: fun map_tsig f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, f tsig, consts));
wenzelm@16442: fun map_consts f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, tsig, f consts));
wenzelm@16442: 
wenzelm@16337: 
wenzelm@16337: (* naming *)
wenzelm@16337: 
wenzelm@16442: val naming_of = #naming o rep_sg;
wenzelm@16337: val base_name = NameSpace.base;
haftmann@28792: 
haftmann@28965: val full_name = NameSpace.full_name o naming_of;
haftmann@28965: fun full_bname thy = NameSpace.full_name (naming_of thy) o Binding.name;
haftmann@28965: fun full_bname_path thy elems =
haftmann@28965:   NameSpace.full_name (NameSpace.add_path elems (naming_of thy)) o Binding.name;
wenzelm@14645: 
wenzelm@14645: 
wenzelm@14645: (* syntax *)
wenzelm@14645: 
wenzelm@16597: val syn_of = #syn o rep_sg;
wenzelm@14645: 
clasohm@0: 
wenzelm@16337: (* type signature *)
wenzelm@16337: 
wenzelm@16337: val tsig_of = #tsig o rep_sg;
wenzelm@24732: 
wenzelm@19642: val classes_of = #2 o #classes o Type.rep_tsig o tsig_of;
wenzelm@21932: val all_classes = Sorts.all_classes o classes_of;
wenzelm@19642: val super_classes = Sorts.super_classes o classes_of;
wenzelm@24732: val minimize_sort = Sorts.minimize_sort o classes_of;
wenzelm@24732: val complete_sort = Sorts.complete_sort o classes_of;
wenzelm@24732: 
wenzelm@4844: val defaultS = Type.defaultS o tsig_of;
wenzelm@4568: val subsort = Type.subsort o tsig_of;
wenzelm@7640: val of_sort = Type.of_sort o tsig_of;
wenzelm@7640: val witness_sorts = Type.witness_sorts o tsig_of;
wenzelm@24732: val is_logtype = member (op =) o Type.logical_types o tsig_of;
wenzelm@24732: 
wenzelm@14784: val typ_instance = Type.typ_instance o tsig_of;
wenzelm@19427: fun typ_equiv thy (T, U) = typ_instance thy (T, U) andalso typ_instance thy (U, T);
wenzelm@16941: val typ_match = Type.typ_match o tsig_of;
wenzelm@16941: val typ_unify = Type.unify o tsig_of;
wenzelm@4256: 
wenzelm@4256: 
wenzelm@18062: (* polymorphic constants *)
wenzelm@16941: 
wenzelm@18062: val consts_of = #consts o rep_sg;
wenzelm@21722: val the_const_constraint = Consts.the_constraint o consts_of;
wenzelm@25042: val the_const_type = Consts.the_type o consts_of;
wenzelm@18062: val const_type = try o the_const_type;
wenzelm@21722: val const_monomorphic = Consts.is_monomorphic o consts_of;
wenzelm@21183: val const_syntax_name = Consts.syntax_name o consts_of;
wenzelm@18062: val const_typargs = Consts.typargs o consts_of;
wenzelm@18164: val const_instance = Consts.instance o consts_of;
wenzelm@4256: 
haftmann@26268: fun mk_const thy (c, Ts) = Const (c, const_instance thy (c, Ts));
haftmann@26268: 
wenzelm@16894: val declared_tyname = Symtab.defined o #2 o #types o Type.rep_tsig o tsig_of;
wenzelm@24761: val declared_const = can o the_const_constraint;
wenzelm@620: 
wenzelm@402: 
clasohm@0: 
wenzelm@16337: (** intern / extern names **)
wenzelm@16337: 
wenzelm@16368: val class_space = #1 o #classes o Type.rep_tsig o tsig_of;
wenzelm@16368: val type_space = #1 o #types o Type.rep_tsig o tsig_of;
wenzelm@18967: val const_space = Consts.space_of o consts_of;
wenzelm@14645: 
wenzelm@16368: val intern_class = NameSpace.intern o class_space;
wenzelm@16368: val extern_class = NameSpace.extern o class_space;
wenzelm@16368: val intern_type = NameSpace.intern o type_space;
wenzelm@16368: val extern_type = NameSpace.extern o type_space;
wenzelm@16368: val intern_const = NameSpace.intern o const_space;
wenzelm@16368: val extern_const = NameSpace.extern o const_space;
wenzelm@16337: 
wenzelm@16337: val intern_sort = map o intern_class;
wenzelm@16337: val extern_sort = map o extern_class;
wenzelm@16337: 
wenzelm@16337: local
wenzelm@14645: 
wenzelm@18892: fun map_typ f g (Type (c, Ts)) = Type (g c, map (map_typ f g) Ts)
wenzelm@18892:   | map_typ f _ (TFree (x, S)) = TFree (x, map f S)
wenzelm@18892:   | map_typ f _ (TVar (xi, S)) = TVar (xi, map f S);
wenzelm@18892: 
wenzelm@18892: fun map_term f g h (Const (c, T)) = Const (h c, map_typ f g T)
wenzelm@18892:   | map_term f g _ (Free (x, T)) = Free (x, map_typ f g T)
wenzelm@18892:   | map_term f g _ (Var (xi, T)) = Var (xi, map_typ f g T)
wenzelm@18892:   | map_term _ _ _ (t as Bound _) = t
wenzelm@18892:   | map_term f g h (Abs (x, T, t)) = Abs (x, map_typ f g T, map_term f g h t)
wenzelm@18892:   | map_term f g h (t $ u) = map_term f g h t $ map_term f g h u;
wenzelm@18892: 
wenzelm@18994: val add_classesT = Term.fold_atyps
wenzelm@18994:   (fn TFree (_, S) => fold (insert (op =)) S
wenzelm@18994:     | TVar (_, S) => fold (insert (op =)) S
wenzelm@18994:     | _ => I);
wenzelm@18994: 
wenzelm@18994: fun add_tyconsT (Type (c, Ts)) = insert (op =) c #> fold add_tyconsT Ts
wenzelm@18994:   | add_tyconsT _ = I;
wenzelm@18994: 
wenzelm@18994: val add_consts = Term.fold_aterms (fn Const (c, _) => insert (op =) c | _ => I);
wenzelm@18994: 
wenzelm@16337: fun mapping add_names f t =
wenzelm@16337:   let
wenzelm@20664:     fun f' (x: string) = let val y = f x in if x = y then NONE else SOME (x, y) end;
wenzelm@19482:     val tab = map_filter f' (add_names t []);
wenzelm@18941:     fun get x = the_default x (AList.lookup (op =) tab x);
wenzelm@16337:   in get end;
wenzelm@16337: 
wenzelm@16442: fun typ_mapping f g thy T =
wenzelm@18892:   T |> map_typ
wenzelm@18994:     (mapping add_classesT (f thy) T)
wenzelm@18994:     (mapping add_tyconsT (g thy) T);
wenzelm@14645: 
wenzelm@16442: fun term_mapping f g h thy t =
wenzelm@18892:   t |> map_term
wenzelm@18994:     (mapping (Term.fold_types add_classesT) (f thy) t)
wenzelm@18994:     (mapping (Term.fold_types add_tyconsT) (g thy) t)
wenzelm@18994:     (mapping add_consts (h thy) t);
wenzelm@16337: 
wenzelm@16337: in
wenzelm@14645: 
wenzelm@16368: val intern_typ = typ_mapping intern_class intern_type;
wenzelm@16368: val extern_typ = typ_mapping extern_class extern_type;
wenzelm@16368: val intern_term = term_mapping intern_class intern_type intern_const;
wenzelm@18994: fun extern_term h = term_mapping extern_class extern_type (K h);
wenzelm@16368: val intern_tycons = typ_mapping (K I) intern_type;
wenzelm@16337: 
wenzelm@16337: end;
wenzelm@14645: 
wenzelm@14645: 
wenzelm@14645: 
wenzelm@16337: (** certify entities **)    (*exception TYPE*)
wenzelm@8898: 
wenzelm@16337: (* certify wrt. type signature *)
wenzelm@8898: 
wenzelm@19462: val arity_number = Type.arity_number o tsig_of;
wenzelm@26939: fun arity_sorts thy = Type.arity_sorts (Syntax.pp_global thy) (tsig_of thy);
wenzelm@19462: 
wenzelm@24273: val certify_class         = Type.cert_class o tsig_of;
wenzelm@24273: val certify_sort          = Type.cert_sort o tsig_of;
wenzelm@24273: val certify_typ           = Type.cert_typ o tsig_of;
wenzelm@24273: fun certify_typ_mode mode = Type.cert_typ_mode mode o tsig_of;
wenzelm@10443: 
wenzelm@4961: 
wenzelm@18967: (* certify term/prop *)
wenzelm@4961: 
wenzelm@14987: local
nipkow@1494: 
wenzelm@16337: fun type_check pp tm =
wenzelm@4961:   let
wenzelm@4961:     fun err_appl why bs t T u U =
wenzelm@4961:       let
wenzelm@10404:         val xs = map Free bs;           (*we do not rename here*)
wenzelm@4961:         val t' = subst_bounds (xs, t);
wenzelm@4961:         val u' = subst_bounds (xs, u);
wenzelm@16337:         val msg = cat_lines
wenzelm@14828:           (TypeInfer.appl_error (Syntax.pp_show_brackets pp) why t' T u' U);
wenzelm@16337:       in raise TYPE (msg, [T, U], [t', u']) end;
wenzelm@4961: 
wenzelm@4961:     fun typ_of (_, Const (_, T)) = T
wenzelm@4961:       | typ_of (_, Free  (_, T)) = T
wenzelm@4961:       | typ_of (_, Var (_, T)) = T
wenzelm@30146:       | typ_of (bs, Bound i) = snd (nth bs i handle Subscript =>
wenzelm@4961:           raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
wenzelm@4961:       | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
wenzelm@4961:       | typ_of (bs, t $ u) =
wenzelm@4961:           let val T = typ_of (bs, t) and U = typ_of (bs, u) in
wenzelm@4961:             (case T of
wenzelm@4961:               Type ("fun", [T1, T2]) =>
wenzelm@14828:                 if T1 = U then T2 else err_appl "Incompatible operand type" bs t T u U
wenzelm@14828:             | _ => err_appl "Operator not of function type" bs t T u U)
wenzelm@4961:           end;
wenzelm@18967:   in typ_of ([], tm) end;
wenzelm@4961: 
wenzelm@18967: fun err msg = raise TYPE (msg, [], []);
wenzelm@18967: 
wenzelm@18967: fun check_vars (t $ u) = (check_vars t; check_vars u)
wenzelm@18967:   | check_vars (Abs (_, _, t)) = check_vars t
wenzelm@27205:   | check_vars (Free (x, _)) =
wenzelm@27205:       if NameSpace.is_qualified x then err ("Malformed variable: " ^ quote x) else ()
wenzelm@18967:   | check_vars (Var (xi as (_, i), _)) =
wenzelm@18967:       if i < 0 then err ("Malformed variable: " ^ quote (Term.string_of_vname xi)) else ()
wenzelm@18967:   | check_vars _ = ();
clasohm@0: 
wenzelm@14987: in
wenzelm@14987: 
wenzelm@24674: fun certify' prop pp do_expand consts thy tm =
wenzelm@251:   let
wenzelm@18967:     val _ = check_vars tm;
wenzelm@20548:     val tm' = Term.map_types (certify_typ thy) tm;
wenzelm@18967:     val T = type_check pp tm';
wenzelm@18967:     val _ = if prop andalso T <> propT then err "Term not of type prop" else ();
wenzelm@24674:     val tm'' = Consts.certify pp (tsig_of thy) do_expand consts tm';
wenzelm@18967:   in (if tm = tm'' then tm else tm'', T, Term.maxidx_of_term tm'') end;
wenzelm@169: 
wenzelm@26939: fun certify_term thy = certify' false (Syntax.pp_global thy) true (consts_of thy) thy;
wenzelm@26939: fun certify_prop thy = certify' true (Syntax.pp_global thy) true (consts_of thy) thy;
wenzelm@18967: 
wenzelm@26939: fun cert_term_abbrev thy = #1 o certify' false (Syntax.pp_global thy) false (consts_of thy) thy;
wenzelm@18967: val cert_term = #1 oo certify_term;
wenzelm@18967: val cert_prop = #1 oo certify_prop;
wenzelm@251: 
wenzelm@14987: end;
wenzelm@14987: 
wenzelm@251: 
wenzelm@18941: (* specifications *)
wenzelm@18941: 
wenzelm@21741: fun no_variables kind add addT mk mkT pp tm =
wenzelm@21741:   (case (add tm [], addT tm []) of
wenzelm@18941:     ([], []) => tm
wenzelm@25117:   | (frees, tfrees) => error (Pretty.string_of (Pretty.block
wenzelm@25117:       (Pretty.str ("Illegal " ^ kind ^ " variable(s) in term:") :: Pretty.brk 1 ::
wenzelm@25117:        Pretty.commas (map (Pretty.term pp o mk) frees @ map (Pretty.typ pp o mkT) tfrees)))));
wenzelm@21741: 
wenzelm@21741: val no_frees = no_variables "free" Term.add_frees Term.add_tfrees Free TFree;
wenzelm@21741: val no_vars = no_variables "schematic" Term.add_vars Term.add_tvars Var TVar;
wenzelm@18941: 
wenzelm@24981: fun cert_def ctxt tm =
wenzelm@18941:   let val ((lhs, rhs), _) = tm
wenzelm@24981:     |> no_vars (Syntax.pp ctxt)
wenzelm@18941:     |> Logic.strip_imp_concl
wenzelm@24981:     |> PrimitiveDefs.dest_def ctxt Term.is_Const (K false) (K false)
wenzelm@18941:   in (Term.dest_Const (Term.head_of lhs), rhs) end
wenzelm@18941:   handle TERM (msg, _) => error msg;
wenzelm@18941: 
wenzelm@18941: 
wenzelm@16337: 
wenzelm@16442: (** read and certify entities **)    (*exception ERROR*)
wenzelm@16337: 
wenzelm@24273: (* classes *)
wenzelm@19244: 
wenzelm@19427: fun read_class thy c = certify_class thy (intern_class thy c)
wenzelm@19427:   handle TYPE (msg, _, _) => error msg;
wenzelm@16337: 
wenzelm@16337: 
wenzelm@19244: (* type arities *)
wenzelm@19244: 
wenzelm@19244: fun prep_arity prep_tycon prep_sort thy (t, Ss, S) =
wenzelm@19244:   let val arity = (prep_tycon thy t, map (prep_sort thy) Ss, prep_sort thy S)
wenzelm@26939:   in Type.add_arity (Syntax.pp_global thy) arity (tsig_of thy); arity end;
wenzelm@19244: 
wenzelm@24707: val read_arity = prep_arity intern_type Syntax.read_sort_global;
wenzelm@19244: val cert_arity = prep_arity (K I) certify_sort;
wenzelm@19244: 
wenzelm@19244: 
wenzelm@2979: 
wenzelm@16337: (** signature extension functions **)  (*exception ERROR/TYPE*)
wenzelm@386: 
wenzelm@386: (* add default sort *)
wenzelm@386: 
wenzelm@16442: fun gen_add_defsort prep_sort s thy =
wenzelm@16442:   thy |> map_tsig (Type.set_defsort (prep_sort thy s));
wenzelm@8898: 
wenzelm@24707: val add_defsort = gen_add_defsort Syntax.read_sort_global;
wenzelm@16337: val add_defsort_i = gen_add_defsort certify_sort;
wenzelm@386: 
wenzelm@386: 
wenzelm@386: (* add type constructors *)
wenzelm@386: 
wenzelm@16442: fun add_types types thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@14856:   let
wenzelm@25390:     val syn' = Syntax.update_type_gram types syn;
wenzelm@16368:     val decls = map (fn (a, n, mx) => (Syntax.type_name a mx, n)) types;
haftmann@27302:     val tags = [(Markup.theory_nameN, Context.theory_name thy)];
haftmann@27302:     val tsig' = fold (Type.add_type naming tags) decls tsig;
wenzelm@16442:   in (naming, syn', tsig', consts) end);
wenzelm@16442: 
wenzelm@16337: 
wenzelm@16337: (* add nonterminals *)
wenzelm@16337: 
wenzelm@16442: fun add_nonterminals ns thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337:   let
wenzelm@25390:     val syn' = Syntax.update_consts ns syn;
haftmann@27302:     val tsig' = fold (Type.add_nonterminal naming []) ns tsig;
wenzelm@16442:   in (naming, syn', tsig', consts) end);
wenzelm@386: 
wenzelm@386: 
wenzelm@386: (* add type abbreviations *)
wenzelm@386: 
wenzelm@25366: fun gen_add_tyabbr parse_typ (a, vs, rhs, mx) thy =
wenzelm@16442:   thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337:     let
wenzelm@25366:       val ctxt = ProofContext.init thy;
wenzelm@25390:       val syn' = Syntax.update_type_gram [(a, length vs, mx)] syn;
wenzelm@16368:       val a' = Syntax.type_name a mx;
wenzelm@25366:       val abbr = (a', vs, certify_typ_mode Type.mode_syntax thy (parse_typ ctxt rhs))
wenzelm@18678:         handle ERROR msg => cat_error msg ("in type abbreviation " ^ quote a');
haftmann@27302:       val tsig' = Type.add_abbrev naming [] abbr tsig;
wenzelm@16442:     in (naming, syn', tsig', consts) end);
wenzelm@386: 
wenzelm@24707: val add_tyabbrs = fold (gen_add_tyabbr Syntax.parse_typ);
wenzelm@24273: val add_tyabbrs_i = fold (gen_add_tyabbr (K I));
wenzelm@14784: 
wenzelm@14784: 
wenzelm@16337: (* modify syntax *)
wenzelm@16337: 
wenzelm@25366: fun gen_syntax change_gram parse_typ mode args thy =
wenzelm@16337:   let
wenzelm@25366:     val ctxt = ProofContext.init thy;
wenzelm@25366:     fun prep (c, T, mx) = (c, certify_typ_mode Type.mode_syntax thy (parse_typ ctxt T), mx)
wenzelm@24273:       handle ERROR msg =>
wenzelm@24273:         cat_error msg ("in syntax declaration " ^ quote (Syntax.const_name c mx));
wenzelm@20784:   in thy |> map_syn (change_gram (is_logtype thy) mode (map prep args)) end;
wenzelm@16337: 
wenzelm@25390: fun gen_add_syntax x = gen_syntax Syntax.update_const_gram x;
wenzelm@386: 
wenzelm@24707: val add_modesyntax = gen_add_syntax Syntax.parse_typ;
wenzelm@24273: val add_modesyntax_i = gen_add_syntax (K I);
wenzelm@24959: val add_syntax = add_modesyntax Syntax.mode_default;
wenzelm@24959: val add_syntax_i = add_modesyntax_i Syntax.mode_default;
wenzelm@24707: val del_modesyntax = gen_syntax Syntax.remove_const_gram Syntax.parse_typ;
wenzelm@24273: val del_modesyntax_i = gen_syntax Syntax.remove_const_gram (K I);
wenzelm@3805: 
wenzelm@25383: fun notation add mode args thy =
wenzelm@25383:   let
wenzelm@25383:     val change_gram = if add then Syntax.update_const_gram else Syntax.remove_const_gram;
wenzelm@25383:     fun const_syntax (Const (c, _), mx) = try (Consts.syntax (consts_of thy)) (c, mx)
wenzelm@25383:       | const_syntax _ = NONE;
wenzelm@25383:   in gen_syntax change_gram (K I) mode (map_filter const_syntax args) thy end;
wenzelm@19658: 
wenzelm@16337: 
wenzelm@16337: (* add constants *)
wenzelm@386: 
wenzelm@17995: local
wenzelm@17995: 
wenzelm@25366: fun gen_add_consts parse_typ authentic tags raw_args thy =
wenzelm@386:   let
wenzelm@25366:     val ctxt = ProofContext.init thy;
wenzelm@25366:     val prepT = Type.no_tvars o Term.no_dummyT o certify_typ thy o parse_typ ctxt;
haftmann@28861:     fun prep (raw_b, raw_T, raw_mx) =
wenzelm@19658:       let
wenzelm@30223:         val (mx_name, mx) = Syntax.const_mixfix (Binding.name_of raw_b) raw_mx;
wenzelm@30223:         val b = Binding.map_name (K mx_name) raw_b;
haftmann@28965:         val c = full_name thy b;
wenzelm@30223:         val c_syn = if authentic then Syntax.constN ^ c else Binding.name_of b;
wenzelm@19658:         val T = (prepT raw_T handle TYPE (msg, _, _) => error msg) handle ERROR msg =>
wenzelm@30218:           cat_error msg ("in declaration of constant " ^ quote (Binding.str_of b));
wenzelm@26631:         val T' = Logic.varifyT T;
haftmann@28861:       in ((b, T'), (c_syn, T', mx), Const (c, T)) end;
wenzelm@16337:     val args = map prep raw_args;
wenzelm@28017:     val tags' = tags |> Properties.put (Markup.theory_nameN, Context.theory_name thy);
wenzelm@16442:   in
wenzelm@16442:     thy
wenzelm@26978:     |> map_consts (fold (Consts.declare authentic (naming_of thy) tags' o #1) args)
wenzelm@19658:     |> add_syntax_i (map #2 args)
wenzelm@24959:     |> pair (map #3 args)
wenzelm@16442:   end;
wenzelm@386: 
haftmann@28965: fun bindify (name, T, mx) = (Binding.name name, T, mx);
haftmann@28861: 
wenzelm@17995: in
wenzelm@17995: 
haftmann@28861: fun add_consts args = snd o gen_add_consts Syntax.parse_typ false [] (map bindify args);
haftmann@28861: fun add_consts_i args = snd o gen_add_consts (K I) false [] (map bindify args);
wenzelm@24959: 
wenzelm@28111: fun declare_const tags ((b, T), mx) thy =
wenzelm@28111:   let
haftmann@28941:     val pos = Binding.pos_of b;
wenzelm@28111:     val tags' = Position.default_properties pos tags;
haftmann@28861:     val ([const as Const (c, _)], thy') = gen_add_consts (K I) true tags' [(b, T, mx)] thy;
haftmann@28861:     val _ = Position.report (Markup.const_decl c) pos;
wenzelm@28111:   in (const, thy') end;
wenzelm@386: 
wenzelm@17995: end;
wenzelm@17995: 
wenzelm@386: 
wenzelm@25049: (* abbreviations *)
wenzelm@18941: 
haftmann@28861: fun add_abbrev mode tags (b, raw_t) thy =
wenzelm@18941:   let
wenzelm@26939:     val pp = Syntax.pp_global thy;
wenzelm@26631:     val prep_tm = no_frees pp o Term.no_dummy_patterns o cert_term_abbrev thy;
wenzelm@19806:     val t = (prep_tm raw_t handle TYPE (msg, _, _) => error msg | TERM (msg, _) => error msg)
wenzelm@30218:       handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b));
wenzelm@21696:     val (res, consts') = consts_of thy
haftmann@28861:       |> Consts.abbreviate pp (tsig_of thy) (naming_of thy) mode tags (b, t);
wenzelm@25049:   in (res, thy |> map_consts (K consts')) end;
wenzelm@25049: 
wenzelm@25049: fun revert_abbrev mode c = map_consts (Consts.revert_abbrev mode c);
wenzelm@18941: 
wenzelm@18941: 
wenzelm@16941: (* add constraints *)
wenzelm@16941: 
wenzelm@24761: fun add_const_constraint (c, opt_T) thy =
wenzelm@16941:   let
wenzelm@19099:     fun prepT raw_T =
wenzelm@24761:       let val T = Logic.varifyT (Type.no_tvars (Term.no_dummyT (certify_typ thy raw_T)))
wenzelm@19099:       in cert_term thy (Const (c, T)); T end
wenzelm@16941:       handle TYPE (msg, _, _) => error msg;
wenzelm@19099:   in thy |> map_consts (Consts.constrain (c, Option.map prepT opt_T)) end;
wenzelm@16941: 
wenzelm@16941: 
wenzelm@19513: (* primitive classes and arities *)
wenzelm@386: 
wenzelm@19513: fun primitive_class (bclass, classes) thy =
wenzelm@16442:   thy |> map_sign (fn (naming, syn, tsig, consts) =>
wenzelm@16337:     let
wenzelm@25390:       val syn' = Syntax.update_consts [bclass] syn;
wenzelm@26939:       val tsig' = Type.add_class (Syntax.pp_global thy) naming (bclass, classes) tsig;
wenzelm@16442:     in (naming, syn', tsig', consts) end)
wenzelm@19391:   |> add_consts_i [(Logic.const_of_class bclass, Term.a_itselfT --> propT, NoSyn)];
wenzelm@3791: 
wenzelm@26939: fun primitive_classrel arg thy = thy |> map_tsig (Type.add_classrel (Syntax.pp_global thy) arg);
wenzelm@26939: fun primitive_arity arg thy = thy |> map_tsig (Type.add_arity (Syntax.pp_global thy) arg);
wenzelm@421: 
wenzelm@421: 
wenzelm@14645: (* add translation functions *)
wenzelm@14645: 
wenzelm@15746: local
wenzelm@15746: 
wenzelm@15746: fun mk trs = map Syntax.mk_trfun trs;
wenzelm@15746: 
wenzelm@16597: fun gen_add_trfuns ext non_typed (atrs, trs, tr's, atr's) =
wenzelm@16597:   map_syn (ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's));
wenzelm@14645: 
wenzelm@16597: fun gen_add_trfunsT ext tr's = map_syn (ext ([], [], mk tr's, []));
wenzelm@14645: 
wenzelm@15746: in
wenzelm@15746: 
wenzelm@25390: val add_trfuns = gen_add_trfuns Syntax.update_trfuns Syntax.non_typed_tr';
wenzelm@25390: val add_trfunsT = gen_add_trfunsT Syntax.update_trfuns;
wenzelm@25390: val add_advanced_trfuns = gen_add_trfuns Syntax.update_advanced_trfuns Syntax.non_typed_tr'';
wenzelm@25390: val add_advanced_trfunsT = gen_add_trfunsT Syntax.update_advanced_trfuns;
wenzelm@14645: 
wenzelm@15746: end;
wenzelm@15746: 
wenzelm@16597: val add_tokentrfuns = map_syn o Syntax.extend_tokentrfuns;
wenzelm@16442: fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
wenzelm@14645: 
wenzelm@14645: 
wenzelm@19258: (* translation rules *)
wenzelm@4619: 
wenzelm@19258: fun gen_trrules f args thy = thy |> map_syn (fn syn =>
wenzelm@16442:   let val rules = map (Syntax.map_trrule (apfst (intern_type thy))) args
wenzelm@21772:   in f (ProofContext.init thy) (is_logtype thy) syn rules syn end);
wenzelm@8725: 
wenzelm@25390: val add_trrules = gen_trrules Syntax.update_trrules;
wenzelm@19258: val del_trrules = gen_trrules Syntax.remove_trrules;
wenzelm@25390: val add_trrules_i = map_syn o Syntax.update_trrules_i;
wenzelm@19258: val del_trrules_i = map_syn o Syntax.remove_trrules_i;
wenzelm@386: 
wenzelm@386: 
wenzelm@26667: (* naming *)
wenzelm@6546: 
wenzelm@19054: val add_path        = map_naming o NameSpace.add_path;
wenzelm@19054: val no_base_names   = map_naming NameSpace.no_base_names;
wenzelm@19054: val qualified_names = map_naming NameSpace.qualified_names;
wenzelm@19054: val sticky_prefix   = map_naming o NameSpace.sticky_prefix;
wenzelm@19054: val restore_naming  = map_naming o K o naming_of;
wenzelm@6546: 
wenzelm@19013: val parent_path   = add_path "..";
wenzelm@19013: val root_path     = add_path "/";
wenzelm@19013: val absolute_path = add_path "//";
wenzelm@16442: 
wenzelm@16442: fun local_path thy = thy |> root_path |> add_path (Context.theory_name thy);
wenzelm@16442: 
wenzelm@6546: 
wenzelm@16337: (* hide names *)
wenzelm@386: 
wenzelm@26667: val hide_class = map_tsig oo Type.hide_class;
wenzelm@26667: val hide_type = map_tsig oo Type.hide_type;
wenzelm@26667: val hide_const = map_consts oo Consts.hide;
wenzelm@17343: 
clasohm@0: end;