prowl VS xvm

Functors can help remove a lot of code duplication. For example, the language I am working on has a big equational unification framework for its type system, and I can compose unifiers easily by making them meet some common specification and tying things together. Without functors, I would need to have callback arguments and extra constants in a bunch of the functions, and each function relevant to each unifier would have to be tied together individually, which would be a terrible mess.

I've been developing a language called Prowl in the discord server. Strings can be concatenated into bigger strings, it turns out you can do the same with programs, and they are related - Prowl is a stack language that uses regex for control flow. It's also kind of a logic language, since regex semantics includes forms of backtracking. The patterns match data instead of strings, like in FP, and then the combinators decide the control flow from there. Eval has a type like Stack -> List Stack, then there are 3 basic operators "cat", "alt", and "intersect" (we use juxtaposition, |, and && as in regex, but it's also >>=, <|>, *> in Haskell) which put code together. While the language is still largely in the design phase, there is a prototype interpreter that is able to run most examples. If this interests you, check out the language tour.

Thank you. [It's very early in the works](https://github.com/UberPyro/prowl/), see [tutorial ](https://uberpyro.github.io/prowl/introduction.html) for more details.

Have a look at the ecstasy library for the language definitions of these types.

2) Funky interfaces: This is an Ecstasy interface that declares abstract static members (e.g. functions), which can then be implemented on any class and overridden on any sub-class, such that they can be invoked by type (instead of this), and virtually resolved (late bound at runtime) based on the type known at compile time. The best known example, of course, is Hashable, because it has to guarantee that a type implements both equals() and hashCode() on the same class, and the implementation is tied to the type, and not to the this. (C# added a similar feature last year in version 11.)

I'm just going to warn you in advance that invocation is one of the hardest things in the compiler to make easy. In other words, the nicer your language's "developer experience" is around invocation, the more hell you're going to have to go through to get there. The AST nodes for Name( (NameExpression) and Invoke( (InvocationExpression) alone are 7kloc in the Ecstasy implementation, for example -- but the result is well worth it.

Ecstasy uses message passing automatically behind the scenes for asynchronous calls, but the message passing isn't visible at the language level (i.e. there is no "message object" or something like that visible). Basically, all Ecstasy code is executing on a fiber inside a service, and services are all running concurrently, so from any service realm to any service realm, the communication is by message.

Regarding Ecstasy, we did not set out to build a new language; we actually set out to solve a real world problem. Specifically, we wanted to be able to dramatically improve the density of workloads in data centers, by at least two orders of magnitude in the case of lightly used applications. Our initial goal was to create a runtime design that would support 10,000 stateful application instances on a single server. Let's call it the "a10k" problem 🤣 ... a tribute to the c10k problem from 1999. We refer to our goal as "zero carbon compute", i.e. we want to push the power and hardware cost for an application to as close to zero as possible; you can't reach zero, but you can get close. If we succeed, we will help reduce the electricity used in data centers over the next few decades by a significant percentage.

Generally, left to right, one character at a time. If you’re looking for example code, here’s a simple hand-built lexer.

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

Ecstasy

Ecstasy and the xvm were designed assuming an adaptive runtime compiler (similar in concept to the Hotspot compiler for Java), but not necessarily using a JIT.

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: