Dave Beazley's keynote presentation at EuroPython 2021 uses the concept of "pairs" to explore type systems, category theory, and their relationships to algebra and logic. He begins with a discussion of pairs in programming, then transitions to theoretical questions about perfect implementations and the nature of arrows, representing types. The talk investigates the equivalence of type pairs, introduces the concept of "void," and formulates type rules. Beazley then discusses how these rules can be interpreted as algebra or logic, touching on algebraic type systems and the Curry-Howard-Lambek correspondence. In a Q&A, he discusses his math background and opinions on Python developing type inference or Rust-like error handling.
Sign in to continue reading, translating and more.
Continue