edsl VS jevkalk

I'm taking a brief detour from working on my actual language to work on some underlying theory. My language (Sligh) is based on informal certifying compilation, i.e. the compiler generates a test checking for correctness of the compiled program instead of a proof. Because I'm mostly interested in generating code for full-stack web applications, I think optimization is actually essential for the practicality of this approach, otherwise the certificate test will be much less effective.

So, full compilation of the implementation is out in my mind, and the next best thing is at least deriving the implementation from the model so you can leverage the logic you've already defined. That's where metaprogramming comes in, and that's what I'm playing around with here.

[1] Here's one of my tries: https://github.com/jevko/jevkalk

Here is a toy language that uses Jevko as syntax that I've been hacking on a bit recently: https://github.com/jevko/jevkalk

> is doing? It sure looks to me like it's asking whether a symbol (i.e. indivisible atom) ends with an equal sign, which is semantic gibberish.

There are no symbols or indivisible atoms here.

What's happening here is parsing. `jevkoToHtml` is a kind of parser-transpiler which operates on a syntax tree, rather than a sequence of characters or tokens.

The syntax tree is the output of an earlier stage of parsing, done by the Jevko parser.

So you can think of this as multi-pass parsing, by analogy with multi-pass compilation.

At the same time as this second pass of parsing is happening, translation to HTML is happening as well.

Hope this clarifies things!

---

[0] To clearly see the point, here is a toy programming language which uses Jevko as its syntax: https://github.com/jevko/jevkalk