Abstract
A part of a query that will never contribute data to the query answer should be regarded as an error. This principle has been recently accepted into mainstream XML query languages, but was still waiting for a complete treatment. We provide here a precise definition for this class of errors, and define a type system that is sound and complete, in its search for such errors, for a core language, under mild restrictions on the use of recursion in type definitions. In the process, we describe a dichotomy among existential and universal type systems, which is essential to understand some specific features of our type system. © 2006 Cambridge University Press.
Cite
CITATION STYLE
Colazzo, D., Ghelli, G., Manghi, P., & Sartiani, C. (2006). Static analysis for path correctness of XML queries. In Journal of Functional Programming (Vol. 16, pp. 621–661). https://doi.org/10.1017/S0956796806005983
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.