DBScholar

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
1162
Venue
PODS
Year
1999
Pagerank
5.2041072e-05
Overall Rank
9,878 | 32.23%
DOI
10.1145/303976.303984

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bussche_pods99,
        address = {New York, NY, USA},
        series = {{PODS} '99},
        title = {{Type inference in the polymorphic relational algebra}},
        url = {https://dl.acm.org/doi/10.1145/303976.303984},
        doi = {10.1145/303976.303984},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Van den Bussche, Jan and Waller, Emmanuel},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,178 A Web Odyssey: from Codd to XML 2001 PODS 6.849218e-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