par Van den Bussche, Jan;Vansummeren, Stijn
Référence Lecture notes in computer science, 8000, page (494-506)
Publication Publié, 2013
Article révisé par les pairs
Résumé : We study the expressive power of the static type system of the Nested Relational Calculus and show that on so-called homogeneous input and output types, the type system is expressively complete: every untyped but homogeneously well-defined expression can be equivalently expressed by a well-typed expression. The static type system hence does not limit the expressive power of the query writer. © 2013 Springer-Verlag Berlin Heidelberg.