John A. De Goes

When attempting to deserialize a value of type `A` from a `DynamicValue`, we should be flexible in allowing reading "smaller" types from "larger" types, i.e. allow coercions. Various examples: 1....

Schema isomorphism

2

Increasingly, it will be necessary for _ZIO Schema_ to support schema-first approaches: for example, a new Scala project must interoperate with existing gRPC services, whose messages are defined using protobuf....

Implement Protobuf code generator

1

Given a protobuf, it should be possible to generate both the Scala data structure, as well as the `Schema` corresponding to this data structure.

Creating highly optimized and specialized fiber mailbox

27

Currently, ZIO 2 uses a concurrent linked queue for the mailbox. However, this data structure is very generic, and not optimized for the fiber runloop in particular. Therefore, it should...

Pull-based I/O may interfere with fully compositional concurrency

11

These ideas are not fully formed yet, but I wanted to put them out here anyway: The component model really wants us to be able to treat and think of...

Expand Equiv subtypes to include sum types up to arity 22

2

A sum type requires a fallible deconstructor and infallible constructor for each term. Or more if we want totality checking at compile-time.

Equiv should have subtypes that witness equality between nested tuples and "case classes" of arity up to 22. More details and a prototype in a different project can be found...

Given appropriate `Equiv` (see #18), it is not necessary to allocate nested eithers, but rather, one can go direct from the parse data to the target structure. See [here](https://github.com/spartanz/parserz/issues/75) for...