Observed Communication Semantics for Classical Processes

DOI10.1007/978-3-662-54434-1_3zbMath1485.68156OpenAlexW2596262883MaRDI QIDQ2988633

Robert Atkey

Publication date: 19 May 2017

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/59710/

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Parametrized fixed points and their applications to session types, Fairness and communication-based semantics for session-typed languages, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logical relations and observational equivalences for session-based concurrency
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Linear logic
• Computational interpretations of linear logic
• Interpreting a finitary pi-calculus in differential interaction nets
• LCF considered as a programming language
• Proofs as processes
• On the \(\pi\)-calculus and linear logic
• A Semantics for Propositions as Sessions
• Propositions as sessions
• Linear Logic and Strong Normalization
• Talking bananas: structural recursion for session types
• Proof-Carrying Code in a Session-Typed Process Calculus
• Conflation Confers Concurrency
• I Got Plenty o’ Nuttin’
• Certifying Data in Multiparty Session Types
• Session Types as Intuitionistic Linear Propositions
• *-Autonomous categories and linear logic
• The true concurrency of differential interaction nets
• Functionality in Combinatory Logic
• Propositions as sessions
• Linear type theory for asynchronous session types
• Barbed bisimulation
• Weighted Relational Models of Typed Lambda-Calculi
• Finiteness spaces
• Least and Greatest Fixed Points in Linear Logic