Tail Recursion Optimisation in Franz Lisp

Article View: net.lang.lisp

Article #664

#664

From: Russell A. Ritchie
Date: Thu, 24 Jul 1986 09:36

34 lines
1658 bytes



Hello world,

We have Franz Lisp version 38.79, as distributed with Berkeley 4.2 UNIX.

I got sick of seeing the message 'foobar is Tail Recursive: etc'
and wrote a 'tail recursion optimiser'. It translates tail recursive
functions into simple iterative forms that don't cause NAMESTACK overflows.

Just in case anyone out there gets the wrong idea; I don't advocate iteration
over recursion but speed isn't necessarily a bad thing...

Have I reinvented the wheel?
Would anyone out there be interested in it? 

RSVP.

===============================================================================
Russell A. Ritchie 				russell@aimmi.uucp (UK)
Heriot-Watt/Strathclyde MMI Unit,		russell%aimmi.uucp@mcvax 
George House,					russell!<041-552-1576>
36, North Hanover Street,
Glasgow,
Scotland.					

"...while it is important to avoid familiarity with the participants, 
    some intercourse will usually be necessary."

	Rule 5 - 'Interface Experimentation Manual', 
	Skank & Toadsworth, London 1984.

===============================================================================

Technical Details

Message-ID: <778@aimmi.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!mcvax!ukc!cstvax!hwcs!aimmi!russell

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!mcvax!ukc!cstvax!hwcs!aimmi!russell
From: russell@aimmi.UUCP (Russell A. Ritchie)
Newsgroups: net.lang.lisp
Subject: Tail Recursion Optimisation in Franz Lisp
Message-ID: <778@aimmi.UUCP>
Date: Thu, 24-Jul-86 05:36:00 EDT
Article-I.D.: aimmi.778
Posted: Thu Jul 24 05:36:00 1986
Date-Received: Fri, 25-Jul-86 21:56:53 EDT
Reply-To: russell@aimmi.UUCP (Russell A. Ritchie)
Organization: Heriot-Watt/Strathclyde Alvey MMI Unit, Scotland
Lines: 34