Re: XSL Theory

> I thought that the "Turing Completeness" of XSLT made such a proof
> impossible. Am I correct?

No that just means you can't use the same proof on absolutely all
stylesheets. It doesn't mean that there is not a proof for any
particular stylesheet. (Although there clearly are some stylesheets for
which the validity of the output depends on the the input document, this
isn't so related to Turing)

It's not that you can't prove programs stop. It's just that you can't
have one program that proves all programs stop ('cause if you give it to
itself you get problems)

David


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