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

Title:
Well-definedness and semantic type-checking for the nested relational calculus
Authors:
VAN DEN BUSSCHE, Jan, VAN GUCHT, Dirk, VANSUMMEREN, Stijn
Source:
Database theoryTheoretical computer science. 371(3):183-199
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 23 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Informatique théorique, Computer theory, Informática teórica, Interrogation base donnée, Database query, Interrogación base datos, Langage base donnée, Database languages, Langage interrogation, Query language, Lenguaje interrogación, Langage programmation, Programming language, Lenguaje programación, Requête, Query, Pregunta documental, Sémantique, Semantics, Semántica, Equivalence requête, Query equivalence, Objet complexe, Complex object, Type-vérification sémantique, Semantic type-checking, Complex objects, Well-definedness
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Hasselt University and Transnational University of Limburg, Agoralaan, Gebouw D, 3590 Diepenbeek, Belgium
Indiana University, Computer Science Department, Lindley Hall 215. 150 S. Woodlawn Ave, Bloomington. IN 47405-710, United States
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18568765
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18568765
Database:
PASCAL Archive

Weitere Informationen

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 programming language features such as singleton coercion and type tests.