Abstracting linked data structures using incremental records

  • Authors:
  • Rainer Woitok

  • Affiliations:
  • Friedrich-Alexander-Universität, Erlangen, West Germany

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

The implementation of an abstract data type "list" using the techniques currently available in some modern programming languages is not as easy as it seems on first glance. The problems inherent in various realizations of such an abstract type are discussed, and a solution is proposed which avoids them. This solution is based on a mechanism called "incremental record declaration" and on generic modules. The combination of these concepts allows an implementation of abstractions which obeys such principles as information hiding, modularity and locality.