Communications of the ACM
The treatment of data types in EL1
Communications of the ACM
Protection in programming languages
Communications of the ACM
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Discipline of Programming
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
On the problem of uniform references to data structures
Proceedings of the international conference on Reliable software
MATHEMATICAL LOGIC FOR COMPUTER SCIENTISTS
MATHEMATICAL LOGIC FOR COMPUTER SCIENTISTS
On orthogonality in programming languages
ACM SIGPLAN Notices
Preliminary Ada reference manual
ACM SIGPLAN Notices - Preliminary Ada reference manual
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
Report on the programming language Euclid
ACM SIGPLAN Notices
Ada packages and distributed systems
ACM SIGPLAN Notices
Enumerations in Pascal, ADA, and beyond
ACM SIGPLAN Notices
ACM SIGPLAN Notices
Another look at enumerated types
ACM SIGPLAN Notices
| Hi-index | 0.00 |
As presently proposed, ADA contains several rather arbitrary restrictions making the language unnecessarily complex, lacking in orthogonality and difficult to extend. This note illustrates how the elimination of such restrictions yields a simpler yet more powerful language. Particular topics are the following. A more flexible and natural interpretation of type equivalence removes the stringent limitations of the ADA name equivalence approach. Providing a uniform view on types, subprograms and modules solves most parameterization problems and dispenses with the need for a "generic" construct. Finally, a more complete specification for subprograms (and modules) removes some difficulties with side-effects and exception handling.