A linear account of session types in the pi calculus
DOI10.1007/978-3-642-15375-4_30zbMATH Open1283.68244OpenAlexW2046798675MaRDI QIDQ3584947FDOQ3584947
Authors: Marco Giunti, Vasco T. Vasconcelos
Publication date: 31 August 2010
Published in: CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15375-4_30
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (16)
- Algorithmic type checking for a pi-calculus with name matching and session types
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Type reconstruction for the linear \(\pi \)-calculus with composite and equi-recursive types
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
- Linear logic propositions as session types
- Fundamentals of session types
- Binary session types for psi-calculi
- Linearity, session types and the pi calculus
- Linear forwarders.
- Session types revisited
- Linear type theory for asynchronous session types
- On projecting processes into session types
- Linearly refined session types
- A universal session type for untyped asynchronous communication
- Type reconstruction for the linear \(\pi\)-calculus with composite regular types
- Session types as intuitionistic linear propositions
This page was built for publication: A linear account of session types in the pi calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584947)