Descriptive typing rules for Xcerpt
2005 (English)In: Proceedings of the Third Workshop on Principles and Practice of Semantic Web Reasoning. Dagstuhl, Germany, 2005, Vol. LNCS 3703, 85-100 p.Conference paper (Refereed)
We present typing rules for the Web query language Xcerpt.
The rules provide a descriptive type system: the typing of a program is an
approximation of its semantics. The rules can also be seen as an abstract
form of a type inference algorithm (presented in previous work), and as a
stage in a formal soundness proof of the algorithm. The paper considers
a substantial fragment of Xcerpt; the main restriction is that we deal
with data terms corresponding to trees (instead of general graphs), and
we do not deal with Xcerpt rule chaining. We provide a formal semantics
for the fragment of Xcerpt and a soundness theorem for the presented
Place, publisher, year, edition, pages
2005. Vol. LNCS 3703, 85-100 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-12914OAI: oai:DiVA.org:liu-12914DiVA: diva2:17388