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]
@inproceedings{Kepser04,
title = {A Simple Proof for the Turing-Completeness of XSLT and XQuery},
author = {Stephan Kepser},
year = {2004},
url = {http://www.mulberrytech.com/Extreme/Proceedings/html/2004/Kepser01/EML2004Kepser01.html},
tags = {XQuery, completeness, XSLT},
researchr = {https://researchr.org/publication/Kepser04},
cites = {0},
citedby = {1},
booktitle = {Proceedings of the Extreme Markup Languages® 2004 Conference, 2-6 August 2004, MontrĂ©al, Quebec, Canada},
}