This is wildly off-topic, but I figure there are enough PL folks in this forum, that somebody might have pointers. I apologize in advance to those who come here only for OCaml-related content.
Does anybody have any pointers for where I might look for interesting algorithms for expression-tree and graph pattern-matching? That is to say pattern-matching over those data-structures with interesting constraints (like equality-constraints over nodes, or variables in expressions).
Surely there’s a rich literature on these things, b/c they’re so relevant to so many problems in program-rewriting, analysis, etc. But I’ve been so long in industry that nothing comes to mind immediately, for wherre to look.
Thanks in advance.
ETA: Ah, I’ve found at least one conference (series), “Combinatorial Pattern Matching” that seems relevant. And for graph pattern-matching, there’s VF2 and its descendants.