Formal treatment of network nondeterminism and fault tolerance

Develop a formal semantics for the untyped call-by-value parallel streaming lambda calculus with join (introduced in this paper) that incorporates network nondeterminism and fault tolerance, and articulate the corresponding semantic properties for such executions.

Background

The paper focuses on a core language that unifies functional programming with deterministic parallel streaming via a join operator and a filter-model semantics. The technical development centers on parallel semantics, computational adequacy, and a domain-theoretic perspective.

However, practical distributed systems face network nondeterminism and failures. The authors explicitly defer a formal account of these aspects, indicating a gap between the presented semantics and a full semantics suitable for distributed execution with faults.