Sciweavers

Share
PLANX
2008

XML Type Checking for Macro Tree Transducers with Holes

8 years 11 months ago
XML Type Checking for Macro Tree Transducers with Holes
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because they support sequence concatenation of output trees as build-in operation. Surprisingly, inverse type inference for mfts, for a fixed output type, can be done within the same complexity as for mtts. Inverse type inference is used in algorithms for exact type checking of XML transformations. The macro tree transducer with holes (hmtt) is a new concept that is introduced in this paper. It generalizes sequence concatenation of mfts to arbitrary tree concatenation. Hmtts are strictly more powerful than mfts, in a similar way as mfts are more powerful than mtts. Again, it comes as a surprise that inverse type inference remains within the same complexity bound as for mfts. Hmtts are a natural and robust extension of mtts: any hmtt can be simulated by an mtt, followed by a so called "YIELD-mapping", and, co...
Sebastian Maneth, Keisuke Nakano
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where PLANX
Authors Sebastian Maneth, Keisuke Nakano
Comments (0)
books