Andrei Alexandrescu

Andrei’s talk will be a deep dive on variants of classic sorting algorithms. You might think that sorting has been studied to death and is a solved problem. But Andrei thinks there is more learn. Along the way he’ll share many wondrous surprises and teach us how to cope with the puzzling behavior of modern complex architectures.

Ben Smith

Ben will use a top-down approach to show how WebAssembly can solve a real-world problem.

His challenge is to build a Compiler Explorer-like tool that doesn’t require a server. He will show how to compile C++ code in the browser and run the resulting executable sandboxed in the browser.

Bjarne Stroustrup

C++ is turning forty. In a talk that both looks back and looks forward, Bjarne will ask the question, What is C++?

He will answer by looking at C++20, as a modern language, not treating it as a layer cake of features, but as integrated whole discussing how classes, templates, lambdas, and the other components of the language fit together.

Herb Sutter

Herb is going to discuss exceptions and RTTI, the only two features in C++ that violate the the zero-overhead principle. These features have divided our community. This talk is about ongoing long-term efforts to try to unify the community, not by replacing exceptions and RTTI, but by doubling down: fully embracing exceptions and RTTI, and improving them so they can be zero-overhead too.

Sean Parent

Computer scientists are bad at relationships. Nearly every program crash is rooted in a mismanaged relationship, yet we spend most of our time discussing types and functions and not the relationships connecting them together. Sean’s talk looks at common ways data and code are connected in an application, how those relationships are typically represented, and the problems caused by the use, and misuse of these paradigms.