From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-0.5 required=3.0 tests=BAYES_05 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 3 Jan 93 15:28:31 GMT
From: asuvax!ennews!telesys!weyrich!orville@gatech.edu  (Orville R. Weyrich)
Subject: Re: Ada Readability, Book Reference
Message-ID: <1993Jan3.152831.16732@weyrich.UUCP>
List-Id: <comp.lang.ada>

In article <9212281507.AA20416@ajpo.sei.cmu.edu> SAHARBAUGH@ROO.FIT.EDU writes:
>
>So I ask "Is Ada readable if you can express an indeterminate
>program using it?".
>
>sam harbaugh
>---

I am not sure whether there is a relationship between indeterminancy and
readability.

Suppose, for example, the indeterminancy arises because of a concession made
to the implementors by way of not completely defining the effect of certain
language constructs [i.e. "implementation-defined"]. Suppose then I were to
arbitrarily define these aspects [very arbitrarily -- I'm being a devil's
advocate here] to depend on the number of comments in the compilation unit.

I have eliminated the indeterminancy, but certainly have not enhanced the
readability.

Or suppose, for another example, the indeterminancy arises because of a 
race condition that is outside the scope of control of the compiler and
run-time system. The indeterminancy could perhaps be resolved by introducing
semophores or some similar construct, but that would further complicate the
program text.

In my opinion, one of the best measure of readability is how well 
the semantics of a fragment of code can be determined in isolation from 
the context of the entire program. Another measure of readability is what
I might call "stability" -- minor changes in the code should result in
minor changes in semantics, not major changes. In other words, if a
reader has a small misunderstanding of what he/she read, and that leads
to a small misunderstanding of what the code does, the code is stable.

Happy new year to all.


orville

--------------------------------------           ******************************
Orville R. Weyrich, Jr.                           Weyrich Computer Consulting
Certified Data Processor                         POB 5782, Scottsdale, AZ 85261
Certified Systems Professional                        Voice: (602) 391-0821
Internet: orville%weyrich@uunet.uu.net                Fax:   (602) 661-0660
--------------------------------------           ******************************