Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7735
Title: Polymorphic Type Inference For The Named Nested Relational Calculus
Authors: VAN DEN BUSSCHE, Jan 
VANSUMMEREN, Stijn 
Issue Date: 2007
Publisher: ACM
Source: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 9(1). p. 3-...
Abstract: The named nested relational calculus is the canonical query language for the complex object database model and is equipped with a natural static type system. Given an expression in the language, without type declarations for the input variables, there is the problem of whether there are any input type declarations under which the expression is well-typed. Moreover, if there are, then which are they, and what is the corresponding output type for each of these? This problem is solved by a logic-based approach, and the decision problem is shown to be NP-complete.
Keywords: Type inference, typability, complexity, named nested relational calculus, computer science
Document URI: http://hdl.handle.net/1942/7735
Link to publication: http://doi.acm.org/10.1145/1297658.1297661
ISSN: 1529-3785
e-ISSN: 1557-945X
ISI #: 000252154100003
Category: A1
Type: Journal Contribution
Validations: ecoom 2009
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
infernrc.pdfPreprint257.42 kBAdobe PDFView/Open
Show full item record

WEB OF SCIENCETM
Citations

1
checked on May 14, 2022

Page view(s)

72
checked on May 19, 2022

Download(s)

106
checked on May 19, 2022

Google ScholarTM

Check


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