Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/4131

Title: Well-definedness and semantic type-checking for the nested relational calculus
Van Gucht, Dirk
Issue Date: 2007
Citation: THEORETICAL COMPUTER SCIENCE, 371(3). p. 183-199
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.
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
URI: http://hdl.handle.net/1942/4131
DOI: 10.1016/j.tcs.2006.11.007
ISI #: 000244907600005
ISSN: 0304-3975
Category: A1
Type: Journal Contribution
Validation: ecoom, 2008
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A286.14 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.