Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/16404| Title: | Well-defined NRC queries can be typed | Authors: | VAN DEN BUSSCHE, Jan VANSUMMEREN, Stijn |
Issue Date: | 2013 | Publisher: | Springer | Source: | In Search of Elegance in the Theory and Practice of Computation: Essays Dedicated to Peter Buneman , p. 494-506 | Series/Report: | Lecture Notes in Computer Science | Series/Report no.: | 8000 | Abstract: | We study the expressive power of the static type system of the Nested Relational Calculus TeX and show that on so-called homogeneous input and output types, the TeX type system is expressively complete: every untyped but homogeneously well-defined TeX expression can be equivalently expressed by a well-typed expression. The TeX static type system hence does not limit the expressive power of the query writer. | Document URI: | http://hdl.handle.net/1942/16404 | Link to publication/dataset: | http://alpha.uhasselt.be/~lucp1080/pbf14.pdf | ISBN: | 978-3-642-41659-0 | DOI: | 10.1007/978-3-642-41660-6_27 | Rights: | Springer-Verlag Berlin Heidelberg | Category: | A1 | Type: | Book Section |
| Appears in Collections: | Research publications |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nrc.pdf Restricted Access | Published version | 228.8 kB | Adobe PDF | View/Open Request a copy |
| pbf14.pdf | Peer-reviewed author version | 350.55 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.