On the public citation graph
Fully abstract from static to gradual
0 signed · 48 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.1007/3-540-49255-0_70openalex-snapshot
Protection in Programming-Language Translations: Mobile Object Systems
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-540-78739-6_2openalex-snapshot
Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
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/b102225openalex-snapshot
Programming languages and systems : Second Asian Symposium, APLAS 2004, Taipei, Taiwan, November 4-6, 2004 : proceedings
inferredcites →https://doi.org/10.1007/bfb0055109openalex-snapshot
Protection in programming-language translations
inferredcites →https://doi.org/10.1016/j.entcs.2008.04.011openalex-snapshot
Expressiveness of Process Algebras
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1109/csf.2019.00025openalex-snapshot
Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation
inferredcites →https://doi.org/10.1109/lics.2009.34openalex-snapshot
Logical Step-Indexed Logical Relations
inferredcites →https://doi.org/10.1145/1328897.1328486openalex-snapshot
The design and implementation of typed scheme
inferredcites →https://doi.org/10.1145/2628136.2628149openalex-snapshot
A theory of gradual effect systems
inferredcites →https://doi.org/10.1145/2699503openalex-snapshot
Secure Compilation to Protected Module Architectures
inferredcites →https://doi.org/10.1145/2837614.2837618openalex-snapshot
Fully-abstract compilation by approximate back-translation
inferredcites →https://doi.org/10.1145/3022670.2951941openalex-snapshot
Fully abstract compilation via universal embedding
inferredcites →https://doi.org/10.1145/3110283openalex-snapshot
Theorems for free for free: parametricity, with and without types
inferredcites →https://doi.org/10.1145/3158126openalex-snapshot
Parametricity versus the universal type
inferredcites →https://doi.org/10.1145/3158152openalex-snapshot
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
inferredcites →https://doi.org/10.1145/3229061openalex-snapshot
Type-Driven Gradual Security with References
inferredcites →https://doi.org/10.1145/3280984openalex-snapshot
Formal Approaches to Secure Compilation
inferredcites →https://doi.org/10.1145/3341709openalex-snapshot
Mechanized relational verification of concurrent programs with continuations
inferredcites →https://doi.org/10.1145/3371114openalex-snapshot
Graduality and parametricity: together again for the first time
inferredcites →https://doi.org/10.23638/lmcs-13(4:2)2017openalex-snapshot
Modular, Fully-abstract Compilation by Approximate Back-translation
inferredcites →https://doi.org/10.4230/lipics.snapl.2015.274openalex-snapshot
Refined Criteria for Gradual Typing
inferredcites →https://doi.org/10.4230/lipics.snapl.2019.6openalex-snapshot
The Dynamic Practice and Static Theory of 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-89051-3_6openalex-snapshot
Fully Abstract and Robust Compilation
inferred← citeshttps://doi.org/10.1007/s11786-020-00450-8openalex-snapshot
Mac Lane’s Comparison Theorem for the Kleisli Construction Formalized in Coq
inferred← citeshttps://doi.org/10.1145/3485485openalex-snapshot
Label dependent lambda calculus and gradual typing
inferred← citeshttps://doi.org/10.1145/3527314openalex-snapshot
Plausible sealing for gradual parametricity
inferred← citeshttps://doi.org/10.1145/3527326openalex-snapshot
Purity of an ST monad: full abstraction by semantically typed back-translation
inferred← citeshttps://doi.org/10.1145/3539657openalex-snapshot
Two Parametricities Versus Three Universal Types
inferred← citeshttps://doi.org/10.1145/3547627openalex-snapshot
Propositional equality for gradual dependently typed programming
inferred← citeshttps://doi.org/10.1145/3632851openalex-snapshot
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
inferred← citeshttps://doi.org/10.1145/3649842openalex-snapshot
Gradually Typed Languages Should Be Vigilant!
inferred← citeshttps://doi.org/10.1145/3747507openalex-snapshot
Robust Dynamic Embedding for Gradual Typing
inferred← citeshttps://doi.org/10.4204/eptcs.413.3openalex-snapshot
Gradual Guarantee via Step-Indexed Logical Relations in Agda
inferred← citeshttps://doi.org/10.48550/arxiv.2006.14969openalex-snapshot
Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
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.