On the public citation graph

Better late than never: a fully-abstract semantics for classical processes

https://doi.org/10.1145/3290337
0 signed · 61 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.1007/978-3-319-89366-2_5openalex-snapshot
A New Linear Logic for Deadlock-Free Session-Typed Processes
inferredcites →https://doi.org/10.1007/978-3-642-15375-4_16openalex-snapshot
Session Types as Intuitionistic Linear Propositions
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_20openalex-snapshot
Higher-Order Processes, Functions, and Sessions: A Monadic Integration
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_3openalex-snapshot
Observed Communication Semantics for Classical Processes
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_9openalex-snapshot
Linearity, Control Effects, and Behavioral Types
inferredcites →https://doi.org/10.1007/bf01531058openalex-snapshot
Hypersequents, logical consequence and intermediate logics for concurrency
inferredcites →https://doi.org/10.1007/bfb0053567openalex-snapshot
Language primitives and type discipline for structured communication-based programming
inferredcites →https://doi.org/10.1007/s00236-016-0285-yopenalex-snapshot
Multiparty session types as coherence proofs
inferredcites →https://doi.org/10.1007/s00236-016-0289-7openalex-snapshot
Characteristic bisimulation for higher-order session processes
inferredcites →https://doi.org/10.1016/0022-4049(95)00040-2openalex-snapshot
∗-Autonomous categories, revisited
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(94)00103-0openalex-snapshot
Proofs as processes
inferredcites →https://doi.org/10.1016/0304-3975(94)00104-9openalex-snapshot
On the π-calculus and linear logic
inferredcites →https://doi.org/10.1016/0304-3975(96)00075-8openalex-snapshot
π-Calculus, internal mobility, and agent-passing calculi
inferredcites →https://doi.org/10.1016/j.ic.2012.05.002openalex-snapshot
Fundamentals of session types
inferredcites →https://doi.org/10.1016/j.ic.2014.08.001openalex-snapshot
Linear logical relations and observational equivalences for session-based concurrency
inferredcites →https://doi.org/10.1016/j.jlamp.2015.09.002openalex-snapshot
Behavioural equivalences for coalgebras with unobservable moves
inferredcites →https://doi.org/10.1016/j.jlap.2007.02.011openalex-snapshot
Linearity and bisimulation
inferredcites →https://doi.org/10.1017/s095679681400001xopenalex-snapshot
Propositions as sessions
inferredcites →https://doi.org/10.1017/s0960129500001274openalex-snapshot
*-Autonomous categories and linear logic
inferredcites →https://doi.org/10.1017/s0960129504004323openalex-snapshot
On asynchrony in name-passing calculi
inferredcites →https://doi.org/10.1145/1889997.1890002openalex-snapshot
Environmental bisimulations for higher-order languages
inferredcites →https://doi.org/10.1145/2398856.2364568openalex-snapshot
Propositions as sessions
inferredcites →https://doi.org/10.1145/2490818openalex-snapshot
Algebra-coalgebra duality in brzozowski's minimization algorithm
inferredcites →https://doi.org/10.1145/2827695openalex-snapshot
Multiparty Asynchronous Session Types
inferredcites →https://doi.org/10.1145/2951913.2951921openalex-snapshot
Talking bananas: structural recursion for session types
inferredcites →https://doi.org/10.1145/321239.321249openalex-snapshot
Derivatives of Regular Expressions
inferredcites →https://doi.org/10.1145/330249.330251openalex-snapshot
Linearity and the pi-calculus
inferredcites →https://doi.org/10.4230/lipics.concur.2016.33openalex-snapshot
Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types

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-22397-7_3openalex-snapshot
Towards Races in Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-78089-0_6openalex-snapshot
Prioritise the Best Variation
inferred← citeshttps://doi.org/10.1007/978-3-030-90636-8_3openalex-snapshot
Composable Partial Multiparty Session Types
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_9openalex-snapshot
The Session Abstract Machine
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_2openalex-snapshot
Formulas as Processes, Deadlock-Freedom as Choreographies
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_6openalex-snapshot
Multiparty Session Types with a Bang!
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_6openalex-snapshot
Recursive Logical Relations for Intuitionistic Linear Logic Session Types
inferred← citeshttps://doi.org/10.1007/s10270-022-01040-xopenalex-snapshot
Composable partial multiparty session types for open systems
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104892openalex-snapshot
Fairness and communication-based semantics for session-typed languages
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100717openalex-snapshot
Comparing type systems for deadlock freedom
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.100964openalex-snapshot
Fair termination of multiparty sessions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.101004openalex-snapshot
Comparing session type systems derived from linear logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.022openalex-snapshot
On the concurrent computational content of intermediate logics
inferred← citeshttps://doi.org/10.1049/2024/2634744openalex-snapshot
L π CET: A Logic Security Analysis for Cryptographic Protocols Based on π ‐Calculus Extension Theory
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470654openalex-snapshot
Session Logical Relations for Noninterference
inferred← citeshttps://doi.org/10.1145/3371086openalex-snapshot
Par means parallel: multiplicative linear logic proofs as concurrent functional programs
inferred← citeshttps://doi.org/10.1145/3473567openalex-snapshot
Client-server sessions in linear logic
inferred← citeshttps://doi.org/10.1145/3498662openalex-snapshot
Connectivity graphs: a method for proving deadlock freedom based on separation logic
inferred← citeshttps://doi.org/10.1145/3547638openalex-snapshot
Multiparty GV: functional multiparty session types with certified deadlock freedom
inferred← citeshttps://doi.org/10.1145/3563318openalex-snapshot
A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency
inferred← citeshttps://doi.org/10.1145/3571229openalex-snapshot
Higher-Order Leak and Deadlock Free Locks
inferred← citeshttps://doi.org/10.1145/3704895openalex-snapshot
Semantic Logical Relations for Timed Message-Passing Protocols
inferred← citeshttps://doi.org/10.1145/3844503openalex-snapshot
\(\pi\) LL: Reconciling Linear Logic, the \(\pi\) -calculus, and their Metatheory
inferred← citeshttps://doi.org/10.23638/lmcs-16(4:15)2020openalex-snapshot
Towards Races in Linear Logic
inferred← citeshttps://doi.org/10.4204/eptcs.292.5openalex-snapshot
Taking Linear Logic Apart
inferred← citeshttps://doi.org/10.4204/eptcs.322.7openalex-snapshot
Substructural Observed Communication Semantics
inferred← citeshttps://doi.org/10.46298/lmcs-19(3:3)2023openalex-snapshot
Separating Sessions Smoothly
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:28)2023openalex-snapshot
Prioritise the Best Variation
inferred← citeshttps://doi.org/10.48550/arxiv.1911.00407openalex-snapshot
A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework
inferred← citeshttps://doi.org/10.48550/arxiv.2002.01960openalex-snapshot
A Domain Semantics for Higher-Order Recursive Processes
inferred← citeshttps://doi.org/10.48550/arxiv.2106.11818openalex-snapshot
Linear Logic, the $π$-calculus, and their Metatheory: A Recipe for Proofs as Processes
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.