On the public citation graph
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
0 signed · 58 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.1007/11783596_4openalex-snapshot
Towards Generic Programming with Sized Types
inferredcites →https://doi.org/10.1007/3-540-36576-1_16openalex-snapshot
Type Assignment for Intersections and Unions in Call-by-Value Languages
inferredcites →https://doi.org/10.1007/978-3-319-03542-0_19openalex-snapshot
Ambivalent Types for Principal Type Inference with GADTs
inferredcites →https://doi.org/10.1007/978-3-540-24849-1_23openalex-snapshot
A Concurrent Logical Framework: The Propositional Fragment
inferredcites →https://doi.org/10.1007/978-3-540-70594-9_4openalex-snapshot
Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory
inferredcites →https://doi.org/10.1007/bfb0055784openalex-snapshot
Polymorphic subtyping without distributivity
inferredcites →https://doi.org/10.1016/0167-6423(95)00021-6openalex-snapshot
An algorithm for type-checking dependent types
inferredcites →https://doi.org/10.1016/s1571-0661(05)80452-9openalex-snapshot
No-Longer-Foreign: Teaching an ML compiler to speak C “natively”
inferredcites →https://doi.org/10.1017/s0956796806006034openalex-snapshot
Practical type inference for arbitrary-rank types
inferredcites →https://doi.org/10.1017/s0956796806006046openalex-snapshot
Phantom types and subtyping
inferredcites →https://doi.org/10.1017/s0956796811000098openalex-snapshot
OutsideIn(X) Modular type inference with local assumptions
inferredcites →https://doi.org/10.1109/lics.1996.561306openalex-snapshot
The subtyping problem for second-order types is undecidable
inferredcites →https://doi.org/10.1145/1111037.1111058openalex-snapshot
Stratified type inference for generalized algebraic data types
inferredcites →https://doi.org/10.1145/1159803.1159811openalex-snapshot
Simple unification-based type inference for GADTs
inferredcites →https://doi.org/10.1145/1180475.1180476openalex-snapshot
A constraint-based approach to guarded algebraic data types
inferredcites →https://doi.org/10.1145/1292597.1292602openalex-snapshot
Refined typechecking with Stardust
inferredcites →https://doi.org/10.1145/1328438.1328483openalex-snapshot
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
inferredcites →https://doi.org/10.1145/1481848.1481852openalex-snapshot
Refinement types and computational duality
inferredcites →https://doi.org/10.1145/1708016.1708023openalex-snapshot
Let should not be generalized
inferredcites →https://doi.org/10.1145/186025.186031openalex-snapshot
Polymorphic type inference and abstract data types
inferredcites →https://doi.org/10.1145/199448.199475openalex-snapshot
Compiling polymorphism using intensional type analysis
inferredcites →https://doi.org/10.1145/2500365.2500582openalex-snapshot
Complete and easy bidirectional typechecking for higher-rank polymorphism
inferredcites →https://doi.org/10.1145/2784731.2784748openalex-snapshot
GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/3009837.3009882openalex-snapshot
Polymorphism, subtyping, and type inference in MLsub
inferredcites →https://doi.org/10.1145/331960.331977openalex-snapshot
Domain specific embedded compilers
inferredcites →https://doi.org/10.1145/351240.351259openalex-snapshot
Intersection types and computational effects
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/604131.604150openalex-snapshot
Guarded recursive datatype constructors
inferredcites →https://doi.org/10.1184/r1/6587297openalex-snapshot
A Concurrent Logical Framework: The Propositional Fragment
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.4204/eptcs.241.2openalex-snapshot
GADTs and Exhaustiveness: Looking for the Impossible
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-72019-3_17openalex-snapshot
Graded Modal Dependent Type Theory
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-981-99-8311-7_1openalex-snapshot
Compilation Semantics for a Programming Language with Versions
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102655openalex-snapshot
A dependently typed calculus with polymorphic subtyping
inferred← citeshttps://doi.org/10.1017/s0956796825100130openalex-snapshot
Semantics of pattern unification
inferred← citeshttps://doi.org/10.1145/2993236.2993255openalex-snapshot
A vision for online verification-validation
inferred← citeshttps://doi.org/10.1145/3093335.2993255openalex-snapshot
A vision for online verification-validation
inferred← citeshttps://doi.org/10.1145/3341714openalex-snapshot
Quantitative program reasoning with graded modal types
inferred← citeshttps://doi.org/10.1145/3341716openalex-snapshot
A mechanical formalization of higher-ranked polymorphic type inference
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/3498674openalex-snapshot
On type-cases, union elimination, and occurrence typing
inferred← citeshttps://doi.org/10.1145/3622871openalex-snapshot
Greedy Implicit Bounded Quantification
inferred← citeshttps://doi.org/10.1145/3632866openalex-snapshot
The Essence of Generalized Algebraic Data Types
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/3776644openalex-snapshot
Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d17openalex-snapshot
Graded Modal Dependent Type Theory
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.