S. Kepser. A proof of the Turing-completeness of XSLT and XQuery. Technical Report SFB 441, Eberhard Karls Universitat Tubingen, June 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Model Transformations And Tool Integration - Tratt (2004) (Correct)
No context found.
S. Kepser. A proof of the Turing-completeness of XSLT and XQuery. Technical Report SFB 441, Eberhard Karls Universitat Tubingen, June 2002.
The Design Space of Type Checkers for XML Transformation.. - Møller, Schwartzbach (2004) (Correct)
No context found.
Stephan Kepser. A proof of the Turing-completeness of XSLT and XQuery. Technical report, SFB 441, University of Tubingen, 2002.
XML-Based Support for Database Histories and Document Versions - Wang (2004) (Correct)
No context found.
S. Kepser. A Proof of the Turing-Completeness of XSLT and XQuery. In Technical report SFB 441, Eberhard Karls Universitat Tubingen, 2002.
XBiT: An XML-based Bitemporal Data Model - Wang, Zaniolo (2004) (Correct)
No context found.
S. Kepser. A proof of the turing-completeness of xslt and xquery. In Technical report SFB 441, Eberhard Karls Universitat Tubingen, 2002.
Using XML to Build Efficient Transaction-Time Temporal.. - Wang, Zhou, Zaniolo (Correct)
No context found.
S. Kepser. A proof of the turing-completeness of xslt and xquery. In Technical report SFB 441, Eberhard Karls Universitat Tubingen, 2002.
Temporal Queries and Version Management For Xml Document Archives - Wang, Zaniolo (Correct)
No context found.
S. Kepser. A proof of the turing-completeness of Xslt and XQuery, in Technical report SFB 441, Eberhard Karls Universitat Tubingen, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC