Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!scramble.lm.com!news.math.psu.edu!chi-news.cic.net!newspump.sol.net!uwm.edu!cs.utexas.edu!howland.erols.net!netcom.com!vrotney
From: vrotney@netcom.com (William Paul Vrotney)
Subject: Re: Common LISP: The Next Generation
In-Reply-To: futrelle@ccs.neu.edu's message of 29 Aug 1996 02:52:45 GMT
Message-ID: <vrotneyDww5I9.A5v@netcom.com>
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
References: <4vp93n$fpk@snotra.harlequin.co.uk> <840989115snz@wildcard.demon.co.uk> <4vuclk$lrcb@snotra.harlequin.co.uk> <5030lt$ed9@camelot.ccs.neu.edu>
Date: Thu, 29 Aug 1996 08:42:08 GMT
Lines: 25
Sender: vrotney@netcom22.netcom.com

In article <5030lt$ed9@camelot.ccs.neu.edu> futrelle@ccs.neu.edu (Robert Futrelle) writes:
> 
> Now that there is an enormous amount of information on the Web, we need to
> organize it and get a handle on its content (its semantics).  This means
> writing systems that do lots of symbolic computation on natural language and
> graphics.  This R&D work will take years of effort. I will also involve GUIs
> and OODBs. I can think of no better language to use for these efforts than
> Common Lisp.  My $0.1.
> 

Yes, Common Lisp or an even more improved Lisp.  But you see, it has to be
tried first in C++ and Java to prove that your statement is correct.  We
should not lament since we've understood the necessary circumstance of this
proof all along, it's called "reductio ad absurdum".

        QED in 2003!

In the mean time, unless a better idea comes along, our task as Lisp
supporters is to keep improving it quietly.



-- 

William P. Vrotney - vrotney@netcom.com
