jar@altdorf.ai.mit.EDU (Jonathan A Rees) (03/20/91)
Archive-name: languages/scheme/pseudoscheme/1991-03-19 Archive: altdorf.ai.mit.edu:/archive/pseudo/pseudo-2-7.tar.Z [18.43.0.246] Original-posting-by: jar@altdorf.ai.mit.EDU (Jonathan A Rees) Original-subject: Pseudoscheme Reposted-by: emv@msen.com (Edward Vielmetti, MSEN) Date: 15 Mar 91 21:26:06 GMT From: Jason Kahana <kahana@aristotle.ils.nwu.edu> I currently have Macintosh Allegro Common Lisp. I would like to use pseudoscheme to program in Scheme under the excellent MACL environment. Can anyone point me in the right direction on how to do this?? From altdorf.ai.mit.edu: pub/archive/scheme/scheme-impls.txt: Implementation: Pseudoscheme (Scheme embedded in Common Lisp) Implemented by: Jonathan Rees Support: Unsupported, although I'll probably continue to improve it. Hardware, etc.: Will run in any implementation of Common Lisp. Availability: Free. Distributed as source via anonymous FTP from altdorf.ai.mit.edu: archive/pseudo/pseudo-2-7.tar.Z. Dialect: Subset. Tail-recursion is not supported except in the special case that a loop is found statically, which is when the loop is written explicitly using LETREC or something that expands into LETREC (DO, named LET, internal DEFINE). Tail-recursion will of course be inherited from the host Common Lisp if it has it. All of the essential features of R^3 Scheme exist, except for a correct CALL-WITH-CURRENT-CONTINUATION (some of you will say that it's not Scheme at all, and I don't disagree) and number exactness; most of the non-essential features are there too. Intended use: Running most Scheme programs using any Common Lisp. Implementation: A preprocessor translates Scheme code into Common Lisp code, which is then interpreted or compiled by the host Common Lisp system. Remarks: I did this mostly for my own personal use. Maybe other people will find it useful too. Contact: Jonathan Rees (jar@altdorf.ai.mit.edu), MIT Artificial Intelligence Laboratory, 545 Technology Square, Cambridge MA 02139.