DocumentCode
3327603
Title
Multiple representations of abstract data types
Author
George, K.M. ; Fisher, D.D. ; Hedrick, G.E. ; Al-Haddad, H.M.
Author_Institution
Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA
fYear
1991
fDate
3-5 Apr 1991
Firstpage
403
Abstract
The concept of abstract data types allows the use of complex objects without concern about their implementation. This is accomplished by the separation of specification from implementation details. Modern programming languages incorporate this concept into their design to attempt to provide adequate facilities for the separation of specification from implementations. For example, Ada allows specification (eg. package specification) and implementation (eg. package body) to be separate library units. The implementation bundles together a storage representation and the operations of the abstract data type (ADT). The specification can be viewed as an ADT which defines an object and a set of operations on it. There is usually a one-to-one correspondence between the specification and implementation. The user of an ADT has no influence on the representation chosen for the ADT. In certain applications it is useful to choose the representation and algorithms. This paper presents the idea of providing such a facility in the context of abstract data types. The separation of specification from implementation must also be preserved
Keywords
data structures; object-oriented programming; Ada; abstract data types; implementation; multiple representation; programming languages; specification; storage representation; Computer languages; Data structures; Libraries; Object oriented programming; Packaging;
fLanguage
English
Publisher
ieee
Conference_Titel
Applied Computing, 1991., [Proceedings of the 1991] Symposium on
Conference_Location
Kansas City, MO
Print_ISBN
0-8186-2136-2
Type
conf
DOI
10.1109/SOAC.1991.143910
Filename
143910
Link To Document