Abstract A data space is a general mathematical model for data types with a dynamic component (procedures). It consists of a set of objects (states), a set of functions for describing the information aspects of these objects, together with a control, i.e. a function mapping objects into objects. A set of properties is given which specify the formal relationship among the constituent components of a data space. The results of this paper especially concern the dependency between information structuring and control structuring. The mathematical analysis of this relationship is enhanced by focussing on the structure of so-called dependency sets, i.e. sets of objects which reflect the underlying control structure. The paper develops techniques for constructing meaningful dependency sets.
[1]
Ward Douglas Maurer.
A Theory of Computer Instructions
,
1966,
JACM.
[2]
Eric G. Wagner.
Bounded Action Machines: Toward an Abstract Theory of Computer Structure
,
1968,
J. Comput. Syst. Sci..
[3]
Abraham Robinson,et al.
Random-Access Stored-Program Machines, an Approach to Programming Languages
,
1964,
JACM.
[4]
Armin B. Cremers,et al.
On the Relationship between a Procedure and its Data
,
1976,
MFCS.
[5]
Reinhard Zumkeller.
Strukturuntersuchungen an abstrakten Rechenmaschinen
,
1976
.