Principles of a reversible programming language

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

Standard

Principles of a reversible programming language. / Yokoyama, Tetsuo; Axelsen, Holger Bock; Glück, Robert.

Conference on Computing Frontiers, CF 2008: Proceedings of the 2008 Conference on Computing Frontiers, Ischia, Italy May 5-7, 2008. Association for Computing Machinery, 2008. p. 43-54.

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

Harvard

Yokoyama, T, Axelsen, HB & Glück, R 2008, Principles of a reversible programming language. in Conference on Computing Frontiers, CF 2008: Proceedings of the 2008 Conference on Computing Frontiers, Ischia, Italy May 5-7, 2008. Association for Computing Machinery, pp. 43-54, Conference on Computing Frontiers, Ischia, Italy, 05/05/2008. https://doi.org/10.1145/1366230.1366239

APA

Yokoyama, T., Axelsen, H. B., & Glück, R. (2008). Principles of a reversible programming language. In Conference on Computing Frontiers, CF 2008: Proceedings of the 2008 Conference on Computing Frontiers, Ischia, Italy May 5-7, 2008 (pp. 43-54). Association for Computing Machinery. https://doi.org/10.1145/1366230.1366239

Vancouver

Yokoyama T, Axelsen HB, Glück R. Principles of a reversible programming language. In Conference on Computing Frontiers, CF 2008: Proceedings of the 2008 Conference on Computing Frontiers, Ischia, Italy May 5-7, 2008. Association for Computing Machinery. 2008. p. 43-54 https://doi.org/10.1145/1366230.1366239

Author

Yokoyama, Tetsuo ; Axelsen, Holger Bock ; Glück, Robert. / Principles of a reversible programming language. Conference on Computing Frontiers, CF 2008: Proceedings of the 2008 Conference on Computing Frontiers, Ischia, Italy May 5-7, 2008. Association for Computing Machinery, 2008. pp. 43-54

Bibtex

@inproceedings{6218f9308ffb11dd86a6000ea68e967b,
title = "Principles of a reversible programming language",
abstract = "The principles of reversible programming languages are explicated and illustrated with reference to the design of a high-level imperative language, Janus. The fundamental properties for such languages include backward as well as forward determinism and reversible updates of data. The unique design features of the language include explicit post-condition assertions, direct access to an inverse semantics and the possibility of clean (i.e., garbage-free) computation of injective functions. We suggest the clean simulation of reversible Turing machines as a criterion for computing strength of reversible languages, and demonstrate this for Janus. We show the practicality of the language by implementation of a reversible fast Fourier transform. Our results indicate that the reversible programming paradigm has fundamental properties that are relevant to many different areas of computer science.",
author = "Tetsuo Yokoyama and Axelsen, {Holger Bock} and Robert Gl{\"u}ck",
note = "ACM, http://doi.acm.org/10.1145/1366230.1366239; null ; Conference date: 05-05-2008 Through 07-05-2008",
year = "2008",
doi = "10.1145/1366230.1366239",
language = "English",
isbn = "9781605580777",
pages = "43--54",
booktitle = "Conference on Computing Frontiers, CF 2008",
publisher = "Association for Computing Machinery",

}

RIS

TY - GEN

T1 - Principles of a reversible programming language

AU - Yokoyama, Tetsuo

AU - Axelsen, Holger Bock

AU - Glück, Robert

N1 - ACM, http://doi.acm.org/10.1145/1366230.1366239

PY - 2008

Y1 - 2008

N2 - The principles of reversible programming languages are explicated and illustrated with reference to the design of a high-level imperative language, Janus. The fundamental properties for such languages include backward as well as forward determinism and reversible updates of data. The unique design features of the language include explicit post-condition assertions, direct access to an inverse semantics and the possibility of clean (i.e., garbage-free) computation of injective functions. We suggest the clean simulation of reversible Turing machines as a criterion for computing strength of reversible languages, and demonstrate this for Janus. We show the practicality of the language by implementation of a reversible fast Fourier transform. Our results indicate that the reversible programming paradigm has fundamental properties that are relevant to many different areas of computer science.

AB - The principles of reversible programming languages are explicated and illustrated with reference to the design of a high-level imperative language, Janus. The fundamental properties for such languages include backward as well as forward determinism and reversible updates of data. The unique design features of the language include explicit post-condition assertions, direct access to an inverse semantics and the possibility of clean (i.e., garbage-free) computation of injective functions. We suggest the clean simulation of reversible Turing machines as a criterion for computing strength of reversible languages, and demonstrate this for Janus. We show the practicality of the language by implementation of a reversible fast Fourier transform. Our results indicate that the reversible programming paradigm has fundamental properties that are relevant to many different areas of computer science.

U2 - 10.1145/1366230.1366239

DO - 10.1145/1366230.1366239

M3 - Article in proceedings

SN - 9781605580777

SP - 43

EP - 54

BT - Conference on Computing Frontiers, CF 2008

PB - Association for Computing Machinery

Y2 - 5 May 2008 through 7 May 2008

ER -

ID: 6363146