On the public citation graph

Polymorphic Type Inference for Dynamic Languages

https://doi.org/10.1145/3632882
0 signed · 55 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.1002/malq.19810270205openalex-snapshot
Functional Characters of Solvable Terms
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-45927-8_9openalex-snapshot
Branching Types
inferredcites →https://doi.org/10.1007/978-3-031-17715-6_29openalex-snapshot
Type Inference for Rank-2 Intersection Types Using Set Unification
inferredcites →https://doi.org/10.1007/978-3-031-34518-0openalex-snapshot
From Procedures, Objects, Actors, Components, Services, to Agents - A Comparative Analysis of the History and Evolution of Programming Abstractions
inferredcites →https://doi.org/10.1007/978-3-031-34518-0_12openalex-snapshot
Programming with Union, Intersection, and Negation Types
inferredcites →https://doi.org/10.1007/978-94-011-0834-8_5openalex-snapshot
Analytic and Synthetic Judgements in Type Theory
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/j.ic.2007.03.005openalex-snapshot
Intersection-types à la Church
inferredcites →https://doi.org/10.1016/j.scico.2022.102781openalex-snapshot
Revisiting Occurrence Typing
inferredcites →https://doi.org/10.1016/j.tcs.2008.01.046openalex-snapshot
A typed lambda calculus with intersection types
inferredcites →https://doi.org/10.1016/s0019-9958(86)80019-5openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.1016/s1571-0661(04)80496-1openalex-snapshot
Intersection Typed λ-calculus
inferredcites →https://doi.org/10.1017/s0956796801004245openalex-snapshot
A calculus with polymorphic and polyvariant flow types
inferredcites →https://doi.org/10.1109/lics.2002.1029823openalex-snapshot
Semantic subtyping
inferredcites →https://doi.org/10.1145/1328438.1328486openalex-snapshot
The design and implementation of typed scheme
inferredcites →https://doi.org/10.1145/1391289.1391293openalex-snapshot
Semantic subtyping
inferredcites →https://doi.org/10.1145/141471.141563openalex-snapshot
Reasoning about programs in continuation-passing style.
inferredcites →https://doi.org/10.1145/169701.169687openalex-snapshot
Type reconstruction in the presence of polymorphic recursion
inferredcites →https://doi.org/10.1145/169701.169692openalex-snapshot
Type inference with polymorphic recursion
inferredcites →https://doi.org/10.1145/1863543.1863561openalex-snapshot
Logical types for untyped languages
inferredcites →https://doi.org/10.1145/2034574.2034788openalex-snapshot
Set-theoretic foundation of parametric polymorphism and subtyping
inferredcites →https://doi.org/10.1145/2676726.2676991openalex-snapshot
Polymorphic Functions with Set-Theoretic Types
inferredcites →https://doi.org/10.1145/2812805openalex-snapshot
A Logical Approach to Deciding Semantic Subtyping
inferredcites →https://doi.org/10.1145/2951913.2951928openalex-snapshot
Set-theoretic types for polymorphic variants
inferredcites →https://doi.org/10.1145/3009837.3009882openalex-snapshot
Polymorphism, subtyping, and type inference in MLsub
inferredcites →https://doi.org/10.1145/3022670.2951945openalex-snapshot
Disjoint intersection types
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/3460228openalex-snapshot
Compositional Programming
inferredcites →https://doi.org/10.1145/3498674openalex-snapshot
On type-cases, union elimination, and occurrence typing
inferredcites →https://doi.org/10.1145/3563304openalex-snapshot
MLstruct: principal type inference in a Boolean algebra of structural types
inferredcites →https://doi.org/10.1145/3571211openalex-snapshot
A Bowtie for a Beast: Overloading, Eta Expansion, and Extensible Data Types in F⋈
inferredcites →https://doi.org/10.1145/3587216.3587220openalex-snapshot
Set-theoretic Types for Erlang
inferredcites →https://doi.org/10.1145/3607838openalex-snapshot
Typing Records, Maps, and Structs
inferredcites →https://doi.org/10.1145/3632882openalex-snapshot
Polymorphic Type Inference for Dynamic Languages
inferredcites →https://doi.org/10.1145/567067.567077openalex-snapshot
Polymorphic type inference
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.15167/petrucciani-tommaso_phd2019-03-14openalex-snapshot
Polymorphic set-theoretic types for functional languages
inferredcites →https://doi.org/10.22152/programming-journal.orgopenalex-snapshot
The Art, Science, and Engineering of Programming
inferredcites →https://doi.org/10.22152/programming-journal.org/2024/8/4openalex-snapshot
The Design Principles of the Elixir Type System
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.2019.6openalex-snapshot
The Dynamic Practice and Static Theory of Gradual Typing
inferredcites →https://doi.org/10.4230/lipics.types.2018.4openalex-snapshot
Semantic Subtyping for Non-Strict Languages
inferredcites →https://doi.org/10.5281/zenodo.8408276openalex-snapshot
Prototype: Polymorphic Type Inference for Dynamic Languages

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.70003openalex-snapshot
Debloating Software Through Enhanced Static Analysis and Constraint Rules
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.1016/j.jlamp.2026.101153openalex-snapshot
Pythonic existential types
inferred← citeshttps://doi.org/10.1109/acsac67867.2025.00025openalex-snapshot
TeTRIS: General-purpose Fuzzing for Translation Bugs in Source-to-Source Code Transpilers
inferred← citeshttps://doi.org/10.1145/3704907openalex-snapshot
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types
inferred← citeshttps://doi.org/10.1145/3720497openalex-snapshot
Polymorphic Records for Dynamic Languages
inferred← citeshttps://doi.org/10.1145/3794763.3794834openalex-snapshot
Hyalinos: From Type Inference to Community Knowledge
inferred← citeshttps://doi.org/10.1145/3798220openalex-snapshot
Type Inference for Functional and Imperative Dynamic Languages
inferred← citeshttps://doi.org/10.22152/programming-journal.org/2024/8/4openalex-snapshot
The Design Principles of the Elixir Type System
inferred← citeshttps://doi.org/10.5753/cibse.2026.42446openalex-snapshot
Towards Hybrid and Reusable Type Inference for Dynamically-Typed Languages
showing the first 10 of 11 · page through all 11
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.