Typechecking top-down XML transformations: Fixed input or output schemas
type: Item
instance of: scholarly article
title: Typechecking top-down XML transformations: Fixed input or output schemas
zbMATH Open document ID: 1154.68370
author: Wim Martens
author: Frank Neven
author: Marc Gyssens
published in: Information and Computation
publication date: 2008-08-14T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/8451
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 5312287
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: UnQL
MaRDI profile type: Publication
OpenAlex ID: W2130093369
cites work: Typechecking XML views of relational databases
cites work: XML with data values: Typechecking revisited.
cites work: CDuce
cites work: A formal model for an expressive fragment of XSLT
cites work: Partition of Space
cites work: Domino-tiling games
cites work: An observation on time-storage trade off
cites work: Q3772828
cites work: A comparison of pebble tree transducers with macro tree transducers
cites work: A Decision Procedure for the First Order Theory of Real Addition with Order
cites work: Q4385525
cites work: Integer Programming with a Fixed Number of Variables
cites work: Q4473157
cites work: Frontiers of tractability for typechecking simple XML transformations
cites work: On the complexity of typechecking top-down XML transformations
cites work: Typechecking for XML transformers
cites work: Haskell overloading is DEXPTIME-complete
cites work: Q4131648
cites work: Q5714247
DOI: 10.1016/J.IC.2008.01.002
description: scientific article; zbMATH DE number 5312287