Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: $Revision: 1.6.2.13 $; site iuvax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxj!ihnp4!inuxc!iuvax!brennan
From: brennan@iuvax.UUCP
Newsgroups: net.ai
Subject: Re: Compiled versus interpreted LISP
Message-ID: <3600010@iuvax.UUCP>
Date: Thu, 25-Oct-84 18:13:00 EDT
Article-I.D.: iuvax.3600010
Posted: Thu Oct 25 18:13:00 1984
Date-Received: Fri, 26-Oct-84 09:43:13 EDT
References: <63@water.UUCP>
Lines: 11
Nf-ID: #R:water:-6300:iuvax:3600010:000:332
Nf-From: iuvax!brennan    Oct 25 17:13:00 1984


For the fibonacci example, and others, the speed up depends greatly
on whether the compiler in question compiles tail-recursion properly.

This also makes a big difference in C code, and can really throw off
benchmarks.

JD Brennan
...!ihnp4!inuxc!iuvax!brennan	(USENET)
Brennan@Indiana			(CSNET)
Brennan.Indiana@CSnet-Relay	(ARPA)