src/Pure/sign.ML
author wenzelm
Thu Apr 27 15:06:35 2006 +0200 (2006-04-27)
changeset 19482 9f11af8f7ef9
parent 19462 26d5f3bcc933
child 19513 77ff7cd602d7
permissions -rw-r--r--
tuned basic list operators (flat, maps, map_filter);
     1 (*  Title:      Pure/sign.ML
     2     ID:         $Id$
     3     Author:     Lawrence C Paulson and Markus Wenzel
     4 
     5 Logical signature content: naming conventions, concrete syntax, type
     6 signature, polymorphic constants.
     7 *)
     8 
     9 signature SIGN_THEORY =
    10 sig
    11   val add_defsort: string -> theory -> theory
    12   val add_defsort_i: sort -> theory -> theory
    13   val add_types: (bstring * int * mixfix) list -> theory -> theory
    14   val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
    15   val add_nonterminals: bstring list -> theory -> theory
    16   val add_tyabbrs: (bstring * string list * string * mixfix) list -> theory -> theory
    17   val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> theory -> theory
    18   val add_arities: (xstring * string list * string) list -> theory -> theory
    19   val add_arities_i: (string * sort list * sort) list -> theory -> theory
    20   val add_syntax: (bstring * string * mixfix) list -> theory -> theory
    21   val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
    22   val add_modesyntax: (string * bool) -> (bstring * string * mixfix) list -> theory -> theory
    23   val add_modesyntax_i: (string * bool) -> (bstring * typ * mixfix) list -> theory -> theory
    24   val del_modesyntax: (string * bool) -> (bstring * string * mixfix) list -> theory -> theory
    25   val del_modesyntax_i: (string * bool) -> (bstring * typ * mixfix) list -> theory -> theory
    26   val add_consts: (bstring * string * mixfix) list -> theory -> theory
    27   val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
    28   val add_abbrevs: string * bool -> (bstring * string * mixfix) list -> theory -> theory
    29   val add_abbrevs_i: string * bool -> (bstring * term * mixfix) list -> theory -> theory
    30   val add_const_constraint: xstring * string option -> theory -> theory
    31   val add_const_constraint_i: string * typ option -> theory -> theory
    32   val add_classes: (bstring * xstring list) list -> theory -> theory
    33   val add_classes_i: (bstring * class list) list -> theory -> theory
    34   val add_classrel: (xstring * xstring) list -> theory -> theory
    35   val add_classrel_i: (class * class) list -> theory -> theory
    36   val add_trfuns:
    37     (string * (ast list -> ast)) list *
    38     (string * (term list -> term)) list *
    39     (string * (term list -> term)) list *
    40     (string * (ast list -> ast)) list -> theory -> theory
    41   val add_trfunsT:
    42     (string * (bool -> typ -> term list -> term)) list -> theory -> theory
    43   val add_advanced_trfuns:
    44     (string * (Context.generic -> ast list -> ast)) list *
    45     (string * (Context.generic -> term list -> term)) list *
    46     (string * (Context.generic -> term list -> term)) list *
    47     (string * (Context.generic -> ast list -> ast)) list -> theory -> theory
    48   val add_advanced_trfunsT:
    49     (string * (Context.generic -> bool -> typ -> term list -> term)) list -> theory -> theory
    50   val add_tokentrfuns:
    51     (string * string * (string -> string * real)) list -> theory -> theory
    52   val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list
    53     -> theory -> theory
    54   val parse_ast_translation: bool * string -> theory -> theory
    55   val parse_translation: bool * string -> theory -> theory
    56   val print_translation: bool * string -> theory -> theory
    57   val typed_print_translation: bool * string -> theory -> theory
    58   val print_ast_translation: bool * string -> theory -> theory
    59   val token_translation: string -> theory -> theory
    60   val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
    61   val del_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
    62   val add_trrules_i: ast Syntax.trrule list -> theory -> theory
    63   val del_trrules_i: ast Syntax.trrule list -> theory -> theory
    64   val add_path: string -> theory -> theory
    65   val parent_path: theory -> theory
    66   val root_path: theory -> theory
    67   val absolute_path: theory -> theory
    68   val local_path: theory -> theory
    69   val no_base_names: theory -> theory
    70   val qualified_names: theory -> theory
    71   val sticky_prefix: string -> theory -> theory
    72   val set_policy: (string -> bstring -> string) * (string list -> string list list) ->
    73     theory -> theory
    74   val restore_naming: theory -> theory -> theory
    75   val hide_classes: bool -> xstring list -> theory -> theory
    76   val hide_classes_i: bool -> string list -> theory -> theory
    77   val hide_types: bool -> xstring list -> theory -> theory
    78   val hide_types_i: bool -> string list -> theory -> theory
    79   val hide_consts: bool -> xstring list -> theory -> theory
    80   val hide_consts_i: bool -> string list -> theory -> theory
    81   val hide_names: bool -> string * xstring list -> theory -> theory
    82   val hide_names_i: bool -> string * string list -> theory -> theory
    83 end
    84 
    85 signature SIGN =
    86 sig
    87   val init_data: theory -> theory
    88   val rep_sg: theory ->
    89    {naming: NameSpace.naming,
    90     syn: Syntax.syntax,
    91     tsig: Type.tsig,
    92     consts: Consts.T}
    93   val naming_of: theory -> NameSpace.naming
    94   val base_name: string -> bstring
    95   val full_name: theory -> bstring -> string
    96   val full_name_path: theory -> string -> bstring -> string
    97   val declare_name: theory -> string -> NameSpace.T -> NameSpace.T
    98   val syn_of: theory -> Syntax.syntax
    99   val tsig_of: theory -> Type.tsig
   100   val classes_of: theory -> Sorts.classes
   101   val arities_of: theory -> Sorts.arities
   102   val classes: theory -> class list
   103   val super_classes: theory -> class -> class list
   104   val defaultS: theory -> sort
   105   val subsort: theory -> sort * sort -> bool
   106   val of_sort: theory -> typ * sort -> bool
   107   val witness_sorts: theory -> sort list -> sort list -> (typ * sort) list
   108   val universal_witness: theory -> (typ * sort) option
   109   val all_sorts_nonempty: theory -> bool
   110   val typ_instance: theory -> typ * typ -> bool
   111   val typ_equiv: theory -> typ * typ -> bool
   112   val typ_match: theory -> typ * typ -> Type.tyenv -> Type.tyenv
   113   val typ_unify: theory -> typ * typ -> Type.tyenv * int -> Type.tyenv * int
   114   val is_logtype: theory -> string -> bool
   115   val consts_of: theory -> Consts.T
   116   val const_constraint: theory -> string -> typ option
   117   val the_const_constraint: theory -> string -> typ
   118   val const_type: theory -> string -> typ option
   119   val the_const_type: theory -> string -> typ
   120   val declared_tyname: theory -> string -> bool
   121   val declared_const: theory -> string -> bool
   122   val const_monomorphic: theory -> string -> bool
   123   val const_typargs: theory -> string * typ -> typ list
   124   val const_instance: theory -> string * typ list -> typ
   125   val class_space: theory -> NameSpace.T
   126   val type_space: theory -> NameSpace.T
   127   val const_space: theory -> NameSpace.T
   128   val intern_class: theory -> xstring -> string
   129   val extern_class: theory -> string -> xstring
   130   val intern_type: theory -> xstring -> string
   131   val extern_type: theory -> string -> xstring
   132   val intern_const: theory -> xstring -> string
   133   val extern_const: theory -> string -> xstring
   134   val intern_sort: theory -> sort -> sort
   135   val extern_sort: theory -> sort -> sort
   136   val intern_typ: theory -> typ -> typ
   137   val extern_typ: theory -> typ -> typ
   138   val intern_term: theory -> term -> term
   139   val extern_term: (string -> xstring) -> theory -> term -> term
   140   val intern_tycons: theory -> typ -> typ
   141   val pretty_term': Context.generic -> Syntax.syntax -> (string -> xstring) -> term -> Pretty.T
   142   val pretty_term: theory -> term -> Pretty.T
   143   val pretty_typ: theory -> typ -> Pretty.T
   144   val pretty_sort: theory -> sort -> Pretty.T
   145   val pretty_classrel: theory -> class list -> Pretty.T
   146   val pretty_arity: theory -> arity -> Pretty.T
   147   val string_of_term: theory -> term -> string
   148   val string_of_typ: theory -> typ -> string
   149   val string_of_sort: theory -> sort -> string
   150   val string_of_classrel: theory -> class list -> string
   151   val string_of_arity: theory -> arity -> string
   152   val pprint_term: theory -> term -> pprint_args -> unit
   153   val pprint_typ: theory -> typ -> pprint_args -> unit
   154   val pp: theory -> Pretty.pp
   155   val arity_number: theory -> string -> int
   156   val arity_sorts: theory -> string -> sort -> sort list
   157   val certify_class: theory -> class -> class
   158   val certify_sort: theory -> sort -> sort
   159   val certify_typ: theory -> typ -> typ
   160   val certify_typ_syntax: theory -> typ -> typ
   161   val certify_typ_abbrev: theory -> typ -> typ
   162   val certify': bool -> bool -> Pretty.pp -> Consts.T -> theory -> term -> term * typ * int
   163   val certify_term: theory -> term -> term * typ * int
   164   val certify_prop: theory -> term -> term * typ * int
   165   val cert_term: theory -> term -> term
   166   val cert_prop: theory -> term -> term
   167   val no_vars: Pretty.pp -> term -> term
   168   val cert_def: Pretty.pp -> term -> (string * typ) * term
   169   val read_class: theory -> xstring -> class
   170   val read_sort': Syntax.syntax -> Context.generic -> string -> sort
   171   val read_sort: theory -> string -> sort
   172   val read_arity: theory -> xstring * string list * string -> arity
   173   val cert_arity: theory -> arity -> arity
   174   val read_typ': Syntax.syntax -> Context.generic ->
   175     (indexname -> sort option) -> string -> typ
   176   val read_typ_syntax': Syntax.syntax -> Context.generic ->
   177     (indexname -> sort option) -> string -> typ
   178   val read_typ_abbrev': Syntax.syntax -> Context.generic ->
   179     (indexname -> sort option) -> string -> typ
   180   val read_typ: theory * (indexname -> sort option) -> string -> typ
   181   val read_typ_syntax: theory * (indexname -> sort option) -> string -> typ
   182   val read_typ_abbrev: theory * (indexname -> sort option) -> string -> typ
   183   val read_tyname: theory -> string -> typ
   184   val read_const: theory -> string -> term
   185   val infer_types_simult: Pretty.pp -> theory -> Consts.T -> (indexname -> typ option) ->
   186     (indexname -> sort option) -> string list -> bool
   187     -> (term list * typ) list -> term list * (indexname * typ) list
   188   val infer_types: Pretty.pp -> theory -> Consts.T -> (indexname -> typ option) ->
   189     (indexname -> sort option) -> string list -> bool
   190     -> term list * typ -> term * (indexname * typ) list
   191   val read_def_terms': Pretty.pp -> (string -> bool) -> Syntax.syntax -> Consts.T ->
   192     Context.generic -> (indexname -> typ option) * (indexname -> sort option) ->
   193     string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
   194   val read_def_terms:
   195     theory * (indexname -> typ option) * (indexname -> sort option) ->
   196     string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
   197   val simple_read_term: theory -> typ -> string -> term
   198   val read_term: theory -> string -> term
   199   val read_prop: theory -> string -> term
   200   include SIGN_THEORY
   201 end
   202 
   203 structure Sign: SIGN =
   204 struct
   205 
   206 
   207 (** datatype sign **)
   208 
   209 datatype sign = Sign of
   210  {naming: NameSpace.naming,     (*common naming conventions*)
   211   syn: Syntax.syntax,           (*concrete syntax for terms, types, sorts*)
   212   tsig: Type.tsig,              (*order-sorted signature of types*)
   213   consts: Consts.T};            (*polymorphic constants*)
   214 
   215 fun make_sign (naming, syn, tsig, consts) =
   216   Sign {naming = naming, syn = syn, tsig = tsig, consts = consts};
   217 
   218 structure SignData = TheoryDataFun
   219 (struct
   220   val name = "Pure/sign";
   221   type T = sign;
   222   val copy = I;
   223   fun extend (Sign {syn, tsig, consts, ...}) =
   224     make_sign (NameSpace.default_naming, syn, tsig, consts);
   225 
   226   val empty =
   227     make_sign (NameSpace.default_naming, Syntax.basic_syn, Type.empty_tsig, Consts.empty);
   228 
   229   fun merge pp (sign1, sign2) =
   230     let
   231       val Sign {naming = _, syn = syn1, tsig = tsig1, consts = consts1} = sign1;
   232       val Sign {naming = _, syn = syn2, tsig = tsig2, consts = consts2} = sign2;
   233 
   234       val naming = NameSpace.default_naming;
   235       val syn = Syntax.merge_syntaxes syn1 syn2;
   236       val tsig = Type.merge_tsigs pp (tsig1, tsig2);
   237       val consts = Consts.merge (consts1, consts2);
   238     in make_sign (naming, syn, tsig, consts) end;
   239 
   240   fun print _ _ = ();
   241 end);
   242 
   243 val init_data = SignData.init;
   244 
   245 fun rep_sg thy = SignData.get thy |> (fn Sign args => args);
   246 
   247 fun map_sign f = SignData.map (fn Sign {naming, syn, tsig, consts} =>
   248   make_sign (f (naming, syn, tsig, consts)));
   249 
   250 fun map_naming f = map_sign (fn (naming, syn, tsig, consts) => (f naming, syn, tsig, consts));
   251 fun map_syn f = map_sign (fn (naming, syn, tsig, consts) => (naming, f syn, tsig, consts));
   252 fun map_tsig f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, f tsig, consts));
   253 fun map_consts f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, tsig, f consts));
   254 
   255 
   256 (* naming *)
   257 
   258 val naming_of = #naming o rep_sg;
   259 val base_name = NameSpace.base;
   260 val full_name = NameSpace.full o naming_of;
   261 fun full_name_path thy elems = NameSpace.full (NameSpace.add_path elems (naming_of thy));
   262 val declare_name = NameSpace.declare o naming_of;
   263 
   264 
   265 (* syntax *)
   266 
   267 val syn_of = #syn o rep_sg;
   268 
   269 
   270 (* type signature *)
   271 
   272 val tsig_of = #tsig o rep_sg;
   273 val classes_of = snd o #classes o Type.rep_tsig o tsig_of;
   274 val arities_of = #arities o Type.rep_tsig o tsig_of;
   275 val classes = Type.classes o tsig_of;
   276 val super_classes = Graph.imm_succs o classes_of;
   277 val defaultS = Type.defaultS o tsig_of;
   278 val subsort = Type.subsort o tsig_of;
   279 val of_sort = Type.of_sort o tsig_of;
   280 val witness_sorts = Type.witness_sorts o tsig_of;
   281 val universal_witness = Type.universal_witness o tsig_of;
   282 val all_sorts_nonempty = is_some o universal_witness;
   283 val typ_instance = Type.typ_instance o tsig_of;
   284 fun typ_equiv thy (T, U) = typ_instance thy (T, U) andalso typ_instance thy (U, T);
   285 val typ_match = Type.typ_match o tsig_of;
   286 val typ_unify = Type.unify o tsig_of;
   287 fun is_logtype thy c = c mem_string Type.logical_types (tsig_of thy);
   288 
   289 
   290 (* polymorphic constants *)
   291 
   292 val consts_of = #consts o rep_sg;
   293 val the_const_constraint = Consts.constraint o consts_of;
   294 val const_constraint = try o the_const_constraint;
   295 val the_const_type = Consts.declaration o consts_of;
   296 val const_type = try o the_const_type;
   297 val const_monomorphic = Consts.monomorphic o consts_of;
   298 val const_typargs = Consts.typargs o consts_of;
   299 val const_instance = Consts.instance o consts_of;
   300 
   301 val declared_tyname = Symtab.defined o #2 o #types o Type.rep_tsig o tsig_of;
   302 val declared_const = is_some oo const_constraint;
   303 
   304 
   305 
   306 (** intern / extern names **)
   307 
   308 val class_space = #1 o #classes o Type.rep_tsig o tsig_of;
   309 val type_space = #1 o #types o Type.rep_tsig o tsig_of;
   310 val const_space = Consts.space_of o consts_of;
   311 
   312 val intern_class = NameSpace.intern o class_space;
   313 val extern_class = NameSpace.extern o class_space;
   314 val intern_type = NameSpace.intern o type_space;
   315 val extern_type = NameSpace.extern o type_space;
   316 val intern_const = NameSpace.intern o const_space;
   317 val extern_const = NameSpace.extern o const_space;
   318 
   319 val intern_sort = map o intern_class;
   320 val extern_sort = map o extern_class;
   321 
   322 local
   323 
   324 fun map_typ f g (Type (c, Ts)) = Type (g c, map (map_typ f g) Ts)
   325   | map_typ f _ (TFree (x, S)) = TFree (x, map f S)
   326   | map_typ f _ (TVar (xi, S)) = TVar (xi, map f S);
   327 
   328 fun map_term f g h (Const (c, T)) = Const (h c, map_typ f g T)
   329   | map_term f g _ (Free (x, T)) = Free (x, map_typ f g T)
   330   | map_term f g _ (Var (xi, T)) = Var (xi, map_typ f g T)
   331   | map_term _ _ _ (t as Bound _) = t
   332   | map_term f g h (Abs (x, T, t)) = Abs (x, map_typ f g T, map_term f g h t)
   333   | map_term f g h (t $ u) = map_term f g h t $ map_term f g h u;
   334 
   335 val add_classesT = Term.fold_atyps
   336   (fn TFree (_, S) => fold (insert (op =)) S
   337     | TVar (_, S) => fold (insert (op =)) S
   338     | _ => I);
   339 
   340 fun add_tyconsT (Type (c, Ts)) = insert (op =) c #> fold add_tyconsT Ts
   341   | add_tyconsT _ = I;
   342 
   343 val add_consts = Term.fold_aterms (fn Const (c, _) => insert (op =) c | _ => I);
   344 
   345 fun mapping add_names f t =
   346   let
   347     fun f' x = let val y = f x in if x = y then NONE else SOME (x, y) end;
   348     val tab = map_filter f' (add_names t []);
   349     fun get x = the_default x (AList.lookup (op =) tab x);
   350   in get end;
   351 
   352 fun typ_mapping f g thy T =
   353   T |> map_typ
   354     (mapping add_classesT (f thy) T)
   355     (mapping add_tyconsT (g thy) T);
   356 
   357 fun term_mapping f g h thy t =
   358   t |> map_term
   359     (mapping (Term.fold_types add_classesT) (f thy) t)
   360     (mapping (Term.fold_types add_tyconsT) (g thy) t)
   361     (mapping add_consts (h thy) t);
   362 
   363 in
   364 
   365 val intern_typ = typ_mapping intern_class intern_type;
   366 val extern_typ = typ_mapping extern_class extern_type;
   367 val intern_term = term_mapping intern_class intern_type intern_const;
   368 fun extern_term h = term_mapping extern_class extern_type (K h);
   369 val intern_tycons = typ_mapping (K I) intern_type;
   370 
   371 end;
   372 
   373 
   374 
   375 (** pretty printing of terms, types etc. **)
   376 
   377 fun pretty_term' context syn ext t =
   378   let val curried = Context.exists_name Context.CPureN (Context.theory_of context)
   379   in Syntax.pretty_term ext context syn curried t end;
   380 
   381 fun pretty_term thy t =
   382   pretty_term' (Context.Theory thy) (syn_of thy) (Consts.extern (consts_of thy))
   383     (extern_term (Consts.extern_early (consts_of thy)) thy t);
   384 
   385 fun pretty_typ thy T = Syntax.pretty_typ (Context.Theory thy) (syn_of thy) (extern_typ thy T);
   386 fun pretty_sort thy S = Syntax.pretty_sort (Context.Theory thy) (syn_of thy) (extern_sort thy S);
   387 
   388 fun pretty_classrel thy cs = Pretty.block (flat
   389   (separate [Pretty.str " <", Pretty.brk 1] (map (single o pretty_sort thy o single) cs)));
   390 
   391 fun pretty_arity thy (a, Ss, S) =
   392   let
   393     val a' = extern_type thy a;
   394     val dom =
   395       if null Ss then []
   396       else [Pretty.list "(" ")" (map (pretty_sort thy) Ss), Pretty.brk 1];
   397   in Pretty.block ([Pretty.str (a' ^ " ::"), Pretty.brk 1] @ dom @ [pretty_sort thy S]) end;
   398 
   399 val string_of_term = Pretty.string_of oo pretty_term;
   400 val string_of_typ = Pretty.string_of oo pretty_typ;
   401 val string_of_sort = Pretty.string_of oo pretty_sort;
   402 val string_of_classrel = Pretty.string_of oo pretty_classrel;
   403 val string_of_arity = Pretty.string_of oo pretty_arity;
   404 
   405 val pprint_term = (Pretty.pprint o Pretty.quote) oo pretty_term;
   406 val pprint_typ = (Pretty.pprint o Pretty.quote) oo pretty_typ;
   407 
   408 fun pp thy = Pretty.pp (pretty_term thy, pretty_typ thy, pretty_sort thy,
   409   pretty_classrel thy, pretty_arity thy);
   410 
   411 
   412 
   413 (** certify entities **)    (*exception TYPE*)
   414 
   415 (* certify wrt. type signature *)
   416 
   417 val arity_number = Type.arity_number o tsig_of;
   418 fun arity_sorts thy = Type.arity_sorts (pp thy) (tsig_of thy);
   419 
   420 fun certify cert = cert o tsig_of o Context.check_thy;
   421 
   422 val certify_class      = certify Type.cert_class;
   423 val certify_sort       = certify Type.cert_sort;
   424 val certify_typ        = certify Type.cert_typ;
   425 val certify_typ_syntax = certify Type.cert_typ_syntax;
   426 val certify_typ_abbrev = certify Type.cert_typ_abbrev;
   427 
   428 
   429 (* certify term/prop *)
   430 
   431 local
   432 
   433 fun type_check pp tm =
   434   let
   435     fun err_appl why bs t T u U =
   436       let
   437         val xs = map Free bs;           (*we do not rename here*)
   438         val t' = subst_bounds (xs, t);
   439         val u' = subst_bounds (xs, u);
   440         val msg = cat_lines
   441           (TypeInfer.appl_error (Syntax.pp_show_brackets pp) why t' T u' U);
   442       in raise TYPE (msg, [T, U], [t', u']) end;
   443 
   444     fun typ_of (_, Const (_, T)) = T
   445       | typ_of (_, Free  (_, T)) = T
   446       | typ_of (_, Var (_, T)) = T
   447       | typ_of (bs, Bound i) = snd (List.nth (bs, i) handle Subscript =>
   448           raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
   449       | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
   450       | typ_of (bs, t $ u) =
   451           let val T = typ_of (bs, t) and U = typ_of (bs, u) in
   452             (case T of
   453               Type ("fun", [T1, T2]) =>
   454                 if T1 = U then T2 else err_appl "Incompatible operand type" bs t T u U
   455             | _ => err_appl "Operator not of function type" bs t T u U)
   456           end;
   457   in typ_of ([], tm) end;
   458 
   459 fun err msg = raise TYPE (msg, [], []);
   460 
   461 fun check_vars (t $ u) = (check_vars t; check_vars u)
   462   | check_vars (Abs (_, _, t)) = check_vars t
   463   | check_vars (Var (xi as (_, i), _)) =
   464       if i < 0 then err ("Malformed variable: " ^ quote (Term.string_of_vname xi)) else ()
   465   | check_vars _ = ();
   466 
   467 in
   468 
   469 fun certify' normalize prop pp consts thy tm =
   470   let
   471     val _ = Context.check_thy thy;
   472     val _ = check_vars tm;
   473     val tm' = Term.map_term_types (certify_typ thy) tm;
   474     val T = type_check pp tm';
   475     val _ = if prop andalso T <> propT then err "Term not of type prop" else ();
   476     val tm'' = Consts.certify pp (tsig_of thy) consts tm';
   477     val tm'' = if normalize then tm'' else tm';
   478   in (if tm = tm'' then tm else tm'', T, Term.maxidx_of_term tm'') end;
   479 
   480 fun certify_term thy = certify' true false (pp thy) (consts_of thy) thy;
   481 fun certify_prop thy = certify' true true (pp thy) (consts_of thy) thy;
   482 
   483 fun cert_term_abbrev thy = #1 o certify' false false (pp thy) (consts_of thy) thy;
   484 val cert_term = #1 oo certify_term;
   485 val cert_prop = #1 oo certify_prop;
   486 
   487 end;
   488 
   489 
   490 (* specifications *)
   491 
   492 fun no_vars pp tm =
   493   (case (Term.term_vars tm, Term.term_tvars tm) of
   494     ([], []) => tm
   495   | (ts, ixns) => error (Pretty.string_of (Pretty.block (Pretty.breaks
   496       (Pretty.str "Illegal schematic variable(s) in term:" ::
   497        map (Pretty.term pp) ts @ map (Pretty.typ pp o TVar) ixns)))));
   498 
   499 fun cert_def pp tm =
   500   let val ((lhs, rhs), _) = tm
   501     |> no_vars pp
   502     |> Logic.strip_imp_concl
   503     |> Logic.dest_def pp Term.is_Const (K false) (K false)
   504   in (Term.dest_Const (Term.head_of lhs), rhs) end
   505   handle TERM (msg, _) => error msg;
   506 
   507 
   508 
   509 (** read and certify entities **)    (*exception ERROR*)
   510 
   511 (* classes and sorts *)
   512 
   513 fun read_class thy c = certify_class thy (intern_class thy c)
   514   handle TYPE (msg, _, _) => error msg;
   515 
   516 fun read_sort' syn context str =
   517   let
   518     val thy = Context.theory_of context;
   519     val _ = Context.check_thy thy;
   520     val S = intern_sort thy (Syntax.read_sort context syn str);
   521   in certify_sort thy S handle TYPE (msg, _, _) => error msg end;
   522 
   523 fun read_sort thy str = read_sort' (syn_of thy) (Context.Theory thy) str;
   524 
   525 
   526 (* type arities *)
   527 
   528 fun prep_arity prep_tycon prep_sort thy (t, Ss, S) =
   529   let val arity = (prep_tycon thy t, map (prep_sort thy) Ss, prep_sort thy S)
   530   in Type.add_arities (pp thy) [arity] (tsig_of thy); arity end;
   531 
   532 val read_arity = prep_arity intern_type read_sort;
   533 val cert_arity = prep_arity (K I) certify_sort;
   534 
   535 
   536 (* types *)
   537 
   538 local
   539 
   540 fun gen_read_typ' cert syn context def_sort str =
   541   let
   542     val thy = Context.theory_of context;
   543     val _ = Context.check_thy thy;
   544     val get_sort = TypeInfer.get_sort (tsig_of thy) def_sort (intern_sort thy);
   545     val T = intern_tycons thy (Syntax.read_typ context syn get_sort (intern_sort thy) str);
   546   in cert thy T handle TYPE (msg, _, _) => error msg end
   547   handle ERROR msg => cat_error msg ("The error(s) above occurred in type " ^ quote str);
   548 
   549 fun gen_read_typ cert (thy, def_sort) str =
   550   gen_read_typ' cert (syn_of thy) (Context.Theory thy) def_sort str;
   551 
   552 in
   553 
   554 fun no_def_sort thy = (thy: theory, K NONE);
   555 
   556 val read_typ'        = gen_read_typ' certify_typ;
   557 val read_typ_syntax' = gen_read_typ' certify_typ_syntax;
   558 val read_typ_abbrev' = gen_read_typ' certify_typ_abbrev;
   559 val read_typ         = gen_read_typ certify_typ;
   560 val read_typ_syntax  = gen_read_typ certify_typ_syntax;
   561 val read_typ_abbrev  = gen_read_typ certify_typ_abbrev;
   562 
   563 end;
   564 
   565 
   566 (* type and constant names *)
   567 
   568 fun read_tyname thy raw_c =
   569   let val c = intern_type thy raw_c
   570   in Type (c, replicate (arity_number thy c) dummyT) end;
   571 
   572 val read_const = Consts.read_const o consts_of;
   573 
   574 
   575 
   576 (** infer_types **)         (*exception ERROR*)
   577 
   578 (*
   579   def_type: partial map from indexnames to types (constrains Frees and Vars)
   580   def_sort: partial map from indexnames to sorts (constrains TFrees and TVars)
   581   used: list of already used type variables
   582   freeze: if true then generated parameters are turned into TFrees, else TVars
   583 
   584   termss: lists of alternative parses (only one combination should be type-correct)
   585   typs: expected types
   586 *)
   587 
   588 fun infer_types_simult pp thy consts def_type def_sort used freeze args =
   589   let
   590     val termss = fold_rev (multiply o fst) args [[]];
   591     val typs =
   592       map (fn (_, T) => certify_typ thy T handle TYPE (msg, _, _) => error msg) args;
   593 
   594     fun infer ts = Result (TypeInfer.infer_types (Syntax.pp_show_brackets pp) (tsig_of thy)
   595         (try (Consts.constraint consts)) def_type def_sort (Consts.intern consts)
   596         (intern_tycons thy) (intern_sort thy) used freeze typs ts)
   597       handle TYPE (msg, _, _) => Exn (ERROR msg);
   598 
   599     val err_results = map infer termss;
   600     val errs = map_filter (fn Exn (ERROR msg) => SOME msg | _ => NONE) err_results;
   601     val results = map_filter get_result err_results;
   602 
   603     val ambiguity = length termss;
   604     fun ambig_msg () =
   605       if ambiguity > 1 andalso ambiguity <= ! Syntax.ambiguity_level then
   606         "Got more than one parse tree.\n\
   607         \Retry with smaller Syntax.ambiguity_level for more information."
   608       else "";
   609   in
   610     if null results then (cat_error (ambig_msg ()) (cat_lines errs))
   611     else if length results = 1 then
   612       (if ambiguity > ! Syntax.ambiguity_level then
   613         warning "Fortunately, only one parse tree is type correct.\n\
   614           \You may still want to disambiguate your grammar or your input."
   615       else (); hd results)
   616     else (cat_error (ambig_msg ()) ("More than one term is type correct:\n" ^
   617       cat_lines (map (Pretty.string_of_term pp) (maps fst results))))
   618   end;
   619 
   620 fun infer_types pp thy consts def_type def_sort used freeze tsT =
   621   apfst hd (infer_types_simult pp thy consts def_type def_sort used freeze [tsT]);
   622 
   623 
   624 (* read_def_terms -- read terms and infer types *)    (*exception ERROR*)
   625 
   626 fun read_def_terms' pp is_logtype syn consts context (types, sorts) used freeze sTs =
   627   let
   628     val thy = Context.theory_of context;
   629     fun read (s, T) =
   630       let val T' = certify_typ thy T handle TYPE (msg, _, _) => error msg
   631       in (Syntax.read context is_logtype syn T' s, T') end;
   632   in infer_types_simult pp thy consts types sorts used freeze (map read sTs) end;
   633 
   634 fun read_def_terms (thy, types, sorts) =
   635   read_def_terms' (pp thy) (is_logtype thy) (syn_of thy) (consts_of thy)
   636     (Context.Theory thy) (types, sorts);
   637 
   638 fun simple_read_term thy T s =
   639   let val ([t], _) = read_def_terms (thy, K NONE, K NONE) [] true [(s, T)]
   640   in t end
   641   handle ERROR msg => cat_error msg ("The error(s) above occurred for term " ^ s);
   642 
   643 fun read_term thy = simple_read_term thy TypeInfer.logicT;
   644 fun read_prop thy = simple_read_term thy propT;
   645 
   646 
   647 
   648 (** signature extension functions **)  (*exception ERROR/TYPE*)
   649 
   650 (* add default sort *)
   651 
   652 fun gen_add_defsort prep_sort s thy =
   653   thy |> map_tsig (Type.set_defsort (prep_sort thy s));
   654 
   655 val add_defsort = gen_add_defsort read_sort;
   656 val add_defsort_i = gen_add_defsort certify_sort;
   657 
   658 
   659 (* add type constructors *)
   660 
   661 fun add_types types thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
   662   let
   663     val syn' = Syntax.extend_type_gram types syn;
   664     val decls = map (fn (a, n, mx) => (Syntax.type_name a mx, n)) types;
   665     val tsig' = Type.add_types naming decls tsig;
   666   in (naming, syn', tsig', consts) end);
   667 
   668 fun add_typedecls decls thy =
   669   let
   670     fun type_of (a, vs, mx) =
   671       if not (has_duplicates (op =) vs) then (a, length vs, mx)
   672       else error ("Duplicate parameters in type declaration: " ^ quote a);
   673   in add_types (map type_of decls) thy end;
   674 
   675 
   676 (* add nonterminals *)
   677 
   678 fun add_nonterminals ns thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
   679   let
   680     val syn' = Syntax.extend_consts ns syn;
   681     val tsig' = Type.add_nonterminals naming ns tsig;
   682   in (naming, syn', tsig', consts) end);
   683 
   684 
   685 (* add type abbreviations *)
   686 
   687 fun gen_add_tyabbr prep_typ (a, vs, rhs, mx) thy =
   688   thy |> map_sign (fn (naming, syn, tsig, consts) =>
   689     let
   690       val syn' = Syntax.extend_type_gram [(a, length vs, mx)] syn;
   691       val a' = Syntax.type_name a mx;
   692       val abbr = (a', vs, prep_typ thy rhs)
   693         handle ERROR msg => cat_error msg ("in type abbreviation " ^ quote a');
   694       val tsig' = Type.add_abbrevs naming [abbr] tsig;
   695     in (naming, syn', tsig', consts) end);
   696 
   697 val add_tyabbrs = fold (gen_add_tyabbr (read_typ_syntax o no_def_sort));
   698 val add_tyabbrs_i = fold (gen_add_tyabbr certify_typ_syntax);
   699 
   700 
   701 (* add type arities *)
   702 
   703 fun gen_add_arities int_type prep_sort arities thy = thy |> map_tsig (fn tsig =>
   704   let
   705     fun prep_arity (a, Ss, S) = (int_type thy a, map (prep_sort thy) Ss, prep_sort thy S)
   706       handle ERROR msg => cat_error msg ("in arity for type " ^ quote a);
   707     val tsig' = Type.add_arities (pp thy) (map prep_arity arities) tsig;
   708   in tsig' end);
   709 
   710 val add_arities = gen_add_arities intern_type read_sort;
   711 val add_arities_i = gen_add_arities (K I) certify_sort;
   712 
   713 
   714 (* modify syntax *)
   715 
   716 fun gen_syntax change_gram prep_typ prmode args thy =
   717   let
   718     fun prep (c, T, mx) = (c, prep_typ thy T, mx) handle ERROR msg =>
   719       cat_error msg ("in syntax declaration " ^ quote (Syntax.const_name c mx));
   720   in thy |> map_syn (change_gram (is_logtype thy) prmode (map prep args)) end;
   721 
   722 fun gen_add_syntax x = gen_syntax Syntax.extend_const_gram x;
   723 
   724 val add_modesyntax = gen_add_syntax (read_typ_syntax o no_def_sort);
   725 val add_modesyntax_i = gen_add_syntax certify_typ_syntax;
   726 val add_syntax = add_modesyntax Syntax.default_mode;
   727 val add_syntax_i = add_modesyntax_i Syntax.default_mode;
   728 val del_modesyntax = gen_syntax Syntax.remove_const_gram (read_typ_syntax o no_def_sort);
   729 val del_modesyntax_i = gen_syntax Syntax.remove_const_gram certify_typ_syntax;
   730 
   731 
   732 (* add constants *)
   733 
   734 local
   735 
   736 fun gen_add_consts prep_typ raw_args thy =
   737   let
   738     val prepT = Compress.typ thy o Type.varifyT o Type.no_tvars o Term.no_dummyT o prep_typ thy;
   739     fun prep (c, T, mx) = ((c, prepT T, mx) handle TYPE (msg, _, _) => error msg)
   740       handle ERROR msg =>
   741         cat_error msg ("in declaration of constant " ^ quote (Syntax.const_name c mx));
   742     val args = map prep raw_args;
   743     val decls = args |> map (fn (c, T, mx) => ((Syntax.const_name c mx, T), true));
   744   in
   745     thy
   746     |> map_consts (fold (Consts.declare (naming_of thy)) decls)
   747     |> add_syntax_i args
   748   end;
   749 
   750 in
   751 
   752 val add_consts = gen_add_consts (read_typ o no_def_sort);
   753 val add_consts_i = gen_add_consts certify_typ;
   754 
   755 end;
   756 
   757 
   758 (* add abbreviations *)
   759 
   760 local
   761 
   762 fun gen_abbrevs prep_term (mode, inout) = fold (fn (raw_c, raw_t, raw_mx) => fn thy =>
   763   let
   764     val prep_tm =
   765       Compress.term thy o Logic.varify o no_vars (pp thy) o Term.no_dummy_patterns o prep_term thy;
   766 
   767     val (c, mx) = Syntax.const_mixfix raw_c raw_mx;
   768     val (c', b) = Syntax.mixfix_const (full_name thy c) mx;
   769     val t = (prep_tm raw_t handle TYPE (msg, _, _) => error msg)
   770       handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c);
   771     val T = Term.fastype_of t;
   772   in
   773     thy
   774     |> map_consts (Consts.abbreviate (pp thy) (tsig_of thy) (naming_of thy) mode ((c, t), b))
   775     |> map_syn (Syntax.extend_consts [c])
   776     |> add_modesyntax_i (mode, inout) [(c', T, mx)]
   777   end);
   778 
   779 in
   780 
   781 val add_abbrevs = gen_abbrevs read_term;
   782 val add_abbrevs_i = gen_abbrevs cert_term_abbrev;
   783 
   784 end;
   785 
   786 
   787 (* add constraints *)
   788 
   789 fun gen_add_constraint int_const prep_typ (raw_c, opt_T) thy =
   790   let
   791     val c = int_const thy raw_c;
   792     fun prepT raw_T =
   793       let val T = Type.varifyT (Type.no_tvars (Term.no_dummyT (prep_typ thy raw_T)))
   794       in cert_term thy (Const (c, T)); T end
   795       handle TYPE (msg, _, _) => error msg;
   796   in thy |> map_consts (Consts.constrain (c, Option.map prepT opt_T)) end;
   797 
   798 val add_const_constraint = gen_add_constraint intern_const (read_typ o no_def_sort);
   799 val add_const_constraint_i = gen_add_constraint (K I) certify_typ;
   800 
   801 
   802 (* add type classes *)
   803 
   804 fun gen_add_class int_class (bclass, raw_classes) thy =
   805   thy |> map_sign (fn (naming, syn, tsig, consts) =>
   806     let
   807       val classes = map (int_class thy) raw_classes;
   808       val syn' = Syntax.extend_consts [bclass] syn;
   809       val tsig' = Type.add_classes (pp thy) naming [(bclass, classes)] tsig;
   810     in (naming, syn', tsig', consts) end)
   811   |> add_consts_i [(Logic.const_of_class bclass, Term.a_itselfT --> propT, NoSyn)];
   812 
   813 val add_classes = fold (gen_add_class intern_class);
   814 val add_classes_i = fold (gen_add_class (K I));
   815 
   816 
   817 (* add to classrel *)
   818 
   819 fun gen_add_classrel int_class raw_pairs thy = thy |> map_tsig (fn tsig =>
   820   let
   821     val pairs = map (pairself (int_class thy)) raw_pairs;
   822     val tsig' = Type.add_classrel (pp thy) pairs tsig;
   823   in tsig' end);
   824 
   825 val add_classrel = gen_add_classrel intern_class;
   826 val add_classrel_i = gen_add_classrel (K I);
   827 
   828 
   829 (* add translation functions *)
   830 
   831 local
   832 
   833 fun mk trs = map Syntax.mk_trfun trs;
   834 
   835 fun gen_add_trfuns ext non_typed (atrs, trs, tr's, atr's) =
   836   map_syn (ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's));
   837 
   838 fun gen_add_trfunsT ext tr's = map_syn (ext ([], [], mk tr's, []));
   839 
   840 in
   841 
   842 val add_trfuns = gen_add_trfuns Syntax.extend_trfuns Syntax.non_typed_tr';
   843 val add_trfunsT = gen_add_trfunsT Syntax.extend_trfuns;
   844 val add_advanced_trfuns = gen_add_trfuns Syntax.extend_advanced_trfuns Syntax.non_typed_tr'';
   845 val add_advanced_trfunsT = gen_add_trfunsT Syntax.extend_advanced_trfuns;
   846 
   847 end;
   848 
   849 val add_tokentrfuns = map_syn o Syntax.extend_tokentrfuns;
   850 fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
   851 
   852 
   853 (* compile translation functions *)
   854 
   855 local
   856 
   857 fun advancedT false = ""
   858   | advancedT true = "Context.generic -> ";
   859 
   860 fun advancedN false = ""
   861   | advancedN true = "advanced_";
   862 
   863 in
   864 
   865 fun parse_ast_translation (a, txt) =
   866   txt |> Context.use_let ("val parse_ast_translation: (string * (" ^ advancedT a ^
   867       "Syntax.ast list -> Syntax.ast)) list")
   868     ("Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], [])");
   869 
   870 fun parse_translation (a, txt) =
   871   txt |> Context.use_let ("val parse_translation: (string * (" ^ advancedT a ^
   872       "term list -> term)) list")
   873     ("Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], [])");
   874 
   875 fun print_translation (a, txt) =
   876   txt |> Context.use_let ("val print_translation: (string * (" ^ advancedT a ^
   877       "term list -> term)) list")
   878     ("Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, [])");
   879 
   880 fun print_ast_translation (a, txt) =
   881   txt |> Context.use_let ("val print_ast_translation: (string * (" ^ advancedT a ^
   882       "Syntax.ast list -> Syntax.ast)) list")
   883     ("Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation)");
   884 
   885 fun typed_print_translation (a, txt) =
   886   txt |> Context.use_let ("val typed_print_translation: (string * (" ^ advancedT a ^
   887       "bool -> typ -> term list -> term)) list")
   888     ("Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation");
   889 
   890 val token_translation =
   891   Context.use_let "val token_translation: (string * string * (string -> string * real)) list"
   892     "Sign.add_tokentrfuns token_translation";
   893 
   894 end;
   895 
   896 
   897 (* translation rules *)
   898 
   899 fun gen_trrules f args thy = thy |> map_syn (fn syn =>
   900   let val rules = map (Syntax.map_trrule (apfst (intern_type thy))) args
   901   in f (Context.Theory thy) (is_logtype thy) syn rules syn end);
   902 
   903 val add_trrules = gen_trrules Syntax.extend_trrules;
   904 val del_trrules = gen_trrules Syntax.remove_trrules;
   905 val add_trrules_i = map_syn o Syntax.extend_trrules_i;
   906 val del_trrules_i = map_syn o Syntax.remove_trrules_i;
   907 
   908 
   909 (* modify naming *)
   910 
   911 val add_path        = map_naming o NameSpace.add_path;
   912 val no_base_names   = map_naming NameSpace.no_base_names;
   913 val qualified_names = map_naming NameSpace.qualified_names;
   914 val sticky_prefix   = map_naming o NameSpace.sticky_prefix;
   915 val set_policy      = map_naming o NameSpace.set_policy;
   916 val restore_naming  = map_naming o K o naming_of;
   917 
   918 val parent_path   = add_path "..";
   919 val root_path     = add_path "/";
   920 val absolute_path = add_path "//";
   921 
   922 fun local_path thy = thy |> root_path |> add_path (Context.theory_name thy);
   923 
   924 
   925 (* hide names *)
   926 
   927 fun hide_classes b xs thy = thy |> map_tsig (Type.hide_classes b (map (intern_class thy) xs));
   928 val hide_classes_i = map_tsig oo Type.hide_classes;
   929 fun hide_types b xs thy = thy |> map_tsig (Type.hide_types b (map (intern_type thy) xs));
   930 val hide_types_i = map_tsig oo Type.hide_types;
   931 fun hide_consts b xs thy = thy |> map_consts (fold (Consts.hide b o intern_const thy) xs);
   932 val hide_consts_i = map_consts oo (fold o Consts.hide);
   933 
   934 local
   935 
   936 val kinds =
   937  [("class", (intern_class, can o certify_class, hide_classes_i)),
   938   ("type", (intern_type, declared_tyname, hide_types_i)),
   939   ("const", (intern_const, declared_const, hide_consts_i))];
   940 
   941 fun gen_hide int b (kind, xnames) thy =
   942   (case AList.lookup (op =) kinds kind of
   943     SOME (intern, check, hide) =>
   944       let
   945         val names = if int then map (intern thy) xnames else xnames;
   946         val bads = filter_out (check thy) names;
   947       in
   948         if null bads then hide b names thy
   949         else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
   950       end
   951   | NONE => error ("Bad name space specification: " ^ quote kind));
   952 
   953 in
   954 
   955 val hide_names = gen_hide true;
   956 val hide_names_i = gen_hide false;
   957 
   958 end;
   959 
   960 end;