Toward an Understanding of Data Structures

This paper presents a notation and formalism
for describing the semantics of data structures. 
 This is based on directed graphs with named edges and
transformations on these graphs.  In addition, 
an implementation facility is described which could
be part of a programming language, which allows a 
programmer who has expressed the semantics of an algorithm
in terms of the graphs to then specify the 
implementation of some of his data structures in order to gain efficiency.

CACM October,1971

Earley, J.

data structures, graph, implementation,
semantic formalism, programming language

4.22 4.9 5.24

CA711001 JB February 2, 1978  1:35 PM

1024	4	2155
1051	4	2155
1051	4	2155
1102	4	2155
1132	4	2155
1390	4	2155
1486	4	2155
1549	4	2155
1552	4	2155
1665	4	2155
1706	4	2155
1826	4	2155
1860	4	2155
1860	4	2155
1878	4	2155
1957	4	2155
378	4	2155
2060	4	2155
2155	4	2155
2155	4	2155
2155	4	2155
2155	4	2155
2155	4	2155
2162	4	2155
2168	4	2155
2294	4	2155
2406	4	2155
2558	4	2155
2710	4	2155
2715	4	2155
2716	4	2155
2717	4	2155
2718	4	2155
2719	4	2155
2723	4	2155
2765	4	2155
2817	4	2155
2838	4	2155
2842	4	2155
2842	4	2155
2855	4	2155
2879	4	2155
2888	4	2155
2901	4	2155
2957	4	2155
2959	4	2155
2965	4	2155
3077	4	2155
3077	4	2155
3080	4	2155
3087	4	2155
3106	4	2155
3150	4	2155
3154	4	2155
627	4	2155
106	4	2155
210	5	2155
1389	5	2155
378	5	2155
2046	5	2155
2060	5	2155
2155	5	2155
2155	5	2155
2155	5	2155
2252	5	2155
2594	5	2155
1358	6	2155
1496	6	2155
1771	6	2155
2155	6	2155
2155	6	2155
2204	6	2155
3184	6	2155
3186	6	2155