Almost a year ago I wrote about adding sequences to Loell. I did a few attempts but failed. Then a month ago I implemented continuations in Javascript. (It's not pretty.) After that it went pretty smooth. All languages may by Turing complete, but some language features can make the difference between being able to solve a problem or not. Even if that feature is simply implemented in the language itself.

The result turned out to be rather different from the original Loell, so I gave it a new name: Moiell. It stands for Monadic Objects, Iterative Evaluation, Little Language. I'll explain later.

The reason I'm now posting about this is that I got the following code running:

sieve: [|p::ns| >p, sieve( ns[me mod p != 0] ) ]
>sieve(2..inf)

It generates the prime numbers using the sieve of Eratosthenes. I think it's really cool short code. A little bit of explanation:

• [|args| body] — a function (as in Smalltalk)
• x::xs — put first value of a sequence in x and the rest (lazily) in xs (like x:xs in Haskell)
• > values — yield values (like yield in Python or Ruby)
• values[test] — filter (as in XPath)