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.
| Original language | English |
|---|---|
| Pages (from-to) | 621-661 |
| Number of pages | 41 |
| Journal | Journal of Functional Programming |
| Volume | 16 |
| Issue number | 4-5 |
| DOIs | |
| Publication status | Published - 1 Jul 2006 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Static analysis for path correctness of XML queries'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver