xvm VS star

Parts of Ecstasy are now implemented in Ecstasy. Here's the Lexer, for example.

Ecstasy

A Future reference has the various capabilities that you'd imagine, taking lambdas for thenDo(), whenComplete(), etc. The reference, in the above example, is a local variable, so you just obtain it using the C-style & operator:

FWIW - here is the stage manager code that I referred to.

Ecstasy (xtclang.org): Currently working on session management for a cloud-based HTTP back end. Not exactly compiler or language stuff, but it certainly is exercising the compiler and language.

I prefer to make my AST nodes fairly rich, and let them do the brunt of the work themselves. Instead of the 5 lines of code above, the assignment statement node in Ecstasy is over 1000 LOC. But it handles everything from initial validation through the MLIR emission.

No, not that specific project. It's our own Mid Level Intermediate Representation (or Mid Level Intermediate Language), aka MLIR/MLIL. Here's a snapshot of the operators.

Ecstasy project on Github: https://github.com/xtclang/xvm

Quite a few improvements in Ecstasy over the past month:

Early on, we had the This keyword, and its meaning was "this type". So if a method on class Collection was declared as This add(Element), it meant that the method returned the auto-narrowing type of this. We later changed it from This to Collection (or whatever the class name is) and added the Collection! (non-narrowing) form, because there were syntactic needs (e.g. inner and outer auto-narrowing class references) that could not be covered by This. We evaluated a few different options, and we liked (and still like) the result that we came up with. That said, I still wish we had a This keyword (see the 5th bullet point) for the "this type", but 🤷‍♂️.

This is actually done by several bootstrapped languages, such as Crystal, Nim, Raku, and even my own language Star

In Star, commas and newlines are analogous everywhere, even inside array literals. This actually solves the issue of trailing commas by not needing commas at all

I really like Nemerle's OOP+FP hybrid model, and I've taken a lot of it to heart while designing my language Star, which is similar in spirit.

It's currently a work-in-progress, mainly due to subtyping issues with generics (which I'm honestly too lazy to fix rn, focusing on other stuff first). the code is located here, although be aware that it's a bit messy lol

My language Star has this (excluding full type inference, as method signatures require type annotations for stuff), both for structural types and variants (which I don't cover in my docs, but there's an example here. Extensible variants are also supported via nominal subtyping, and they also combine the properties of sum types with product types as they can have instance fields (along with other class behaviors)

Making lots of progress on Star's typechecker, which has been very difficult due to its expansive type system. Although still not completely finished or useable, it does at least work a bit. Currently need to implement type variable expansion/substitution, "lazy" type refinement (because I have no clue what else to call it), and some basic support for existentials

I think this is referred to as partial or lazy initialization. I have this feature in my own language Star (which us null-safe), but I don't have an actual null literal for this purpose

Hello, I'm the developer of the Star programming language, and I have some questions about how to typecheck several new/uncommon features that it has, and looking for feedback on it in general.

I'm working on Star because there are no languages that push the limits of what can be done by mixing OOP and FP ideas , features, and type systems.

Funny you should mention it, I've actually been writing Star's base compiler in Haxe. I'm also writing my Red.js project in Haxe, although it's more of an interpreter than a compiler