II. Notes on Data Structuring * - Cornell University

174 c.A.R. HOARE
Theorems
REFERENCES
x = y ~ (x = y = T( ) v x.first = y.first & x.final = y.final)
(x = y = T( ) v x.last = y.last & x. initial = y.initial)
The following works have acted as an inspiration and guide for this chapter, and
they are recommended for further reading.
I am also deeply indebted to Professor N. Wirth for many fruitful discussions
and suggestions, and for his willingness to test several of the ideas of the paper
in his design and implementation of PASCAL; and to Professor E. W. Dijkstra for
his perpetual inspiration.
Dijkstra, E. W. (1972). <strong>Notes</strong> on Structured Programming. "Structured
Programming". pp. 1-82. Academic Press, London.
Knuth, D. E. (1968). "The Art of Computer Programming" Vol. 1, chapter 2.
Addison-Wesley, Reading, Mass.
McCarthy, J. (1963). "A Basis for a Mathemetical Theory of Computation in
Computer Programming and Formal Systems" (eds. Braffort, P. & Hirschberg D.).
North-Holland Publishing Company, Amsterdam.
Mealy, G. H. (1967). Another Look at Data. A.F.I.P.S. Fall Joint Computer
Conference Proceedings. 31, pp. 525-534.
Wirth, N. (1970). Programming and Programming Languages. Contribution to
Conference of European Chapter of A.C.M, Bonn.
Wirth, N. (1971). Program Development by Stepwise Refinement. Comm. A.C.M.
14, 4, pp. 221--227.
Wirth, N. (1971). The Programming Language PASCAL. Acta hlformatica, 1, 1,
pp. 35-63.