On the public citation graph

Behavioural Equivalence via Modalities for Algebraic Effects

0 signed · 64 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1996.0008openalex-snapshot
Proving Congruence of Bisimulation in Functional Programming Languages
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-45315-6_1openalex-snapshot
Adequacy for Algebraic Effects
inferredcites →https://doi.org/10.1007/3-540-45931-6_24openalex-snapshot
Notions of Computation Determine Monads
inferredcites →https://doi.org/10.1007/978-1-4471-3182-3_11openalex-snapshot
Evaluation Logic
inferredcites →https://doi.org/10.1007/978-1-84882-912-1_15openalex-snapshot
On CSP and the Algebraic Theory of Effects
inferredcites →https://doi.org/10.1007/978-3-319-15545-6_7openalex-snapshot
Logical Relations and Nondeterminism
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_11openalex-snapshot
Behavioural Equivalence via Modalities for Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-642-19805-2_3openalex-snapshot
Similarity Quotients as Final Coalgebras
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_13openalex-snapshot
Relating Computational Effects by ⊤ ⊤-Lifting
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_7openalex-snapshot
Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/s00165-010-0153-4openalex-snapshot
A generic complete dynamic logic for reasoning about purity and effects
inferredcites →https://doi.org/10.1007/s10990-006-0480-6openalex-snapshot
Call-by-push-value: Decomposing call-by-value and call-by-name
inferredcites →https://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/j.entcs.2011.09.023openalex-snapshot
From Applicative to Environmental Bisimulation
inferredcites →https://doi.org/10.1016/j.entcs.2019.09.015openalex-snapshot
Quantitative Logics for Equivalence of Effectful Programs
inferredcites →https://doi.org/10.1016/j.jsc.2010.08.004openalex-snapshot
Trace-based verification of imperative programs with I/O
inferredcites →https://doi.org/10.1016/j.tcs.2015.03.047openalex-snapshot
Generic weakest precondition semantics from monads enriched with order
inferredcites →https://doi.org/10.1016/s0890-5401(03)00088-9openalex-snapshot
Modelling environments in call-by-value programming languages
inferredcites →https://doi.org/10.1017/9781316823187openalex-snapshot
Introduction to Coalgebra: Towards Mathematics of States and Observation
inferredcites →https://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferredcites →https://doi.org/10.1017/cbo9780511792588openalex-snapshot
Advanced Topics in Bisimulation and Coinduction
inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1017/s0960129500003066openalex-snapshot
Parametric polymorphism and operational equivalence
inferredcites →https://doi.org/10.1109/lics.1989.39174openalex-snapshot
Equality in lazy computation systems
inferredcites →https://doi.org/10.1109/lics.1993.287580openalex-snapshot
Non-determinism in a functional setting
inferredcites →https://doi.org/10.1109/lics.2008.45openalex-snapshot
A Logic for Algebraic Effects
inferredcites →https://doi.org/10.1109/lics.2010.29openalex-snapshot
A Generic Operational Metatheory for Algebraic Effects
inferredcites →https://doi.org/10.1109/lics.2013.33openalex-snapshot
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
inferredcites →https://doi.org/10.1109/lics.2017.8005117openalex-snapshot
Effectful applicative bisimilarity: Monads, relators, and Howe's method
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1145/1480881.1480887openalex-snapshot
A model of cooperative threads
inferredcites →https://doi.org/10.1145/1889997.1890002openalex-snapshot
Environmental bisimulations for higher-order languages
inferredcites →https://doi.org/10.1145/237721.237807openalex-snapshot
Bisimilarity for a first-order calculus of objects with subtyping
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/2491956.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2499370.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2535838.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/3009837.3009878openalex-snapshot
Dijkstra monads for free
inferredcites →https://doi.org/10.1145/3341708openalex-snapshot
Dijkstra monads for all
inferredcites →https://doi.org/10.2168/lmcs-9(4:23)2013openalex-snapshot
Handling Algebraic Effects
inferredcites →https://doi.org/10.4230/lipics.csl.2018.29openalex-snapshot
Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular
inferredcites →https://doi.org/10.7146/brics.v4i24.18950openalex-snapshot
Relational Reasoning about Contexts

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-64437-6_10openalex-snapshot
Algebraic and Coalgebraic Perspectives on Interaction Laws
inferred← citeshttps://doi.org/10.1007/978-3-031-16912-0_8openalex-snapshot
Streams of Approximations, Equivalence of Recursive Effectful Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_26openalex-snapshot
Runners for Interleaving Algebraic Effects
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_2openalex-snapshot
Monadic Intersection Types, Relationally
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.013openalex-snapshot
Combining Algebraic Effect Descriptions Using the Tensor of Complete Lattices
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104958openalex-snapshot
Bounded complete domains and their logical form
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100857openalex-snapshot
Program equivalence in an untyped, call-by-value functional language with uncurried functions
inferred← citeshttps://doi.org/10.1145/3498692openalex-snapshot
A relational theory of effects and coeffects
inferred← citeshttps://doi.org/10.1145/3632929openalex-snapshot
On Model-Checking Higher-Order Effectful Programs
inferred← citeshttps://doi.org/10.1145/3652561.3652566openalex-snapshot
A frame stack semantics for sequential Core Erlang
inferred← citeshttps://doi.org/10.1145/3720457openalex-snapshot
Adequacy for Algebraic Effects Revisited
inferred← citeshttps://doi.org/10.1145/3776676openalex-snapshot
A Relational Separation Logic for Effect Handlers
inferred← citeshttps://doi.org/10.1145/3777483openalex-snapshot
Monadic Intersection Types, Relationally, and Ordered
inferred← citeshttps://doi.org/10.4204/eptcs.317.1openalex-snapshot
From Equations to Distinctions: Two Interpretations of Effectful Computations
inferred← citeshttps://doi.org/10.4204/eptcs.351.16openalex-snapshot
Inductive and Coinductive Predicate Liftings for Effectful Programs
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2022.29openalex-snapshot
A robust graph-based approach to observational equivalence
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.