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,fc2ae9f2fffd8bdc
X-Google-Attributes: gid103376,public
From: Ted Dennison <dennison@escmail.orl.lmco.com>
Subject: Re: Efffect of Language Level of Effort -- Feb 4, 1997 -- TCACMSIGAda
Date: 1997/01/17
Message-ID: <32DFC1E9.167EB0E7@escmail.orl.lmco.com>#1/1
X-Deja-AN: 210489877
references: <stachour.853472904@winternet.com>
content-type: text/plain; charset=us-ascii
organization: Lockheed Martin Information Systems
mime-version: 1.0
newsgroups: comp.lang.ada
x-mailer: Mozilla 3.0 (X11; I; SunOS 4.1.3_U1 sun4m)
Date: 1997-01-17T00:00:00+00:00
List-Id: <comp.lang.ada>


Paul D. Stachour wrote:
> 
> Tucker Taft, of Intermetrics, has written a paper showing why Ada
> programs can be compiled to more efficient code than C programs.
> The specifics are different, but the reasoning (what is visable to
> the compiler, and how the compiler can take advatage of it) is the
> same as that for the assembler versus systems-implementation languages.

Is this paper available on the net anywhere? It sure would be a useful
reference when this issue comes up again here. (And you all know it
will).

-- 
T.E.D.          
             |  Work - mailto:dennison@escmail.orl.lmco.com  |
             |  Home - mailto:dennison@iag.net               |
             |  URL  - http://www.iag.net/~dennison          |