Scheme Macros for Non-linear Pattern Matching with Backtracking for Non-free Data Types
summary
Claims an efficient embedding of Egison-style patterns on top of the Scheme macro system, implementing non-linear pattern matching with backtracking for non‑free datatypes by translating high‑level patterns into compiled matching code and new binding/state machinery. The implementation adds syntax, a matching state machine, and optimization passes; benchmarks report performance within about 2× of hand‑written matchers while supporting custom matchers, polymorphic patterns, and compositions that previously forced big slowdowns.
AI-written summary · about