Sherman is a Rebol to Scheme compiler.
(via jrm)
“Really immutable pairs” was a thread in comp.lang.scheme from last year. It is worth a read for anyone interested in language design issues, and where Scheme may or may not be headed (who knows?).
A friend of mine once mentioned “Oleg’s prolific Scheme code” but didn’t go any deeper than that.
Today I think I found that code here.
It is not limited to Scheme, but for Scheme content alone there seems to be a ton of (per my friend) high quality code there.
I can’t wait to start digging.
Contrast Larry Wall‘s take on the “soon to be released” Perl 6 today [in 2008]:
Don’t design everything you will need in the next 100 years, but design the ability to create things we will need in 20 or 100 years. The heart of the Perl 6 effort is the extensibility we have built into the parser and introduced language changes as non-destructively as possible.
(via Computerworld)
with that of [R3RS] Scheme in 1986:
Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary.
(via R3RS, referenced in R5RS)
In other words, language implementers ought to accept that they aren’t going to “get it right” on the first try, and they should leave the language extensible for additions.
Are you as excited about Perl 6 as I am! 🙂
During the 1950s and 1960s there was a flourishing of interest in special-purpose computer languages. SNOBOL [String Oriented Symbolic Language] was one of a number of text-string-oriented languages…
SNOBOL was widely used in the 1970s and 1980s as a text manipulation language in the humanities, but in recent years, its popularity has faded as newer languages such as Awk and Perl have made string manipulation by means of regular expressions popular. However, the pattern matching capabilities of SNOBOL are significantly more powerful than those of regular expressions.
(via Wikipedia)
SPITBOL (Speedy Implementation of SNOBOL) is a compiled implementation of the SNOBOL4 language…
One contribution of SPITBOL to computer science was to demonstrate the clear distinction between a language and its implementation. Rather than stating that a language itself is slow, it is more accurate to say that the ability to write a fast and elegant implementation is a rare gift.
(via Wikipedia)
Scwm is the Scheme Constraints/Configurable Window Manager. It is a window manager with a powerful dynamic configuration language based on Guile Scheme. Scwm has many, many advanced features, often implemented in the configuration language itself.
This might be the first Scheme running on the iPhone!
(via comp.lang.scheme)
This thread on comp.lang.scheme discusses the application of call/cc, in particular this example which can be pretty difficult to understand.
IrRegex version 0.7.0 is now available here:
A fully portable and efficient R[456]RS implementation of regular expressions, supporting both POSIX syntax with various (irregular) PCRE extensions, as well as SCSH’s SRE syntax, with various aliases for commonly used patterns. DFA matching is used when possible, otherwise a closure-compiled NFA approach is used. The library makes no assumptions about the encoding of strings or range of characters and can thus be used in Unicode-aware Scheme implementations. Matching may be performed over standard Scheme strings, or over arbitrarily chunked streams of strings.
IrRegex is portable between R4RS, R5RS, and R6RS; and almost completely PCRE compatible. Very nice!
(via comp.lang.scheme)
Skimp Scheme is a toy interpreter, about which the author makes a lighthearted quip:
Early days yet, but during a couple of enthusiastic hacking sessions while on Summer holiday in Italy, Skimp started talking back. It’s a surreal moment when a new interactive language interpreter come to life… like something with legs just strolled out of your primordial C program and asking for a pan galactic gargle blaster.