Advertisement

Shared Classes

  • Per Brinch Hansen
Chapter

Abstract

The author discusses the close relationship between data and operations and suggests that a compiler should be able to check that data structures are accessed by meaningful procedures only. This idea leads to the introduction of shared classes—a programming notation for the monitor concept. The notation is illustrated by a message buffer for concurrent processes.

Keywords

Type Definition Address Mapping Primitive Type Share Classis Programming Notation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dahl, O.-J., Myhrhaug, B., and Nygaard, K. 1968. Simula 67—common base language. Norsk Regnesentral, Oslo, Norway, (May).Google Scholar
  2. Dahl, O.-J., and Hoare, C.A.R. 1972. Hierarchical program structures. In Structured Programming, O.-J. Dahl, E.W. Dijkstra, and C.A.R. Hoare, Eds., Academic Press, New York, 175–220.Google Scholar
  3. McKeag, R.M. 1971. Burroughs B5500 master control program. In Studies in Operating Systems, R.M. McKeag and R. Wilson, Academic Press, New York, (1976), 1–66.Google Scholar
  4. Naur, P. 1963. The design of the GIER Algol compiler. BIT 3, 2–3, 124–140 and 145–166.zbMATHCrossRefGoogle Scholar
  5. Simon, H.A. 1962. The architecture of complexity. Proceedings of the American Philosophical Society106, 6, 468–482.Google Scholar
  6. Wirth, N. 1971. The programming language Pascal. Acta Informatica1, 1, 35–63.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1973

Authors and Affiliations

  • Per Brinch Hansen

There are no affiliations available

Personalised recommendations