Shapeless VS cloroutine

Scala 2-only: * Shapeless (there is Shapeless for Scala 3 but less often needed as basic things are in Scala 3)

This is the FromMap typeclass in Shapeless. Note that there’s a companion syntax package for it providing .toRecord for any Map and an appropriately-structured Record (and a Record is the LabelledGeneric representation of a case class).

If that's what you want, you can use Shapeless' records and HList. You can probably replicate this in plain Scala 3 with tuples and literal types as you said. It won't play nice with your others libs though but maybe there are integrations.

See the Shapeless Sized example.

Shapeless has Sized: https://github.com/milessabin/shapeless/blob/v2.3.9/core/src/main/scala/shapeless/sized.scala

I know that libraries like Scodec and shapeless were rewritten practically from scratch for Scala 3, taking advantage of the next syntax and internals, as well as protoquill - a Scala 3 implementation of Quill.

please show me something like this: https://akka.io/ or this: https://zio.dev/ or this: https://github.com/milessabin/shapeless

That largely depends on the type system. Languages like Haskell and Scala which have much more powerful type systems than C/Java/Go/etc absolutely do allow you to do those sorts of things. It is a bit harder to wrap your head around to be sure and there are some rough edges, but once you get the hang of it you can get the benefits of static typing with the flexibility of dynamic typing. See https://github.com/milessabin/shapeless or a project that I've been working on a lot lately https://github.com/zio/zio-schema.

Just use cats and use the apply syntax .mapN for this. Seriously. There isn't a way to do it without generating source code that I can see in the api. Scala 3's HList Tuples aren't like Shapeless 2's HLists and I can't figure out a way in the api to reduce the tuple members down from (A, B, C, D) into an E, generically, yet with Scala 3 poly functions, unlike what you could do in Shapeless 2 with HList

Scala has sparked a huge ecosystem of very high quality libraries (Cats, Scalaz, shapeless, to name but a few). I think a major reason for this is that Scala attracts developers who value the advantages of the JVM, but are fed up with the limitations of the Java programming language and understand the benefits of an expressive type system and functional programming.

Thanks for sharing! I think these restarts could definitely be implemented as a library in Clojure with the help of a coroutine library like https://github.com/leonoel/cloroutine#guides

Do you mean the example here https://github.com/leonoel/cloroutine/blob/master/doc/01-generators.md , with the `*tail* binding? It took me a long time looking at it to finally grok it, and it's really hard to explain in English but basically when the coroutine comes across one of these symbols that are "breaks" (in our case, "yield" is such a breaking symbol), then it will pause the coroutine, and actually call what the symbol points to (the implementation of "yield"), which returns (cons x *tail*), and keep in mind that it is all run within a recursive call to gen-seq where *tail* is bound to a lazy-seq of the remainder of the generator (binding [*tail* (gen-seq gen)] (gen)), it's pretty confusing but yeah just have to stare at it for a long time I think haha.

I think Clojure is really missing python/js-style generators, like what is implemented in https://github.com/leonoel/cloroutine/blob/master/doc/01-generators.md

The next level up is core.async go blocks which compile your AST to a state machine. Also see cloroutine which also compiles the AST to a state machine or something, one of the tutorials uses cloroutine to add async/await to Clojure.

Coroutines are a more general concept, and can be used to implement conditions/delimited continuations. There’s an example in their docs.