A Simple Proof for the Turing-Completeness of XSLT and XQuery

Stephan Kepser. A Simple Proof for the Turing-Completeness of XSLT and XQuery. In Proceedings of the Extreme Markup Languages® 2004 Conference, 2-6 August 2004, MontrĂ©al, Quebec, Canada. 2004. [doi]

Abstract

Abstract is missing.