Full Abstraction in a Subtyped pi-Calculus with Linear Types

DOI10.1007/978-3-642-23217-6_19zbMath1343.68165MaRDI QIDQ3090836

Kohei Honda, Romain Demangeon

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_19

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Unnamed Item, Unnamed Item, A simple library implementation of binary sessions, Fundamentals of session types, Composition and decomposition of multiparty sessions, Mixed sessions, On the relative expressiveness of higher-order session processes, Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus, Session types revisited, Precise subtyping for synchronous multiparty sessions, On the Relative Expressiveness of Higher-Order Session Processes, On the Undecidability of Asynchronous Session Subtyping, Context-Free Session Type Inference, Full Abstraction in a Subtyped pi-Calculus with Linear Types, Subtyping Supports Safe Session Substitution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong normalisation in the \(\pi\)-calculus
• Semantic subtyping for the pi-calculus
• Higher-order subtyping
• Objects in the \(\pi\)-calculus
• Game-theoretic analysis of call-by-value computation
• Types and full abstraction for polyadic \(\pi\)-calculus
• Genericity and the \(\pi\)-calculus
• Subtyping for session types in the pi calculus
• Full Abstraction in a Subtyped pi-Calculus with Linear Types
• Functions as processes
• CONCUR 2005 – Concurrency Theory