Termination in higher-order concurrent calculi

DOI10.1016/J.JLAP.2010.07.007zbMath1205.68241OpenAlexW1974475317MaRDI QIDQ710674

Romain Demangeon, Davide Sangiorgi, Daniel Hirschkoff

Publication date: 22 October 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.07.007

zbMATH Keywords

process algebraterminationtype systemsconcurrency theory\(\pi \)-calculushigher-order calculi

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Mobile Processes and Termination ⋮ Unnamed Item

Cites Work

• Strong normalisation in the \(\pi\)-calculus
• What is a ``good encoding of guarded choice?
• A CPS encoding of name-passing in higher-order mobile embedded resources
• Ensuring termination by typability
• Termination in Higher-Order Concurrent Calculi
• Global Computing
• Termination of processes
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination in higher-order concurrent calculi