Affiliation:
1. Bell Telephone Mfg. Cy., Francis Wellesplein 1, B-2000 Antwerpen (Belgium)
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference14 articles.
1. Can programming be liberated from the von Neumann style?
2. On orthogonality in programming languages
3. /DIJK76/ Dijkstra E. W. A discipline of programming. Prentice-Hall Inc. Englewood Cliffs New Jersey (1976) /DIJK76/ Dijkstra E. W. A discipline of programming. Prentice-Hall Inc. Englewood Cliffs New Jersey (1976)
4. On the problem of uniform references to data structures
5. /HILF79/ Hilfinger P. Discriminant constraints in ADA. CMU Report (11 June 1979) Carnegie-Mellon University. /HILF79/ Hilfinger P. Discriminant constraints in ADA. CMU Report (11 June 1979) Carnegie-Mellon University.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A note on enumerations;ACM SIGPLAN Notices;1982-12
2. Another look at enumerated types;ACM SIGPLAN Notices;1982-07
3. Enumerations in Pascal, ADA, and beyond;ACM SIGPLAN Notices;1981-02