The three-continuation approach to coroutine pipelines efficiently represents a large number of connected components. Previous work in this area introduces this alternative encoding but does not shed much light on the underlying principles for deriving this encoding from its specification. This paper gives this missing insight by deriving the three-continuation encoding based on eliminating the mutual recursion in the definition of the connect operation. Using the same derivation steps, we are able to derive a similar encoding for a more general setting, namely bidirectional pipes. Additionally, we evaluate the encoding in an advertisement analytics benchmark where it is as performant as pipes, conduit, and streamly, which are other common Haskell stream processing libraries.

中文翻译：

---

更快的协程管道：重构

协程管道的三连续方法有效地表示了大量的连接组件。该领域的先前工作介绍了这种替代编码，但并未对从其规范派生这种编码的基本原理提供太多启示。本文通过在消除连接操作定义中的相互递归的基础上推导三连续编码，从而给出了这一缺失的见解。使用相同的推导步骤，我们能够为更通用的设置（即双向管道）推导类似的编码。此外，我们在广告分析基准中评估编码，其性能与管道,导管， 和流利的，这是其他常见的 Haskell 流处理库。