Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/4131
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.contributor.author | Van Gucht, Dirk | - |
dc.contributor.author | VANSUMMEREN, Stijn | - |
dc.date.accessioned | 2007-12-11T08:36:37Z | - |
dc.date.available | 2007-12-11T08:36:37Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | THEORETICAL COMPUTER SCIENCE, 371(3). p. 183-199 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | http://hdl.handle.net/1942/4131 | - |
dc.description.abstract | The well-definedness problem for a programming language consists of checking, given an expression and an input type, whether the semantics of the expression is defined for all inputs adhering to the input type. A related problem is the semantic type-checking problem which consists of checking, given an expression, an input type, and an output type whether the expression always returns outputs adhering to the output type on inputs adhering to the input type. Both problems are undecidable for general-purpose programming languages. In this paper we study these problems for the Nested Relational Calculus, a specific-purpose database query language. We also investigate how these problems behave in the presence of prograrruning language features such as singleton coercion and type tests. (c) 2006 Elsevier B.V. All rights reserved. | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject.other | complex objects; query equivalence; semantic type-checking; well-definedness | - |
dc.title | Well-definedness and semantic type-checking for the nested relational calculus | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 199 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 183 | - |
dc.identifier.volume | 371 | - |
local.format.pages | 17 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Hasselt Univ, B-3590 Diepenbeek, Belgium. Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium. Indiana Univ, Dept Comp Sci, Bloomington, IN 47405 USA.VAN DEN BUSSCHE, J, Hasselt Univ, Gebouw D, B-3590 Diepenbeek, Belgium.jan.vandenbussche@uhasselt.be vgucht@cs.indiana.edu stijn.vansummeren@uhasselt.be | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1016/j.tcs.2006.11.007 | - |
dc.identifier.isi | 000244907600005 | - |
item.accessRights | Open Access | - |
item.validation | ecoom 2008 | - |
item.fulltext | With Fulltext | - |
item.fullcitation | VAN DEN BUSSCHE, Jan; Van Gucht, Dirk & VANSUMMEREN, Stijn (2007) Well-definedness and semantic type-checking for the nested relational calculus. In: THEORETICAL COMPUTER SCIENCE, 371(3). p. 183-199. | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.contributor | Van Gucht, Dirk | - |
item.contributor | VANSUMMEREN, Stijn | - |
crisitem.journal.issn | 0304-3975 | - |
crisitem.journal.eissn | 1879-2294 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
0406060v1.pdf | 286.14 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
7
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
6
checked on Apr 22, 2024
Page view(s)
92
checked on Jun 14, 2023
Download(s)
150
checked on Jun 14, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.