Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site caip.RUTGERS.EDU
Path: utzoo!linus!philabs!cmcl2!harvard!seismo!caip!ross%ulowell.csnet
From: ross%ulowell.csnet@CSNET-RELAY.ARPA
Newsgroups: net.micro.amiga
Subject: Amiga Lisp.
Message-ID: <183@caip.RUTGERS.EDU>
Date: Wed, 23-Oct-85 06:09:44 EDT
Article-I.D.: caip.183
Posted: Wed Oct 23 06:09:44 1985
Date-Received: Fri, 25-Oct-85 06:57:49 EDT
Sender: daemon@caip.RUTGERS.EDU
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 41

From: Ross Miller <ross%ulowell.csnet@CSNET-RELAY.ARPA>

I've been doing some stuff with Lisp lately and I thought the the following
might be interesting.  The amiga's Lisp will compute 2**100000 in 12.7
hours of cpu time, (according to the built in Lisp timing functions).
I used a compiled version of the following code, which I am posting because
some people do not have documentation and this might be useful to them.
The answer is about 7 pages of 60 columns.  I plan on checking it with
a Symbolics when I get a chance.

(global 'high)
(setq high 100000)
(global '(outfile)) ;;; doesn't seem to matter.
(global '(screen))
(global '(cl1))
(global '(cl2))

(de temp ( i x)
	(cond ((lessp i high) (temp (add1 i) (times2 x 2)))
	      (t
		(setq screen (wrs outfile))
		(print i)
		(print x)
		(print (difference (time) cl1))
		(print (difference (gctime) cl2))
		(wrs screen)
		(close outfile)
		} ;;; super paren

(compile '(temp))
(excise)	;;; get rid of uneeded stuff in environment
(reclaim)	;;; (gc)
(setq cl1 (time))
(setq cl2 (gctime))
(rds nil)
;;; The compiler seems to be intelligent enough to sense tail recursion
;;; This file is meant to be loaded
;;; If people want more info. send mail to me.
;;; If I get enough mail I will post answers, but I hate to tie up the net.

"ross@ulowell"@csnet-relay.arpa