Metraipolis › archive › dc_219ca14feea5
Composable Building Blocks for Resilient Asynchronous Code — arXiv:2608.21489
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21489
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:11:09.590Z
- SHA-256 of the archived text
b30611f477c6dd06bc1d69a083781e51b6a4fed6e708e12908a1f72ac3d75397- Stable URL of this page
https://metraipolis.com/documento/dc_219ca14feea5
How to cite
Composable Building Blocks for Resilient Asynchronous Code — arXiv:2608.21489 — arXiv (en), https://arxiv.org/abs/2608.21489 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_219ca14feea5 (Metraipolis archive dc_219ca14feea5, sha256 b30611f477c6dd06bc1d69a083781e51b6a4fed6e708e12908a1f72ac3d75397)
BibTeX
@misc{dc219ca14feea5,
title = {Composable Building Blocks for Resilient Asynchronous Code — arXiv:2608.21489},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21489},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_219ca14feea5; sha256 b30611f477c6dd06bc1d69a083781e51b6a4fed6e708e12908a1f72ac3d75397},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21489. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Asynchronous calls to a network service, database, or language model must cope with transient errors, slow or missing responses, throttling, and atomicity violations. We show how higher-order combinators solve such problems uniformly, including timeouts, retries, rate limiting, caching, reentrant locking, and cancellation. Every combinator maps an async function to another of the same type, so they share a uniform \emph{shape} and compose by nesting into one expression that implements a program's whole resilience and concurrency policy, leaving its business logic untouched. The same design spans both of JavaScript's native async shapes, promise-returning and async-iterable-returning functions, with one vocabulary of concerns. Solutions exist across the ecosystem but are scattered over differently shaped libraries that are hard to combine. We present case studies where the combinators are used to harden real packages by adding missing resilience or concurrency control and replacing bespoke policy.
Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-25 in cs.SE).
Categorie arXiv: Software Engineering (cs.SE) ; Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2608.21489 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:07:32.975Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).