On the criteria to be used in decomposing systems into modules
Communications of the ACM
Software Engineering, An Advanced Course, Reprint of the First Edition [February 21 - March 3, 1972]
Using the CDL Compiler-Compiler
Compiler Construction, An Advanced Course, 2nd ed.
The structure of an operating system
Language Hierarchies and Interfaces, International Summer School
Programming with abstract data types
Proceedings of the ACM SIGPLAN symposium on Very high level languages
On the problem of uniform references to data structures
Proceedings of the international conference on Reliable software
Programming-in-the large versus programming-in-the-small
Proceedings of the international conference on Reliable software
On attaining reliable software for a secure operating system
Proceedings of the international conference on Reliable software
Global variable considered harmful
ACM SIGPLAN Notices
SIMULA 67 common base language, (Norwegian Computing Center. Publication)
SIMULA 67 common base language, (Norwegian Computing Center. Publication)
Data types as values: polymorphism, type-checking, encapsulation
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Dynamic restructuring in an experimental operating system
ICSE '78 Proceedings of the 3rd international conference on Software engineering
The when, why and why not of the BETA programming language
Proceedings of the third ACM SIGPLAN conference on History of programming languages
Hi-index | 0.00 |
In this paper it is argued that there is a strong connection between the issue of abstract types and the more general issue of information hiding in large program systems, since abstraction has to be enforced by the careful and controlled hiding of details. In the first part of the paper, the notions of visibility and interface are discussed. In the second part, it is shown how, by careful control of visibility through interfaces, data abstraction can be achieved. Finally a comparison is made between this approach and the class approach.