Charm-MacOS VS boba

There's source code here, a Mac executable with auxiliary files here, and there's a manual here which also has notes in pink to explain the reasoning behind my choices. If you like the project, please add a star to the source code repo. Thanks!

There is a manual here with extensive notes (in pink) for langdevs. The source code is here and Mac OS object code can be found here.

Source code; Mac OS object code; manual.

So, here's the source code, and here's the Mac executable plus resource files. Both come with lots of example code and a manual in .pdf form with extensive notes for langdevs. The description of the bells and whistles of the REPL are near the end of the manual, in the section titled "The hub".

Here's the source code etc, here's a compiled Mac OS version, and here's a manual with extensive notes for other langdevs about what I'm trying to do.

Mac OS object code for Charm : https://github.com/tim-hardcastle/Charm-MacOS

See my shiny newish language paradigm! Or, alternatively, come and stare at the crazy guy trying to put the fun into functional! (Mac executable, manual in .pdf form and demo code here, source code etc here. Or if you just want to read about it without getting your hands dirty, here’s a version of the manual with extensive notes for langdevs.)

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.