Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/16404
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorVANSUMMEREN, Stijn-
dc.date.accessioned2014-03-13T10:31:40Z-
dc.date.available2014-03-13T10:31:40Z-
dc.date.issued2013-
dc.identifier.citationIn Search of Elegance in the Theory and Practice of Computation: Essays Dedicated to Peter Buneman , p. 494-506-
dc.identifier.isbn978-3-642-41659-0-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/1942/16404-
dc.description.abstractWe 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.-
dc.language.isoen-
dc.publisherSpringer-
dc.relation.ispartofseriesLecture Notes in Computer Science-
dc.rightsSpringer-Verlag Berlin Heidelberg-
dc.titleWell-defined NRC queries can be typed-
dc.typeBook Section-
local.bibliographicCitation.authorsTannen, Val-
local.bibliographicCitation.authorsWong, Limsoon-
local.bibliographicCitation.authorsLibkin, Leonid-
local.bibliographicCitation.authorsFan, Wenfei-
local.bibliographicCitation.authorsTan, Wang-Chiew-
local.bibliographicCitation.authorsFourman, Michael-
dc.identifier.epage506-
dc.identifier.spage494-
dc.identifier.volume8000-
local.bibliographicCitation.jcatA1-
local.publisher.placeBerlin - Heidelberg-
dc.relation.referencesBarendregt, H.: The Lambda Calculus: its Syntax and Semantics. North-Holland (1984) Buneman, P., Davidson, S., Watters, A.: A semantics for complex objects and approximate answers. J. Comput. Syst. Sci. 43(1), 170–218 (1991) Buneman, P., Frankel, R., Nikhil, R.: An implementation technique for database query languages. ACM Trans. Database Syst. 7(2), 164–186 (1982) Buneman, P., Naqvi, S.A., Tannen, V., Wong, L.: Principles of programming with complex objects and collection types. Theor. Comput. Sci. 149(1), 3–48 (1995) Buneman, P., Pierce, B.: Union types for semistructured data. In: Connor, R., Mendelzon, A. (eds.) DBPL 1999. LNCS, vol. 1949, pp. 184–207. Springer, Heidelberg (2000) Kahrs, S.: Limits of ML-definability. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 17–31. Springer, Heidelberg (1996) Kahrs, S.: Well-going programs can be typed. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 167–179. Springer, Heidelberg (2003) Ohori, A., Buneman, P.: Polymorphism and type inference in database programming. ACM Trans. Database Syst. 21(1), 30–76 (1996) Ohori, A., Buneman, P., Breazu-Tannen, V.: Database programming in Machiavelli—a polymorphic language with static type inference. In: Clifford, J., Lindsay, B., Maier, D. (eds.) Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data. SIGMOD Record, vol. 18(2), pp. 46–57. ACM Press (1989) Schwichtenberg, H.: Definierbare funktionen in λ-kalkül mit typen. Archiv für Mathematische Logik und Grundlagenforschung 174, 113–114 (1976) Van den Bussche, J., Van Gucht, D., Vansummeren, S.: A crash course on database queries. In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 143–154. ACM (2007) Van den Bussche, J., Van Gucht, D., Vansummeren, S.: Well-definedness and semantic type-checking for the nested relational calculus. Theor. Comput. Sci. 371(3), 183–199 (2007) Wong, L.: Querying Nested Collections. PhD thesis, University of Pennsylvania (1994)-
local.type.refereedRefereed-
local.type.specifiedBook Section-
local.relation.ispartofseriesnr8000-
dc.identifier.doi10.1007/978-3-642-41660-6_27-
dc.identifier.urlhttp://alpha.uhasselt.be/~lucp1080/pbf14.pdf-
local.bibliographicCitation.btitleIn Search of Elegance in the Theory and Practice of Computation: Essays Dedicated to Peter Buneman-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorVANSUMMEREN, Stijn-
item.accessRightsOpen Access-
item.fullcitationVAN DEN BUSSCHE, Jan & VANSUMMEREN, Stijn (2013) Well-defined NRC queries can be typed. In: In Search of Elegance in the Theory and Practice of Computation: Essays Dedicated to Peter Buneman , p. 494-506.-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
nrc.pdf
  Restricted Access		Published version228.8 kBAdobe PDFView/Open    Request a copy
pbf14.pdfPeer-reviewed author version350.55 kBAdobe PDFView/Open
Show simple item record

Page view(s)

58
checked on Sep 7, 2022

Download(s)

188
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.