On the public citation graph
Relational Reasoning for Recursive Types and References
0 signed · 42 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.1996.0052openalex-snapshot
Relational Properties of Domains
inferredcites →https://doi.org/10.1006/inco.1996.0061openalex-snapshot
From Operational Semantics to Domain Theory
inferredcites →https://doi.org/10.1006/inco.1999.2828openalex-snapshot
Relational Interpretations of Recursive Types in an Operational Setting
inferredcites →https://doi.org/10.1007/11417170_8openalex-snapshot
Relational Reasoning in a Nominal Semantics for Storage
inferredcites →https://doi.org/10.1007/11693024_11openalex-snapshot
Bisimulations for Untyped Imperative Objects
inferredcites →https://doi.org/10.1007/11693024_6openalex-snapshot
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
inferredcites →https://doi.org/10.1007/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
inferredcites →https://doi.org/10.1016/j.scico.2004.01.007openalex-snapshot
Correctness of data representations involving heap data structures
inferredcites →https://doi.org/10.1016/j.tcs.2005.06.003openalex-snapshot
On a monadic semantics for freshness
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1040305.1040311openalex-snapshot
A bisimulation for type abstraction and recursion
inferredcites →https://doi.org/10.1145/1111037.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferredcites →https://doi.org/10.48456/tr-618openalex-snapshot
The Fresh Approach: functional programming with names and binders
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-99527-0_10openalex-snapshot
From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_19openalex-snapshot
Fair Cooperative Multithreading
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_32openalex-snapshot
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_33openalex-snapshot
A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
inferred← citeshttps://doi.org/10.1007/978-3-642-38946-7_6openalex-snapshot
Proof-Relevant Logical Relations for Name Generation
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.015openalex-snapshot
Global State Considered Helpful
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.024openalex-snapshot
A Nominal Relational Model for Local Store
inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.007openalex-snapshot
Typing termination in a higher-order concurrent imperative language
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.03.004openalex-snapshot
A relational realizability model for higher-order stateful ADTs
inferred← citeshttps://doi.org/10.1017/s0956796807006429openalex-snapshot
Recursive type generativity
inferred← citeshttps://doi.org/10.1017/s0960129510000162openalex-snapshot
Realisability semantics of parametric polymorphism, general references and recursive types
inferred← citeshttps://doi.org/10.1109/eurosp.2016.22openalex-snapshot
Reasoning about Object Capabilities with Logical Relations and Effect Parametricity
inferred← citeshttps://doi.org/10.1109/lics.2011.31openalex-snapshot
Game Semantics for Good General References
inferred← citeshttps://doi.org/10.1109/lics.2017.8005109openalex-snapshot
A monad for full ground reference cells
inferred← citeshttps://doi.org/10.1145/1273920.1273932openalex-snapshot
Relational semantics for effect-based program transformations with dynamic allocation
inferred← citeshttps://doi.org/10.1145/1328438.1328476openalex-snapshot
Imperative self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1328897.1328476openalex-snapshot
Imperative self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1480881.1480925openalex-snapshot
State-dependent representation independence
inferred← citeshttps://doi.org/10.1145/1481861.1481873openalex-snapshot
Relational parametricity for references and recursive types
inferred← citeshttps://doi.org/10.1145/1594834.1480925openalex-snapshot
State-dependent representation independence
inferred← citeshttps://doi.org/10.1145/1596627.1596633openalex-snapshot
Correctly translating concurrency primitives
inferred← citeshttps://doi.org/10.1145/1599410.1599447openalex-snapshot
Relational semantics for effect-based program transformations
inferred← citeshttps://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferred← citeshttps://doi.org/10.1145/1925844.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferred← citeshttps://doi.org/10.1145/1926385.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferred← citeshttps://doi.org/10.17760/d10016545openalex-snapshot
Reasoning about imperative and higher-order programs
inferred← citeshttps://doi.org/10.2168/lmcs-5(4:2)2009openalex-snapshot
A Step-indexed Semantics of Imperative Objects
inferred← citeshttps://doi.org/10.23638/lmcs-14(1:25)2018openalex-snapshot
Proof-Relevant Logical Relations for Name Generation
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.