Maybe it's worth adding a couple of details about what misses in the current pattern matching system, to make it a good XML handling tool.
The current system works great to manipulate trees that are entirely in RAM, and whose structure is known precisely. The most common use-case is to manipulate metalua Abstract Syntax Trees, although it's prefectly suitable for any other tree-like structure. When you manipulate XML, there are two key differences:
- the data you're working with are potentially huge or even infinite streams. You want to be able to load data in RAM lazily, only when it's actually required.
