Reversible Functional Array Programming

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

Reversible Functional Array Programming. / Mogensen, Torben Ægidius.

Reversible Computation 13th International - 13th International Conference, RC 2021, Proceedings. ed. / Shigeru Yamashita; Tetsuo Yokoyama. Springer, 2021. p. 45-63 (Lecture Notes in Computer Science, Vol. 12805 ).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Mogensen, TÆ 2021, Reversible Functional Array Programming. in S Yamashita & T Yokoyama (eds), Reversible Computation 13th International - 13th International Conference, RC 2021, Proceedings. Springer, Lecture Notes in Computer Science, vol. 12805 , pp. 45-63, 13th International Conference on Reversible Computation, RC 2021, Virtual, Online, 07/07/2021. https://doi.org/10.1007/978-3-030-79837-6_3

APA

Mogensen, T. Æ. (2021). Reversible Functional Array Programming. In S. Yamashita, & T. Yokoyama (Eds.), Reversible Computation 13th International - 13th International Conference, RC 2021, Proceedings (pp. 45-63). Springer. Lecture Notes in Computer Science Vol. 12805 https://doi.org/10.1007/978-3-030-79837-6_3

Vancouver

Mogensen TÆ. Reversible Functional Array Programming. In Yamashita S, Yokoyama T, editors, Reversible Computation 13th International - 13th International Conference, RC 2021, Proceedings. Springer. 2021. p. 45-63. (Lecture Notes in Computer Science, Vol. 12805 ). https://doi.org/10.1007/978-3-030-79837-6_3

Author

Mogensen, Torben Ægidius. / Reversible Functional Array Programming. Reversible Computation 13th International - 13th International Conference, RC 2021, Proceedings. editor / Shigeru Yamashita ; Tetsuo Yokoyama. Springer, 2021. pp. 45-63 (Lecture Notes in Computer Science, Vol. 12805 ).

Bibtex

@inproceedings{0aca6a64b3e54ce5932f936c7540adf7,
title = "Reversible Functional Array Programming",
abstract = "Functional array programming is a style of programming that enables massive parallelism through use of combinators (such as map and reduce) that apply functions to whole arrays. These can be readily parallelised when the functions these combinators are applied to are pure and, in some cases, also associative. We introduce reversible variants of well-known array combinators and show how these can be implemented in parallel using only reversible operations and without accumulating garbage. We introduce a simple reversible functional array programming language, Agni, and show some examples of use.",
author = "Mogensen, {Torben {\AE}gidius}",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 13th International Conference on Reversible Computation, RC 2021 ; Conference date: 07-07-2021 Through 08-07-2021",
year = "2021",
doi = "10.1007/978-3-030-79837-6_3",
language = "English",
isbn = "9783030798369",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "45--63",
editor = "Shigeru Yamashita and Tetsuo Yokoyama",
booktitle = "Reversible Computation 13th International - 13th International Conference, RC 2021, Proceedings",
address = "Switzerland",

}

RIS

TY - GEN

T1 - Reversible Functional Array Programming

AU - Mogensen, Torben Ægidius

N1 - Publisher Copyright: © 2021, Springer Nature Switzerland AG.

PY - 2021

Y1 - 2021

N2 - Functional array programming is a style of programming that enables massive parallelism through use of combinators (such as map and reduce) that apply functions to whole arrays. These can be readily parallelised when the functions these combinators are applied to are pure and, in some cases, also associative. We introduce reversible variants of well-known array combinators and show how these can be implemented in parallel using only reversible operations and without accumulating garbage. We introduce a simple reversible functional array programming language, Agni, and show some examples of use.

AB - Functional array programming is a style of programming that enables massive parallelism through use of combinators (such as map and reduce) that apply functions to whole arrays. These can be readily parallelised when the functions these combinators are applied to are pure and, in some cases, also associative. We introduce reversible variants of well-known array combinators and show how these can be implemented in parallel using only reversible operations and without accumulating garbage. We introduce a simple reversible functional array programming language, Agni, and show some examples of use.

U2 - 10.1007/978-3-030-79837-6_3

DO - 10.1007/978-3-030-79837-6_3

M3 - Article in proceedings

AN - SCOPUS:85112002310

SN - 9783030798369

T3 - Lecture Notes in Computer Science

SP - 45

EP - 63

BT - Reversible Computation 13th International - 13th International Conference, RC 2021, Proceedings

A2 - Yamashita, Shigeru

A2 - Yokoyama, Tetsuo

PB - Springer

T2 - 13th International Conference on Reversible Computation, RC 2021

Y2 - 7 July 2021 through 8 July 2021

ER -

ID: 306679766