Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!munnari.oz.au!goanna!ok
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.misc
Subject: Re: Some things that pointer-less languages can't do efficiently
Message-ID: <3975@goanna.cs.rmit.oz.au>
Date: 15 Oct 90 05:27:30 GMT
References: <26739:Oct1023:44:2690@kramden.acf.nyu.edu> <65450@lanl.gov> <10397:Oct1212:55:1090@kramden.acf.nyu.edu>
Organization: Comp Sci, RMIT, Melbourne, Australia
Lines: 10

In article <10397:Oct1212:55:1090@kramden.acf.nyu.edu>, brnstnd@kramden.acf.nyu.edu (Dan Bernstein) writes:
> Oh? I don't believe you. Show me the LISP code that flips a stack in
> bounded memory. Well?

(setq reversed-stack (nreverse original-stack))

(Since Lisp has rplaca/rplacd -- or, in Scheme, set-car!/set-cdr! -- Lisp
is a very poor example of a "pointerless: language...)
-- 
Fear most of all to be in error.	-- Kierkegaard, quoting Socrates.