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.
Similar content being viewed by others
References
R. D. Rovner and J. A. Feldman, “TheLeap language and data structure,” Lincoln Lab., Cambridge, Mass., 1967.
R. E. Griswold, J. F. Poage, and I. P. Polonsky, “TheSnobol4 Programming Language,” (Prentice-Hall, Englewood Cliffs, N. J., 1968).
Carlos Christensen, “Examples of symbol manipulation in theambit programming language,”Proc. ACM 20th Nat. Conf. Cleveland, Ohio, 1965, ACM Publ. P-65, p. 247.
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).
M. V. Wilkes and W. D. Manville, “The associative language AL-1,”Int. J. Comp. Inf. Sci. 1 (4): (1972) (in press).
Author information
Authors and Affiliations
Rights 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
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00977411