On the public citation graph

Polymorphic Type Inference for the Relational Algebra

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-51486-4openalex-snapshot
Mathematical Foundations of Computer Science 1989
inferredcites →https://doi.org/10.1007/3-540-62222-5_55openalex-snapshot
Adding structure to unstructured data
inferredcites →https://doi.org/10.1007/bfb0022159openalex-snapshot
Advances in Database Technology — EDBT '90
inferredcites →https://doi.org/10.1007/bfb0022176openalex-snapshot
Exceeding the limits of polymorphism in database programming languages
inferredcites →https://doi.org/10.1007/bfb0029599openalex-snapshot
Type inference problems: A survey
inferredcites →https://doi.org/10.1016/0950-5849(89)90041-4openalex-snapshot
Foundations of programming languages
inferredcites →https://doi.org/10.1016/s0898-1221(97)80228-3openalex-snapshot
Basic simple type theory
inferredcites →https://doi.org/10.1017/cbo9780511608865openalex-snapshot
Basic Simple Type Theory
inferredcites →https://doi.org/10.1023/a:1008683107812openalex-snapshot
The TSIMMIS Approach to Mediation: Data Models and Languages
inferredcites →https://doi.org/10.1145/227604.227609openalex-snapshot
Polymorphism and type inference in database programming
inferredcites →https://doi.org/10.1145/233269.233368openalex-snapshot
A query language and optimization techniques for unstructured data
inferredcites →https://doi.org/10.1145/235968.233368openalex-snapshot
A query language and optimization techniques for unstructured data
inferredcites →https://doi.org/10.1145/66926.66931openalex-snapshot
Database programming in Machiavelli—a polymorphic language with static type inference
inferredcites →https://doi.org/10.3233/fi-1993-191-205openalex-snapshot
Type Inference: Some Results, Some Problems1
inferredcites →https://doi.org/10.5860/choice.34-3356openalex-snapshot
Foundations for programming languages

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_16openalex-snapshot
Elucidating Type Conversions in SQL Engines
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_8openalex-snapshot
Towards a Type Discipline for Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-23441-5_3openalex-snapshot
Types and Constraints: From Relational to XML Data
inferred← citeshttps://doi.org/10.1007/s00236-005-0162-6openalex-snapshot
On the complexity of deciding typability in the relational algebra
inferred← citeshttps://doi.org/10.1007/s11047-020-09839-7openalex-snapshot
DNAQL: a query language for DNA sticker complexes
inferred← citeshttps://doi.org/10.1016/j.ic.2015.07.003openalex-snapshot
The complexity of higher-order queries
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.11.008openalex-snapshot
Relational lattices: From databases to universal algebra
inferred← citeshttps://doi.org/10.1109/cascon66301.2025.00048openalex-snapshot
Semantic Relational Types of SQL Queries and Applications to AI Agent Tool Selection
inferred← citeshttps://doi.org/10.1145/1017472.1017488openalex-snapshot
Strongly typed heterogeneous collections
inferred← citeshttps://doi.org/10.1145/1071610.1071618openalex-snapshot
Relational languages for metadata integration
inferred← citeshttps://doi.org/10.1145/1265530.1265551openalex-snapshot
A crash course on database queries
inferred← citeshttps://doi.org/10.1145/1297658.1297661openalex-snapshot
Polymorphic type inference for the named nested relational calculus
inferred← citeshttps://doi.org/10.1145/2429069.2429083openalex-snapshot
Static and dynamic semantics of NoSQL languages
inferred← citeshttps://doi.org/10.1145/3779650openalex-snapshot
The Relational Completeness of the DNA Query Language DNAQL
inferred← citeshttps://doi.org/10.1145/3834861openalex-snapshot
A Formal Framework for Typing and Cast Semantics in SQL Engines
inferred← citeshttps://doi.org/10.5287/ora-pp0apyvb2openalex-snapshot
Higher-order queries and applications
inferred← citeshttps://doi.org/10.70675/1876c5a1zfde6z4d34zbfd6zabc069799fa8openalex-snapshot
Breaking boundaries between programming languages and databases
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.