Frontiers of tractability for typechecking simple XML transformations
type: Item
instance of: scholarly article
title: Frontiers of tractability for typechecking simple XML transformations
zbMATH Open document ID: 1115.68058
author: Wim Martens
author: Frank Neven
published in: Journal of Computer and System Sciences
publication date: 2007-04-26T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/608
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5146908
zbMATH Keywords: XML
zbMATH Keywords: XSLT
zbMATH Keywords: tree transformations
zbMATH Keywords: typechecking
zbMATH Keywords: unranked tree transducers
zbMATH Keywords: complexity
describes a project that uses: XDuce
describes a project that uses: CDuce
describes a project that uses: XPath
describes a project that uses: UnQL
MaRDI profile type: Publication
OpenAlex ID: W2091686039
cites work: Typechecking XML views of relational databases
cites work: XML with data values: Typechecking revisited.
cites work: XPath satisfiability in the presence of DTDs
cites work: A formal model for an expressive fragment of XSLT
cites work: An observation on time-storage trade off
cites work: CDuce
cites work: Q4198056
cites work: Q4179852
cites work: Q4414534
cites work: Q4506483
cites work: A comparison of pebble tree transducers with macro tree transducers
cites work: Q4473157
cites work: On the complexity of typechecking top-down XML transformations
cites work: Typechecking top-down XML transformations: Fixed input or output schemas
cites work: Mathematical Foundations of Computer Science 2004
cites work: Containment and equivalence for a fragment of XPath
cites work: Typechecking for XML transformers
cites work: Q4414544
cites work: Q4414525
cites work: Q3392273
cites work: Q4131648
cites work: Q5714247
cites work: Q4414543
DOI: 10.1016/J.JCSS.2006.10.005
description: scientific article; zbMATH DE number 5146908