Partial Evaluation of Reversible Flowchart Programs
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Standard
Partial Evaluation of Reversible Flowchart Programs. / Normann, Louis Marott; Glück, Robert.
PEPM 2024 - Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation. red. / Gabriele Keller; Meng Wang. Association for Computing Machinery, 2024. s. 119-133.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Partial Evaluation of Reversible Flowchart Programs
AU - Normann, Louis Marott
AU - Glück, Robert
N1 - Publisher Copyright: © 2024 ACM.
PY - 2024
Y1 - 2024
N2 - Flowchart languages are traditionally used to study the foundations of partial evaluation. This article presents a systematic and formal development of a method for partial evaluation of a reversible flowchart language. The results confirm that partial evaluation in this unconventional computing paradigm shows effects consistent with traditional partial evaluation. Experiments include specializing a symmetric encryption algorithm and a reversible interpreter for Bennett's reversible Turing machines. A defining feature of reversible languages is their invertibility. This study reports the first experiments composing program inversion and partial evaluation. The presented method is fully implemented. It is potentially of interest because reversible computing has found applications in areas as diverse as low-power computing, debugging, robotics, and quantum-inspired computing.
AB - Flowchart languages are traditionally used to study the foundations of partial evaluation. This article presents a systematic and formal development of a method for partial evaluation of a reversible flowchart language. The results confirm that partial evaluation in this unconventional computing paradigm shows effects consistent with traditional partial evaluation. Experiments include specializing a symmetric encryption algorithm and a reversible interpreter for Bennett's reversible Turing machines. A defining feature of reversible languages is their invertibility. This study reports the first experiments composing program inversion and partial evaluation. The presented method is fully implemented. It is potentially of interest because reversible computing has found applications in areas as diverse as low-power computing, debugging, robotics, and quantum-inspired computing.
KW - Flowchart Languages
KW - Partial Evaluation
KW - Program Inversion
KW - Program Transformations
KW - Reversible Computing
U2 - 10.1145/3635800.3636967
DO - 10.1145/3635800.3636967
M3 - Article in proceedings
AN - SCOPUS:85182919419
SP - 119
EP - 133
BT - PEPM 2024 - Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation
A2 - Keller, Gabriele
A2 - Wang, Meng
PB - Association for Computing Machinery
T2 - 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, PEPM 2024, in affiliation with the annual Symposium on Principles of Programming Languages, POPL 2024
Y2 - 16 January 2024
ER -
ID: 390400066