Predicate Dispatch
summary
Presents a working prototype that combines predicate dispatch with high-performance pattern matching by driving the compiler with a logic engine and reusing ideas from Luke Manan and Craig Chambers, implemented as core.logic plus an extensible core.match compiler. Matches on maps, sequences and vectors, reorders tests to produce compressed decision trees, and stays competitive with ML/OCaml/Haskell matchers; explores lazy compilation for JVM and partial support for ClojureScript while noting reordering and redefinition tradeoffs.
AI-written summary · about
chapters (5)
related talks
08mCompiling pattern matching to in-place modifications
22mRevisiting Dynamic Dispatch for Modern Architectures
30mA Core Language for Extended Pattern Matching and Binding Boolean Expressions
23mType-Level Programming with Match Types
16mContextual Dispatch for Function Specialization
27mDynamic Dispatch and Type Inference in Fortress
23mPattern-matching on mutable values: danger!
39mPattern Matching: Small Enhancement or Major Feature?
