Polymorphic type inference for the relational algebra

Details Polymorphic type inference for the relational algebra Polymorphic type inference for the relational algebra

2001-06-14

arxiv.org/abs/cs/0106035v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polymorphic type inference for the relational algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polymorphic type inference for the relational algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polymorphic type inference for the relational algebra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275682