Abstract Data Types
暂无分享，去创建一个
This article contains a description of the concepts related to abstract data types (ADTs). Specifically, the presentation contains a explanation of the syntax and semantics of ADTs and uses algebraic semantics to describe the properties of the operations on the data types: stack, queue, set, and bag. A program for a stack ADT in the language C is presented to illustrate a practical implementation. Two different versions of the program use an array and a linked list as the underlying data structures to implement the stack ADT without any effect on its interface and hence the program that uses the stack.
Keywords:
abstraction;
abstract data types;
ADTs;
data type;
algebraic semantics;
information hiding;
stack;
queue;
set;
bag
[1] Joseph A. Goguen,et al. Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.
[2] Craig Schaffert,et al. Abstraction mechanisms in CLU , 1977, CACM.
[3] D. L. Parnas,et al. On the criteria to be used in decomposing systems into modules , 1972, Software Pioneers.
[4] David Lorge Parnas,et al. A technique for software module specification with examples , 1972, CACM.