On the public citation graph
Gradual typing with union and intersection types
0 signed · 75 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.1006/inco.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
inferredcites →https://doi.org/10.1006/inco.1995.1033openalex-snapshot
A Calculus for Overloaded Functions with Subtyping
inferredcites →https://doi.org/10.1007/1-4020-8141-3_50openalex-snapshot
Regular Tree Language Recognition with Static Information
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_9openalex-snapshot
Design of the Programming Language Forsythe
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_21openalex-snapshot
The Recursive Union of Some Gradual 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-28869-2_11openalex-snapshot
Complete Monitors for Behavioral Contracts
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.1145/1328438.1328486openalex-snapshot
The design and implementation of typed scheme
inferredcites →https://doi.org/10.1145/1408681.1408688openalex-snapshot
Gradual typing with unification-based inference
inferredcites →https://doi.org/10.1145/1706299.1706342openalex-snapshot
Threesomes, with and without blame
inferredcites →https://doi.org/10.1145/2535838.2535840openalex-snapshot
Polymorphic functions with set-theoretic types
inferredcites →https://doi.org/10.1145/2676726.2676991openalex-snapshot
Polymorphic Functions with Set-Theoretic Types
inferredcites →https://doi.org/10.1145/2676726.2676992openalex-snapshot
Principal Type Schemes for Gradual Programs
inferredcites →https://doi.org/10.1145/2837614.2837630openalex-snapshot
Is sound gradual typing dead?
inferredcites →https://doi.org/10.1145/2951913.2951928openalex-snapshot
Set-theoretic types for polymorphic variants
inferredcites →https://doi.org/10.1145/3009837.3009865openalex-snapshot
Sums of uncertainty: refinements go gradual
inferredcites →https://doi.org/10.23638/lmcs-16(1:15)2020openalex-snapshot
Covariance and Controvariance: a fresh look at an old issue (a primer in advanced type systems for learning functional programmers)
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-17184-1_14openalex-snapshot
Distributive Disjoint Polymorphism for Compositional Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_3openalex-snapshot
Manifest Contracts with Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-030-47147-7_5openalex-snapshot
Type Inference for Rank 2 Gradual Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-030-50029-0_10openalex-snapshot
SFJ: An Implementation of Semantic Featherweight Java
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_29openalex-snapshot
Type Inference for Rank-2 Intersection Types Using Set Unification
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_12openalex-snapshot
Programming with Union, Intersection, and Negation Types
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_19openalex-snapshot
A Gradual Interpretation of Union Types
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_1openalex-snapshot
Consistent Subtyping for All
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.10.013openalex-snapshot
Gradual Typing Using Union Typing With Records
inferred← citeshttps://doi.org/10.1016/j.knosys.2019.05.013openalex-snapshot
Rule-based program specialization to optimize gradually typed code
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102496openalex-snapshot
Abstracting gradual references
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102781openalex-snapshot
Revisiting Occurrence Typing
inferred← citeshttps://doi.org/10.1017/s0956796821000241openalex-snapshot
Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
inferred← citeshttps://doi.org/10.1017/s0956796824000078openalex-snapshot
Type-directed operational semantics for gradual typing
inferred← citeshttps://doi.org/10.1145/3133872openalex-snapshot
Fast and precise type checking for JavaScript
inferred← citeshttps://doi.org/10.1145/3229061openalex-snapshot
Type-Driven Gradual Security with References
inferred← citeshttps://doi.org/10.1145/3274279openalex-snapshot
A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams
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/3281074.3281077openalex-snapshot
Recognizing heterogeneous sequences by rational type expression
inferred← citeshttps://doi.org/10.1145/3371114openalex-snapshot
Graduality and parametricity: together again for the first time
inferred← citeshttps://doi.org/10.1145/3473573openalex-snapshot
How to evaluate blame for gradual types
inferred← citeshttps://doi.org/10.1145/3485485openalex-snapshot
Label dependent lambda calculus and gradual typing
inferred← citeshttps://doi.org/10.1145/3486602.3486767openalex-snapshot
Union and intersection contracts are hard, actually
inferred← citeshttps://doi.org/10.1145/3498674openalex-snapshot
On type-cases, union elimination, and occurrence typing
inferred← citeshttps://doi.org/10.1145/3510487.3510509openalex-snapshot
A Subtyping Scheme for Nominal and Structural Types Based on Class Graph Equivalence
inferred← citeshttps://doi.org/10.1145/3519939.3523430openalex-snapshot
Deep and shallow types for gradual languages
inferred← citeshttps://doi.org/10.1145/3551357.3551382openalex-snapshot
A Typed Lambda Calculus with Gradual Intersection Types
inferred← citeshttps://doi.org/10.1145/3563305openalex-snapshot
Highly illogical, Kirk: spotting type mismatches in the large despite broken contracts, unsound types, and too many linters
inferred← citeshttps://doi.org/10.1145/3579833openalex-snapshot
Typed–Untyped Interactions: A Comparative Analysis
inferred← citeshttps://doi.org/10.1145/3587216.3587220openalex-snapshot
Set-theoretic Types for Erlang
inferred← citeshttps://doi.org/10.1145/3677995openalex-snapshot
Proceedings of the 23rd ACM SIGPLAN International Workshop on Erlang
inferred← citeshttps://doi.org/10.1145/3677995.3678189openalex-snapshot
Same Same but Different: A Comparative Analysis of Static Type Checkers in Erlang
inferred← citeshttps://doi.org/10.1145/3704907openalex-snapshot
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types
inferred← citeshttps://doi.org/10.1145/3742876openalex-snapshot
Proceedings of the 24th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences
inferred← citeshttps://doi.org/10.1145/3763061openalex-snapshot
Flexible and Expressive Typed Path Patterns for GQL
inferred← citeshttps://doi.org/10.17760/d20398327openalex-snapshot
A semantic foundation for sound gradual typing
inferred← citeshttps://doi.org/10.4230/lipics.snapl.2019.2openalex-snapshot
Blame Tracking and Type Error Debugging
inferred← citeshttps://doi.org/10.4230/lipics.types.2023.2openalex-snapshot
Finite Combinatory Logic with Predicates
inferred← citeshttps://doi.org/10.70675/95be549dz75cdz411cza44dz08753a6dde1copenalex-snapshot
Polymorphic set-theoretic types for functional 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.