constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
In the theory of computation, concurrency (or maybe rather parallelism, cf. Harper 2011) refers to the situation of several (maybe interacting) processes proceeding simultaneously. Here the word “simultaneously” indicates that the evolution of the participating processes is indexed along an irreversible directed object.
With π-calculus, the processes can either be the nil process , parallel execution , sending on channel and then continuing , receiving on channel and then continuing , replicating a process or introduction of a new name .
(…)
in a wider sense also articles related to directed homotopy theory, cf.
Wikipedia: Process calculus
Wikipedia: Concurrency (computer science)
Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen: Directed Algebraic Topology and Concurrency
The Pi calculus: toward global computing Rchain (2019) [blog]
Last revised on March 11, 2025 at 09:32:52. See the history of this page for a list of all contributions to it.