Principles of a reversible programming language

Tetsuo Yokoyama; Holger Bock Axelsen; Robert Glück

doi:10.1145/1366230.1366239

Principles of a reversible programming language

Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück

Datalogisk Institut

79 Citationer (Scopus)

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.

Originalsprog	Engelsk
Titel	Conference on Computing Frontiers, CF 2008 : Proceedings of the 2008 Conference on Computing Frontiers, Ischia, Italy May 5-7, 2008
Forlag	Association for Computing Machinery
Publikationsdato	2008
Sider	43-54
ISBN (Trykt)	9781605580777
DOI	https://doi.org/10.1145/1366230.1366239
Status	Udgivet - 2008
Begivenhed	Conference on Computing Frontiers - Ischia, Italien Varighed: 5 maj 2008 → 7 maj 2008

Konference

Konference	Conference on Computing Frontiers
Land/Område	Italien
By	Ischia
Periode	05/05/2008 → 07/05/2008

Adgang til dokumentet

10.1145/1366230.1366239

Citationsformater

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. s. 43-54.

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

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

@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; Conference on Computing Frontiers ; 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",

}

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

T2 - Conference on Computing Frontiers

Y2 - 5 May 2008 through 7 May 2008

ER -

Principles of a reversible programming language

Abstract

Konference

Adgang til dokumentet

Fingeraftryk

Citationsformater