Message Handling with Boolean Algebra
summary
A message-handling library that separates field layout from storage and operates on bit-level locators is implemented; matchers are empty function-object types representing predicates and are composed with and/or/not operators. The key claim is that adding Boolean implication as a compile-time customization lets the system prove facts like “<5 implies <7” and perform compile-time simplification of expression trees, collapsing checks so almost nothing runs at runtime. The code composes with an external indexing library, handles split fields, and is released as open source, producing markedly smaller runtime work.
AI-written summary · about
chapters (7)
- 0:00Introduction and design
- 4:17Fields and messages
- 10:17Matcher DSL and composition
- 19:12Simplifying matchers
- 25:37Boolean implication
- 34:19Implementing implication
- 41:26Conclusion and results
related talks
18mFast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect...
15mQualified Types with Boolean Algebras
26mThe Simple Essence of Boolean-Algebraic Subtyping: Semantic Soundness for Algebraic(…)
16mPolymorphic Types and Effects with Boolean Unification
01h 31mZero-Cost Abstractions in C++ - High Performance Message Dispatch
59mTheory makes beautiful programs
30mConstraint Typing with Boolean Algebra
23mLet Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded(…)