- From: <bugzilla@jessica.w3.org>
- Date: Tue, 08 Mar 2011 18:19:42 +0000
- To: www-xml-schema-comments@w3.org
http://www.w3.org/Bugs/Public/show_bug.cgi?id=11076 --- Comment #5 from Michael Kay <mike@saxonica.com> 2011-03-08 18:19:41 UTC --- I don't think the equivalence of two XPath expressions is computable. Actually I may be wrong here, because I suspect that unlike XQuery, XPath is not Turing-complete. But it's certainly not realistic in practice to recognize all equivalent expressions that return the same result. Even recognizing whether or not ($i + 1) is equivalent to ($i - -1) is not trivial (it requires careful study of the rounding and overflow rules). -- Configure bugmail: http://www.w3.org/Bugs/Public/userprefs.cgi?tab=email ------- You are receiving this mail because: ------- You are the QA contact for the bug.
Received on Tuesday, 8 March 2011 18:19:43 UTC