CoDE Publications CoDE Publications
IRIDIA Publications IRIDIA Publications
SMG Publications
WIT Publications
WIT Publications
SMG Publications
Home People Research Activities Publications Teaching Resources
By Class By Topic By Year Technical Reports
By Class By Topic By Year Technical Reports
login
J. Van den Bussche and S. Vansummeren. Well-Defined NRC Queries Can Be Typed - (Extended Abstract). In In Search of Elegance in the Theory and Practice of Computation, volume 8000 of Lecture Notes in Computer Science, pages 494-506. Springer, 2013.

Abstract

We study the expressive power of the static type system of the Nested Relational Calculus NRC and show that on so-called homogeneous input and output types, the NRC type system is expressively complete: every untyped but homogeneously well-defined NRC expression can be equivalently expressed by a well-typed expression. The NRC static type system hence does not limit the expressive power of the query writer.


Updated: 2017-03-27