From ... Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!uio.no!nntp.uio.no!ifi.uio.no!not-for-mail From: Erik Naggum Newsgroups: comp.lang.lisp Subject: Re: Guide to Lisp, v1.20 Date: 03 Sep 2002 17:04:16 +0000 Organization: Naggum Software, Oslo, Norway Lines: 21 Message-ID: <3240061456940076@naggum.no> References: <3D6BD801.CA2845F7@cs.uni-bonn.de> <3D6CD2ED.623EB2F9@cs.uni-bonn.de> <87lm6qaoih.fsf@cinifa.internal> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-Trace: maud.ifi.uio.no 1031072658 21035 129.240.64.16 (3 Sep 2002 17:04:18 GMT) X-Complaints-To: abuse@ifi.uio.no NNTP-Posting-Date: 3 Sep 2002 17:04:18 GMT Mail-Copies-To: never User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 Xref: archiver1.google.com comp.lang.lisp:39530 * Wolfhard Buß | Allen calls "these representation-dependent coding tricks" dangerous. Does he have any alternatives in mind? Common Lisp has made a trade-off in this regard where the general mechanisms depend on run-time type information to make their decisions and compilers generally do not rewrite calls based on available type information. This is in sharp distinction to statically typed languages, where syntactically identical access mechanisms may be used independent of the types, but with only abstractly similar semantics. Some Scheme courses I have seen construct an abstraction barrier between the lower-level access functions and the abstract names for their accessors. This may have its merits, but I found it needlessly verbose and error-prone. Common Lisp offers defstruct with a `:type´ argument that may be used to construct lists with accessors. Is that something Allen would prefer? -- Erik Naggum, Oslo, Norway Act from reason, and failure makes you rethink and study harder. Act from faith, and failure makes you blame someone and push harder.