Journal
THEORETICAL COMPUTER SCIENCE
Volume 823, Issue -, Pages 69-99Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2020.03.020
Keywords
XPath; XQuery; Static type system; Type inference; Regular tree types; Mu-calculus
Categories
Funding
- National Research Foundation of Korea (NRF) - Korea government (MSIP) [2016R1C1B1015095]
- ANR project CLEAR [ANR-16-CE25-0010]
- Agence Nationale de la Recherche (ANR) [ANR-16-CE25-0010] Funding Source: Agence Nationale de la Recherche (ANR)
- National Research Foundation of Korea [2016R1C1B1015095] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
Ask authors/readers for more resources
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. (C) 2020 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available