Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!umich!samsung!think!yale!mintaka!bloom-beacon!ZURICH.AI.MIT.EDU!jar
From: jar@ZURICH.AI.MIT.EDU (Jonathan Rees)
Newsgroups: comp.lang.scheme
Subject: Scheme in Common Lisp
Message-ID: <9005031819.AA21130@zurich.ai.mit.edu>
Date: 3 May 90 18:19:01 GMT
References: <7650@uswat.UUCP>
Sender: daemon@athena.mit.edu (Mr Background)
Organization: The Internet
Lines: 11

There's something called "Pseudoscheme" available by anonymous ftp
from zurich.ai.mit.edu, file pub/pseudo/pseudo-2-7.tar (compressed:
pseudo-2-7.tar.Z).  It's not really Scheme because it doesn't handle
tail recursion except where lexically obvious (i.e. loops written
using LETREC, named LET, or internal DEFINE), and it doesn't handle
continuations in general because CALL-WITH-CURRENT-CONTINUATION is
defined in the obvious way in terms of Common Lisp's BLOCK and
RETURN-FROM.  Its advantage relative to something more faithful is
that it compiles Scheme to idiomatic Common Lisp, which means that
there is no performance hit relative to CL, and you get to use
whatever debugging support the underlying CL gives you.