Static analysis for path correctness of XML queries

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

  • Affiliations:
  • Laboratoire de Recherche en Informatique (LRI), Bat 490 Université Paris Sud, 91405 Orsay Cedex, France (e-mail: dario.colazzo@lri.fr);Dipartimento di Informatica – Università di Pisa, Largo B. Pontecorvo 3, Pisa, Italy (e-mail: ghelli@di.unipi.it, manghi@di.unipi.it, sartiani@di.unipi.it);Dipartimento di Informatica – Università di Pisa, Largo B. Pontecorvo 3, Pisa, Italy (e-mail: ghelli@di.unipi.it, manghi@di.unipi.it, sartiani@di.unipi.it);Dipartimento di Informatica – Università di Pisa, Largo B. Pontecorvo 3, Pisa, Italy (e-mail: ghelli@di.unipi.it, manghi@di.unipi.it, sartiani@di.unipi.it)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.