On the public citation graph
Decidability of higher-order subtyping with intersection types
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0890-5401(88)90007-7openalex-snapshot
A semantics of multiple inheritance
inferredcites →https://doi.org/10.1017/s0956796800001040openalex-snapshot
Simple type-theoretic foundations for object-oriented programming
inferredcites →https://doi.org/10.1017/s0960129500001134openalex-snapshot
Coherence of subsumption, minimum typing and type-checking in F ≤
inferredcites →https://doi.org/10.1145/143165.143230openalex-snapshot
PER models of subtyping, recursive types and higher-order polymorphism
inferredcites →https://doi.org/10.1145/174675.177844openalex-snapshot
Decidable bounded quantification
inferredcites →https://doi.org/10.1145/6041.6042openalex-snapshot
On understanding types, data abstraction, and polymorphism
inferredcites →https://doi.org/10.1145/96709.96719openalex-snapshot
Toward a typed foundation for method specialization and inheritance
inferredcites →https://doi.org/10.1145/99370.99392openalex-snapshot
F-bounded polymorphism for object-oriented programming
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.5860/choice.32-3941openalex-snapshot
Theoretical aspects of object-oriented programming: types, semantics, and language design
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48743-3_8openalex-snapshot
Foundations for Virtual Types
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_32openalex-snapshot
Syntactic Metatheory of Higher-Order Subtyping
inferred← citeshttps://doi.org/10.1007/bfb0054104openalex-snapshot
An imperative, first-order calculus with object extension
inferred← citeshttps://doi.org/10.1016/j.ic.2004.01.001openalex-snapshot
Higher-order subtyping and its decidability
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00175-4openalex-snapshot
Subtyping dependent types
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00062-2openalex-snapshot
Typed operational semantics for higher-order subtyping
inferred← citeshttps://doi.org/10.1017/s0956796800001490openalex-snapshot
A unifying type-theoretic framework for objects
inferred← citeshttps://doi.org/10.1017/s0960129500070043openalex-snapshot
Higher-order intersection types and multiple inheritance
inferred← citeshttps://doi.org/10.1017/s096012959600223xopenalex-snapshot
Intersection types and bounded polymorphism
inferred← citeshttps://doi.org/10.1145/232627.232643openalex-snapshot
Complexity of kernel Fun subtype checking
inferred← citeshttps://doi.org/10.1145/3473574openalex-snapshot
A theory of higher-order subtyping with type intervals
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c020openalex-snapshot
Intersection Types, $\lambda$-models, and Böhm Trees
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.