Global Principal Typing in Partially Commutative Asynchronous Sessions

DOI10.1007/978-3-642-00590-9_23zbMath1234.68304OpenAlexW1599340713MaRDI QIDQ3617708

Dimitris Mostrous, Nobuko Yoshida, Kohei Honda

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00590-9_23

Mathematics Subject Classification ID

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

Related Items (26)

Deconfined Global Types for Asynchronous Sessions ⋮ Precise Subtyping for Asynchronous Multiparty Sessions ⋮ Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types ⋮ Behavioural Analysis of Sessions Using the Calculus of Structures ⋮ Multiparty testing preorders ⋮ Contracts for Mobile Processes ⋮ Undecidability of asynchronous session subtyping ⋮ Unnamed Item ⋮ Precise subtyping for synchronous multiparty sessions ⋮ Partially Typed Multiparty Sessions ⋮ On the boundary between decidability and undecidability of asynchronous session subtyping ⋮ The Paths to Choreography Extraction ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Fair refinement for asynchronous session types ⋮ Progress-preserving Refinements of CTA ⋮ Process calculi as a tool for studying coordination, contracts and session types ⋮ Deriving session and union types for objects ⋮ Composition and decomposition of multiparty sessions ⋮ Global progress for dynamically interleaved multiparty sessions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Global types with internal delegation ⋮ Session-Based Communication Optimisation for Higher-Order Mobile Processes ⋮ A Gentle Introduction to Multiparty Asynchronous Session Types ⋮ Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus

This page was built for publication: Global Principal Typing in Partially Commutative Asynchronous Sessions