We study the typechecking problem for XML transformers: given an XML transformation
program and a DTD for the input XML documents, check whether every result of the program …

We investigate the typechecking problem for XML queries: statically verifying that every
answer to a query conforms to a given output schema, for inputs satisfying a given input …

Typechecking consists of statically verifying whether the output of an XML transformation is
always conform to an output type for documents satisfying a given input type. We focus on …

We investigate the type checking problem for XML queries: statically verifying that every
answer to a query conforms to a given output DTD, for inputs satisfying a given input DTD …

MSO logic on unranked trees has been identified as a convenient theoretical framework for
reasoning about expressiveness and implementations of practical XML query languages. As …

XDuce is a statically typed programming language for XML processing. Its basic data values
are XML documents, and its types (so-called regular expression types) directly correspond …

We propose regular expression types as a foundation for statically typed XML processing
languages. Regular expression types, like most schema languages for XML, introduce …

Among the reasons for the popularity of XML is the hope that the static typing provided by
DTDs [XML](or more sophisticated mechanisms such as XML-Schema [XS00]) will improve …

This document proposes an algebra for XML Query. The algebra has been submitted to the
W3CXM L Query Working Group. A novel feature of the algebra is the use of regular …

XML documents, and other forms of semi-structured data, may be roughly described as edge
labeled trees; it is therefore natural to use tree automata to reason on them. This idea has …