Coinductive Types in C++ Senders - Building Streams out of Hot Air

Explore advanced C++ programming concepts through a comprehensive conference talk that demonstrates building asynchronous streams and queues using only C++ senders. Learn how to construct coinductive types and infinite data structures from fundamental programming concepts, drawing from 80 years of computer science theory including current research areas. Discover how to implement Either, Pair, Maybe, Boolean, and recursive types like cons lists using C++ lambda expressions and the deducing this feature. Master the transition from inductive types to coinductive infinite types by understanding deconstruction and observation of codata, while exploring connections to generalized fold, catamorphism, and the Visitor pattern. Gain practical experience implementing concrete sender types that avoid type system recursions and provide clear examples for intermediate C++ developers. Understand how senders are grounded in theoretical foundations and how to borrow design insights from functional programming languages. Follow along as the presentation builds toward creating fully functional async queue and stream implementations using nothing but sender primitives, demonstrating advanced techniques for asynchronous programming in modern C++.