On the public citation graph

Intersection types and bounded polymorphism

https://doi.org/10.1007/bfb0037117
0 signed · 43 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.1016openalex-snapshot
Singleton, Union, and Intersection Types for Program Extraction
inferredcites →https://doi.org/10.1006/inco.1994.1055openalex-snapshot
Bounded Quantification Is Undecidable
inferredcites →https://doi.org/10.1006/inco.1995.1086openalex-snapshot
Intersection and Union Types: Syntax and 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-08860-1_30openalex-snapshot
Une extension de la theorie des types en λ-calcul
inferredcites →https://doi.org/10.1007/3-540-54415-1openalex-snapshot
Theoretical Aspects of Computer Software
inferredcites →https://doi.org/10.1007/3-540-54415-1_69openalex-snapshot
Intersection and union types
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/3-540-54415-1_71openalex-snapshot
Singleton, union and intersection types for program extraction
inferredcites →https://doi.org/10.1007/3-540-54415-1_73openalex-snapshot
An extension of system F with subtyping
inferredcites →https://doi.org/10.1007/bf02011875openalex-snapshot
A new type assignment for λ-terms
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(90)90062-mopenalex-snapshot
A modest model of records, inheritance, and bounded quantification
inferredcites →https://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1017/s0960129500001134openalex-snapshot
Coherence of subsumption, minimum typing and type-checking in F ≤
inferredcites →https://doi.org/10.1145/117954.117964openalex-snapshot
A static type system for message passing
inferredcites →https://doi.org/10.1145/143165.143225openalex-snapshot
Parametricity as subtyping
inferredcites →https://doi.org/10.1145/143165.143228openalex-snapshot
Bounded quantification is undecidable
inferredcites →https://doi.org/10.1145/158511.158650openalex-snapshot
Safe type checking in a statically-typed object-oriented programming language
inferredcites →https://doi.org/10.1145/158511.158653openalex-snapshot
Object-oriented programming without recursive types
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/99583.99620openalex-snapshot
An extension of standard ML modules with subtyping and inheritance
inferredcites →https://doi.org/10.1184/r1/6608582openalex-snapshot
Preliminary design of the programming language Forsythe
inferredcites →https://doi.org/10.1184/r1/6608684openalex-snapshot
Programming with intersection types, union types, and polymorphism
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
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.1006/inco.1994.1055openalex-snapshot
Bounded Quantification Is Undecidable
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_5openalex-snapshot
Enforcing Safety Properties Using Type Specialization
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00073-6openalex-snapshot
Intersection type assignment systems
inferred← citeshttps://doi.org/10.1017/s0956796800001775openalex-snapshot
Operational interpretations of an extension of F ω with control operators
inferred← citeshttps://doi.org/10.1145/1040305.1040309openalex-snapshot
A simple typed intermediate language for object-oriented languages
inferred← citeshttps://doi.org/10.1145/1047659.1040309openalex-snapshot
A simple typed intermediate language for object-oriented languages
inferred← citeshttps://doi.org/10.1145/1557898.1557901openalex-snapshot
Semantic predicate types and approximation for class-based object oriented programming
inferred← citeshttps://doi.org/10.1145/165854.167976openalex-snapshot
Regular types for active objects
inferred← citeshttps://doi.org/10.1145/167962.167976openalex-snapshot
Regular types for active objects
inferred← citeshttps://doi.org/10.1145/1922649.1922657openalex-snapshot
Strict intersection types for the Lambda Calculus
inferred← citeshttps://doi.org/10.1145/3276504openalex-snapshot
The root cause of blame: contracts for intersection and union types
inferred← citeshttps://doi.org/10.1145/3689782openalex-snapshot
Imperative Compositional Programming: Type Sound Distributive Intersection Subtyping with References via Bidirectional Typing
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c030openalex-snapshot
Syntax and Semantics of Type Assignment Systems
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.