sligh VS Kind

But, you still seem hung up on this, so here’s actual code: https://github.com/amw-zero/sligh/blob/main/lib/codegen.ml.

Of course. Here was the first incarnation: https://github.com/amw-zero/sligh. It has a decent overview of the idea in the readme. To sum it up here, the idea is: have a language built around model-driven development and model-based testing, where you write a simple model of an application, and the implementation and model-based tests are compiled for you. I wrote about the overall model-based testing strategy here. This idea comes from self-certifying compilers that produce proofs of their correctness such as Cogent, but we drop the formality requirement and use property-based testing to compare the implementation and model.

Honorable mention - I’m working on a language with similar goals: Sligh, and I’ve written about why I think it’s such a compelling idea before as well too.

In Sligh, I spent most of the last month introducing a new intermediate representation to make tier splitting (choosing if code should live on the client or server) easier. My goal was to enable derived data, as in a model that queries other models for its data and combines them by processing them in memory. I've been using the example of a personal finance application, so imagine:

The language that I work on is Sligh, and it's out of the bulleted list because it's nowhere near as mature as any of those that I listed, and I'm more of a verification enthusiast vs. expert. Almost all of the ideas in it are borrowed from somewhere else, but I think the one quasi-unique idea is it allows you to write a pure logical description / specification of an application, and it generates full-stack web application code from that.

I’m currently using Pest, though I wouldn’t exactly recommend my compiler as a ‘good example’ just yet because I’m prototyping and just churning code out.

Sligh

So tactically it’s currently a source-to-source compiler, where in the source language (my language) you denote the system state transitions, i.e. by writing create!, update!, etc, and those get compiled to corresponding client and server code in the target language (JS for now, but hoping to support WebAssembly in the future). Heres an example program. The compiler source is there too. I’m hacking it together right now, so it’s not my finest work :D

As a developer of a proof assistant (Kind) I'm highly interested in this line of work. Can you point me to some of these papers? And perhaps people involved in this line of work?

Kind: A modern proof language (though functional).

I have seen in languages like KindLang the definition of Array be like a Binary tree, but there is some magic there in the definition of the Array type that I don't understand yet. Also, I don't want to define the contiguous array further., it should be a literal contiguous array. The Kind "Word" type definition (arbitrary number of bytes) is closer to my contiguous array, but it has a similarly complex definition which like I said I don't understand.

Totally agree about the Blub Paradox, but there's definitely value in Self Types. See, for example, [Kind](https://github.com/Kindelia/Kind), which is able to type recursive data types by using Self Types.

For these who don't know, I'm the author of Kind and HVM. I've recently seen a criticism from an influent person in the community, who I often took as an inspiration, that made me really sad. "the guy behind this has built some impressive-sounding stuff before... it looks like his projects tend to just... go nowhere and he just abandons them and does something else?"

This is very easy with dependent types! For example, in Kind: