Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/714
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.contributor.author | Waller, Emmanuel | - |
dc.date.accessioned | 2005-04-12T08:16:22Z | - |
dc.date.available | 2005-04-12T08:16:22Z | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | Journal of Computer and System Sciences, 64(3). p. 694-718 | - |
dc.identifier.issn | 0022-0000 | - |
dc.identifier.uri | http://hdl.handle.net/1942/714 | - |
dc.description.abstract | We give a polymorphic account of the relational algebra. We introduce a formalism of "type formulas" specifically tuned for relational algebra expressions, and present an algorithm that computes the "principal" type for a given expression. The principal type of an expression is a formula that specifies, in a clear and concise manner, all assignments of types (sets of attributes) to relation names, under which a given relational algebra expression is well-typed, as well as the output type that expression will have under each of these assignments. Topics discussed include complexity and polymorphic expressive power. | - |
dc.format.extent | 232634 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier | - |
dc.title | Polymorphic type inference for the relational algebra | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 718 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 694 | - |
dc.identifier.volume | 64 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1006/jcss.2001.1812 | - |
dc.identifier.isi | 000176291700009 | - |
item.fulltext | With Fulltext | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.contributor | Waller, Emmanuel | - |
item.fullcitation | VAN DEN BUSSCHE, Jan & Waller, Emmanuel (2002) Polymorphic type inference for the relational algebra. In: Journal of Computer and System Sciences, 64(3). p. 694-718. | - |
item.accessRights | Closed Access | - |
item.validation | ecoom 2003 | - |
crisitem.journal.issn | 0022-0000 | - |
crisitem.journal.eissn | 1090-2724 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
polymorphic.pdf | 227.18 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.