On the tree-transformation power of XSLT

From MaRDI portal
Publication:855270

DOI10.1007/S00236-006-0026-8zbMATH Open1106.68019arXivcs/0603028OpenAlexW1993233874WikidataQ111823167 ScholiaQ111823167MaRDI QIDQ855270FDOQ855270

Jan Van den Bussche, Wim Janssen, Alexandr Korlyukov

Publication date: 5 January 2007

Published in: Acta Informatica (Search for Journal in Brave)

Abstract: XSLT is a standard rule-based programming language for expressing transformations of XML data. The language is currently in transition from version 1.0 to 2.0. In order to understand the computational consequences of this transition, we restrict XSLT to its pure tree-transformation capabilities. Under this focus, we observe that XSLT~1.0 was not yet a computationally complete tree-transformation language: every 1.0 program can be implemented in exponential time. A crucial new feature of version~2.0, however, which allows nodesets over temporary trees, yields completeness. We provide a formal operational semantics for XSLT programs, and establish confluence for this semantics.


Full work available at URL: https://arxiv.org/abs/cs/0603028




Recommendations




Cites Work


Cited In (7)

Uses Software





This page was built for publication: On the tree-transformation power of XSLT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855270)