Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/4130
Title: On the tree-transformation power of XSLT
Authors: JANSSEN, Wim 
Korlyukov, Alexandr
VAN DEN BUSSCHE, Jan 
Issue Date: 2007
Publisher: SPRINGER
Source: ACTA INFORMATICA, 43(6). p. 371-393
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.
Notes: Hasselt Univ & Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium.VAN DEN BUSSCHE, J, Hasselt Univ & Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium.jan.vandenbussche@uhasselt.be
Document URI: http://hdl.handle.net/1942/4130
ISSN: 0001-5903
e-ISSN: 1432-0525
DOI: 10.1007/s00236-006-0026-8
ISI #: 000243366800001
Category: A1
Type: Journal Contribution
Validations: ecoom 2008
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
0603028v1.pdfPreprint253.39 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

5
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

3
checked on May 29, 2022

Page view(s)

54
checked on May 28, 2022

Download(s)

98
checked on May 28, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.