Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site umd5.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!seismo!lll-crg!gymble!umcp-cs!cvl!umd5!zben
From: zben@umd5.UUCP
Newsgroups: net.lang.c
Subject: Re: Lisp to C conversion
Message-ID: <818@umd5.UUCP>
Date: Mon, 16-Dec-85 11:48:13 EST
Article-I.D.: umd5.818
Posted: Mon Dec 16 11:48:13 1985
Date-Received: Thu, 19-Dec-85 05:47:28 EST
References: <391@bcsaic.UUCP> <10200028@ada-uts.UUCP> <628@ttrdc.UUCP>
Reply-To: zben@umd5.UUCP (Ben Cranston)
Organization: U of Md, CSC, College Park, Md
Lines: 19
Summary: If you were using Cobol it could...

In article <628@ttrdc.UUCP> levy@ttrdc.UUCP (Daniel R. Levy) writes:
>In article <10200028@ada-uts.UUCP>, richw@ada-uts.UUCP writes:
>>That is, you tell the compiler to optimize your pi-calculating program
>>and it spews out "3.14159..."
>That would be a marvel of "artificial intelligence" -- an optimizer that
>can recognize algorithms.  Imagine--it would replace your bubble sorts
>with Shell sorts (or better) ...

If you were writing in Cobol, you would just say "sort", and the compiler
would probably automagically include in a 90K word (thats 360K byte) vendor-
supplied polyphase sort merge that automagically goes to N magnetic tape
drives when the number of records goes above 10 million.... :-)

Don't laugh - my dinosaur actually does this.  Now if it only had a 
C compiler... (sigh)
-- 
"We're taught to cherish what we have   |          Ben Cranston
 by what we have no longer..."          |          zben@umd2.umd.edu
                          ...{seismo!umcp-cs,ihnp4!rlgvax}!cvl!umd5!zben