Abstract
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.
Cite
CITATION STYLE
Van Den Bussche, J., & Vansummeren, S. (2013). Well-defined NRC queries can be typed (Extended Abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8000, 494–506. https://doi.org/10.1007/978-3-642-41660-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
