Skip to main content
SpringerLink
Log in

An implementation base for efficient data structuring

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

The specification of data structure in higher-level languages is isolated from the related specifications of data allocation and binding of names. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. A. Wulf, D. Russell, A. N. Habermann, C. Gesenke, J. Apperson, and D. Wile,Bliss Reference Manual (Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa., 1970).

    Google Scholar 

  2. Digital Equipment Corporation,PDP-10 Reference Handbook, 1969.

  3. P. Naur (Ed.), “Revised report on the algorithmic language ALGOL 60,”Commun. ACM 6(1): 1–17 (1963).

    Google Scholar 

  4. John McCarthy et al,LISP 1.5 Programmer's Manual (MIT Press, Cambridge, Mass., 1962).

    Google Scholar 

  5. IBM Corporation,PL/I: Language Specification, No. C28-6571-4.

  6. J. B. Morris and M. B. Wells, “Generalized data structures in MADCAP VI,” inProc. of SIGPLAN Symposium on Data Structures in Programming Languages, Gainesville, Florida, February 25–27, 1971, pp. 321–336.

  7. N. Wirth, “The programming language Pascal,”Acta Informatica 1: 35–63 (1971).

    Google Scholar 

  8. W. Wulf, C. Geschke, D. Wile, and J. Apperson, “Reflections on a systems programming language,” inProc. of SIGPLAN Symposium on Languages for Systems Implementation,Lafayette, Indiana, October 25–26, 1971, pp. 42–49.

  9. David S. Wile and C. M. Geschke, “Efficient data accessing in the programming language Bliss,” inProc. of SIGPLAN Symposium on Data Structures in Programming Languages, Gainesville, Florida, February 25–27, 1971,pp. 306–320.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania

    D. S. Wile & C. M. Geschke

Authors
  1. D. S. Wile
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. M. Geschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Advanced Research Projects Agency of the Office of the Secretary of Defense (F44620-70-C-0107) and is monitored by the Air Force Office of Scientific Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wile, D.S., Geschke, C.M. An implementation base for efficient data structuring. International Journal of Computer and Information Sciences 1, 209–224 (1972). https://doi.org/10.1007/BF00977410

Download citation

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00977410

Keywords

Search

Navigation