Two Session Typing Systems for Higher-Order Mobile Processes

DOI10.1007/978-3-540-73228-0_23zbMath1215.03028OpenAlexW2113714969MaRDI QIDQ3612640

Dimitris Mostrous, Nobuko Yoshida

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73228-0_23

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)

Related Items (11)

Characteristic bisimulation for higher-order session processes ⋮ Subtyping Supports Safe Session Substitution ⋮ Session types revisited ⋮ On session types and polynomial time ⋮ Deriving session and union types for objects ⋮ On the relative expressiveness of higher-order session processes ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Amalgamating sessions and methods in object-oriented languages with generics ⋮ Objects and session types ⋮ Session-Based Communication Optimisation for Higher-Order Mobile Processes ⋮ Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus

This page was built for publication: Two Session Typing Systems for Higher-Order Mobile Processes