On types for XML query language Xcerpt
2003 (English)In: Principles and Practice of Semantic Web Reasoning: International Workshop, PPSWR 2003, Mumbai, India, December 8, 2003. Proceedings / [ed] François Bry, Nicola Henze, Jan Małuszyński, Springer Berlin/Heidelberg, 2003, Vol. 2901, 128-145 p.Conference paper (Refereed)
Our intention is to provide a type system for rule languages used in web applications. In this work we deal with an XML query language Xcerpt. Our types are sets of documents. We represent XML data as so called data terms and propose a formalism to define sets of data terms. The formalism is a generalization of tree automata, the defined sets roughly correspond to sets of documents definable by means of XML schema languages, like DTD and XML Schema. The main contribution of this paper is an algorithm for computing the type of possible results of an Xcerpt rule, given the type of the database. The algorithm can be used to automatically check correctness of Xcerpt programs with respect to type specifications. For non recursive Xcerpt programs it can also be used to compute the type of program results.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2003. Vol. 2901, 128-145 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 2901
Language Technology (Computational Linguistics)
IdentifiersURN: urn:nbn:se:liu:diva-48429DOI: 10.1007/978-3-540-24572-8_9ISI: 000188097100009ISBN: 978-3-540-20582-1 (print)ISBN: 978-3-540-24572-8 (online)ISBN: 3-540-20582-9OAI: oai:DiVA.org:liu-48429DiVA: diva2:269325
International Workshop, PPSWR 2003, Mumbai, India, December 8, 2003