On the public citation graph
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
0 signed · 78 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.1002/9780470373699.speced1086openalex-snapshot
Information Processing
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/978-3-319-22102-1_24openalex-snapshot
Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_26openalex-snapshot
The Essence of Higher-Order Concurrent Separation Logic
inferredcites →https://doi.org/10.1016/0304-3975(92)90014-7openalex-snapshot
The revised report on the syntactic theories of sequential control and state
inferredcites →https://doi.org/10.1017/s0956796801004154openalex-snapshot
Monadic encapsulation of effects: a revised approach (extended version)
inferredcites →https://doi.org/10.1109/lics.2002.1029818openalex-snapshot
A stratified semantics of general references embeddable in higher-order logic
inferredcites →https://doi.org/10.1109/lics.2009.34openalex-snapshot
Logical Step-Indexed Logical Relations
inferredcites →https://doi.org/10.1145/1190215.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1190216.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1190315.1190320openalex-snapshot
Semantics of an effect analysis for exceptions
inferredcites →https://doi.org/10.1145/1273920.1273932openalex-snapshot
Relational semantics for effect-based program transformations with dynamic allocation
inferredcites →https://doi.org/10.1145/1599410.1599447openalex-snapshot
Relational semantics for effect-based program transformations
inferredcites →https://doi.org/10.1145/1925844.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferredcites →https://doi.org/10.1145/1926385.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferredcites →https://doi.org/10.1145/2034574.2034831openalex-snapshot
A kripke logical relation for effect-based program transformations
inferredcites →https://doi.org/10.1145/2034773.2034831openalex-snapshot
A kripke logical relation for effect-based program transformations
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3009837.3009877openalex-snapshot
A relational model of types-and-effects in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/319838.319848openalex-snapshot
Integrating functional and imperative programming
inferredcites →https://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferredcites →https://doi.org/10.2168/lmcs-7(2:16)2011openalex-snapshot
Logical Step-Indexed Logical Relations
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-44914-8_13openalex-snapshot
Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-63406-3_11openalex-snapshot
Type-Based Declassification for Free
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_18openalex-snapshot
Region-based Resource Management and Lexical Exception Handlers in Continuation-Passing Style
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_3openalex-snapshot
Logical Predicates in Higher-Order Mathematical Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100894openalex-snapshot
Operationally-based program equivalence proofs using LCTRSs
inferred← citeshttps://doi.org/10.1016/j.jnoncrysol.2019.01.006openalex-snapshot
On the variation of the mechanical energy accumulation rates during the flow serrations of a Zr-based bulk metallic glass
inferred← citeshttps://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferred← citeshttps://doi.org/10.1017/s0956796819000029openalex-snapshot
A theory of RPC calculi for client–server model
inferred← citeshttps://doi.org/10.1109/sp40001.2021.00003openalex-snapshot
Compositional Non-Interference for Fine-Grained Concurrent Programs
inferred← citeshttps://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferred← citeshttps://doi.org/10.1145/3236772openalex-snapshot
MoSeL: a general, extensible modal framework for interactive proofs in separation logic
inferred← citeshttps://doi.org/10.1145/3236773openalex-snapshot
Mtac2: typed tactics for backward reasoning in Coq
inferred← citeshttps://doi.org/10.1145/3242744.3242755openalex-snapshot
Ghosts of departed proofs (functional pearl)
inferred← citeshttps://doi.org/10.1145/3290378openalex-snapshot
Iron: managing obligations in higher-order concurrent separation logic
inferred← citeshttps://doi.org/10.1145/3299711.3242755openalex-snapshot
Ghosts of departed proofs (functional pearl)
inferred← citeshttps://doi.org/10.1145/3331545.3342600openalex-snapshot
STCLang: state thread composition as a foundation for monadic dataflow parallelism
inferred← citeshttps://doi.org/10.1145/3341709openalex-snapshot
Mechanized relational verification of concurrent programs with continuations
inferred← citeshttps://doi.org/10.1145/3371072openalex-snapshot
The next 700 relational program logics
inferred← citeshttps://doi.org/10.1145/3408996openalex-snapshot
Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris
inferred← citeshttps://doi.org/10.1145/3409003openalex-snapshot
SteelCore: an extensible concurrent separation logic for effectful dependently typed programs
inferred← citeshttps://doi.org/10.1145/3434287openalex-snapshot
Efficient and provable local capability revocation using uninitialized capabilities
inferred← citeshttps://doi.org/10.1145/3434288openalex-snapshot
Fully abstract from static to gradual
inferred← citeshttps://doi.org/10.1145/3434291openalex-snapshot
Mechanized logical relations for termination-insensitive noninterference
inferred← citeshttps://doi.org/10.1145/3437992.3439914openalex-snapshot
Machine-checked semantic session typing
inferred← citeshttps://doi.org/10.1145/3453483.3454031openalex-snapshot
Transfinite Iris: resolving an existential dilemma of step-indexed separation logic
inferred← citeshttps://doi.org/10.1145/3473591openalex-snapshot
Compositional optimizations for CertiCoq
inferred← citeshttps://doi.org/10.1145/3473597openalex-snapshot
GhostCell: separating permissions from data in Rust
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/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferred← citeshttps://doi.org/10.1145/3563289openalex-snapshot
First-class names for effect handlers
inferred← citeshttps://doi.org/10.1145/3609027openalex-snapshot
Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development
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/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3661814.3662099openalex-snapshot
Bialgebraic Reasoning on Higher-order Program Equivalence
inferred← citeshttps://doi.org/10.1145/3689484.3690733openalex-snapshot
Seamless Scope-Safe Metaprogramming through Polymorphic Subtype Inference (Short Paper)
inferred← citeshttps://doi.org/10.1145/3703595.3705876openalex-snapshot
The Nextgen Modality: A Modality for Non-Frame-Preserving Updates in Separation Logic
inferred← citeshttps://doi.org/10.1145/3719027.3744801openalex-snapshot
Logical Relations for Formally Verified Authenticated Data Structures
inferred← citeshttps://doi.org/10.1145/3729250openalex-snapshot
Nola: Later-Free Ghost State for Verifying Termination in Iris
inferred← citeshttps://doi.org/10.1145/3747513openalex-snapshot
Bialgebraic Reasoning on Stateful Languages
inferred← citeshttps://doi.org/10.1145/3763116openalex-snapshot
Modeling Reachability Types with Logical Relations: Semantic Type Soundness, Termination, Effect Safety, and Equational Theory
inferred← citeshttps://doi.org/10.1145/3808303openalex-snapshot
Backwards-Compatible Row-Based Exceptions in ML
inferred← citeshttps://doi.org/10.17760/d20467221openalex-snapshot
Interoperability through realizability: expressing high-level abstractions using low-level code
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d44openalex-snapshot
Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:9)2021openalex-snapshot
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
inferred← citeshttps://doi.org/10.48550/arxiv.2110.15183openalex-snapshot
A Theory of RPC Calculi for Client-Server Model
inferred← citeshttps://doi.org/10.70675/adcfd403z5566z460dz9591zebb0e4f5a766openalex-snapshot
Principles of program verification for arbitrary monadic effects
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.