On the public citation graph

Recursive types are not conservative over F≤

0 signed · 36 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.1006/inco.1994.1013openalex-snapshot

An Extension of System F with Subtyping

inferredcites →https://doi.org/10.1006/inco.1994.1055openalex-snapshot

Bounded Quantification Is Undecidable

inferredcites →https://doi.org/10.1007/3-540-52590-4_45openalex-snapshot

Coherence of subsumption

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.1017/s0960129500001134openalex-snapshot

Coherence of subsumption, minimum typing and type-checking in F ≤

inferredcites →https://doi.org/10.1145/143165.143228openalex-snapshot

Bounded quantification is undecidable

inferredcites →https://doi.org/10.1145/6041.6042openalex-snapshot

On understanding types, data abstraction, and polymorphism

inferredcites →https://doi.org/10.1145/91556.91586openalex-snapshot

A semantic basis for quest

inferredcites →https://doi.org/10.1145/99583.99600openalex-snapshot

Subtyping recursive types

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.1006/inco.1999.2829openalex-snapshot

Comparing Object Encodings

inferred← citeshttps://doi.org/10.1006/inco.2001.3128openalex-snapshot

Dependent Types with Subtyping and Late-Bound Overloading

inferred← citeshttps://doi.org/10.1007/3-540-57887-0_91openalex-snapshot

Extensions to type systems can preserve operational equivalences

inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_24openalex-snapshot

Subtyping First-Class Polymorphic Components

inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_11openalex-snapshot

IsoLATE: A Type System for Self-recursion

inferred← citeshttps://doi.org/10.1007/bfb0014561openalex-snapshot

Comparing object encodings

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00037-jopenalex-snapshot

Divergence of F⩽ type checking

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/j.tcs.2006.03.017openalex-snapshot

Logic of subtyping

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00096-5openalex-snapshot

Higher-order subtyping

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00300-3openalex-snapshot

Bounded existentials and minimal typing

inferred← citeshttps://doi.org/10.1017/s0956796802004318openalex-snapshot

Recursive subtyping revealed

inferred← citeshttps://doi.org/10.1017/s0956796825000036openalex-snapshot

Recursive subtyping for all

inferred← citeshttps://doi.org/10.1017/s096012959600223xopenalex-snapshot

Intersection types and bounded polymorphism

inferred← citeshttps://doi.org/10.1109/lics.1999.782605openalex-snapshot

Subtyping recursive types in kernel Fun

inferred← citeshttps://doi.org/10.1109/lics.2001.932508openalex-snapshot

A symbolic labelled transition system for coinductive subtyping of F/sub μ≤/ types

inferred← citeshttps://doi.org/10.1145/1040305.1040309openalex-snapshot

A simple typed intermediate language for object-oriented languages

inferred← citeshttps://doi.org/10.1145/174675.177844openalex-snapshot

Decidable bounded quantification

inferred← citeshttps://doi.org/10.1145/232627.232643openalex-snapshot

Complexity of kernel Fun subtype checking

inferred← citeshttps://doi.org/10.1145/3428291openalex-snapshot

Revisiting iso-recursive subtyping

inferred← citeshttps://doi.org/10.1145/351240.351261openalex-snapshot

Recursive subtyping revealed

inferred← citeshttps://doi.org/10.1145/357766.351261openalex-snapshot

Recursive subtyping revealed

inferred← citeshttps://doi.org/10.1145/3689718openalex-snapshot

Full Iso-Recursive Types

inferred← citeshttps://doi.org/10.1145/3704869openalex-snapshot

QuickSub: Efficient Iso-Recursive Subtyping

inferred← citeshttps://doi.org/10.1145/949305.949316openalex-snapshot

A first-class approach to genericity

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.