Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!apple!snorkelwacker.mit.edu!bloom-beacon!UKULELE.REASONING.COM!gyro
From: gyro@UKULELE.REASONING.COM (Scott Layson Burson)
Newsgroups: comp.lang.scheme
Subject: A Scheme -> CL conversion question.
Message-ID: <9011132032.AA00467@ukulele.reasoning.com.>
Date: 13 Nov 90 20:32:27 GMT
Sender: daemon@athena.mit.edu (Mr Background)
Reply-To: Gyro@reasoning.com
Organization: The Internet
Lines: 27


   Date: 11 Nov 90 18:16:55 GMT
   From: Michael Pak <BOOJUM.HUJI.AC.IL!misha@ucbvax.berkeley.edu>

       How do you write the following Scheme code in Common Lisp:

   (define (foo func)
    (lambda (bar) (func (func (func bar))))))

   ((((foo foo) foo) 1+) 0)     ;See the spoiler at the end to see what does
				;  this cute little thing return...

Thus:

   (defun foo (func)
     #'(lambda (bar) (funcall func (funcall func (funcall func bar)))))

   (funcall (funcall (funcall (foo #'foo) #'foo) #'1+) 0)


   It returns 3^27.

I let it run for a few minutes and it only got to ~67e6.  That suggests it
would take a couple of decades to complete.  Is that consistent with what you
know?

-- Scott