Tail Recursion Optimisation in Franz Lisp

Thread View: net.lang.lisp

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Russell A. Ritchie Thu, 24 Jul 1986 09:36

#664

Author: 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.

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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads