On the public citation graph
Reading, Writing and Relations
0 signed · 63 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.2613openalex-snapshot
Region-Based Memory Management
inferredcites →https://doi.org/10.1007/11417170_8openalex-snapshot
Relational Reasoning in a Nominal Semantics for Storage
inferredcites →https://doi.org/10.1007/3-540-45931-6_24openalex-snapshot
Notions of Computation Determine Monads
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_2openalex-snapshot
Theories for the Global Ubiquitous Computer
inferredcites →https://doi.org/10.1007/978-3-540-73228-0_19openalex-snapshot
Extensional Rewriting with Sums
inferredcites →https://doi.org/10.1007/bfb0055514openalex-snapshot
Optimizing ML using a hierarchy of monadic types
inferredcites →https://doi.org/10.1007/s10990-004-4868-xopenalex-snapshot
Bisimilarity for the Region Calculus
inferredcites →https://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
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.2007.02.004openalex-snapshot
Observational purity and encapsulation
inferredcites →https://doi.org/10.1016/s1571-0661(05)80280-4openalex-snapshot
Monads, Effects and Transformations
inferredcites →https://doi.org/10.1017/s0956796801004154openalex-snapshot
Monadic encapsulation of effects: a revised approach (extended version)
inferredcites →https://doi.org/10.1023/a:1011553200337openalex-snapshot
A Per Model of Secure Information Flow in Sequential Programs
inferredcites →https://doi.org/10.1109/lics.1999.782594openalex-snapshot
Region analysis and the polymorphic lambda calculus
inferredcites →https://doi.org/10.1145/319838.319848openalex-snapshot
Integrating functional and imperative programming
inferredcites →https://doi.org/10.1145/601775.601776openalex-snapshot
The marriage of effects and monads
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.7146/brics.v7i32.20167openalex-snapshot
The Meaning of Types From Intrinsic to Extrinsic Semantics
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-319-27810-0_1openalex-snapshot
Effect Systems Revisited—Control-Flow Algebra and Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_3openalex-snapshot
Counting Successes: Effects and Transformations for Non-deterministic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-03741-2_2openalex-snapshot
Algebras for Parameterised Monads
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.2013.09.020openalex-snapshot
Automata-Theoretic Semantics of Idealized Algol with Passive Expressions
inferred← citeshttps://doi.org/10.1016/j.ic.2016.04.003openalex-snapshot
A Kripke logical relation for effect-based program transformations
inferred← citeshttps://doi.org/10.1016/j.scico.2017.11.001openalex-snapshot
Effect-dependent transformations for concurrent programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.029openalex-snapshot
The untyped computational λ-calculus and its intersection type discipline
inferred← citeshttps://doi.org/10.1017/s095679680900728xopenalex-snapshot
Parameterised notions of computation
inferred← citeshttps://doi.org/10.1145/1190315.1190320openalex-snapshot
Semantics of an effect analysis for exceptions
inferred← citeshttps://doi.org/10.1145/1273920.1273922openalex-snapshot
Formalizing and verifying semantic type soundness of a simple compiler
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/1481861.1481868openalex-snapshot
A generic type-and-effect system
inferred← citeshttps://doi.org/10.1145/1599410.1599447openalex-snapshot
Relational semantics for effect-based program transformations
inferred← citeshttps://doi.org/10.1145/2034574.2034831openalex-snapshot
A kripke logical relation for effect-based program transformations
inferred← citeshttps://doi.org/10.1145/2034773.2034831openalex-snapshot
A kripke logical relation for effect-based program transformations
inferred← citeshttps://doi.org/10.1145/2103621.2103698openalex-snapshot
Algebraic foundations for effect-dependent optimisations
inferred← citeshttps://doi.org/10.1145/2103656.2103698openalex-snapshot
Algebraic foundations for effect-dependent optimisations
inferred← citeshttps://doi.org/10.1145/2429069.2429082openalex-snapshot
Abstraction and invariance for algebraically indexed types
inferred← citeshttps://doi.org/10.1145/2480359.2429082openalex-snapshot
Abstraction and invariance for algebraically indexed types
inferred← citeshttps://doi.org/10.1145/2535838.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferred← citeshttps://doi.org/10.1145/2535838.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferred← citeshttps://doi.org/10.1145/2578855.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferred← citeshttps://doi.org/10.1145/2578855.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferred← citeshttps://doi.org/10.1145/2628136.2628159openalex-snapshot
A relational framework for higher-order shape analysis
inferred← citeshttps://doi.org/10.1145/2692915.2628159openalex-snapshot
A relational framework for higher-order shape analysis
inferred← citeshttps://doi.org/10.1145/2967973.2968602openalex-snapshot
Effect-dependent transformations for concurrent programs
inferred← citeshttps://doi.org/10.1145/3009837.3009877openalex-snapshot
A relational model of types-and-effects in higher-order concurrent separation logic
inferred← citeshttps://doi.org/10.1145/3093333.3009877openalex-snapshot
A relational model of types-and-effects in higher-order concurrent separation logic
inferred← citeshttps://doi.org/10.1145/3158152openalex-snapshot
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
inferred← citeshttps://doi.org/10.1145/3167090openalex-snapshot
A monadic framework for relational verification: applied to information security, program equivalence, and optimizations
inferred← citeshttps://doi.org/10.1145/3176245.3167090openalex-snapshot
A monadic framework for relational verification: applied to information security, program equivalence, and optimizations
inferred← citeshttps://doi.org/10.1145/3236950.3236975openalex-snapshot
Semantic Equivalence Checking for HHVM Bytecode
inferred← citeshttps://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferred← citeshttps://doi.org/10.1145/3622813openalex-snapshot
Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies
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.4230/lipics.csl.2012.107openalex-snapshot
A Concurrent Logical Relation
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02419openalex-snapshot
Effect-Dependent Transformations for Concurrent Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1907.05706openalex-snapshot
Intersection Types for the Computational lambda-Calculus
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.