Typechecking top-down XML transformations: Fixed input or output schemas

DOI10.1016/j.ic.2008.01.002zbMath1154.68370OpenAlexW2130093369MaRDI QIDQ937295

Wim Martens, Frank Neven, Marc Gyssens

Publication date: 14 August 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/8451

zbMATH Keywords

XMLcomplexitytree transformationstypecheckingunranked tree transducersXSLT

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (7)

Deciding definability by deterministic regular expressions ⋮ Cooperating Distributed Tree Automata ⋮ Frontiers of tractability for typechecking simple XML transformations ⋮ Schemas for unordered XML on a DIME ⋮ Look-ahead removal for total deterministic top-down tree transducers ⋮ Modulo constraints and the complexity of typechecking XML views ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs

Uses Software

• CDuce
• XDuce
• UnQL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of typechecking top-down XML transformations
• Frontiers of tractability for typechecking simple XML transformations
• An observation on time-storage trade off
• Haskell overloading is DEXPTIME-complete
• Typechecking for XML transformers
• XML with data values: Typechecking revisited.
• A comparison of pebble tree transducers with macro tree transducers
• A formal model for an expressive fragment of XSLT
• Domino-tiling games
• Integer Programming with a Fixed Number of Variables
• A Decision Procedure for the First Order Theory of Real Addition with Order
• CDuce
• Typechecking XML views of relational databases
• Partition of Space

This page was built for publication: Typechecking top-down XML transformations: Fixed input or output schemas