Efficient data accessing in the programming language Bliss

  • Authors:
  • David S. Wile;C. M. Geschke

  • Affiliations:
  • Carnegie-Mellon University;Carnegie-Mellon University

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

The specification of data structure in higher-level languages is isolated from the related specifications of data allocation and data type. Structure specification is claimed to be the definition of the accessing (addressing) function for items having the structure. Conventional techniques for data structure isolation in higher-level languages are examined and are found to suffer from a lack of clarity and efficiency.The means by which data structure accessors may be defined in Bliss, the specification of their association with named, allocated storage, and their automatic invocation by reference to the named storage only, are discussed. An example is presented which illustrates their efficient implementation and their utility for separating the activities of data structure programming and algorithmic programming.