home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!spool.mu.edu!agate!ucbvax!ROO.FIT.EDU!SAHARBAUGH
- From: SAHARBAUGH@ROO.FIT.EDU
- Newsgroups: comp.lang.ada
- Subject: An Ada Program Does What It Says?
- Message-ID: <9301031530.AA17787@ajpo.sei.cmu.edu>
- Date: 3 Jan 93 14:15:00 GMT
- Sender: daemon@ucbvax.BERKELEY.EDU
- Distribution: world
- Organization: The Internet
- Lines: 42
-
- First lets review:
-
- Pascal wrote, in part: "An Ada program does what it says."
-
- I raised a warning that this is not true and cited one example
- from Bryan & Mendal's book.
-
- Alex Blakemore pointed out that a program with concurrency
- cannot be counted on to execute in a certain order (or words to
- that effect).
-
- Mike Feldman said that I choose a weak example from the book
- to make my point.
-
- That brings us up to date.
-
- I searched B&M's book and noted each example program whose
- output is "indeterminate" or "implementation dependent". I
- noted the page number on which the answer appears.
-
- volume 1: 26 80 111 115 118 119 121 122 125 128 242 257
- 270 275 335 340 volume 2: 32 37 47 78 81 104 106 107 151
- 152 178 183 238 240 246 274 276 291 293 308 309
-
- I suggest vol 1 pg 335 for first reading. It is language
- lawyer level.
-
- My warning stands. Ada code looks deceptively readable. The
- reader must understand the language translator and the
- runtime environment to be able to correctly read an Ada
- program.
-
- I recall that the ARTEWG produced an "Ada catalog of runtime
- dependencies". I suggest contacting Mike Kamrad for a copy.
-
- I am really into an area addressed by people looking at
- "portable" "reusable" Ada code. Perhaps they have developed
- proven techniques for developing translator and runtime
- environment independent Ada code.
-
- sam harbaugh
- ---
-