Newsgroups: comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!howland.reston.ans.net!news.sprintlink.net!noc.netcom.net!netcom.com!NewsWatcher!user
From: hbaker@netcom.com (Henry Baker)
Subject: Re: Mixing languages
Message-ID: <hbaker-1105951244190001@192.0.2.1>
Sender: hbaker@netcom16.netcom.com
Organization: nil
References: <3onfoa$nb6@nyheter.chalmers.se> <sjfz1Cy00bkM1YSeNs@andrew.cmu.edu> <D8DG4o.Dy1@ida.liu.se> <3otdnh$rsi@camelot.ccs.neu.edu>
Date: Thu, 11 May 1995 19:43:08 GMT
Lines: 17

In article <3otdnh$rsi@camelot.ccs.neu.edu>, will@ccs.neu.edu (William D
Clinger) wrote:

>     The stack-based machine must shuffle the stack to pass arguments
>     tail-recursively.

Actually, depending upon what you mean by 'stack-based machine', this isn't
always true.  In particular, on a permutation stack machine in which accesses
to elements not at the top of the stack are achieved by permuting the stack
(e.g., Postscript/Forth 'roll' operations), you get tail-recursion 'for
free'.

See ftp://ftp.netcom.com/pub/hb/hbaker/ForthStack.html (also .ps.Z).

-- 
www/ftp directory:
ftp://ftp.netcom.com/pub/hb/hbaker/home.html
