Check out this list of soft real-time Scheme implementations!
Author: grant
ypsilon
ypsilon is the implementation of Scheme Programming Language, which conforms to the latest standard R6RS. It achieves a remarkably short GC pause time and the best performance in parallel execution as it implements “mostly concurrent garbage collection”, which is optimized for the multi-core CPU system.
If you are wondering “Why yet another Scheme implementation” you can find the answer here. To sum it up: they require real-time processing speed and can not use Boehm Garbage Collector because they run on arcade consoles or pinball machines, so, they had to start from scratch.
Addendum: 8/2/8
Ypsilon 0.9.6 is the bug fix release. It fixes all bugs reported and found in version 0.9.5. Ypsilon 0.9.6 has passed all 8886 tests in PLT R6RS test suite revision 11016.
(via C.L.S.)
DEFUN08: ACM SIGPLAN 2008 Developer Tracks on Functional Programming
DEFUN 2008 invites functional programmers who know how to solve
problems with functional progamming to give talks and lead tutorials
at the The ICFP Developer Tracks.
We want to know about your favorite programming techniques, powerful
libraries, and engineering approaches you’ve used that the world
should know about and apply to other projects. We want to know how to
be productive using functional programming, write better code, and
avoid common pitfalls.
ICFP08 looks like a lot of fun!
(via PLT)
Updated: P-Lisp rides again!
See here
Updated: Scheme Lisp on the OLPC XO
See here
Updated: Using Scheme’s Eval in Sandbox
See here
Updated: Distributed Programming in Scheme
See here
Updated: Lisp code is not a parse tree
See here
Updated: How to print a PLT Slideshow to a file
See here
Updated: What every Subversion user must know about Git
See here