On the public citation graph
Relational semantics for recursive types and bounded quantification
0 signed · 45 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.1007/3-540-06841-4_57openalex-snapshot
On the relation between direct and continuation semantics
inferredcites →https://doi.org/10.1007/3-540-06859-7_148openalex-snapshot
Towards a theory of type structure
inferredcites →https://doi.org/10.1007/3-540-13346-1_13openalex-snapshot
Type inference and type containment
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0015737openalex-snapshot
A completeness theorem for recursively defined types
inferredcites →https://doi.org/10.1016/0304-3975(88)90097-7openalex-snapshot
Extensional models for polymorphism
inferredcites →https://doi.org/10.1016/0890-5401(88)90007-7openalex-snapshot
A semantics of multiple inheritance
inferredcites →https://doi.org/10.1016/0890-5401(88)90009-0openalex-snapshot
Polymorphic type inference and containment
inferredcites →https://doi.org/10.1016/0890-5401(90)90044-iopenalex-snapshot
The semantics of second-order lambda calculus
inferredcites →https://doi.org/10.1016/0890-5401(90)90062-mopenalex-snapshot
A modest model of records, inheritance, and bounded quantification
inferredcites →https://doi.org/10.1016/s0019-9958(86)80019-5openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.1109/lics.1989.39166openalex-snapshot
Inheritance and explicit coercion
inferredcites →https://doi.org/10.1145/365813.365819openalex-snapshot
SIMULA: an ALGOL-based simulation language
inferredcites →https://doi.org/10.1145/6041.6042openalex-snapshot
On understanding types, data abstraction, and polymorphism
inferredcites →https://doi.org/10.1145/73560.73566openalex-snapshot
Structural subtyping and the notion of power type
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1055openalex-snapshot
Bounded Quantification Is Undecidable
inferred← citeshttps://doi.org/10.1006/inco.1999.2802openalex-snapshot
Basic Theory of F-Bounded Quantification
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_5openalex-snapshot
The equivalence of two semantic definitions for inheritance in object-oriented languages
inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_17openalex-snapshot
Logical Semantics for the First Order ς-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_32openalex-snapshot
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
inferred← citeshttps://doi.org/10.1007/s00224-007-9079-5openalex-snapshot
Logical Equivalence for Subtyping Object and Recursive Types
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90024-aopenalex-snapshot
Categorical models of polymorphism
inferred← citeshttps://doi.org/10.1016/j.ic.2004.11.003openalex-snapshot
Subtyping recursion and parametric polymorphism in kernel fun
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00333-9openalex-snapshot
Polymorphic lambda calculus and subtyping
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80491-2openalex-snapshot
Subtyping in Logical Form
inferred← citeshttps://doi.org/10.1017/s0956796800001039openalex-snapshot
A paradigmatic object-oriented programming language: Design, static typing and semantics
inferred← citeshttps://doi.org/10.1017/s0956796800001052openalex-snapshot
Baby Modula-3 and a theory of objects
inferred← citeshttps://doi.org/10.1017/s0960129510000162openalex-snapshot
Realisability semantics of parametric polymorphism, general references and recursive types
inferred← citeshttps://doi.org/10.1017/s096012959600223xopenalex-snapshot
Intersection types and bounded polymorphism
inferred← citeshttps://doi.org/10.1109/lics.1990.113761openalex-snapshot
A PER model of polymorphism and recursive types
inferred← citeshttps://doi.org/10.1109/lics.1999.782605openalex-snapshot
Subtyping recursive types in kernel Fun
inferred← citeshttps://doi.org/10.1145/1190315.1190320openalex-snapshot
Semantics of an effect analysis for exceptions
inferred← citeshttps://doi.org/10.1145/1273920.1273922openalex-snapshot
Formalizing and verifying semantic type soundness of a simple compiler
inferred← citeshttps://doi.org/10.1145/143165.143228openalex-snapshot
Bounded quantification is undecidable
inferred← citeshttps://doi.org/10.1145/143165.143230openalex-snapshot
PER models of subtyping, recursive types and higher-order polymorphism
inferred← citeshttps://doi.org/10.1145/1925844.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferred← citeshttps://doi.org/10.1184/r1/6608684openalex-snapshot
Programming with intersection types, union types, and polymorphism
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.