NexJ Scheme is an open source project providing an efficient and powerful interpreter for the programming language Scheme that executes in a Java virtual machine. Today I was sort of shocked to learn that there is another implementation besides SISC and Kawa that runs on Java! There wasn’t even an announcement for NexJ on comp.lang.scheme [...]
Wednesday, January 18, 2012
Zombie-like, 6.001 rises from the dead to threaten students again. Unlike a zombie, though, it’s moving quite a bit faster than it did the first time. Like the original, don’t walk into the class expecting that it will teach you Scheme; instead, it attempts to teach thought patterns for computer science, and the structure and [...]
Saturday, December 17, 2011
Meng Zhang set up project files for building Chibi for OS X and an iOS REPL here. With virtually no iOS knowledge I just checked it out, built it, and ran it on the simulator in a couple of minutes. Thank you Alex and Meng! (via chibi-scheme)
Saturday, December 10, 2011
Here is the link; the source has a lot more. (via comp.lang.scheme)
Friday, November 25, 2011
Sagittarius Scheme System is a “mostly R6RS Scheme system”. (via scheme-reports)
Wednesday, November 9, 2011
Whalesong is a compiler from Racket to JavaScript; it takes Racket programs and translates them so that they can run stand-alone on a user’s web browser. It should allow Racket programs to run with (hopefully!) little modification, and provide access through the foreign-function interface to native JavaScript APIs. The included runtime library supports the numeric [...]
This post in comp.lang.scheme brings up a question that inevitably everyone asks. Suppose the answer is obvious but John summed it up well: Well, if you interpret (apply + some-list) and (apply * some-other-list) as left-folds, then a starting point is needed, something to begin accumulating from. The identity is the only value that works [...]
This thread discusses the pros and cons of using the CA*D*R functions vs named first, second, third, list-tail, … and so on vs pattern matching for the same task. I thought that pattern-matching was the best way to do it; and now I’m curious about why CA*D*R is better.
The following all intend to support R7RS small: * Per Bothner (Kawa) * Will Clinger (Larceny) * Shiro Kawai (Gauche) * Manuel Serrano (Bigloo) – “not sure about libraries” * Alex Shinn (Chibi) – “already fully implemented, but lacking tests” * Felix Winkelmann (Chicken) The following were less committal, but open, and their implementations are [...]