wa@raven.cad.mcc.com (Wayne Allen) (07/03/90)
I am interested in any work concerning the translation of Common Lisp
to Scheme. I am particularly concerned with actual text translation,
although I realize that practical translation also requires the use of
"compatability" packages.
Any references to papers or working systems would be greatly appreciated.
I will post a summary of direct email replies.
Thanks
_
W | Wayne Allen, wa@mcc.com uunet!cs.utexas.edu!milano!cadillac!wa
| MCC/CAD, 3500 West Balcones Center Dr, Austin, Tx 78759 (512)338-3754maner@bgsuvax.UUCP (Walter Maner) (07/03/90)
From article <WA.90Jul2124002@raven.cad.mcc.com>, by wa@raven.cad.mcc.com (Wayne Allen): > > I am interested in any work concerning the translation of Common Lisp > to Scheme. I am particularly concerned with actual text translation, > although I realize that practical translation also requires the use of > "compatability" packages. > > Any references to papers or working systems would be greatly appreciated. > I will post a summary of direct email replies. > Perhaps these prior postings will help. WALT InterNet maner@andy.bgsu.edu (129.1.1.2) | BGSU, Comp Science Dept UUCP ... ! osu-cis ! bgsuvax ! maner | Bowling Green, OH 43403 BITNet MANER@BGSUOPIE | 419/372-2337 Secretary Relays @relay.cs.net, @nsfnet-relay.ac.uk | FAX is available - call ----- Path: bgsuvax!tut.cis.ohio-state.edu!gem.mps.ohio-state.edu!apple!cambridge.apple.com!alms From: alms@cambridge.apple.com (Andrew L. M. Shalit) Newsgroups: comp.lang.scheme Subject: Re: Scheme to Commonlisp Message-ID: <ALMS.89Nov10125832@brazil.cambridge.apple.com> Date: 10 Nov 89 17:58:32 GMT References: <8911080749.aa12548@mintaka.lcs.mit.edu> <1563@accuvax.nwu.edu> Sender: news@cambridge.apple.com Organization: Apple Computer Inc, Cambridge, MA Lines: 13 In-reply-to: krulwich@ils.nwu.edu's message of 10 Nov 89 16:13:18 GMT In article <8911080749.aa12548@mintaka.lcs.mit.edu>, S.Ross@CS (Simon Ross) writes: >Does anyone have any advice or experience with converting a >program in Scheme to CommonLisp (in this case Texas Instruments >Scheme and Vax Commonlisp)? If there is some nifty program out >there that could do the job? You may want to look at Pseudoscheme by Jonathon Reese. It compiles Scheme to Common Lisp, with the exception of upward continuations. Unfortunately, I don't have an FTP address. -andrew ----- Path: bgsuvax!tut.cis.ohio-state.edu!bloom-beacon!ZURICH.AI.MIT.EDU!jar From: jar@ZURICH.AI.MIT.EDU (Jonathan Rees) Newsgroups: comp.lang.scheme Subject: Scheme to Commonlisp Message-ID: <8911131932.AA26435@zurich.ai.mit.edu> Date: 13 Nov 89 19:32:23 GMT References: <8911080749.aa12548@mintaka.lcs.mit.edu> Sender: daemon@bloom-beacon.MIT.EDU Organization: The Internet Lines: 21 Date: Wed, 08 Nov 89 12:38:51 +0000 From: Simon Ross <S.Ross@cs.ucl.ac.uk> Does anyone have any advice or experience with converting a program in Scheme to CommonLisp (in this case Texas Instruments Scheme and Vax Commonlisp)? If there is some nifty program out there that could do the job? An old version of Pseudoscheme comes with the official VAX LISP distribution from DEC; see the LISP$EXAMPLES directory. It lets you run Scheme code in Common Lisp, but doesn't include a file translator. You can get a newer version of Pseudoscheme that does include a file translator by anonymous ftp from zurich.ai.mit.edu:/pub/pseudo/pseudo-2-7.tar. Documentation is in file README. Upward continuations and true tail recursion aren't supported, but it does turn appropriately written Scheme loops into Common Lisp PROG forms. If you want true tail recursion or upward continuations, your task is much more difficult. ----- Path: bgsuvax!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!math.lsa.umich.edu!emv From: jar@ZURICH.AI.MIT.EDU (Jonathan Rees) Newsgroups: comp.archives Subject: [scheme] Scheme in Common Lisp Message-ID: <11952@stag.math.lsa.umich.edu> Date: 8 May 90 15:57:07 GMT Sender: news@math.lsa.umich.edu Reply-To: jar@ZURICH.AI.MIT.EDU (Jonathan Rees) Followup-To: comp.lang.scheme Lines: 19 Approved: emv@math.lsa.umich.edu (Edward Vielmetti) X-Original-Newsgroups: comp.lang.scheme Archive-name: pseudoscheme/03-May-90 Original-posting-by: jar@ZURICH.AI.MIT.EDU (Jonathan Rees) Original-subject: Scheme in Common Lisp Archive-site: zurich.ai.mit.edu [18.26.0.176] Archive-directory: pub/pseudo Archive-files: pseudo-2-7.tar.Z Reposted-by: emv@math.lsa.umich.edu (Edward Vielmetti) 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. ----- -- InterNet maner@andy.bgsu.edu (129.1.1.2) | BGSU, Comp Science Dept UUCP ... ! osu-cis ! bgsuvax ! maner | Bowling Green, OH 43403 BITNet MANER@BGSUOPIE | 419/372-2337 Secretary Relays @relay.cs.net, @nsfnet-relay.ac.uk | FAX is available - call