On the tree-transformation power of XSLT

Authors:
Wim Janssen;Alexandr Korlyukov;Jan Van den Bussche
Affiliations:
Hasselt University & transnational University of Limburg, 3590, Diepenbeek, Belgium;Grodno State University, 3590, Grodno, Belarus;Hasselt University & transnational University of Limburg, 3590, Diepenbeek, Belgium
Venue:
Acta Informatica
Year:
2006

Citing 0
Cited 5

XML transformation by tree-walking transducers with invisible pebbles

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A learning algorithm for top-down XML transformations

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An XML course as a springboard for teaching fundamental computer science ideas

Journal of Computing Sciences in Colleges
Model querying with graphical notation of QVT relations

ACM SIGSOFT Software Engineering Notes
Highly expressive query languages for unordered data trees

Proceedings of the 15th International Conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

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, using a DAG representation of trees. A crucial new feature of version 2.0, however, which allows node sets over temporary trees, yields completeness. We provide a formal operational semantics for XSLT programs, and establish confluence for this semantics.