Termination in higher-order concurrent calculi
From MaRDI portal
Publication:710674
Recommendations
Cites work
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- A CPS encoding of name-passing in higher-order mobile embedded resources
- Ensuring termination by typability
- Global Computing
- Strong normalisation in the \(\pi\)-calculus
- Termination in higher-order concurrent calculi
- Termination of processes
- The \(\pi\)-calculus: A theory of mobile processes
- What is a ``good encoding of guarded choice?
Cited in
(9)- GOFFIN: Higher-order functions meet concurrent constraints
- A generic type system for higher-order \(\Psi\)-calculi
- Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination
- A generic type system for higher-order \(\Psi\)-calculi
- Typing termination in a higher-order concurrent imperative language
- Mobile Processes and Termination
- Termination, deadlock, and divergence
- Termination in higher-order concurrent calculi
- Termination in impure concurrent languages
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)