Skip to main content
Log in

Abstract

Attention is drawn to a method of implementing data structures in core memory by means of associative links instead of pointers. The properties of associative links are discussed and the way in which they may be exploited in a program for formal differentiation is illustrated. There is a section on microprogramming support for the associative search operations involved.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. D. Rovner and J. A. Feldman, “TheLeap language and data structure,” Lincoln Lab., Cambridge, Mass., 1967.

    Google Scholar 

  2. R. E. Griswold, J. F. Poage, and I. P. Polonsky, “TheSnobol4 Programming Language,” (Prentice-Hall, Englewood Cliffs, N. J., 1968).

    Google Scholar 

  3. Carlos Christensen, “Examples of symbol manipulation in theambit programming language,”Proc. ACM 20th Nat. Conf. Cleveland, Ohio, 1965, ACM Publ. P-65, p. 247.

  4. A. Caracciolo di Forino, L. Spanedda, and N. Wolkenstein, “panon-1b: A programming language for symbol manipulation,” ACM Symp. on Symbolic and Algebraic Manipulation, Washington D.C., 1966;Comm. ACM 9: 549 (1966) (abstract only).

  5. M. V. Wilkes and W. D. Manville, “The associative language AL-1,”Int. J. Comp. Inf. Sci. 1 (4): (1972) (in press).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wilkes, M.V. Associative tabular data structures. International Journal of Computer and Information Sciences 1, 225–233 (1972). https://doi.org/10.1007/BF00977411

Download citation

  • Revised:

  • Issue Date:

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

Keywords

Navigation