论文信息 - Orthogonality of information structures

Orthogonality of information structures

SummaryIn the mathematical framework of data spaces the paper develops some important general principles of information structuring. These principles are related to the notions of redundancy of information, completeness of a set of access paths, information sharing and compounding, and virtual access to information. The results are relevant to both sequential and concurrent processing.

Armin B. Cremers | Thomas N. Hibbard | A. Cremers | T. Hibbard

[1] Kristen Nygaard,et al. SIMULA: an ALGOL-based simulation language , 1966, CACM.

[2] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[3] Brian Randell,et al. Process Structuring , 1973, CSUR.

[4] Armin B. Cremers,et al. On the Relationship between a Procedure and its Data , 1976, MFCS.

[5] Edsger W. Dijkstra,et al. Notes on structured programming , 1970 .

[6] Stéphane Bressan,et al. Introduction to Database Systems , 2005 .

[7] Ward Douglas Maurer. A theory of computer instructions , 2006, Sci. Comput. Program..

[8] David Lorge Parnas,et al. A technique for software module specification with examples , 1972, CACM.

[9] Armin B. Cremers,et al. The Semantical Definition of Programming Languages in Terms of Their Data Spaces , 1976, Fachtagung über Programmiersprachen.

[10] Eric G. Wagner. Bounded Action Machines: Toward an Abstract Theory of Computer Structure , 1968, J. Comput. Syst. Sci..

[11] Peter Wegner. Data structure models for programming languages , 1971, SIGP.

[12] Christopher Strachey,et al. Toward a mathematical semantics for computer languages , 1971 .