On the public citation graph
A quick look at impredicativity
0 signed · 49 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.1999.2830openalex-snapshot
Semi-Explicit First-Class Polymorphism for ML
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_10openalex-snapshot
Visible Type Application
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/0747-7171(92)90011-ropenalex-snapshot
Unification under a mixed prefix
inferredcites →https://doi.org/10.1016/0890-5401(88)90009-0openalex-snapshot
Polymorphic type inference and containment
inferredcites →https://doi.org/10.1017/s0956796806006034openalex-snapshot
Practical type inference for arbitrary-rank types
inferredcites →https://doi.org/10.1017/s0956796811000098openalex-snapshot
OutsideIn(X) Modular type inference with local assumptions
inferredcites →https://doi.org/10.1145/1086365.1086383openalex-snapshot
Simple, partial type-inference for System F based on type-containment
inferredcites →https://doi.org/10.1145/1111037.1111058openalex-snapshot
Stratified type inference for generalized algebraic data types
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/3192366.3192389openalex-snapshot
Guarded impredicative polymorphism
inferredcites →https://doi.org/10.1145/3290322openalex-snapshot
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
inferredcites →https://doi.org/10.1145/73141.74836openalex-snapshot
Type reconstruction with first-class polymorphic values
inferredcites →https://doi.org/10.3233/fi-1993-191-208openalex-snapshot
On the Undecidability of Partial Polymorphic Type Reconstruction
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-031-24841-2_3openalex-snapshot
Embedding Functional Logic Programming in Haskell via a Compiler Plugin
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_10openalex-snapshot
Bidirectional Type Checking for Existential Types with Higher-Rank Polymorphism
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_11openalex-snapshot
Practical Refinement Session Type Inference
inferred← citeshttps://doi.org/10.1145/3471874.3472985openalex-snapshot
Seeking stability by being lazy and shallow: lazy and shallow instantiation is user friendly
inferred← citeshttps://doi.org/10.1145/3473569openalex-snapshot
An existential crisis resolved: type inference for first-class existential types
inferred← citeshttps://doi.org/10.1145/3498723openalex-snapshot
Staging with class: a specification for typed template Haskell
inferred← citeshttps://doi.org/10.1145/3547642openalex-snapshot
Constraint-based type inference for FreezeML
inferred← citeshttps://doi.org/10.1145/3610612.3610623openalex-snapshot
Strongly-Typed Multi-View Stack-Based Computations
inferred← citeshttps://doi.org/10.1145/3622871openalex-snapshot
Greedy Implicit Bounded Quantification
inferred← citeshttps://doi.org/10.1145/3632890openalex-snapshot
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
inferred← citeshttps://doi.org/10.1145/3652561.3652565openalex-snapshot
ExEl: Building an Elaborator Using Extensible Constraints
inferred← citeshttps://doi.org/10.1145/3704907openalex-snapshot
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types
inferred← citeshttps://doi.org/10.1145/3729308openalex-snapshot
Principal Type Inference under a Prefix: A Fresh Look at Static Overloading
inferred← citeshttps://doi.org/10.1145/3828702openalex-snapshot
Another Type Inference Algorithm for First-Class Implicit Polymorphism
inferred← citeshttps://doi.org/10.4204/eptcs.420.1openalex-snapshot
Local Type Inference for Context-Free Session Types
inferred← citeshttps://doi.org/10.48550/arxiv.2106.14938openalex-snapshot
Seeking Stability by being Lazy and Shallow
inferred← citeshttps://doi.org/10.48550/arxiv.2109.11397openalex-snapshot
Position Paper: Goals of the Luau Type System
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.