AH. Well, if that's true, then my understanding was deeply faulted, and the content of my post is therefore ridiculous.
I've just been trying to wrap my head around writing a simple Turing machine with Lambda calculus that does the *kind* of thing that XS was written for (e.g. using native-compiled modules), all for the purpose of bootstrapping a Perl5-ish grammar which trades compatibility in favor of something a bit more ... well, I don't know, I guess portable the "new" way (e.g. LLVM?) as opposed to portable in the "C" way.
