On Wed, 1 Dec 2004, Dan Sugalski wrote:
Dunno if there will (though I'd love it) and it shouldn't be too hard.
Just delurking for a moment to mention that for various reasons I recently wrote a (much of) Haskell --> lazy SK machine compiler. The SK machine is reasonably simple, and I have vague plans to implement one in Parrot assembly for a learning experience (once I work out how to do a garbage collected binary tree PMC the rest should be a doddle ...)
So, uh, watch this space. The nice thing is that anything it lacks in efficiency can be explained away as "purposely stressing the Parrot engine."
Fraser.
