[xquery-talk] [XQuery] limitations
michalmas at gmail.com
Sat May 2 12:59:21 PDT 2009
A proof for Turing-completness can be found in the paper: 'A Simple
Proof for the Turing-Completeness
of XSLT and XQuery' by S. Kepser.
Thanks for help,
On Wed, Apr 29, 2009 at 6:06 PM, Michael Kay <mike at saxonica.com> wrote:
> XQuery is a Turing complete functional language, so its computational power
> is the same as that of all modern programming languages.
> If there are limitations, they lie in the data model, not in the expressive
> power of the language. For example, if your source documents have unparsed
> entities, XQuery is unable to see them.
> Michael Kay
>> -----Original Message-----
>> From: talk-bounces at x-query.com
>> [mailto:talk-bounces at x-query.com] On Behalf Of Michalmas
>> Sent: 29 April 2009 16:42
>> To: talk at x-query.com
>> Subject: [xquery-talk] [XQuery] limitations
>> Hi gents,
>> I was wondering what are the limitations of XQuery? For
>> instance, there are some limitations of regular exp (you
>> can't parse what is not defined by a regular language). Since
>> XQuery uses XPath which uses reg exp - does it bring any
>> limitations to XQuery search engine?
>> I tried to google some examples, but mostly someone was able
>> to prepare interesting query.
>> I mean here typical XQuery and reg exp (there are some
>> extensions to reg exp that diminish such limitations somehow,
>> but here i am interested in pure definitions)
>> talk at x-query.com
More information about the talk