Types for path correctness of XML queries

  • Authors:
  • Dario Colazzo;Giorgio Ghelli;Paolo Manghi;Carlo Sartiani

  • Affiliations:
  • Università di Pisa, Pisa, Italy;Università di Pisa, Pisa, Italy;Università di Pisa, Pisa, Italy;Università di Pisa, Pisa, Italy

  • Venue:
  • Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

If a subexpression in a query will never contribute data to the query answer, this 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 useful to understand some unusual features of our type system.