Well, I've run out of month, if not out of languages. I guess I failed at my goal; still, the exercise was definitely worth doing. I'm definitely going to finish the one I'm currently working on, in C. Doing it continuation-machine style in C was probably a mistake in terms of complexity -- I suspect it's a good order of magnitude worse than any of ( Read more... )

I am currently working on an interpreter written in C, with the intention that it should support continuations and call/cc. I am doing this with continuation-machine semantics, which means small-step evaluation. In the process of figuring out how continuations interact with environments, I think I've discovered that my small-step evaluator in SML ( Read more... )

I am pretty excited about my Twelf Lisp interpreter. It slices, dices and even parses! I decided to do a parser because it seemed like it would be easy with logic programming (free backtracking!) I am taking slight advantage of the logic-programming features for the list case of the parser, but mostly I ended up just writing in a functional style ( ( Read more... )

Okay, so I went ahead and wimped out and did an easy one because I'm behind. Perl's a language I already know well, and I did basically a straight-up port of the Pike version. They turn out to be very similar languages! There are some interesting points of comparison between them.

( Notes )

Definitely downshifting to one every two days, so 15 interpreters for the month. It's a much more feasible speed. (And I'm already a day behind it! But I have a hope of catching up this time. ;-)

( Notes )

Welp, I think I jinxed it when I declared that it should be quick, since this one took about 3.5 days.

( Notes )

Oh dear lord ( Read more... )

Day 2 language: Haskell!

( Commentary! )

Writing Day 2 in Haskell. In the process, I realized that Day 1 is not actually complete -- it doesn't provide for defining recursive functions. So it's not self-hosting. Oops. (This would be why the version of 'define' that defines functions is not just lambda plus the ability to bind globals -- the latter doesn't give you recursion ( Read more... )

As a note to myself, but also to you my readers, here are some languages I'm considering:

( Huge list of languages )