Bounded polymorphism in session types

DOI10.1017/S0960129508006944zbMath1156.68016OpenAlexW4248304257MaRDI QIDQ3535678

Simon J. Gay

Publication date: 13 November 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508006944

zbMATH Keywords

pi calculussubtyping for session types

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (9)

Binary Session Types for Psi-Calculi ⋮ Subtyping Supports Safe Session Substitution ⋮ Session types revisited ⋮ Nested session types ⋮ Deriving session and union types for objects ⋮ An extensible approach to session polymorphism ⋮ Linear type theory for asynchronous session types ⋮ Objects and session types ⋮ Polymorphic lambda calculus with context-free session types

Cites Work

• Linear logic
• Type checking a multithreaded functional language with session types
• A calculus of mobile processes. I
• Subtyping for session types in the pi calculus
• Correspondence assertions for process synchronization in concurrent communications
• Behavioral equivalence in the polymorphic pi-calculus
• Unnamed Item

This page was built for publication: Bounded polymorphism in session types