On the relative expressiveness of higher-order session processes
From MaRDI portal
Publication:2802492
DOI10.1007/978-3-662-49498-1_18zbMATH Open1335.68174DBLPconf/esop/KouzapasPY16OpenAlexW2461655671WikidataQ57652366 ScholiaQ57652366MaRDI QIDQ2802492FDOQ2802492
Authors: Dimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida 
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
Recommendations
- On the relative expressiveness of higher-order session processes
- On the expressiveness of polyadic and synchronous communication in higher-order process calculi
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Characteristic bisimulation for higher-order session processes
Cites Work
- On duality relations for session types
- The \(\pi\)-calculus: A theory of mobile processes
- On reduction-based process semantics
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Stack-based typed assembly language
- Linear type theory for asynchronous session types
- Towards a unified approach to encodability and separation results for process calculi
- Expressiveness of process algebras
- On the expressiveness of interaction
- A CPS encoding of name-passing in higher-order mobile embedded resources
- On the expressiveness and decidability of higher-order process calculi
- Strong normalisation in the \(\pi\)-calculus
- On distributability in process calculi
- What is a ``good encoding of guarded choice?
- Variations on mobile processes
- Plain CHOCS. A second generation calculus for higher order processes
- On the expressiveness of polyadic and synchronous communication in higher-order process calculi
- Asynchronous process calculi: The first- and higher-order paradigms
- Characteristic bisimulation for higher-order session processes
- Session types revisited
- Full abstraction in a subtyped pi-calculus with linear types
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Two Session Typing Systems for Higher-Order Mobile Processes
- Typing copyless message passing
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Effects as sessions, sessions as effects
- Trees from functions as processes
- A reflective higher-order calculus
- Title not available (Why is that?)
Cited In (21)
- Using higher-order contracts to model session types (extended abstract)
- Using higher-order contracts to model session types
- Title not available (Why is that?)
- Parameterizing higher-order processes on names and processes
- Encodability criteria for quantum based systems
- Characteristic bisimulation for higher-order session processes
- Reversibility in session-based concurrency: a fresh look
- On the expressiveness and decidability of higher-order process calculi
- Session-Based Communication Optimisation for Higher-Order Mobile Processes
- Expressiveness via intensionality and concurrency
- Classical higher-order processes (short paper)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Encodability criteria for quantum based systems
- On the discriminating power of passivation and higher-order interaction
- On the relative expressiveness of higher-order session processes
- Distinguishing and relating higher-order and first-order processes by expressiveness
- On the expressiveness of polyadic and synchronous communication in higher-order process calculi
- Higher-order processes, functions, and sessions: a monadic integration
- Higher-order processes with parameterization over names and processes
- Minimal session types for the \(\pi\)-calculus
Uses Software
This page was built for publication: On the relative expressiveness of higher-order session processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802492)
