Well-definedness and semantic type-checking for the nested relational calculus

DOI10.1016/j.tcs.2006.11.007zbMath1108.68044OpenAlexW1975284402MaRDI QIDQ870267

Stijn Vansummeren, Dirk Van Gucht, Jan Van den Bussche

Publication date: 12 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/4131

zbMATH Keywords

well-definednesscomplex objectsquery equivalencesemantic type-checking

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

The complexity of higher-order queries

Uses Software

• XQuery
• Quilt
• UnQL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Principles of programming with complex objects and collection types
• Frontiers of tractability for typechecking simple XML transformations
• A calculus for complex objects
• Typechecking for XML transformers
• XML with data values: Typechecking revisited.
• Normal forms and conservative extension properties for query languages over collection types
• On deciding well-definedness for query languages on trees
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• Typechecking XML views of relational databases

This page was built for publication: Well-definedness and semantic type-checking for the nested relational calculus