Subtyping for session types in the pi calculus
From MaRDI portal
Publication:2576666
DOI10.1007/s00236-005-0177-zzbMath1079.68065OpenAlexW2088962847MaRDI QIDQ2576666
Publication date: 14 December 2005
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-005-0177-z
Related Items (88)
On projecting processes into session types ⋮ Data-driven adaptation for smart sessions ⋮ Certifying data in multiparty session types ⋮ Deconfined Global Types for Asynchronous Sessions ⋮ Precise Subtyping for Asynchronous Multiparty Sessions ⋮ Mixed Sessions ⋮ Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types ⋮ Session types and subtyping for orchestrated interactions ⋮ Behavioural Analysis of Sessions Using the Calculus of Structures ⋮ Event-based run-time adaptation in communication-centric systems ⋮ Self-adaptation and secure information flow in multiparty communications ⋮ Substructural Proofs as Automata ⋮ Binary Session Types for Psi-Calculi ⋮ Back to futures ⋮ Compliance in Behavioural Contracts: A Brief Survey ⋮ Contracts for Mobile Processes ⋮ Multiparty session types, beyond duality ⋮ Subtyping Supports Safe Session Substitution ⋮ Certifying Data in Multiparty Session Types ⋮ Type checking a multithreaded functional language with session types ⋮ Orchestrated session compliance ⋮ Verifiable abstractions for contract-oriented systems ⋮ Session types revisited ⋮ Undecidability of asynchronous session subtyping ⋮ Comparing type systems for deadlock freedom ⋮ Unnamed Item ⋮ Conversation types ⋮ Combining behavioural types with security analysis ⋮ Precise subtyping for synchronous multiparty sessions ⋮ The different shades of infinite session types ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ Polarized subtyping ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the boundary between decidability and undecidability of asynchronous session subtyping ⋮ Algorithmic type checking for a pi-calculus with name matching and session types ⋮ Unnamed Item ⋮ A simple library implementation of binary sessions ⋮ Unnamed Item ⋮ Exception handling for copyless messaging ⋮ Using session types for reasoning about boundedness in the \(\pi\)-calculus ⋮ Bounded polymorphism in session types ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ Unnamed Item ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Fair refinement for asynchronous session types ⋮ Nested session types ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Reversible session-based pi-calculus ⋮ An algebraic theory for web service contracts ⋮ Process calculi as a tool for studying coordination, contracts and session types ⋮ Deriving session and union types for objects ⋮ Deciding the Bisimilarity of Context-Free Session Types ⋮ Composition and decomposition of multiparty sessions ⋮ Sub-behaviour relations for session-based client/server systems ⋮ Global escape in multiparty sessions ⋮ Linearity, session types and the Pi calculus ⋮ Linear logic propositions as session types ⋮ Fair subtyping for multi-party session types ⋮ An extensible approach to session polymorphism ⋮ Modelling session types using contracts ⋮ Asynchronous Session Types and Progress for Object Oriented Languages ⋮ Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders ⋮ Fundamentals of session types ⋮ Unnamed Item ⋮ Linear type theory for asynchronous session types ⋮ Unnamed Item ⋮ Contract-based discovery of Web services modulo simple orchestrators ⋮ Unnamed Item ⋮ Session types without sophistry. System description ⋮ Amalgamating sessions and methods in object-oriented languages with generics ⋮ Typing Copyless Message Passing ⋮ The stream-based service-centred calculus: a foundation for service-oriented programming ⋮ Corecursion and Non-divergence in Session-Typed Processes ⋮ Mixed sessions ⋮ Session-typed concurrent contracts ⋮ Full Abstraction in a Subtyped pi-Calculus with Linear Types ⋮ Objects and session types ⋮ Session-Based Communication Optimisation for Higher-Order Mobile Processes ⋮ Session Types with Arithmetic Refinements ⋮ Probabilistic Analysis of Binary Sessions ⋮ Type-Based Analysis for Session Inference (Extended Abstract) ⋮ Unnamed Item ⋮ Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines ⋮ Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus ⋮ A Calculus of Global Interaction based on Session Types ⋮ Polymorphic lambda calculus with context-free session types ⋮ Propositions as sessions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- A calculus of mobile processes. I
- Typing correspondence assertions for communication protocols
- A generic type system for the pi-calculus
- Correspondence assertions for process synchronization in concurrent communications
- Lilac: a functional programming language based on linear logic
- Types as models
- CONCUR 2004 - Concurrency Theory
- Trustworthy Global Computing
- Programming Languages and Systems
- Behavioral equivalence in the polymorphic pi-calculus
This page was built for publication: Subtyping for session types in the pi calculus