On the public citation graph

Consistent Subtyping for All

https://doi.org/10.1145/3310339
0 signed · 56 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-46425-5_15openalex-snapshot
Type Classes with Functional Dependencies
inferredcites →https://doi.org/10.1007/3-540-54415-1_70openalex-snapshot
The coherence of languages with intersection types
inferredcites →https://doi.org/10.1007/978-3-540-73589-2_2openalex-snapshot
Gradual Typing for Objects
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_1openalex-snapshot
Well-Typed Programs Can’t Be Blamed
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_2openalex-snapshot
Exploring the Design Space of Higher-Order Casts
inferredcites →https://doi.org/10.1007/978-3-642-14107-2_5openalex-snapshot
Adding Dynamic Types to C $^\sharp$
inferredcites →https://doi.org/10.1007/978-3-662-44202-9_11openalex-snapshot
Understanding TypeScript
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_4openalex-snapshot
Practical Optional Types for Clojure
inferredcites →https://doi.org/10.1007/b102225openalex-snapshot
Programming languages and systems : Second Asian Symposium, APLAS 2004, Taipei, Taiwan, November 4-6, 2004 : proceedings
inferredcites →https://doi.org/10.1016/0304-3975(92)90042-eopenalex-snapshot
Recursive programming with proofs
inferredcites →https://doi.org/10.1016/0890-5401(88)90009-0openalex-snapshot
Polymorphic type inference and containment
inferredcites →https://doi.org/10.1016/s0168-0072(98)00047-5openalex-snapshot
Typability and type checking in System F are equivalent and undecidable
inferredcites →https://doi.org/10.1017/s095679680000126xopenalex-snapshot
Dynamic typing in polymorphic languages
inferredcites →https://doi.org/10.1017/s0956796802004355openalex-snapshot
Faking it Simulating dependent types in Haskell
inferredcites →https://doi.org/10.1017/s0956796806006034openalex-snapshot
Practical type inference for arbitrary-rank types
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0253905-6openalex-snapshot
The principle type-scheme of an object in combinatory logic
inferredcites →https://doi.org/10.1145/1017472.1017488openalex-snapshot
Strongly typed heterogeneous collections
inferredcites →https://doi.org/10.1145/1297081openalex-snapshot
Proceedings of the 2007 symposium on Dynamic languages
inferredcites →https://doi.org/10.1145/1408681.1408688openalex-snapshot
Gradual typing with unification-based inference
inferredcites →https://doi.org/10.1145/1411204.1411216openalex-snapshot
From ML to ML F
inferredcites →https://doi.org/10.1145/1411204.1411246openalex-snapshot
FPH
inferredcites →https://doi.org/10.1145/1480881.1480891openalex-snapshot
Flexible types
inferredcites →https://doi.org/10.1145/1596550.1596572openalex-snapshot
Non-parametric parametricity
inferredcites →https://doi.org/10.1145/1925844.1926409openalex-snapshot
Blame for all
inferredcites →https://doi.org/10.1145/1926385.1926409openalex-snapshot
Blame for all
inferredcites →https://doi.org/10.1145/2364527.2364554openalex-snapshot
Equality proofs and deferred type errors
inferredcites →https://doi.org/10.1145/237721.237729openalex-snapshot
Putting type annotations to work
inferredcites →https://doi.org/10.1145/2500365.2500582openalex-snapshot
Complete and easy bidirectional typechecking for higher-rank polymorphism
inferredcites →https://doi.org/10.1145/2628136.2628149openalex-snapshot
A theory of gradual effect systems
inferredcites →https://doi.org/10.1145/2661088.2661101openalex-snapshot
Design and evaluation of gradual typing for python
inferredcites →https://doi.org/10.1145/2676726.2676992openalex-snapshot
Principal Type Schemes for Gradual Programs
inferredcites →https://doi.org/10.1145/2775052.2661101openalex-snapshot
Design and evaluation of gradual typing for python
inferredcites →https://doi.org/10.1145/2837614.2837632openalex-snapshot
The gradualizer: a methodology and algorithm for generating gradual type systems
inferredcites →https://doi.org/10.1145/2837614.2837670openalex-snapshot
Abstracting gradual typing
inferredcites →https://doi.org/10.1145/3009837.3009863openalex-snapshot
Automatically generating the dynamic semantics of gradually typed languages
inferredcites →https://doi.org/10.1145/3009837.3009865openalex-snapshot
Sums of uncertainty: refinements go gradual
inferredcites →https://doi.org/10.1145/3110283openalex-snapshot
Theorems for free for free: parametricity, with and without types
inferredcites →https://doi.org/10.1145/3110284openalex-snapshot
On polymorphic gradual typing
inferredcites →https://doi.org/10.1145/3110285openalex-snapshot
Gradual typing with union and intersection types
inferredcites →https://doi.org/10.1145/3158126openalex-snapshot
Parametricity versus the universal type
inferredcites →https://doi.org/10.1145/351240.351259openalex-snapshot
Intersection types and computational effects
inferredcites →https://doi.org/10.1145/512927.512938openalex-snapshot
Types are not sets
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/944705.944709openalex-snapshot
ML F
inferredcites →https://doi.org/10.2307/1995158openalex-snapshot
The Principal Type-Scheme of an Object in Combinatory Logic
inferredcites →https://doi.org/10.4230/lipics.snapl.2015.274openalex-snapshot
Refined Criteria for Gradual Typing

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-030-67438-0openalex-snapshot
Practical Aspects of Declarative Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-67438-0_4openalex-snapshot
Putting Gradual Types to Work
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_6openalex-snapshot
Pragmatic Gradual Polymorphism with References
inferred← citeshttps://doi.org/10.1007/978-3-031-74558-4_7openalex-snapshot
Polymorphism with Typed Holes
inferred← citeshttps://doi.org/10.1017/s0956796824000029openalex-snapshot
Static Blame for gradual typing
inferred← citeshttps://doi.org/10.1109/tevc.2026.3655808openalex-snapshot
Evolutionary Computation-Enhanced Large Language Models for Intelligent Code Completion
inferred← citeshttps://doi.org/10.1145/3622871openalex-snapshot
Greedy Implicit Bounded Quantification
inferred← citeshttps://doi.org/10.1145/3689734openalex-snapshot
Merging Gradual Typing
inferred← citeshttps://doi.org/10.1145/3704907openalex-snapshot
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types
inferred← citeshttps://doi.org/10.17760/d20398327openalex-snapshot
A semantic foundation for sound gradual typing
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.