Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!mit-eddie!stever
From: stever@eddie.MIT.EDU (Stephen Robbins)
Newsgroups: comp.lang.scheme
Subject: SCHEME interpreter in Common Lisp?
Message-ID: <7516@eddie.MIT.EDU>
Date: Sat, 28-Nov-87 00:08:26 EST
Article-I.D.: eddie.7516
Posted: Sat Nov 28 00:08:26 1987
Date-Received: Mon, 30-Nov-87 01:13:46 EST
Organization: MIT EE/CS Computer Facility, Cambridge, MA
Lines: 25
Keywords: scheme common lisp tail recursion


Hi,

I'm looking for a SCHEME interpreter/compiler written in Common Lisp,
for instructional use on Symbolics LISPMs.  My main concern is that it
be properly tail-recursive.  Speed isn't much of a priority, since
I'll be using it mainly for teaching.

What I've done in the interim is to write a Common Lisp function
which uses a giant TAGBODY and follows the interpreter given in
Structure and Interpretation of Computer Programs.  Thanks to the
TAGBODY, I can get tail recursion by using (GO).  But this requires
implementing an interpreter, rather than having a way to compile
SCHEME to Common Lisp.

Does anyone have an implementation that might help me?

- Stephen

P.S.  If anyone is interested in a copy of my little hack, I'll be
glad to pass it along.  I'm probably going to continue expanding it in
my spare time...
-- 
We live in a society that has replaced wisdom with knowledge, and
is trying to replace knowledge with information.  My goal is wisdom.