Editing Lambda calculus (section)

=== Parallelism and concurrency ===
The [[Church–Rosser theorem|Church–Rosser]] property of the lambda calculus means that evaluation (β-reduction) can be carried out in ''any order'', even in parallel. This means that various [[Nondeterministic algorithm|nondeterministic]] [[evaluation strategy|evaluation strategies]] are relevant. However, the lambda calculus does not offer any explicit constructs for [[Parallel computing|parallelism]]. One can add constructs such as [[Futures and promises|futures]] to the lambda calculus. Other [[process calculi]] have been developed for describing communication and concurrency.