Backward type inference for XML queries

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

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.

키워드

XPathXQueryStatic type systemType inferenceRegular tree typesMu-calculusTYPECHECKINGXPATH
제목
Backward type inference for XML queries
저자
Im, HyeonseungGeneves, PierreGesbert, NilsLayaida, Nabil
DOI
10.1016/j.tcs.2020.03.020
발행일
2020-07-02
유형
Article
저널명
Theoretical Computer Science
823
페이지
69 ~ 99