Message Handling with Boolean Algebra
Talkat CppCon 2024 · on Monday, 2024-09-16· at 14:00· Cottonwood 2/3, 6700 North Gaylord Rockies Boulevard·
summary
A message-handling library for embedded systems uses Boolean algebra to simplify match expressions at compile time so runtime dispatch does minimal work. It implements compile-time simplification, a customizable negate and implies operation, and transforms predicates into disjunctive normal form for an index that yields bitset-based dispatch. The code is open source, the approach reduces evaluated predicates dramatically, and an extensive test suite verifies the simplifications and indexing work as intended.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 2:12Message Handling Overview
- 4:06Fields and Messages
- 9:26Implementing Matchers
- 13:02Matcher Composition
- 17:41Simplifying Expressions
- 25:37Curry-Howard Isomorphism
- 30:13Logical Implication
- 36:11Implication Application
- 43:40Sum of Products
- 49:40DNF Transformation
- 55:13Ordering and Summary
- 58:32Q&A
related talks
06mSafe bool idiom
01h 37mExtending and Simplifying C++: Thoughts on Pattern Matching using `is` and `as`
37mA (Not So Gentle) Introduction To Systems Programming In ATS
48m[a bit noisy] Optimizing Generic Algorithms
18m"Safety Goggles for Alchemists"
01h 00mDealing with aliasing using contracts
55mClean Integral Code
38mEngineering Software Integral Types