Termination in higher-order concurrent calculi
From MaRDI portal
Publication:710674
DOI10.1016/J.JLAP.2010.07.007zbMATH Open1205.68241OpenAlexW1974475317MaRDI QIDQ710674FDOQ710674
Authors: Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi 
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
Recommendations
Cites Work
- The \(\pi\)-calculus: A theory of mobile processes
- Title not available (Why is that?)
- A CPS encoding of name-passing in higher-order mobile embedded resources
- Global Computing
- Termination of processes
- Strong normalisation in the \(\pi\)-calculus
- What is a ``good encoding of guarded choice?
- Ensuring termination by typability
- Termination in higher-order concurrent calculi
Cited In (9)
- Termination in impure concurrent languages
- Termination, deadlock, and divergence
- Termination in higher-order concurrent calculi
- Mobile Processes and Termination
- A generic type system for higher-order \(\Psi\)-calculi
- Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination
- Typing termination in a higher-order concurrent imperative language
- GOFFIN: Higher-order functions meet concurrent constraints
- Title not available (Why is that?)
This page was built for publication: Termination in higher-order concurrent calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710674)
