interjevko.js VS edsl

Now you can devise a more complex format which would specify what trees map to nulls or empty tables or what-have-you, or even use a complementary Jevko schema to disambiguate what an empty tree means, e.g. https://github.com/jevko/interjevko.js -- but that is a topic for another time.

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.