Login / Signup
A Simple Proof for the Turing-Completeness of XSLT and XQuery.
Stephan Kepser
Published in:
Extreme Markup Languages® (2004)
Keyphrases
</>
xml data
xml documents
query language
highly reliable
query processing
markup language
turing machine
xml processing
database
data sets
data structure
general purpose
theorem prover
xml queries
xml query languages