From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ca0b11ae1c9a00cb
X-Google-Attributes: gid103376,public
From: furlos@alumni.rpi.edu (Steve Furlong)
Subject: Ada's complexity
Date: 1998/02/19
Message-ID: <6cgk8s$2on2@alumni.rpi.edu>#1/1
X-Deja-AN: 326500066
References: <34E7B551.115C289F@cs.utexas.edu> <dewar.887670974@merv>
 <34E91572.CE9CEED2@cs.utexas.edu> <dewar.887723305@merv>
Organization: Rensselaer Polytechnic Institute, Troy, NY
Newsgroups: comp.lang.ada
Date: 1998-02-19T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <dewar.887723305@merv>, Robert Dewar <dewar@merv.cs.nyu.edu> wrote:
>As for richness leading to complexity, that's misleading. For example, the
>exception facility of Ada definitelty makes the language more complex from
>the point of view of bothg implementation and definition, but it makes
>*using* Ada to solve a problem that requires exception handling simpler,
                      ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
>and it is this kind of sinmplicitly that is most important to programmers.

Which would be, what, all programs?


Ta,
Steve Furlong