Subjects — D

Data Structures Quotations

A list is only as strong as its weakest link.

Epigram 68:

If we believe in data structures, we must believe in independent (hence simultaneous) processing. For why else would we collect items within a structure? Why do we tolerate languages that give us the one without the other?

Alan J. Perlis Wikipedia: Alan J. Perlis  

Epigrams on Programming, Sept., 1982

Epigram 86:

We kid ourselves if we think that the ratio of procedure to data in an active data-base system can be made arbitrarily small or even kept small.

Alan J. Perlis Wikipedia: Alan J. Perlis  

Epigrams on Programming, Sept., 1982

Epigram 94:

Interfaces keep things tidy, but don’t accelerate growth: Functions do.

Alan J. Perlis Wikipedia: Alan J. Perlis  

Epigrams on Programming, Sept., 1982

Epigram 126 (on Epigrams):

Epigrams retrieve deep semantics from a data base that is all procedure.

Alan J. Perlis Wikipedia: Alan J. Perlis  

Epigrams on Programming, Sept., 1982