https://nalar.dev/tags/asynchronous-programming/ Recent content in Asynchronous Programming on Nalar Hugo en-us Tue, 15 Sep 2026 00:00:00 +0700 https://nalar.dev/generation-counters-reject-stale-async-results/ Tue, 15 Sep 2026 00:00:00 +0700 https://nalar.dev/generation-counters-reject-stale-async-results/ <p>An asynchronous operation can start first and finish last. If every completion writes into the same state slot, completion order becomes state order even when the application intended request order to define authority.</p> <p>This race appears without shared-memory threads. Two network requests, background computations, database queries, or worker messages can overlap through an event loop and return in the opposite order from their initiation. The older result is not necessarily incorrect data. It is stale because a later request has superseded the state transition that originally authorized it.</p> https://nalar.dev/task-scopes-bind-child-lifetimes-to-parent-operations/ Tue, 15 Sep 2026 00:00:00 +0700 https://nalar.dev/task-scopes-bind-child-lifetimes-to-parent-operations/ <p>An asynchronous function can return while work it started is still running. Once that happens, the caller no longer has a lexical boundary that states when the spawned work finishes, where its failure is observed, or which operation owns its cancellation.</p> <p>Structured concurrency changes that lifetime relation. Child tasks belong to an enclosing scope, and the scope does not complete until its children reach a terminal state according to the runtime&rsquo;s task-group semantics. The central property is not parallel execution. It is that task lifetime follows program structure.</p>