boba VS mlscript

I've done a small implementation, used in type inference, in my language Boba. And you are correct, I used the linear equation solving method.

The vast majority of October's improvements on Boba were type system and runtime bug fixes. In particular, the effect handler/delimited continuation semantics were hopelessly busted beyond a few simple examples I'd fixated on.

September was another productive month for Boba, which is starting to get more 'quality of life' improvements rather than broad new features. That doesn't make the work less important: one of the bug fixes to the type inference engine last month caught a previously unseen bug in the core Boba libraries!

Also worth checking out is Adam Gundry's work on type inference for UoM types. Or, if you want an example implementation of the Abelian unification used in standard type inference extended with UoM types, you can reference my implementation, based on solving linear equations.

August was a surprisingly productive month for the Boba compiler. A few highlights:

The next large feature for Boba (a general-purpose concatenative language) is language integrated property tests.

That's a good question! I wrote up some of my thoughts on the benefits of Go as a backend, but there's also a historical component here. The first backend I was experimenting with was compile-to-C plus a C-based runtime. Go was closer to C than C# for what I needed at the time and I thought had a nicer concurrency story as a backend.

My other subreddits of interest also received an invitation to participate, for example on r/ProgrammingLanguages from u/LPTK. (And people there seemed to have enjoyed the survey, great!) Looking at post history for u/LPTK clarifies that they are the same person as https://lptk.github.io/about.html . So a reasonable guess as to who "us" is would be: a programming-language research group at UST university in Hong Kong, also the group working on MLScript. There is also a mention of Helium, an old Dutch research project about typing errors -- not sure if this work is being done on top of Helium.

There is one little hitch currently, but it's easily fixed: parametericity is not ensure because we allow matching on anything, which makes type abstraction rather weak. This can be fixed by requiring a matchable or object upper bound on scrutinees' types. This way, we won't be able to match things out of abstract types like Rep. (More info in the MLscript repo, which is the more complete and practical version of the language, currently being developed.)

The third language is https://github.com/hkust-taco/mlscript. It features global ML type inference with extensions .my prof is https://cse.hkust.edu.hk/~parreaux/author/lionel-parreaux/