DBScholar

Back to papers

Untyped Sets, Invention, and Computable Queries

Summary: Over untyped sets, set algebra without while is equivalent to the typed complex-object algebra; with while (or COL under stratified/inflationary semantics) it captures exactly the computable queries. Exhibits a calculus beyond computable queries, characterizes it via a typed complex-object calculus with invention, and introduces a "generic Turing machine" technical tool. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
878
Venue
PODS
Year
1989
Pagerank
8.6299917e-05
Overall Rank
2,400 | 83.54%
DOI
10.1145/73721.73755

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{hull_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Untyped Sets, Invention, and Computable Queries}},
        url = {https://dl.acm.org/doi/10.1145/73721.73755},
        doi = {10.1145/73721.73755},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Hull, Richard and Su, Jianwen},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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