I've sort of committed to writing a scheme interpreter for Parrot. Only catch is that I can't do it until keyed structures are working (at the very least PerlArrays, and preferably PerlHashes). So, today's Exegesis came out, solidifying some more of Perl 6 and generally firming up the syntax.
And then I realised. I think I have enough of Perl 6's syntax to implement a perl 6 scheme interpreter. I'm not sure I'm going to manage tail recursion optimization (unless Perl 6 is guaranteed to do that out of the box, in which case it's a doddle).
I think we've got enough now that I can do it either in OO or functional style, but I'm leaning toward the functional; it seems to fit the target language better.
I'm hoping that the new regex stuff that Larry is threatening for Apocalypse 5 will make the tokener/lexer easier to do, so those bits'll probably start off defined with ... in their bodies.
Continuations might have to wait too...
