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