RE: Transitive closure for XPath

> So we would still have a closure() function but have a notation for
> delayed evaluation:
>
> 	closure(/closure/node[1], delay::key("myKey", @child))
>

The concept you are looking for is "higher-order functions", available in
many functional programming languages. The concept is consistent with the
XPath conceptual model, but disagreeable to those who want the language to
stop short of being a general purpose programming language.

Mike Kay
Software AG


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list