awesome-programming-languages VS schmu

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.

Since the last time I posted, I finished implementing pattern matching for schmu. To make matching on multiple columns less confusing I also added a tuple syntax to the language (finally), which are treated as anonymous records in codegen. Since then, I'm trying to overhaul my memory management, as my RAII-like solution only worked for linear code. In my first big departure from OCaml semantics, I decided to implement mutable value semantics. The paper linked in the Val language introduction makes a strong case for value semantics and after watching a couple of talks by Dave Abrahams, I wanted to try see how it feels. By making mutability be transitive and explicit, it also fixes one of the (few) gripes I have with OCaml that an array can never be really const as it is a reference type (it's possible to enforce constness with modules, but that's not exactly lightweight, syntax wise). Implementing mutable value semantics was pretty straight forward on the typing side, but I'm still not completely done with the codegen. This is due to 1. Assumptions about immutability I made in a lot of places are now wrong, and I had to completely change the way I pass values to functions. 2. I had to implement reference counted arrays, which was more work than I thought it would be. There are still edge-cases coming up in testing from time to time. Yesterday I finally managed it work for tail recursion, yay! I'm looking forward to getting rid of unneeded reference count updates in the future, by moving them to compile time, at least for linear code, lobster style. That's also an excuse to read that Perceus paper again. For the rest of November, I want to enhance my module system a bit. In particular, I want to add signatures and allow locally abstract types. I hope to have this in place before December to do the Advent of Code in my language.

I'm still working on my toy language schmu, an ML-inspired language which uses LLVM as backend.

I spent the time off over the Easter break to write the first program in my language which is not an explicit test and ended up implementing Ray Tracing In One Weekend. It was very rewarding to see how usable the language is already.