Polymorphic type inference for the relational algebra
| dc.creator | Bussche, Jan Van den | |
| dc.creator | Waller, Emmanuel | |
| dc.date | 2001-06-14 | |
| dc.date.accessioned | 2026-07-07T03:17:15Z | |
| dc.date.available | 2026-07-07T03:17:15Z | |
| dc.description | 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.identifier | https://arxiv.org/abs/cs/0106035 | |
| dc.identifier | http://arxiv.org/abs/cs/0106035 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30654 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Databases | |
| dc.subject | D.3.3, H.2.3 | |
| dc.title | Polymorphic type inference for the relational algebra | |
| dc.type | text |