Show simple item record

Proceedings of the 17th European Symposium on Programming (ESOP 2008)

dc.contributor.authorCheney, James
dc.date.accessioned2011-01-17T14:48:58Z
dc.date.available2011-01-17T14:48:58Z
dc.date.issued2008en
dc.identifier.isbn978-3-540-78738-9en
dc.identifier.urihttp://portal.acm.org/citation.cfm?id=1792882en
dc.identifier.urihttp://hdl.handle.net/1842/4606
dc.description.abstractXML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be equivalent: a declarative version in which the subsumption rule may be used anywhere, and an algorithmic version in which the use of subsumption is limited in order to make typechecking syntax-directed and decidable. However, the XQuery standard type system circumvents this issue by using imprecise typing rules for iteration constructs and defining only algorithmic typechecking, and another extant proposal provides more precise types for iteration constructs but ignores subtyping. In this paper, we consider a core XQuery-like language with a subsumption rule and prove the completeness of algorithmic typechecking; this is straightforward for XQuery proper but requires some care in the presence of more precise iteration typing disciplines. We extend this result to an XML update language we have introduced in earlier work.en
dc.language.isoenen
dc.titleRegular Expression Subtyping for XML Query and Update Languagesen
dc.typeConference Paperen
dc.identifier.doi10.1007/978-3-540-78739-6_3en
rps.titleProceedings of the 17th European Symposium on Programming (ESOP 2008)en
dc.extent.noOfPages32-47en
dc.date.updated2011-01-17T14:48:58Z
dc.date.openingDate2008-03-29
dc.date.closingDate2008-04-06


Files in this item

This item appears in the following Collection(s)

Show simple item record