src/Pure/sign.ML
author wenzelm
Thu Jul 28 15:19:58 2005 +0200 (2005-07-28)
changeset 16941 0bda949449ee
parent 16894 40f80823b451
child 16988 02cd0c8b96d9
permissions -rw-r--r--
added add_const_constraint(_i), const_constraint;
added typ_match, typ_unify;
     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, constant declarations.
     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_const_constraint: xstring * string -> theory -> theory
    29   val add_const_constraint_i: string * typ -> theory -> theory
    30   val add_classes: (bstring * xstring list) list -> theory -> theory
    31   val add_classes_i: (bstring * class list) list -> theory -> theory
    32   val add_classrel: (xstring * xstring) list -> theory -> theory
    33   val add_classrel_i: (class * class) list -> theory -> theory
    34   val add_trfuns:
    35     (string * (ast list -> ast)) list *
    36     (string * (term list -> term)) list *
    37     (string * (term list -> term)) list *
    38     (string * (ast list -> ast)) list -> theory -> theory
    39   val add_trfunsT:
    40     (string * (bool -> typ -> term list -> term)) list -> theory -> theory
    41   val add_advanced_trfuns:
    42     (string * (theory -> ast list -> ast)) list *
    43     (string * (theory -> term list -> term)) list *
    44     (string * (theory -> term list -> term)) list *
    45     (string * (theory -> ast list -> ast)) list -> theory -> theory
    46   val add_advanced_trfunsT:
    47     (string * (theory -> bool -> typ -> term list -> term)) list -> theory -> theory
    48   val add_tokentrfuns:
    49     (string * string * (string -> string * real)) list -> theory -> theory
    50   val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list
    51     -> theory -> theory
    52   val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
    53   val add_trrules_i: ast Syntax.trrule list -> theory -> theory
    54   val add_path: string -> theory -> theory
    55   val parent_path: theory -> theory
    56   val root_path: theory -> theory
    57   val absolute_path: theory -> theory
    58   val local_path: theory -> theory
    59   val qualified_names: theory -> theory
    60   val no_base_names: theory -> theory
    61   val custom_accesses: (string list -> string list list) -> theory -> theory
    62   val set_policy: (string -> bstring -> string) * (string list -> string list list) ->
    63     theory -> theory
    64   val restore_naming: theory -> theory -> theory
    65   val hide_classes: bool -> xstring list -> theory -> theory
    66   val hide_classes_i: bool -> string list -> theory -> theory
    67   val hide_types: bool -> xstring list -> theory -> theory
    68   val hide_types_i: bool -> string list -> theory -> theory
    69   val hide_consts: bool -> xstring list -> theory -> theory
    70   val hide_consts_i: bool -> string list -> theory -> theory
    71 end
    72 
    73 signature SIGN =
    74 sig
    75   type sg    (*obsolete*)
    76   val init_data: theory -> theory
    77   val rep_sg: theory ->
    78    {naming: NameSpace.naming,
    79     syn: Syntax.syntax,
    80     tsig: Type.tsig,
    81     consts: (typ * stamp) NameSpace.table * typ Symtab.table}
    82   val naming_of: theory -> NameSpace.naming
    83   val base_name: string -> bstring
    84   val full_name: theory -> bstring -> string
    85   val full_name_path: theory -> string -> bstring -> string
    86   val declare_name: theory -> string -> NameSpace.T -> NameSpace.T
    87   val syn_of: theory -> Syntax.syntax
    88   val tsig_of: theory -> Type.tsig
    89   val classes: theory -> class list
    90   val defaultS: theory -> sort
    91   val subsort: theory -> sort * sort -> bool
    92   val of_sort: theory -> typ * sort -> bool
    93   val witness_sorts: theory -> sort list -> sort list -> (typ * sort) list
    94   val universal_witness: theory -> (typ * sort) option
    95   val all_sorts_nonempty: theory -> bool
    96   val typ_instance: theory -> typ * typ -> bool
    97   val typ_match: theory -> typ * typ -> Type.tyenv -> Type.tyenv
    98   val typ_unify: theory -> typ * typ -> Type.tyenv * int -> Type.tyenv * int
    99   val is_logtype: theory -> string -> bool
   100   val const_constraint: theory -> string -> typ option
   101   val const_type: theory -> string -> typ option
   102   val the_const_type: theory -> string -> typ
   103   val declared_tyname: theory -> string -> bool
   104   val declared_const: theory -> string -> bool
   105   val class_space: theory -> NameSpace.T
   106   val type_space: theory -> NameSpace.T
   107   val const_space: theory -> NameSpace.T
   108   val intern_class: theory -> xstring -> string
   109   val extern_class: theory -> string -> xstring
   110   val intern_type: theory -> xstring -> string
   111   val extern_type: theory -> string -> xstring
   112   val intern_const: theory -> xstring -> string
   113   val extern_const: theory -> string -> xstring
   114   val intern_sort: theory -> sort -> sort
   115   val extern_sort: theory -> sort -> sort
   116   val intern_typ: theory -> typ -> typ
   117   val extern_typ: theory -> typ -> typ
   118   val intern_term: theory -> term -> term
   119   val extern_term: theory -> term -> term
   120   val intern_tycons: theory -> typ -> typ
   121   val pretty_term': Syntax.syntax -> theory -> term -> Pretty.T
   122   val pretty_term: theory -> term -> Pretty.T
   123   val pretty_typ: theory -> typ -> Pretty.T
   124   val pretty_sort: theory -> sort -> Pretty.T
   125   val pretty_classrel: theory -> class list -> Pretty.T
   126   val pretty_arity: theory -> arity -> Pretty.T
   127   val string_of_term: theory -> term -> string
   128   val string_of_typ: theory -> typ -> string
   129   val string_of_sort: theory -> sort -> string
   130   val string_of_classrel: theory -> class list -> string
   131   val string_of_arity: theory -> arity -> string
   132   val pprint_term: theory -> term -> pprint_args -> unit
   133   val pprint_typ: theory -> typ -> pprint_args -> unit
   134   val pp: theory -> Pretty.pp
   135   val certify_class: theory -> class -> class
   136   val certify_sort: theory -> sort -> sort
   137   val certify_typ: theory -> typ -> typ
   138   val certify_typ_syntax: theory -> typ -> typ
   139   val certify_typ_abbrev: theory -> typ -> typ
   140   val certify_term: Pretty.pp -> theory -> term -> term * typ * int
   141   val certify_prop: Pretty.pp -> theory -> term -> term * typ * int
   142   val cert_term: theory -> term -> term
   143   val cert_prop: theory -> term -> term
   144   val read_sort': Syntax.syntax -> theory -> string -> sort
   145   val read_sort: theory -> string -> sort
   146   val read_typ': Syntax.syntax -> theory * (indexname -> sort option) -> string -> typ
   147   val read_typ_syntax': Syntax.syntax -> theory * (indexname -> sort option) -> string -> typ
   148   val read_typ_abbrev': Syntax.syntax -> theory * (indexname -> sort option) -> string -> typ
   149   val read_typ: theory * (indexname -> sort option) -> string -> typ
   150   val read_typ_syntax: theory * (indexname -> sort option) -> string -> typ
   151   val read_typ_abbrev: theory * (indexname -> sort option) -> string -> typ
   152   val read_tyname: theory -> string -> typ
   153   val read_const: theory -> string -> term
   154   val infer_types_simult: Pretty.pp -> theory -> (indexname -> typ option) ->
   155     (indexname -> sort option) -> string list -> bool
   156     -> (term list * typ) list -> term list * (indexname * typ) list
   157   val infer_types: Pretty.pp -> theory -> (indexname -> typ option) ->
   158     (indexname -> sort option) -> string list -> bool
   159     -> term list * typ -> term * (indexname * typ) list
   160   val read_def_terms': Pretty.pp -> (string -> bool) -> Syntax.syntax ->
   161     theory * (indexname -> typ option) * (indexname -> sort option) ->
   162     string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
   163   val read_def_terms:
   164     theory * (indexname -> typ option) * (indexname -> sort option) ->
   165     string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
   166   val simple_read_term: theory -> typ -> string -> term
   167   val read_term: theory -> string -> term
   168   val read_prop: theory -> string -> term
   169   val const_of_class: class -> string
   170   val class_of_const: string -> class
   171   include SIGN_THEORY
   172 end
   173 
   174 structure Sign: SIGN =
   175 struct
   176 
   177 type sg = theory;
   178 
   179 
   180 (** datatype sign **)
   181 
   182 datatype sign = Sign of
   183  {naming: NameSpace.naming,                 (*common naming conventions*)
   184   syn: Syntax.syntax,                       (*concrete syntax for terms, types, sorts*)
   185   tsig: Type.tsig,                          (*order-sorted signature of types*)
   186   consts:
   187     (typ * stamp) NameSpace.table *         (*type schemes of declared term constants*)
   188     typ Symtab.table};                      (*type constraints for constants*)
   189 
   190 
   191 fun make_sign (naming, syn, tsig, consts) =
   192   Sign {naming = naming, syn = syn, tsig = tsig, consts = consts};
   193 
   194 fun err_dup_consts cs =
   195   error ("Duplicate declaration of constant(s) " ^ commas_quote cs);
   196 
   197 fun err_inconsistent_constraints cs =
   198   error ("Inconsistent type constraints for constant(s) " ^ commas_quote cs);
   199 
   200 structure SignData = TheoryDataFun
   201 (struct
   202   val name = "Pure/sign";
   203   type T = sign;
   204   val copy = I;
   205   val extend = I;
   206 
   207   val empty = make_sign (NameSpace.default_naming, Syntax.pure_syn, Type.empty_tsig,
   208     (NameSpace.empty_table, Symtab.empty));
   209 
   210   fun merge pp (sign1, sign2) =
   211     let
   212       val Sign {naming = _, syn = syn1, tsig = tsig1, consts = (consts1, constraints1)} = sign1;
   213       val Sign {naming = _, syn = syn2, tsig = tsig2, consts = (consts2, constraints2)} = sign2;
   214 
   215       val naming = NameSpace.default_naming;
   216       val syn = Syntax.merge_syntaxes syn1 syn2;
   217       val tsig = Type.merge_tsigs pp (tsig1, tsig2);
   218       val consts = NameSpace.merge_tables eq_snd (consts1, consts2)
   219         handle Symtab.DUPS cs => err_dup_consts cs;
   220       val constraints = Symtab.merge (op =) (constraints1, constraints2)
   221         handle Symtab.DUPS cs => err_inconsistent_constraints cs;
   222     in make_sign (naming, syn, tsig, (consts, constraints)) end;
   223 
   224   fun print _ _ = ();
   225 end);
   226 
   227 val init_data = SignData.init;
   228 
   229 fun rep_sg thy = SignData.get thy |> (fn Sign args => args);
   230 
   231 fun map_sign f = SignData.map (fn Sign {naming, syn, tsig, consts} =>
   232   make_sign (f (naming, syn, tsig, consts)));
   233 
   234 fun map_naming f = map_sign (fn (naming, syn, tsig, consts) => (f naming, syn, tsig, consts));
   235 fun map_syn f = map_sign (fn (naming, syn, tsig, consts) => (naming, f syn, tsig, consts));
   236 fun map_tsig f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, f tsig, consts));
   237 fun map_consts f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, tsig, f consts));
   238 
   239 
   240 (* naming *)
   241 
   242 val naming_of = #naming o rep_sg;
   243 val base_name = NameSpace.base;
   244 val full_name = NameSpace.full o naming_of;
   245 fun full_name_path thy elems = NameSpace.full (NameSpace.add_path elems (naming_of thy));
   246 val declare_name = NameSpace.declare o naming_of;
   247 
   248 
   249 (* syntax *)
   250 
   251 val syn_of = #syn o rep_sg;
   252 
   253 
   254 (* type signature *)
   255 
   256 val tsig_of = #tsig o rep_sg;
   257 val classes = Type.classes o tsig_of;
   258 val defaultS = Type.defaultS o tsig_of;
   259 val subsort = Type.subsort o tsig_of;
   260 val of_sort = Type.of_sort o tsig_of;
   261 val witness_sorts = Type.witness_sorts o tsig_of;
   262 val universal_witness = Type.universal_witness o tsig_of;
   263 val all_sorts_nonempty = is_some o universal_witness;
   264 val typ_instance = Type.typ_instance o tsig_of;
   265 val typ_match = Type.typ_match o tsig_of;
   266 val typ_unify = Type.unify o tsig_of;
   267 fun is_logtype thy c = c mem_string Type.logical_types (tsig_of thy);
   268 
   269 
   270 (* consts signature *)
   271 
   272 fun const_constraint thy c =
   273   let val ((_, consts), constraints) = #consts (rep_sg thy) in
   274     (case Symtab.lookup (constraints, c) of
   275       NONE => Option.map #1 (Symtab.lookup (consts, c))
   276     | some => some)
   277   end;
   278 
   279 fun const_type thy c = Option.map #1 (Symtab.lookup (#2 (#1 (#consts (rep_sg thy))), c));
   280 
   281 fun the_const_type thy c =
   282   (case const_type thy c of SOME T => T
   283   | NONE => raise TYPE ("Undeclared constant " ^ quote c, [], []));
   284 
   285 val declared_tyname = Symtab.defined o #2 o #types o Type.rep_tsig o tsig_of;
   286 val declared_const = is_some oo const_type;
   287 
   288 
   289 
   290 (** intern / extern names **)
   291 
   292 val class_space = #1 o #classes o Type.rep_tsig o tsig_of;
   293 val type_space = #1 o #types o Type.rep_tsig o tsig_of;
   294 val const_space = #1 o #1 o #consts o rep_sg
   295 
   296 val intern_class = NameSpace.intern o class_space;
   297 val extern_class = NameSpace.extern o class_space;
   298 val intern_type = NameSpace.intern o type_space;
   299 val extern_type = NameSpace.extern o type_space;
   300 val intern_const = NameSpace.intern o const_space;
   301 val extern_const = NameSpace.extern o const_space;
   302 
   303 val intern_sort = map o intern_class;
   304 val extern_sort = map o extern_class;
   305 
   306 local
   307 
   308 fun mapping add_names f t =
   309   let
   310     fun f' x = let val y = f x in if x = y then NONE else SOME (x, y) end;
   311     val tab = List.mapPartial f' (add_names (t, []));
   312     fun get x = if_none (assoc_string (tab, x)) x;
   313   in get end;
   314 
   315 fun typ_mapping f g thy T =
   316   T |> Term.map_typ
   317     (mapping add_typ_classes (f thy) T)
   318     (mapping add_typ_tycons (g thy) T);
   319 
   320 fun term_mapping f g h thy t =
   321   t |> Term.map_term
   322     (mapping add_term_classes (f thy) t)
   323     (mapping add_term_tycons (g thy) t)
   324     (mapping add_term_consts (h thy) t);
   325 
   326 in
   327 
   328 val intern_typ = typ_mapping intern_class intern_type;
   329 val extern_typ = typ_mapping extern_class extern_type;
   330 val intern_term = term_mapping intern_class intern_type intern_const;
   331 val extern_term = term_mapping extern_class extern_type extern_const;
   332 val intern_tycons = typ_mapping (K I) intern_type;
   333 
   334 end;
   335 
   336 
   337 
   338 (** pretty printing of terms, types etc. **)
   339 
   340 fun pretty_term' syn thy t =
   341   Syntax.pretty_term thy syn (Context.exists_name Context.CPureN thy) (extern_term thy t);
   342 fun pretty_term thy t = pretty_term' (syn_of thy) thy t;
   343 fun pretty_typ thy T = Syntax.pretty_typ thy (syn_of thy) (extern_typ thy T);
   344 fun pretty_sort thy S = Syntax.pretty_sort thy (syn_of thy) (extern_sort thy S);
   345 
   346 fun pretty_classrel thy cs = Pretty.block (List.concat
   347   (separate [Pretty.str " <", Pretty.brk 1] (map (single o pretty_sort thy o single) cs)));
   348 
   349 fun pretty_arity thy (a, Ss, S) =
   350   let
   351     val a' = extern_type thy a;
   352     val dom =
   353       if null Ss then []
   354       else [Pretty.list "(" ")" (map (pretty_sort thy) Ss), Pretty.brk 1];
   355   in Pretty.block ([Pretty.str (a' ^ " ::"), Pretty.brk 1] @ dom @ [pretty_sort thy S]) end;
   356 
   357 val string_of_term = Pretty.string_of oo pretty_term;
   358 val string_of_typ = Pretty.string_of oo pretty_typ;
   359 val string_of_sort = Pretty.string_of oo pretty_sort;
   360 val string_of_classrel = Pretty.string_of oo pretty_classrel;
   361 val string_of_arity = Pretty.string_of oo pretty_arity;
   362 
   363 val pprint_term = (Pretty.pprint o Pretty.quote) oo pretty_term;
   364 val pprint_typ = (Pretty.pprint o Pretty.quote) oo pretty_typ;
   365 
   366 fun pp thy = Pretty.pp (pretty_term thy, pretty_typ thy, pretty_sort thy,
   367   pretty_classrel thy, pretty_arity thy);
   368 
   369 
   370 
   371 (** certify entities **)    (*exception TYPE*)
   372 
   373 (* certify wrt. type signature *)
   374 
   375 fun certify cert = cert o tsig_of o Context.check_thy;
   376 
   377 val certify_class      = certify Type.cert_class;
   378 val certify_sort       = certify Type.cert_sort;
   379 val certify_typ        = certify Type.cert_typ;
   380 val certify_typ_syntax = certify Type.cert_typ_syntax;
   381 val certify_typ_abbrev = certify Type.cert_typ_abbrev;
   382 
   383 
   384 (* certify_term *)
   385 
   386 local
   387 
   388 (*determine and check the type of a term*)
   389 fun type_check pp tm =
   390   let
   391     fun err_appl why bs t T u U =
   392       let
   393         val xs = map Free bs;           (*we do not rename here*)
   394         val t' = subst_bounds (xs, t);
   395         val u' = subst_bounds (xs, u);
   396         val msg = cat_lines
   397           (TypeInfer.appl_error (Syntax.pp_show_brackets pp) why t' T u' U);
   398       in raise TYPE (msg, [T, U], [t', u']) end;
   399 
   400     fun typ_of (_, Const (_, T)) = T
   401       | typ_of (_, Free  (_, T)) = T
   402       | typ_of (_, Var (_, T)) = T
   403       | typ_of (bs, Bound i) = snd (List.nth (bs, i) handle Subscript =>
   404           raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
   405       | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
   406       | typ_of (bs, t $ u) =
   407           let val T = typ_of (bs, t) and U = typ_of (bs, u) in
   408             (case T of
   409               Type ("fun", [T1, T2]) =>
   410                 if T1 = U then T2 else err_appl "Incompatible operand type" bs t T u U
   411             | _ => err_appl "Operator not of function type" bs t T u U)
   412           end;
   413 
   414   in typ_of ([], tm) end;
   415 
   416 in
   417 
   418 fun certify_term pp thy tm =
   419   let
   420     val _ = Context.check_thy thy;
   421 
   422     val tm' = map_term_types (certify_typ thy) tm;
   423     val tm' = if tm = tm' then tm else tm';  (*avoid copying of already normal term*)
   424 
   425     fun err msg = raise TYPE (msg, [], [tm']);
   426 
   427     fun show_const a T = quote a ^ " :: " ^ Pretty.string_of_typ pp T;
   428 
   429     fun check_atoms (t $ u) = (check_atoms t; check_atoms u)
   430       | check_atoms (Abs (_, _, t)) = check_atoms t
   431       | check_atoms (Const (a, T)) =
   432           (case const_type thy a of
   433             NONE => err ("Undeclared constant " ^ show_const a T)
   434           | SOME U =>
   435               if typ_instance thy (T, U) then ()
   436               else err ("Illegal type for constant " ^ show_const a T))
   437       | check_atoms (Var ((x, i), _)) =
   438           if i < 0 then err ("Malformed variable: " ^ quote x) else ()
   439       | check_atoms _ = ();
   440   in
   441     check_atoms tm';
   442     (tm', type_check pp tm', maxidx_of_term tm')
   443   end;
   444 
   445 end;
   446 
   447 fun certify_prop pp thy tm =
   448   let val res as (tm', T, _) = certify_term pp thy tm
   449   in if T <> propT then raise TYPE ("Term not of type prop", [T], [tm']) else res end;
   450 
   451 fun cert_term thy tm = #1 (certify_term (pp thy) thy tm);
   452 fun cert_prop thy tm = #1 (certify_prop (pp thy) thy tm);
   453 
   454 
   455 
   456 (** read and certify entities **)    (*exception ERROR*)
   457 
   458 (* sorts *)
   459 
   460 fun read_sort' syn thy str =
   461   let
   462     val _ = Context.check_thy thy;
   463     val S = intern_sort thy (Syntax.read_sort thy syn str);
   464   in certify_sort thy S handle TYPE (msg, _, _) => error msg end;
   465 
   466 fun read_sort thy str = read_sort' (syn_of thy) thy str;
   467 
   468 
   469 (* types *)
   470 
   471 local
   472 
   473 fun gen_read_typ' cert syn (thy, def_sort) str =
   474   let
   475     val _ = Context.check_thy thy;
   476     val get_sort = TypeInfer.get_sort (tsig_of thy) def_sort (intern_sort thy);
   477     val T = intern_tycons thy (Syntax.read_typ thy syn get_sort (intern_sort thy) str);
   478   in cert thy T handle TYPE (msg, _, _) => error msg end
   479   handle ERROR => error ("The error(s) above occurred in type " ^ quote str);
   480 
   481 fun gen_read_typ cert (thy, def_sort) str =
   482   gen_read_typ' cert (syn_of thy) (thy, def_sort) str;
   483 
   484 in
   485 
   486 fun no_def_sort thy = (thy: theory, K NONE);
   487 
   488 val read_typ'        = gen_read_typ' certify_typ;
   489 val read_typ_syntax' = gen_read_typ' certify_typ_syntax;
   490 val read_typ_abbrev' = gen_read_typ' certify_typ_abbrev;
   491 val read_typ         = gen_read_typ certify_typ;
   492 val read_typ_syntax  = gen_read_typ certify_typ_syntax;
   493 val read_typ_abbrev  = gen_read_typ certify_typ_abbrev;
   494 
   495 end;
   496 
   497 
   498 (* type and constant names *)
   499 
   500 fun read_tyname thy raw_c =
   501   let val c = intern_type thy raw_c in
   502     (case Symtab.lookup (#2 (#types (Type.rep_tsig (tsig_of thy))), c) of
   503       SOME (Type.LogicalType n, _) => Type (c, replicate n dummyT)
   504     | _ => error ("Undeclared type constructor: " ^ quote c))
   505   end;
   506 
   507 fun read_const thy raw_c =
   508   let
   509     val c = intern_const thy raw_c;
   510     val _ = the_const_type thy c handle TYPE (msg, _, _) => error msg;
   511   in Const (c, dummyT) end;
   512 
   513 
   514 
   515 (** infer_types **)         (*exception ERROR*)
   516 
   517 (*
   518   def_type: partial map from indexnames to types (constrains Frees and Vars)
   519   def_sort: partial map from indexnames to sorts (constrains TFrees and TVars)
   520   used: list of already used type variables
   521   freeze: if true then generated parameters are turned into TFrees, else TVars
   522 
   523   termss: lists of alternative parses (only one combination should be type-correct)
   524   typs: expected types
   525 *)
   526 
   527 fun infer_types_simult pp thy def_type def_sort used freeze args =
   528   let
   529     val termss = foldr multiply [[]] (map fst args);
   530     val typs =
   531       map (fn (_, T) => certify_typ thy T handle TYPE (msg, _, _) => error msg) args;
   532 
   533     fun infer ts = OK (TypeInfer.infer_types (Syntax.pp_show_brackets pp) (tsig_of thy)
   534         (const_constraint thy) def_type def_sort (intern_const thy) (intern_tycons thy)
   535         (intern_sort thy) used freeze typs ts)
   536       handle TYPE (msg, _, _) => Error msg;
   537 
   538     val err_results = map infer termss;
   539     val errs = List.mapPartial get_error err_results;
   540     val results = List.mapPartial get_ok err_results;
   541 
   542     val ambiguity = length termss;
   543 
   544     fun ambig_msg () =
   545       if ambiguity > 1 andalso ambiguity <= ! Syntax.ambiguity_level
   546       then
   547         error_msg "Got more than one parse tree.\n\
   548           \Retry with smaller Syntax.ambiguity_level for more information."
   549       else ();
   550   in
   551     if null results then (ambig_msg (); error (cat_lines errs))
   552     else if length results = 1 then
   553       (if ambiguity > ! Syntax.ambiguity_level then
   554         warning "Fortunately, only one parse tree is type correct.\n\
   555           \You may still want to disambiguate your grammar or your input."
   556       else (); hd results)
   557     else (ambig_msg (); error ("More than one term is type correct:\n" ^
   558       cat_lines (map (Pretty.string_of_term pp) (List.concat (map fst results)))))
   559   end;
   560 
   561 fun infer_types pp thy def_type def_sort used freeze tsT =
   562   apfst hd (infer_types_simult pp thy def_type def_sort used freeze [tsT]);
   563 
   564 
   565 (* read_def_terms -- read terms and infer types *)    (*exception ERROR*)
   566 
   567 fun read_def_terms' pp is_logtype syn (thy, types, sorts) used freeze sTs =
   568   let
   569     fun read (s, T) =
   570       let val T' = certify_typ thy T handle TYPE (msg, _, _) => error msg
   571       in (Syntax.read thy is_logtype syn T' s, T') end;
   572   in infer_types_simult pp thy types sorts used freeze (map read sTs) end;
   573 
   574 fun read_def_terms (thy, types, sorts) =
   575   read_def_terms' (pp thy) (is_logtype thy) (syn_of thy) (thy, types, sorts);
   576 
   577 fun simple_read_term thy T s =
   578   let val ([t], _) = read_def_terms (thy, K NONE, K NONE) [] true [(s, T)]
   579   in t end
   580   handle ERROR => error ("The error(s) above occurred for term " ^ s);
   581 
   582 fun read_term thy = simple_read_term thy TypeInfer.logicT;
   583 fun read_prop thy = simple_read_term thy propT;
   584 
   585 
   586 
   587 (** signature extension functions **)  (*exception ERROR/TYPE*)
   588 
   589 (* add default sort *)
   590 
   591 fun gen_add_defsort prep_sort s thy =
   592   thy |> map_tsig (Type.set_defsort (prep_sort thy s));
   593 
   594 val add_defsort = gen_add_defsort read_sort;
   595 val add_defsort_i = gen_add_defsort certify_sort;
   596 
   597 
   598 (* add type constructors *)
   599 
   600 fun add_types types thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
   601   let
   602     val syn' = Syntax.extend_type_gram types syn;
   603     val decls = map (fn (a, n, mx) => (Syntax.type_name a mx, n)) types;
   604     val tsig' = Type.add_types naming decls tsig;
   605   in (naming, syn', tsig', consts) end);
   606 
   607 fun add_typedecls decls thy =
   608   let
   609     fun type_of (a, vs, mx) =
   610       if null (duplicates vs) then (a, length vs, mx)
   611       else error ("Duplicate parameters in type declaration: " ^ quote a);
   612   in add_types (map type_of decls) thy end;
   613 
   614 
   615 (* add nonterminals *)
   616 
   617 fun add_nonterminals ns thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
   618   let
   619     val syn' = Syntax.extend_consts ns syn;
   620     val tsig' = Type.add_nonterminals naming ns tsig;
   621   in (naming, syn', tsig', consts) end);
   622 
   623 
   624 (* add type abbreviations *)
   625 
   626 fun gen_add_tyabbr prep_typ (a, vs, rhs, mx) thy =
   627   thy |> map_sign (fn (naming, syn, tsig, consts) =>
   628     let
   629       val syn' = Syntax.extend_type_gram [(a, length vs, mx)] syn;
   630       val a' = Syntax.type_name a mx;
   631       val abbr = (a', vs, prep_typ thy rhs)
   632         handle ERROR => error ("in type abbreviation " ^ quote a');
   633       val tsig' = Type.add_abbrevs naming [abbr] tsig;
   634     in (naming, syn', tsig', consts) end);
   635 
   636 val add_tyabbrs = fold (gen_add_tyabbr (read_typ_syntax o no_def_sort));
   637 val add_tyabbrs_i = fold (gen_add_tyabbr certify_typ_syntax);
   638 
   639 
   640 (* add type arities *)
   641 
   642 fun gen_add_arities int_type prep_sort arities thy = thy |> map_tsig (fn tsig =>
   643   let
   644     fun prep_arity (a, Ss, S) = (int_type thy a, map (prep_sort thy) Ss, prep_sort thy S)
   645       handle ERROR => error ("in arity for type " ^ quote a);
   646     val tsig' = Type.add_arities (pp thy) (map prep_arity arities) tsig;
   647   in tsig' end);
   648 
   649 val add_arities = gen_add_arities intern_type read_sort;
   650 val add_arities_i = gen_add_arities (K I) certify_sort;
   651 
   652 
   653 (* modify syntax *)
   654 
   655 fun gen_syntax change_gram prep_typ prmode args thy =
   656   let
   657     fun prep (c, T, mx) = (c, prep_typ thy T, mx)
   658       handle ERROR => error ("in syntax declaration " ^ quote (Syntax.const_name c mx));
   659   in thy |> map_syn (change_gram (is_logtype thy) prmode (map prep args)) end;
   660 
   661 fun gen_add_syntax x = gen_syntax Syntax.extend_const_gram x;
   662 
   663 val add_modesyntax = gen_add_syntax (read_typ_syntax o no_def_sort);
   664 val add_modesyntax_i = gen_add_syntax certify_typ_syntax;
   665 val add_syntax = add_modesyntax Syntax.default_mode;
   666 val add_syntax_i = add_modesyntax_i Syntax.default_mode;
   667 val del_modesyntax = gen_syntax Syntax.remove_const_gram (read_typ_syntax o no_def_sort);
   668 val del_modesyntax_i = gen_syntax Syntax.remove_const_gram certify_typ_syntax;
   669 
   670 
   671 (* add constants *)
   672 
   673 fun gen_add_consts prep_typ raw_args thy =
   674   let
   675     val prepT = compress_type o Type.varifyT o Type.no_tvars o Term.no_dummyT o prep_typ thy;
   676     fun prep (c, T, mx) = ((c, prepT T, mx) handle TYPE (msg, _, _) => error msg)
   677       handle ERROR => error ("in declaration of constant " ^ quote (Syntax.const_name c mx));
   678     val args = map prep raw_args;
   679     val decls = args |> map (fn (c, T, mx) => (Syntax.const_name c mx, (T, stamp ())));
   680 
   681     fun extend_consts consts = NameSpace.extend_table (naming_of thy) (consts, decls)
   682       handle Symtab.DUPS cs => err_dup_consts cs;
   683   in
   684     thy
   685     |> map_consts (apfst extend_consts)
   686     |> add_syntax_i args
   687   end;
   688 
   689 val add_consts = gen_add_consts (read_typ o no_def_sort);
   690 val add_consts_i = gen_add_consts certify_typ;
   691 
   692 
   693 (* add constraints *)
   694 
   695 fun gen_add_constraint int_const prep_typ (raw_c, raw_T) thy =
   696   let
   697     val c = int_const thy raw_c;
   698     val T = Term.zero_var_indexesT (Term.no_dummyT (prep_typ thy raw_T))
   699       handle TYPE (msg, _, _) => error msg;
   700     val _ = cert_term thy (Const (c, T))
   701       handle TYPE (msg, _, _) => error msg;
   702   in thy |> map_consts (apsnd (curry Symtab.update (c, T))) end;
   703 
   704 val add_const_constraint = gen_add_constraint intern_const (read_typ o no_def_sort);
   705 val add_const_constraint_i = gen_add_constraint (K I) certify_typ;
   706 
   707 
   708 (* add type classes *)
   709 
   710 val classN = "_class";
   711 
   712 val const_of_class = suffix classN;
   713 fun class_of_const c = unsuffix classN c
   714   handle Fail _ => raise TERM ("class_of_const: bad name " ^ quote c, []);
   715 
   716 fun gen_add_class int_class (bclass, raw_classes) thy =
   717   thy |> map_sign (fn (naming, syn, tsig, consts) =>
   718     let
   719       val classes = map (int_class thy) raw_classes;
   720       val syn' = Syntax.extend_consts [bclass] syn;
   721       val tsig' = Type.add_classes (pp thy) naming [(bclass, classes)] tsig;
   722     in (naming, syn', tsig', consts) end)
   723   |> add_consts_i [(const_of_class bclass, a_itselfT --> propT, Syntax.NoSyn)];
   724 
   725 val add_classes = fold (gen_add_class intern_class);
   726 val add_classes_i = fold (gen_add_class (K I));
   727 
   728 
   729 (* add to classrel *)
   730 
   731 fun gen_add_classrel int_class raw_pairs thy = thy |> map_tsig (fn tsig =>
   732   let
   733     val pairs = map (pairself (int_class thy)) raw_pairs;
   734     val tsig' = Type.add_classrel (pp thy) pairs tsig;
   735   in tsig' end);
   736 
   737 val add_classrel = gen_add_classrel intern_class;
   738 val add_classrel_i = gen_add_classrel (K I);
   739 
   740 
   741 (* add translation functions *)
   742 
   743 local
   744 
   745 fun mk trs = map Syntax.mk_trfun trs;
   746 
   747 fun gen_add_trfuns ext non_typed (atrs, trs, tr's, atr's) =
   748   map_syn (ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's));
   749 
   750 fun gen_add_trfunsT ext tr's = map_syn (ext ([], [], mk tr's, []));
   751 
   752 in
   753 
   754 val add_trfuns = gen_add_trfuns Syntax.extend_trfuns Syntax.non_typed_tr';
   755 val add_trfunsT = gen_add_trfunsT Syntax.extend_trfuns;
   756 val add_advanced_trfuns = gen_add_trfuns Syntax.extend_advanced_trfuns Syntax.non_typed_tr'';
   757 val add_advanced_trfunsT = gen_add_trfunsT Syntax.extend_advanced_trfuns;
   758 
   759 end;
   760 
   761 val add_tokentrfuns = map_syn o Syntax.extend_tokentrfuns;
   762 fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
   763 
   764 
   765 (* add translation rules *)
   766 
   767 fun add_trrules args thy = thy |> map_syn (fn syn =>
   768   let val rules = map (Syntax.map_trrule (apfst (intern_type thy))) args
   769   in Syntax.extend_trrules thy (is_logtype thy) syn rules syn end);
   770 
   771 val add_trrules_i = map_syn o Syntax.extend_trrules_i;
   772 
   773 
   774 (* modify naming *)
   775 
   776 val add_path        = map_naming o NameSpace.add_path;
   777 val qualified_names = map_naming NameSpace.qualified_names;
   778 val no_base_names   = map_naming NameSpace.no_base_names;
   779 val custom_accesses = map_naming o NameSpace.custom_accesses;
   780 val set_policy      = map_naming o NameSpace.set_policy;
   781 val restore_naming  = map_naming o K o naming_of;
   782 
   783 val parent_path     = add_path "..";
   784 val root_path       = add_path "/";
   785 val absolute_path   = add_path "//";
   786 
   787 fun local_path thy = thy |> root_path |> add_path (Context.theory_name thy);
   788 
   789 
   790 (* hide names *)
   791 
   792 fun hide_classes b xs thy = thy |> map_tsig (Type.hide_classes b (map (intern_class thy) xs));
   793 val hide_classes_i = map_tsig oo Type.hide_classes;
   794 fun hide_types b xs thy = thy |> map_tsig (Type.hide_types b (map (intern_type thy) xs));
   795 val hide_types_i = map_tsig oo Type.hide_types;
   796 fun hide_consts b xs thy =
   797   thy |> map_consts (apfst (apfst (fold (NameSpace.hide b o intern_const thy) xs)));
   798 val hide_consts_i = (map_consts o apfst o apfst) oo (fold o NameSpace.hide);
   799 
   800 end;