wilson@carcoar.Stanford.EDU (Paul Wilson) (03/03/89)
The response to my request for vanilla Scheme code was less than
overwhelming. Other than the Gabriel benchmarks (translated by Will
Clinger) and the examples from Abelson and Sussman (with Sussman),
I only got one other program.
(By the way, thanks to the several people who offered to send me
the SICP & Gabriel code. I responded to everybody by mail, but some
of the mail seems to have bounced.)
There doesn't seem to be much vanilla (e.g., unextended R3RS) Scheme
code out there, so now I need to assess my options for gathering
statistics. I can port code from other Schemes, wait for more vanilla
code to become available, or stick my gc into another language processor
such as Kyoto CL or T.
Naturally, I'd rather just wait for code to pop up if it won't be too
long. Is anybody working on large programs that will be available
within the next year or so? Are there projects to produce important
pieces of code in portable Scheme, the way there are for Common Lisp
(e.g., REDUCE, OPS5)?
Does anybody have any serious programs written in something *close*
to vanilla Scheme? I might write some compatibilty macros, etc.,
and try to run some PC/Mac/Chez Scheme or T code, but I wouldn't
want to work too hard at that. (If it's too hairy, I'll just use
a different language/processor.)
Any comments or advice on this?
Thanks,
Paul
Paul R. Wilson
Human-Computer Interaction Laboratory lab ph.: (312) 413-0042
U. of Ill. at Chi. EECS Dept. (M/C 154)
Box 4348 Chicago,IL 60680 wilson@carcoar.stanford.edu
Paul R. Wilson
Human-Computer Interaction Laboratory lab ph.: (312) 413-0042
U. of Ill. at Chi. EECS Dept. (M/C 154)
Box 4348 Chicago,IL 60680 wilson@carcoar.stanford.eduoz@yunexus.UUCP (Ozan Yigit) (03/03/89)
In article <7336@polya.Stanford.EDU> wilson@carcoar.Stanford.EDU writes: >... Other than the Gabriel benchmarks (translated by Will >Clinger) and the examples from Abelson and Sussman (with Sussman), >I only got one other program. > Would "scoops" fit your bill ?? It looks fairly clean (R3RS) and would probably give your gc a good run. Would be ftp-available from various places I am sure, or somebody can mail it to you. happy scheming.. oz -- ... and I say to them, Usenet: oz@nexus.yorku.ca `Where the hell were you ......!uunet!utai!yunexus!oz when the page was blank?' Bitnet: oz@[yulibra|yuyetti] Harlan Ellison Phonet: +1 416 736-5257x3976
jouvelot@mit-vax.LCS.MIT.EDU (Pierre Jouvelot) (03/03/89)
In article <7336@polya.Stanford.EDU> wilson@carcoar.Stanford.EDU (Paul Wilson) writes: >Does anybody have any serious programs written in something *close* >to vanilla Scheme? I might write some compatibilty macros, etc., >and try to run some PC/Mac/Chez Scheme or T code, but I wouldn't >want to work too hard at that. (If it's too hairy, I'll just use >a different language/processor.) You might want to have a look to the FX-87 Interpreter, which implements the FX-87 programming language designed by the Programming Systems Research Group at MIT. It is mostly written in Scheme (> 95%) with some additional support written in CommonLISP (mainly for packages and hashtables); it runs on top of Jonathan Rees's Pseudoscheme that macroexpands/compiles R3RS Scheme to CommonLISP. We made prototype portings to T and C-Scheme without major problems but we don't make them publicly available (too tentative). The FX-87 Interpreter is available by anonymous ftp (pub/fx/impl) on brokaw.lcs.mit.edu. Hope this helps, Pierre -- Pierre Jouvelot . CAI, Ecole des Mines de Paris, France (JOUVELOT@FREMP11.bitnet) . PSRG, LCS, MIT, Cambridge (JOUVELOT@BROKAW.LCS.MIT.EDU)
mkatz@SESAME.STANFORD.EDU (Morris Katz) (03/16/89)
I have a billiard ball simulator which is written in vanilla scheme plus a set of very simple macros which are used to create an object based abstraction for billiard balls and walls. These macros shoulb be convertable to functions in less than 1 hours work. Would you like me to mail you a copy of this code? Morry Katz katz@polya.stanford.edu