Answers are grounded in this paper and cite their sources.
Algorithmic skeletons are an effective, pattern-based approach for parallelising software. However, despite implementations for a range of languages and paradigms, there is currently no support for dependently-typed languages , such as Idris, Agda and Coq. Such languages promote safer software via the ability to express logical properties and specifications, along with their proofs, directly in code. In this paper, we present , a prototype dependently-typed language based on Idris, with message-passing concurrency and built-in Pipeline and Task Farm skeletons. We evaluate on a series of standard Task Farm and Pipeline examples, achieving speedups of up to 23.35 × × on a 28-core machine.
No takes yet. Share an insight, caveat, or question.
Brown et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: