http_server VS order-pp

I use pony https://ponylang.io/ as a language - it's an Actor based language with GC where every actor has its own memory and is responsible for its own GC.

The main feature is its ability to safely share or move data around between actors in a way that is data-race and deadlock free. Pony doesn't use locks anyways :-)

A high level as to how it achieves this:

And it's not just the mathematics. The non-type-theoretic paradigm-upending let-it-crash-to-keep-code-correct resilience for which Erlang/Elixir is famous was one of the biggest eye-openers for me in my programming career (which began in 1972 when I was 12). Also, the simple behaviour and very high performance results of contemporary Actorish implementations, especially Akka.io and the in-some-ways-more-impressive ponylang.io and related ORCA GC ("concurrent and parallel garbage collector for actor programs ... does not require any STW steps, or synchronization mechanisms ... zero-copy message passing and sharing of mutable data ... data race free ... [no] read/write barriers"), are eye-catching affirmations of the Actor model's approach.

Being an unabashed Ponylang fanboy, I'd say that mutability is a separate question from the "actual" type. I'm simplifying a lot here, but generally in Pony you'd express this in a couple of different ways depending on whether you want the binding itself to be immutable or whether you only care about the instance itself:

There's an http server and a small "sinatra" like web framework.

- https://github.com/ponylang/http_server

- https://github.com/theodus/jennet

Someone might have done SQLite for Pony, but I'm not aware of it. Writing network protocol stuff in Pony is usually pretty easy and the C-FFI is usually pretty easy which generally makes writing database connectivity (for at least happy path basics) fairly easy. (Add lots of caveats here).

If you'd like to talk more in-depth, swing by the Zulip and myself and other folks from the community can help out with answers.

https://ponylang.zulipchat.com/

Looping is already totally doable, up to a finite maximum number of iterations. Local variables and the like can be simulated through suitably clever preprocessor definitions and logic, too. The syntax and trickery you need to take advantage of it is thoroughly, thoroughly unpleasant though.

For anyone curious about the practicality of that sort of thing, A CPS macro continuation machine like https://github.com/rofl0r/order-pp/blob/master/inc/order/cm.... would give you about 18 quintillion loop iterations if my math was right; double the length of that file and you’d have more loop iterations than atoms in the universe.

Macros can already accomplish this and more quite handily, using order-pp for example:

Here is an example of the power of order: https://github.com/rofl0r/order-pp/blob/master/example/fibonacci.c