The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An axiomatic basis for computer programming
Communications of the ACM
On the development of data structures
ACM SIGPLAN Notices
Reply to a paper by A. N. Habermann on the programming language Pascal
ACM SIGPLAN Notices
Data abstraction, controlled iteration, and communicating processes
ACM '80 Proceedings of the ACM 1980 annual conference
Hi-index | 0.00 |
This paper presents a constructive model for data which suggests some precise definitions of notions like type, name, constants, declarations etc. The model is based on an old idea of looking at data as a mapping from a set of names to a set of values. We will study two different kinds of assignments and also show how the model can be used to give some hints for new data structuring methods. In particular we have given a definition of a sequence and we have shown how this data structure can be used to give constructive definitions of structures like stacks, files and queues. We have also studied tree traversals i.e. the correspondence between various trees and sequences.