Answers are grounded in this paper and cite their sources.
Formal evaluation demonstrates space and execution time optimization in asynchronous programs, suggesting performance improvements for concurrent systems.
This article extends tail-call optimisation by applying it to asynchronous calls. We first introduce TMA, a novel code transformation for asynchronous tail recursive functions that prevents the creation of unnecessary tasks. We then show how to combine TMA with the existing TMC optimisation; we obtain an optimisation able to turn a recursive function with multiple tail calls under constructors into a parallel version of the function, also optimised in space. We formalise both optimisations over representative calculi, and prove them correct through backward simulations. Finally, we provide a proof-of-concept implementation as an OCaml syntax extension and evaluate it experimentally, showing our approach optimises both memory and execution time
No takes yet. Share an insight, caveat, or question.
Nardino et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: