awesome-programming-languages VS Kind

There are many cool and awesome languages out there...

https://github.com/ChessMax/awesome-programming-languages seems pretty good. I would love to have some kind of sorting and filtering options, but it is definitely very comprehensive and actively maintained.

There are hundreds of awesome programming languages out there. You are to choose what's more suitable for your goals and interests. Many languages are looking for contributors, testers and so on. Just give it a try.

Behold - the list of 303 languages - from old to new, from mainstream to super obscure. Last updated 4 days ago.

Another curated list of (mostly) opened sourced languages: https://github.com/ChessMax/awesome-programming-languages

Continue working on collecting awesome PLs. Want to say many thanks to all contributors. You are all cool. One of the contributors added 30 PLs to the list. It's incredible. Now the list contains 178 languages. And it's huge. The more will come later. Stay tuned! As always I'm open to any help/contributions (PRs or issue or even ideas).

I'm working on collection list of programming languages. Here is the link https://github.com/ChessMax/awesome-programming-languages. That may be helpful.

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: