Abstract
In COLD-1, one may overload the symbols that serve the purpose of names for sorts and operations. This means that the same symbol may be used for different things. By doing so, we introduce the problem that the symbol alone does not suffice to trace back the corresponding definition. In order to resolve this problem, symbols have to be completed with qualifiers, domain types and range types just as in the definitions concerned. If a unique completion can not be derived from the context, this must be done explicitly. In this way it is guaranteed that the corresponding definition can be traced back. However, there remains a problem with parametrized component definitions: the same symbol may still be used for sorts or operations from different instantiations. If the instantiation concerned can not be derived from the context, the actual parameters of the component concerned must be added to resolve this problem.
Nomen est omen. (Plautus)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag London Limited
About this chapter
Cite this chapter
Feijs, L.M.G., Jonkers, H.B.M., Middelburg, C.A. (1994). Mechanisms for Naming. In: Notations for Software Design. Formal Approaches to Computing and Information Technology (FACIT). Springer, London. https://doi.org/10.1007/978-1-4471-2107-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2107-7_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-19902-1
Online ISBN: 978-1-4471-2107-7
eBook Packages: Springer Book Archive