Skip to main content
SpringerLink
Log in

Orthogonality of information structures

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cremers, A., Hibbard, T.N.: The semantic definition of programming languages in terms of their data spaces. In: Programmiersprachen, Informatik-Fachberichte, Vol. 1. Berlin-Heidelberg-New York: Springer 1976

    Google Scholar 

  2. Cremers, A., Hibbard, T.N.: On the relationship between a procedure and its data. In: Mathematical foundations of computer science. Lecture notes in computer science, Vol. 45. Berlin-Heidelberg-New York: Springer 1976

    Google Scholar 

  3. Dahl, O.-J., Nygaard, K.: SIMULA-An ALGOL-based simulation language. Comm. ACM 6, 671–678 (1966)

    Google Scholar 

  4. Date, C.J.: An introduction to database systems. Reading, Mass.: Addison-Wesley 1975

    Google Scholar 

  5. Dijkstra, E.W.: Notes on structured programming. In: Structured programming. New York, N.Y.: Academic Press 1972

    Google Scholar 

  6. Dijkstra, E.W.: A discipline of programming. Englewood Cliffs, N.J.: Prentice-Hall 1976

    Google Scholar 

  7. Horning, J.J., Randell, B.: Process structuring. Comput. Surveys 5, 5–30 (1973)

    Google Scholar 

  8. Maurer, W.D.: A theory of computer instructions. J. Assoc. Comput. Mach. 13, 226–235 (1966)

    Google Scholar 

  9. Parnas, D.L.: A technique for software module specification with examples. Comm. ACM 15, 330–336 (1972)

    Google Scholar 

  10. Scott, D., Strachey, C.: Toward a mathematical semantics for computer languages. Proc. Symp. Comp. Autom. In: MRI Symp. Ser., Vol.21. Brooklyn, N.Y.: Polytechnic Institute 1972

    Google Scholar 

  11. Wagner, E.G.: Bounded action machines: Toward an abstract theory of computer structure. J. Comp. System Sci. 2, 13–75 (1968)

    Google Scholar 

  12. Wegner, P.: Data structure models for programming languages. SIGPLAN Notices 6, (1971)

Download references

Author information

Authors and Affiliations

  1. Abteilung Informatik der Universität Dortmund, Postfach 500500, D-4600, Dortmund 50, Germany (Fed. Rep.)

    Armin B. Cremers

  2. Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, 91103, Pasadena, CA, USA

    Thomas N. Hibbard

Authors
  1. Armin B. Cremers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas N. Hibbard
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is supported in part by the Office of Naval Research under Contract No. N00014-77-C-0536 through the University of Southern California

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cremers, A.B., Hibbard, T.N. Orthogonality of information structures. Acta Informatica 9, 243–261 (1978). https://doi.org/10.1007/BF00288884

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288884

Keywords

Search

Navigation