Database Paper Browser

Back to papers

Type inference in the polymorphic relational algebra

Summary: Polymorphic typing for relational algebra via bespoke "type formulas" and an algorithm that computes an expression's principal type. The principal type concisely characterizes all attribute-set assignments making the expression well-typed and its output schema; includes complexity and monadic-logic/polymorphism analysis. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1163
Venue
PODS
Year
1999
Pagerank
4.3074872e-05
Overall Rank
9,669 | 32.74%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,010 A Web Odyssey: from Codd to XML 2001 PODS 6.5351699e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers