On the public citation graph

A Game Semantics of the Asynchronous π-Calculus

https://doi.org/10.1007/11539452_8
0 signed · 53 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.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferredcites →https://doi.org/10.1006/inco.2000.2930openalex-snapshot
Full Abstraction for PCF
inferredcites →https://doi.org/10.1006/inco.2001.3080openalex-snapshot
Trace and Testing Equivalence on Asynchronous Processes
inferredcites →https://doi.org/10.1006/inco.2002.2968openalex-snapshot
A Fully Abstract Model for the π-calculus
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-45413-6_7openalex-snapshot
Sequentiality and the π-Calculus
inferredcites →https://doi.org/10.1007/3-540-48523-6_59openalex-snapshot
Closed Freyd- and κ-categories
inferredcites →https://doi.org/10.1007/3-540-60043-4_59openalex-snapshot
Causality and true concurrency: A data-flow analysis of the Pi-Calculus
inferredcites →https://doi.org/10.1007/978-1-4471-0615-9openalex-snapshot
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_16openalex-snapshot
Angelic Semantics of Fine-Grained Concurrency
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-24727-2_21openalex-snapshot
A Game Semantics of Local Names and Good Variables
inferredcites →https://doi.org/10.1007/978-3-642-58041-3_6openalex-snapshot
The Polyadic π-Calculus: a Tutorial
inferredcites →https://doi.org/10.1007/bfb0055067openalex-snapshot
Generalised flowcharts and games
inferredcites →https://doi.org/10.1007/bfb0057019openalex-snapshot
An object calculus for asynchronous communication
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.tcs.2004.10.012openalex-snapshot
A fully abstract may testing semantics for concurrent objects
inferredcites →https://doi.org/10.1016/s0304-3975(00)00331-5openalex-snapshot
A fully abstract denotational semantics for the π-calculus
inferredcites →https://doi.org/10.1016/s0304-3975(03)00315-3openalex-snapshot
The regular-language semantics of second-order idealized ALGOL
inferredcites →https://doi.org/10.1016/s1571-0661(04)80566-8openalex-snapshot
A Categorical Semantics of Higher Order Store
inferredcites →https://doi.org/10.1017/s0305004100074338openalex-snapshot
Traced monoidal categories
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1996.561301openalex-snapshot
A fully abstract domain model for the π-calculus
inferredcites →https://doi.org/10.1109/lics.1999.782637openalex-snapshot
A fully abstract game semantics for finite nondeterminism
inferredcites →https://doi.org/10.1109/lics.2001.932507openalex-snapshot
Strong normalisation in the π-calculus
inferredcites →https://doi.org/10.1109/lics.2002.1029820openalex-snapshot
A fully abstract may testing semantics for concurrent objects
inferredcites →https://doi.org/10.2168/lmcs-1(1:4)2005openalex-snapshot
Contextual equivalence for higher-order pi-calculus revisited
inferredcites →https://doi.org/10.2307/2275407openalex-snapshot
Games and full completeness for multiplicative linear logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11944836_38openalex-snapshot
Game Semantics for Higher-Order Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_23openalex-snapshot
A Categorical Model of an $$\mathbf {i/o}$$ -typed $$\pi $$ -calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_6openalex-snapshot
The Far Side of the Cube
inferred← citeshttps://doi.org/10.1007/978-3-319-06025-5_5openalex-snapshot
Intensionality, Definability and Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_27openalex-snapshot
Asynchronous Games: Innocence Without Alternation
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_9openalex-snapshot
Partial Orders, Event Structures and Linear Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_37openalex-snapshot
Focusing in Asynchronous Games
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_23openalex-snapshot
Estimation of the Length of Interactions in Arena Game Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_19openalex-snapshot
Full Abstraction in a Subtyped pi-Calculus with Linear Types
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_17openalex-snapshot
Operational Nominal Game Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_23openalex-snapshot
A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.019openalex-snapshot
Typed Event Structures and the π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.04.013openalex-snapshot
Matching of Bigraphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.04.014openalex-snapshot
A Graph Abstract Machine Describing Event Structure Composition
inferred← citeshttps://doi.org/10.1109/lics.2011.32openalex-snapshot
Isomorphisms of Types in the Presence of Higher-Order References
inferred← citeshttps://doi.org/10.1109/lics.2015.20openalex-snapshot
Game Semantics for Type Soundness
inferred← citeshttps://doi.org/10.1109/lics.2015.30openalex-snapshot
Nondeterminism in Game Semantics via Sheaves
inferred← citeshttps://doi.org/10.1145/2603088.2603141openalex-snapshot
Symmetry in concurrent games
inferred← citeshttps://doi.org/10.1145/2933575.2934553openalex-snapshot
Plays as Resource Terms via Non-idempotent Intersection Types
inferred← citeshttps://doi.org/10.1145/3129173.3129174openalex-snapshot
The 2017 Alonzo Church award
inferred← citeshttps://doi.org/10.1145/3290340openalex-snapshot
Two sides of the same coin: session types and game semantics: a synchronous side and an asynchronous side
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:8)2012openalex-snapshot
Isomorphisms of types in the presence of higher-order references (extended version)
inferred← citeshttps://doi.org/10.4204/eptcs.292.3openalex-snapshot
From Linear Logic to Cyclic Sharing
inferred← citeshttps://doi.org/10.4204/eptcs.347.1openalex-snapshot
Processes, Systems and Tests: Defining Contextual Equivalences
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6563openalex-snapshot
Fully Abstract Game Semantics for Actors
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.