Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!seismo!husc6!rutgers!topaz.rutgers.edu!gaynor
From: gaynor@topaz.rutgers.edu (Silver)
Newsgroups: comp.lang.lisp
Subject: Re: Importance of REPLACA, REPLACD, and the like?
Message-ID: <13278@topaz.rutgers.edu>
Date: Sun, 12-Jul-87 22:50:28 EDT
Article-I.D.: topaz.13278
Posted: Sun Jul 12 22:50:28 1987
Date-Received: Mon, 13-Jul-87 05:10:34 EDT
References: <22@citcom.UUCP>
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 12

> Is it possible to solve serious programming applications with LISP
> without using replacement operators?  To put it another way, could a
> list be implemented in any other way than as a chain of cons nodes?
> This is a novice type question, so please don't reply publicly.

Not nearly so novice as you think.  Any thoughts on alternative
structures/paradigms?

name:  Andy Gaynor (Silver)
uucp:  {ames, cbosgd, harvard, moss, seismo}!rutgers!topaz.rutgers.edu!gaynor
arpa:  gaynor@topaz.rutgers.edu
icbm:  40 34 N / 74 45 W