Jacqueline Firth

Minor update: I created the `needs use cases` label for issues like this.

> The following behavior would be highly arbitrary, but it would still be deterministic: When I say that `forking` cannot sensibly interleave emissions, the word "sensibly" is doing a lot...

> The input stream currently carries just the elements, but it needs to also carry "open" and "close" events that let us know where in the stream a transducer's first...

This seems kind of like #347 in disguise. It probably has the same issues related to transducers that insert stuff at the beginning and end of the stream.

Implementation considerations: this problem is known as _partial sorting_, and there is a lot of research on how to do it efficiently. See the [Partial Sorting][wikipedia-partial-sorting] wikipedia article for more...

Time for versioning. Steps: 1. Declare version 1.0 in the rebellion `info.rkt` file. 1. Declare dependency on 1.0 in the resyntax `info.rkt` file. 1. Remember to bump version and include...

Updated design: the acceptance of the tuple type info and the acceptance of the instance fields should be separated by a partial application barrier. Meaning, the contract for a tuple...

It will take me a while to fully respond, but as a start I wanted to clarify what I mean when I say that I'm having a hard time telling...

Just for kicks I converted `reduce-all` to a hypothetical algebraic notation (but without infix ops and without using dots for method calls)

> Did you do that highlighting manually somehow? I used the `pict/code` library, specifically the `code` macro and `make-code-transformer`. This script: ```racket #lang racket/base (require (for-syntax racket/base syntax/parse) pict pict/code)...