Simplifying ADA by removing limitations

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.