Well-definedness and semantic type-checking for the nested relational calculus
type: Item
instance of: scholarly article
title: Well-definedness and semantic type-checking for the nested relational calculus
zbMATH Open document ID: 1108.68044
author: Jan Van den Bussche
author: D. Van Gucht
author: Stijn Vansummeren
published in: Theoretical Computer Science
publication date: 2007-03-12T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/4131
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5132994
zbMATH Keywords: complex objects
zbMATH Keywords: query equivalence
zbMATH Keywords: semantic type-checking
zbMATH Keywords: well-definedness
describes a project that uses: Quilt
describes a project that uses: UnQL
describes a project that uses: XQuery
MaRDI profile type: Publication
OpenAlex ID: W1975284402
cites work: Q4864249
cites work: Typechecking XML views of relational databases
cites work: XML with data values: Typechecking revisited.
cites work: A calculus for complex objects
cites work: Principles of programming with complex objects and collection types
cites work: The Implication Problem for Functional and Inclusion Dependencies is Undecidable
cites work: Q4414526
cites work: Frontiers of tractability for typechecking simple XML transformations
cites work: Typechecking for XML transformers
cites work: Types and programing languages
cites work: Q5714247
cites work: On deciding well-definedness for query languages on trees
cites work: Normal forms and conservative extension properties for query languages over collection types
DOI: 10.1016/J.TCS.2006.11.007
description: scientific article; zbMATH DE number 5132994