Termination in impure concurrent languages

DOI10.1007/978-3-642-15375-4_23zbMATH Open1287.68129OpenAlexW1532542548MaRDI QIDQ3584940FDOQ3584940

Authors: Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi 

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_23

Recommendations

• Termination in higher-order concurrent calculi
• Termination in higher-order concurrent calculi
• Typing termination in a higher-order concurrent imperative language
• Strong normalisation in \(\lambda \)-calculi with references
• Mobile Processes and Termination

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Termination, deadlock, and divergence
• Causal computational complexity of distributed processes
• Divergence and unique solution of equations
• Eager functions as processes
• Termination in a \(\pi\)-calculus with subtyping
• Light logics and higher-order processes
• Divergence and unique solution of equations

This page was built for publication: Termination in impure concurrent languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584940)