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