XML documents are trees, and processing them is graph traversal. This
paper might be of some theoretical help:
Functional Programming with Graphs, Martin Erwig. 2nd ACM SIGPLAN Int.
Conf. on Functional Programming (ICFP'97), 52-65, 1997 (also in: ACM
SIGPLAN Notices, Vol. 32,No. 8, Aug 1997,
In this article
(http://www.mulberrytech.com/xsl/xsl-list/archive/msg07336.html), Clark
Evans claims that XSLT is too slow or too memory intensive because it is a
functional language.
He suggests adding Hashtables to XSLt to improve performance. Is this
really necessary? Is the problem
