burrido VS ante

do-notation can be easily implemented using delimited continuations (ie. generators). Generators compose well and flatten tail calls so you don't need TCO or trampolines. The only notable issue is that one-shot delimited continuations like generators don't work with non-deterministic monads (ie. List). Multi-shot can be emulated by keeping a cache of past values and replaying the generator, but performance will suffer. See burrido [1] for a JavaScript do-notation implementation.

[1] https://github.com/pelotom/burrido

I haven’t tried this out myself but there’s libraries out there that emulate do notation with generators, if that’s any better than e.g. fp-ts’ Do. A quick Google search led me to burrido

Looks great!

A few questions (hopefully the author still reads it):

* Any plan for support of arrow/monad comprehensions?

* Semi-related: When it comes to generators it might be worth to consider making them clonable (see https://github.com/pelotom/burrido)

Have you had a look at Ante? It looks a lot like a Rust 2.0 with better ergonomics. There are a lot of interesting ideas.

Ante is what you are looking for. It's an ML descendant with no RTS nor AGC.

In my experience, people believe that programming languages are a solved space, and we should stick with what we have.

It's unfortunate; because languages are very polarized today. I think there's a lot of room for languages that are safe, fast, and most importantly, *easy.* Today's languages are generally two out of three.

Luckily, a lot of languages are exploring that space!

* Vale is blending generational references with regions, to have memory-safe single ownership without garbage collection or a borrow checker. [0]

* Cone is adding a borrow checker on top of GC, RC, single ownership, and even custom user allocators. [1]

* Lobster found a way to add borrow-checker-like static analysis to reference counting. [2]

* HVM is using borrowing and cloning under the hood to make pure functional programming ridiculously fast. [3]

* Ante is using lifetime inference and algebraic effects to make programs faster and more flexible. [4]

* D is adding a borrow checker!

[0] https://verdagon.dev/blog/zero-cost-refs-regions

[1] https://cone.jondgoodwin.com/

[2] https://www.strlen.com/lobster/

[3] https://github.com/Kindelia/HVM

[4] https://antelang.org/

[Ante](https://antelang.org/): lifetime inference, refinement types, algebraic effects.