Full Abstraction in a Subtyped pi-Calculus with Linear Types
From MaRDI portal
Publication:3090836
DOI10.1007/978-3-642-23217-6_19zbMath1343.68165OpenAlexW1663174014MaRDI QIDQ3090836
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
Related Items (19)
Precise Subtyping for Asynchronous Multiparty Sessions ⋮ Mixed Sessions ⋮ Trees from Functions as Processes ⋮ Subtyping Supports Safe Session Substitution ⋮ Session types revisited ⋮ Precise subtyping for synchronous multiparty sessions ⋮ Minimal session types for the \(\pi\)-calculus ⋮ A simple library implementation of binary sessions ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ Context-Free Session Type Inference ⋮ Progress-preserving Refinements of CTA ⋮ Composition and decomposition of multiparty sessions ⋮ Fundamentals of session types ⋮ On the relative expressiveness of higher-order session processes ⋮ Unnamed Item ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Mixed sessions ⋮ Full Abstraction in a Subtyped pi-Calculus with Linear Types ⋮ Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
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
This page was built for publication: Full Abstraction in a Subtyped pi-Calculus with Linear Types
