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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
