Faster Coroutine Pipelines
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2025
- Type
- D - Journal article
- DOI
-
10.1145/3110249
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- -
- First page
- 1
- Volume
- 1
- Issue
- ICFP
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Coroutine pipelines provide an attractive structuring mechanism for complex functional programs that process streams of data, with the advantage over lazy streams that both ends of a pipeline may interact with the I/O system, as may processes in the middle. Two popular Haskell libraries support such pipelines, but both suffer from a slow-down when processes are deeply nested in sequence or in parallel. This journal-version ICFP paper proposes an alternative implementation of pipelines that does not suffer from this slow-down, and achieves performance comparable with lazy streams. It directly inspired follow-on work in PADL�19, �Faster Coroutine Pipelines: A Reconstruction� (https://doi.org/10.1007/978-3-030-05998-9_9).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -