The paper tries to identify the essential characteristics of object-oriented programming, and then asks which features, beyond new terminology, will justify a programming language being called ‘object-oriented’. Using these criteria, the ‘object-orientedness’ of MODULA-2 is investigated. Concluding that the language allows, but does not support, this style of programming, minimal additions that would be necessary to satisfy the characteristics of objectorientation are considered.

This paper describes a local‐area network, its hardware and software structure, and its protocol. The principal objective was to minimize the complexity of hardware and software, yet to offer an adequate functionality and performance for a system of up to 30 workstations with local file stores. The primary benefit of the achieved simple structure and low‐overhead protocol is the system's reliability.

The programming language Oberon is the result of a concentrated effort to increase the power of Modula‐2 and simultaneously to reduce its complexity. Several features were eliminated, and a few were added in order to increase the expressive power and flexibility of the language. This paper describes and motivates the changes. The language is defined in a concise report1.

From the Publisher:This book presents the data structures and algorithms that underpin much of today's computer programming. The basis of this book is the material contained in the first six chapters of our earlier work, The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for external storage and memory management. As a consequence, this book should be suitable as a text for a first course on data structures and algorithms. The only prerequisite we assume is familiarity with some high-level programming language such as Pascal.