Backward Type Inference for XML Queries - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2020

Backward Type Inference for XML Queries

(1) , (2) , (2) , (2)
Pierre Genevès
Nils Gesbert
  • Function : Author
  • PersonId : 899056
Nabil Layaïda


Although XQuery is a statically typed, functional query language for XML data, some of its features such as upward and horizontal XPath axes are typed imprecisely. The main reason is that while the XQuery data model allows us to navigate upwards and between siblings from a given XML node, the type model, e.g., regular tree types, can describe only the subtree structure of the given node. To alleviate this limitation, precise forward type inference systems for XQuery were recently proposed using an extended regular type language that can describe not only a given XML node but also its context. In this paper, as a different approach, we propose a novel backward type inference system for XQuery, based on a type language extended with logical formulas. Our backward type inference system provides an exact typing result for XPath axes and a sound typing result for XQuery expressions.
Fichier principal
Vignette du fichier
tcs2020.pdf (798.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01497857 , version 1 (29-03-2017)
hal-01497857 , version 2 (17-01-2019)
hal-01497857 , version 3 (04-05-2020)



Hyeonseung Im, Pierre Genevès, Nils Gesbert, Nabil Layaïda. Backward Type Inference for XML Queries. Theoretical Computer Science, 2020, Theoretical Computer Science, 823, pp.69 - 99. ⟨10.1016/j.tcs.2020.03.020⟩. ⟨hal-01497857v3⟩
326 View
277 Download



Gmail Facebook Twitter LinkedIn More