Termination in Impure Concurrent Languages

DOI10.1007/978-3-642-15375-4_23zbMath1287.68129OpenAlexW1532542548MaRDI QIDQ3584940

Davide Sangiorgi, Daniel Hirschkoff, Romain Demangeon

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

Mathematics Subject Classification ID

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

Related Items (6)

Eager functions as processes ⋮ Unnamed Item ⋮ Light logics and higher-order processes ⋮ Termination in a π-calculus with subtyping ⋮ Unnamed Item ⋮ Causal computational complexity of distributed processes

This page was built for publication: Termination in Impure Concurrent Languages