On the public citation graph

Type inference with non-structural subtyping

https://doi.org/10.1007/bf01212524
0 signed · 37 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-19488-6_146openalex-snapshot
Type inference with partial types
inferredcites →https://doi.org/10.1016/0020-0190(92)90196-3openalex-snapshot
Safety analysis versus type inference for partial types
inferredcites →https://doi.org/10.1016/0890-5401(91)90050-copenalex-snapshot
Type inference for record concatenation and multiple inheritance
inferredcites →https://doi.org/10.1016/s0022-0000(05)80051-0openalex-snapshot
Efficient inference of partial types
inferredcites →https://doi.org/10.1017/s0956796800000113openalex-snapshot
Type inference with simple subtypes
inferredcites →https://doi.org/10.1017/s0960129500000657openalex-snapshot
Efficient recursive subtyping
inferredcites →https://doi.org/10.1017/s0960129500000815openalex-snapshot
Strong normalization with non-structural subtyping
inferredcites →https://doi.org/10.1145/155183.155231openalex-snapshot
Subtyping recursive types
inferredcites →https://doi.org/10.1145/199448.199533openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/210184.210187openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/800017.800529openalex-snapshot
Coercion and type inference

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.2001.3090openalex-snapshot
Efficient and Flexible Matching of Recursive Types
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_18openalex-snapshot
Non-structural Subtype Entailment in Automata Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_25openalex-snapshot
Complexity of Subtype Satisfiability over Posets
inferred← citeshttps://doi.org/10.1007/978-3-642-02138-1_11openalex-snapshot
Typing Component-Based Communication Systems
inferred← citeshttps://doi.org/10.1007/s10845-014-0884-9openalex-snapshot
Data type definition and handling for supporting interoperability across organizational borders
inferred← citeshttps://doi.org/10.1016/j.ic.2003.10.001openalex-snapshot
Type inference for record concatenation and subtyping
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00013-7openalex-snapshot
Finite subtype inference with explicit polymorphism
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00140-8openalex-snapshot
Non-structural subtype entailment in automata theory
inferred← citeshttps://doi.org/10.1109/csfw.2002.1021818openalex-snapshot
Fine-grained information flow analysis for a ~ -calculus with sum types
inferred← citeshttps://doi.org/10.1109/lics.2000.855769openalex-snapshot
Game semantics and subtyping
inferred← citeshttps://doi.org/10.1109/lics.2002.1029822openalex-snapshot
Efficient type inference for record concatenation and subtyping
inferred← citeshttps://doi.org/10.1109/lics.2003.1210073openalex-snapshot
A constraint-based presentation and generalization of rows
inferred← citeshttps://doi.org/10.1145/1053468.1053472openalex-snapshot
Automatic discovery of covariant read-only fields
inferred← citeshttps://doi.org/10.1145/2908080.2908119openalex-snapshot
Polymorphic type inference for machine code
inferred← citeshttps://doi.org/10.1145/2980983.2908119openalex-snapshot
Polymorphic type inference for machine code
inferred← citeshttps://doi.org/10.1145/3563304openalex-snapshot
MLstruct: principal type inference in a Boolean algebra of structural types
inferred← citeshttps://doi.org/10.1145/3763797openalex-snapshot
Type-Outference with Label-Listeners: Foundations for Decidable Type-Consistency for Nominal Object-Oriented Generics
inferred← citeshttps://doi.org/10.1145/3828701openalex-snapshot
First-Class Constrained Types: Elaboration, Type Inference, Approximation, and a Characterization of Termination
inferred← citeshttps://doi.org/10.7146/brics.v2i33.19936openalex-snapshot
Type Inference with Nonstructural Subtyping
inferred← citeshttps://doi.org/10.7146/brics.v2i34.19937openalex-snapshot
Type Inference with Selftype
inferred← citeshttps://doi.org/10.7146/brics.v2i35.19938openalex-snapshot
Constructing Fixed-Point Combinators Using Application Survival
inferred← citeshttps://doi.org/10.7146/brics.v2i36.19939openalex-snapshot
Non-primitive Recursive Function Definitions
inferred← citeshttps://doi.org/10.7146/brics.v2i39.19941openalex-snapshot
Petri Nets, Traces, and Local Model Checking
inferred← citeshttps://doi.org/10.7146/brics.v2i40.19942openalex-snapshot
A Fully Abstract Denotational Model for Observational Congruence
inferred← citeshttps://doi.org/10.7146/brics.v2i42.19943openalex-snapshot
An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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.