On the Relative Expressiveness of Higher-Order Session Processes

DOI10.1007/978-3-662-49498-1_18zbMath1335.68174DBLPconf/esop/KouzapasPY16OpenAlexW2461655671WikidataQ57652366 ScholiaQ57652366MaRDI QIDQ2802492

Nobuko Yoshida, Dimitrios Kouzapas, Jorge A. Pérez

Publication date: 26 April 2016

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

Full work available at URL: https://ir.cwi.nl/pub/28755

Mathematics Subject Classification ID

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

Related Items (8)

Characteristic bisimulation for higher-order session processes ⋮ Reversibility in session-based concurrency: a fresh look ⋮ Encodability criteria for quantum based systems ⋮ Parameterizing higher-order processes on names and processes ⋮ Minimal session types for the \(\pi\)-calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the relative expressiveness of higher-order session processes

Uses Software

• TALx86

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong normalisation in the \(\pi\)-calculus
• On the expressiveness and decidability of higher-order process calculi
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• On the expressiveness of interaction
• Plain CHOCS. A second generation calculus for higher order processes
• On reduction-based process semantics
• Asynchronous process calculi: The first- and higher-order paradigms
• What is a ``good encoding of guarded choice?
• Distinguishing and relating higher-order and first-order processes by expressiveness
• Towards a unified approach to encodability and separation results for process calculi
• Variations on mobile processes
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Characteristic bisimulation for higher-order session processes
• Session types revisited
• A CPS encoding of name-passing in higher-order mobile embedded resources
• On Duality Relations for Session Types
• Effects as sessions, sessions as effects
• Expressiveness of Process Algebras
• Full Abstraction in a Subtyped pi-Calculus with Linear Types
• Trees from Functions as Processes
• On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
• Two Session Typing Systems for Higher-Order Mobile Processes
• Stack-based typed assembly language
• Linear type theory for asynchronous session types
• On Distributability in Process Calculi
• Typing Copyless Message Passing

This page was built for publication: On the Relative Expressiveness of Higher-Order Session Processes