Stream fusion, to completeness

2016/12/20 by Oleg Kiselyov, Aggelos Biboudis, Nick Palladinos +1 · 1 voice · 3 citations
Computer Science · #Formal Methods in Verification #Logic, programming, and type systems #Parallel Computing and Optimization Techniques #cs.PL

paper · pdf · doi:10.1145/3009837.3009880

openalex publication_date 2016/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30

Abstract

Stream processing is mainstream (again): Widely-used stream libraries are now available for virtually all modern OO and functional languages, from Java to C# to Scala to OCaml to Haskell. Yet expressivity and performance are still lacking. For instance, the popular, well-optimized Java 8 streams do not support the zip operator and are still an order of magnitude slower than hand-written loops.

Cited by

• Julia GraphBLAS with Nonblocking Execution
• Eliom: A Language for Modular Tierless Web Programming
• Fast Collection Operations from Indexed Stream Fusion

Discussions

• today's paper: "Stream Fusion, to Completeness" (POPL 2017) might get some food for thought relevant to transducers in here [bsky, 6 points, 2 comments]

Related

• Highest-performance Stream Processing
• Complete Fusion for Stateful Streams: Equational Theory of Stateful Streams and Fusion as Normalization-by-Evaluation
• A Survey on the Evolution of Stream Processing Systems
• A survey on the evolution of stream processing systems
• On the Semantic Overlap of Operators in Stream Processing Engines