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