src/Pure/sign.ML
author berghofe
Thu Apr 21 19:12:03 2005 +0200 (2005-04-21)
changeset 15797 a63605582573
parent 15746 44260d72de35
child 15801 d2f5ca3c048d
permissions -rw-r--r--
- Eliminated nodup_vars check.
- Unification and matching functions now check types of term variables / sorts
of type variables when applying a substitution.
- Thm.instantiate now takes (ctyp * ctyp) list instead of (indexname * ctyp) list
as argument, to allow for proper instantiation of theorems containing
type variables with same name but different sorts.
     1 (*  Title:      Pure/sign.ML
     2     ID:         $Id$
     3     Author:     Lawrence C Paulson and Markus Wenzel
     4 
     5 The abstract type "sg" of signatures.
     6 *)
     7 
     8 (*base names*)
     9 type bstring = string;
    10 type bclass = class;
    11 (*external forms -- partially qualified names*)
    12 type xstring = string;
    13 type xclass = class;
    14 type xsort = sort;
    15 type xtyp = typ;
    16 type xterm = term;
    17 
    18 signature SIGN =
    19 sig
    20   type sg
    21   type sg_ref
    22   type data
    23   val rep_sg: sg ->
    24    {self: sg_ref,
    25     tsig: Type.tsig,
    26     consts: (typ * stamp) Symtab.table,
    27     path: string list option,
    28     spaces: (string * NameSpace.T) list,
    29     data: data}
    30   val name_of: sg -> string
    31   val stamp_names_of: sg -> string list
    32   val exists_stamp: string -> sg -> bool
    33   val tsig_of: sg -> Type.tsig
    34   val is_logtype: sg -> string -> bool
    35   val deref: sg_ref -> sg
    36   val self_ref: sg -> sg_ref
    37   val subsig: sg * sg -> bool
    38   val joinable: sg * sg -> bool
    39   val eq_sg: sg * sg -> bool
    40   val same_sg: sg * sg -> bool
    41   val is_draft: sg -> bool
    42   val is_stale: sg -> bool
    43   val syn_of: sg -> Syntax.syntax
    44   val const_type: sg -> string -> typ option
    45   val declared_tyname: sg -> string -> bool
    46   val declared_const: sg -> string -> bool
    47   val classes: sg -> class list
    48   val defaultS: sg -> sort
    49   val subsort: sg -> sort * sort -> bool
    50   val of_sort: sg -> typ * sort -> bool
    51   val witness_sorts: sg -> sort list -> sort list -> (typ * sort) list
    52   val universal_witness: sg -> (typ * sort) option
    53   val typ_instance: sg -> typ * typ -> bool
    54   val classK: string
    55   val typeK: string
    56   val constK: string
    57   val full_name: sg -> bstring -> string
    58   val full_name': sg -> bstring -> string
    59   val full_name_path: sg -> string -> bstring -> string
    60   val base_name: string -> bstring
    61   val intern: sg -> string -> xstring -> string
    62   val extern: sg -> string -> string -> xstring
    63   val cond_extern: sg -> string -> string -> xstring
    64   val cond_extern_table: sg -> string -> 'a Symtab.table -> (xstring * 'a) list
    65   val extern_typ: sg -> typ -> typ
    66   val intern_class: sg -> xclass -> class
    67   val intern_tycon: sg -> xstring -> string
    68   val intern_const: sg -> xstring -> string
    69   val intern_sort: sg -> xsort -> sort
    70   val intern_typ: sg -> xtyp -> typ
    71   val intern_term: sg -> xterm -> term
    72   val intern_tycons: sg -> xtyp -> typ
    73   val pretty_sg: sg -> Pretty.T
    74   val str_of_sg: sg -> string
    75   val pprint_sg: sg -> pprint_args -> unit
    76   val PureN: string
    77   val CPureN: string
    78   val pre_pure: sg
    79   val pretty_term: sg -> term -> Pretty.T
    80   val pretty_term': Syntax.syntax -> sg -> term -> Pretty.T
    81   val pretty_typ: sg -> typ -> Pretty.T
    82   val pretty_sort: sg -> sort -> Pretty.T
    83   val pretty_classrel: sg -> class list -> Pretty.T
    84   val pretty_arity: sg -> arity -> Pretty.T
    85   val string_of_term: sg -> term -> string
    86   val string_of_typ: sg -> typ -> string
    87   val string_of_sort: sg -> sort -> string
    88   val string_of_classrel: sg -> class list -> string
    89   val string_of_arity: sg -> arity -> string
    90   val pprint_term: sg -> term -> pprint_args -> unit
    91   val pprint_typ: sg -> typ -> pprint_args -> unit
    92   val pp: sg -> Pretty.pp
    93   val certify_class: sg -> class -> class
    94   val certify_sort: sg -> sort -> sort
    95   val certify_typ: sg -> typ -> typ
    96   val certify_typ_raw: sg -> typ -> typ
    97   val certify_term: Pretty.pp -> sg -> term -> term * typ * int
    98   val read_sort: sg -> string -> sort
    99   val read_raw_typ: sg * (indexname -> sort option) -> string -> typ
   100   val read_typ: sg * (indexname -> sort option) -> string -> typ
   101   val read_typ': Syntax.syntax -> sg * (indexname -> sort option) -> string -> typ
   102   val read_typ_raw': Syntax.syntax -> sg * (indexname -> sort option) -> string -> typ
   103   val read_tyname: sg -> string -> typ
   104   val read_const: sg -> string -> term
   105   val infer_types: Pretty.pp -> sg -> (indexname -> typ option) ->
   106     (indexname -> sort option) -> string list -> bool
   107     -> xterm list * typ -> term * (indexname * typ) list
   108   val infer_types_simult: Pretty.pp -> sg -> (indexname -> typ option) ->
   109     (indexname -> sort option) -> string list -> bool
   110     -> (xterm list * typ) list -> term list * (indexname * typ) list
   111   val read_def_terms': Pretty.pp -> (string -> bool) -> Syntax.syntax ->
   112     sg * (indexname -> typ option) * (indexname -> sort option) ->
   113     string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
   114   val read_def_terms:
   115     sg * (indexname -> typ option) * (indexname -> sort option) ->
   116     string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
   117   val simple_read_term: sg -> typ -> string -> term
   118   val const_of_class: class -> string
   119   val class_of_const: string -> class
   120   val add_classes: (bclass * xclass list) list -> sg -> sg
   121   val add_classes_i: (bclass * class list) list -> sg -> sg
   122   val add_classrel: (xclass * xclass) list -> sg -> sg
   123   val add_classrel_i: (class * class) list -> sg -> sg
   124   val add_defsort: string -> sg -> sg
   125   val add_defsort_i: sort -> sg -> sg
   126   val add_types: (bstring * int * mixfix) list -> sg -> sg
   127   val add_nonterminals: bstring list -> sg -> sg
   128   val add_tyabbrs: (bstring * string list * string * mixfix) list -> sg -> sg
   129   val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> sg -> sg
   130   val add_arities: (xstring * string list * string) list -> sg -> sg
   131   val add_arities_i: (string * sort list * sort) list -> sg -> sg
   132   val add_consts: (bstring * string * mixfix) list -> sg -> sg
   133   val add_consts_i: (bstring * typ * mixfix) list -> sg -> sg
   134   val add_syntax: (bstring * string * mixfix) list -> sg -> sg
   135   val add_syntax_i: (bstring * typ * mixfix) list -> sg -> sg
   136   val add_modesyntax: (string * bool) * (bstring * string * mixfix) list -> sg -> sg
   137   val add_modesyntax_i: (string * bool) * (bstring * typ * mixfix) list -> sg -> sg
   138   val del_modesyntax: (string * bool) * (bstring * string * mixfix) list -> sg -> sg
   139   val del_modesyntax_i: (string * bool) * (bstring * typ * mixfix) list -> sg -> sg
   140   val add_trfuns:
   141     (string * (ast list -> ast)) list *
   142     (string * (term list -> term)) list *
   143     (string * (term list -> term)) list *
   144     (string * (ast list -> ast)) list -> sg -> sg
   145   val add_trfunsT:
   146     (string * (bool -> typ -> term list -> term)) list -> sg -> sg
   147   val add_advanced_trfuns:
   148     (string * (sg -> ast list -> ast)) list *
   149     (string * (sg -> term list -> term)) list *
   150     (string * (sg -> term list -> term)) list *
   151     (string * (sg -> ast list -> ast)) list -> sg -> sg
   152   val add_advanced_trfunsT:
   153     (string * (sg -> bool -> typ -> term list -> term)) list -> sg -> sg
   154   val add_tokentrfuns:
   155     (string * string * (string -> string * real)) list -> sg -> sg
   156   val add_trrules: (xstring * string) Syntax.trrule list -> sg -> sg
   157   val add_trrules_i: ast Syntax.trrule list -> sg -> sg
   158   val add_path: string -> sg -> sg
   159   val add_space: string * string list -> sg -> sg
   160   val hide_space: bool -> string * string list -> sg -> sg
   161   val hide_space_i: bool -> string * string list -> sg -> sg
   162   val add_name: string -> sg -> sg
   163   val data_kinds: data -> string list
   164   val print_all_data: sg -> unit
   165   val merge_refs: sg_ref * sg_ref -> sg_ref
   166   val merge: sg * sg -> sg
   167   val copy: sg -> sg
   168   val prep_ext: sg -> sg
   169   val prep_ext_merge: sg list -> sg
   170 end;
   171 
   172 signature PRIVATE_SIGN =
   173 sig
   174   include SIGN
   175   val init_data: Object.kind * (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) *
   176     (Object.T * Object.T -> Object.T) * (sg -> Object.T -> unit)) -> sg -> sg
   177   val get_data: Object.kind -> (Object.T -> 'a) -> sg -> 'a
   178   val put_data: Object.kind -> ('a -> Object.T) -> 'a -> sg -> sg
   179   val print_data: Object.kind -> sg -> unit
   180 end;
   181 
   182 structure Sign: PRIVATE_SIGN =
   183 struct
   184 
   185 (** datatype sg **)
   186 
   187 (* types sg, data, syn, sg_ref *)
   188 
   189 datatype sg =
   190   Sg of
   191    {id: string ref,                             (*id*)
   192     stamps: string ref list,                    (*unique theory indentifier*)
   193     syn: syn} *                                 (*syntax for parsing and printing*)
   194    {self: sg_ref,                               (*mutable self reference*)
   195     tsig: Type.tsig,                            (*order-sorted signature of types*)
   196     consts: (typ * stamp) Symtab.table,         (*type schemes of constants*)
   197     path: string list option,                   (*current name space entry prefix*)
   198     spaces: (string * NameSpace.T) list,        (*name spaces for consts, types etc.*)
   199     data: data}                                 (*anytype data*)
   200 and data =
   201   Data of
   202     (Object.kind *                              (*kind (for authorization)*)
   203       (Object.T *                               (*value*)
   204         ((Object.T -> Object.T) *               (*copy method*)
   205           (Object.T -> Object.T) *              (*prepare extend method*)
   206           (Object.T * Object.T -> Object.T) *   (*merge and prepare extend method*)
   207           (sg -> Object.T -> unit))))           (*print method*)
   208     Symtab.table
   209 and syn =
   210   Syn of
   211     Syntax.syntax *
   212      (((sg -> ast list -> ast) * stamp) Symtab.table *
   213       ((sg -> term list -> term) * stamp) Symtab.table *
   214       ((sg -> bool -> typ -> term list -> term) * stamp) list Symtab.table *
   215       ((sg -> ast list -> ast) * stamp) list Symtab.table)
   216 and sg_ref =
   217   SgRef of sg ref option;
   218 
   219 (*make signature*)
   220 fun make_sign (id, self, tsig, consts, syn, path, spaces, data, stamps) =
   221   Sg ({id = id, stamps = stamps, syn = syn}, {self = self, tsig = tsig,
   222     consts = consts, path = path, spaces = spaces, data = data});
   223 
   224 
   225 (* basic operations *)
   226 
   227 fun rep_sg (Sg (_, args)) = args;
   228 
   229 fun stamp_names_of (Sg ({stamps, ...}, _)) = rev (map ! stamps);
   230 fun exists_stamp name (Sg ({stamps, ...}, _)) = exists (equal name o !) stamps;
   231 fun pretty_sg sg = Pretty.str_list "{" "}" (stamp_names_of sg);
   232 val str_of_sg = Pretty.str_of o pretty_sg;
   233 val pprint_sg = Pretty.pprint o pretty_sg;
   234 
   235 val tsig_of = #tsig o rep_sg;
   236 fun is_logtype sg c = c mem_string Type.logical_types (tsig_of sg);
   237 fun const_type (Sg (_, {consts, ...})) c = Option.map #1 (Symtab.lookup (consts, c));
   238 
   239 fun declared_tyname sg c = isSome (Symtab.lookup (#types (Type.rep_tsig (tsig_of sg)), c));
   240 fun declared_const sg c = isSome (const_type sg c);
   241 
   242 
   243 (* id and self *)
   244 
   245 fun check_stale (sg as Sg ({id, ...},
   246         {self = SgRef (SOME (ref (Sg ({id = id', ...}, _)))), ...})) =
   247       if id = id' then sg
   248       else raise TERM ("Stale signature: " ^ str_of_sg sg, [])
   249   | check_stale _ = sys_error "Sign.check_stale";
   250 
   251 fun is_stale sg = (check_stale sg; false) handle TERM _ => true;
   252 
   253 fun self_ref (sg as Sg (_, {self, ...})) = (check_stale sg; self);
   254 
   255 fun deref (SgRef (SOME (ref sg))) = sg
   256   | deref (SgRef NONE) = sys_error "Sign.deref";
   257 
   258 fun name_of (sg as Sg ({id = ref name, ...}, _)) =
   259   if name = "" orelse ord name = ord "#" then
   260     raise TERM ("Nameless signature " ^ str_of_sg sg, [])
   261   else name;
   262 
   263 
   264 (* inclusion and equality *)
   265 
   266 local
   267   (*avoiding polymorphic equality: factor 10 speedup*)
   268   fun mem_stamp (_:string ref, []) = false
   269     | mem_stamp (x, y :: ys) = x = y orelse mem_stamp (x, ys);
   270 
   271   fun subset_stamp ([], ys) = true
   272     | subset_stamp (x :: xs, ys) =
   273         mem_stamp (x, ys) andalso subset_stamp (xs, ys);
   274 in
   275   fun eq_sg (sg1 as Sg ({id = id1, ...}, _), sg2 as Sg ({id = id2, ...}, _)) =
   276     (check_stale sg1; check_stale sg2; id1 = id2);
   277 
   278   fun subsig (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
   279     eq_sg (sg1, sg2) orelse mem_stamp (hd s1, s2);
   280 
   281   fun subsig_internal (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
   282     eq_sg (sg1, sg2) orelse subset_stamp (s1, s2);
   283 end;
   284 
   285 
   286 fun joinable (sg1, sg2) = subsig (sg1, sg2) orelse subsig (sg2, sg1);
   287 
   288 (*test if same theory names are contained in signatures' stamps,
   289   i.e. if signatures belong to same theory but not necessarily to the
   290   same version of it*)
   291 fun same_sg (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
   292   eq_sg (sg1, sg2) orelse eq_set_string (pairself (map (op !)) (s1, s2));
   293 
   294 (*test for drafts*)
   295 fun is_draft (Sg ({stamps = ref name :: _, ...}, _)) =
   296   name = "" orelse ord name = ord "#";
   297 
   298 
   299 (* syntax *)
   300 
   301 fun map_syntax f (Syn (syntax, trfuns)) = Syn (f syntax, trfuns);
   302 
   303 fun make_syntax sg (Syn (syntax, (atrs, trs, tr's, atr's))) =
   304   let
   305     fun apply (c, (f, s)) = (c, (f sg, s));
   306     fun prep tab = map apply (Symtab.dest tab);
   307     fun prep' tab = map apply (Symtab.dest_multi tab);
   308   in syntax |> Syntax.extend_trfuns (prep atrs, prep trs, prep' tr's, prep' atr's) end;
   309 
   310 fun syn_of (sg as Sg ({syn, ...}, _)) = make_syntax sg syn;
   311 
   312 
   313 (* advanced translation functions *)
   314 
   315 fun extend_trfuns (atrs, trs, tr's, atr's)
   316     (Syn (syn, (parse_ast_trtab, parse_trtab, print_trtab, print_ast_trtab))) =
   317   Syn (syn, (Syntax.extend_trtab "parse ast translation" atrs parse_ast_trtab,
   318     Syntax.extend_trtab "parse translation" trs parse_trtab,
   319     Syntax.extend_tr'tab tr's print_trtab,
   320     Syntax.extend_tr'tab atr's print_ast_trtab));
   321 
   322 fun merge_trfuns
   323     (parse_ast_trtab1, parse_trtab1, print_trtab1, print_ast_trtab1)
   324     (parse_ast_trtab2, parse_trtab2, print_trtab2, print_ast_trtab2) =
   325   (Syntax.merge_trtabs "parse ast translation" parse_ast_trtab1 parse_ast_trtab2,
   326     Syntax.merge_trtabs "parse translation" parse_trtab1 parse_trtab2,
   327     Syntax.merge_tr'tabs print_trtab1 print_trtab2,
   328     Syntax.merge_tr'tabs print_ast_trtab1 print_ast_trtab2);
   329 
   330 
   331 (* classes and sorts *)
   332 
   333 val classes = Type.classes o tsig_of;
   334 val defaultS = Type.defaultS o tsig_of;
   335 val subsort = Type.subsort o tsig_of;
   336 val of_sort = Type.of_sort o tsig_of;
   337 val witness_sorts = Type.witness_sorts o tsig_of;
   338 val universal_witness = Type.universal_witness o tsig_of;
   339 val typ_instance = Type.typ_instance o tsig_of;
   340 
   341 
   342 
   343 (** signature data **)
   344 
   345 (* errors *)
   346 
   347 fun of_theory sg = "\nof theory " ^ str_of_sg sg;
   348 
   349 fun err_inconsistent kinds =
   350   error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " data");
   351 
   352 fun err_method name kind e =
   353   (writeln ("Error while invoking " ^ quote kind ^ " " ^ name ^ " method"); raise e);
   354 
   355 fun err_dup_init sg kind =
   356   error ("Duplicate initialization of " ^ quote kind ^ " data" ^ of_theory sg);
   357 
   358 fun err_uninit sg kind =
   359   error ("Tried to access uninitialized " ^ quote kind ^ " data" ^ of_theory sg);
   360 
   361 (*Trying to access theory data using get / put operations from a different
   362   instance of the TheoryDataFun result.  Typical cure: re-load all files*)
   363 fun err_access sg kind =
   364   error ("Unauthorized access to " ^ quote kind ^ " data" ^ of_theory sg);
   365 
   366 
   367 (* prepare data *)
   368 
   369 val empty_data = Data Symtab.empty;
   370 
   371 fun merge_data (Data tab1, Data tab2) =
   372   let
   373     val data1 = map snd (Symtab.dest tab1);
   374     val data2 = map snd (Symtab.dest tab2);
   375     val all_data = data1 @ data2;
   376     val kinds = gen_distinct Object.eq_kind (map fst all_data);
   377 
   378    fun entry data kind =
   379      (case gen_assoc Object.eq_kind (data, kind) of
   380        NONE => []
   381      | SOME x => [(kind, x)]);
   382 
   383     fun merge_entries [(kind, (e, mths as (_, ext, _, _)))] =
   384           (kind, (ext e handle exn => err_method "prep_ext" (Object.name_of_kind kind) exn, mths))
   385       | merge_entries [(kind, (e1, mths as (_, _, mrg, _))), (_, (e2, _))] =
   386           (kind, (mrg (e1, e2)
   387             handle exn => err_method "merge" (Object.name_of_kind kind) exn, mths))
   388       | merge_entries _ = sys_error "merge_entries";
   389 
   390     val data = map (fn k => merge_entries (entry data1 k @ entry data2 k)) kinds;
   391     val data_idx = map (fn (k, x) => (Object.name_of_kind k, (k, x))) data;
   392   in
   393     Data (Symtab.make data_idx)
   394       handle Symtab.DUPS dups => err_inconsistent dups
   395   end;
   396 
   397 fun prep_ext_data data = merge_data (data, empty_data);
   398 
   399 fun init_data_sg sg (Data tab) kind e cp ext mrg prt =
   400   let val name = Object.name_of_kind kind in
   401     Data (Symtab.update_new ((name, (kind, (e, (cp, ext, mrg, prt)))), tab))
   402       handle Symtab.DUP _ => err_dup_init sg name
   403   end;
   404 
   405 
   406 (* access data *)
   407 
   408 fun data_kinds (Data tab) = map fst (Symtab.dest tab);
   409 
   410 fun lookup_data sg tab kind =
   411   let val name = Object.name_of_kind kind in
   412     (case Symtab.lookup (tab, name) of
   413       SOME (k, x) =>
   414         if Object.eq_kind (kind, k) then x
   415         else err_access sg name
   416     | NONE => err_uninit sg name)
   417   end;
   418 
   419 fun get_data kind f (sg as Sg (_, {data = Data tab, ...})) =
   420   let val x = fst (lookup_data sg tab kind)
   421   in f x handle Match => Object.kind_error kind end;
   422 
   423 fun print_data kind (sg as Sg (_, {data = Data tab, ...})) =
   424   let val (e, (_, _, _, prt)) = lookup_data sg tab kind
   425   in prt sg e handle exn => err_method ("print" ^ of_theory sg) (Object.name_of_kind kind) exn end;
   426 
   427 fun print_all_data (sg as Sg (_, {data = Data tab, ...})) =
   428   app (fn kind => print_data kind sg) (map (#1 o #2) (Symtab.dest tab));
   429 
   430 fun put_data_sg sg (Data tab) kind f x =
   431   Data (Symtab.update ((Object.name_of_kind kind,
   432     (kind, (f x, snd (lookup_data sg tab kind)))), tab));
   433 
   434 
   435 
   436 (** build signatures **)
   437 
   438 fun ext_stamps stamps (id as ref name) =
   439   let val stmps = (case stamps of ref "#" :: ss => ss | ss => ss) in
   440     if exists (equal name o !) stmps then
   441       error ("Theory already contains a " ^ quote name ^ " component")
   442     else id :: stmps
   443   end;
   444 
   445 fun create_sign self stamps name (syn, tsig, ctab, (path, spaces), data) =
   446   let
   447     val id = ref name;
   448     val sign =
   449       make_sign (id, self, tsig, ctab, syn, path, spaces, data, ext_stamps stamps id);
   450   in
   451     (case self of
   452       SgRef (SOME r) => r := sign
   453     | _ => sys_error "Sign.create_sign");
   454     sign
   455   end;
   456 
   457 fun extend_sign keep extfun name decls
   458     (sg as Sg ({id = _, stamps, syn}, {self, tsig, consts, path, spaces, data})) =
   459   let
   460     val _ = check_stale sg;
   461     val (self', data') =
   462       if is_draft sg andalso keep then (self, data)
   463       else (SgRef (SOME (ref sg)), prep_ext_data data);
   464   in
   465     create_sign self' stamps name
   466       (extfun sg (syn, tsig, consts, (path, spaces), data') decls)
   467   end;
   468 
   469 
   470 
   471 (** name spaces **)
   472 
   473 (* kinds *)
   474 
   475 val classK = "class";
   476 val typeK = "type";
   477 val constK = "const";
   478 
   479 
   480 (* declare and retrieve names *)
   481 
   482 fun space_of spaces kind =
   483   getOpt (assoc (spaces, kind), NameSpace.empty);
   484 
   485 (*input and output of qualified names*)
   486 fun intrn spaces kind = NameSpace.intern (space_of spaces kind);
   487 fun extrn spaces kind = NameSpace.extern (space_of spaces kind);
   488 fun cond_extrn spaces kind = NameSpace.cond_extern (space_of spaces kind);
   489 fun cond_extrn_table spaces kind tab = NameSpace.cond_extern_table (space_of spaces kind) tab;
   490 
   491 (*add / hide names*)
   492 fun change_space f spaces kind x = overwrite (spaces, (kind, f (space_of spaces kind, x)));
   493 fun add_names x = change_space NameSpace.extend x;
   494 fun hide_names b x = change_space (NameSpace.hide b) x;
   495 
   496 (*make full names, standard version*)
   497 fun full _ "" = error "Attempt to declare empty name \"\""
   498   | full NONE bname = bname
   499   | full (SOME path) bname =
   500       if NameSpace.is_qualified bname then
   501         error ("Attempt to declare qualified name " ^ quote bname)
   502       else
   503         let val name = NameSpace.pack (path @ [bname]) in
   504           if Syntax.is_identifier bname then ()
   505           else warning ("Declared non-identifier " ^ quote name); name
   506         end;
   507 
   508 (*make full names, variant permitting qualified names*)
   509 fun full' _ "" = error "Attempt to declare empty name \"\""
   510   | full' NONE bname = bname
   511   | full' (SOME path) bname =
   512       let
   513         val bnames = NameSpace.unpack bname;
   514         val name = NameSpace.pack (path @ bnames)
   515       in
   516         if forall Syntax.is_identifier bnames then ()
   517         else warning ("Declared non-identifier " ^ quote name); name
   518       end;
   519 
   520 (*base name*)
   521 val base_name = NameSpace.base;
   522 
   523 
   524 (* intern / extern names *)
   525 
   526 local
   527   (*prepare mapping of names*)
   528   fun mapping f add_xs t =
   529     let
   530       fun f' x = let val y = f x in if x = y then NONE else SOME (x, y) end;
   531       val table = List.mapPartial f' (add_xs (t, []));
   532       fun lookup x = getOpt (assoc (table, x), x);
   533     in lookup end;
   534 
   535   (*intern / extern typ*)
   536   fun trn_typ trn T =
   537     T |> map_typ
   538       (mapping (trn classK) add_typ_classes T)
   539       (mapping (trn typeK) add_typ_tycons T);
   540 
   541   (*intern / extern term*)
   542   fun trn_term trn t =
   543     t |> map_term
   544       (mapping (trn classK) add_term_classes t)
   545       (mapping (trn typeK) add_term_tycons t)
   546       (mapping (trn constK) add_term_consts t);
   547 
   548   val spaces_of = #spaces o rep_sg;
   549 in
   550   fun intrn_class spaces = intrn spaces classK;
   551   fun extrn_class spaces = cond_extrn spaces classK;
   552 
   553   val intrn_sort = map o intrn_class;
   554   val intrn_typ = trn_typ o intrn;
   555   val intrn_term = trn_term o intrn;
   556 
   557   val extrn_sort = map o extrn_class;
   558   val extrn_typ = trn_typ o cond_extrn;
   559   val extrn_term = trn_term o cond_extrn;
   560 
   561   fun intrn_tycons spaces T =
   562     map_typ I (mapping (intrn spaces typeK) add_typ_tycons T) T;
   563 
   564   val intern = intrn o spaces_of;
   565   val extern = extrn o spaces_of;
   566   val cond_extern = cond_extrn o spaces_of;
   567   fun cond_extern_table sg = cond_extrn_table (spaces_of sg);
   568 
   569   fun extern_typ (sg as Sg (_, {spaces, ...})) T =
   570        if ! NameSpace.long_names then T else extrn_typ spaces T;
   571 
   572   val intern_class = intrn_class o spaces_of;
   573   val intern_sort = intrn_sort o spaces_of;
   574   val intern_typ = intrn_typ o spaces_of;
   575   val intern_term = intrn_term o spaces_of;
   576 
   577   fun intern_tycon sg = intrn (spaces_of sg) typeK;
   578   fun intern_const sg = intrn (spaces_of sg) constK;
   579 
   580   val intern_tycons = intrn_tycons o spaces_of;
   581 
   582   val full_name = full o #path o rep_sg;
   583   val full_name' = full' o #path o rep_sg;
   584 
   585   fun full_name_path sg elems =
   586     full (SOME (getOpt (#path (rep_sg sg), []) @ NameSpace.unpack elems));
   587 
   588 end;
   589 
   590 
   591 
   592 (** partial Pure signature **)
   593 
   594 val pure_syn =
   595   Syn (Syntax.pure_syn, (Symtab.empty, Symtab.empty, Symtab.empty, Symtab.empty));
   596 
   597 val dummy_sg = make_sign (ref "", SgRef NONE, Type.empty_tsig,
   598   Symtab.empty, pure_syn, SOME [], [], empty_data, []);
   599 
   600 val pre_pure =
   601   create_sign (SgRef (SOME (ref dummy_sg))) [] "#"
   602     (pure_syn, Type.empty_tsig, Symtab.empty, (SOME [], []), empty_data);
   603 
   604 val PureN = "Pure";
   605 val CPureN = "CPure";
   606 
   607 
   608 
   609 (** pretty printing of terms, types etc. **)
   610 
   611 fun pretty_term' syn (sg as Sg ({stamps, ...}, {spaces, ...})) t =
   612   Syntax.pretty_term syn
   613     (exists (equal CPureN o !) stamps)
   614     (if ! NameSpace.long_names then t else extrn_term spaces t);
   615 
   616 fun pretty_term sg t = pretty_term' (syn_of sg) sg t;
   617 
   618 fun pretty_typ sg T =
   619   Syntax.pretty_typ (syn_of sg) (extern_typ sg T);
   620 
   621 fun pretty_sort (sg as Sg (_, {spaces, ...})) S =
   622   Syntax.pretty_sort (syn_of sg)
   623     (if ! NameSpace.long_names then S else extrn_sort spaces S);
   624 
   625 fun pretty_classrel sg cs = Pretty.block (List.concat
   626   (separate [Pretty.str " <", Pretty.brk 1] (map (single o pretty_sort sg o single) cs)));
   627 
   628 fun pretty_arity sg (t, Ss, S) =
   629   let
   630     val t' = cond_extern sg typeK t;
   631     val dom =
   632       if null Ss then []
   633       else [Pretty.list "(" ")" (map (pretty_sort sg) Ss), Pretty.brk 1];
   634   in
   635     Pretty.block
   636       ([Pretty.str (t' ^ " ::"), Pretty.brk 1] @ dom @ [pretty_sort sg S])
   637   end;
   638 
   639 val string_of_term = Pretty.string_of oo pretty_term;
   640 val string_of_typ = Pretty.string_of oo pretty_typ;
   641 val string_of_sort = Pretty.string_of oo pretty_sort;
   642 val string_of_classrel = Pretty.string_of oo pretty_classrel;
   643 val string_of_arity = Pretty.string_of oo pretty_arity;
   644 
   645 fun pprint_term sg = Pretty.pprint o Pretty.quote o (pretty_term sg);
   646 fun pprint_typ sg = Pretty.pprint o Pretty.quote o (pretty_typ sg);
   647 
   648 fun pp sg = Pretty.pp (pretty_term sg, pretty_typ sg, pretty_sort sg,
   649   pretty_classrel sg, pretty_arity sg);
   650 
   651 
   652 
   653 (** read sorts **)  (*exception ERROR*)
   654 
   655 fun err_in_sort s =
   656   error ("The error(s) above occurred in sort " ^ quote s);
   657 
   658 fun rd_sort sg syn tsig spaces str =
   659   let val S = intrn_sort spaces (Syntax.read_sort (make_syntax sg syn) str
   660     handle ERROR => err_in_sort str)
   661   in Type.cert_sort tsig S handle TYPE (msg, _, _) => (error_msg msg; err_in_sort str) end;
   662 
   663 (*read and certify sort wrt a signature*)
   664 fun read_sort (sg as Sg ({syn, ...}, {tsig, spaces, ...})) str =
   665   (check_stale sg; rd_sort sg syn tsig spaces str);
   666 
   667 fun cert_sort _ _ tsig _ = Type.cert_sort tsig;
   668 
   669 
   670 
   671 (** read types **)  (*exception ERROR*)
   672 
   673 fun err_in_type s =
   674   error ("The error(s) above occurred in type " ^ quote s);
   675 
   676 fun rd_raw_typ syn tsig spaces def_sort str =
   677   intrn_tycons spaces (Syntax.read_typ syn
   678     (TypeInfer.get_sort tsig def_sort (intrn_sort spaces)) (intrn_sort spaces) str
   679       handle ERROR => err_in_type str);
   680 
   681 fun read_raw_typ' syn (sg as Sg (_, {tsig, spaces, ...}), def_sort) str =
   682   (check_stale sg; rd_raw_typ syn tsig spaces def_sort str);
   683 
   684 fun read_raw_typ (sg, def_sort) = read_raw_typ' (syn_of sg) (sg, def_sort);
   685 
   686 (*read and certify typ wrt a signature*)
   687 local
   688   fun read_typ_aux rd cert (sg, def_sort) str =
   689     cert (tsig_of sg) (rd (sg, def_sort) str)
   690       handle TYPE (msg, _, _) => (error_msg msg; err_in_type str);
   691 in
   692   val read_typ          = read_typ_aux read_raw_typ Type.cert_typ;
   693   val read_typ_raw      = read_typ_aux read_raw_typ Type.cert_typ_raw;
   694   fun read_typ' syn     = read_typ_aux (read_raw_typ' syn) Type.cert_typ;
   695   fun read_typ_raw' syn = read_typ_aux (read_raw_typ' syn) Type.cert_typ_raw;
   696 end;
   697 
   698 
   699 
   700 (** certify classes, sorts, types and terms **)   (*exception TYPE*)
   701 
   702 val certify_class = Type.cert_class o tsig_of;
   703 val certify_sort = Type.cert_sort o tsig_of;
   704 val certify_typ = Type.cert_typ o tsig_of;
   705 val certify_typ_raw = Type.cert_typ_raw o tsig_of;
   706 
   707 
   708 (* certify_term *)
   709 
   710 local
   711 
   712 (*compute and check type of the term*)
   713 fun type_check pp sg tm =
   714   let
   715     fun err_appl why bs t T u U =
   716       let
   717         val xs = map Free bs;           (*we do not rename here*)
   718         val t' = subst_bounds (xs, t);
   719         val u' = subst_bounds (xs, u);
   720         val text = cat_lines
   721           (TypeInfer.appl_error (Syntax.pp_show_brackets pp) why t' T u' U);
   722       in raise TYPE (text, [T, U], [t', u']) end;
   723 
   724     fun typ_of (_, Const (_, T)) = T
   725       | typ_of (_, Free  (_, T)) = T
   726       | typ_of (_, Var (_, T)) = T
   727       | typ_of (bs, Bound i) = snd (List.nth (bs, i) handle Subscript =>
   728           raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
   729       | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
   730       | typ_of (bs, t $ u) =
   731           let val T = typ_of (bs, t) and U = typ_of (bs, u) in
   732             (case T of
   733               Type ("fun", [T1, T2]) =>
   734                 if T1 = U then T2 else err_appl "Incompatible operand type" bs t T u U
   735             | _ => err_appl "Operator not of function type" bs t T u U)
   736           end;
   737 
   738   in typ_of ([], tm) end;
   739 
   740 in
   741 
   742 fun certify_term pp sg tm =
   743   let
   744     val _ = check_stale sg;
   745 
   746     val tm' = map_term_types (Type.cert_typ (tsig_of sg)) tm;
   747     val tm' = if tm = tm' then tm else tm';  (*avoid copying of already normal term*)
   748 
   749     fun err msg = raise TYPE (msg, [], [tm']);
   750 
   751     fun show_const a T = quote a ^ " :: " ^ Pretty.string_of_typ pp T;
   752 
   753     fun check_atoms (t $ u) = (check_atoms t; check_atoms u)
   754       | check_atoms (Abs (_, _, t)) = check_atoms t
   755       | check_atoms (Const (a, T)) =
   756           (case const_type sg a of
   757             NONE => err ("Undeclared constant " ^ show_const a T)
   758           | SOME U =>
   759               if typ_instance sg (T, U) then ()
   760               else err ("Illegal type for constant " ^ show_const a T))
   761       | check_atoms (Var ((x, i), _)) =
   762           if i < 0 then err ("Malformed variable: " ^ quote x) else ()
   763       | check_atoms _ = ();
   764   in
   765     check_atoms tm';
   766     (tm', type_check pp sg tm', maxidx_of_term tm')
   767   end;
   768 
   769 end;
   770 
   771 
   772 (* type and constant names *)
   773 
   774 fun read_tyname sg raw_c =
   775   let val c = intern_tycon sg raw_c in
   776     (case Symtab.lookup (#types (Type.rep_tsig (tsig_of sg)), c) of
   777       SOME (Type.LogicalType n, _) => Type (c, replicate n dummyT)
   778     | NONE => raise TYPE ("Undeclared type constructor: " ^ quote c, [], []))
   779   end;
   780 
   781 fun read_const sg raw_c =
   782   let val c = intern_const sg raw_c in
   783     if isSome (const_type sg c) then Const (c, dummyT)
   784     else raise TYPE ("Undeclared constant: " ^ quote c, [], [])
   785   end;
   786 
   787 
   788 
   789 (** infer_types **)         (*exception ERROR*)
   790 
   791 (*
   792   def_type: partial map from indexnames to types (constrains Frees, Vars)
   793   def_sort: partial map from indexnames to sorts (constrains TFrees, TVars)
   794   used: list of already used type variables
   795   freeze: if true then generated parameters are turned into TFrees, else TVars
   796 
   797   termss: lists of alternative parses (only one combination should be type-correct)
   798   typs: expected types
   799 *)
   800 
   801 fun infer_types_simult pp sg def_type def_sort used freeze args =
   802   let
   803     val tsig = tsig_of sg;
   804 
   805     val termss = foldr multiply [[]] (map fst args);
   806     val typs =
   807       map (fn (_, T) => certify_typ sg T handle TYPE (msg, _, _) => error msg) args;
   808 
   809     fun infer ts = OK (TypeInfer.infer_types (Syntax.pp_show_brackets pp) tsig
   810         (const_type sg) def_type def_sort (intern_const sg) (intern_tycons sg)
   811         (intern_sort sg) used freeze typs ts)
   812       handle TYPE (msg, _, _) => Error msg;
   813 
   814     val err_results = map infer termss;
   815     val errs = List.mapPartial get_error err_results;
   816     val results = List.mapPartial get_ok err_results;
   817 
   818     val ambiguity = length termss;
   819 
   820     fun ambig_msg () =
   821       if ambiguity > 1 andalso ambiguity <= ! Syntax.ambiguity_level
   822       then
   823         error_msg "Got more than one parse tree.\n\
   824           \Retry with smaller Syntax.ambiguity_level for more information."
   825       else ();
   826   in
   827     if null results then (ambig_msg (); error (cat_lines errs))
   828     else if length results = 1 then
   829       (if ambiguity > ! Syntax.ambiguity_level then
   830         warning "Fortunately, only one parse tree is type correct.\n\
   831           \You may still want to disambiguate your grammar or your input."
   832       else (); hd results)
   833     else (ambig_msg (); error ("More than one term is type correct:\n" ^
   834       cat_lines (map (Pretty.string_of_term pp) (List.concat (map fst results)))))
   835   end;
   836 
   837 
   838 fun infer_types pp sg def_type def_sort used freeze tsT =
   839   apfst hd (infer_types_simult pp sg def_type def_sort used freeze [tsT]);
   840 
   841 
   842 (** read_def_terms **)
   843 
   844 (*read terms, infer types*)
   845 fun read_def_terms' pp is_logtype syn (sign, types, sorts) used freeze sTs =
   846   let
   847     fun read (s, T) =
   848       let val T' = certify_typ sign T handle TYPE (msg, _, _) => error msg
   849       in (Syntax.read is_logtype syn T' s, T') end;
   850     val tsTs = map read sTs;
   851   in infer_types_simult pp sign types sorts used freeze tsTs end;
   852 
   853 fun read_def_terms (sign, types, sorts) =
   854   read_def_terms' (pp sign) (is_logtype sign) (syn_of sign) (sign, types, sorts);
   855 
   856 fun simple_read_term sign T s =
   857   (read_def_terms (sign, K NONE, K NONE) [] true [(s, T)]
   858     handle ERROR => error ("The error(s) above occurred for " ^ s)) |> #1 |> hd;
   859 
   860 
   861 
   862 (** extend signature **)    (*exception ERROR*)
   863 
   864 (** signature extension functions **)  (*exception ERROR*)
   865 
   866 fun decls_of path name_of mfixs =
   867   map (fn (x, y, mx) => (full path (name_of x mx), y)) mfixs;
   868 
   869 fun no_read _ _ _ _ decl = decl;
   870 
   871 
   872 (* add default sort *)
   873 
   874 fun ext_defS prep_sort sg (syn, tsig, ctab, (path, spaces), data) S =
   875   (syn, Type.set_defsort (prep_sort sg syn tsig spaces S) tsig,
   876     ctab, (path, spaces), data);
   877 
   878 fun ext_defsort arg = ext_defS rd_sort arg;
   879 fun ext_defsort_i arg = ext_defS cert_sort arg;
   880 
   881 
   882 (* add type constructors *)
   883 
   884 fun ext_types sg (syn, tsig, ctab, (path, spaces), data) types =
   885   let
   886     val decls = decls_of path Syntax.type_name types;
   887     val syn' = map_syntax (Syntax.extend_type_gram types) syn;
   888     val tsig' = Type.add_types decls tsig;
   889   in (syn', tsig', ctab, (path, add_names spaces typeK (map fst decls)), data) end;
   890 
   891 
   892 (* add type abbreviations *)
   893 
   894 fun read_abbr sg syn tsig spaces (t, vs, rhs_src) =
   895   (t, vs, rd_raw_typ (make_syntax sg syn) tsig spaces (K NONE) rhs_src)
   896     handle ERROR => error ("in type abbreviation " ^ t);
   897 
   898 fun ext_abbrs rd_abbr sg (syn, tsig, ctab, (path, spaces), data) abbrs =
   899   let
   900     fun mfix_of (t, vs, _, mx) = (t, length vs, mx);
   901     val syn' = syn |> map_syntax (Syntax.extend_type_gram (map mfix_of abbrs));
   902 
   903     val abbrs' =
   904       map (fn (t, vs, rhs, mx) =>
   905         (full path (Syntax.type_name t mx), vs, rhs)) abbrs;
   906     val spaces' = add_names spaces typeK (map #1 abbrs');
   907     val decls = map (rd_abbr sg syn' tsig spaces') abbrs';
   908   in (syn', Type.add_abbrs decls tsig, ctab, (path, spaces'), data) end;
   909 
   910 fun ext_tyabbrs abbrs = ext_abbrs read_abbr abbrs;
   911 fun ext_tyabbrs_i abbrs = ext_abbrs no_read abbrs;
   912 
   913 
   914 (* add nonterminals *)
   915 
   916 fun ext_nonterminals _ (syn, tsig, ctab, (path, spaces), data) bnames =
   917   let val names = map (full path) bnames in
   918     (map_syntax (Syntax.extend_consts names) syn,
   919       Type.add_nonterminals names tsig, ctab,
   920       (path, add_names spaces typeK names), data)
   921   end;
   922 
   923 
   924 (* add type arities *)
   925 
   926 fun ext_ars int prep_sort sg (syn, tsig, ctab, (path, spaces), data) arities =
   927   let
   928     val prepS = prep_sort sg syn tsig spaces;
   929     fun prep_arity (c, Ss, S) =
   930       (if int then intrn spaces typeK c else c, map prepS Ss, prepS S);
   931     val tsig' = Type.add_arities (pp sg) (map prep_arity arities) tsig;
   932   in (syn, tsig', ctab, (path, spaces), data) end;
   933 
   934 fun ext_arities arg = ext_ars true rd_sort arg;
   935 fun ext_arities_i arg = ext_ars false cert_sort arg;
   936 
   937 
   938 (* add term constants and syntax *)
   939 
   940 fun const_name path c mx =
   941   full path (Syntax.const_name c mx);
   942 
   943 fun err_in_const c =
   944   error ("in declaration of constant " ^ quote c);
   945 
   946 fun err_dup_consts cs =
   947   error ("Duplicate declaration of constant(s) " ^ commas_quote cs);
   948 
   949 
   950 fun read_cnst sg syn tsig (path, spaces) (c, ty_src, mx) =
   951   (c, rd_raw_typ (make_syntax sg syn) tsig spaces (K NONE) ty_src, mx)
   952     handle ERROR => err_in_const (const_name path c mx);
   953 
   954 fun change_cnsts change_gram rd_const syn_only prmode sg (syn, tsig, ctab, (path, spaces), data)
   955     raw_consts =
   956   let
   957     val prep_typ = compress_type o Type.varifyT o Type.no_tvars o
   958      (if syn_only then Type.cert_typ_syntax tsig else Term.no_dummyT o Type.cert_typ tsig);
   959     fun prep_const (c, ty, mx) = (c, prep_typ ty, mx) handle TYPE (msg, _, _) =>
   960       (error_msg msg; err_in_const (const_name path c mx));
   961 
   962     val consts = map (prep_const o rd_const sg syn tsig (path, spaces)) raw_consts;
   963     val decls =
   964       if syn_only then []
   965       else decls_of path Syntax.const_name consts;
   966   in
   967     (map_syntax (change_gram (is_logtype sg) prmode consts) syn, tsig,
   968       Symtab.extend (ctab, map (fn (c, T) => (c, (T, stamp ()))) decls)
   969         handle Symtab.DUPS cs => err_dup_consts cs,
   970       (path, add_names spaces constK (map fst decls)), data)
   971   end;
   972 
   973 fun ext_cnsts rd = change_cnsts Syntax.extend_const_gram rd;
   974 fun rem_cnsts rd = change_cnsts Syntax.remove_const_gram rd;
   975 
   976 fun ext_consts_i x = ext_cnsts no_read false Syntax.default_mode x;
   977 fun ext_consts x   = ext_cnsts read_cnst false Syntax.default_mode x;
   978 fun ext_syntax_i x = ext_cnsts no_read true Syntax.default_mode x;
   979 fun ext_syntax x   = ext_cnsts read_cnst true Syntax.default_mode x;
   980 
   981 fun ext_modesyntax_i x y (m, cs) = ext_cnsts no_read true m x y cs;
   982 fun ext_modesyntax x y (m, cs)   = ext_cnsts read_cnst true m x y cs;
   983 fun rem_modesyntax_i x y (m, cs) = rem_cnsts no_read true m x y cs;
   984 fun rem_modesyntax x y (m, cs)   = rem_cnsts read_cnst true m x y cs;
   985 
   986 
   987 (* add type classes *)
   988 
   989 fun const_of_class c = c ^ "_class";
   990 
   991 fun class_of_const c_class =
   992   let
   993     val c = implode (Library.take (size c_class - size "_class", explode c_class));
   994   in
   995     if const_of_class c = c_class then c
   996     else raise TERM ("class_of_const: bad name " ^ quote c_class, [])
   997   end;
   998 
   999 
  1000 fun ext_classes int sg (syn, tsig, ctab, (path, spaces), data) classes =
  1001   let
  1002     val names = map fst classes;
  1003     val consts =
  1004       map (fn c => (const_of_class c, a_itselfT --> propT, NoSyn)) names;
  1005 
  1006     val full_names = map (full path) names;
  1007     val spaces' = add_names spaces classK full_names;
  1008     val intrn = if int then map (intrn_class spaces') else I;
  1009     val classes' =
  1010       ListPair.map (fn (c, (_, cs)) => (c, intrn cs)) (full_names, classes);
  1011   in
  1012     ext_consts_i sg
  1013       (map_syntax (Syntax.extend_consts names) syn,
  1014         Type.add_classes (pp sg) classes' tsig, ctab, (path, spaces'), data)
  1015     consts
  1016   end;
  1017 
  1018 
  1019 (* add to classrel *)
  1020 
  1021 fun ext_classrel int sg (syn, tsig, ctab, (path, spaces), data) pairs =
  1022   let val intrn = if int then map (pairself (intrn_class spaces)) else I in
  1023     (syn, Type.add_classrel (pp sg) (intrn pairs) tsig, ctab, (path, spaces), data)
  1024   end;
  1025 
  1026 
  1027 (* add translation functions *)
  1028 
  1029 local
  1030 
  1031 fun mk trs = map Syntax.mk_trfun trs;
  1032 
  1033 fun ext_trfs ext non_typed sg (syn, tsig, ctab, names, data) (atrs, trs, tr's, atr's) =
  1034   let val syn' = syn |> ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's)
  1035   in make_syntax sg syn'; (syn', tsig, ctab, names, data) end;
  1036 
  1037 fun ext_trfsT ext sg (syn, tsig, ctab, names, data) tr's =
  1038   let val syn' = syn |> ext ([], [], mk tr's, [])
  1039   in make_syntax sg syn'; (syn', tsig, ctab, names, data) end;
  1040 
  1041 in
  1042 
  1043 fun ext_trfuns sg = ext_trfs (map_syntax o Syntax.extend_trfuns) Syntax.non_typed_tr' sg;
  1044 fun ext_trfunsT sg = ext_trfsT (map_syntax o Syntax.extend_trfuns) sg;
  1045 fun ext_advanced_trfuns sg = ext_trfs extend_trfuns Syntax.non_typed_tr'' sg;
  1046 fun ext_advanced_trfunsT sg = ext_trfsT extend_trfuns sg;
  1047 
  1048 end;
  1049 
  1050 
  1051 (* add token translation functions *)
  1052 
  1053 fun ext_tokentrfuns sg (syn, tsig, ctab, names, data) args =
  1054   (map_syntax (Syntax.extend_tokentrfuns args) syn, tsig, ctab, names, data);
  1055 
  1056 
  1057 (* add translation rules *)
  1058 
  1059 fun ext_trrules sg (syn, tsig, ctab, (path, spaces), data) args =
  1060   (syn |> map_syntax (Syntax.extend_trrules (is_logtype sg) (make_syntax sg syn)
  1061       (map (Syntax.map_trrule (fn (root, str) => (intrn spaces typeK root, str))) args)),
  1062     tsig, ctab, (path, spaces), data);
  1063 
  1064 fun ext_trrules_i _ (syn, tsig, ctab, names, data) args =
  1065   (syn |> map_syntax (Syntax.extend_trrules_i args), tsig, ctab, names, data);
  1066 
  1067 
  1068 (* add to path *)
  1069 
  1070 fun ext_path _ (syn, tsig, ctab, (path, spaces), data) elems =
  1071   let
  1072     val path' =
  1073       if elems = "//" then NONE
  1074       else if elems = "/" then SOME []
  1075       else if elems = ".." andalso isSome path andalso path <> SOME [] then
  1076         SOME (fst (split_last (valOf path)))
  1077       else SOME (getOpt (path,[]) @ NameSpace.unpack elems);
  1078   in
  1079     (syn, tsig, ctab, (path', spaces), data)
  1080   end;
  1081 
  1082 
  1083 (* change name space *)
  1084 
  1085 fun ext_add_space _ (syn, tsig, ctab, (path, spaces), data) (kind, names) =
  1086   (syn, tsig, ctab, (path, add_names spaces kind names), data);
  1087 
  1088 fun ext_hide_space _ (syn, tsig, ctab, (path, spaces), data) (b, (kind, xnames)) =
  1089   (syn, tsig, ctab, (path, hide_names b spaces kind (map (intrn spaces kind) xnames)), data);
  1090 
  1091 fun ext_hide_space_i _ (syn, tsig, ctab, (path, spaces), data) (b, (kind, names)) =
  1092   (syn, tsig, ctab, (path, hide_names b spaces kind names), data);
  1093 
  1094 
  1095 (* signature data *)
  1096 
  1097 fun ext_init_data sg (syn, tsig, ctab, names, data) (kind, (e, cp, ext, mrg, prt)) =
  1098   (syn, tsig, ctab, names, init_data_sg sg data kind e cp ext mrg prt);
  1099 
  1100 fun ext_put_data sg (syn, tsig, ctab, names, data) (kind, f, x) =
  1101   (syn, tsig, ctab, names, put_data_sg sg data kind f x);
  1102 
  1103 
  1104 fun copy_data (k, (e, mths as (cp, _, _, _))) =
  1105   (k, (cp e handle exn => err_method "copy" (Object.name_of_kind k) exn, mths));
  1106 
  1107 fun copy (sg as Sg ({id = _, stamps, syn}, {self, tsig, consts, path, spaces, data})) =
  1108   let
  1109     val _ = check_stale sg;
  1110     val self' = SgRef (SOME (ref sg));
  1111     val Data tab = data;
  1112     val data' = Data (Symtab.map copy_data tab);
  1113   in create_sign self' stamps "#" (syn, tsig, consts, (path, spaces), data') end;
  1114 
  1115 
  1116 (* the external interfaces *)
  1117 
  1118 val add_classes          = extend_sign true (ext_classes true) "#";
  1119 val add_classes_i        = extend_sign true (ext_classes false) "#";
  1120 val add_classrel         = extend_sign true (ext_classrel true) "#";
  1121 val add_classrel_i       = extend_sign true (ext_classrel false) "#";
  1122 val add_defsort          = extend_sign true ext_defsort "#";
  1123 val add_defsort_i        = extend_sign true ext_defsort_i "#";
  1124 val add_types            = extend_sign true ext_types "#";
  1125 val add_nonterminals     = extend_sign true ext_nonterminals "#";
  1126 val add_tyabbrs          = extend_sign true ext_tyabbrs "#";
  1127 val add_tyabbrs_i        = extend_sign true ext_tyabbrs_i "#";
  1128 val add_arities          = extend_sign true ext_arities "#";
  1129 val add_arities_i        = extend_sign true ext_arities_i "#";
  1130 val add_consts           = extend_sign true ext_consts "#";
  1131 val add_consts_i         = extend_sign true ext_consts_i "#";
  1132 val add_syntax           = extend_sign true ext_syntax "#";
  1133 val add_syntax_i         = extend_sign true ext_syntax_i "#";
  1134 val add_modesyntax       = extend_sign true ext_modesyntax "#";
  1135 val add_modesyntax_i     = extend_sign true ext_modesyntax_i "#";
  1136 val del_modesyntax       = extend_sign true rem_modesyntax "#";
  1137 val del_modesyntax_i     = extend_sign true rem_modesyntax_i "#";
  1138 val add_trfuns           = extend_sign true ext_trfuns "#";
  1139 val add_trfunsT          = extend_sign true ext_trfunsT "#";
  1140 val add_advanced_trfuns  = extend_sign true ext_advanced_trfuns "#";
  1141 val add_advanced_trfunsT = extend_sign true ext_advanced_trfunsT "#";
  1142 val add_tokentrfuns      = extend_sign true ext_tokentrfuns "#";
  1143 val add_trrules          = extend_sign true ext_trrules "#";
  1144 val add_trrules_i        = extend_sign true ext_trrules_i "#";
  1145 val add_path             = extend_sign true ext_path "#";
  1146 val add_space            = extend_sign true ext_add_space "#";
  1147 val hide_space           = curry (extend_sign true ext_hide_space "#");
  1148 val hide_space_i         = curry (extend_sign true ext_hide_space_i "#");
  1149 val init_data            = extend_sign true ext_init_data "#";
  1150 fun put_data k f x       = extend_sign true ext_put_data "#" (k, f, x);
  1151 fun add_name name        = extend_sign true (K K) name ();
  1152 val prep_ext             = extend_sign false (K K) "#" ();
  1153 
  1154 
  1155 
  1156 (** merge signatures **)        (*exception TERM*)
  1157 
  1158 (* merge_stamps *)
  1159 
  1160 fun merge_stamps stamps1 stamps2 =
  1161   let val stamps = merge_lists' stamps1 stamps2 in
  1162     (case duplicates (map ! stamps) of
  1163       [] => stamps
  1164     | dups => raise TERM ("Attempt to merge different versions of theories "
  1165         ^ commas_quote dups, []))
  1166   end;
  1167 
  1168 
  1169 (* trivial merge *)
  1170 
  1171 fun merge_refs (sgr1 as SgRef (SOME (ref (sg1 as Sg ({stamps = s1, ...}, _)))),
  1172         sgr2 as SgRef (SOME (ref (sg2 as Sg ({stamps = s2, ...}, _))))) =
  1173       if subsig (sg2, sg1) then sgr1
  1174       else if subsig (sg1, sg2) then sgr2
  1175       else (merge_stamps s1 s2; (*check for different versions*)
  1176         raise TERM ("Attempt to do non-trivial merge of signatures", []))
  1177   | merge_refs _ = sys_error "Sign.merge_refs";
  1178 
  1179 val merge = deref o merge_refs o pairself self_ref;
  1180 
  1181 
  1182 (* merge_list *)              (*exception TERM/ERROR*)
  1183 
  1184 local
  1185 
  1186 fun nontriv_merge (sg1, sg2) =
  1187   if subsig_internal (sg2, sg1) then sg1
  1188   else if subsig_internal (sg1, sg2) then sg2
  1189   else
  1190     if exists_stamp PureN sg1 andalso exists_stamp CPureN sg2 orelse
  1191       exists_stamp CPureN sg1 andalso exists_stamp PureN sg2
  1192     then error "Cannot merge Pure and CPure signatures"
  1193   else
  1194     let
  1195       val Sg ({id = _, stamps = stamps1, syn = Syn (syntax1, trfuns1)},
  1196           {self = _, tsig = tsig1, consts = consts1,
  1197             path = _, spaces = spaces1, data = data1}) = sg1;
  1198       val Sg ({id = _, stamps = stamps2, syn = Syn (syntax2, trfuns2)},
  1199           {self = _, tsig = tsig2, consts = consts2,
  1200             path = _, spaces = spaces2, data = data2}) = sg2;
  1201 
  1202       val stamps = merge_stamps stamps1 stamps2;
  1203       val syntax = Syntax.merge_syntaxes syntax1 syntax2;
  1204       val trfuns = merge_trfuns trfuns1 trfuns2;
  1205       val consts = Symtab.merge eq_snd (consts1, consts2)
  1206         handle Symtab.DUPS cs => err_dup_consts cs;
  1207 
  1208       val path = SOME [];
  1209       val kinds = distinct (map fst (spaces1 @ spaces2));
  1210       val spaces =
  1211         kinds ~~
  1212           ListPair.map NameSpace.merge
  1213             (map (space_of spaces1) kinds, map (space_of spaces2) kinds);
  1214 
  1215       val data = merge_data (data1, data2);
  1216 
  1217       val pre_sign = make_sign (ref "", SgRef (SOME (ref dummy_sg)),
  1218         tsig1, consts, Syn (syntax, trfuns), path, spaces, data, ref "#" :: stamps1);
  1219       val tsig = Type.merge_tsigs (pp pre_sign) (tsig1, tsig2);
  1220 
  1221       val self_ref = ref dummy_sg;
  1222       val self = SgRef (SOME self_ref);
  1223       val sign = make_sign (ref "", self, tsig, consts, Syn (syntax, trfuns),
  1224         path, spaces, data, stamps);
  1225     in self_ref := sign; syn_of sign; sign end;
  1226 
  1227 in
  1228 
  1229 fun prep_ext_merge sgs =
  1230   if null sgs then
  1231     error "Merge: no parent theories"
  1232   else if exists is_draft sgs then
  1233     error "Attempt to merge draft theories"
  1234   else
  1235     Library.foldl nontriv_merge (hd sgs, tl sgs)
  1236     |> prep_ext
  1237     |> add_path "/";
  1238 
  1239 end;
  1240 
  1241 end;
  1242