Termination in a π-calculus with subtyping
From MaRDI portal
Publication:2971078
DOI10.1017/S0960129514000620zbMath1362.68207MaRDI QIDQ2971078
Daniel Hirschkoff, Ioana Cristescu
Publication date: 4 April 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)
Cites Work
- Strong normalisation in the \(\pi\)-calculus
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
- Ensuring termination by typability
- Mobile Processes and Termination
- Termination in Impure Concurrent Languages
- Typed behavioural equivalences for processes in the presence of subtyping
- Termination of processes
This page was built for publication: Termination in a π-calculus with subtyping
