Kind VS BorrowScript

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:

You might be looking for something like https://github.com/alshdavid/BorrowScript

I think AssemblyScript is the best example.

Adding the borrow checker is quite invasive though. This guy is trying https://github.com/alshdavid/BorrowScript.

I think it's a kind of fun constraint that experienced and bored devs like to challenge themselves with - the borrow checker. The latest obsession. You absolutely don't need a borrow checker, just like you didn't need everything to be functional programming, but it's intellectually stimulating.

Sounds like BorrowScript, which is TypeScript syntax, a Rust borrow checker, and Go-like coroutines. It's designed for wasm and web api targets. (not compatible with TypeScript though)

https://github.com/alshdavid/BorrowScript

I asked how to implement a "borrow checker" in JavaScript in my initial attempts (I've learned a decent amount since), which led me to randomly finding BorrowScript that seems to have another implementation I think, so going to be taking a deeper look there for inspiration as well. But if one could explain the steps of the algorithm, and how it integrates/relates with the type inference process, that would be of great use. Not for learning how to use Rust, but to learn how this aspect of its compiler works.